%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET113-7 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 08:56:22 AM UTC 2026
% Result : Unsatisfiable 0.45s 0.79s
% Output : Proof 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 11 unt; 4 nHn; 14 RR)
% Number of literals : 25 ( 4 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 7 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(complement1,axiom,
( ~ member(Z,X)
| ~ member(Z,complement(X)) ),
file('SET004-0.ax',complement1) ).
cnf(complement2,axiom,
( member(Z,X)
| member(Z,complement(X))
| ~ member(Z,universal_class) ),
file('SET004-0.ax',complement2) ).
cnf(ordered_pair_is_set,axiom,
member(ordered_pair(X,Y),universal_class),
file('theBenchmark.p',ordered_pair_is_set) ).
cnf(existence_of_1st_and_2nd_2,axiom,
( first(X) = X
| member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class)) ),
file('theBenchmark.p',existence_of_1st_and_2nd_2) ).
cnf(prove_unique_1st_and_2nd_in_pair_of_non_sets1_1,negated_conjecture,
~ member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class)),
file('theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_non_sets1_1) ).
cnf(prove_unique_1st_in_pair_of_non_sets,negated_conjecture,
first(x) != x,
file('theBenchmark.p',prove_unique_1st_in_pair_of_non_sets) ).
cnf(t1,plain,
( ~ member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class))
| ~ member(ordered_pair(first(x),second(x)),complement(cross_product(universal_class,universal_class))) ),
inference(start,[status(thm),parent(0:0)],[complement1]) ).
cnf(t2,plain,
( member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class))
| ~ member(ordered_pair(first(x),second(x)),universal_class)
| member(ordered_pair(first(x),second(x)),complement(cross_product(universal_class,universal_class))) ),
inference(extension,[status(thm),parent(t1:1)],[complement2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
member(ordered_pair(first(x),second(x)),universal_class),
inference(extension,[status(thm),parent(t2:2)],[ordered_pair_is_set]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
~ member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class)),
inference(extension,[status(thm),parent(t2:3)],[prove_unique_1st_and_2nd_in_pair_of_non_sets1_1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
( first(x) = x
| member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class)) ),
inference(extension,[status(thm),parent(t1:2)],[existence_of_1st_and_2nd_2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t1:2]) ).
cnf(t10,plain,
first(x) != x,
inference(extension,[status(thm),parent(t8:2)],[prove_unique_1st_in_pair_of_non_sets]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET113-7 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n013.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 19 21:45:21 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.45/0.79 % SZS status Unsatisfiable for theBenchmark
% 0.45/0.79 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------