%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SEU160+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n011.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:51:09 PM UTC 2026
% Result : Theorem 2.21s 1.20s
% Output : Proof 2.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 4 unt; 0 def)
% Number of atoms : 68 ( 45 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 68 ( 24 ~; 31 |; 10 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 19 ( 2 sgn 10 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [A,B] :
( subset(A,singleton(B))
<=> ( A = singleton(B)
| A = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f7_nnf,plain,
! [A,B] :
( ( ( A != singleton(B)
& A != empty_set )
| subset(A,singleton(B)) )
& ( A = singleton(B)
| A = empty_set
| ~ subset(A,singleton(B)) ) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [A,B] :
( ( ( A != singleton(B)
& A != empty_set )
| subset(A,singleton(B)) )
& ( A = singleton(B)
| A = empty_set
| ~ subset(A,singleton(B)) ) ),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c12,plain,
( X0 = singleton(X1)
| X0 = empty_set
| ~ subset(X0,singleton(X1)) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
fof(f6,conjecture,
! [A,B] :
( subset(A,singleton(B))
<=> ( A = singleton(B)
| A = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_zfmisc_1) ).
fof(f6_neg,negated_conjecture,
~ ! [A,B] :
( subset(A,singleton(B))
<=> ( A = singleton(B)
| A = empty_set ) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f6_nnf,plain,
? [A,B] :
( ( ( A = singleton(B)
| A = empty_set )
& ~ subset(A,singleton(B)) )
| ( A != singleton(B)
& A != empty_set
& subset(A,singleton(B)) ) ),
inference(nnf_transformation,[status(thm)],[f6_neg]) ).
fof(f6_sk,plain,
( ( ( sk2 = singleton(sk3)
| sk2 = empty_set )
& ~ subset(sk2,singleton(sk3)) )
| ( sk2 != singleton(sk3)
& sk2 != empty_set
& subset(sk2,singleton(sk3)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3])],[f6_nnf]) ).
cnf(c7,plain,
( sk2 = singleton(sk3)
| sk2 = empty_set
| subset(sk2,singleton(sk3)) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p22,plain,
( sk2 = singleton(sk3)
| sk2 = empty_set
| sk2 = singleton(sk3)
| sk2 = empty_set ),
inference(resolution,[status(thm)],[c12,c7]) ).
cnf(p28,plain,
( sk2 = empty_set
| sk2 = singleton(sk3)
| sk2 = empty_set ),
inference(factoring,[status(thm)],[p22]) ).
cnf(p29,plain,
( sk2 = singleton(sk3)
| sk2 = empty_set ),
inference(factoring,[status(thm)],[p28]) ).
cnf(c14,plain,
( X0 != singleton(X1)
| subset(X0,singleton(X1)) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(p35,plain,
( subset(sk2,singleton(sk3))
| sk2 = empty_set ),
inference(resolution,[status(thm)],[p29,c14]) ).
cnf(c10,plain,
( ~ subset(sk2,singleton(sk3))
| sk2 != singleton(sk3) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p34,plain,
( ~ subset(sk2,singleton(sk3))
| sk2 = empty_set ),
inference(resolution,[status(thm)],[p29,c10]) ).
cnf(p42,plain,
( sk2 = empty_set
| sk2 = empty_set ),
inference(resolution,[status(thm)],[p35,p34]) ).
cnf(p43,plain,
sk2 = empty_set,
inference(factoring,[status(thm)],[p42]) ).
cnf(c8,plain,
( ~ subset(sk2,singleton(sk3))
| sk2 != empty_set ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p44,plain,
( ~ subset(empty_set,singleton(sk3))
| empty_set != empty_set ),
inference(demodulation,[status(thm)],[p43,c8]) ).
cnf(p46,plain,
~ subset(empty_set,singleton(sk3)),
inference(equality_resolution,[status(thm)],[p44]) ).
cnf(c13,plain,
( X0 != empty_set
| subset(X0,singleton(X1)) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(p15,plain,
subset(empty_set,singleton(X0)),
inference(equality_resolution,[status(thm)],[c13]) ).
cnf(p47,plain,
$false,
inference(resolution,[status(thm)],[p46,p15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU160+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 12:59:27 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.21/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.21/1.20 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------