%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SEU120+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n005.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 : Fri Sep 25 02:50:59 PM UTC 2026
% Result : Theorem 1.23s 6.31s
% Output : Proof 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 59 ( 16 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 65 ( 30 ~; 19 |; 14 &)
% ( 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 3 sgn 20 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,conjecture,
! [A,B] :
( ~ ( disjoint(A,B)
& ? [C] : in(C,set_intersection2(A,B)) )
& ~ ( ! [C] : ~ in(C,set_intersection2(A,B))
& ~ disjoint(A,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f11_neg,negated_conjecture,
~ ! [A,B] :
( ~ ( disjoint(A,B)
& ? [C] : in(C,set_intersection2(A,B)) )
& ~ ( ! [C] : ~ in(C,set_intersection2(A,B))
& ~ disjoint(A,B) ) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f11_nnf,plain,
? [A,B] :
( ( disjoint(A,B)
& ? [C] : in(C,set_intersection2(A,B)) )
| ( ! [C] : ~ in(C,set_intersection2(A,B))
& ~ disjoint(A,B) ) ),
inference(nnf_transformation,[status(thm)],[f11_neg]) ).
fof(f11_sk,plain,
! [C] :
( ( disjoint(sk3,sk4)
& in(sk5,set_intersection2(sk3,sk4)) )
| ( ~ in(C,set_intersection2(sk3,sk4))
& ~ disjoint(sk3,sk4) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk3,sk4,sk5])],[f11_nnf]) ).
cnf(c16,plain,
( disjoint(sk3,sk4)
| ~ in(X2,set_intersection2(sk3,sk4)) ),
inference(cnf_transformation,[status(esa)],[f11_sk]) ).
fof(f2,axiom,
! [A] :
( A = empty_set
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f2_nnf,plain,
! [A] :
( ( ? [B] : in(B,A)
| A = empty_set )
& ( ! [B] : ~ in(B,A)
| A != empty_set ) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [A,B] :
( ( in(sk0(A),A)
| A = empty_set )
& ( ~ in(B,A)
| A != empty_set ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f2_nnf]) ).
cnf(c3,plain,
( in(sk0(X0),X0)
| X0 = empty_set ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p23,plain,
( set_intersection2(sk3,sk4) = empty_set
| disjoint(sk3,sk4) ),
inference(resolution,[status(thm)],[c16,c3]) ).
fof(f3,axiom,
! [A,B] :
( disjoint(A,B)
<=> set_intersection2(A,B) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f3_nnf,plain,
! [A,B] :
( ( set_intersection2(A,B) != empty_set
| disjoint(A,B) )
& ( set_intersection2(A,B) = empty_set
| ~ disjoint(A,B) ) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [A,B] :
( ( set_intersection2(A,B) != empty_set
| disjoint(A,B) )
& ( set_intersection2(A,B) = empty_set
| ~ disjoint(A,B) ) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c5,plain,
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p25,plain,
( disjoint(sk3,sk4)
| disjoint(sk3,sk4) ),
inference(resolution,[status(thm)],[p23,c5]) ).
cnf(p28,plain,
disjoint(sk3,sk4),
inference(factoring,[status(thm)],[p25]) ).
cnf(c4,plain,
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p31,plain,
set_intersection2(sk3,sk4) = empty_set,
inference(resolution,[status(thm)],[p28,c4]) ).
cnf(c13,plain,
( in(sk5,set_intersection2(sk3,sk4))
| ~ disjoint(sk3,sk4) ),
inference(cnf_transformation,[status(esa)],[f11_sk]) ).
cnf(p32,plain,
( in(sk5,empty_set)
| ~ disjoint(sk3,sk4) ),
inference(demodulation,[status(thm)],[p31,c13]) ).
cnf(p33,plain,
in(sk5,empty_set),
inference(resolution,[status(thm)],[p32,p28]) ).
cnf(c2,plain,
( ~ in(X1,X0)
| X0 != empty_set ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p18,plain,
~ in(X0,empty_set),
inference(equality_resolution,[status(thm)],[c2]) ).
cnf(p35,plain,
$false,
inference(resolution,[status(thm)],[p33,p18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU120+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/5.58 % Computer : n005.cluster.edu
% 0.10/5.58 % Model : x86_64 x86_64
% 0.10/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.58 % Memory : 8046.5625MB
% 0.10/5.58 % OS : Linux 6.8.0-71-generic
% 0.10/5.58 % CPULimit : 300
% 0.10/5.58 % WCLimit : 300
% 0.10/5.58 % DateTime : Thu Sep 24 12:47:53 UTC 2026
% 0.10/5.58 % CPUTime :
% 0.10/5.58 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.23/6.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.23/6.31 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------