%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SEU140+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n010.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:51:03 PM UTC 2026
% Result : Theorem 11.92s 14.30s
% Output : Proof 11.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 51 ( 13 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 41 ( 16 ~; 12 |; 8 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 24 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [A,B] :
( disjoint(A,B)
<=> set_intersection2(A,B) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f10_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)],[f10]) ).
fof(f10_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)],[f10_nnf]) ).
cnf(c39,plain,
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f10_sk]) ).
fof(f50,conjecture,
! [A,B,C] :
( ( disjoint(B,C)
& subset(A,B) )
=> disjoint(A,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(f50_neg,negated_conjecture,
~ ! [A,B,C] :
( ( disjoint(B,C)
& subset(A,B) )
=> disjoint(A,C) ),
inference(negated_conjecture,[status(cth)],[f50]) ).
fof(f50_nnf,plain,
? [A,B,C] :
( ~ disjoint(A,C)
& disjoint(B,C)
& subset(A,B) ),
inference(nnf_transformation,[status(thm)],[f50_neg]) ).
fof(f50_sk,plain,
( ~ disjoint(sk10,sk12)
& disjoint(sk11,sk12)
& subset(sk10,sk11) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk10,sk11,sk12])],[f50_nnf]) ).
cnf(c91,plain,
disjoint(sk11,sk12),
inference(cnf_transformation,[status(esa)],[f50_sk]) ).
cnf(p147,plain,
set_intersection2(sk11,sk12) = empty_set,
inference(resolution,[status(thm)],[c39,c91]) ).
fof(f32,lemma,
! [A,B,C] :
( subset(A,B)
=> subset(set_intersection2(A,C),set_intersection2(B,C)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(f32_nnf,plain,
! [A,B,C] :
( subset(set_intersection2(A,C),set_intersection2(B,C))
| ~ subset(A,B) ),
inference(nnf_transformation,[status(thm)],[f32]) ).
fof(f32_sk,plain,
! [A,B,C] :
( subset(set_intersection2(A,C),set_intersection2(B,C))
| ~ subset(A,B) ),
inference(skolemisation,[status(esa)],[f32_nnf]) ).
cnf(c65,plain,
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f32_sk]) ).
cnf(c90,plain,
subset(sk10,sk11),
inference(cnf_transformation,[status(esa)],[f50_sk]) ).
cnf(p409,plain,
subset(set_intersection2(sk10,X0),set_intersection2(sk11,X0)),
inference(resolution,[status(thm)],[c65,c90]) ).
cnf(p472,plain,
subset(set_intersection2(sk10,sk12),empty_set),
inference(superposition,[status(thm)],[p147,p409]) ).
fof(f43,lemma,
! [A] :
( subset(A,empty_set)
=> A = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(f43_nnf,plain,
! [A] :
( A = empty_set
| ~ subset(A,empty_set) ),
inference(nnf_transformation,[status(thm)],[f43]) ).
fof(f43_sk,plain,
! [A] :
( A = empty_set
| ~ subset(A,empty_set) ),
inference(skolemisation,[status(esa)],[f43_nnf]) ).
cnf(c82,plain,
( X0 = empty_set
| ~ subset(X0,empty_set) ),
inference(cnf_transformation,[status(esa)],[f43_sk]) ).
cnf(p482,plain,
set_intersection2(sk10,sk12) = empty_set,
inference(resolution,[status(thm)],[p472,c82]) ).
cnf(c40,plain,
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f10_sk]) ).
cnf(p483,plain,
disjoint(sk10,sk12),
inference(resolution,[status(thm)],[p482,c40]) ).
cnf(c92,plain,
~ disjoint(sk10,sk12),
inference(cnf_transformation,[status(esa)],[f50_sk]) ).
cnf(p495,plain,
$false,
inference(resolution,[status(thm)],[p483,c92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU140+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/10.38 % Computer : n010.cluster.edu
% 0.10/10.38 % Model : x86_64 x86_64
% 0.10/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38 % Memory : 8046.5625MB
% 0.10/10.38 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Thu Sep 24 12:55:40 UTC 2026
% 0.10/10.38 % CPUTime :
% 0.10/10.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 11.92/14.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.92/14.30 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------