%------------------------------------------------------------------------------
% File : E-SAT---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 : n009.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:12:19 PM UTC 2026
% Result : Theorem 0.15s 5.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 55 ( 7 unt; 0 def)
% Number of atoms : 297 ( 4 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 411 ( 169 ~; 189 |; 31 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 4 ( 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 : 117 ( 4 sgn 47 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(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__,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(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(m__587,hypothesis,
( isTerminating0(xR)
& aRewritingSystem0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__587) ).
fof(mTCRTrans,axiom,
! [X1,X2,X3,X4] :
( ( aElement0(X4)
& aElement0(X3)
& aRewritingSystem0(X2)
& aElement0(X1) )
=> ( ( sdtmndtasgtdt0(X3,X2,X4)
& sdtmndtasgtdt0(X1,X2,X3) )
=> sdtmndtasgtdt0(X1,X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCRTrans) ).
fof(c_0_8,plain,
! [X25,X26,X27] :
( ( ~ aElement0(X27)
| ~ aRewritingSystem0(X26)
| ~ aElement0(X25)
| sdtmndtasgtdt0(X25,X26,X27)
| ~ sdtmndtplgtdt0(X25,X26,X27) )
& ( ~ aElement0(X27)
| ~ aRewritingSystem0(X26)
| ~ aElement0(X25)
| sdtmndtasgtdt0(X25,X26,X27)
| X25 != X27 )
& ( ~ aElement0(X27)
| ~ aRewritingSystem0(X26)
| ~ aElement0(X25)
| sdtmndtplgtdt0(X25,X26,X27)
| X25 = X27
| ~ sdtmndtasgtdt0(X25,X26,X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])])]) ).
fof(c_0_9,plain,
! [X16,X17,X18,X20] :
( ( ~ aElement0(X18)
| ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| sdtmndtplgtdt0(X16,X17,X18)
| ~ sdtmndtplgtdt0(X20,X17,X18)
| ~ aReductOfIn0(X20,X16,X17)
| ~ aElement0(X20) )
& ( ~ aElement0(X18)
| ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| sdtmndtplgtdt0(X16,X17,X18)
| ~ aReductOfIn0(X18,X16,X17) )
& ( ~ aElement0(X18)
| ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| ~ sdtmndtplgtdt0(X16,X17,X18)
| aReductOfIn0(X18,X16,X17)
| sdtmndtplgtdt0(esk1_3(X16,X17,X18),X17,X18) )
& ( ~ aElement0(X18)
| ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| ~ sdtmndtplgtdt0(X16,X17,X18)
| aReductOfIn0(X18,X16,X17)
| aReductOfIn0(esk1_3(X16,X17,X18),X16,X17) )
& ( ~ aElement0(X18)
| ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| ~ sdtmndtplgtdt0(X16,X17,X18)
| aReductOfIn0(X18,X16,X17)
| aElement0(esk1_3(X16,X17,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(fof_nnf,[status(thm)],[mTCDef])])])])])]) ).
fof(c_0_10,plain,
! [X8,X9,X10] :
( aElement0(X10)
| ~ aReductOfIn0(X10,X8,X9)
| ~ aRewritingSystem0(X9)
| ~ aElement0(X8) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mReduct])])])]) ).
fof(c_0_11,plain,
! [X55,X56,X57,X58,X59] :
( ( ~ aRewritingSystem0(X56)
| ~ aElement0(X55)
| aNormalFormOfIn0(X59,X55,X56)
| aReductOfIn0(esk12_3(X55,X56,X59),X59,X56)
| ~ sdtmndtasgtdt0(X55,X56,X59)
| ~ aElement0(X59) )
& ( ~ aRewritingSystem0(X56)
| ~ aElement0(X55)
| ~ aNormalFormOfIn0(X57,X55,X56)
| ~ aReductOfIn0(X58,X57,X56) )
& ( ~ aRewritingSystem0(X56)
| ~ aElement0(X55)
| ~ aNormalFormOfIn0(X57,X55,X56)
| sdtmndtasgtdt0(X55,X56,X57) )
& ( ~ aRewritingSystem0(X56)
| ~ aElement0(X55)
| ~ aNormalFormOfIn0(X57,X55,X56)
| aElement0(X57) ) ),
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])])])])])])]) ).
cnf(c_0_12,plain,
( ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X1)
| X1 != X2
| sdtmndtasgtdt0(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X2,X3)
| sdtmndtplgtdt0(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ sdtmndtasgtdt0(X2,X3,X1)
| ~ aElement0(X1)
| aNormalFormOfIn0(X1,X2,X3)
| aReductOfIn0(esk12_3(X2,X3,X1),X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| sdtmndtasgtdt0(X1,X2,X1) ),
inference(er,[status(thm)],[c_0_12]) ).
fof(c_0_17,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_18,plain,
! [X50,X51,X52] :
( ( ~ aRewritingSystem0(X50)
| isTerminating0(X50)
| ~ iLess0(esk11_1(X50),esk10_1(X50)) )
& ( ~ aRewritingSystem0(X50)
| isTerminating0(X50)
| sdtmndtplgtdt0(esk10_1(X50),X50,esk11_1(X50)) )
& ( ~ aRewritingSystem0(X50)
| isTerminating0(X50)
| aElement0(esk11_1(X50)) )
& ( ~ aRewritingSystem0(X50)
| isTerminating0(X50)
| aElement0(esk10_1(X50)) )
& ( ~ aRewritingSystem0(X50)
| iLess0(X52,X51)
| ~ sdtmndtplgtdt0(X51,X50,X52)
| ~ aElement0(X52)
| ~ aElement0(X51)
| ~ isTerminating0(X50) ) ),
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_19,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X1,X2)
| sdtmndtplgtdt0(X1,X2,X3) ),
inference(csr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| aReductOfIn0(esk12_3(X1,X2,X1),X1,X2)
| aNormalFormOfIn0(X1,X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,negated_conjecture,
! [X62,X64] :
( ~ aNormalFormOfIn0(X64,esk13_0,xR)
& ( aNormalFormOfIn0(esk14_1(X62),X62,xR)
| ~ iLess0(X62,esk13_0)
| ~ aElement0(X62) )
& aElement0(esk13_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_17])])])])]) ).
cnf(c_0_22,plain,
( ~ aRewritingSystem0(X1)
| ~ sdtmndtplgtdt0(X2,X1,X3)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ isTerminating0(X1)
| iLess0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| sdtmndtplgtdt0(X1,X2,esk12_3(X1,X2,X1))
| aNormalFormOfIn0(X1,X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| aElement0(esk12_3(X1,X2,X1))
| aNormalFormOfIn0(X1,X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ iLess0(X1,esk13_0)
| ~ aElement0(X1)
| aNormalFormOfIn0(esk14_1(X1),X1,xR) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ isTerminating0(X2)
| iLess0(esk12_3(X1,X2,X1),X1)
| aNormalFormOfIn0(X1,X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
aElement0(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( ~ aElement0(esk12_3(esk13_0,X1,esk13_0))
| ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| aNormalFormOfIn0(esk13_0,esk13_0,X1)
| aNormalFormOfIn0(esk14_1(esk12_3(esk13_0,X1,esk13_0)),esk12_3(esk13_0,X1,esk13_0),xR) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_29,plain,
( ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ aNormalFormOfIn0(X3,X1,X2)
| sdtmndtasgtdt0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
( ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| aNormalFormOfIn0(esk13_0,esk13_0,X1)
| aNormalFormOfIn0(esk14_1(esk12_3(esk13_0,X1,esk13_0)),esk12_3(esk13_0,X1,esk13_0),xR) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_27])]) ).
cnf(c_0_31,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__587]) ).
cnf(c_0_32,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X1,X2,X3)
| aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_33,plain,
! [X28,X29,X30,X31] :
( sdtmndtasgtdt0(X28,X29,X31)
| ~ sdtmndtasgtdt0(X30,X29,X31)
| ~ sdtmndtasgtdt0(X28,X29,X30)
| ~ aElement0(X31)
| ~ aElement0(X30)
| ~ aRewritingSystem0(X29)
| ~ aElement0(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRTrans])])]) ).
cnf(c_0_34,negated_conjecture,
( ~ aElement0(esk12_3(esk13_0,X1,esk13_0))
| ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| sdtmndtasgtdt0(esk12_3(esk13_0,X1,esk13_0),xR,esk14_1(esk12_3(esk13_0,X1,esk13_0)))
| aNormalFormOfIn0(esk13_0,esk13_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
( ~ aElement0(esk12_3(esk13_0,X1,esk13_0))
| ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| aElement0(esk14_1(esk12_3(esk13_0,X1,esk13_0)))
| aNormalFormOfIn0(esk13_0,esk13_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_31])]) ).
cnf(c_0_36,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X4)
| ~ aNormalFormOfIn0(X2,X4,X3)
| ~ aReductOfIn0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_37,plain,
( ~ sdtmndtasgtdt0(X3,X2,X4)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| sdtmndtasgtdt0(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| sdtmndtasgtdt0(esk12_3(esk13_0,X1,esk13_0),xR,esk14_1(esk12_3(esk13_0,X1,esk13_0)))
| aNormalFormOfIn0(esk13_0,esk13_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_27])]) ).
cnf(c_0_39,negated_conjecture,
( ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| aElement0(esk14_1(esk12_3(esk13_0,X1,esk13_0)))
| aNormalFormOfIn0(esk13_0,esk13_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_24]),c_0_27])]) ).
cnf(c_0_40,plain,
( ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| sdtmndtasgtdt0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_41,negated_conjecture,
( ~ aElement0(esk12_3(esk13_0,X1,esk13_0))
| ~ aRewritingSystem0(X1)
| ~ aReductOfIn0(X2,esk14_1(esk12_3(esk13_0,X1,esk13_0)),xR)
| ~ isTerminating0(X1)
| aNormalFormOfIn0(esk13_0,esk13_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_31])]) ).
cnf(c_0_42,negated_conjecture,
( ~ aElement0(X2)
| ~ aElement0(esk12_3(esk13_0,X1,esk13_0))
| ~ aRewritingSystem0(X1)
| ~ sdtmndtasgtdt0(X2,xR,esk12_3(esk13_0,X1,esk13_0))
| ~ isTerminating0(X1)
| sdtmndtasgtdt0(X2,xR,esk14_1(esk12_3(esk13_0,X1,esk13_0)))
| aNormalFormOfIn0(esk13_0,esk13_0,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31])]),c_0_39]) ).
cnf(c_0_43,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| sdtmndtasgtdt0(X1,X2,esk12_3(X1,X2,X1))
| aNormalFormOfIn0(X1,X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_23]),c_0_24]) ).
cnf(c_0_44,hypothesis,
isTerminating0(xR),
inference(split_conjunct,[status(thm)],[m__587]) ).
cnf(c_0_45,negated_conjecture,
~ aNormalFormOfIn0(X1,esk13_0,xR),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_46,negated_conjecture,
( ~ aElement0(esk12_3(esk13_0,X1,esk13_0))
| ~ aElement0(esk14_1(esk12_3(esk13_0,X1,esk13_0)))
| ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| aNormalFormOfIn0(esk13_0,esk13_0,X1)
| aNormalFormOfIn0(esk14_1(esk12_3(esk13_0,X1,esk13_0)),esk14_1(esk12_3(esk13_0,X1,esk13_0)),xR) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_20]),c_0_31])]) ).
cnf(c_0_47,negated_conjecture,
( ~ aElement0(esk12_3(esk13_0,xR,esk13_0))
| sdtmndtasgtdt0(esk13_0,xR,esk14_1(esk12_3(esk13_0,xR,esk13_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_31]),c_0_27])]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( ~ aElement0(esk14_1(esk12_3(esk13_0,X1,esk13_0)))
| ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| aNormalFormOfIn0(esk13_0,esk13_0,X1)
| aNormalFormOfIn0(esk14_1(esk12_3(esk13_0,X1,esk13_0)),esk14_1(esk12_3(esk13_0,X1,esk13_0)),xR) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_24]),c_0_27])]) ).
cnf(c_0_49,negated_conjecture,
sdtmndtasgtdt0(esk13_0,xR,esk14_1(esk12_3(esk13_0,xR,esk13_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_24]),c_0_31]),c_0_27])]),c_0_45]) ).
cnf(c_0_50,negated_conjecture,
( ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| aNormalFormOfIn0(esk13_0,esk13_0,X1)
| aNormalFormOfIn0(esk14_1(esk12_3(esk13_0,X1,esk13_0)),esk14_1(esk12_3(esk13_0,X1,esk13_0)),xR) ),
inference(spm,[status(thm)],[c_0_48,c_0_39]) ).
cnf(c_0_51,negated_conjecture,
( ~ aElement0(esk14_1(esk12_3(esk13_0,xR,esk13_0)))
| aReductOfIn0(esk12_3(esk13_0,xR,esk14_1(esk12_3(esk13_0,xR,esk13_0))),esk14_1(esk12_3(esk13_0,xR,esk13_0)),xR) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_49]),c_0_31]),c_0_27])]),c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( ~ aRewritingSystem0(X1)
| ~ aReductOfIn0(X2,esk14_1(esk12_3(esk13_0,X1,esk13_0)),xR)
| ~ isTerminating0(X1)
| aNormalFormOfIn0(esk13_0,esk13_0,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_50]),c_0_31])]),c_0_39]) ).
cnf(c_0_53,negated_conjecture,
aReductOfIn0(esk12_3(esk13_0,xR,esk14_1(esk12_3(esk13_0,xR,esk13_0))),esk14_1(esk12_3(esk13_0,xR,esk13_0)),xR),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_39]),c_0_44]),c_0_31])]),c_0_45]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_44]),c_0_31])]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % 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.13/5.38 % Computer : n009.cluster.edu
% 0.13/5.38 % Model : x86_64 x86_64
% 0.13/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.38 % Memory : 8046.5625MB
% 0.13/5.38 % OS : Linux 6.8.0-71-generic
% 0.13/5.39 % CPULimit : 300
% 0.13/5.39 % WCLimit : 300
% 0.13/5.39 % DateTime : Mon Sep 21 14:14:18 UTC 2026
% 0.13/5.39 % CPUTime :
% 0.13/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.47 % Version: 3.5.1
% 0.15/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.47 % Starting sh5l with 300s (1) cores
% 0.15/5.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1975485 completed with status 0
% 0.15/5.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.47 % No SInE strategy applied
% 0.15/5.47 % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.15/5.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.47 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 0.15/5.47 % Starting new_bool_3 with 189s (1) cores
% 0.15/5.47 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.15/5.47 % new_bool_3 with pid 1975495 completed with status 0
% 0.15/5.47 % Result found by new_bool_3
% 0.15/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.47 % No SInE strategy applied
% 0.15/5.47 % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.15/5.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.47 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 0.15/5.47 % Starting new_bool_3 with 189s (1) cores
% 0.15/5.47 % Preprocessing time : 0.001 s
% 0.15/5.47 % Presaturation interreduction done
% 0.15/5.47
% 0.15/5.47 % Proof found!
% 0.15/5.47 % SZS status Theorem
% 0.15/5.47 % SZS output start CNFRefutation
% See solution above
% 0.15/5.47 % Parsed axioms : 15
% 0.15/5.47 % Removed by relevancy pruning/SinE : 0
% 0.15/5.47 % Initial clauses : 47
% 0.15/5.47 % Removed in clause preprocessing : 4
% 0.15/5.47 % Initial clauses in saturation : 43
% 0.15/5.47 % Processed clauses : 177
% 0.15/5.47 % ...of these trivial : 0
% 0.15/5.47 % ...subsumed : 16
% 0.15/5.47 % ...remaining for further processing : 161
% 0.15/5.47 % Other redundant clauses eliminated : 1
% 0.15/5.47 % Clauses deleted for lack of memory : 0
% 0.15/5.47 % Backward-subsumed : 10
% 0.15/5.47 % Backward-rewritten : 2
% 0.15/5.47 % Generated clauses : 209
% 0.15/5.47 % ...of the previous two non-redundant : 183
% 0.15/5.47 % ...aggressively subsumed : 0
% 0.15/5.47 % Contextual simplify-reflections : 66
% 0.15/5.47 % Paramodulations : 208
% 0.15/5.47 % Factorizations : 0
% 0.15/5.47 % NegExts : 0
% 0.15/5.47 % Equation resolutions : 1
% 0.15/5.47 % Disequality decompositions : 0
% 0.15/5.47 % Total rewrite steps : 95
% 0.15/5.47 % ...of those cached : 90
% 0.15/5.47 % Propositional unsat checks : 0
% 0.15/5.47 % Propositional check models : 0
% 0.15/5.47 % Propositional check unsatisfiable : 0
% 0.15/5.47 % Propositional clauses : 0
% 0.15/5.47 % Propositional clauses after purity: 0
% 0.15/5.47 % Propositional unsat core size : 0
% 0.15/5.47 % Propositional preprocessing time : 0.000
% 0.15/5.47 % Propositional encoding time : 0.000
% 0.15/5.47 % Propositional solver time : 0.000
% 0.15/5.47 % Success case prop preproc time : 0.000
% 0.15/5.47 % Success case prop encoding time : 0.000
% 0.15/5.47 % Success case prop solver time : 0.000
% 0.15/5.47 % Current number of processed clauses : 105
% 0.15/5.47 % Positive orientable unit clauses : 5
% 0.15/5.47 % Positive unorientable unit clauses: 0
% 0.15/5.47 % Negative unit clauses : 1
% 0.15/5.47 % Non-unit-clauses : 99
% 0.15/5.47 % Current number of unprocessed clauses: 87
% 0.15/5.47 % ...number of literals in the above : 554
% 0.15/5.47 % Current number of archived formulas : 0
% 0.15/5.47 % Current number of archived clauses : 55
% 0.15/5.47 % Clause-clause subsumption calls (NU) : 2355
% 0.15/5.47 % Rec. Clause-clause subsumption calls : 256
% 0.15/5.47 % Non-unit clause-clause subsumptions : 92
% 0.15/5.47 % Unit Clause-clause subsumption calls : 11
% 0.15/5.47 % Rewrite failures with RHS unbound : 0
% 0.15/5.47 % BW rewrite match attempts : 2
% 0.15/5.47 % BW rewrite match successes : 2
% 0.15/5.47 % Condensation attempts : 0
% 0.15/5.47 % Condensation successes : 0
% 0.15/5.47 % Termbank termtop insertions : 11457
% 0.15/5.47 % Search garbage collected termcells : 1140
% 0.15/5.47
% 0.15/5.47 % -------------------------------------------------
% 0.15/5.47 % User time : 0.016 s
% 0.15/5.47 % System time : 0.004 s
% 0.15/5.47 % Total time : 0.020 s
% 0.15/5.47 % Maximum resident set size: 3632 pages
% 0.15/5.47
% 0.15/5.47 % -------------------------------------------------
% 0.15/5.47 % User time : 0.061 s
% 0.15/5.47 % System time : 0.017 s
% 0.15/5.47 % Total time : 0.078 s
% 0.15/5.47 % Maximum resident set size: 4608 pages
% 0.15/5.47 % E exiting
%------------------------------------------------------------------------------