%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET687+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n017.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:48 PM UTC 2026
% Result : Theorem 30.12s 4.28s
% Output : Proof 30.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 7 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 26 ( 11 ~; 9 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f0_nnf,plain,
! [A,B] :
( ( ? [X] :
( ~ member(X,B)
& member(X,A) )
| subset(A,B) )
& ( ! [X] :
( member(X,B)
| ~ member(X,A) )
| ~ subset(A,B) ) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A,B,X] :
( ( ( ~ member(sk0(A,B),B)
& member(sk0(A,B),A) )
| subset(A,B) )
& ( member(X,B)
| ~ member(X,A)
| ~ subset(A,B) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c2,plain,
( ~ member(sk0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c1,plain,
( member(sk0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p30,plain,
( subset(X0,X0)
| subset(X0,X0) ),
inference(resolution,[status(thm)],[c2,c1]) ).
cnf(p75,plain,
subset(X0,X0),
inference(factoring,[status(thm)],[p30]) ).
fof(f11,conjecture,
! [A] : subset(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI01) ).
fof(f11_neg,negated_conjecture,
~ ! [A] : subset(A,A),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f11_nnf,plain,
? [A] : ~ subset(A,A),
inference(nnf_transformation,[status(thm)],[f11_neg]) ).
fof(f11_sk,plain,
~ subset(sk3,sk3),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk3])],[f11_nnf]) ).
cnf(c29,plain,
~ subset(sk3,sk3),
inference(cnf_transformation,[status(esa)],[f11_sk]) ).
cnf(p591,plain,
$false,
inference(resolution,[status(thm)],[p75,c29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET687+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 11:35:33 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 30.12/4.28 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.12/4.28 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------