%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET006-1 : TPTP v9.3.1. Released v1.0.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:41:26 PM UTC 2026
% Result : Unsatisfiable 4.74s 6.10s
% Output : Proof 4.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 17 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 2 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f7,axiom,
( member(Element,Set2)
| ~ member(Element,Intersection)
| ~ intersection(Set1,Set2,Intersection) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_of_intersection_is_member_of_set2) ).
fof(f7_nnf,plain,
! [Set1,Set2,Intersection,Element] :
( member(Element,Set2)
| ~ member(Element,Intersection)
| ~ intersection(Set1,Set2,Intersection) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [Set1,Set2,Intersection,Element] :
( member(Element,Set2)
| ~ member(Element,Intersection)
| ~ intersection(Set1,Set2,Intersection) ),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c7,plain,
( member(X3,X1)
| ~ member(X3,X2)
| ~ intersection(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(f12,hypothesis,
intersection(d,a,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_intersection_a_is_d) ).
fof(f12_nnf,plain,
intersection(d,a,d),
inference(nnf_transformation,[status(thm)],[f12]) ).
cnf(c12,plain,
intersection(d,a,d),
inference(cnf_transformation,[status(esa)],[f12_nnf]) ).
cnf(p19,plain,
( member(X0,a)
| ~ member(X0,d) ),
inference(resolution,[status(thm)],[c7,c12]) ).
cnf(f1,axiom,
( member(member_of_1_not_of_2(Subset,Superset),Subset)
| subset(Subset,Superset) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsets_axiom1) ).
fof(f1_nnf,plain,
! [Subset,Superset] :
( member(member_of_1_not_of_2(Subset,Superset),Subset)
| subset(Subset,Superset) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [Subset,Superset] :
( member(member_of_1_not_of_2(Subset,Superset),Subset)
| subset(Subset,Superset) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( member(member_of_1_not_of_2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p21,plain,
( subset(d,X0)
| member(member_of_1_not_of_2(d,X0),a) ),
inference(resolution,[status(thm)],[p19,c1]) ).
cnf(f2,axiom,
( subset(Subset,Superset)
| ~ member(member_of_1_not_of_2(Subset,Superset),Superset) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsets_axiom2) ).
fof(f2_nnf,plain,
! [Subset,Superset] :
( subset(Subset,Superset)
| ~ member(member_of_1_not_of_2(Subset,Superset),Superset) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [Subset,Superset] :
( subset(Subset,Superset)
| ~ member(member_of_1_not_of_2(Subset,Superset),Superset) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( subset(X0,X1)
| ~ member(member_of_1_not_of_2(X0,X1),X1) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p23,plain,
( subset(d,a)
| subset(d,a) ),
inference(resolution,[status(thm)],[p21,c2]) ).
cnf(p24,plain,
subset(d,a),
inference(factoring,[status(thm)],[p23]) ).
cnf(f13,negated_conjecture,
~ subset(d,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_d_is_a_subset_of_a) ).
fof(f13_nnf,plain,
~ subset(d,a),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
~ subset(d,a),
inference(skolemisation,[status(esa)],[f13_nnf]) ).
cnf(c13,plain,
~ subset(d,a),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
cnf(p25,plain,
$false,
inference(resolution,[status(thm)],[p24,c13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET006-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/5.35 % Computer : n014.cluster.edu
% 0.09/5.35 % Model : x86_64 x86_64
% 0.09/5.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.35 % Memory : 8046.5625MB
% 0.09/5.35 % OS : Linux 6.8.0-71-generic
% 0.09/5.35 % CPULimit : 300
% 0.09/5.35 % WCLimit : 300
% 0.09/5.35 % DateTime : Thu Sep 24 09:04:23 UTC 2026
% 0.09/5.35 % CPUTime :
% 0.09/5.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.74/6.10 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.74/6.10 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------