%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET875+1 : TPTP v9.3.1. Released v3.2.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:57:43 AM UTC 2026
% Result : Theorem 0.13s 0.39s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 93 ( 47 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 104 ( 41 ~; 33 |; 28 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 37 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
! [A,B] :
( B = singleton(A)
<=> ! [C] :
( in(C,B)
<=> C = A ) ),
file('theBenchmark.p',d1_tarski) ).
fof(l25_zfmisc_1,axiom,
! [A,B] :
~ ( in(A,B)
& disjoint(singleton(A),B) ),
file('theBenchmark.p',l25_zfmisc_1) ).
fof(t16_zfmisc_1,conjecture,
! [A,B] :
~ ( A = B
& disjoint(singleton(A),singleton(B)) ),
file('theBenchmark.p',t16_zfmisc_1) ).
fof(f_2_1,plain,
! [A,B] :
( ( B = singleton(A)
| ? [C] :
( ( ~ in(C,B)
& C = A )
| ( C != A
& in(C,B) ) ) )
& ( ! [C] :
( ( in(C,B)
| C != A )
& ( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(fof_nnf,[status(thm)],[d1_tarski]) ).
fof(f_2_2,plain,
! [U_5,U_4] :
( ( U_4 = singleton(U_5)
| ? [U_3] :
( ( ~ in(U_3,U_4)
& U_3 = U_5 )
| ( U_3 != U_5
& in(U_3,U_4) ) ) )
& ( ! [U_2] :
( ( in(U_2,U_4)
| U_2 != U_5 )
& ( U_2 = U_5
| ~ in(U_2,U_4) ) )
| U_4 != singleton(U_5) ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_13,U_11] :
( U_11 = singleton(U_13)
| ? [U_9] :
( ~ in(U_9,U_11)
& U_9 = U_13 )
| ? [U_8] :
( U_8 != U_13
& in(U_8,U_11) ) )
& ! [U_12,U_10] :
( ( ! [U_7] :
( in(U_7,U_10)
| U_7 != U_12 )
& ! [U_6] :
( U_6 = U_12
| ~ in(U_6,U_10) ) )
| U_10 != singleton(U_12) ) ),
inference(miniscope,[status(thm)],[f_2_2]) ).
fof(f_2_4,plain,
( ! [U_13,U_11] :
( U_11 = singleton(U_13)
| ? [U_9] :
( ~ in(U_9,U_11)
& U_9 = U_13 )
| ( sK1(U_13,U_11) != U_13
& in(sK1(U_13,U_11),U_11) ) )
& ! [U_12,U_10] :
( ( ! [U_7] :
( in(U_7,U_10)
| U_7 != U_12 )
& ! [U_6] :
( U_6 = U_12
| ~ in(U_6,U_10) ) )
| U_10 != singleton(U_12) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_8,sK1(U_13,U_11))],[f_2_3]) ).
fof(f_2_5,plain,
( ! [U_13,U_11] :
( U_11 = singleton(U_13)
| ( ~ in(sK2(U_13,U_11),U_11)
& sK2(U_13,U_11) = U_13 )
| ( sK1(U_13,U_11) != U_13
& in(sK1(U_13,U_11),U_11) ) )
& ! [U_12,U_10] :
( ( ! [U_7] :
( in(U_7,U_10)
| U_7 != U_12 )
& ! [U_6] :
( U_6 = U_12
| ~ in(U_6,U_10) ) )
| U_10 != singleton(U_12) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_9,sK2(U_13,U_11))],[f_2_4]) ).
cnf(f_2_7,plain,
( in(U_7,U_10)
| U_7 != U_12
| U_10 != singleton(U_12) ),
inference(clausify,[status(thm)],[f_2_5]) ).
fof(f_3_1,plain,
! [A,B] :
( ~ in(A,B)
| ~ disjoint(singleton(A),B) ),
inference(fof_nnf,[status(thm)],[l25_zfmisc_1]) ).
fof(f_3_2,plain,
! [U_15,U_14] :
( ~ in(U_15,U_14)
| ~ disjoint(singleton(U_15),U_14) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( ~ in(U_15,U_14)
| ~ disjoint(singleton(U_15),U_14) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_7_1,negated_conjecture,
~ ! [A,B] :
~ ( A = B
& disjoint(singleton(A),singleton(B)) ),
inference(negate,[status(cth)],[t16_zfmisc_1]) ).
fof(f_7_2,negated_conjecture,
? [A,B] :
( A = B
& disjoint(singleton(A),singleton(B)) ),
inference(fof_nnf,[status(thm)],[f_7_1]) ).
fof(f_7_3,negated_conjecture,
? [U_21,U_20] :
( U_21 = U_20
& disjoint(singleton(U_21),singleton(U_20)) ),
inference(variable_rename,[status(thm)],[f_7_2]) ).
fof(f_7_4,negated_conjecture,
? [U_20] :
( sK5 = U_20
& disjoint(singleton(sK5),singleton(U_20)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_21,sK5)],[f_7_3]) ).
fof(f_7_5,negated_conjecture,
( sK5 = sK6
& disjoint(singleton(sK5),singleton(sK6)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_20,sK6)],[f_7_4]) ).
fof(f_7_6,negated_conjecture,
( sK5 = sK6
& disjoint(singleton(sK5),singleton(sK6)) ),
inference(definitional_conversion,[status(esa)],[f_7_5]) ).
cnf(f_7_7,negated_conjecture,
disjoint(singleton(sK5),singleton(sK6)),
inference(clausify,[status(thm)],[f_7_6]) ).
cnf(f_7_8,negated_conjecture,
sK5 = sK6,
inference(clausify,[status(thm)],[f_7_6]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(t1,plain,
( ~ in(sK5,singleton(sK6))
| ~ disjoint(singleton(sK5),singleton(sK6)) ),
inference(start,[status(thm),parent(0:0)],[f_3_3]) ).
cnf(t2,plain,
disjoint(singleton(sK5),singleton(sK6)),
inference(extension,[status(thm),parent(t1:1)],[f_7_7]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( sK5 != sK6
| singleton(sK6) != singleton(sK6)
| in(sK5,singleton(sK6)) ),
inference(extension,[status(thm),parent(t1:2)],[f_2_7]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
cnf(t6,plain,
singleton(sK6) = singleton(sK6),
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,
sK5 = sK6,
inference(extension,[status(thm),parent(t4:3)],[f_7_8]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET875+1 : TPTP v9.3.1. Released v3.2.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.09/0.35 % Computer : n006.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 19 23:05:58 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------