%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU123+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n016.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:06 AM UTC 2026
% Result : Theorem 0.12s 0.37s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 51 ( 17 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 47 ( 20 ~; 13 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 ( 1 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d10_xboole_0,axiom,
! [A,B] :
( A = B
<=> ( subset(B,A)
& subset(A,B) ) ),
file('theBenchmark.p',d10_xboole_0) ).
fof(t2_xboole_1,axiom,
! [A] : subset(empty_set,A),
file('theBenchmark.p',t2_xboole_1) ).
fof(t3_xboole_1,conjecture,
! [A] :
( subset(A,empty_set)
=> A = empty_set ),
file('theBenchmark.p',t3_xboole_1) ).
fof(f_2_1,plain,
! [A,B] :
( ( A = B
| ~ subset(B,A)
| ~ subset(A,B) )
& ( ( subset(B,A)
& subset(A,B) )
| A != B ) ),
inference(fof_nnf,[status(thm)],[d10_xboole_0]) ).
fof(f_2_2,plain,
! [U_3,U_2] :
( ( U_3 = U_2
| ~ subset(U_2,U_3)
| ~ subset(U_3,U_2) )
& ( ( subset(U_2,U_3)
& subset(U_3,U_2) )
| U_3 != U_2 ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_7,U_5] :
( U_7 = U_5
| ~ subset(U_5,U_7)
| ~ subset(U_7,U_5) )
& ! [U_6,U_4] :
( ( subset(U_4,U_6)
& subset(U_6,U_4) )
| U_6 != U_4 ) ),
inference(miniscope,[status(thm)],[f_2_2]) ).
cnf(f_2_6,plain,
( U_7 = U_5
| ~ subset(U_5,U_7)
| ~ subset(U_7,U_5) ),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_8_1,plain,
! [A] : subset(empty_set,A),
inference(fof_nnf,[status(thm)],[t2_xboole_1]) ).
fof(f_8_2,plain,
! [U_12] : subset(empty_set,U_12),
inference(variable_rename,[status(thm)],[f_8_1]) ).
cnf(f_8_3,plain,
subset(empty_set,U_12),
inference(clausify,[status(thm)],[f_8_2]) ).
fof(f_9_1,negated_conjecture,
~ ! [A] :
( subset(A,empty_set)
=> A = empty_set ),
inference(negate,[status(cth)],[t3_xboole_1]) ).
fof(f_9_2,negated_conjecture,
? [A] :
( A != empty_set
& subset(A,empty_set) ),
inference(fof_nnf,[status(thm)],[f_9_1]) ).
fof(f_9_3,negated_conjecture,
? [U_13] :
( U_13 != empty_set
& subset(U_13,empty_set) ),
inference(variable_rename,[status(thm)],[f_9_2]) ).
fof(f_9_4,negated_conjecture,
( sK3 != empty_set
& subset(sK3,empty_set) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_13,sK3)],[f_9_3]) ).
fof(f_9_5,negated_conjecture,
( sK3 != empty_set
& subset(sK3,empty_set) ),
inference(definitional_conversion,[status(esa)],[f_9_4]) ).
cnf(f_9_6,negated_conjecture,
subset(sK3,empty_set),
inference(clausify,[status(thm)],[f_9_5]) ).
cnf(f_9_7,negated_conjecture,
sK3 != empty_set,
inference(clausify,[status(thm)],[f_9_5]) ).
cnf(t1,plain,
sK3 != empty_set,
inference(start,[status(thm),parent(0:0)],[f_9_7]) ).
cnf(t2,plain,
( ~ subset(empty_set,sK3)
| ~ subset(sK3,empty_set)
| sK3 = empty_set ),
inference(extension,[status(thm),parent(t1:1)],[f_2_6]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
subset(sK3,empty_set),
inference(extension,[status(thm),parent(t2:2)],[f_9_6]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
subset(empty_set,sK3),
inference(extension,[status(thm),parent(t2:3)],[f_8_3]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU123+1 : 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/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n016.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 19 23:25:05 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------