%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM020+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:29 PM UTC 2026
% Result : Theorem 0.48s 0.50s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 21 unt; 0 def)
% Number of atoms : 264 ( 0 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 353 ( 147 ~; 149 |; 43 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 89 ( 0 sgn 42 !; 5 ?)
% 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/sandbox/benchmark/theBenchmark.p',mTCDef) ).
fof(mReduct,axiom,
! [X1,X2] :
( ( aRewritingSystem0(X2)
& aElement0(X1) )
=> ! [X3] :
( aReductOfIn0(X3,X1,X2)
=> aElement0(X3) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',mNFRDef) ).
fof(mTermin,axiom,
! [X1] :
( aRewritingSystem0(X1)
=> ( isTerminating0(X1)
<=> ! [X2,X3] :
( ( aElement0(X3)
& aElement0(X2) )
=> ( sdtmndtplgtdt0(X2,X1,X3)
=> iLess0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTermin) ).
fof(m__755,hypothesis,
( sdtmndtasgtdt0(xu,xR,xb)
& aReductOfIn0(xu,xa,xR)
& aElement0(xu) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__755) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
fof(m__731,hypothesis,
( aElement0(xc)
& aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__731) ).
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/sandbox/benchmark/theBenchmark.p',mTCRTrans) ).
fof(m__818,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__818) ).
fof(m__799,hypothesis,
( sdtmndtasgtdt0(xv,xR,xw)
& sdtmndtasgtdt0(xu,xR,xw)
& aElement0(xw) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__799) ).
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/sandbox/benchmark/theBenchmark.p',m__715) ).
fof(m__656_01,hypothesis,
( isTerminating0(xR)
& isLocallyConfluent0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656_01) ).
fof(m__,conjecture,
? [X1] :
( sdtmndtasgtdt0(xd,xR,X1)
& sdtmndtasgtdt0(xb,xR,X1)
& aElement0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(c_0_13,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_14,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])])])]) ).
cnf(c_0_15,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X2,X3)
| sdtmndtplgtdt0(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,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])])])])])])]) ).
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_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
aReductOfIn0(xu,xa,xR),
inference(split_conjunct,[status(thm)],[m__755]) ).
cnf(c_0_21,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_22,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__731]) ).
fof(c_0_23,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_24,plain,
( ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ aNormalFormOfIn0(X3,X1,X2)
| sdtmndtasgtdt0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
inference(split_conjunct,[status(thm)],[m__818]) ).
cnf(c_0_26,hypothesis,
aElement0(xw),
inference(split_conjunct,[status(thm)],[m__799]) ).
cnf(c_0_27,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X1,X2,X3)
| aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_28,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_29,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_30,hypothesis,
sdtmndtplgtdt0(xa,xR,xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_31,hypothesis,
isTerminating0(xR),
inference(split_conjunct,[status(thm)],[m__656_01]) ).
cnf(c_0_32,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__755]) ).
cnf(c_0_33,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_23]) ).
cnf(c_0_34,hypothesis,
sdtmndtasgtdt0(xw,xR,xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21]),c_0_26])]) ).
cnf(c_0_35,hypothesis,
aElement0(xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_21]),c_0_26])]) ).
cnf(c_0_36,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_28]) ).
cnf(c_0_37,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_29,c_0_30]),c_0_31]),c_0_21]),c_0_32]),c_0_22])]) ).
cnf(c_0_38,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_33,c_0_34]),c_0_21]),c_0_35]),c_0_26])]) ).
cnf(c_0_39,hypothesis,
sdtmndtasgtdt0(xu,xR,xw),
inference(split_conjunct,[status(thm)],[m__799]) ).
cnf(c_0_40,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_28]) ).
fof(c_0_41,negated_conjecture,
~ ? [X1] :
( sdtmndtasgtdt0(xd,xR,X1)
& sdtmndtasgtdt0(xb,xR,X1)
& aElement0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_42,hypothesis,
( ~ aElement0(X1)
| ~ aElement0(X2)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| ~ sdtmndtasgtdt0(xu,xR,X2)
| sdtmndtasgtdt0(X1,xR,esk14_3(xu,X2,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_32])]) ).
cnf(c_0_43,hypothesis,
sdtmndtasgtdt0(xu,xR,xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32])]) ).
cnf(c_0_44,hypothesis,
( ~ aElement0(X1)
| ~ aElement0(X2)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| ~ sdtmndtasgtdt0(xu,xR,X2)
| aElement0(esk14_3(xu,X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_32])]) ).
cnf(c_0_45,hypothesis,
sdtmndtasgtdt0(xu,xR,xb),
inference(split_conjunct,[status(thm)],[m__755]) ).
cnf(c_0_46,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_47,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_28]) ).
fof(c_0_48,negated_conjecture,
! [X68] :
( ~ sdtmndtasgtdt0(xd,xR,X68)
| ~ sdtmndtasgtdt0(xb,xR,X68)
| ~ aElement0(X68) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])]) ).
cnf(c_0_49,hypothesis,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| sdtmndtasgtdt0(X1,xR,esk14_3(xu,xd,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_35])]) ).
cnf(c_0_50,hypothesis,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| aElement0(esk14_3(xu,X1,xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_51,hypothesis,
( ~ aElement0(X1)
| ~ aElement0(X2)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| ~ sdtmndtasgtdt0(xu,xR,X2)
| sdtmndtasgtdt0(X1,xR,esk14_3(xu,X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_37]),c_0_32])]) ).
cnf(c_0_52,negated_conjecture,
( ~ sdtmndtasgtdt0(xd,xR,X1)
| ~ sdtmndtasgtdt0(xb,xR,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_53,hypothesis,
sdtmndtasgtdt0(xb,xR,esk14_3(xu,xd,xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_45]),c_0_46])]) ).
cnf(c_0_54,hypothesis,
aElement0(esk14_3(xu,xd,xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_43]),c_0_35])]) ).
cnf(c_0_55,hypothesis,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| sdtmndtasgtdt0(X1,xR,esk14_3(xu,X1,xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_45]),c_0_46])]) ).
cnf(c_0_56,negated_conjecture,
~ sdtmndtasgtdt0(xd,xR,esk14_3(xu,xd,xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_57,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_43]),c_0_35])]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM020+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 14:16:59 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.48/0.49 % Version: 3.5.1
% 0.48/0.49 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.48/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.48/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.48/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.48/0.49 % Starting sh5l with 300s (1) cores
% 0.48/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2109894 completed with status 0
% 0.48/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.48/0.49 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.48/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.48/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.48/0.49 % No SInE strategy applied
% 0.48/0.49 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.48/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.48/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.48/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.48/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.48/0.50 % Starting new_bool_1 with 136s (1) cores
% 0.48/0.50 % new_bool_3 with pid 2109904 completed with status 0
% 0.48/0.50 % Result found by new_bool_3
% 0.48/0.50 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.48/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.48/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.48/0.50 % No SInE strategy applied
% 0.48/0.50 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.48/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.48/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.48/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.48/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.48/0.50 % Preprocessing time : 0.002 s
% 0.48/0.50 % Presaturation interreduction done
% 0.48/0.50
% 0.48/0.50 % Proof found!
% 0.48/0.50 % SZS status Theorem
% 0.48/0.50 % SZS output start CNFRefutation
% See solution above
% 0.48/0.50 % Parsed axioms : 24
% 0.48/0.50 % Removed by relevancy pruning/SinE : 0
% 0.48/0.50 % Initial clauses : 65
% 0.48/0.50 % Removed in clause preprocessing : 4
% 0.48/0.50 % Initial clauses in saturation : 61
% 0.48/0.50 % Processed clauses : 592
% 0.48/0.50 % ...of these trivial : 3
% 0.48/0.50 % ...subsumed : 30
% 0.48/0.50 % ...remaining for further processing : 559
% 0.48/0.50 % Other redundant clauses eliminated : 1
% 0.48/0.50 % Clauses deleted for lack of memory : 0
% 0.48/0.50 % Backward-subsumed : 9
% 0.48/0.50 % Backward-rewritten : 12
% 0.48/0.50 % Generated clauses : 1512
% 0.48/0.50 % ...of the previous two non-redundant : 1389
% 0.48/0.50 % ...aggressively subsumed : 0
% 0.48/0.50 % Contextual simplify-reflections : 50
% 0.48/0.50 % Paramodulations : 1511
% 0.48/0.50 % Factorizations : 0
% 0.48/0.50 % NegExts : 0
% 0.48/0.50 % Equation resolutions : 1
% 0.48/0.50 % Disequality decompositions : 0
% 0.48/0.50 % Total rewrite steps : 2919
% 0.48/0.50 % ...of those cached : 2834
% 0.48/0.50 % Propositional unsat checks : 0
% 0.48/0.50 % Propositional check models : 0
% 0.48/0.50 % Propositional check unsatisfiable : 0
% 0.48/0.50 % Propositional clauses : 0
% 0.48/0.50 % Propositional clauses after purity: 0
% 0.48/0.50 % Propositional unsat core size : 0
% 0.48/0.50 % Propositional preprocessing time : 0.000
% 0.48/0.50 % Propositional encoding time : 0.000
% 0.48/0.50 % Propositional solver time : 0.000
% 0.48/0.50 % Success case prop preproc time : 0.000
% 0.48/0.50 % Success case prop encoding time : 0.000
% 0.48/0.50 % Success case prop solver time : 0.000
% 0.48/0.50 % Current number of processed clauses : 476
% 0.48/0.50 % Positive orientable unit clauses : 130
% 0.48/0.50 % Positive unorientable unit clauses: 0
% 0.48/0.50 % Negative unit clauses : 7
% 0.48/0.50 % Non-unit-clauses : 339
% 0.48/0.50 % Current number of unprocessed clauses: 916
% 0.48/0.50 % ...number of literals in the above : 2845
% 0.48/0.50 % Current number of archived formulas : 0
% 0.48/0.50 % Current number of archived clauses : 82
% 0.48/0.50 % Clause-clause subsumption calls (NU) : 16674
% 0.48/0.50 % Rec. Clause-clause subsumption calls : 7530
% 0.48/0.50 % Non-unit clause-clause subsumptions : 85
% 0.48/0.50 % Unit Clause-clause subsumption calls : 3456
% 0.48/0.50 % Rewrite failures with RHS unbound : 0
% 0.48/0.50 % BW rewrite match attempts : 513
% 0.48/0.50 % BW rewrite match successes : 12
% 0.48/0.50 % Condensation attempts : 0
% 0.48/0.50 % Condensation successes : 0
% 0.48/0.50 % Termbank termtop insertions : 42477
% 0.48/0.50 % Search garbage collected termcells : 1175
% 0.48/0.50
% 0.48/0.50 % -------------------------------------------------
% 0.48/0.50 % User time : 0.063 s
% 0.48/0.50 % System time : 0.009 s
% 0.48/0.50 % Total time : 0.072 s
% 0.48/0.50 % Maximum resident set size: 3664 pages
% 0.48/0.50
% 0.48/0.50 % -------------------------------------------------
% 0.48/0.50 % User time : 0.294 s
% 0.48/0.50 % System time : 0.031 s
% 0.48/0.50 % Total time : 0.325 s
% 0.48/0.50 % Maximum resident set size: 4864 pages
% 0.48/0.50 % E exiting
%------------------------------------------------------------------------------