%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET175+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n007.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:44 PM UTC 2026
% Result : Theorem 34.47s 5.82s
% Output : Proof 34.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 15 unt; 0 def)
% Number of atoms : 105 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 101 ( 36 ~; 42 |; 18 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 90 ( 7 sgn 43 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f5_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)],[f5]) ).
fof(f5_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])],[f5_nnf]) ).
cnf(c12,plain,
( member(sk0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
fof(f0,axiom,
! [B,C,D] :
( member(D,union(B,C))
<=> ( member(D,C)
| member(D,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f0_nnf,plain,
! [B,C,D] :
( ( ( ~ member(D,C)
& ~ member(D,B) )
| member(D,union(B,C)) )
& ( member(D,C)
| member(D,B)
| ~ member(D,union(B,C)) ) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [D,B,C] :
( ( ( ~ member(D,C)
& ~ member(D,B) )
| member(D,union(B,C)) )
& ( member(D,C)
| member(D,B)
| ~ member(D,union(B,C)) ) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p25,plain,
( member(sk0(union(X0,X1),X2),X1)
| member(sk0(union(X0,X1),X2),X0)
| subset(union(X0,X1),X2) ),
inference(resolution,[status(thm)],[c12,c0]) ).
fof(f1,axiom,
! [B,C,D] :
( member(D,intersection(B,C))
<=> ( member(D,C)
& member(D,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f1_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)],[f1]) ).
fof(f1_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)],[f1_nnf]) ).
cnf(c3,plain,
( member(X2,X0)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p105,plain,
( member(sk0(union(intersection(X0,X1),X2),X3),X0)
| member(sk0(union(intersection(X0,X1),X2),X3),X2)
| subset(union(intersection(X0,X1),X2),X3) ),
inference(resolution,[status(thm)],[p25,c3]) ).
cnf(p2002,plain,
( member(sk0(union(X0,intersection(X0,X1)),X2),X0)
| subset(union(X0,intersection(X0,X1)),X2) ),
inference(factoring,[status(thm)],[p105]) ).
cnf(c13,plain,
( ~ member(sk0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(p4844,plain,
( subset(union(X0,intersection(X0,X1)),X0)
| subset(union(X0,intersection(X0,X1)),X0) ),
inference(resolution,[status(thm)],[p2002,c13]) ).
cnf(p4865,plain,
subset(union(X0,intersection(X0,X1)),X0),
inference(factoring,[status(thm)],[p4844]) ).
cnf(c1,plain,
( ~ member(X2,X0)
| member(X2,union(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p26,plain,
( member(sk0(X0,X1),union(X0,X2))
| subset(X0,X1) ),
inference(resolution,[status(thm)],[c12,c1]) ).
cnf(p39,plain,
( subset(X0,union(X0,X1))
| subset(X0,union(X0,X1)) ),
inference(resolution,[status(thm)],[p26,c13]) ).
cnf(p53,plain,
subset(X0,union(X0,X1)),
inference(factoring,[status(thm)],[p39]) ).
fof(f2,axiom,
! [B,C] :
( B = C
<=> ( subset(C,B)
& subset(B,C) ) ),
file('/export/starexec/sandbox/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(c8,plain,
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p75,plain,
( ~ subset(union(X0,X1),X0)
| X0 = union(X0,X1) ),
inference(resolution,[status(thm)],[p53,c8]) ).
cnf(p4869,plain,
X0 = union(X0,intersection(X0,X1)),
inference(resolution,[status(thm)],[p4865,p75]) ).
fof(f3,axiom,
! [B,C] : union(B,C) = union(C,B),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(f3_nnf,plain,
! [B,C] : union(B,C) = union(C,B),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [B,C] : union(B,C) = union(C,B),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c9,plain,
union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p4876,plain,
union(X0,intersection(X0,X1)) = X0,
inference(superposition,[status(thm)],[p4869,c9]) ).
fof(f8,conjecture,
! [B,C] : union(B,intersection(B,C)) = B,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_absorbtion_for_union) ).
fof(f8_neg,negated_conjecture,
~ ! [B,C] : union(B,intersection(B,C)) = B,
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f8_nnf,plain,
? [B,C] : union(B,intersection(B,C)) != B,
inference(nnf_transformation,[status(thm)],[f8_neg]) ).
fof(f8_sk,plain,
union(sk2,intersection(sk2,sk3)) != sk2,
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3])],[f8_nnf]) ).
cnf(c21,plain,
union(sk2,intersection(sk2,sk3)) != sk2,
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(p4877,plain,
sk2 != sk2,
inference(demodulation,[status(thm)],[p4876,c21]) ).
cnf(p4880,plain,
$false,
inference(equality_resolution,[status(thm)],[p4877]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET175+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n007.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 10:06:37 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 34.47/5.82 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 34.47/5.82 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------