%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SET016-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu May 9 17:38:50 EDT 2024
% Result : Unsatisfiable 1.18s 1.45s
% Output : Refutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of clauses : 33 ( 16 unt; 6 nHn; 26 RR)
% Number of literals : 58 ( 40 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_first_components_equal,negated_conjecture,
m1 != m2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_first_components_equal) ).
cnf(symmetry,axiom,
( X12 != X11
| X11 = X12 ),
theory(equality) ).
cnf(singleton_2,axiom,
( ~ member(X9,singleton_set(X8))
| X9 = X8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_2) ).
cnf(reflexivity,axiom,
X2 = X2,
theory(equality) ).
cnf(singleton_1,axiom,
member(X3,singleton_set(X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_1) ).
cnf(c3,axiom,
( X51 != X50
| X49 != X48
| ~ member(X51,X49)
| member(X50,X48) ),
theory(equality) ).
cnf(c40,plain,
( X56 != X58
| singleton_set(X56) != X57
| member(X58,X57) ),
inference(resolution,[status(thm)],[c3,singleton_1]) ).
cnf(unordered_pair_1,axiom,
member(X5,unordered_pair(X5,X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_1) ).
cnf(c41,plain,
( X92 != X89
| unordered_pair(X92,X91) != X90
| member(X89,X90) ),
inference(resolution,[status(thm)],[c3,unordered_pair_1]) ).
cnf(unordered_pair_3,axiom,
( ~ member(X19,unordered_pair(X18,X20))
| X19 = X18
| X19 = X20 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_3) ).
cnf(ordered_pair,axiom,
ordered_pair(X31,X30) = unordered_pair(singleton_set(X31),unordered_pair(X31,X30)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair) ).
cnf(c12,plain,
unordered_pair(singleton_set(X32),unordered_pair(X32,X33)) = ordered_pair(X32,X33),
inference(resolution,[status(thm)],[ordered_pair,symmetry]) ).
cnf(c90,plain,
( singleton_set(X98) != X100
| member(X100,ordered_pair(X98,X99)) ),
inference(resolution,[status(thm)],[c41,c12]) ).
cnf(c112,plain,
member(singleton_set(X101),ordered_pair(X101,X102)),
inference(resolution,[status(thm)],[c90,reflexivity]) ).
cnf(c114,plain,
( singleton_set(X123) != X126
| ordered_pair(X123,X124) != X125
| member(X126,X125) ),
inference(resolution,[status(thm)],[c112,c3]) ).
cnf(equal_ordered_pairs,plain,
ordered_pair(m1,r1) = ordered_pair(m2,r2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_ordered_pairs) ).
cnf(c15,plain,
ordered_pair(m2,r2) = ordered_pair(m1,r1),
inference(resolution,[status(thm)],[equal_ordered_pairs,symmetry]) ).
cnf(transitivity,axiom,
( X15 != X14
| X14 != X16
| X15 = X16 ),
theory(equality) ).
cnf(c13,plain,
( X81 != ordered_pair(X82,X83)
| X81 = unordered_pair(singleton_set(X82),unordered_pair(X82,X83)) ),
inference(resolution,[status(thm)],[ordered_pair,transitivity]) ).
cnf(c83,plain,
ordered_pair(m2,r2) = unordered_pair(singleton_set(m1),unordered_pair(m1,r1)),
inference(resolution,[status(thm)],[c13,c15]) ).
cnf(c335,plain,
( singleton_set(m2) != X455
| member(X455,unordered_pair(singleton_set(m1),unordered_pair(m1,r1))) ),
inference(resolution,[status(thm)],[c83,c114]) ).
cnf(c1484,plain,
member(singleton_set(m2),unordered_pair(singleton_set(m1),unordered_pair(m1,r1))),
inference(resolution,[status(thm)],[c335,reflexivity]) ).
cnf(c1485,plain,
( singleton_set(m2) = singleton_set(m1)
| singleton_set(m2) = unordered_pair(m1,r1) ),
inference(resolution,[status(thm)],[c1484,unordered_pair_3]) ).
cnf(c1948,plain,
( singleton_set(m2) = singleton_set(m1)
| unordered_pair(m1,r1) = singleton_set(m2) ),
inference(resolution,[status(thm)],[c1485,symmetry]) ).
cnf(c2168,plain,
( singleton_set(m2) = singleton_set(m1)
| m1 != X620
| member(X620,singleton_set(m2)) ),
inference(resolution,[status(thm)],[c1948,c41]) ).
cnf(c2401,plain,
( singleton_set(m2) = singleton_set(m1)
| member(m1,singleton_set(m2)) ),
inference(resolution,[status(thm)],[c2168,reflexivity]) ).
cnf(c2432,plain,
( singleton_set(m2) = singleton_set(m1)
| m1 = m2 ),
inference(resolution,[status(thm)],[c2401,singleton_2]) ).
cnf(c2490,plain,
singleton_set(m2) = singleton_set(m1),
inference(resolution,[status(thm)],[c2432,prove_first_components_equal]) ).
cnf(c2527,plain,
( m2 != X629
| member(X629,singleton_set(m1)) ),
inference(resolution,[status(thm)],[c2490,c40]) ).
cnf(c2645,plain,
member(m2,singleton_set(m1)),
inference(resolution,[status(thm)],[c2527,reflexivity]) ).
cnf(c2646,plain,
m2 = m1,
inference(resolution,[status(thm)],[c2645,singleton_2]) ).
cnf(c2665,plain,
m1 = m2,
inference(resolution,[status(thm)],[c2646,symmetry]) ).
cnf(c2702,plain,
$false,
inference(resolution,[status(thm)],[c2665,prove_first_components_equal]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET016-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.36 % Computer : n022.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed May 8 19:04:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 1.18/1.45 % Version: 1.5
% 1.18/1.45 % SZS status Unsatisfiable
% 1.18/1.45 % SZS output start CNFRefutation
% See solution above
% 1.18/1.45
% 1.18/1.45 % Initial clauses : 15
% 1.18/1.45 % Processed clauses : 218
% 1.18/1.45 % Factors computed : 3
% 1.18/1.45 % Resolvents computed: 2697
% 1.18/1.45 % Tautologies deleted: 2
% 1.18/1.45 % Forward subsumed : 192
% 1.18/1.45 % Backward subsumed : 12
% 1.18/1.45 % -------- CPU Time ---------
% 1.18/1.45 % User time : 1.044 s
% 1.18/1.45 % System time : 0.015 s
% 1.18/1.45 % Total time : 1.059 s
%------------------------------------------------------------------------------