%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SEU127+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n012.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:01 PM UTC 2026
% Result : Theorem 45.38s 21.13s
% Output : Proof 45.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 67 ( 6 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 76 ( 28 ~; 27 |; 17 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 47 ( 3 sgn 25 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [A,B,C] :
( C = set_intersection2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,B)
& in(D,A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_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_intersection2(A,B) )
& ( ! [D] :
( ( ~ in(D,B)
| ~ in(D,A)
| in(D,C) )
& ( ( in(D,B)
& in(D,A) )
| ~ in(D,C) ) )
| C != set_intersection2(A,B) ) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [C,A,B,D] :
( ( ( in(sk3(A,B,C),B)
& in(sk3(A,B,C),A)
& ~ in(sk3(A,B,C),C) )
| ( ( ~ in(sk3(A,B,C),B)
| ~ in(sk3(A,B,C),A) )
& in(sk3(A,B,C),C) )
| C = set_intersection2(A,B) )
& ( ( ( ~ in(D,B)
| ~ in(D,A)
| in(D,C) )
& ( ( in(D,B)
& in(D,A) )
| ~ in(D,C) ) )
| C != set_intersection2(A,B) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk3])],[f7_nnf]) ).
cnf(c20,plain,
( in(X3,X0)
| ~ in(X3,X2)
| X2 != set_intersection2(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(p158,plain,
( in(X0,X1)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(equality_resolution,[status(thm)],[c20]) ).
fof(f6,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f6_nnf,plain,
! [A,B] :
( ( ? [C] :
( ~ in(C,B)
& in(C,A) )
| subset(A,B) )
& ( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [A,B,C] :
( ( ( ~ in(sk2(A,B),B)
& in(sk2(A,B),A) )
| subset(A,B) )
& ( in(C,B)
| ~ in(C,A)
| ~ subset(A,B) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2])],[f6_nnf]) ).
cnf(c18,plain,
( in(sk2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p161,plain,
( subset(set_intersection2(X0,X1),X2)
| in(sk2(set_intersection2(X0,X1),X2),X0) ),
inference(resolution,[status(thm)],[p158,c18]) ).
cnf(c19,plain,
( ~ in(sk2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p1524,plain,
( subset(set_intersection2(X0,X1),X0)
| subset(set_intersection2(X0,X1),X0) ),
inference(resolution,[status(thm)],[p161,c19]) ).
cnf(p1540,plain,
subset(set_intersection2(X0,X1),X0),
inference(factoring,[status(thm)],[p1524]) ).
fof(f22,conjecture,
! [A,B] : subset(set_intersection2(A,B),A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f22_neg,negated_conjecture,
~ ! [A,B] : subset(set_intersection2(A,B),A),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f22_nnf,plain,
? [A,B] : ~ subset(set_intersection2(A,B),A),
inference(nnf_transformation,[status(thm)],[f22_neg]) ).
fof(f22_sk,plain,
~ subset(set_intersection2(sk6,sk7),sk6),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk6,sk7])],[f22_nnf]) ).
cnf(c44,plain,
~ subset(set_intersection2(sk6,sk7),sk6),
inference(cnf_transformation,[status(esa)],[f22_sk]) ).
cnf(p1541,plain,
$false,
inference(resolution,[status(thm)],[p1540,c44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU127+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.05/15.34 % Computer : n012.cluster.edu
% 0.05/15.34 % Model : x86_64 x86_64
% 0.05/15.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/15.34 % Memory : 8046.5625MB
% 0.05/15.34 % OS : Linux 6.8.0-71-generic
% 0.05/15.34 % CPULimit : 300
% 0.05/15.34 % WCLimit : 300
% 0.05/15.34 % DateTime : Thu Sep 24 12:50:26 UTC 2026
% 0.05/15.34 % CPUTime :
% 0.05/15.34 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 45.38/21.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 45.38/21.13 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------