%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM473+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:13 PM UTC 2026
% Result : Theorem 0.16s 10.67s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 56 ( 22 unt; 0 def)
% Number of atoms : 202 ( 71 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 233 ( 87 ~; 85 |; 43 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 35 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mLETotal,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLETotal) ).
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/sandbox/benchmark/theBenchmark.p',mMonMul) ).
fof(m__1347,hypothesis,
xl != sz00,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1347) ).
fof(m__,conjecture,
( sdtlseqdt0(xp,xq)
| ? [X1] :
( sdtpldt0(xp,X1) = xq
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
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/sandbox/benchmark/theBenchmark.p',mMulCanc) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(m__1409,hypothesis,
( sdtlseqdt0(xm,sdtpldt0(xm,xn))
& ? [X1] :
( sdtpldt0(xm,X1) = sdtpldt0(xm,xn)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1409) ).
fof(m__1379,hypothesis,
( xq = sdtsldt0(sdtpldt0(xm,xn),xl)
& sdtpldt0(xm,xn) = sdtasdt0(xl,xq)
& aNaturalNumber0(xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1379) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',mLEAsym) ).
fof(m__1324,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324) ).
fof(m__1360,hypothesis,
( xp = sdtsldt0(xm,xl)
& xm = sdtasdt0(xl,xp)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1360) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(c_0_13,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mLETotal]) ).
fof(c_0_14,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_15,hypothesis,
xl != sz00,
inference(fof_simplification,[status(thm)],[m__1347]) ).
fof(c_0_16,plain,
! [X69,X70] :
( ( ~ aNaturalNumber0(X70)
| ~ aNaturalNumber0(X69)
| sdtlseqdt0(X69,X70)
| sdtlseqdt0(X70,X69) )
& ( ~ aNaturalNumber0(X70)
| ~ aNaturalNumber0(X69)
| sdtlseqdt0(X69,X70)
| X70 != X69 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_17,negated_conjecture,
~ ( sdtlseqdt0(xp,xq)
| ? [X1] :
( sdtpldt0(xp,X1) = xq
& aNaturalNumber0(X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_18,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_19,plain,
! [X19,X20] :
( aNaturalNumber0(sdtpldt0(X19,X20))
| ~ aNaturalNumber0(X20)
| ~ aNaturalNumber0(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_20,hypothesis,
( sdtlseqdt0(xm,sdtpldt0(xm,xn))
& sdtpldt0(xm,esk3_0) = sdtpldt0(xm,xn)
& aNaturalNumber0(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1409])]) ).
fof(c_0_21,plain,
! [X55,X56,X57] :
( ( ~ aNaturalNumber0(X57)
| ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X55)
| ~ sdtlseqdt0(X56,X57)
| X56 = X57
| X55 = sz00
| sdtlseqdt0(sdtasdt0(X56,X55),sdtasdt0(X57,X55)) )
& ( ~ aNaturalNumber0(X57)
| ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X55)
| ~ sdtlseqdt0(X56,X57)
| X56 = X57
| X55 = sz00
| sdtasdt0(X56,X55) != sdtasdt0(X57,X55) )
& ( ~ aNaturalNumber0(X57)
| ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X55)
| ~ sdtlseqdt0(X56,X57)
| X56 = X57
| X55 = sz00
| sdtlseqdt0(sdtasdt0(X55,X56),sdtasdt0(X55,X57)) )
& ( ~ aNaturalNumber0(X57)
| ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X55)
| ~ sdtlseqdt0(X56,X57)
| X56 = X57
| X55 = sz00
| sdtasdt0(X55,X56) != sdtasdt0(X55,X57) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_22,hypothesis,
xl != sz00,
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(xq),
inference(split_conjunct,[status(thm)],[m__1379]) ).
fof(c_0_25,negated_conjecture,
! [X7] :
( ~ sdtlseqdt0(xp,xq)
& ( sdtpldt0(xp,X7) != xq
| ~ aNaturalNumber0(X7) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
fof(c_0_26,plain,
! [X26] :
( ( ~ aNaturalNumber0(X26)
| X26 = sdtpldt0(sz00,X26) )
& ( ~ aNaturalNumber0(X26)
| sdtpldt0(X26,sz00) = X26 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])])]) ).
fof(c_0_27,plain,
! [X50,X51,X52] :
( ( ~ aNaturalNumber0(X50)
| X50 = sz00
| ~ aNaturalNumber0(X52)
| ~ aNaturalNumber0(X51)
| X51 = X52
| sdtasdt0(X51,X50) != sdtasdt0(X52,X50) )
& ( ~ aNaturalNumber0(X50)
| X50 = sz00
| ~ aNaturalNumber0(X52)
| ~ aNaturalNumber0(X51)
| X51 = X52
| sdtasdt0(X50,X51) != sdtasdt0(X50,X52) ) ),
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_18])])])])]) ).
fof(c_0_28,plain,
! [X64,X65] :
( X64 = X65
| ~ sdtlseqdt0(X65,X64)
| ~ sdtlseqdt0(X64,X65)
| ~ aNaturalNumber0(X65)
| ~ aNaturalNumber0(X64) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEAsym])])]) ).
cnf(c_0_29,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,hypothesis,
sdtpldt0(xm,esk3_0) = sdtpldt0(xm,xn),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,hypothesis,
aNaturalNumber0(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_33,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_21]) ).
cnf(c_0_34,hypothesis,
xm = sdtasdt0(xl,xp),
inference(split_conjunct,[status(thm)],[m__1360]) ).
cnf(c_0_35,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1360]) ).
cnf(c_0_36,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_37,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_38,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,xq)
| sdtlseqdt0(xq,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_39,negated_conjecture,
~ sdtlseqdt0(xp,xq),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_40,negated_conjecture,
( sdtpldt0(xp,X1) != xq
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_41,plain,
( ~ aNaturalNumber0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_42,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_43,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
| X1 = sz00
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_44,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_45,hypothesis,
sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_46,hypothesis,
aNaturalNumber0(sdtpldt0(xm,xn)),
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])]) ).
cnf(c_0_47,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_33,c_0_34]),c_0_35]),c_0_36])]),c_0_37]) ).
cnf(c_0_48,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
inference(split_conjunct,[status(thm)],[m__1379]) ).
cnf(c_0_49,hypothesis,
sdtlseqdt0(xq,xp),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_35]),c_0_39]) ).
cnf(c_0_50,negated_conjecture,
xq != xp,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_35])]) ).
cnf(c_0_51,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_43,c_0_34]),c_0_35]),c_0_36])]),c_0_37]) ).
cnf(c_0_52,hypothesis,
( ~ sdtlseqdt0(sdtpldt0(xm,xn),xm)
| sdtpldt0(xm,xn) = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_32]),c_0_46])]) ).
cnf(c_0_53,hypothesis,
sdtlseqdt0(sdtpldt0(xm,xn),xm),
inference(sr,[status(thm)],[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_24])]),c_0_50]) ).
cnf(c_0_54,hypothesis,
sdtpldt0(xm,xn) != xm,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_48]),c_0_24])]),c_0_50]) ).
cnf(c_0_55,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM473+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/10.38 % Computer : n010.cluster.edu
% 0.11/10.38 % Model : x86_64 x86_64
% 0.11/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38 % Memory : 8046.5625MB
% 0.11/10.38 % OS : Linux 6.8.0-71-generic
% 0.11/10.38 % CPULimit : 300
% 0.11/10.38 % WCLimit : 300
% 0.11/10.38 % DateTime : Mon Sep 21 02:33:50 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/10.43 Running first-order theorem proving
% 0.16/10.43 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/benchmark/theBenchmark.p
% 0.16/10.67 % Version: 3.5.1
% 0.16/10.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/10.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/10.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/10.67 % Starting new_bool_3 with 300s (1) cores
% 0.16/10.67 % Starting new_bool_1 with 300s (1) cores
% 0.16/10.67 % Starting sh5l with 300s (1) cores
% 0.16/10.67 % new_bool_3 with pid 4048182 completed with status 0
% 0.16/10.67 % Result found by new_bool_3
% 0.16/10.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/10.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/10.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/10.67 % Starting new_bool_3 with 300s (1) cores
% 0.16/10.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/10.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/10.67 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.16/10.67 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/10.67 % Starting SubtermCWHack with 31s (1) cores
% 0.16/10.67 % SubtermCWHack with pid 4048187 completed with status 0
% 0.16/10.67 % Result found by SubtermCWHack
% 0.16/10.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/10.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/10.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/10.67 % Starting new_bool_3 with 300s (1) cores
% 0.16/10.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/10.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/10.67 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.16/10.67 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/10.67 % Starting SubtermCWHack with 31s (1) cores
% 0.16/10.67 % Preprocessing time : 0.002 s
% 0.16/10.67
% 0.16/10.67 % Proof found!
% 0.16/10.67 % SZS status Theorem
% 0.16/10.67 % SZS output start CNFRefutation
% See solution above
% 0.16/10.67 % Parsed axioms : 40
% 0.16/10.67 % Removed by relevancy pruning/SinE : 6
% 0.16/10.67 % Initial clauses : 67
% 0.16/10.67 % Removed in clause preprocessing : 1
% 0.16/10.67 % Initial clauses in saturation : 66
% 0.16/10.67 % Processed clauses : 2333
% 0.16/10.67 % ...of these trivial : 49
% 0.16/10.67 % ...subsumed : 1447
% 0.16/10.67 % ...remaining for further processing : 837
% 0.16/10.67 % Other redundant clauses eliminated : 72
% 0.16/10.67 % Clauses deleted for lack of memory : 0
% 0.16/10.67 % Backward-subsumed : 61
% 0.16/10.67 % Backward-rewritten : 228
% 0.16/10.67 % Generated clauses : 11305
% 0.16/10.67 % ...of the previous two non-redundant : 9630
% 0.16/10.67 % ...aggressively subsumed : 0
% 0.16/10.67 % Contextual simplify-reflections : 70
% 0.16/10.67 % Paramodulations : 11225
% 0.16/10.67 % Factorizations : 0
% 0.16/10.67 % NegExts : 0
% 0.16/10.67 % Equation resolutions : 79
% 0.16/10.67 % Disequality decompositions : 0
% 0.16/10.67 % Total rewrite steps : 12745
% 0.16/10.67 % ...of those cached : 12640
% 0.16/10.67 % Propositional unsat checks : 0
% 0.16/10.67 % Propositional check models : 0
% 0.16/10.67 % Propositional check unsatisfiable : 0
% 0.16/10.67 % Propositional clauses : 0
% 0.16/10.67 % Propositional clauses after purity: 0
% 0.16/10.67 % Propositional unsat core size : 0
% 0.16/10.67 % Propositional preprocessing time : 0.000
% 0.16/10.67 % Propositional encoding time : 0.000
% 0.16/10.67 % Propositional solver time : 0.000
% 0.16/10.67 % Success case prop preproc time : 0.000
% 0.16/10.67 % Success case prop encoding time : 0.000
% 0.16/10.67 % Success case prop solver time : 0.000
% 0.16/10.67 % Current number of processed clauses : 541
% 0.16/10.67 % Positive orientable unit clauses : 106
% 0.16/10.67 % Positive unorientable unit clauses: 0
% 0.16/10.67 % Negative unit clauses : 16
% 0.16/10.67 % Non-unit-clauses : 419
% 0.16/10.67 % Current number of unprocessed clauses: 7058
% 0.16/10.67 % ...number of literals in the above : 36870
% 0.16/10.67 % Current number of archived formulas : 0
% 0.16/10.67 % Current number of archived clauses : 290
% 0.16/10.67 % Clause-clause subsumption calls (NU) : 33197
% 0.16/10.67 % Rec. Clause-clause subsumption calls : 17664
% 0.16/10.67 % Non-unit clause-clause subsumptions : 1452
% 0.16/10.67 % Unit Clause-clause subsumption calls : 1213
% 0.16/10.67 % Rewrite failures with RHS unbound : 0
% 0.16/10.67 % BW rewrite match attempts : 70
% 0.16/10.67 % BW rewrite match successes : 28
% 0.16/10.67 % Condensation attempts : 0
% 0.16/10.67 % Condensation successes : 0
% 0.16/10.67 % Termbank termtop insertions : 195772
% 0.16/10.67 % Search garbage collected termcells : 970
% 0.16/10.67
% 0.16/10.67 % -------------------------------------------------
% 0.16/10.67 % User time : 0.213 s
% 0.16/10.67 % System time : 0.010 s
% 0.16/10.67 % Total time : 0.223 s
% 0.16/10.67 % Maximum resident set size: 3676 pages
% 0.16/10.67
% 0.16/10.67 % -------------------------------------------------
% 0.16/10.67 % User time : 0.216 s
% 0.16/10.67 % System time : 0.014 s
% 0.16/10.67 % Total time : 0.230 s
% 0.16/10.67 % Maximum resident set size: 4608 pages
% 0.16/10.67 % E exiting
%------------------------------------------------------------------------------