%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET631+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n014.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:43:40 PM UTC 2026
% Result : Theorem 4.60s 1.09s
% Output : Proof 4.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 57 ( 23 ~; 18 |; 12 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 1 sgn 23 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,conjecture,
! [B,C,D] :
( intersect(B,difference(C,D))
=> intersect(B,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th113) ).
fof(f3_neg,negated_conjecture,
~ ! [B,C,D] :
( intersect(B,difference(C,D))
=> intersect(B,C) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f3_nnf,plain,
? [B,C,D] :
( ~ intersect(B,C)
& intersect(B,difference(C,D)) ),
inference(nnf_transformation,[status(thm)],[f3_neg]) ).
fof(f3_sk,plain,
( ~ intersect(sk1,sk2)
& intersect(sk1,difference(sk2,sk3)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1,sk2,sk3])],[f3_nnf]) ).
cnf(c7,plain,
intersect(sk1,difference(sk2,sk3)),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
fof(f1,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,C)
& member(D,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(f1_nnf,plain,
! [B,C] :
( ( ! [D] :
( ~ member(D,C)
| ~ member(D,B) )
| intersect(B,C) )
& ( ? [D] :
( member(D,C)
& member(D,B) )
| ~ intersect(B,C) ) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [B,C,D] :
( ( ~ member(D,C)
| ~ member(D,B)
| intersect(B,C) )
& ( ( member(sk0(B,C),C)
& member(sk0(B,C),B) )
| ~ intersect(B,C) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f1_nnf]) ).
cnf(c4,plain,
( member(sk0(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p11,plain,
member(sk0(sk1,difference(sk2,sk3)),difference(sk2,sk3)),
inference(resolution,[status(thm)],[c7,c4]) ).
fof(f0,axiom,
! [B,C,D] :
( member(D,difference(B,C))
<=> ( ~ member(D,C)
& member(D,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
fof(f0_nnf,plain,
! [B,C,D] :
( ( member(D,C)
| ~ member(D,B)
| member(D,difference(B,C)) )
& ( ( ~ member(D,C)
& member(D,B) )
| ~ member(D,difference(B,C)) ) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [D,B,C] :
( ( member(D,C)
| ~ member(D,B)
| member(D,difference(B,C)) )
& ( ( ~ member(D,C)
& member(D,B) )
| ~ member(D,difference(B,C)) ) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( member(X2,X0)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p16,plain,
member(sk0(sk1,difference(sk2,sk3)),sk2),
inference(resolution,[status(thm)],[p11,c0]) ).
cnf(c3,plain,
( member(sk0(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p10,plain,
member(sk0(sk1,difference(sk2,sk3)),sk1),
inference(resolution,[status(thm)],[c7,c3]) ).
cnf(c5,plain,
( ~ member(X2,X1)
| ~ member(X2,X0)
| intersect(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p14,plain,
( ~ member(sk0(sk1,difference(sk2,sk3)),X0)
| intersect(sk1,X0) ),
inference(resolution,[status(thm)],[p10,c5]) ).
cnf(p31,plain,
intersect(sk1,sk2),
inference(resolution,[status(thm)],[p16,p14]) ).
cnf(c8,plain,
~ intersect(sk1,sk2),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p86,plain,
$false,
inference(resolution,[status(thm)],[p31,c8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET631+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n014.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 11:31:17 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.60/1.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.60/1.09 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------