%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET899+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n016.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:44:14 PM UTC 2026
% Result : Theorem 0.16s 6.01s
% Output : Proof 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 27 ( 10 ~; 10 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 22 ( 0 sgn 15 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [A,B,C] :
( subset(A,B)
=> ( subset(A,set_difference(B,singleton(C)))
| in(C,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3_zfmisc_1) ).
fof(f5_nnf,plain,
! [A,B,C] :
( subset(A,set_difference(B,singleton(C)))
| in(C,A)
| ~ subset(A,B) ),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [A,B,C] :
( subset(A,set_difference(B,singleton(C)))
| in(C,A)
| ~ subset(A,B) ),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c7,plain,
( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
fof(f4,conjecture,
! [A,B,C] :
( subset(A,B)
=> ( subset(A,set_difference(B,singleton(C)))
| in(C,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t40_zfmisc_1) ).
fof(f4_neg,negated_conjecture,
~ ! [A,B,C] :
( subset(A,B)
=> ( subset(A,set_difference(B,singleton(C)))
| in(C,A) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f4_nnf,plain,
? [A,B,C] :
( ~ subset(A,set_difference(B,singleton(C)))
& ~ in(C,A)
& subset(A,B) ),
inference(nnf_transformation,[status(thm)],[f4_neg]) ).
fof(f4_sk,plain,
( ~ subset(sk2,set_difference(sk3,singleton(sk4)))
& ~ in(sk4,sk2)
& subset(sk2,sk3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3,sk4])],[f4_nnf]) ).
cnf(c4,plain,
subset(sk2,sk3),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(p10,plain,
( subset(sk2,set_difference(sk3,singleton(X0)))
| in(X0,sk2) ),
inference(resolution,[status(thm)],[c7,c4]) ).
cnf(c6,plain,
~ subset(sk2,set_difference(sk3,singleton(sk4))),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(p12,plain,
in(sk4,sk2),
inference(resolution,[status(thm)],[p10,c6]) ).
cnf(c5,plain,
~ in(sk4,sk2),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(p15,plain,
$false,
inference(resolution,[status(thm)],[p12,c5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET899+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/5.39 % Computer : n016.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Thu Sep 24 12:25:33 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/6.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/6.01 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------