%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET146+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 : n009.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:42:36 PM UTC 2026
% Result : Theorem 28.19s 4.18s
% Output : Proof 28.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 21 unt; 0 def)
% Number of atoms : 91 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 90 ( 39 ~; 30 |; 16 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 68 ( 11 sgn 41 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,axiom,
! [B,C,D] :
( member(D,intersection(B,C))
<=> ( member(D,C)
& member(D,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f0_nnf,plain,
! [B,C,D] :
( ( ~ member(D,C)
| ~ member(D,B)
| member(D,intersection(B,C)) )
& ( ( member(D,C)
& member(D,B) )
| ~ member(D,intersection(B,C)) ) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [D,B,C] :
( ( ~ member(D,C)
| ~ member(D,B)
| member(D,intersection(B,C)) )
& ( ( member(D,C)
& member(D,B) )
| ~ member(D,intersection(B,C)) ) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( member(X2,X0)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
fof(f6,axiom,
! [B] :
( empty(B)
<=> ! [C] : ~ member(C,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_defn) ).
fof(f6_nnf,plain,
! [B] :
( ( ? [C] : member(C,B)
| empty(B) )
& ( ! [C] : ~ member(C,B)
| ~ empty(B) ) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [B,C] :
( ( member(sk1(B),B)
| empty(B) )
& ( ~ member(C,B)
| ~ empty(B) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f6_nnf]) ).
cnf(c13,plain,
( member(sk1(X0),X0)
| empty(X0) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p24,plain,
( empty(intersection(X0,X1))
| member(sk1(intersection(X0,X1)),X0) ),
inference(resolution,[status(thm)],[c0,c13]) ).
fof(f1,axiom,
! [B] : ~ member(B,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f1_nnf,plain,
! [B] : ~ member(B,empty_set),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [B] : ~ member(B,empty_set),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c3,plain,
~ member(X0,empty_set),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p31,plain,
empty(intersection(empty_set,X0)),
inference(resolution,[status(thm)],[p24,c3]) ).
cnf(c12,plain,
( ~ member(X1,X0)
| ~ empty(X0) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p35,plain,
~ member(X0,intersection(empty_set,X1)),
inference(resolution,[status(thm)],[p31,c12]) ).
fof(f4,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f4_nnf,plain,
! [B,C] :
( ( ? [D] :
( ~ member(D,C)
& member(D,B) )
| subset(B,C) )
& ( ! [D] :
( member(D,C)
| ~ member(D,B) )
| ~ subset(B,C) ) ),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [B,C,D] :
( ( ( ~ member(sk0(B,C),C)
& member(sk0(B,C),B) )
| subset(B,C) )
& ( member(D,C)
| ~ member(D,B)
| ~ subset(B,C) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f4_nnf]) ).
cnf(c9,plain,
( member(sk0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(p38,plain,
subset(intersection(empty_set,X0),X1),
inference(resolution,[status(thm)],[p35,c9]) ).
fof(f2,axiom,
! [B,C] :
( B = C
<=> ( subset(C,B)
& subset(B,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(f2_nnf,plain,
! [B,C] :
( ( ~ subset(C,B)
| ~ subset(B,C)
| B = C )
& ( ( subset(C,B)
& subset(B,C) )
| B != C ) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [B,C] :
( ( ~ subset(C,B)
| ~ subset(B,C)
| B = C )
& ( ( subset(C,B)
& subset(B,C) )
| B != C ) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c6,plain,
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p26,plain,
subset(empty_set,X0),
inference(resolution,[status(thm)],[c9,c3]) ).
cnf(p29,plain,
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(resolution,[status(thm)],[c6,p26]) ).
cnf(p43,plain,
empty_set = intersection(empty_set,X0),
inference(resolution,[status(thm)],[p38,p29]) ).
fof(f3,axiom,
! [B,C] : intersection(B,C) = intersection(C,B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f3_nnf,plain,
! [B,C] : intersection(B,C) = intersection(C,B),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [B,C] : intersection(B,C) = intersection(C,B),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c7,plain,
intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p46,plain,
intersection(X0,empty_set) = empty_set,
inference(superposition,[status(thm)],[p43,c7]) ).
fof(f8,conjecture,
! [B] : intersection(B,empty_set) = empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th61) ).
fof(f8_neg,negated_conjecture,
~ ! [B] : intersection(B,empty_set) = empty_set,
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f8_nnf,plain,
? [B] : intersection(B,empty_set) != empty_set,
inference(nnf_transformation,[status(thm)],[f8_neg]) ).
fof(f8_sk,plain,
intersection(sk3,empty_set) != empty_set,
inference(skolemisation,[status(esa),new_symbols(skolem,[sk3])],[f8_nnf]) ).
cnf(c20,plain,
intersection(sk3,empty_set) != empty_set,
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(p47,plain,
empty_set != empty_set,
inference(demodulation,[status(thm)],[p46,c20]) ).
cnf(p50,plain,
$false,
inference(equality_resolution,[status(thm)],[p47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET146+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.43 % Computer : n009.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Thu Sep 24 10:01:58 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 28.19/4.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 28.19/4.18 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------