TSTP Solution File: COM013+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COM013+4 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:07:15 EDT 2024
% Result : Theorem 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 266 ( 14 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 359 ( 130 ~; 152 |; 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 : 76 ( 1 sgn 32 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] :
( aElement0(X3)
& ( X2 = X3
| ( ( aReductOfIn0(X3,X2,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X2,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X2,xR,X3) ) )
& sdtmndtasgtdt0(X2,xR,X3)
& ~ ? [X4] : aReductOfIn0(X4,X3,xR)
& aNormalFormOfIn0(X3,X2,xR) ) ) )
=> ? [X2] :
( ( aElement0(X2)
& ( X1 = X2
| aReductOfIn0(X2,X1,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X1,xR)
& sdtmndtplgtdt0(X3,xR,X2) )
| sdtmndtplgtdt0(X1,xR,X2)
| sdtmndtasgtdt0(X1,xR,X2) )
& ~ ? [X3] : aReductOfIn0(X3,X2,xR) )
| aNormalFormOfIn0(X2,X1,xR) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mTCDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtplgtdt0(X1,X2,X3)
<=> ( aReductOfIn0(X3,X1,X2)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,X2)
& sdtmndtplgtdt0(X4,X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCDef) ).
fof(mReduct,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aRewritingSystem0(X2) )
=> ! [X3] :
( aReductOfIn0(X3,X1,X2)
=> aElement0(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mReduct) ).
fof(m__587,hypothesis,
( aRewritingSystem0(xR)
& ! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( ( aReductOfIn0(X2,X1,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X1,xR)
& sdtmndtplgtdt0(X3,xR,X2) )
| sdtmndtplgtdt0(X1,xR,X2) )
=> iLess0(X2,X1) ) )
& isTerminating0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__587) ).
fof(mTermin,axiom,
! [X1] :
( aRewritingSystem0(X1)
=> ( isTerminating0(X1)
<=> ! [X2,X3] :
( ( aElement0(X2)
& aElement0(X3) )
=> ( sdtmndtplgtdt0(X2,X1,X3)
=> iLess0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTermin) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] :
( aElement0(X3)
& ( X2 = X3
| ( ( aReductOfIn0(X3,X2,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X2,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X2,xR,X3) ) )
& sdtmndtasgtdt0(X2,xR,X3)
& ~ ? [X4] : aReductOfIn0(X4,X3,xR)
& aNormalFormOfIn0(X3,X2,xR) ) ) )
=> ? [X2] :
( ( aElement0(X2)
& ( X1 = X2
| aReductOfIn0(X2,X1,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X1,xR)
& sdtmndtplgtdt0(X3,xR,X2) )
| sdtmndtplgtdt0(X1,xR,X2)
| sdtmndtasgtdt0(X1,xR,X2) )
& ~ ? [X3] : aReductOfIn0(X3,X2,xR) )
| aNormalFormOfIn0(X2,X1,xR) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X27,X28,X29,X31] :
( ( aElement0(esk7_3(X27,X28,X29))
| aReductOfIn0(X29,X27,X28)
| ~ sdtmndtplgtdt0(X27,X28,X29)
| ~ aElement0(X27)
| ~ aRewritingSystem0(X28)
| ~ aElement0(X29) )
& ( aReductOfIn0(esk7_3(X27,X28,X29),X27,X28)
| aReductOfIn0(X29,X27,X28)
| ~ sdtmndtplgtdt0(X27,X28,X29)
| ~ aElement0(X27)
| ~ aRewritingSystem0(X28)
| ~ aElement0(X29) )
& ( sdtmndtplgtdt0(esk7_3(X27,X28,X29),X28,X29)
| aReductOfIn0(X29,X27,X28)
| ~ sdtmndtplgtdt0(X27,X28,X29)
| ~ aElement0(X27)
| ~ aRewritingSystem0(X28)
| ~ aElement0(X29) )
& ( ~ aReductOfIn0(X29,X27,X28)
| sdtmndtplgtdt0(X27,X28,X29)
| ~ aElement0(X27)
| ~ aRewritingSystem0(X28)
| ~ aElement0(X29) )
& ( ~ aElement0(X31)
| ~ aReductOfIn0(X31,X27,X28)
| ~ sdtmndtplgtdt0(X31,X28,X29)
| sdtmndtplgtdt0(X27,X28,X29)
| ~ aElement0(X27)
| ~ aRewritingSystem0(X28)
| ~ aElement0(X29) ) ),
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_7,plain,
! [X39,X40,X41] :
( ~ aElement0(X39)
| ~ aRewritingSystem0(X40)
| ~ aReductOfIn0(X41,X39,X40)
| aElement0(X41) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mReduct])])])]) ).
fof(c_0_8,negated_conjecture,
! [X10,X13,X14,X15] :
( aElement0(esk1_0)
& ( aElement0(esk2_1(X10))
| ~ iLess0(X10,esk1_0)
| ~ aElement0(X10) )
& ( aElement0(esk3_1(X10))
| aReductOfIn0(esk2_1(X10),X10,xR)
| X10 = esk2_1(X10)
| ~ iLess0(X10,esk1_0)
| ~ aElement0(X10) )
& ( aReductOfIn0(esk3_1(X10),X10,xR)
| aReductOfIn0(esk2_1(X10),X10,xR)
| X10 = esk2_1(X10)
| ~ iLess0(X10,esk1_0)
| ~ aElement0(X10) )
& ( sdtmndtplgtdt0(esk3_1(X10),xR,esk2_1(X10))
| aReductOfIn0(esk2_1(X10),X10,xR)
| X10 = esk2_1(X10)
| ~ iLess0(X10,esk1_0)
| ~ aElement0(X10) )
& ( sdtmndtplgtdt0(X10,xR,esk2_1(X10))
| X10 = esk2_1(X10)
| ~ iLess0(X10,esk1_0)
| ~ aElement0(X10) )
& ( sdtmndtasgtdt0(X10,xR,esk2_1(X10))
| ~ iLess0(X10,esk1_0)
| ~ aElement0(X10) )
& ( ~ aReductOfIn0(X13,esk2_1(X10),xR)
| ~ iLess0(X10,esk1_0)
| ~ aElement0(X10) )
& ( aNormalFormOfIn0(esk2_1(X10),X10,xR)
| ~ iLess0(X10,esk1_0)
| ~ aElement0(X10) )
& ( esk1_0 != X14
| ~ aElement0(X14)
| aReductOfIn0(esk4_1(X14),X14,xR) )
& ( ~ aReductOfIn0(X14,esk1_0,xR)
| ~ aElement0(X14)
| aReductOfIn0(esk4_1(X14),X14,xR) )
& ( ~ aElement0(X15)
| ~ aReductOfIn0(X15,esk1_0,xR)
| ~ sdtmndtplgtdt0(X15,xR,X14)
| ~ aElement0(X14)
| aReductOfIn0(esk4_1(X14),X14,xR) )
& ( ~ sdtmndtplgtdt0(esk1_0,xR,X14)
| ~ aElement0(X14)
| aReductOfIn0(esk4_1(X14),X14,xR) )
& ( ~ sdtmndtasgtdt0(esk1_0,xR,X14)
| ~ aElement0(X14)
| aReductOfIn0(esk4_1(X14),X14,xR) )
& ~ aNormalFormOfIn0(X14,esk1_0,xR) ),
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_5])])])])])]) ).
cnf(c_0_9,plain,
( sdtmndtplgtdt0(X2,X3,X1)
| ~ aReductOfIn0(X1,X2,X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( aReductOfIn0(esk4_1(X1),X1,xR)
| esk1_0 != X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
aElement0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,hypothesis,
! [X6,X7,X8] :
( aRewritingSystem0(xR)
& ( ~ aReductOfIn0(X7,X6,xR)
| iLess0(X7,X6)
| ~ aElement0(X6)
| ~ aElement0(X7) )
& ( ~ aElement0(X8)
| ~ aReductOfIn0(X8,X6,xR)
| ~ sdtmndtplgtdt0(X8,xR,X7)
| iLess0(X7,X6)
| ~ aElement0(X6)
| ~ aElement0(X7) )
& ( ~ sdtmndtplgtdt0(X6,xR,X7)
| iLess0(X7,X6)
| ~ aElement0(X6)
| ~ aElement0(X7) )
& isTerminating0(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_14,plain,
( sdtmndtplgtdt0(X2,X3,X4)
| ~ aElement0(X1)
| ~ aReductOfIn0(X1,X2,X3)
| ~ sdtmndtplgtdt0(X1,X3,X4)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_15,plain,
! [X17,X18,X19] :
( ( ~ isTerminating0(X17)
| ~ aElement0(X18)
| ~ aElement0(X19)
| ~ sdtmndtplgtdt0(X18,X17,X19)
| iLess0(X19,X18)
| ~ aRewritingSystem0(X17) )
& ( aElement0(esk5_1(X17))
| isTerminating0(X17)
| ~ aRewritingSystem0(X17) )
& ( aElement0(esk6_1(X17))
| isTerminating0(X17)
| ~ aRewritingSystem0(X17) )
& ( sdtmndtplgtdt0(esk5_1(X17),X17,esk6_1(X17))
| isTerminating0(X17)
| ~ aRewritingSystem0(X17) )
& ( ~ iLess0(esk6_1(X17),esk5_1(X17))
| isTerminating0(X17)
| ~ aRewritingSystem0(X17) ) ),
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_16,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
aReductOfIn0(esk4_1(esk1_0),esk1_0,xR),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12])]) ).
cnf(c_0_18,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ sdtmndtplgtdt0(X4,X2,X3)
| ~ aReductOfIn0(X4,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_20,plain,
( iLess0(X3,X2)
| ~ isTerminating0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X2,X1,X3)
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
sdtmndtplgtdt0(esk1_0,xR,esk4_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_12])]) ).
cnf(c_0_22,hypothesis,
isTerminating0(xR),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,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_17]),c_0_18]),c_0_12])]) ).
cnf(c_0_24,negated_conjecture,
( ~ aReductOfIn0(X1,esk2_1(X2),xR)
| ~ iLess0(X2,esk1_0)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( aReductOfIn0(esk4_1(X1),X1,xR)
| ~ sdtmndtplgtdt0(esk1_0,xR,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
( aElement0(esk2_1(X1))
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
( sdtmndtplgtdt0(esk1_0,xR,X1)
| ~ sdtmndtplgtdt0(esk4_1(esk1_0),xR,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18]),c_0_12])]) ).
cnf(c_0_28,negated_conjecture,
( sdtmndtplgtdt0(X1,xR,esk2_1(X1))
| X1 = esk2_1(X1)
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_18]),c_0_23]),c_0_12])]) ).
cnf(c_0_30,negated_conjecture,
( ~ sdtmndtplgtdt0(esk1_0,xR,esk2_1(X1))
| ~ iLess0(X1,esk1_0)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( esk2_1(esk4_1(esk1_0)) = esk4_1(esk1_0)
| sdtmndtplgtdt0(esk1_0,xR,esk2_1(esk4_1(esk1_0)))
| ~ aElement0(esk2_1(esk4_1(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_23])]) ).
cnf(c_0_32,negated_conjecture,
( aReductOfIn0(esk4_1(X1),X1,xR)
| ~ aReductOfIn0(X1,esk1_0,xR)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
( esk2_1(esk4_1(esk1_0)) = esk4_1(esk1_0)
| ~ aElement0(esk2_1(esk4_1(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29]),c_0_23])]) ).
cnf(c_0_34,negated_conjecture,
( ~ iLess0(X1,esk1_0)
| ~ aReductOfIn0(esk2_1(X1),esk1_0,xR)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_32]),c_0_26]) ).
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_33,c_0_26]),c_0_29]),c_0_23])]) ).
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_29]),c_0_17]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : COM013+4 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.08/0.29 % Computer : n032.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Sun May 19 10:09:37 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.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.14/0.45 # Version: 3.1.0
% 0.14/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 # Starting sh5l with 300s (1) cores
% 0.14/0.45 # new_bool_3 with pid 3800 completed with status 0
% 0.14/0.45 # Result found by new_bool_3
% 0.14/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 # Search class: FGHSF-FFMS31-SFFFFFNN
% 0.14/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 164s (1) cores
% 0.14/0.45 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 3804 completed with status 0
% 0.14/0.45 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.14/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 # Search class: FGHSF-FFMS31-SFFFFFNN
% 0.14/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 164s (1) cores
% 0.14/0.45 # Preprocessing time : 0.001 s
% 0.14/0.45
% 0.14/0.45 # Proof found!
% 0.14/0.45 # SZS status Theorem
% 0.14/0.45 # SZS output start CNFRefutation
% See solution above
% 0.14/0.45 # Parsed axioms : 15
% 0.14/0.45 # Removed by relevancy pruning/SinE : 2
% 0.14/0.45 # Initial clauses : 44
% 0.14/0.45 # Removed in clause preprocessing : 4
% 0.14/0.45 # Initial clauses in saturation : 40
% 0.14/0.45 # Processed clauses : 96
% 0.14/0.45 # ...of these trivial : 8
% 0.14/0.45 # ...subsumed : 22
% 0.14/0.45 # ...remaining for further processing : 66
% 0.14/0.45 # Other redundant clauses eliminated : 2
% 0.14/0.45 # Clauses deleted for lack of memory : 0
% 0.14/0.45 # Backward-subsumed : 2
% 0.14/0.45 # Backward-rewritten : 1
% 0.14/0.45 # Generated clauses : 139
% 0.14/0.45 # ...of the previous two non-redundant : 122
% 0.14/0.45 # ...aggressively subsumed : 0
% 0.14/0.45 # Contextual simplify-reflections : 13
% 0.14/0.45 # Paramodulations : 137
% 0.14/0.45 # Factorizations : 0
% 0.14/0.45 # NegExts : 0
% 0.14/0.45 # Equation resolutions : 2
% 0.14/0.45 # Disequality decompositions : 0
% 0.14/0.45 # Total rewrite steps : 160
% 0.14/0.45 # ...of those cached : 151
% 0.14/0.45 # Propositional unsat checks : 0
% 0.14/0.45 # Propositional check models : 0
% 0.14/0.45 # Propositional check unsatisfiable : 0
% 0.14/0.45 # Propositional clauses : 0
% 0.14/0.45 # Propositional clauses after purity: 0
% 0.14/0.45 # Propositional unsat core size : 0
% 0.14/0.45 # Propositional preprocessing time : 0.000
% 0.14/0.45 # Propositional encoding time : 0.000
% 0.14/0.45 # Propositional solver time : 0.000
% 0.14/0.45 # Success case prop preproc time : 0.000
% 0.14/0.45 # Success case prop encoding time : 0.000
% 0.14/0.45 # Success case prop solver time : 0.000
% 0.14/0.45 # Current number of processed clauses : 61
% 0.14/0.45 # Positive orientable unit clauses : 10
% 0.14/0.45 # Positive unorientable unit clauses: 0
% 0.14/0.45 # Negative unit clauses : 2
% 0.14/0.45 # Non-unit-clauses : 49
% 0.14/0.45 # Current number of unprocessed clauses: 63
% 0.14/0.45 # ...number of literals in the above : 346
% 0.14/0.45 # Current number of archived formulas : 0
% 0.14/0.45 # Current number of archived clauses : 3
% 0.14/0.45 # Clause-clause subsumption calls (NU) : 444
% 0.14/0.45 # Rec. Clause-clause subsumption calls : 94
% 0.14/0.45 # Non-unit clause-clause subsumptions : 26
% 0.14/0.45 # Unit Clause-clause subsumption calls : 107
% 0.14/0.45 # Rewrite failures with RHS unbound : 0
% 0.14/0.45 # BW rewrite match attempts : 3
% 0.14/0.45 # BW rewrite match successes : 1
% 0.14/0.45 # Condensation attempts : 0
% 0.14/0.45 # Condensation successes : 0
% 0.14/0.45 # Termbank termtop insertions : 6682
% 0.14/0.45 # Search garbage collected termcells : 1127
% 0.14/0.45
% 0.14/0.45 # -------------------------------------------------
% 0.14/0.45 # User time : 0.009 s
% 0.14/0.45 # System time : 0.004 s
% 0.14/0.45 # Total time : 0.014 s
% 0.14/0.45 # Maximum resident set size: 1880 pages
% 0.14/0.45
% 0.14/0.45 # -------------------------------------------------
% 0.14/0.45 # User time : 0.011 s
% 0.14/0.45 # System time : 0.007 s
% 0.14/0.45 # Total time : 0.017 s
% 0.14/0.45 # Maximum resident set size: 1712 pages
% 0.14/0.45 % E---3.1 exiting
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------