%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM471+2 : 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 : n010.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 01:49:12 PM UTC 2026
% Result : Theorem 1.65s 0.66s
% Output : CNFRefutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 64 ( 24 unt; 0 def)
% Number of atoms : 241 ( 83 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 283 ( 106 ~; 104 |; 53 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 40 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMulCanc,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2) )
=> ( ( sdtasdt0(X2,X1) = sdtasdt0(X3,X1)
| sdtasdt0(X1,X2) = sdtasdt0(X1,X3) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulCanc) ).
fof(m__1347,hypothesis,
xl != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1347) ).
fof(m__1324_04,hypothesis,
( doDivides0(xl,sdtpldt0(xm,xn))
& ? [X1] :
( sdtpldt0(xm,xn) = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) )
& doDivides0(xl,xm)
& ? [X1] :
( xm = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1324_04) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( sdtpldt0(X1,X3) = X2
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefLE) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(mLETotal,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLETotal) ).
fof(m__1379,hypothesis,
( xq = sdtsldt0(sdtpldt0(xm,xn),xl)
& sdtpldt0(xm,xn) = sdtasdt0(xl,xq)
& aNaturalNumber0(xq) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1379) ).
fof(m__,conjecture,
( sdtlseqdt0(xp,xq)
| ? [X1] :
( sdtpldt0(xp,X1) = xq
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mMonMul,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& X2 != X3
& X1 != sz00 )
=> ( sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X1,X2) != sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMonMul) ).
fof(m__1360,hypothesis,
( xp = sdtsldt0(xm,xl)
& xm = sdtasdt0(xl,xp)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1360) ).
fof(m__1324,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1324) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_AddZero) ).
fof(mLEAsym,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLEAsym) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(c_0_14,plain,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2) )
=> ( ( sdtasdt0(X2,X1) = sdtasdt0(X3,X1)
| sdtasdt0(X1,X2) = sdtasdt0(X1,X3) )
=> X2 = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[mMulCanc]) ).
fof(c_0_15,hypothesis,
xl != sz00,
inference(fof_simplification,[status(thm)],[m__1347]) ).
fof(c_0_16,hypothesis,
( doDivides0(xl,sdtpldt0(xm,xn))
& sdtpldt0(xm,xn) = sdtasdt0(xl,esk2_0)
& aNaturalNumber0(esk2_0)
& doDivides0(xl,xm)
& xm = sdtasdt0(xl,esk1_0)
& aNaturalNumber0(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1324_04])]) ).
fof(c_0_17,plain,
! [X34,X35,X37] :
( ( ~ aNaturalNumber0(X35)
| ~ aNaturalNumber0(X34)
| sdtlseqdt0(X34,X35)
| sdtpldt0(X34,X37) != X35
| ~ aNaturalNumber0(X37) )
& ( ~ aNaturalNumber0(X35)
| ~ aNaturalNumber0(X34)
| ~ sdtlseqdt0(X34,X35)
| sdtpldt0(X34,esk4_2(X34,X35)) = X35 )
& ( ~ aNaturalNumber0(X35)
| ~ aNaturalNumber0(X34)
| ~ sdtlseqdt0(X34,X35)
| aNaturalNumber0(esk4_2(X34,X35)) ) ),
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)],[mDefLE])])])])])]) ).
fof(c_0_18,plain,
! [X18,X19] :
( aNaturalNumber0(sdtpldt0(X18,X19))
| ~ aNaturalNumber0(X19)
| ~ aNaturalNumber0(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_19,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mLETotal]) ).
fof(c_0_20,plain,
! [X49,X50,X51] :
( ( ~ aNaturalNumber0(X49)
| X49 = sz00
| ~ aNaturalNumber0(X51)
| ~ aNaturalNumber0(X50)
| X50 = X51
| sdtasdt0(X50,X49) != sdtasdt0(X51,X49) )
& ( ~ aNaturalNumber0(X49)
| X49 = sz00
| ~ aNaturalNumber0(X51)
| ~ aNaturalNumber0(X50)
| X50 = X51
| sdtasdt0(X49,X50) != sdtasdt0(X49,X51) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
fof(c_0_21,hypothesis,
xl != sz00,
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_22,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
inference(split_conjunct,[status(thm)],[m__1379]) ).
fof(c_0_24,negated_conjecture,
~ ( sdtlseqdt0(xp,xq)
| ? [X1] :
( sdtpldt0(xp,X1) = xq
& aNaturalNumber0(X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_25,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_27,plain,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& X2 != X3
& X1 != sz00 )
=> ( sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X1,X2) != sdtasdt0(X1,X3) ) ) ),
inference(fof_simplification,[status(thm)],[mMonMul]) ).
fof(c_0_28,plain,
! [X68,X69] :
( ( ~ aNaturalNumber0(X69)
| ~ aNaturalNumber0(X68)
| sdtlseqdt0(X68,X69)
| sdtlseqdt0(X69,X68) )
& ( ~ aNaturalNumber0(X69)
| ~ aNaturalNumber0(X68)
| sdtlseqdt0(X68,X69)
| X69 != X68 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
cnf(c_0_29,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
| X1 = sz00
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,hypothesis,
xm = sdtasdt0(xl,xp),
inference(split_conjunct,[status(thm)],[m__1360]) ).
cnf(c_0_31,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1360]) ).
cnf(c_0_32,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_33,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_34,hypothesis,
sdtasdt0(xl,esk2_0) = sdtasdt0(xl,xq),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_35,hypothesis,
aNaturalNumber0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_36,negated_conjecture,
! [X6] :
( ~ sdtlseqdt0(xp,xq)
& ( sdtpldt0(xp,X6) != xq
| ~ aNaturalNumber0(X6) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
fof(c_0_37,plain,
! [X25] :
( ( ~ aNaturalNumber0(X25)
| X25 = sdtpldt0(sz00,X25) )
& ( ~ aNaturalNumber0(X25)
| sdtpldt0(X25,sz00) = X25 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])])]) ).
fof(c_0_38,plain,
! [X63,X64] :
( X63 = X64
| ~ sdtlseqdt0(X64,X63)
| ~ sdtlseqdt0(X63,X64)
| ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEAsym])])]) ).
cnf(c_0_39,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,sdtpldt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_26]) ).
cnf(c_0_40,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_41,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1324]) ).
fof(c_0_42,plain,
! [X54,X55,X56] :
( ( ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ sdtlseqdt0(X55,X56)
| X55 = X56
| X54 = sz00
| sdtlseqdt0(sdtasdt0(X55,X54),sdtasdt0(X56,X54)) )
& ( ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ sdtlseqdt0(X55,X56)
| X55 = X56
| X54 = sz00
| sdtasdt0(X55,X54) != sdtasdt0(X56,X54) )
& ( ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ sdtlseqdt0(X55,X56)
| X55 = X56
| X54 = sz00
| sdtlseqdt0(sdtasdt0(X54,X55),sdtasdt0(X54,X56)) )
& ( ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ sdtlseqdt0(X55,X56)
| X55 = X56
| X54 = sz00
| sdtasdt0(X54,X55) != sdtasdt0(X54,X56) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
cnf(c_0_43,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_44,hypothesis,
aNaturalNumber0(xq),
inference(split_conjunct,[status(thm)],[m__1379]) ).
cnf(c_0_45,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xl,X1) != xm
| X1 = xp ),
inference(sr,[status(thm)],[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_32])]),c_0_33]) ).
cnf(c_0_46,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xl,X1) != sdtasdt0(xl,xq)
| X1 = esk2_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_34]),c_0_35]),c_0_32])]),c_0_33]) ).
cnf(c_0_47,negated_conjecture,
( sdtpldt0(xp,X1) != xq
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,plain,
( ~ aNaturalNumber0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_49,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_50,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_51,hypothesis,
sdtlseqdt0(xm,sdtasdt0(xl,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_23]),c_0_40]),c_0_41])]) ).
cnf(c_0_52,hypothesis,
aNaturalNumber0(sdtasdt0(xl,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_23]),c_0_41]),c_0_40])]) ).
cnf(c_0_53,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X2,X3)
| X2 = X3
| X1 = sz00
| sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_54,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,xq)
| sdtlseqdt0(xq,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_55,negated_conjecture,
~ sdtlseqdt0(xp,xq),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_56,hypothesis,
( sdtasdt0(xl,xq) != xm
| esk2_0 = xp ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_34]),c_0_35])]) ).
cnf(c_0_57,hypothesis,
esk2_0 = xq,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_46]),c_0_44])]) ).
cnf(c_0_58,negated_conjecture,
xq != xp,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_31])]) ).
cnf(c_0_59,hypothesis,
( ~ sdtlseqdt0(sdtasdt0(xl,xq),xm)
| sdtasdt0(xl,xq) = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_40]),c_0_52])]) ).
cnf(c_0_60,hypothesis,
( ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,xp)
| sdtlseqdt0(sdtasdt0(xl,X1),xm)
| X1 = xp ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_30]),c_0_31]),c_0_32])]),c_0_33]) ).
cnf(c_0_61,hypothesis,
sdtlseqdt0(xq,xp),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_31]),c_0_55]) ).
cnf(c_0_62,hypothesis,
sdtasdt0(xl,xq) != xm,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_63,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_44])]),c_0_62]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM471+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n010.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 02:33:28 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 1.65/0.66 % Version: 3.5.1
% 1.65/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.65/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.65/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.65/0.66 % Starting new_bool_3 with 300s (1) cores
% 1.65/0.66 % Starting new_bool_1 with 300s (1) cores
% 1.65/0.66 % Starting sh5l with 300s (1) cores
% 1.65/0.66 % new_bool_1 with pid 4047265 completed with status 0
% 1.65/0.66 % Result found by new_bool_1
% 1.65/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.65/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.65/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.65/0.66 % Starting new_bool_3 with 300s (1) cores
% 1.65/0.66 % Starting new_bool_1 with 300s (1) cores
% 1.65/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.65/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.65/0.66 % Search class: FGHSF-FFMM22-SFFFFFNN
% 1.65/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.65/0.66 % Starting SubtermCWHack with 31s (1) cores
% 1.65/0.66 % SubtermCWHack with pid 4047271 completed with status 0
% 1.65/0.66 % Result found by SubtermCWHack
% 1.65/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.65/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.65/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.65/0.66 % Starting new_bool_3 with 300s (1) cores
% 1.65/0.66 % Starting new_bool_1 with 300s (1) cores
% 1.65/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.65/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.65/0.66 % Search class: FGHSF-FFMM22-SFFFFFNN
% 1.65/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.65/0.66 % Starting SubtermCWHack with 31s (1) cores
% 1.65/0.66 % Preprocessing time : 0.002 s
% 1.65/0.66
% 1.65/0.66 % Proof found!
% 1.65/0.66 % SZS status Theorem
% 1.65/0.66 % SZS output start CNFRefutation
% See solution above
% 1.65/0.67 % Parsed axioms : 39
% 1.65/0.67 % Removed by relevancy pruning/SinE : 6
% 1.65/0.67 % Initial clauses : 64
% 1.65/0.67 % Removed in clause preprocessing : 1
% 1.65/0.67 % Initial clauses in saturation : 63
% 1.65/0.67 % Processed clauses : 2365
% 1.65/0.67 % ...of these trivial : 50
% 1.65/0.67 % ...subsumed : 1532
% 1.65/0.67 % ...remaining for further processing : 783
% 1.65/0.67 % Other redundant clauses eliminated : 76
% 1.65/0.67 % Clauses deleted for lack of memory : 0
% 1.65/0.67 % Backward-subsumed : 41
% 1.65/0.67 % Backward-rewritten : 155
% 1.65/0.67 % Generated clauses : 11679
% 1.65/0.67 % ...of the previous two non-redundant : 9867
% 1.65/0.67 % ...aggressively subsumed : 0
% 1.65/0.67 % Contextual simplify-reflections : 76
% 1.65/0.67 % Paramodulations : 11592
% 1.65/0.67 % Factorizations : 0
% 1.65/0.67 % NegExts : 0
% 1.65/0.67 % Equation resolutions : 83
% 1.65/0.67 % Disequality decompositions : 0
% 1.65/0.67 % Total rewrite steps : 12451
% 1.65/0.67 % ...of those cached : 12362
% 1.65/0.67 % Propositional unsat checks : 0
% 1.65/0.67 % Propositional check models : 0
% 1.65/0.67 % Propositional check unsatisfiable : 0
% 1.65/0.67 % Propositional clauses : 0
% 1.65/0.67 % Propositional clauses after purity: 0
% 1.65/0.67 % Propositional unsat core size : 0
% 1.65/0.67 % Propositional preprocessing time : 0.000
% 1.65/0.67 % Propositional encoding time : 0.000
% 1.65/0.67 % Propositional solver time : 0.000
% 1.65/0.67 % Success case prop preproc time : 0.000
% 1.65/0.67 % Success case prop encoding time : 0.000
% 1.65/0.67 % Success case prop solver time : 0.000
% 1.65/0.67 % Current number of processed clauses : 577
% 1.65/0.67 % Positive orientable unit clauses : 85
% 1.65/0.67 % Positive unorientable unit clauses: 0
% 1.65/0.67 % Negative unit clauses : 23
% 1.65/0.67 % Non-unit-clauses : 469
% 1.65/0.67 % Current number of unprocessed clauses: 7311
% 1.65/0.67 % ...number of literals in the above : 38828
% 1.65/0.67 % Current number of archived formulas : 0
% 1.65/0.67 % Current number of archived clauses : 200
% 1.65/0.67 % Clause-clause subsumption calls (NU) : 30870
% 1.65/0.67 % Rec. Clause-clause subsumption calls : 16655
% 1.65/0.67 % Non-unit clause-clause subsumptions : 1513
% 1.65/0.67 % Unit Clause-clause subsumption calls : 1064
% 1.65/0.67 % Rewrite failures with RHS unbound : 0
% 1.65/0.67 % BW rewrite match attempts : 36
% 1.65/0.67 % BW rewrite match successes : 30
% 1.65/0.67 % Condensation attempts : 0
% 1.65/0.67 % Condensation successes : 0
% 1.65/0.67 % Termbank termtop insertions : 205699
% 1.65/0.67 % Search garbage collected termcells : 972
% 1.65/0.67
% 1.65/0.67 % -------------------------------------------------
% 1.65/0.67 % User time : 0.221 s
% 1.65/0.67 % System time : 0.010 s
% 1.65/0.67 % Total time : 0.231 s
% 1.65/0.67 % Maximum resident set size: 3624 pages
% 1.65/0.67
% 1.65/0.67 % -------------------------------------------------
% 1.65/0.67 % User time : 0.224 s
% 1.65/0.67 % System time : 0.014 s
% 1.65/0.67 % Total time : 0.238 s
% 1.65/0.67 % Maximum resident set size: 4608 pages
% 1.65/0.67 % E exiting
%------------------------------------------------------------------------------