%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU153+2 : TPTP v9.3.1. Released v3.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 : n001.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:58:14 AM UTC 2026
% Result : Theorem 36.36s 36.63s
% Output : Proof 36.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 15 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 99 ( 40 ~; 31 |; 27 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 3 sgn 54 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l25_zfmisc_1,conjecture,
! [A,B] :
~ ( in(A,B)
& disjoint(singleton(A),B) ),
file('theBenchmark.p',l25_zfmisc_1) ).
fof(l2_zfmisc_1,lemma,
! [A,B] :
( subset(singleton(A),B)
<=> in(A,B) ),
file('theBenchmark.p',l2_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A),
file('theBenchmark.p',reflexivity_r1_tarski) ).
fof(t3_xboole_0,lemma,
! [A,B] :
( ~ ( disjoint(A,B)
& ? [C] :
( in(C,B)
& in(C,A) ) )
& ~ ( ! [C] :
~ ( in(C,B)
& in(C,A) )
& ~ disjoint(A,B) ) ),
file('theBenchmark.p',t3_xboole_0) ).
fof(f_32_1,negated_conjecture,
~ ! [A,B] :
~ ( in(A,B)
& disjoint(singleton(A),B) ),
inference(negate,[status(cth)],[l25_zfmisc_1]) ).
fof(f_32_2,negated_conjecture,
? [A,B] :
( in(A,B)
& disjoint(singleton(A),B) ),
inference(fof_nnf,[status(thm)],[f_32_1]) ).
fof(f_32_3,negated_conjecture,
? [U_139,U_138] :
( in(U_139,U_138)
& disjoint(singleton(U_139),U_138) ),
inference(variable_rename,[status(thm)],[f_32_2]) ).
fof(f_32_4,negated_conjecture,
? [U_138] :
( in(sK15,U_138)
& disjoint(singleton(sK15),U_138) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15]),skolemize(U_139,sK15)],[f_32_3]) ).
fof(f_32_5,negated_conjecture,
( in(sK15,sK16)
& disjoint(singleton(sK15),sK16) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16]),skolemize(U_138,sK16)],[f_32_4]) ).
fof(f_32_6,negated_conjecture,
( in(sK15,sK16)
& disjoint(singleton(sK15),sK16) ),
inference(definitional_conversion,[status(esa)],[f_32_5]) ).
cnf(f_32_7,negated_conjecture,
disjoint(singleton(sK15),sK16),
inference(clausify,[status(thm)],[f_32_6]) ).
cnf(f_32_8,negated_conjecture,
in(sK15,sK16),
inference(clausify,[status(thm)],[f_32_6]) ).
fof(f_33_1,plain,
! [A,B] :
( ( subset(singleton(A),B)
| ~ in(A,B) )
& ( in(A,B)
| ~ subset(singleton(A),B) ) ),
inference(fof_nnf,[status(thm)],[l2_zfmisc_1]) ).
fof(f_33_2,plain,
! [U_141,U_140] :
( ( subset(singleton(U_141),U_140)
| ~ in(U_141,U_140) )
& ( in(U_141,U_140)
| ~ subset(singleton(U_141),U_140) ) ),
inference(variable_rename,[status(thm)],[f_33_1]) ).
fof(f_33_3,plain,
( ! [U_145,U_143] :
( subset(singleton(U_145),U_143)
| ~ in(U_145,U_143) )
& ! [U_144,U_142] :
( in(U_144,U_142)
| ~ subset(singleton(U_144),U_142) ) ),
inference(miniscope,[status(thm)],[f_33_2]) ).
fof(f_33_4,plain,
( ! [U_143,U_145] :
( subset(singleton(U_145),U_143)
| ~ in(U_145,U_143) )
& ! [U_142,U_144] :
( in(U_144,U_142)
| ~ subset(singleton(U_144),U_142) ) ),
inference(definitional_conversion,[status(esa)],[f_33_3]) ).
cnf(f_33_5,plain,
( in(U_144,U_142)
| ~ subset(singleton(U_144),U_142) ),
inference(clausify,[status(thm)],[f_33_4]) ).
fof(f_39_1,plain,
! [A,B] : subset(A,A),
inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).
fof(f_39_2,plain,
! [U_164,U_163] : subset(U_164,U_164),
inference(variable_rename,[status(thm)],[f_39_1]) ).
fof(f_39_3,plain,
! [U_164] : subset(U_164,U_164),
inference(miniscope,[status(thm)],[f_39_2]) ).
fof(f_39_4,plain,
! [U_164] : subset(U_164,U_164),
inference(definitional_conversion,[status(esa)],[f_39_3]) ).
cnf(f_39_5,plain,
subset(U_164,U_164),
inference(clausify,[status(thm)],[f_39_4]) ).
fof(f_58_1,plain,
! [A,B] :
( ( ~ disjoint(A,B)
| ! [C] :
( ~ in(C,B)
| ~ in(C,A) ) )
& ( ? [C] :
( in(C,B)
& in(C,A) )
| disjoint(A,B) ) ),
inference(fof_nnf,[status(thm)],[t3_xboole_0]) ).
fof(f_58_2,plain,
! [U_211,U_210] :
( ( ~ disjoint(U_211,U_210)
| ! [U_209] :
( ~ in(U_209,U_210)
| ~ in(U_209,U_211) ) )
& ( ? [U_208] :
( in(U_208,U_210)
& in(U_208,U_211) )
| disjoint(U_211,U_210) ) ),
inference(variable_rename,[status(thm)],[f_58_1]) ).
fof(f_58_3,plain,
( ! [U_215,U_213] :
( ~ disjoint(U_215,U_213)
| ! [U_209] :
( ~ in(U_209,U_213)
| ~ in(U_209,U_215) ) )
& ! [U_214,U_212] :
( ? [U_208] :
( in(U_208,U_212)
& in(U_208,U_214) )
| disjoint(U_214,U_212) ) ),
inference(miniscope,[status(thm)],[f_58_2]) ).
fof(f_58_4,plain,
( ! [U_215,U_213] :
( ~ disjoint(U_215,U_213)
| ! [U_209] :
( ~ in(U_209,U_213)
| ~ in(U_209,U_215) ) )
& ! [U_214,U_212] :
( ( in(sK21(U_214,U_212),U_212)
& in(sK21(U_214,U_212),U_214) )
| disjoint(U_214,U_212) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21]),skolemize(U_208,sK21(U_214,U_212))],[f_58_3]) ).
fof(f_58_5,plain,
( ! [U_212,U_214] :
( in(sK21(U_214,U_212),U_212)
| ~ sP28(U_212,U_214) )
& ! [U_212,U_214] :
( in(sK21(U_214,U_212),U_214)
| ~ sP28(U_212,U_214) )
& ! [U_215,U_209,U_213] :
( ~ disjoint(U_215,U_213)
| ~ in(U_209,U_213)
| ~ in(U_209,U_215) )
& ! [U_212,U_214] :
( sP28(U_212,U_214)
| disjoint(U_214,U_212) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP28])],[f_58_4]) ).
cnf(f_58_7,plain,
( ~ disjoint(U_215,U_213)
| ~ in(U_209,U_213)
| ~ in(U_209,U_215) ),
inference(clausify,[status(thm)],[f_58_5]) ).
cnf(t1,plain,
disjoint(singleton(sK15),sK16),
inference(start,[status(thm),parent(0:0)],[f_32_7]) ).
cnf(t2,plain,
( ~ in(sK15,sK16)
| ~ in(sK15,singleton(sK15))
| ~ disjoint(singleton(sK15),sK16) ),
inference(extension,[status(thm),parent(t1:1)],[f_58_7]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ subset(singleton(sK15),singleton(sK15))
| in(sK15,singleton(sK15)) ),
inference(extension,[status(thm),parent(t2:2)],[f_33_5]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
subset(singleton(sK15),singleton(sK15)),
inference(extension,[status(thm),parent(t4:2)],[f_39_5]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
in(sK15,sK16),
inference(extension,[status(thm),parent(t2:3)],[f_32_8]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU153+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ 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/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 19 23:28:55 UTC 2026
% 0.10/0.37 % CPUTime :
% 36.36/36.63 % SZS status Theorem for theBenchmark
% 36.36/36.63 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------