TSTP Solution File: NUM459+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM459+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:55:51 EDT 2023
% Result : Theorem 0.15s 0.58s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 17 unt; 0 def)
% Number of atoms : 191 ( 68 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 217 ( 87 ~; 84 |; 33 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn; 33 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = xn )
& sdtlseqdt0(xm,xn)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xn,X1) = xm )
& sdtlseqdt0(xn,xm) )
=> xm = xn ),
file('/export/starexec/sandbox/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p',m__) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p',mAddAsso) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p',mDefLE) ).
fof(mLERefl,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> sdtlseqdt0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p',mLERefl) ).
fof(m__745,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p',m__745) ).
fof(mAddCanc,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( sdtpldt0(X1,X2) = sdtpldt0(X1,X3)
| sdtpldt0(X2,X1) = sdtpldt0(X3,X1) )
=> X2 = X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p',mAddCanc) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p',m_AddZero) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p',mSortsC) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p',mSortsB) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p',mAddComm) ).
fof(mZeroAdd,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtpldt0(X1,X2) = sz00
=> ( X1 = sz00
& X2 = sz00 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p',mZeroAdd) ).
fof(c_0_11,negated_conjecture,
~ ( ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = xn )
& sdtlseqdt0(xm,xn)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xn,X1) = xm )
& sdtlseqdt0(xn,xm) )
=> xm = xn ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_12,plain,
! [X15,X16,X17] :
( ~ aNaturalNumber0(X15)
| ~ aNaturalNumber0(X16)
| ~ aNaturalNumber0(X17)
| sdtpldt0(sdtpldt0(X15,X16),X17) = sdtpldt0(X15,sdtpldt0(X16,X17)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])]) ).
fof(c_0_13,negated_conjecture,
( aNaturalNumber0(esk1_0)
& sdtpldt0(xm,esk1_0) = xn
& sdtlseqdt0(xm,xn)
& aNaturalNumber0(esk2_0)
& sdtpldt0(xn,esk2_0) = xm
& sdtlseqdt0(xn,xm)
& xm != xn ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_14,plain,
! [X6,X7,X9] :
( ( aNaturalNumber0(esk3_2(X6,X7))
| ~ sdtlseqdt0(X6,X7)
| ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X7) )
& ( sdtpldt0(X6,esk3_2(X6,X7)) = X7
| ~ sdtlseqdt0(X6,X7)
| ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X7) )
& ( ~ aNaturalNumber0(X9)
| sdtpldt0(X6,X9) != X7
| sdtlseqdt0(X6,X7)
| ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefLE])])])])]) ).
fof(c_0_15,plain,
! [X10] :
( ~ aNaturalNumber0(X10)
| sdtlseqdt0(X10,X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLERefl])]) ).
cnf(c_0_16,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
sdtpldt0(xn,esk2_0) = xm,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
aNaturalNumber0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__745]) ).
cnf(c_0_20,plain,
( sdtpldt0(X1,esk3_2(X1,X2)) = X2
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( sdtlseqdt0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X22,X23,X24] :
( ( sdtpldt0(X22,X23) != sdtpldt0(X22,X24)
| X23 = X24
| ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X23)
| ~ aNaturalNumber0(X24) )
& ( sdtpldt0(X23,X22) != sdtpldt0(X24,X22)
| X23 = X24
| ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X23)
| ~ aNaturalNumber0(X24) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddCanc])])]) ).
fof(c_0_23,plain,
! [X18] :
( ( sdtpldt0(X18,sz00) = X18
| ~ aNaturalNumber0(X18) )
& ( X18 = sdtpldt0(sz00,X18)
| ~ aNaturalNumber0(X18) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])]) ).
cnf(c_0_24,negated_conjecture,
( sdtpldt0(xn,sdtpldt0(esk2_0,X1)) = sdtpldt0(xm,X1)
| ~ aNaturalNumber0(X1) ),
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_19])]) ).
cnf(c_0_25,plain,
( sdtpldt0(X1,esk3_2(X1,X1)) = X1
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( aNaturalNumber0(esk3_2(X1,X2))
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,plain,
( X2 = X3
| sdtpldt0(X1,X2) != sdtpldt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_30,negated_conjecture,
( sdtpldt0(xm,esk3_2(esk2_0,esk2_0)) = xm
| ~ aNaturalNumber0(esk3_2(esk2_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17]),c_0_18])]) ).
cnf(c_0_31,plain,
( aNaturalNumber0(esk3_2(X1,X1))
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_32,plain,
( X1 = sz00
| sdtpldt0(X2,X1) != X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
sdtpldt0(xm,esk3_2(esk2_0,esk2_0)) = xm,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_18])]) ).
cnf(c_0_34,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__745]) ).
fof(c_0_35,plain,
! [X11,X12] :
( ~ aNaturalNumber0(X11)
| ~ aNaturalNumber0(X12)
| aNaturalNumber0(sdtpldt0(X11,X12)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_36,negated_conjecture,
( esk3_2(esk2_0,esk2_0) = sz00
| ~ aNaturalNumber0(esk3_2(esk2_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_37,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_38,negated_conjecture,
esk3_2(esk2_0,esk2_0) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_18])]) ).
cnf(c_0_39,plain,
( aNaturalNumber0(sdtpldt0(X1,sdtpldt0(X2,X3)))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_16]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
sdtpldt0(esk2_0,sz00) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_38]),c_0_18])]) ).
fof(c_0_41,plain,
! [X13,X14] :
( ~ aNaturalNumber0(X13)
| ~ aNaturalNumber0(X14)
| sdtpldt0(X13,X14) = sdtpldt0(X14,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])]) ).
cnf(c_0_42,negated_conjecture,
( aNaturalNumber0(sdtpldt0(X1,esk2_0))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_29]),c_0_18])]) ).
cnf(c_0_43,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_44,plain,
( X1 = X3
| sdtpldt0(X1,X2) != sdtpldt0(X3,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_45,negated_conjecture,
( aNaturalNumber0(sdtpldt0(esk2_0,X1))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_18])]) ).
cnf(c_0_46,negated_conjecture,
( X1 = xn
| sdtpldt0(X1,esk2_0) != xm
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_17]),c_0_19]),c_0_18])]) ).
cnf(c_0_47,plain,
( sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(X3,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_16]),c_0_37]) ).
fof(c_0_48,plain,
! [X25,X26] :
( ( X25 = sz00
| sdtpldt0(X25,X26) != sz00
| ~ aNaturalNumber0(X25)
| ~ aNaturalNumber0(X26) )
& ( X26 = sz00
| sdtpldt0(X25,X26) != sz00
| ~ aNaturalNumber0(X25)
| ~ aNaturalNumber0(X26) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroAdd])])]) ).
cnf(c_0_49,negated_conjecture,
( sdtpldt0(esk2_0,X1) = sz00
| sdtpldt0(xm,X1) != xn
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_19])]),c_0_45]) ).
cnf(c_0_50,negated_conjecture,
sdtpldt0(xm,esk1_0) = xn,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_51,negated_conjecture,
aNaturalNumber0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_52,negated_conjecture,
( X1 = xn
| sdtpldt0(esk2_0,X1) != xm
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_43]),c_0_18])]) ).
cnf(c_0_53,negated_conjecture,
( sdtpldt0(X1,xm) = sdtpldt0(xm,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_47]),c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_54,negated_conjecture,
xm != xn,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_55,plain,
( X1 = sz00
| sdtpldt0(X1,X2) != sz00
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,negated_conjecture,
sdtpldt0(esk2_0,esk1_0) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_57,negated_conjecture,
sdtpldt0(xm,esk2_0) != xm,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_34]),c_0_18])]),c_0_54]) ).
cnf(c_0_58,negated_conjecture,
esk2_0 = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_51]),c_0_18])]) ).
cnf(c_0_59,negated_conjecture,
sdtpldt0(xm,sz00) = xm,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_28]),c_0_17]),c_0_29]),c_0_18])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM459+2 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n016.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 14:43:51 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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/tmp/tmp.mnRRcR9P5O/E---3.1_7342.p
% 0.15/0.58 # Version: 3.1pre001
% 0.15/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.58 # Starting sh5l with 300s (1) cores
% 0.15/0.58 # new_bool_3 with pid 7421 completed with status 0
% 0.15/0.58 # Result found by new_bool_3
% 0.15/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.58 # Search class: FGUSF-FFMM22-SFFFFFNN
% 0.15/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.15/0.58 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 7424 completed with status 0
% 0.15/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.15/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.58 # Search class: FGUSF-FFMM22-SFFFFFNN
% 0.15/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.15/0.58 # Preprocessing time : 0.001 s
% 0.15/0.58 # Presaturation interreduction done
% 0.15/0.58
% 0.15/0.58 # Proof found!
% 0.15/0.58 # SZS status Theorem
% 0.15/0.58 # SZS output start CNFRefutation
% See solution above
% 0.15/0.58 # Parsed axioms : 22
% 0.15/0.58 # Removed by relevancy pruning/SinE : 3
% 0.15/0.58 # Initial clauses : 34
% 0.15/0.58 # Removed in clause preprocessing : 1
% 0.15/0.58 # Initial clauses in saturation : 33
% 0.15/0.58 # Processed clauses : 1522
% 0.15/0.58 # ...of these trivial : 17
% 0.15/0.58 # ...subsumed : 935
% 0.15/0.58 # ...remaining for further processing : 570
% 0.15/0.58 # Other redundant clauses eliminated : 19
% 0.15/0.58 # Clauses deleted for lack of memory : 0
% 0.15/0.58 # Backward-subsumed : 8
% 0.15/0.58 # Backward-rewritten : 126
% 0.15/0.58 # Generated clauses : 8208
% 0.15/0.58 # ...of the previous two non-redundant : 7257
% 0.15/0.58 # ...aggressively subsumed : 0
% 0.15/0.58 # Contextual simplify-reflections : 75
% 0.15/0.58 # Paramodulations : 8181
% 0.15/0.58 # Factorizations : 0
% 0.15/0.58 # NegExts : 0
% 0.15/0.58 # Equation resolutions : 27
% 0.15/0.58 # Total rewrite steps : 8312
% 0.15/0.58 # Propositional unsat checks : 0
% 0.15/0.58 # Propositional check models : 0
% 0.15/0.58 # Propositional check unsatisfiable : 0
% 0.15/0.58 # Propositional clauses : 0
% 0.15/0.58 # Propositional clauses after purity: 0
% 0.15/0.58 # Propositional unsat core size : 0
% 0.15/0.58 # Propositional preprocessing time : 0.000
% 0.15/0.58 # Propositional encoding time : 0.000
% 0.15/0.58 # Propositional solver time : 0.000
% 0.15/0.58 # Success case prop preproc time : 0.000
% 0.15/0.58 # Success case prop encoding time : 0.000
% 0.15/0.58 # Success case prop solver time : 0.000
% 0.15/0.58 # Current number of processed clauses : 402
% 0.15/0.58 # Positive orientable unit clauses : 114
% 0.15/0.58 # Positive unorientable unit clauses: 0
% 0.15/0.58 # Negative unit clauses : 3
% 0.15/0.58 # Non-unit-clauses : 285
% 0.15/0.58 # Current number of unprocessed clauses: 5708
% 0.15/0.58 # ...number of literals in the above : 29158
% 0.15/0.58 # Current number of archived formulas : 0
% 0.15/0.58 # Current number of archived clauses : 167
% 0.15/0.58 # Clause-clause subsumption calls (NU) : 14361
% 0.15/0.58 # Rec. Clause-clause subsumption calls : 10234
% 0.15/0.58 # Non-unit clause-clause subsumptions : 980
% 0.15/0.58 # Unit Clause-clause subsumption calls : 370
% 0.15/0.58 # Rewrite failures with RHS unbound : 0
% 0.15/0.58 # BW rewrite match attempts : 151
% 0.15/0.58 # BW rewrite match successes : 26
% 0.15/0.58 # Condensation attempts : 0
% 0.15/0.58 # Condensation successes : 0
% 0.15/0.58 # Termbank termtop insertions : 134155
% 0.15/0.58
% 0.15/0.58 # -------------------------------------------------
% 0.15/0.58 # User time : 0.140 s
% 0.15/0.58 # System time : 0.008 s
% 0.15/0.58 # Total time : 0.148 s
% 0.15/0.58 # Maximum resident set size: 1864 pages
% 0.15/0.58
% 0.15/0.58 # -------------------------------------------------
% 0.15/0.58 # User time : 0.140 s
% 0.15/0.58 # System time : 0.011 s
% 0.15/0.58 # Total time : 0.150 s
% 0.15/0.58 # Maximum resident set size: 1692 pages
% 0.15/0.58 % E---3.1 exiting
% 0.15/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------