%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SEU105+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 : n019.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:57 PM UTC 2026
% Result : Theorem 47.25s 11.20s
% Output : Proof 47.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 3 unt; 0 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 116 ( 36 ~; 51 |; 18 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 25 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f35,axiom,
! [A,B] :
( in(A,B)
=> element(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(f35_nnf,plain,
! [A,B] :
( element(A,B)
| ~ in(A,B) ),
inference(nnf_transformation,[status(thm)],[f35]) ).
fof(f35_sk,plain,
! [A,B] :
( element(A,B)
| ~ in(A,B) ),
inference(skolemisation,[status(esa)],[f35_nnf]) ).
cnf(c63,plain,
( element(X0,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f35_sk]) ).
fof(f32,axiom,
! [A] :
( preboolean(A)
<=> ! [B,C] :
( ( in(C,A)
& in(B,A) )
=> ( in(set_difference(B,C),A)
& in(set_union2(B,C),A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1) ).
fof(f32_nnf,plain,
! [A] :
( ( ? [B,C] :
( ( ~ in(set_difference(B,C),A)
| ~ in(set_union2(B,C),A) )
& in(C,A)
& in(B,A) )
| preboolean(A) )
& ( ! [B,C] :
( ( in(set_difference(B,C),A)
& in(set_union2(B,C),A) )
| ~ in(C,A)
| ~ in(B,A) )
| ~ preboolean(A) ) ),
inference(nnf_transformation,[status(thm)],[f32]) ).
fof(f32_sk,plain,
! [A,B,C] :
( ( ( ( ~ in(set_difference(sk10(A),sk11(A)),A)
| ~ in(set_union2(sk10(A),sk11(A)),A) )
& in(sk11(A),A)
& in(sk10(A),A) )
| preboolean(A) )
& ( ( in(set_difference(B,C),A)
& in(set_union2(B,C),A) )
| ~ in(C,A)
| ~ in(B,A)
| ~ preboolean(A) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk10,sk11])],[f32_nnf]) ).
cnf(c55,plain,
( in(sk10(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[status(esa)],[f32_sk]) ).
cnf(p317,plain,
( preboolean(X0)
| element(sk10(X0),X0) ),
inference(resolution,[status(thm)],[c63,c55]) ).
fof(f33,conjecture,
! [A] :
( ~ empty(A)
=> ( ! [B] :
( element(B,A)
=> ! [C] :
( element(C,A)
=> ( in(set_intersection2(B,C),A)
& in(symmetric_difference(B,C),A) ) ) )
=> preboolean(A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_finsub_1) ).
fof(f33_neg,negated_conjecture,
~ ! [A] :
( ~ empty(A)
=> ( ! [B] :
( element(B,A)
=> ! [C] :
( element(C,A)
=> ( in(set_intersection2(B,C),A)
& in(symmetric_difference(B,C),A) ) ) )
=> preboolean(A) ) ),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f33_nnf,plain,
? [A] :
( ~ preboolean(A)
& ! [B] :
( ! [C] :
( ( in(set_intersection2(B,C),A)
& in(symmetric_difference(B,C),A) )
| ~ element(C,A) )
| ~ element(B,A) )
& ~ empty(A) ),
inference(nnf_transformation,[status(thm)],[f33_neg]) ).
fof(f33_sk,plain,
! [B,C] :
( ~ preboolean(sk12)
& ( ( in(set_intersection2(B,C),sk12)
& in(symmetric_difference(B,C),sk12) )
| ~ element(C,sk12)
| ~ element(B,sk12) )
& ~ empty(sk12) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk12])],[f33_nnf]) ).
cnf(c59,plain,
( in(symmetric_difference(X1,X2),sk12)
| ~ element(X2,sk12)
| ~ element(X1,sk12) ),
inference(cnf_transformation,[status(esa)],[f33_sk]) ).
cnf(p5444,plain,
( in(symmetric_difference(sk10(sk12),X0),sk12)
| ~ element(X0,sk12)
| preboolean(sk12) ),
inference(resolution,[status(thm)],[p317,c59]) ).
cnf(c56,plain,
( in(sk11(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[status(esa)],[f32_sk]) ).
cnf(p318,plain,
( preboolean(X0)
| element(sk11(X0),X0) ),
inference(resolution,[status(thm)],[c63,c56]) ).
cnf(p5877,plain,
( preboolean(sk12)
| in(symmetric_difference(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12) ),
inference(resolution,[status(thm)],[p5444,p318]) ).
cnf(p6241,plain,
( in(symmetric_difference(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12) ),
inference(factoring,[status(thm)],[p5877]) ).
cnf(p6243,plain,
( element(symmetric_difference(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12) ),
inference(resolution,[status(thm)],[p6241,c63]) ).
cnf(p6246,plain,
( in(symmetric_difference(symmetric_difference(sk10(sk12),sk11(sk12)),X0),sk12)
| ~ element(X0,sk12)
| preboolean(sk12) ),
inference(resolution,[status(thm)],[p6243,c59]) ).
cnf(c60,plain,
( in(set_intersection2(X1,X2),sk12)
| ~ element(X2,sk12)
| ~ element(X1,sk12) ),
inference(cnf_transformation,[status(esa)],[f33_sk]) ).
cnf(p5446,plain,
( in(set_intersection2(sk10(sk12),X0),sk12)
| ~ element(X0,sk12)
| preboolean(sk12) ),
inference(resolution,[status(thm)],[p317,c60]) ).
cnf(p5978,plain,
( preboolean(sk12)
| in(set_intersection2(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12) ),
inference(resolution,[status(thm)],[p5446,p318]) ).
cnf(p6277,plain,
( in(set_intersection2(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12) ),
inference(factoring,[status(thm)],[p5978]) ).
cnf(p6279,plain,
( element(set_intersection2(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12) ),
inference(resolution,[status(thm)],[p6277,c63]) ).
cnf(p16162,plain,
( preboolean(sk12)
| in(set_union2(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12) ),
inference(resolution,[status(thm)],[p6246,p6279]) ).
cnf(p16247,plain,
( in(set_union2(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12) ),
inference(factoring,[status(thm)],[p16162]) ).
cnf(c57,plain,
( ~ in(set_difference(sk10(X0),sk11(X0)),X0)
| ~ in(set_union2(sk10(X0),sk11(X0)),X0)
| preboolean(X0) ),
inference(cnf_transformation,[status(esa)],[f32_sk]) ).
cnf(p16249,plain,
( ~ in(set_difference(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12)
| preboolean(sk12) ),
inference(resolution,[status(thm)],[p16247,c57]) ).
cnf(p16345,plain,
( ~ in(set_difference(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12) ),
inference(factoring,[status(thm)],[p16249]) ).
cnf(p6311,plain,
( in(set_difference(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12)
| preboolean(sk12) ),
inference(resolution,[status(thm)],[p6279,p5444]) ).
cnf(p8268,plain,
( in(set_difference(sk10(sk12),sk11(sk12)),sk12)
| preboolean(sk12) ),
inference(factoring,[status(thm)],[p6311]) ).
cnf(p16346,plain,
( preboolean(sk12)
| preboolean(sk12) ),
inference(resolution,[status(thm)],[p16345,p8268]) ).
cnf(p16347,plain,
preboolean(sk12),
inference(factoring,[status(thm)],[p16346]) ).
cnf(c61,plain,
~ preboolean(sk12),
inference(cnf_transformation,[status(esa)],[f33_sk]) ).
cnf(p16385,plain,
$false,
inference(resolution,[status(thm)],[p16347,c61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU105+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.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % 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:46:03 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 47.25/11.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 47.25/11.20 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------