1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
%--------------------------------------------------------------------------
% File : SWC078-1 : TPTP v6.4.0. Released v2.4.0.
% Domain : Software Creation
% Problem : cond_id_segment_total2_x_some_total2
% Version : [Wei00] axioms.
% English : Find components in a software library that match a given target
% specification given in first-order logic. The components are
% specified in first-order logic as well. The problem represents
% a test of one library module specification against a target
% specification.
% Refs : [Wei00] Weidenbach (2000), Software Reuse of List Functions Ve
% : [FSS98] Fischer et al. (1998), Deduction-Based Software Compon
% Source : [TPTP]
% Names :
% Status : Unsatisfiable
% Rating : 0.73 v6.4.0, 0.67 v6.3.0, 0.64 v6.2.0, 0.80 v6.1.0, 0.86 v6.0.0, 0.80 v5.5.0, 0.90 v5.3.0, 0.89 v5.2.0, 0.88 v5.0.0, 0.86 v4.1.0, 0.92 v4.0.1, 0.82 v3.7.0, 0.80 v3.5.0, 0.82 v3.4.0, 0.83 v3.3.0, 0.79 v3.2.0, 0.85 v3.1.0, 0.91 v2.7.0, 0.83 v2.6.0, 1.00 v2.4.0
% Syntax : Number of clauses : 199 ( 39 non-Horn; 60 unit; 156 RR)
% Number of atoms : 628 ( 110 equality)
% Maximal clause size : 10 ( 3 average)
% Number of predicates : 20 ( 0 propositional; 1-2 arity)
% Number of functors : 54 ( 8 constant; 0-2 arity)
% Number of variables : 327 ( 49 singleton)
% Maximal term depth : 5 ( 1 average)
% SPC : CNF_UNS_RFO_SEQ_NHN
% Comments : Created by CNF conversion from SWC078+1
%--------------------------------------------------------------------------
%----Include list specification axioms
include('Axioms/SWC001-0.ax').
%--------------------------------------------------------------------------
cnf(co1_1,negated_conjecture,
( ssList(sk1) )).
cnf(co1_2,negated_conjecture,
( ssList(sk2) )).
cnf(co1_3,negated_conjecture,
( ssList(sk3) )).
cnf(co1_4,negated_conjecture,
( ssList(sk4) )).
cnf(co1_5,negated_conjecture,
( sk2 = sk4 )).
cnf(co1_6,negated_conjecture,
( sk1 = sk3 )).
cnf(co1_7,negated_conjecture,
( ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk2,A)
| ~ segmentP(sk1,A) )).
cnf(co1_8,negated_conjecture,
( nil != sk2
| nil != sk1 )).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk4 )).
cnf(co1_10,negated_conjecture,
( ssItem(sk5)
| nil = sk3 )).
cnf(co1_11,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 )).
cnf(co1_12,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk4 )).
cnf(co1_13,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 )).
cnf(co1_14,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 )).
%--------------------------------------------------------------------------
|
