%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SEU230+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n001.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:25 PM UTC 2026
% Result : Theorem 38.83s 7.03s
% Output : Proof 38.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 19 unt; 0 def)
% Number of atoms : 84 ( 32 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 89 ( 34 ~; 31 |; 20 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-3 aty)
% Number of variables : 57 ( 4 sgn 32 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [A] : succ(A) = set_union2(A,singleton(A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(f5_nnf,plain,
! [A] : succ(A) = set_union2(A,singleton(A)),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [A] : succ(A) = set_union2(A,singleton(A)),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c7,plain,
succ(X0) = set_union2(X0,singleton(X0)),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
fof(f4,axiom,
! [A,B] : set_union2(A,B) = set_union2(B,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f4_nnf,plain,
! [A,B] : set_union2(A,B) = set_union2(B,A),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [A,B] : set_union2(A,B) = set_union2(B,A),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c6,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(p77,plain,
set_union2(X0,singleton(X0)) = succ(X0),
inference(superposition,[status(thm)],[c7,c6]) ).
fof(f7,axiom,
! [A,B,C] :
( C = set_union2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,B)
| in(D,A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f7_nnf,plain,
! [A,B,C] :
( ( ? [D] :
( ( ( in(D,B)
| in(D,A) )
& ~ in(D,C) )
| ( ~ in(D,B)
& ~ in(D,A)
& in(D,C) ) )
| C = set_union2(A,B) )
& ( ! [D] :
( ( ( ~ in(D,B)
& ~ in(D,A) )
| in(D,C) )
& ( in(D,B)
| in(D,A)
| ~ in(D,C) ) )
| C != set_union2(A,B) ) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [C,A,B,D] :
( ( ( ( in(sk1(A,B,C),B)
| in(sk1(A,B,C),A) )
& ~ in(sk1(A,B,C),C) )
| ( ~ in(sk1(A,B,C),B)
& ~ in(sk1(A,B,C),A)
& in(sk1(A,B,C),C) )
| C = set_union2(A,B) )
& ( ( ( ( ~ in(D,B)
& ~ in(D,A) )
| in(D,C) )
& ( in(D,B)
| in(D,A)
| ~ in(D,C) ) )
| C != set_union2(A,B) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f7_nnf]) ).
cnf(c15,plain,
( ~ in(X3,X0)
| in(X3,X2)
| X2 != set_union2(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(p116,plain,
( ~ in(X0,X1)
| in(X0,set_union2(X1,X2)) ),
inference(equality_resolution,[status(thm)],[c15]) ).
fof(f6,axiom,
! [A,B] :
( B = singleton(A)
<=> ! [C] :
( in(C,B)
<=> C = A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f6_nnf,plain,
! [A,B] :
( ( ? [C] :
( ( C = A
& ~ in(C,B) )
| ( C != A
& in(C,B) ) )
| B = singleton(A) )
& ( ! [C] :
( ( C != A
| in(C,B) )
& ( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [B,A,C] :
( ( ( sk0(A,B) = A
& ~ in(sk0(A,B),B) )
| ( sk0(A,B) != A
& in(sk0(A,B),B) )
| B = singleton(A) )
& ( ( ( C != A
| in(C,B) )
& ( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f6_nnf]) ).
cnf(c9,plain,
( X2 != X0
| in(X2,X1)
| X1 != singleton(X0) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p83,plain,
( X0 != X1
| in(X0,singleton(X1)) ),
inference(equality_resolution,[status(thm)],[c9]) ).
cnf(p103,plain,
in(X0,singleton(X0)),
inference(equality_resolution,[status(thm)],[p83]) ).
cnf(p132,plain,
in(X0,set_union2(singleton(X0),X1)),
inference(resolution,[status(thm)],[p116,p103]) ).
cnf(p136,plain,
in(X0,set_union2(X1,singleton(X0))),
inference(superposition,[status(thm)],[c6,p132]) ).
cnf(p180,plain,
in(X0,succ(X0)),
inference(superposition,[status(thm)],[p77,p136]) ).
fof(f31,conjecture,
! [A] : in(A,succ(A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f31_neg,negated_conjecture,
~ ! [A] : in(A,succ(A)),
inference(negated_conjecture,[status(cth)],[f31]) ).
fof(f31_nnf,plain,
? [A] : ~ in(A,succ(A)),
inference(nnf_transformation,[status(thm)],[f31_neg]) ).
fof(f31_sk,plain,
~ in(sk12,succ(sk12)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk12])],[f31_nnf]) ).
cnf(c59,plain,
~ in(sk12,succ(sk12)),
inference(cnf_transformation,[status(esa)],[f31_sk]) ).
cnf(p183,plain,
$false,
inference(resolution,[status(thm)],[p180,c59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU230+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.42 % Computer : n001.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Thu Sep 24 13:24:37 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 38.83/7.03 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 38.83/7.03 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------