%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : COM019+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 : n005.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:21 PM UTC 2026
% Result : Theorem 1.52s 0.75s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 63 ( 27 unt; 0 def)
% Number of atoms : 283 ( 6 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 376 ( 156 ~; 161 |; 43 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 96 ( 2 sgn 47 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(m__818,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__818) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656) ).
fof(m__799,hypothesis,
( sdtmndtasgtdt0(xv,xR,xw)
& sdtmndtasgtdt0(xu,xR,xw)
& aElement0(xw) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__799) ).
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__755,hypothesis,
( sdtmndtasgtdt0(xu,xR,xb)
& aReductOfIn0(xu,xa,xR)
& aElement0(xu) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__755) ).
fof(m__731,hypothesis,
( aElement0(xc)
& aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731) ).
fof(m__715,hypothesis,
! [X1,X2,X3] :
( ( sdtmndtasgtdt0(X1,xR,X3)
& sdtmndtasgtdt0(X1,xR,X2)
& aElement0(X3)
& aElement0(X2)
& aElement0(X1) )
=> ( iLess0(X1,xa)
=> ? [X4] :
( sdtmndtasgtdt0(X3,xR,X4)
& sdtmndtasgtdt0(X2,xR,X4)
& aElement0(X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__715) ).
fof(m__656_01,hypothesis,
( isTerminating0(xR)
& isLocallyConfluent0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656_01) ).
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(m__,conjecture,
sdtmndtasgtdt0(xb,xR,xd),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(c_0_14,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_15,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_16,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_17,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X2,X3)
| sdtmndtplgtdt0(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,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_20,plain,
( ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ aNormalFormOfIn0(X3,X1,X2)
| sdtmndtasgtdt0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
inference(split_conjunct,[status(thm)],[m__818]) ).
cnf(c_0_22,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_23,hypothesis,
aElement0(xw),
inference(split_conjunct,[status(thm)],[m__799]) ).
cnf(c_0_24,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X1,X2,X3)
| aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,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_26,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X1,X2)
| sdtmndtplgtdt0(X1,X2,X3) ),
inference(csr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,hypothesis,
aReductOfIn0(xu,xa,xR),
inference(split_conjunct,[status(thm)],[m__755]) ).
cnf(c_0_28,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_29,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_19]) ).
cnf(c_0_30,hypothesis,
sdtmndtasgtdt0(xw,xR,xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_31,hypothesis,
aElement0(xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_22]),c_0_23])]) ).
fof(c_0_32,hypothesis,
! [X64,X65,X66] :
( ( ~ sdtmndtasgtdt0(X64,xR,X66)
| ~ sdtmndtasgtdt0(X64,xR,X65)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| ~ iLess0(X64,xa)
| sdtmndtasgtdt0(X66,xR,esk14_3(X64,X65,X66)) )
& ( ~ sdtmndtasgtdt0(X64,xR,X66)
| ~ sdtmndtasgtdt0(X64,xR,X65)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| ~ iLess0(X64,xa)
| sdtmndtasgtdt0(X65,xR,esk14_3(X64,X65,X66)) )
& ( ~ sdtmndtasgtdt0(X64,xR,X66)
| ~ sdtmndtasgtdt0(X64,xR,X65)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| ~ iLess0(X64,xa)
| aElement0(esk14_3(X64,X65,X66)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__715])])])])]) ).
cnf(c_0_33,plain,
( ~ aRewritingSystem0(X1)
| ~ sdtmndtplgtdt0(X2,X1,X3)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ isTerminating0(X1)
| iLess0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,hypothesis,
sdtmndtplgtdt0(xa,xR,xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22]),c_0_28])]) ).
cnf(c_0_35,hypothesis,
isTerminating0(xR),
inference(split_conjunct,[status(thm)],[m__656_01]) ).
cnf(c_0_36,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__755]) ).
cnf(c_0_37,hypothesis,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(X1,xR,xw)
| sdtmndtasgtdt0(X1,xR,xd) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22]),c_0_31]),c_0_23])]) ).
cnf(c_0_38,hypothesis,
sdtmndtasgtdt0(xu,xR,xw),
inference(split_conjunct,[status(thm)],[m__799]) ).
cnf(c_0_39,hypothesis,
( ~ sdtmndtasgtdt0(X2,xR,X1)
| ~ sdtmndtasgtdt0(X2,xR,X3)
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ iLess0(X2,xa)
| sdtmndtasgtdt0(X1,xR,esk14_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,hypothesis,
sdtmndtasgtdt0(xu,xR,xb),
inference(split_conjunct,[status(thm)],[m__755]) ).
cnf(c_0_41,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_42,hypothesis,
iLess0(xu,xa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_22]),c_0_36]),c_0_28])]) ).
cnf(c_0_43,hypothesis,
( ~ sdtmndtasgtdt0(X1,xR,X3)
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ iLess0(X1,xa)
| aElement0(esk14_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,hypothesis,
sdtmndtasgtdt0(xu,xR,xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_36])]) ).
fof(c_0_45,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])])])]) ).
cnf(c_0_46,hypothesis,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| sdtmndtasgtdt0(X1,xR,esk14_3(xu,xb,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_36])]),c_0_42])]) ).
cnf(c_0_47,hypothesis,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| aElement0(esk14_3(xu,X1,xd)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_42]),c_0_31]),c_0_36])]) ).
fof(c_0_48,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_49,plain,
( ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| sdtmndtplgtdt0(X1,X2,X3)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_50,hypothesis,
sdtmndtasgtdt0(xd,xR,esk14_3(xu,xb,xd)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_44]),c_0_31])]) ).
cnf(c_0_51,hypothesis,
aElement0(esk14_3(xu,xb,xd)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_40]),c_0_41])]) ).
cnf(c_0_52,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X4)
| ~ aNormalFormOfIn0(X2,X4,X3)
| ~ aReductOfIn0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_53,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(fof_simplification,[status(thm)],[c_0_48]) ).
cnf(c_0_54,hypothesis,
( ~ sdtmndtasgtdt0(X2,xR,X3)
| ~ sdtmndtasgtdt0(X2,xR,X1)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ iLess0(X2,xa)
| sdtmndtasgtdt0(X1,xR,esk14_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_55,plain,
( ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| aReductOfIn0(X3,X1,X2)
| aReductOfIn0(esk1_3(X1,X2,X3),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_56,hypothesis,
( sdtmndtplgtdt0(xd,xR,esk14_3(xu,xb,xd))
| esk14_3(xu,xb,xd) = xd ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_22]),c_0_51]),c_0_31])]) ).
cnf(c_0_57,hypothesis,
~ aReductOfIn0(X1,xd,xR),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_21]),c_0_22]),c_0_23])]) ).
fof(c_0_58,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(fof_nnf,[status(thm)],[c_0_53]) ).
cnf(c_0_59,hypothesis,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| sdtmndtasgtdt0(X1,xR,esk14_3(xu,X1,xd)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_44]),c_0_42]),c_0_31]),c_0_36])]) ).
cnf(c_0_60,hypothesis,
esk14_3(xu,xb,xd) = xd,
inference(sr,[status(thm)],[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_55,c_0_56]),c_0_22]),c_0_51]),c_0_31])]),c_0_57]),c_0_57]) ).
cnf(c_0_61,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_62,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_40]),c_0_60]),c_0_41])]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM019+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/0.38 % Computer : n005.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 14:14:49 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.48 Running first-order theorem proving
% 0.17/0.48 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
% 1.52/0.75 % Version: 3.5.1
% 1.52/0.75 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.52/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.52/0.75 % Starting new_bool_3 with 300s (1) cores
% 1.52/0.75 % Starting new_bool_1 with 300s (1) cores
% 1.52/0.75 % Starting sh5l with 300s (1) cores
% 1.52/0.75 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3700281 completed with status 0
% 1.52/0.75 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.52/0.75 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.52/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.52/0.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.52/0.75 % No SInE strategy applied
% 1.52/0.75 % Search class: FGHSF-FFMM31-SFFFFFNN
% 1.52/0.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.52/0.75 % Starting SubtermCWHack with 136s (1) cores
% 1.52/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.52/0.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 1.52/0.75 % Starting new_bool_3 with 136s (1) cores
% 1.52/0.75 % Starting new_bool_1 with 136s (1) cores
% 1.52/0.75 % G-E--_208_C18_F1_SE_CS_SP_PS_S2g with pid 3700288 completed with status 0
% 1.52/0.75 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2g
% 1.52/0.75 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.52/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.52/0.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.52/0.75 % No SInE strategy applied
% 1.52/0.75 % Search class: FGHSF-FFMM31-SFFFFFNN
% 1.52/0.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.52/0.75 % Starting SubtermCWHack with 136s (1) cores
% 1.52/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.52/0.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 1.52/0.75 % Preprocessing time : 0.003 s
% 1.52/0.75 % Presaturation interreduction done
% 1.52/0.75
% 1.52/0.75 % Proof found!
% 1.52/0.75 % SZS status Theorem
% 1.52/0.75 % SZS output start CNFRefutation
% See solution above
% 1.52/0.75 % Parsed axioms : 24
% 1.52/0.75 % Removed by relevancy pruning/SinE : 0
% 1.52/0.75 % Initial clauses : 65
% 1.52/0.75 % Removed in clause preprocessing : 4
% 1.52/0.75 % Initial clauses in saturation : 61
% 1.52/0.75 % Processed clauses : 1078
% 1.52/0.75 % ...of these trivial : 1
% 1.52/0.75 % ...subsumed : 48
% 1.52/0.75 % ...remaining for further processing : 1029
% 1.52/0.75 % Other redundant clauses eliminated : 1
% 1.52/0.75 % Clauses deleted for lack of memory : 0
% 1.52/0.75 % Backward-subsumed : 3
% 1.52/0.75 % Backward-rewritten : 22
% 1.52/0.75 % Generated clauses : 4195
% 1.52/0.75 % ...of the previous two non-redundant : 3910
% 1.52/0.75 % ...aggressively subsumed : 0
% 1.52/0.75 % Contextual simplify-reflections : 30
% 1.52/0.75 % Paramodulations : 4194
% 1.52/0.75 % Factorizations : 0
% 1.52/0.75 % NegExts : 0
% 1.52/0.75 % Equation resolutions : 1
% 1.52/0.75 % Disequality decompositions : 0
% 1.52/0.75 % Total rewrite steps : 6934
% 1.52/0.75 % ...of those cached : 6785
% 1.52/0.75 % Propositional unsat checks : 0
% 1.52/0.75 % Propositional check models : 0
% 1.52/0.75 % Propositional check unsatisfiable : 0
% 1.52/0.75 % Propositional clauses : 0
% 1.52/0.75 % Propositional clauses after purity: 0
% 1.52/0.75 % Propositional unsat core size : 0
% 1.52/0.75 % Propositional preprocessing time : 0.000
% 1.52/0.75 % Propositional encoding time : 0.000
% 1.52/0.75 % Propositional solver time : 0.000
% 1.52/0.75 % Success case prop preproc time : 0.000
% 1.52/0.75 % Success case prop encoding time : 0.000
% 1.52/0.75 % Success case prop solver time : 0.000
% 1.52/0.75 % Current number of processed clauses : 942
% 1.52/0.75 % Positive orientable unit clauses : 256
% 1.52/0.75 % Positive unorientable unit clauses: 0
% 1.52/0.75 % Negative unit clauses : 8
% 1.52/0.75 % Non-unit-clauses : 678
% 1.52/0.75 % Current number of unprocessed clauses: 2935
% 1.52/0.75 % ...number of literals in the above : 8199
% 1.52/0.75 % Current number of archived formulas : 0
% 1.52/0.75 % Current number of archived clauses : 86
% 1.52/0.75 % Clause-clause subsumption calls (NU) : 71142
% 1.52/0.75 % Rec. Clause-clause subsumption calls : 57419
% 1.52/0.75 % Non-unit clause-clause subsumptions : 60
% 1.52/0.75 % Unit Clause-clause subsumption calls : 8657
% 1.52/0.75 % Rewrite failures with RHS unbound : 0
% 1.52/0.75 % BW rewrite match attempts : 1928
% 1.52/0.75 % BW rewrite match successes : 2
% 1.52/0.75 % Condensation attempts : 0
% 1.52/0.75 % Condensation successes : 0
% 1.52/0.75 % Termbank termtop insertions : 108492
% 1.52/0.75 % Search garbage collected termcells : 1154
% 1.52/0.75
% 1.52/0.75 % -------------------------------------------------
% 1.52/0.75 % User time : 0.237 s
% 1.52/0.75 % System time : 0.007 s
% 1.52/0.75 % Total time : 0.244 s
% 1.52/0.75 % Maximum resident set size: 3408 pages
% 1.52/0.75
% 1.52/0.75 % -------------------------------------------------
% 1.52/0.75 % User time : 0.793 s
% 1.52/0.75 % System time : 0.038 s
% 1.52/0.75 % Total time : 0.831 s
% 1.52/0.75 % Maximum resident set size: 4608 pages
% 1.52/0.75 % E exiting
%------------------------------------------------------------------------------