%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SEU094+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 : n005.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:50:56 PM UTC 2026
% Result : Theorem 10.45s 1.86s
% Output : Proof 10.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 11 unt; 0 def)
% Number of atoms : 119 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 115 ( 43 ~; 47 |; 16 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 41 ( 0 sgn 28 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f48,axiom,
! [A,B] :
( ( finite(B)
& subset(A,B) )
=> finite(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f48_nnf,plain,
! [A,B] :
( finite(A)
| ~ finite(B)
| ~ subset(A,B) ),
inference(nnf_transformation,[status(thm)],[f48]) ).
fof(f48_sk,plain,
! [A,B] :
( finite(A)
| ~ finite(B)
| ~ subset(A,B) ),
inference(skolemisation,[status(esa)],[f48_nnf]) ).
cnf(c134,plain,
( finite(X0)
| ~ finite(X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f48_sk]) ).
fof(f47,axiom,
! [A] : subset(A,powerset(union(A))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t100_zfmisc_1) ).
fof(f47_nnf,plain,
! [A] : subset(A,powerset(union(A))),
inference(nnf_transformation,[status(thm)],[f47]) ).
fof(f47_sk,plain,
! [A] : subset(A,powerset(union(A))),
inference(skolemisation,[status(esa)],[f47_nnf]) ).
cnf(c133,plain,
subset(X0,powerset(union(X0))),
inference(cnf_transformation,[status(esa)],[f47_sk]) ).
cnf(p508,plain,
( finite(X0)
| ~ finite(powerset(union(X0))) ),
inference(resolution,[status(thm)],[c134,c133]) ).
fof(f50,axiom,
! [A] :
( finite(A)
<=> finite(powerset(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_finset_1) ).
fof(f50_nnf,plain,
! [A] :
( ( ~ finite(powerset(A))
| finite(A) )
& ( finite(powerset(A))
| ~ finite(A) ) ),
inference(nnf_transformation,[status(thm)],[f50]) ).
fof(f50_sk,plain,
! [A] :
( ( ~ finite(powerset(A))
| finite(A) )
& ( finite(powerset(A))
| ~ finite(A) ) ),
inference(skolemisation,[status(esa)],[f50_nnf]) ).
cnf(c136,plain,
( finite(powerset(X0))
| ~ finite(X0) ),
inference(cnf_transformation,[status(esa)],[f50_sk]) ).
fof(f51,conjecture,
! [A] :
( ( ! [B] :
( in(B,A)
=> finite(B) )
& finite(A) )
<=> finite(union(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t25_finset_1) ).
fof(f51_neg,negated_conjecture,
~ ! [A] :
( ( ! [B] :
( in(B,A)
=> finite(B) )
& finite(A) )
<=> finite(union(A)) ),
inference(negated_conjecture,[status(cth)],[f51]) ).
fof(f51_nnf,plain,
? [A] :
( ( finite(union(A))
& ( ? [B] :
( ~ finite(B)
& in(B,A) )
| ~ finite(A) ) )
| ( ~ finite(union(A))
& ! [B] :
( finite(B)
| ~ in(B,A) )
& finite(A) ) ),
inference(nnf_transformation,[status(thm)],[f51_neg]) ).
fof(f51_sk,plain,
! [B] :
( ( finite(union(sk27))
& ( ( ~ finite(sk28)
& in(sk28,sk27) )
| ~ finite(sk27) ) )
| ( ~ finite(union(sk27))
& ( finite(B)
| ~ in(B,sk27) )
& finite(sk27) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk27,sk28])],[f51_nnf]) ).
cnf(c140,plain,
( finite(union(sk27))
| finite(sk27) ),
inference(cnf_transformation,[status(esa)],[f51_sk]) ).
cnf(p526,plain,
( finite(sk27)
| finite(powerset(union(sk27))) ),
inference(resolution,[status(thm)],[c136,c140]) ).
cnf(p2674,plain,
( finite(sk27)
| finite(sk27) ),
inference(resolution,[status(thm)],[p508,p526]) ).
cnf(p2675,plain,
finite(sk27),
inference(factoring,[status(thm)],[p2674]) ).
fof(f20,axiom,
! [A] :
( ( ! [B] :
( in(B,A)
=> finite(B) )
& finite(A) )
=> finite(union(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l22_finset_1) ).
fof(f20_nnf,plain,
! [A] :
( finite(union(A))
| ? [B] :
( ~ finite(B)
& in(B,A) )
| ~ finite(A) ),
inference(nnf_transformation,[status(thm)],[f20]) ).
fof(f20_sk,plain,
! [A] :
( finite(union(A))
| ( ~ finite(sk1(A))
& in(sk1(A),A) )
| ~ finite(A) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f20_nnf]) ).
cnf(c45,plain,
( finite(union(X0))
| in(sk1(X0),X0)
| ~ finite(X0) ),
inference(cnf_transformation,[status(esa)],[f20_sk]) ).
cnf(p2677,plain,
( finite(union(sk27))
| in(sk1(sk27),sk27) ),
inference(resolution,[status(thm)],[p2675,c45]) ).
cnf(c143,plain,
( finite(union(sk27))
| finite(X1)
| ~ in(X1,sk27) ),
inference(cnf_transformation,[status(esa)],[f51_sk]) ).
cnf(p2739,plain,
( finite(union(sk27))
| finite(sk1(sk27))
| finite(union(sk27)) ),
inference(resolution,[status(thm)],[p2677,c143]) ).
cnf(p3002,plain,
( finite(sk1(sk27))
| finite(union(sk27)) ),
inference(factoring,[status(thm)],[p2739]) ).
cnf(c46,plain,
( finite(union(X0))
| ~ finite(sk1(X0))
| ~ finite(X0) ),
inference(cnf_transformation,[status(esa)],[f20_sk]) ).
cnf(p2678,plain,
( finite(union(sk27))
| ~ finite(sk1(sk27)) ),
inference(resolution,[status(thm)],[p2675,c46]) ).
cnf(p3007,plain,
( finite(union(sk27))
| finite(union(sk27)) ),
inference(resolution,[status(thm)],[p3002,p2678]) ).
cnf(p3008,plain,
finite(union(sk27)),
inference(factoring,[status(thm)],[p3007]) ).
cnf(c144,plain,
( in(sk28,sk27)
| ~ finite(sk27)
| ~ finite(union(sk27)) ),
inference(cnf_transformation,[status(esa)],[f51_sk]) ).
cnf(p3010,plain,
( in(sk28,sk27)
| ~ finite(sk27) ),
inference(resolution,[status(thm)],[p3008,c144]) ).
cnf(p3026,plain,
in(sk28,sk27),
inference(resolution,[status(thm)],[p3010,p2675]) ).
fof(f59,axiom,
! [A,B] :
( in(A,B)
=> subset(A,union(B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t92_zfmisc_1) ).
fof(f59_nnf,plain,
! [A,B] :
( subset(A,union(B))
| ~ in(A,B) ),
inference(nnf_transformation,[status(thm)],[f59]) ).
fof(f59_sk,plain,
! [A,B] :
( subset(A,union(B))
| ~ in(A,B) ),
inference(skolemisation,[status(esa)],[f59_nnf]) ).
cnf(c155,plain,
( subset(X0,union(X1))
| ~ in(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f59_sk]) ).
cnf(p3032,plain,
subset(sk28,union(sk27)),
inference(resolution,[status(thm)],[p3026,c155]) ).
cnf(p3033,plain,
( finite(sk28)
| ~ finite(union(sk27)) ),
inference(resolution,[status(thm)],[p3032,c134]) ).
cnf(p3040,plain,
finite(sk28),
inference(resolution,[status(thm)],[p3033,p3008]) ).
cnf(c145,plain,
( ~ finite(sk28)
| ~ finite(sk27)
| ~ finite(union(sk27)) ),
inference(cnf_transformation,[status(esa)],[f51_sk]) ).
cnf(p3009,plain,
( ~ finite(sk28)
| ~ finite(sk27) ),
inference(resolution,[status(thm)],[p3008,c145]) ).
cnf(p3019,plain,
~ finite(sk28),
inference(resolution,[status(thm)],[p3009,p2675]) ).
cnf(p3045,plain,
$false,
inference(resolution,[status(thm)],[p3040,p3019]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU094+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n005.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 12:44:02 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.45/1.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.45/1.86 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------