%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET024-7 : TPTP v9.3.1. Bugfixed v2.1.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 : n006.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:55:58 AM UTC 2026
% Result : Unsatisfiable 32.34s 37.69s
% Output : Proof 32.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 13 unt; 0 nHn; 14 RR)
% Number of literals : 25 ( 8 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair3,axiom,
( member(Y,unordered_pair(X,Y))
| ~ member(Y,universal_class) ),
file('SET004-0.ax',unordered_pair3) ).
cnf(singleton_set,axiom,
unordered_pair(X,X) = singleton(X),
file('SET004-0.ax',singleton_set) ).
cnf(prove_set_in_its_singleton_1,negated_conjecture,
member(x,universal_class),
file('theBenchmark.p',prove_set_in_its_singleton_1) ).
cnf(prove_set_in_its_singleton_2,negated_conjecture,
~ member(x,singleton(x)),
file('theBenchmark.p',prove_set_in_its_singleton_2) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_35,axiom,
( member(Eq_y_0,Eq_y_1)
| ~ member(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
member(x,universal_class),
inference(start,[status(thm),parent(0:0)],[prove_set_in_its_singleton_1]) ).
cnf(t2,plain,
( member(x,unordered_pair(x,x))
| ~ member(x,universal_class) ),
inference(extension,[status(thm),parent(t1:1)],[unordered_pair3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( unordered_pair(x,x) != singleton(x)
| member(x,singleton(x))
| x != x
| ~ member(x,unordered_pair(x,x)) ),
inference(extension,[status(thm),parent(t2:2)],[equality_35]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
x = x,
inference(extension,[status(thm),parent(t4:2)],[equality_1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
~ member(x,singleton(x)),
inference(extension,[status(thm),parent(t4:3)],[prove_set_in_its_singleton_2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
unordered_pair(x,x) = singleton(x),
inference(extension,[status(thm),parent(t4:4)],[singleton_set]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t4:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET024-7 : TPTP v9.3.1. Bugfixed v2.1.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.10/5.36 % Computer : n006.cluster.edu
% 0.10/5.36 % Model : x86_64 x86_64
% 0.10/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.36 % Memory : 8046.5625MB
% 0.10/5.36 % OS : Linux 6.8.0-71-generic
% 0.10/5.36 % CPULimit : 300
% 0.10/5.36 % WCLimit : 300
% 0.10/5.36 % DateTime : Sat Sep 19 21:28:06 UTC 2026
% 0.10/5.37 % CPUTime :
% 32.34/37.69 % SZS status Unsatisfiable for theBenchmark
% 32.34/37.69 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------