%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SEU295+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/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:38 PM UTC 2026
% Result : Theorem 10.17s 1.79s
% Output : Proof 10.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 63 ( 28 unt; 0 def)
% Number of atoms : 126 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 128 ( 65 ~; 15 |; 44 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-4 aty)
% Number of variables : 61 ( 6 sgn 34 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc11_finset_1) ).
fof(f15_nnf,plain,
! [A,B] :
( finite(set_intersection2(A,B))
| ~ finite(A) ),
inference(nnf_transformation,[status(thm)],[f15]) ).
fof(f15_sk,plain,
! [A,B] :
( finite(set_intersection2(A,B))
| ~ finite(A) ),
inference(skolemisation,[status(esa)],[f15_nnf]) ).
cnf(c28,plain,
( finite(set_intersection2(X0,X1))
| ~ finite(X0) ),
inference(cnf_transformation,[status(esa)],[f15_sk]) ).
cnf(hi23,axiom,
ifeq(finite(X0),true,finite(set_intersection2(X0,X1)),true) = true,
inference(equality_encoding,[status(esa)],[c28]) ).
fof(f51,conjecture,
! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t15_finset_1) ).
fof(f51_neg,negated_conjecture,
~ ! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ),
inference(negated_conjecture,[status(cth)],[f51]) ).
fof(f51_nnf,plain,
? [A,B] :
( ~ finite(set_intersection2(A,B))
& finite(A) ),
inference(nnf_transformation,[status(thm)],[f51_neg]) ).
fof(f51_sk,plain,
( ~ finite(set_intersection2(sk26,sk27))
& finite(sk26) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk26,sk27])],[f51_nnf]) ).
cnf(c134,plain,
finite(sk26),
inference(cnf_transformation,[status(esa)],[f51_sk]) ).
cnf(hi121,negated_conjecture,
finite(sk26) = true,
inference(equality_encoding,[status(esa)],[c134]) ).
cnf(h209,plain,
finite(set_intersection2(sk26,V0)) = true,
inference(hyper_resolution,[status(thm)],[hi23,hi121]) ).
cnf(c135,plain,
~ finite(set_intersection2(sk26,sk27)),
inference(cnf_transformation,[status(esa)],[f51_sk]) ).
cnf(hi140,negated_conjecture,
ifeq(finite(set_intersection2(sk26,sk27)),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c135]) ).
cnf(t15,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi140,h209]) ).
cnf(t746,plain,
false = true,
inference(orient,[status(thm)],[t15]) ).
fof(f0,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f0_nnf,plain,
! [A,B] :
( ~ in(B,A)
| ~ in(A,B) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A,B] :
( ~ in(B,A)
| ~ in(A,B) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
fof(f18,axiom,
! [A] : ~ empty(powerset(A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(f18_nnf,plain,
! [A] : ~ empty(powerset(A)),
inference(nnf_transformation,[status(thm)],[f18]) ).
fof(f18_sk,plain,
! [A] : ~ empty(powerset(A)),
inference(skolemisation,[status(esa)],[f18_nnf]) ).
cnf(c33,plain,
~ empty(powerset(X0)),
inference(cnf_transformation,[status(esa)],[f18_sk]) ).
fof(f22,axiom,
~ empty(positive_rationals),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc8_arytm_3) ).
fof(f22_nnf,plain,
~ empty(positive_rationals),
inference(nnf_transformation,[status(thm)],[f22]) ).
fof(f22_sk,plain,
~ empty(positive_rationals),
inference(skolemisation,[status(esa)],[f22_nnf]) ).
cnf(c45,plain,
~ empty(positive_rationals),
inference(cnf_transformation,[status(esa)],[f22_sk]) ).
fof(f24,axiom,
? [A] :
( natural(A)
& ordinal(A)
& epsilon_connected(A)
& epsilon_transitive(A)
& ~ empty(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_arytm_3) ).
fof(f24_nnf,plain,
? [A] :
( natural(A)
& ordinal(A)
& epsilon_connected(A)
& epsilon_transitive(A)
& ~ empty(A) ),
inference(nnf_transformation,[status(thm)],[f24]) ).
fof(f24_sk,plain,
( natural(sk1)
& ordinal(sk1)
& epsilon_connected(sk1)
& epsilon_transitive(sk1)
& ~ empty(sk1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f24_nnf]) ).
cnf(c47,plain,
~ empty(sk1),
inference(cnf_transformation,[status(esa)],[f24_sk]) ).
fof(f25,axiom,
? [A] :
( finite(A)
& ~ empty(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_finset_1) ).
fof(f25_nnf,plain,
? [A] :
( finite(A)
& ~ empty(A) ),
inference(nnf_transformation,[status(thm)],[f25]) ).
fof(f25_sk,plain,
( finite(sk2)
& ~ empty(sk2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2])],[f25_nnf]) ).
cnf(c52,plain,
~ empty(sk2),
inference(cnf_transformation,[status(esa)],[f25_sk]) ).
fof(f33,axiom,
? [A] :
( ordinal(A)
& epsilon_connected(A)
& epsilon_transitive(A)
& ~ empty(A)
& element(A,positive_rationals) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_arytm_3) ).
fof(f33_nnf,plain,
? [A] :
( ordinal(A)
& epsilon_connected(A)
& epsilon_transitive(A)
& ~ empty(A)
& element(A,positive_rationals) ),
inference(nnf_transformation,[status(thm)],[f33]) ).
fof(f33_sk,plain,
( ordinal(sk10)
& epsilon_connected(sk10)
& epsilon_transitive(sk10)
& ~ empty(sk10)
& element(sk10,positive_rationals) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk10])],[f33_nnf]) ).
cnf(c72,plain,
~ empty(sk10),
inference(cnf_transformation,[status(esa)],[f33_sk]) ).
fof(f38,axiom,
? [A] :
( relation(A)
& ~ empty(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_relat_1) ).
fof(f38_nnf,plain,
? [A] :
( relation(A)
& ~ empty(A) ),
inference(nnf_transformation,[status(thm)],[f38]) ).
fof(f38_sk,plain,
( relation(sk15)
& ~ empty(sk15) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk15])],[f38_nnf]) ).
cnf(c100,plain,
~ empty(sk15),
inference(cnf_transformation,[status(esa)],[f38_sk]) ).
fof(f40,axiom,
? [A] : ~ empty(A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
fof(f40_nnf,plain,
? [A] : ~ empty(A),
inference(nnf_transformation,[status(thm)],[f40]) ).
fof(f40_sk,plain,
~ empty(sk17),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk17])],[f40_nnf]) ).
cnf(c104,plain,
~ empty(sk17),
inference(cnf_transformation,[status(esa)],[f40_sk]) ).
fof(f44,axiom,
? [A] :
( ordinal(A)
& epsilon_connected(A)
& epsilon_transitive(A)
& ~ empty(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc3_ordinal1) ).
fof(f44_nnf,plain,
? [A] :
( ordinal(A)
& epsilon_connected(A)
& epsilon_transitive(A)
& ~ empty(A) ),
inference(nnf_transformation,[status(thm)],[f44]) ).
fof(f44_sk,plain,
( ordinal(sk21)
& epsilon_connected(sk21)
& epsilon_transitive(sk21)
& ~ empty(sk21) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk21])],[f44_nnf]) ).
cnf(c117,plain,
~ empty(sk21),
inference(cnf_transformation,[status(esa)],[f44_sk]) ).
fof(f58,axiom,
! [A,B,C] :
~ ( empty(C)
& element(B,powerset(C))
& in(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_subset) ).
fof(f58_nnf,plain,
! [A,B,C] :
( ~ empty(C)
| ~ element(B,powerset(C))
| ~ in(A,B) ),
inference(nnf_transformation,[status(thm)],[f58]) ).
fof(f58_sk,plain,
! [A,B,C] :
( ~ empty(C)
| ~ element(B,powerset(C))
| ~ in(A,B) ),
inference(skolemisation,[status(esa)],[f58_nnf]) ).
cnf(c143,plain,
( ~ empty(X2)
| ~ element(X1,powerset(X2))
| ~ in(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f58_sk]) ).
fof(f60,axiom,
! [A,B] :
~ ( empty(B)
& in(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(f60_nnf,plain,
! [A,B] :
( ~ empty(B)
| ~ in(A,B) ),
inference(nnf_transformation,[status(thm)],[f60]) ).
fof(f60_sk,plain,
! [A,B] :
( ~ empty(B)
| ~ in(A,B) ),
inference(skolemisation,[status(esa)],[f60_nnf]) ).
cnf(c145,plain,
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f60_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c0,c33,c45,c47,c52,c72,c100,c104,c117,c135,c143,c145]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t746]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU295+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n012.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 13:34:35 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.17/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.17/1.79 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------