%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : COM020+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 : n001.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 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 52 ( 17 unt; 0 def)
% Number of atoms : 257 ( 0 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 354 ( 149 ~; 148 |; 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 : 87 ( 0 sgn 42 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( sdtmndtasgtdt0(xd,xR,X1)
& sdtmndtasgtdt0(xb,xR,X1)
& aElement0(X1) ),
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__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__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(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(m__731,hypothesis,
( aElement0(xc)
& aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731) ).
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__656_01,hypothesis,
( isTerminating0(xR)
& isLocallyConfluent0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656_01) ).
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_13,negated_conjecture,
~ ? [X1] :
( sdtmndtasgtdt0(xd,xR,X1)
& sdtmndtasgtdt0(xb,xR,X1)
& aElement0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_14,plain,
! [X23,X24,X25,X26,X27] :
( ( ~ aRewritingSystem0(X24)
| ~ aElement0(X23)
| aNormalFormOfIn0(X27,X23,X24)
| aReductOfIn0(esk5_3(X23,X24,X27),X27,X24)
| ~ sdtmndtasgtdt0(X23,X24,X27)
| ~ aElement0(X27) )
& ( ~ aRewritingSystem0(X24)
| ~ aElement0(X23)
| ~ aNormalFormOfIn0(X25,X23,X24)
| ~ aReductOfIn0(X26,X25,X24) )
& ( ~ aRewritingSystem0(X24)
| ~ aElement0(X23)
| ~ aNormalFormOfIn0(X25,X23,X24)
| sdtmndtasgtdt0(X23,X24,X25) )
& ( ~ aRewritingSystem0(X24)
| ~ aElement0(X23)
| ~ aNormalFormOfIn0(X25,X23,X24)
| aElement0(X25) ) ),
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_15,negated_conjecture,
! [X6] :
( ~ sdtmndtasgtdt0(xd,xR,X6)
| ~ sdtmndtasgtdt0(xb,xR,X6)
| ~ aElement0(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_16,hypothesis,
! [X29,X30,X31] :
( ( ~ sdtmndtasgtdt0(X29,xR,X31)
| ~ sdtmndtasgtdt0(X29,xR,X30)
| ~ aElement0(X31)
| ~ aElement0(X30)
| ~ aElement0(X29)
| ~ iLess0(X29,xa)
| sdtmndtasgtdt0(X31,xR,esk6_3(X29,X30,X31)) )
& ( ~ sdtmndtasgtdt0(X29,xR,X31)
| ~ sdtmndtasgtdt0(X29,xR,X30)
| ~ aElement0(X31)
| ~ aElement0(X30)
| ~ aElement0(X29)
| ~ iLess0(X29,xa)
| sdtmndtasgtdt0(X30,xR,esk6_3(X29,X30,X31)) )
& ( ~ sdtmndtasgtdt0(X29,xR,X31)
| ~ sdtmndtasgtdt0(X29,xR,X30)
| ~ aElement0(X31)
| ~ aElement0(X30)
| ~ aElement0(X29)
| ~ iLess0(X29,xa)
| aElement0(esk6_3(X29,X30,X31)) ) ),
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_17,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X1,X2,X3)
| aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
inference(split_conjunct,[status(thm)],[m__818]) ).
cnf(c_0_19,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_20,hypothesis,
aElement0(xw),
inference(split_conjunct,[status(thm)],[m__799]) ).
fof(c_0_21,plain,
! [X40,X41,X42,X44] :
( ( ~ aElement0(X42)
| ~ aRewritingSystem0(X41)
| ~ aElement0(X40)
| sdtmndtplgtdt0(X40,X41,X42)
| ~ sdtmndtplgtdt0(X44,X41,X42)
| ~ aReductOfIn0(X44,X40,X41)
| ~ aElement0(X44) )
& ( ~ aElement0(X42)
| ~ aRewritingSystem0(X41)
| ~ aElement0(X40)
| sdtmndtplgtdt0(X40,X41,X42)
| ~ aReductOfIn0(X42,X40,X41) )
& ( ~ aElement0(X42)
| ~ aRewritingSystem0(X41)
| ~ aElement0(X40)
| ~ sdtmndtplgtdt0(X40,X41,X42)
| aReductOfIn0(X42,X40,X41)
| sdtmndtplgtdt0(esk7_3(X40,X41,X42),X41,X42) )
& ( ~ aElement0(X42)
| ~ aRewritingSystem0(X41)
| ~ aElement0(X40)
| ~ sdtmndtplgtdt0(X40,X41,X42)
| aReductOfIn0(X42,X40,X41)
| aReductOfIn0(esk7_3(X40,X41,X42),X40,X41) )
& ( ~ aElement0(X42)
| ~ aRewritingSystem0(X41)
| ~ aElement0(X40)
| ~ sdtmndtplgtdt0(X40,X41,X42)
| aReductOfIn0(X42,X40,X41)
| aElement0(esk7_3(X40,X41,X42)) ) ),
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_22,plain,
! [X34,X35,X36] :
( aElement0(X36)
| ~ aReductOfIn0(X36,X34,X35)
| ~ aRewritingSystem0(X35)
| ~ aElement0(X34) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mReduct])])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ sdtmndtasgtdt0(xd,xR,X1)
| ~ sdtmndtasgtdt0(xb,xR,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,hypothesis,
( ~ sdtmndtasgtdt0(X2,xR,X1)
| ~ sdtmndtasgtdt0(X2,xR,X3)
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ iLess0(X2,xa)
| sdtmndtasgtdt0(X1,xR,esk6_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,hypothesis,
aElement0(xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
fof(c_0_26,plain,
! [X49,X50,X51] :
( ( ~ aRewritingSystem0(X49)
| isTerminating0(X49)
| ~ iLess0(esk9_1(X49),esk8_1(X49)) )
& ( ~ aRewritingSystem0(X49)
| isTerminating0(X49)
| sdtmndtplgtdt0(esk8_1(X49),X49,esk9_1(X49)) )
& ( ~ aRewritingSystem0(X49)
| isTerminating0(X49)
| aElement0(esk9_1(X49)) )
& ( ~ aRewritingSystem0(X49)
| isTerminating0(X49)
| aElement0(esk8_1(X49)) )
& ( ~ aRewritingSystem0(X49)
| iLess0(X51,X50)
| ~ sdtmndtplgtdt0(X50,X49,X51)
| ~ aElement0(X51)
| ~ aElement0(X50)
| ~ isTerminating0(X49) ) ),
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_27,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X2,X3)
| sdtmndtplgtdt0(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(esk6_3(X1,X2,xd))
| ~ iLess0(X1,xa)
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ sdtmndtasgtdt0(X1,xR,xd)
| ~ sdtmndtasgtdt0(xb,xR,esk6_3(X1,X2,xd)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,hypothesis,
( ~ sdtmndtasgtdt0(X2,xR,X3)
| ~ sdtmndtasgtdt0(X2,xR,X1)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ iLess0(X2,xa)
| sdtmndtasgtdt0(X1,xR,esk6_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_32,plain,
( ~ aRewritingSystem0(X1)
| ~ sdtmndtplgtdt0(X2,X1,X3)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ isTerminating0(X1)
| iLess0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X1,X2)
| sdtmndtplgtdt0(X1,X2,X3) ),
inference(csr,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,hypothesis,
( ~ aElement0(X1)
| ~ aElement0(esk6_3(X1,xb,xd))
| ~ iLess0(X1,xa)
| ~ sdtmndtasgtdt0(X1,xR,xb)
| ~ sdtmndtasgtdt0(X1,xR,xd) ),
inference(cn,[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_25])]) ).
cnf(c_0_35,hypothesis,
( ~ sdtmndtasgtdt0(X1,xR,X3)
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ iLess0(X1,xa)
| aElement0(esk6_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_36,plain,
( ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aReductOfIn0(X1,X2,X3)
| ~ isTerminating0(X3)
| iLess0(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_28]) ).
cnf(c_0_37,hypothesis,
aReductOfIn0(xu,xa,xR),
inference(split_conjunct,[status(thm)],[m__755]) ).
cnf(c_0_38,hypothesis,
isTerminating0(xR),
inference(split_conjunct,[status(thm)],[m__656_01]) ).
cnf(c_0_39,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__731]) ).
fof(c_0_40,plain,
! [X10,X11,X12,X13] :
( sdtmndtasgtdt0(X10,X11,X13)
| ~ sdtmndtasgtdt0(X12,X11,X13)
| ~ sdtmndtasgtdt0(X10,X11,X12)
| ~ aElement0(X13)
| ~ aElement0(X12)
| ~ aRewritingSystem0(X11)
| ~ aElement0(X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRTrans])])]) ).
cnf(c_0_41,plain,
( ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ aNormalFormOfIn0(X3,X1,X2)
| sdtmndtasgtdt0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_42,hypothesis,
( ~ aElement0(X1)
| ~ iLess0(X1,xa)
| ~ sdtmndtasgtdt0(X1,xR,xb)
| ~ sdtmndtasgtdt0(X1,xR,xd) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_25]),c_0_31])]) ).
cnf(c_0_43,hypothesis,
iLess0(xu,xa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_19]),c_0_39])]) ).
cnf(c_0_44,hypothesis,
sdtmndtasgtdt0(xu,xR,xb),
inference(split_conjunct,[status(thm)],[m__755]) ).
cnf(c_0_45,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__755]) ).
cnf(c_0_46,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_40]) ).
cnf(c_0_47,hypothesis,
sdtmndtasgtdt0(xw,xR,xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_48,hypothesis,
~ sdtmndtasgtdt0(xu,xR,xd),
inference(cn,[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_45])]) ).
cnf(c_0_49,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_46,c_0_47]),c_0_19]),c_0_25]),c_0_20])]) ).
cnf(c_0_50,hypothesis,
sdtmndtasgtdt0(xu,xR,xw),
inference(split_conjunct,[status(thm)],[m__799]) ).
cnf(c_0_51,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM020+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.11/0.38 % Computer : n001.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 14:20:15 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.19/0.51 % Version: 3.5.1
% 0.19/0.51 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 % Starting sh5l with 300s (1) cores
% 0.19/0.51 % sh5l with pid 3344340 completed with status 0
% 0.19/0.51 % Result found by sh5l
% 0.19/0.51 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 % Starting sh5l with 300s (1) cores
% 0.19/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.19/0.51 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.19/0.51 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.19/0.51 % SubtermCWHack with pid 3344345 completed with status 0
% 0.19/0.51 % Result found by SubtermCWHack
% 0.19/0.51 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 % Starting sh5l with 300s (1) cores
% 0.19/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.19/0.51 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.19/0.51 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.19/0.51 % Preprocessing time : 0.001 s
% 0.19/0.51
% 0.19/0.51 % Proof found!
% 0.19/0.51 % SZS status Theorem
% 0.19/0.51 % SZS output start CNFRefutation
% See solution above
% 0.19/0.52 % Parsed axioms : 24
% 0.19/0.52 % Removed by relevancy pruning/SinE : 1
% 0.19/0.52 % Initial clauses : 56
% 0.19/0.52 % Removed in clause preprocessing : 4
% 0.19/0.52 % Initial clauses in saturation : 52
% 0.19/0.52 % Processed clauses : 1269
% 0.19/0.52 % ...of these trivial : 0
% 0.19/0.52 % ...subsumed : 711
% 0.19/0.52 % ...remaining for further processing : 558
% 0.19/0.52 % Other redundant clauses eliminated : 1
% 0.19/0.52 % Clauses deleted for lack of memory : 0
% 0.19/0.52 % Backward-subsumed : 27
% 0.19/0.52 % Backward-rewritten : 2
% 0.19/0.52 % Generated clauses : 3549
% 0.19/0.52 % ...of the previous two non-redundant : 2679
% 0.19/0.52 % ...aggressively subsumed : 0
% 0.19/0.52 % Contextual simplify-reflections : 64
% 0.19/0.52 % Paramodulations : 3548
% 0.19/0.52 % Factorizations : 0
% 0.19/0.52 % NegExts : 0
% 0.19/0.52 % Equation resolutions : 1
% 0.19/0.52 % Disequality decompositions : 0
% 0.19/0.52 % Total rewrite steps : 6313
% 0.19/0.52 % ...of those cached : 6285
% 0.19/0.52 % Propositional unsat checks : 0
% 0.19/0.52 % Propositional check models : 0
% 0.19/0.52 % Propositional check unsatisfiable : 0
% 0.19/0.52 % Propositional clauses : 0
% 0.19/0.52 % Propositional clauses after purity: 0
% 0.19/0.52 % Propositional unsat core size : 0
% 0.19/0.52 % Propositional preprocessing time : 0.000
% 0.19/0.52 % Propositional encoding time : 0.000
% 0.19/0.52 % Propositional solver time : 0.000
% 0.19/0.52 % Success case prop preproc time : 0.000
% 0.19/0.52 % Success case prop encoding time : 0.000
% 0.19/0.52 % Success case prop solver time : 0.000
% 0.19/0.52 % Current number of processed clauses : 528
% 0.19/0.52 % Positive orientable unit clauses : 31
% 0.19/0.52 % Positive unorientable unit clauses: 0
% 0.19/0.52 % Negative unit clauses : 10
% 0.19/0.52 % Non-unit-clauses : 487
% 0.19/0.52 % Current number of unprocessed clauses: 1454
% 0.19/0.52 % ...number of literals in the above : 9861
% 0.19/0.52 % Current number of archived formulas : 0
% 0.19/0.52 % Current number of archived clauses : 29
% 0.19/0.52 % Clause-clause subsumption calls (NU) : 53031
% 0.19/0.52 % Rec. Clause-clause subsumption calls : 8753
% 0.19/0.52 % Non-unit clause-clause subsumptions : 624
% 0.19/0.52 % Unit Clause-clause subsumption calls : 400
% 0.19/0.52 % Rewrite failures with RHS unbound : 0
% 0.19/0.52 % BW rewrite match attempts : 14
% 0.19/0.52 % BW rewrite match successes : 1
% 0.19/0.52 % Condensation attempts : 0
% 0.19/0.52 % Condensation successes : 0
% 0.19/0.52 % Termbank termtop insertions : 76882
% 0.19/0.52 % Search garbage collected termcells : 973
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.066 s
% 0.19/0.52 % System time : 0.005 s
% 0.19/0.52 % Total time : 0.071 s
% 0.19/0.52 % Maximum resident set size: 3612 pages
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.067 s
% 0.19/0.52 % System time : 0.010 s
% 0.19/0.52 % Total time : 0.077 s
% 0.19/0.52 % Maximum resident set size: 4608 pages
% 0.19/0.52 % E exiting
%------------------------------------------------------------------------------