%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU430+4 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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 : Thu Sep 24 02:25:09 PM UTC 2026
% Result : Theorem 89.20s 20.75s
% Output : CNFRefutation 89.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 84 ( 35 unt; 0 def)
% Number of atoms : 194 ( 68 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 185 ( 75 ~; 60 |; 29 &)
% ( 10 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 82 ( 4 sgn 50 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t30_relset_2,conjecture,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_relset_2) ).
fof(t91_orders_1,axiom,
! [X1] :
( ~ ( ! [X2] :
~ ( r2_hidden(X2,X1)
& X2 != k1_xboole_0 )
& k3_tarski(X1) != k1_xboole_0 )
& ~ ( k3_tarski(X1) = k1_xboole_0
& ? [X2] :
( r2_hidden(X2,X1)
& X2 != k1_xboole_0 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+59.ax',t91_orders_1) ).
fof(t69_enumset1,axiom,
! [X1] : k2_tarski(X1,X1) = k1_tarski(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+5.ax',t69_enumset1) ).
fof(t1_card_5,axiom,
( np__2 = k2_tarski(np__0,np__1)
& np__1 = k1_tarski(np__0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+153.ax',t1_card_5) ).
fof(redefinition_k5_setfam_1,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> k5_setfam_1(X1,X2) = k3_tarski(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+8.ax',redefinition_k5_setfam_1) ).
fof(t1_zfmisc_1,axiom,
k1_zfmisc_1(k1_xboole_0) = k1_tarski(k1_xboole_0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+6.ax',t1_zfmisc_1) ).
fof(t51_card_1,axiom,
np__0 = k1_xboole_0,
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+54.ax',t51_card_1) ).
fof(fc2_msafree1,axiom,
! [X1] :
( ( v1_setfam_1(X1)
& ~ v1_xboole_0(X1) )
=> ~ v1_xboole_0(k3_tarski(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+421.ax',fc2_msafree1) ).
fof(d9_setfam_1,axiom,
! [X1] :
( v1_setfam_1(X1)
<=> ~ r2_hidden(k1_xboole_0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+8.ax',d9_setfam_1) ).
fof(t100_zfmisc_1,axiom,
! [X1] : r1_tarski(X1,k1_zfmisc_1(k3_tarski(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+6.ax',t100_zfmisc_1) ).
fof(t37_zfmisc_1,axiom,
! [X1,X2] :
( r1_tarski(k1_tarski(X1),X2)
<=> r2_hidden(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+6.ax',t37_zfmisc_1) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) )
& ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',d2_subset_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( r1_tarski(X2,X1)
& r1_tarski(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',d10_xboole_0) ).
fof(fc1_xboole_0,axiom,
v1_xboole_0(k1_xboole_0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',fc1_xboole_0) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( v1_xboole_0(X2)
& r2_hidden(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+3.ax',t7_boole) ).
fof(t9_measure1,axiom,
! [X1] : m1_subset_1(k1_tarski(k1_xboole_0),k1_zfmisc_1(k1_zfmisc_1(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+155.ax',t9_measure1) ).
fof(t99_zfmisc_1,axiom,
! [X1] : k3_tarski(k1_zfmisc_1(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+6.ax',t99_zfmisc_1) ).
fof(c_0_17,negated_conjecture,
~ ! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
inference(assume_negation,[status(cth)],[t30_relset_2]) ).
fof(c_0_18,plain,
! [X1] :
( ~ ( ! [X2] :
~ ( r2_hidden(X2,X1)
& X2 != k1_xboole_0 )
& k3_tarski(X1) != k1_xboole_0 )
& ~ ( k3_tarski(X1) = k1_xboole_0
& ? [X2] :
( r2_hidden(X2,X1)
& X2 != k1_xboole_0 ) ) ),
inference(fof_simplification,[status(thm)],[t91_orders_1]) ).
fof(c_0_19,plain,
! [X2105] : k2_tarski(X2105,X2105) = k1_tarski(X2105),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_20,negated_conjecture,
! [X55] :
( ( X55 = k1_xboole_0
| ~ r2_hidden(X55,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0 )
& ( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| esk3_0 != k1_xboole_0 )
& ( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| r2_hidden(esk3_0,esk2_0) )
& m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])])]) ).
fof(c_0_21,plain,
! [X656,X657,X658] :
( ( k3_tarski(X658) = k1_xboole_0
| r2_hidden(esk103_1(X658),X658) )
& ( k3_tarski(X658) = k1_xboole_0
| esk103_1(X658) != k1_xboole_0 )
& ( k3_tarski(X656) != k1_xboole_0
| ~ r2_hidden(X657,X656)
| X657 = k1_xboole_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])])]) ).
cnf(c_0_22,plain,
np__1 = k1_tarski(np__0),
inference(split_conjunct,[status(thm)],[t1_card_5]) ).
cnf(c_0_23,plain,
k2_tarski(X1,X1) = k1_tarski(X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_24,plain,
! [X211,X212] :
( k5_setfam_1(X211,X212) = k3_tarski(X212)
| ~ m1_subset_1(X212,k1_zfmisc_1(k1_zfmisc_1(X211))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])])]) ).
cnf(c_0_25,negated_conjecture,
( ~ r2_hidden(X1,esk2_0)
| X1 = k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( k3_tarski(X1) = k1_xboole_0
| r2_hidden(esk103_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( esk103_1(X1) != k1_xboole_0
| k3_tarski(X1) = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
k1_zfmisc_1(k1_xboole_0) = k1_tarski(k1_xboole_0),
inference(split_conjunct,[status(thm)],[t1_zfmisc_1]) ).
cnf(c_0_29,plain,
np__1 = k2_tarski(np__0,np__0),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
np__0 = k1_xboole_0,
inference(split_conjunct,[status(thm)],[t51_card_1]) ).
fof(c_0_31,plain,
! [X1] :
( ( v1_setfam_1(X1)
& ~ v1_xboole_0(X1) )
=> ~ v1_xboole_0(k3_tarski(X1)) ),
inference(fof_simplification,[status(thm)],[fc2_msafree1]) ).
fof(c_0_32,plain,
! [X1] :
( v1_setfam_1(X1)
<=> ~ r2_hidden(k1_xboole_0,X1) ),
inference(fof_simplification,[status(thm)],[d9_setfam_1]) ).
fof(c_0_33,plain,
! [X639] : r1_tarski(X639,k1_zfmisc_1(k3_tarski(X639))),
inference(variable_rename,[status(thm)],[t100_zfmisc_1]) ).
cnf(c_0_34,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2)))
| k5_setfam_1(X2,X1) = k3_tarski(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,negated_conjecture,
( k3_tarski(esk2_0) = k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_36,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_37,plain,
k1_zfmisc_1(k1_xboole_0) = k2_tarski(k1_xboole_0,k1_xboole_0),
inference(rw,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_38,plain,
k2_tarski(k1_xboole_0,k1_xboole_0) = np__1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_30]) ).
fof(c_0_39,plain,
! [X371,X372] :
( ( r1_tarski(k1_tarski(X371),X372)
| ~ r2_hidden(X371,X372) )
& ( r2_hidden(X371,X372)
| ~ r1_tarski(k1_tarski(X371),X372) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_zfmisc_1])])]) ).
fof(c_0_40,plain,
! [X1,X2] :
( ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) )
& ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_41,plain,
! [X2602] :
( ~ v1_xboole_0(k3_tarski(X2602))
| ~ v1_setfam_1(X2602)
| v1_xboole_0(X2602) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])]) ).
fof(c_0_42,plain,
! [X2580] :
( ( v1_setfam_1(X2580)
| r2_hidden(k1_xboole_0,X2580) )
& ( ~ r2_hidden(k1_xboole_0,X2580)
| ~ v1_setfam_1(X2580) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])]) ).
fof(c_0_43,plain,
! [X296,X297] :
( ( X296 = X297
| ~ r1_tarski(X297,X296)
| ~ r1_tarski(X296,X297) )
& ( X296 != X297
| r1_tarski(X297,X296) )
& ( X296 != X297
| r1_tarski(X296,X297) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_44,plain,
r1_tarski(X1,k1_zfmisc_1(k3_tarski(X1))),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_45,negated_conjecture,
k3_tarski(esk2_0) = k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_46,plain,
k1_zfmisc_1(k1_xboole_0) = np__1,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_47,plain,
( ~ r2_hidden(X1,X2)
| r1_tarski(k1_tarski(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_48,plain,
! [X165,X166] :
( ( ~ v1_xboole_0(X165)
| m1_subset_1(X166,X165)
| ~ v1_xboole_0(X166) )
& ( ~ v1_xboole_0(X165)
| v1_xboole_0(X166)
| ~ m1_subset_1(X166,X165) )
& ( v1_xboole_0(X165)
| m1_subset_1(X166,X165)
| ~ r2_hidden(X166,X165) )
& ( v1_xboole_0(X165)
| r2_hidden(X166,X165)
| ~ m1_subset_1(X166,X165) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])]) ).
cnf(c_0_49,plain,
( ~ v1_xboole_0(k3_tarski(X1))
| ~ v1_setfam_1(X1)
| v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,plain,
( v1_setfam_1(X1)
| r2_hidden(k1_xboole_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,plain,
( ~ r1_tarski(X2,X1)
| ~ r1_tarski(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_52,negated_conjecture,
r1_tarski(esk2_0,np__1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_53,plain,
( ~ r2_hidden(X1,X2)
| r1_tarski(k2_tarski(X1,X1),X2) ),
inference(rw,[status(thm)],[c_0_47,c_0_23]) ).
cnf(c_0_54,plain,
( ~ v1_xboole_0(X2)
| ~ v1_xboole_0(X1)
| m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_55,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_56,plain,
( ~ v1_xboole_0(k3_tarski(X1))
| r2_hidden(k1_xboole_0,X1)
| v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
( ~ r1_tarski(np__1,esk2_0)
| esk2_0 = np__1 ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
( ~ r2_hidden(k1_xboole_0,X1)
| r1_tarski(np__1,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_38]) ).
cnf(c_0_59,plain,
( ~ v1_xboole_0(X1)
| m1_subset_1(X1,k1_xboole_0) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
( r2_hidden(k1_xboole_0,esk2_0)
| v1_xboole_0(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_45]),c_0_55])]) ).
cnf(c_0_61,negated_conjecture,
( ~ r2_hidden(k1_xboole_0,esk2_0)
| esk2_0 = np__1 ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
( r2_hidden(k1_xboole_0,esk2_0)
| m1_subset_1(esk2_0,k1_xboole_0) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
fof(c_0_63,plain,
! [X163,X164] :
( ~ v1_xboole_0(X164)
| ~ r2_hidden(X163,X164) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
cnf(c_0_64,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| r2_hidden(esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_65,plain,
( ~ v1_xboole_0(X2)
| ~ m1_subset_1(X1,X2)
| v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_66,negated_conjecture,
( m1_subset_1(esk2_0,k1_xboole_0)
| esk2_0 = np__1 ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,plain,
( ~ v1_xboole_0(X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_68,negated_conjecture,
r2_hidden(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_34]),c_0_36])]),c_0_45])]) ).
fof(c_0_69,plain,
! [X146] : m1_subset_1(k1_tarski(k1_xboole_0),k1_zfmisc_1(k1_zfmisc_1(X146))),
inference(variable_rename,[status(thm)],[t9_measure1]) ).
cnf(c_0_70,plain,
( k3_tarski(X2) != k1_xboole_0
| ~ r2_hidden(X1,X2)
| X1 = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_71,negated_conjecture,
( v1_xboole_0(esk2_0)
| esk2_0 = np__1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_55])]) ).
cnf(c_0_72,negated_conjecture,
~ v1_xboole_0(esk2_0),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
fof(c_0_73,plain,
! [X638] : k3_tarski(k1_zfmisc_1(X638)) = X638,
inference(variable_rename,[status(thm)],[t99_zfmisc_1]) ).
cnf(c_0_74,plain,
m1_subset_1(k1_tarski(k1_xboole_0),k1_zfmisc_1(k1_zfmisc_1(X1))),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_75,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| esk3_0 != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_76,negated_conjecture,
esk3_0 = k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_68]),c_0_45])]) ).
cnf(c_0_77,negated_conjecture,
esk2_0 = np__1,
inference(sr,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_78,plain,
k3_tarski(k1_zfmisc_1(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_79,plain,
m1_subset_1(k2_tarski(k1_xboole_0,k1_xboole_0),k1_zfmisc_1(k1_zfmisc_1(X1))),
inference(rw,[status(thm)],[c_0_74,c_0_23]) ).
cnf(c_0_80,negated_conjecture,
k5_setfam_1(esk1_0,np__1) != k1_xboole_0,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]),c_0_77]) ).
cnf(c_0_81,plain,
k3_tarski(np__1) = k1_xboole_0,
inference(spm,[status(thm)],[c_0_78,c_0_46]) ).
cnf(c_0_82,plain,
m1_subset_1(np__1,k1_zfmisc_1(k1_zfmisc_1(X1))),
inference(rw,[status(thm)],[c_0_79,c_0_38]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_34]),c_0_81]),c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU430+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.51 % Computer : n012.cluster.edu
% 0.04/0.51 % Model : x86_64 x86_64
% 0.04/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.51 % Memory : 8046.5625MB
% 0.04/0.51 % OS : Linux 6.8.0-71-generic
% 0.04/0.51 % CPULimit : 300
% 0.04/0.51 % WCLimit : 300
% 0.04/0.51 % DateTime : Mon Sep 21 06:29:38 UTC 2026
% 0.04/0.51 % CPUTime :
% 0.04/0.51 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.54 Running first-order theorem proving
% 0.07/0.54 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 89.20/20.75 % Version: 3.5.1
% 89.20/20.75 % Preprocessing class: FMLLMLLLSSSNFFN.
% 89.20/20.75 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 89.20/20.75 % Starting new_bool_3 with 894s (3) cores
% 89.20/20.75 % Starting new_bool_1 with 894s (3) cores
% 89.20/20.75 % Starting sh5l with 298s (1) cores
% 89.20/20.75 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 89.20/20.75 % G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 1780113 completed with status 0
% 89.20/20.75 % Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 89.20/20.75 % Preprocessing class: FMLLMLLLSSSNFFN.
% 89.20/20.75 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 89.20/20.75 % Starting new_bool_3 with 894s (3) cores
% 89.20/20.75 % Starting new_bool_1 with 894s (3) cores
% 89.20/20.75 % Starting sh5l with 298s (1) cores
% 89.20/20.75 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 89.20/20.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 89.20/20.75 % SinE strategy is gf120_h_gu_RUU_F100_L01000
% 89.20/20.75 % Search class: FGHSM-SMLM31-DFFFFFNN
% 89.20/20.75 % Scheduled 7 strats onto 1 cores with 298 seconds (298 total)
% 89.20/20.75 % Starting SubtermCWHack with 27s (1) cores
% 89.20/20.75 % SubtermCWHack with pid 1780114 completed with status 0
% 89.20/20.75 % Result found by SubtermCWHack
% 89.20/20.75 % Preprocessing class: FMLLMLLLSSSNFFN.
% 89.20/20.75 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 89.20/20.75 % Starting new_bool_3 with 894s (3) cores
% 89.20/20.75 % Starting new_bool_1 with 894s (3) cores
% 89.20/20.75 % Starting sh5l with 298s (1) cores
% 89.20/20.75 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 89.20/20.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 89.20/20.75 % SinE strategy is gf120_h_gu_RUU_F100_L01000
% 89.20/20.75 % Search class: FGHSM-SMLM31-DFFFFFNN
% 89.20/20.75 % Scheduled 7 strats onto 1 cores with 298 seconds (298 total)
% 89.20/20.75 % Starting SubtermCWHack with 27s (1) cores
% 89.20/20.75 % Preprocessing time : 0.069 s
% 89.20/20.75
% 89.20/20.75 % Proof found!
% 89.20/20.75 % SZS status Theorem
% 89.20/20.75 % SZS output start CNFRefutation
% See solution above
% 89.20/20.75 % Parsed axioms : 71112
% 89.20/20.75 % Removed by relevancy pruning/SinE : 70111
% 89.20/20.75 % Initial clauses : 2086
% 89.20/20.75 % Removed in clause preprocessing : 47
% 89.20/20.75 % Initial clauses in saturation : 2039
% 89.20/20.75 % Processed clauses : 42178
% 89.20/20.75 % ...of these trivial : 572
% 89.20/20.75 % ...subsumed : 30110
% 89.20/20.75 % ...remaining for further processing : 11496
% 89.20/20.75 % Other redundant clauses eliminated : 2086
% 89.20/20.75 % Clauses deleted for lack of memory : 0
% 89.20/20.75 % Backward-subsumed : 429
% 89.20/20.75 % Backward-rewritten : 1145
% 89.20/20.75 % Generated clauses : 517833
% 89.20/20.75 % ...of the previous two non-redundant : 486383
% 89.20/20.75 % ...aggressively subsumed : 0
% 89.20/20.75 % Contextual simplify-reflections : 243
% 89.20/20.75 % Paramodulations : 515599
% 89.20/20.75 % Factorizations : 40
% 89.20/20.75 % NegExts : 0
% 89.20/20.75 % Equation resolutions : 2112
% 89.20/20.75 % Disequality decompositions : 0
% 89.20/20.75 % Total rewrite steps : 104988
% 89.20/20.75 % ...of those cached : 99578
% 89.20/20.75 % Propositional unsat checks : 0
% 89.20/20.75 % Propositional check models : 0
% 89.20/20.75 % Propositional check unsatisfiable : 0
% 89.20/20.75 % Propositional clauses : 0
% 89.20/20.75 % Propositional clauses after purity: 0
% 89.20/20.75 % Propositional unsat core size : 0
% 89.20/20.75 % Propositional preprocessing time : 0.000
% 89.20/20.75 % Propositional encoding time : 0.000
% 89.20/20.75 % Propositional solver time : 0.000
% 89.20/20.75 % Success case prop preproc time : 0.000
% 89.20/20.75 % Success case prop encoding time : 0.000
% 89.20/20.75 % Success case prop solver time : 0.000
% 89.20/20.75 % Current number of processed clauses : 9666
% 89.20/20.75 % Positive orientable unit clauses : 1311
% 89.20/20.75 % Positive unorientable unit clauses: 3
% 89.20/20.75 % Negative unit clauses : 3557
% 89.20/20.75 % Non-unit-clauses : 4795
% 89.20/20.75 % Current number of unprocessed clauses: 444513
% 89.20/20.75 % ...number of literals in the above : 2133945
% 89.20/20.75 % Current number of archived formulas : 0
% 89.20/20.75 % Current number of archived clauses : 1673
% 89.20/20.75 % Clause-clause subsumption calls (NU) : 7177953
% 89.20/20.75 % Rec. Clause-clause subsumption calls : 2792769
% 89.20/20.75 % Non-unit clause-clause subsumptions : 7157
% 89.20/20.75 % Unit Clause-clause subsumption calls : 1836537
% 89.20/20.75 % Rewrite failures with RHS unbound : 0
% 89.20/20.75 % BW rewrite match attempts : 1026
% 89.20/20.75 % BW rewrite match successes : 198
% 89.20/20.75 % Condensation attempts : 0
% 89.20/20.75 % Condensation successes : 0
% 89.20/20.75 % Termbank termtop insertions : 10728681
% 89.20/20.75 % Search garbage collected termcells : 803400
% 89.20/20.75
% 89.20/20.75 % -------------------------------------------------
% 89.20/20.75 % User time : 17.147 s
% 89.20/20.75 % System time : 0.569 s
% 89.20/20.75 % Total time : 17.716 s
% 89.20/20.75 % Maximum resident set size: 149220 pages
% 89.20/20.75
% 89.20/20.75 % -------------------------------------------------
% 89.20/20.75 % User time : 19.107 s
% 89.20/20.75 % System time : 0.696 s
% 89.20/20.75 % Total time : 19.803 s
% 89.20/20.75 % Maximum resident set size: 121600 pages
% 89.20/20.75 % E exiting
%------------------------------------------------------------------------------