%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM013+4 : 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 : n003.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.26s 0.55s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 268 ( 13 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 363 ( 132 ~; 154 |; 59 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 79 ( 1 sgn 32 !; 14 ?)
% 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(m__,conjecture,
! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] :
( aNormalFormOfIn0(X3,X2,xR)
& ~ ? [X4] : aReductOfIn0(X4,X3,xR)
& sdtmndtasgtdt0(X2,xR,X3)
& ( ( sdtmndtplgtdt0(X2,xR,X3)
& ( ? [X4] :
( sdtmndtplgtdt0(X4,xR,X3)
& aReductOfIn0(X4,X2,xR)
& aElement0(X4) )
| aReductOfIn0(X3,X2,xR) ) )
| X2 = X3 )
& aElement0(X3) ) ) )
=> ? [X2] :
( aNormalFormOfIn0(X2,X1,xR)
| ( ~ ? [X3] : aReductOfIn0(X3,X2,xR)
& ( sdtmndtasgtdt0(X1,xR,X2)
| sdtmndtplgtdt0(X1,xR,X2)
| ? [X3] :
( sdtmndtplgtdt0(X3,xR,X2)
& aReductOfIn0(X3,X1,xR)
& aElement0(X3) )
| aReductOfIn0(X2,X1,xR)
| X1 = X2 )
& aElement0(X2) ) ) ) ),
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)
& ! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> ( ( sdtmndtplgtdt0(X1,xR,X2)
| ? [X3] :
( sdtmndtplgtdt0(X3,xR,X2)
& aReductOfIn0(X3,X1,xR)
& aElement0(X3) )
| aReductOfIn0(X2,X1,xR) )
=> iLess0(X2,X1) ) )
& aRewritingSystem0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__587) ).
fof(c_0_5,plain,
! [X26,X27,X28,X30] :
( ( ~ aElement0(X28)
| ~ aRewritingSystem0(X27)
| ~ aElement0(X26)
| sdtmndtplgtdt0(X26,X27,X28)
| ~ sdtmndtplgtdt0(X30,X27,X28)
| ~ aReductOfIn0(X30,X26,X27)
| ~ aElement0(X30) )
& ( ~ aElement0(X28)
| ~ aRewritingSystem0(X27)
| ~ aElement0(X26)
| sdtmndtplgtdt0(X26,X27,X28)
| ~ aReductOfIn0(X28,X26,X27) )
& ( ~ aElement0(X28)
| ~ aRewritingSystem0(X27)
| ~ aElement0(X26)
| ~ sdtmndtplgtdt0(X26,X27,X28)
| aReductOfIn0(X28,X26,X27)
| sdtmndtplgtdt0(esk6_3(X26,X27,X28),X27,X28) )
& ( ~ aElement0(X28)
| ~ aRewritingSystem0(X27)
| ~ aElement0(X26)
| ~ sdtmndtplgtdt0(X26,X27,X28)
| aReductOfIn0(X28,X26,X27)
| aReductOfIn0(esk6_3(X26,X27,X28),X26,X27) )
& ( ~ aElement0(X28)
| ~ aRewritingSystem0(X27)
| ~ aElement0(X26)
| ~ sdtmndtplgtdt0(X26,X27,X28)
| aReductOfIn0(X28,X26,X27)
| aElement0(esk6_3(X26,X27,X28)) ) ),
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_6,plain,
! [X23,X24,X25] :
( aElement0(X25)
| ~ aReductOfIn0(X25,X23,X24)
| ~ aRewritingSystem0(X24)
| ~ aElement0(X23) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mReduct])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] :
( aNormalFormOfIn0(X3,X2,xR)
& ~ ? [X4] : aReductOfIn0(X4,X3,xR)
& sdtmndtasgtdt0(X2,xR,X3)
& ( ( sdtmndtplgtdt0(X2,xR,X3)
& ( ? [X4] :
( sdtmndtplgtdt0(X4,xR,X3)
& aReductOfIn0(X4,X2,xR)
& aElement0(X4) )
| aReductOfIn0(X3,X2,xR) ) )
| X2 = X3 )
& aElement0(X3) ) ) )
=> ? [X2] :
( aNormalFormOfIn0(X2,X1,xR)
| ( ~ ? [X3] : aReductOfIn0(X3,X2,xR)
& ( sdtmndtasgtdt0(X1,xR,X2)
| sdtmndtplgtdt0(X1,xR,X2)
| ? [X3] :
( sdtmndtplgtdt0(X3,xR,X2)
& aReductOfIn0(X3,X1,xR)
& aElement0(X3) )
| aReductOfIn0(X2,X1,xR)
| X1 = X2 )
& aElement0(X2) ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,plain,
! [X45,X46,X47] :
( ( ~ aRewritingSystem0(X45)
| isTerminating0(X45)
| ~ iLess0(esk8_1(X45),esk7_1(X45)) )
& ( ~ aRewritingSystem0(X45)
| isTerminating0(X45)
| sdtmndtplgtdt0(esk7_1(X45),X45,esk8_1(X45)) )
& ( ~ aRewritingSystem0(X45)
| isTerminating0(X45)
| aElement0(esk8_1(X45)) )
& ( ~ aRewritingSystem0(X45)
| isTerminating0(X45)
| aElement0(esk7_1(X45)) )
& ( ~ aRewritingSystem0(X45)
| iLess0(X47,X46)
| ~ sdtmndtplgtdt0(X46,X45,X47)
| ~ aElement0(X47)
| ~ aElement0(X46)
| ~ isTerminating0(X45) ) ),
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_9,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aReductOfIn0(X1,X2,X3)
| sdtmndtplgtdt0(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
! [X7,X10,X11,X12] :
( ~ aNormalFormOfIn0(X11,esk1_0,xR)
& ( aReductOfIn0(esk4_1(X11),X11,xR)
| ~ aElement0(X11)
| ~ sdtmndtasgtdt0(esk1_0,xR,X11) )
& ( aReductOfIn0(esk4_1(X11),X11,xR)
| ~ aElement0(X11)
| ~ sdtmndtplgtdt0(esk1_0,xR,X11) )
& ( aReductOfIn0(esk4_1(X11),X11,xR)
| ~ aElement0(X11)
| ~ sdtmndtplgtdt0(X12,xR,X11)
| ~ aReductOfIn0(X12,esk1_0,xR)
| ~ aElement0(X12) )
& ( aReductOfIn0(esk4_1(X11),X11,xR)
| ~ aElement0(X11)
| ~ aReductOfIn0(X11,esk1_0,xR) )
& ( aReductOfIn0(esk4_1(X11),X11,xR)
| ~ aElement0(X11)
| esk1_0 != X11 )
& ( ~ aElement0(X7)
| ~ iLess0(X7,esk1_0)
| aNormalFormOfIn0(esk2_1(X7),X7,xR) )
& ( ~ aElement0(X7)
| ~ iLess0(X7,esk1_0)
| ~ aReductOfIn0(X10,esk2_1(X7),xR) )
& ( ~ aElement0(X7)
| ~ iLess0(X7,esk1_0)
| sdtmndtasgtdt0(X7,xR,esk2_1(X7)) )
& ( ~ aElement0(X7)
| ~ iLess0(X7,esk1_0)
| X7 = esk2_1(X7)
| sdtmndtplgtdt0(X7,xR,esk2_1(X7)) )
& ( ~ aElement0(X7)
| ~ iLess0(X7,esk1_0)
| X7 = esk2_1(X7)
| aReductOfIn0(esk2_1(X7),X7,xR)
| sdtmndtplgtdt0(esk3_1(X7),xR,esk2_1(X7)) )
& ( ~ aElement0(X7)
| ~ iLess0(X7,esk1_0)
| X7 = esk2_1(X7)
| aReductOfIn0(esk2_1(X7),X7,xR)
| aReductOfIn0(esk3_1(X7),X7,xR) )
& ( ~ aElement0(X7)
| ~ iLess0(X7,esk1_0)
| X7 = esk2_1(X7)
| aReductOfIn0(esk2_1(X7),X7,xR)
| aElement0(esk3_1(X7)) )
& ( ~ aElement0(X7)
| ~ iLess0(X7,esk1_0)
| aElement0(esk2_1(X7)) )
& aElement0(esk1_0) ),
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)],[c_0_7])])])])])]) ).
cnf(c_0_12,plain,
( ~ aRewritingSystem0(X1)
| ~ sdtmndtplgtdt0(X2,X1,X3)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ isTerminating0(X1)
| iLess0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X1,X2)
| sdtmndtplgtdt0(X1,X2,X3) ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( ~ aElement0(X1)
| esk1_0 != X1
| aReductOfIn0(esk4_1(X1),X1,xR) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
aElement0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,hypothesis,
! [X20,X21,X22] :
( isTerminating0(xR)
& ( ~ aElement0(X21)
| ~ aElement0(X20)
| iLess0(X21,X20)
| ~ sdtmndtplgtdt0(X20,xR,X21) )
& ( ~ aElement0(X21)
| ~ aElement0(X20)
| iLess0(X21,X20)
| ~ sdtmndtplgtdt0(X22,xR,X21)
| ~ aReductOfIn0(X22,X20,xR)
| ~ aElement0(X22) )
& ( ~ aElement0(X21)
| ~ aElement0(X20)
| iLess0(X21,X20)
| ~ aReductOfIn0(X21,X20,xR) )
& aRewritingSystem0(xR) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__587])])])])]) ).
cnf(c_0_17,plain,
( ~ aElement0(X4)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ sdtmndtplgtdt0(X1,X3,X4)
| ~ aReductOfIn0(X1,X2,X3)
| ~ aElement0(X1)
| sdtmndtplgtdt0(X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aReductOfIn0(X1,X2,X3)
| ~ isTerminating0(X3)
| iLess0(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10]) ).
cnf(c_0_19,negated_conjecture,
aReductOfIn0(esk4_1(esk1_0),esk1_0,xR),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15])]) ).
cnf(c_0_20,hypothesis,
isTerminating0(xR),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ aElement0(X1)
| ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X4,X1,X2)
| ~ sdtmndtplgtdt0(X4,X2,X3)
| sdtmndtplgtdt0(X1,X2,X3) ),
inference(csr,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_23,negated_conjecture,
( ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| aElement0(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,negated_conjecture,
iLess0(esk4_1(esk1_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_15])]) ).
cnf(c_0_25,negated_conjecture,
aElement0(esk4_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_19]),c_0_21]),c_0_15])]) ).
cnf(c_0_26,negated_conjecture,
( ~ aElement0(X2)
| ~ iLess0(X2,esk1_0)
| ~ aReductOfIn0(X1,esk2_1(X2),xR) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,negated_conjecture,
( ~ aElement0(X1)
| ~ sdtmndtplgtdt0(esk1_0,xR,X1)
| aReductOfIn0(esk4_1(X1),X1,xR) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
( ~ aElement0(X1)
| ~ sdtmndtplgtdt0(esk4_1(esk1_0),xR,X1)
| sdtmndtplgtdt0(esk1_0,xR,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_21]),c_0_15])]) ).
cnf(c_0_29,negated_conjecture,
( ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| X1 = esk2_1(X1)
| sdtmndtplgtdt0(X1,xR,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
aElement0(esk2_1(esk4_1(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
( ~ aElement0(X1)
| ~ aReductOfIn0(X1,esk1_0,xR)
| aReductOfIn0(esk4_1(X1),X1,xR) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,negated_conjecture,
( ~ aElement0(X1)
| ~ iLess0(X1,esk1_0)
| ~ sdtmndtplgtdt0(esk1_0,xR,esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23]) ).
cnf(c_0_33,negated_conjecture,
( sdtmndtplgtdt0(esk1_0,xR,esk2_1(esk4_1(esk1_0)))
| esk2_1(esk4_1(esk1_0)) = esk4_1(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_24]),c_0_25])]) ).
cnf(c_0_34,negated_conjecture,
( ~ aElement0(X1)
| ~ aReductOfIn0(esk2_1(X1),esk1_0,xR)
| ~ iLess0(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_31]),c_0_23]) ).
cnf(c_0_35,negated_conjecture,
esk2_1(esk4_1(esk1_0)) = esk4_1(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_24]),c_0_25])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_24]),c_0_19]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : COM013+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n003.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 14:15:46 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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.26/0.55 % Version: 3.5.1
% 0.26/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.55 % Starting sh5l with 300s (1) cores
% 0.26/0.55 % sh5l with pid 320971 completed with status 0
% 0.26/0.55 % Result found by sh5l
% 0.26/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.55 % Starting sh5l with 300s (1) cores
% 0.26/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.55 % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.26/0.55 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.55 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.55 % SubtermCWHack with pid 320972 completed with status 0
% 0.26/0.55 % Result found by SubtermCWHack
% 0.26/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.55 % Starting sh5l with 300s (1) cores
% 0.26/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.55 % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.26/0.55 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.55 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.55 % Preprocessing time : 0.001 s
% 0.26/0.55
% 0.26/0.55 % Proof found!
% 0.26/0.55 % SZS status Theorem
% 0.26/0.55 % SZS output start CNFRefutation
% See solution above
% 0.26/0.55 % Parsed axioms : 15
% 0.26/0.55 % Removed by relevancy pruning/SinE : 2
% 0.26/0.55 % Initial clauses : 44
% 0.26/0.55 % Removed in clause preprocessing : 4
% 0.26/0.55 % Initial clauses in saturation : 40
% 0.26/0.55 % Processed clauses : 83
% 0.26/0.55 % ...of these trivial : 0
% 0.26/0.55 % ...subsumed : 17
% 0.26/0.55 % ...remaining for further processing : 66
% 0.26/0.55 % Other redundant clauses eliminated : 2
% 0.26/0.55 % Clauses deleted for lack of memory : 0
% 0.26/0.55 % Backward-subsumed : 0
% 0.26/0.55 % Backward-rewritten : 2
% 0.26/0.55 % Generated clauses : 96
% 0.26/0.55 % ...of the previous two non-redundant : 83
% 0.26/0.55 % ...aggressively subsumed : 0
% 0.26/0.55 % Contextual simplify-reflections : 11
% 0.26/0.55 % Paramodulations : 94
% 0.26/0.55 % Factorizations : 0
% 0.26/0.55 % NegExts : 0
% 0.26/0.55 % Equation resolutions : 2
% 0.26/0.55 % Disequality decompositions : 0
% 0.26/0.55 % Total rewrite steps : 123
% 0.26/0.55 % ...of those cached : 115
% 0.26/0.55 % Propositional unsat checks : 0
% 0.26/0.55 % Propositional check models : 0
% 0.26/0.55 % Propositional check unsatisfiable : 0
% 0.26/0.55 % Propositional clauses : 0
% 0.26/0.55 % Propositional clauses after purity: 0
% 0.26/0.55 % Propositional unsat core size : 0
% 0.26/0.55 % Propositional preprocessing time : 0.000
% 0.26/0.55 % Propositional encoding time : 0.000
% 0.26/0.55 % Propositional solver time : 0.000
% 0.26/0.55 % Success case prop preproc time : 0.000
% 0.26/0.55 % Success case prop encoding time : 0.000
% 0.26/0.55 % Success case prop solver time : 0.000
% 0.26/0.55 % Current number of processed clauses : 62
% 0.26/0.55 % Positive orientable unit clauses : 7
% 0.26/0.55 % Positive unorientable unit clauses: 0
% 0.26/0.55 % Negative unit clauses : 4
% 0.26/0.55 % Non-unit-clauses : 51
% 0.26/0.55 % Current number of unprocessed clauses: 37
% 0.26/0.55 % ...number of literals in the above : 199
% 0.26/0.55 % Current number of archived formulas : 0
% 0.26/0.55 % Current number of archived clauses : 2
% 0.26/0.55 % Clause-clause subsumption calls (NU) : 314
% 0.26/0.55 % Rec. Clause-clause subsumption calls : 96
% 0.26/0.55 % Non-unit clause-clause subsumptions : 23
% 0.26/0.55 % Unit Clause-clause subsumption calls : 9
% 0.26/0.55 % Rewrite failures with RHS unbound : 0
% 0.26/0.55 % BW rewrite match attempts : 1
% 0.26/0.55 % BW rewrite match successes : 1
% 0.26/0.55 % Condensation attempts : 0
% 0.26/0.55 % Condensation successes : 0
% 0.26/0.55 % Termbank termtop insertions : 6079
% 0.26/0.55 % Search garbage collected termcells : 1111
% 0.26/0.55
% 0.26/0.55 % -------------------------------------------------
% 0.26/0.55 % User time : 0.013 s
% 0.26/0.55 % System time : 0.003 s
% 0.26/0.55 % Total time : 0.016 s
% 0.26/0.55 % Maximum resident set size: 3660 pages
% 0.26/0.55
% 0.26/0.55 % -------------------------------------------------
% 0.26/0.55 % User time : 0.016 s
% 0.26/0.55 % System time : 0.009 s
% 0.26/0.55 % Total time : 0.025 s
% 0.26/0.55 % Maximum resident set size: 4864 pages
% 0.26/0.55 % E exiting
%------------------------------------------------------------------------------