%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM013+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 12:11:27 PM UTC 2026
% Result : Theorem 0.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 6 unt; 0 def)
% Number of atoms : 289 ( 8 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 415 ( 178 ~; 184 |; 31 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 121 ( 3 sgn 47 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] : aNormalFormOfIn0(X3,X2,xR) ) )
=> ? [X2] : aNormalFormOfIn0(X2,X1,xR) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mNFRDef,axiom,
! [X1,X2] :
( ( aRewritingSystem0(X2)
& aElement0(X1) )
=> ! [X3] :
( aNormalFormOfIn0(X3,X1,X2)
<=> ( ~ ? [X4] : aReductOfIn0(X4,X3,X2)
& sdtmndtasgtdt0(X1,X2,X3)
& aElement0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNFRDef) ).
fof(m__587,hypothesis,
( isTerminating0(xR)
& aRewritingSystem0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__587) ).
fof(mTCRDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X3)
& aRewritingSystem0(X2)
& aElement0(X1) )
=> ( sdtmndtasgtdt0(X1,X2,X3)
<=> ( sdtmndtplgtdt0(X1,X2,X3)
| X1 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCRDef) ).
fof(mTCTrans,axiom,
! [X1,X2,X3,X4] :
( ( aElement0(X4)
& aElement0(X3)
& aRewritingSystem0(X2)
& aElement0(X1) )
=> ( ( sdtmndtplgtdt0(X3,X2,X4)
& sdtmndtplgtdt0(X1,X2,X3) )
=> sdtmndtplgtdt0(X1,X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCTrans) ).
fof(mTCDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X3)
& aRewritingSystem0(X2)
& aElement0(X1) )
=> ( sdtmndtplgtdt0(X1,X2,X3)
<=> ( ? [X4] :
( sdtmndtplgtdt0(X4,X2,X3)
& aReductOfIn0(X4,X1,X2)
& aElement0(X4) )
| aReductOfIn0(X3,X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCDef) ).
fof(mReduct,axiom,
! [X1,X2] :
( ( aRewritingSystem0(X2)
& aElement0(X1) )
=> ! [X3] :
( aReductOfIn0(X3,X1,X2)
=> aElement0(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mReduct) ).
fof(mTermin,axiom,
! [X1] :
( aRewritingSystem0(X1)
=> ( isTerminating0(X1)
<=> ! [X2,X3] :
( ( aElement0(X3)
& aElement0(X2) )
=> ( sdtmndtplgtdt0(X2,X1,X3)
=> iLess0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTermin) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] : aNormalFormOfIn0(X3,X2,xR) ) )
=> ? [X2] : aNormalFormOfIn0(X2,X1,xR) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,plain,
! [X16,X17,X18,X19,X20] :
( ( ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| aNormalFormOfIn0(X20,X16,X17)
| aReductOfIn0(esk5_3(X16,X17,X20),X20,X17)
| ~ sdtmndtasgtdt0(X16,X17,X20)
| ~ aElement0(X20) )
& ( ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| ~ aNormalFormOfIn0(X18,X16,X17)
| ~ aReductOfIn0(X19,X18,X17) )
& ( ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| ~ aNormalFormOfIn0(X18,X16,X17)
| sdtmndtasgtdt0(X16,X17,X18) )
& ( ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| ~ aNormalFormOfIn0(X18,X16,X17)
| aElement0(X18) ) ),
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)],[mNFRDef])])])])])])]) ).
fof(c_0_10,negated_conjecture,
! [X7,X9] :
( ~ aNormalFormOfIn0(X9,esk1_0,xR)
& ( aNormalFormOfIn0(esk2_1(X7),X7,xR)
| ~ iLess0(X7,esk1_0)
| ~ aElement0(X7) )
& aElement0(esk1_0) ),
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_8])])])])]) ).
cnf(c_0_11,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X4)
| ~ aNormalFormOfIn0(X2,X4,X3)
| ~ aReductOfIn0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ iLess0(X1,esk1_0)
| ~ aElement0(X1)
| aNormalFormOfIn0(esk2_1(X1),X1,xR) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__587]) ).
cnf(c_0_14,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X1,X2,X3)
| aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ aElement0(X1)
| ~ aReductOfIn0(X2,esk2_1(X1),xR)
| ~ iLess0(X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ sdtmndtasgtdt0(X2,X3,X1)
| ~ aElement0(X1)
| aNormalFormOfIn0(X1,X2,X3)
| aReductOfIn0(esk5_3(X2,X3,X1),X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| aElement0(esk2_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_13])]) ).
fof(c_0_18,plain,
! [X37,X38,X39] :
( ( ~ aElement0(X39)
| ~ aRewritingSystem0(X38)
| ~ aElement0(X37)
| sdtmndtasgtdt0(X37,X38,X39)
| ~ sdtmndtplgtdt0(X37,X38,X39) )
& ( ~ aElement0(X39)
| ~ aRewritingSystem0(X38)
| ~ aElement0(X37)
| sdtmndtasgtdt0(X37,X38,X39)
| X37 != X39 )
& ( ~ aElement0(X39)
| ~ aRewritingSystem0(X38)
| ~ aElement0(X37)
| sdtmndtplgtdt0(X37,X38,X39)
| X37 = X39
| ~ sdtmndtasgtdt0(X37,X38,X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])])]) ).
cnf(c_0_19,plain,
( ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ aNormalFormOfIn0(X3,X1,X2)
| sdtmndtasgtdt0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
~ aNormalFormOfIn0(X1,esk1_0,xR),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( ~ aElement0(X2)
| ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| ~ sdtmndtasgtdt0(X2,xR,esk2_1(X1))
| aNormalFormOfIn0(esk2_1(X1),X2,xR) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13])]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
aElement0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X33,X34,X35,X36] :
( sdtmndtplgtdt0(X33,X34,X36)
| ~ sdtmndtplgtdt0(X35,X34,X36)
| ~ sdtmndtplgtdt0(X33,X34,X35)
| ~ aElement0(X36)
| ~ aElement0(X35)
| ~ aRewritingSystem0(X34)
| ~ aElement0(X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCTrans])])]) ).
cnf(c_0_24,plain,
( ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| sdtmndtplgtdt0(X1,X2,X3)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| sdtmndtasgtdt0(X1,xR,esk2_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_13])]) ).
fof(c_0_26,plain,
! [X28,X29,X30,X32] :
( ( ~ aElement0(X30)
| ~ aRewritingSystem0(X29)
| ~ aElement0(X28)
| sdtmndtplgtdt0(X28,X29,X30)
| ~ sdtmndtplgtdt0(X32,X29,X30)
| ~ aReductOfIn0(X32,X28,X29)
| ~ aElement0(X32) )
& ( ~ aElement0(X30)
| ~ aRewritingSystem0(X29)
| ~ aElement0(X28)
| sdtmndtplgtdt0(X28,X29,X30)
| ~ aReductOfIn0(X30,X28,X29) )
& ( ~ aElement0(X30)
| ~ aRewritingSystem0(X29)
| ~ aElement0(X28)
| ~ sdtmndtplgtdt0(X28,X29,X30)
| aReductOfIn0(X30,X28,X29)
| sdtmndtplgtdt0(esk6_3(X28,X29,X30),X29,X30) )
& ( ~ aElement0(X30)
| ~ aRewritingSystem0(X29)
| ~ aElement0(X28)
| ~ sdtmndtplgtdt0(X28,X29,X30)
| aReductOfIn0(X30,X28,X29)
| aReductOfIn0(esk6_3(X28,X29,X30),X28,X29) )
& ( ~ aElement0(X30)
| ~ aRewritingSystem0(X29)
| ~ aElement0(X28)
| ~ sdtmndtplgtdt0(X28,X29,X30)
| aReductOfIn0(X30,X28,X29)
| aElement0(esk6_3(X28,X29,X30)) ) ),
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)],[mTCDef])])])])])]) ).
fof(c_0_27,plain,
! [X40,X41,X42] :
( aElement0(X42)
| ~ aReductOfIn0(X42,X40,X41)
| ~ aRewritingSystem0(X41)
| ~ aElement0(X40) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mReduct])])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| ~ sdtmndtasgtdt0(esk1_0,xR,esk2_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_29,plain,
( ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| sdtmndtasgtdt0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( ~ sdtmndtplgtdt0(X3,X2,X4)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| sdtmndtplgtdt0(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| sdtmndtplgtdt0(X1,xR,esk2_1(X1))
| esk2_1(X1) = X1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_13])]),c_0_17]) ).
cnf(c_0_32,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X2,X3)
| sdtmndtplgtdt0(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| ~ sdtmndtplgtdt0(esk1_0,xR,esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_13]),c_0_22])]),c_0_17]) ).
cnf(c_0_35,negated_conjecture,
( ~ aElement0(X2)
| ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| ~ sdtmndtplgtdt0(X2,xR,X1)
| sdtmndtplgtdt0(X2,xR,esk2_1(X1))
| esk2_1(X1) = X1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_13])]),c_0_17]) ).
fof(c_0_36,plain,
! [X10,X11,X12] :
( ( ~ aRewritingSystem0(X10)
| isTerminating0(X10)
| ~ iLess0(esk4_1(X10),esk3_1(X10)) )
& ( ~ aRewritingSystem0(X10)
| isTerminating0(X10)
| sdtmndtplgtdt0(esk3_1(X10),X10,esk4_1(X10)) )
& ( ~ aRewritingSystem0(X10)
| isTerminating0(X10)
| aElement0(esk4_1(X10)) )
& ( ~ aRewritingSystem0(X10)
| isTerminating0(X10)
| aElement0(esk3_1(X10)) )
& ( ~ aRewritingSystem0(X10)
| iLess0(X12,X11)
| ~ sdtmndtplgtdt0(X11,X10,X12)
| ~ aElement0(X12)
| ~ aElement0(X11)
| ~ isTerminating0(X10) ) ),
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)],[mTermin])])])])])]) ).
cnf(c_0_37,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X1,X2)
| sdtmndtplgtdt0(X1,X2,X3) ),
inference(csr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| ~ sdtmndtplgtdt0(esk1_0,xR,X1)
| esk2_1(X1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_22])]) ).
cnf(c_0_39,plain,
( ~ aRewritingSystem0(X1)
| ~ sdtmndtplgtdt0(X2,X1,X3)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ isTerminating0(X1)
| iLess0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ sdtmndtasgtdt0(X2,X3,X1)
| sdtmndtplgtdt0(X1,X3,esk5_3(X2,X3,X1))
| aNormalFormOfIn0(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_16]) ).
cnf(c_0_41,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ sdtmndtasgtdt0(X2,X3,X1)
| aElement0(esk5_3(X2,X3,X1))
| aNormalFormOfIn0(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_42,negated_conjecture,
( ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| ~ sdtmndtplgtdt0(esk1_0,xR,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_38]) ).
cnf(c_0_43,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ sdtmndtasgtdt0(X2,X3,X1)
| ~ isTerminating0(X3)
| iLess0(esk5_3(X2,X3,X1),X1)
| aNormalFormOfIn0(X1,X2,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( ~ aElement0(X1)
| ~ aElement0(esk5_3(X1,X2,esk1_0))
| ~ aRewritingSystem0(X2)
| ~ sdtmndtplgtdt0(esk1_0,xR,esk5_3(X1,X2,esk1_0))
| ~ sdtmndtasgtdt0(X1,X2,esk1_0)
| ~ isTerminating0(X2)
| aNormalFormOfIn0(esk1_0,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_22])]) ).
cnf(c_0_45,hypothesis,
isTerminating0(xR),
inference(split_conjunct,[status(thm)],[m__587]) ).
cnf(c_0_46,negated_conjecture,
( ~ aElement0(X1)
| ~ aElement0(esk5_3(X1,xR,esk1_0))
| ~ sdtmndtasgtdt0(X1,xR,esk1_0)
| aNormalFormOfIn0(esk1_0,X1,xR) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_40]),c_0_45]),c_0_13]),c_0_22])]) ).
cnf(c_0_47,negated_conjecture,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(X1,xR,esk1_0)
| aNormalFormOfIn0(esk1_0,X1,xR) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_41]),c_0_13]),c_0_22])]) ).
cnf(c_0_48,plain,
( ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X1)
| X1 != X2
| sdtmndtasgtdt0(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_49,negated_conjecture,
~ sdtmndtasgtdt0(esk1_0,xR,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_47]),c_0_22])]) ).
cnf(c_0_50,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| sdtmndtasgtdt0(X1,X2,X1) ),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_13]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM013+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 14:18:55 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 0.10/0.46 % Version: 3.5.1
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % new_bool_3 with pid 2638377 completed with status 0
% 0.10/0.46 % Result found by new_bool_3
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.46 % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.10/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.46 % SubtermCWHack with pid 2638381 completed with status 0
% 0.10/0.46 % Result found by SubtermCWHack
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.46 % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.10/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.46 % Preprocessing time : 0.002 s
% 0.10/0.46
% 0.10/0.46 % Proof found!
% 0.10/0.46 % SZS status Theorem
% 0.10/0.46 % SZS output start CNFRefutation
% See solution above
% 0.10/0.46 % Parsed axioms : 15
% 0.10/0.46 % Removed by relevancy pruning/SinE : 2
% 0.10/0.46 % Initial clauses : 29
% 0.10/0.46 % Removed in clause preprocessing : 4
% 0.10/0.46 % Initial clauses in saturation : 25
% 0.10/0.46 % Processed clauses : 140
% 0.10/0.46 % ...of these trivial : 0
% 0.10/0.46 % ...subsumed : 54
% 0.10/0.46 % ...remaining for further processing : 86
% 0.10/0.46 % Other redundant clauses eliminated : 1
% 0.10/0.46 % Clauses deleted for lack of memory : 0
% 0.10/0.46 % Backward-subsumed : 4
% 0.10/0.46 % Backward-rewritten : 0
% 0.10/0.46 % Generated clauses : 229
% 0.10/0.46 % ...of the previous two non-redundant : 204
% 0.10/0.46 % ...aggressively subsumed : 0
% 0.10/0.46 % Contextual simplify-reflections : 38
% 0.10/0.46 % Paramodulations : 228
% 0.10/0.46 % Factorizations : 0
% 0.10/0.46 % NegExts : 0
% 0.10/0.46 % Equation resolutions : 1
% 0.10/0.46 % Disequality decompositions : 0
% 0.10/0.46 % Total rewrite steps : 145
% 0.10/0.46 % ...of those cached : 142
% 0.10/0.46 % Propositional unsat checks : 0
% 0.10/0.46 % Propositional check models : 0
% 0.10/0.46 % Propositional check unsatisfiable : 0
% 0.10/0.46 % Propositional clauses : 0
% 0.10/0.46 % Propositional clauses after purity: 0
% 0.10/0.46 % Propositional unsat core size : 0
% 0.10/0.46 % Propositional preprocessing time : 0.000
% 0.10/0.46 % Propositional encoding time : 0.000
% 0.10/0.46 % Propositional solver time : 0.000
% 0.10/0.46 % Success case prop preproc time : 0.000
% 0.10/0.46 % Success case prop encoding time : 0.000
% 0.10/0.46 % Success case prop solver time : 0.000
% 0.10/0.46 % Current number of processed clauses : 81
% 0.10/0.46 % Positive orientable unit clauses : 3
% 0.10/0.46 % Positive unorientable unit clauses: 0
% 0.10/0.46 % Negative unit clauses : 3
% 0.10/0.46 % Non-unit-clauses : 75
% 0.10/0.46 % Current number of unprocessed clauses: 81
% 0.10/0.46 % ...number of literals in the above : 745
% 0.10/0.46 % Current number of archived formulas : 0
% 0.10/0.46 % Current number of archived clauses : 4
% 0.10/0.46 % Clause-clause subsumption calls (NU) : 2488
% 0.10/0.46 % Rec. Clause-clause subsumption calls : 257
% 0.10/0.46 % Non-unit clause-clause subsumptions : 87
% 0.10/0.46 % Unit Clause-clause subsumption calls : 35
% 0.10/0.46 % Rewrite failures with RHS unbound : 0
% 0.10/0.46 % BW rewrite match attempts : 0
% 0.10/0.46 % BW rewrite match successes : 0
% 0.10/0.46 % Condensation attempts : 0
% 0.10/0.46 % Condensation successes : 0
% 0.10/0.46 % Termbank termtop insertions : 9067
% 0.10/0.46 % Search garbage collected termcells : 727
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.020 s
% 0.10/0.46 % System time : 0.002 s
% 0.10/0.46 % Total time : 0.022 s
% 0.10/0.46 % Maximum resident set size: 3652 pages
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.023 s
% 0.10/0.46 % System time : 0.005 s
% 0.10/0.46 % Total time : 0.028 s
% 0.10/0.46 % Maximum resident set size: 4864 pages
% 0.10/0.46 % E exiting
%------------------------------------------------------------------------------