%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM479+1 : 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 : n007.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:14 PM UTC 2026
% Result : Theorem 0.59s 0.56s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 47 ( 13 unt; 0 def)
% Number of atoms : 170 ( 44 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 219 ( 96 ~; 87 |; 23 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 34 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulAsso) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefQuot) ).
fof(m__1524_04,hypothesis,
( doDivides0(xl,xm)
& xl != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1524_04) ).
fof(m__1524,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1524) ).
fof(m__1553,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1553) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(mDivTrans,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X2,X3)
& doDivides0(X1,X2) )
=> doDivides0(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivTrans) ).
fof(c_0_10,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_11,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X17,X18,X19] :
( sdtasdt0(sdtasdt0(X17,X18),X19) = sdtasdt0(X17,sdtasdt0(X18,X19))
| ~ aNaturalNumber0(X19)
| ~ aNaturalNumber0(X18)
| ~ aNaturalNumber0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
fof(c_0_13,plain,
! [X15,X16] :
( sdtasdt0(X15,X16) = sdtasdt0(X16,X15)
| ~ aNaturalNumber0(X16)
| ~ aNaturalNumber0(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
fof(c_0_14,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefQuot]) ).
fof(c_0_15,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X67,X68,X69] :
( ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 = sdtsldt0(X68,X67)
| X68 != sdtasdt0(X67,X69)
| ~ aNaturalNumber0(X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| X68 = sdtasdt0(X67,X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| aNaturalNumber0(X69) ) ),
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_19,hypothesis,
( doDivides0(xl,xm)
& xl != sz00 ),
inference(fof_simplification,[status(thm)],[m__1524_04]) ).
cnf(c_0_20,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X2,sdtasdt0(X1,X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1524]) ).
cnf(c_0_23,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1553]) ).
cnf(c_0_24,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2)
| X2 = sz00
| X1 = sdtasdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,hypothesis,
( doDivides0(xl,xm)
& xl != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( ~ aNaturalNumber0(sdtsldt0(xm,xl))
| sdtasdt0(xn,sdtasdt0(xl,sdtsldt0(xm,xl))) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) ),
inference(cn,[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_23])]) ).
cnf(c_0_27,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| X1 = sz00
| sdtasdt0(X1,sdtsldt0(X2,X1)) = X2 ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_28,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1524]) ).
cnf(c_0_30,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( ~ aNaturalNumber0(sdtsldt0(xm,xl))
| sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) != sdtasdt0(xn,xm) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_22]),c_0_29])]),c_0_30]) ).
cnf(c_0_32,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X3,X2)
| X1 != sdtsldt0(X2,X3)
| X3 = sz00
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_33,plain,
! [X63,X64,X66] :
( ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| doDivides0(X63,X64)
| X64 != sdtasdt0(X63,X66)
| ~ aNaturalNumber0(X66) )
& ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| ~ doDivides0(X63,X64)
| X64 = sdtasdt0(X63,esk2_2(X63,X64)) )
& ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| ~ doDivides0(X63,X64)
| aNaturalNumber0(esk2_2(X63,X64)) ) ),
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)],[mDefDiv])])])])])]) ).
fof(c_0_34,plain,
! [X7,X8] :
( aNaturalNumber0(sdtasdt0(X7,X8))
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_35,negated_conjecture,
( ~ aNaturalNumber0(sdtasdt0(xn,xm))
| ~ aNaturalNumber0(sdtsldt0(xm,xl))
| ~ doDivides0(xl,sdtasdt0(xn,xm)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_27]),c_0_22])]),c_0_30]) ).
cnf(c_0_36,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(sdtsldt0(X2,X1))
| X1 = sz00 ),
inference(er,[status(thm)],[c_0_32]) ).
fof(c_0_37,plain,
! [X70,X71,X72] :
( doDivides0(X70,X72)
| ~ doDivides0(X71,X72)
| ~ doDivides0(X70,X71)
| ~ aNaturalNumber0(X72)
| ~ aNaturalNumber0(X71)
| ~ aNaturalNumber0(X70) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivTrans])])]) ).
cnf(c_0_38,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X1)
| doDivides0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( ~ aNaturalNumber0(sdtasdt0(xn,xm))
| ~ doDivides0(xl,sdtasdt0(xn,xm)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_28]),c_0_22]),c_0_29])]),c_0_30]) ).
cnf(c_0_41,plain,
( ~ doDivides0(X2,X3)
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,sdtasdt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( ~ aNaturalNumber0(sdtasdt0(xm,xn))
| ~ doDivides0(xl,sdtasdt0(xm,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_17]),c_0_29]),c_0_23])]) ).
cnf(c_0_44,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2)
| doDivides0(X1,sdtasdt0(X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_39]) ).
cnf(c_0_45,negated_conjecture,
~ aNaturalNumber0(sdtasdt0(xm,xn)),
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_43,c_0_44]),c_0_28]),c_0_29]),c_0_22]),c_0_23])]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_39]),c_0_23]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM479+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 02:31:50 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.59/0.56 % Version: 3.5.1
% 0.59/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.59/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.59/0.56 % Starting sh5l with 300s (1) cores
% 0.59/0.56 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4173115 completed with status 0
% 0.59/0.56 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.59/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.59/0.56 % No SInE strategy applied
% 0.59/0.56 % Search class: FGUSF-FFMM22-MFFFFFNN
% 0.59/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.59/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.59/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.59/0.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.59/0.56 % Starting new_bool_3 with 136s (1) cores
% 0.59/0.56 % Starting new_bool_1 with 136s (1) cores
% 0.59/0.56 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 4173123 completed with status 0
% 0.59/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.59/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.59/0.56 % No SInE strategy applied
% 0.59/0.56 % Search class: FGUSF-FFMM22-MFFFFFNN
% 0.59/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.59/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.59/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.59/0.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.59/0.56 % Preprocessing time : 0.002 s
% 0.59/0.56 % Presaturation interreduction done
% 0.59/0.56
% 0.59/0.56 % Proof found!
% 0.59/0.56 % SZS status Theorem
% 0.59/0.56 % SZS output start CNFRefutation
% See solution above
% 0.59/0.56 % Parsed axioms : 39
% 0.59/0.56 % Removed by relevancy pruning/SinE : 0
% 0.59/0.56 % Initial clauses : 65
% 0.59/0.56 % Removed in clause preprocessing : 3
% 0.59/0.56 % Initial clauses in saturation : 62
% 0.59/0.56 % Processed clauses : 1141
% 0.59/0.56 % ...of these trivial : 5
% 0.59/0.56 % ...subsumed : 717
% 0.59/0.56 % ...remaining for further processing : 419
% 0.59/0.56 % Other redundant clauses eliminated : 56
% 0.59/0.56 % Clauses deleted for lack of memory : 0
% 0.59/0.56 % Backward-subsumed : 28
% 0.59/0.56 % Backward-rewritten : 8
% 0.59/0.56 % Generated clauses : 4489
% 0.59/0.56 % ...of the previous two non-redundant : 3842
% 0.59/0.56 % ...aggressively subsumed : 0
% 0.59/0.56 % Contextual simplify-reflections : 32
% 0.59/0.56 % Paramodulations : 4427
% 0.59/0.56 % Factorizations : 0
% 0.59/0.56 % NegExts : 0
% 0.59/0.56 % Equation resolutions : 62
% 0.59/0.56 % Disequality decompositions : 0
% 0.59/0.56 % Total rewrite steps : 4131
% 0.59/0.56 % ...of those cached : 4103
% 0.59/0.56 % Propositional unsat checks : 0
% 0.59/0.56 % Propositional check models : 0
% 0.59/0.56 % Propositional check unsatisfiable : 0
% 0.59/0.56 % Propositional clauses : 0
% 0.59/0.56 % Propositional clauses after purity: 0
% 0.59/0.56 % Propositional unsat core size : 0
% 0.59/0.56 % Propositional preprocessing time : 0.000
% 0.59/0.56 % Propositional encoding time : 0.000
% 0.59/0.56 % Propositional solver time : 0.000
% 0.59/0.56 % Success case prop preproc time : 0.000
% 0.59/0.56 % Success case prop encoding time : 0.000
% 0.59/0.56 % Success case prop solver time : 0.000
% 0.59/0.56 % Current number of processed clauses : 317
% 0.59/0.56 % Positive orientable unit clauses : 29
% 0.59/0.56 % Positive unorientable unit clauses: 0
% 0.59/0.56 % Negative unit clauses : 7
% 0.59/0.56 % Non-unit-clauses : 281
% 0.59/0.56 % Current number of unprocessed clauses: 2785
% 0.59/0.56 % ...number of literals in the above : 15234
% 0.59/0.56 % Current number of archived formulas : 0
% 0.59/0.56 % Current number of archived clauses : 93
% 0.59/0.56 % Clause-clause subsumption calls (NU) : 13821
% 0.59/0.56 % Rec. Clause-clause subsumption calls : 5130
% 0.59/0.56 % Non-unit clause-clause subsumptions : 691
% 0.59/0.56 % Unit Clause-clause subsumption calls : 411
% 0.59/0.56 % Rewrite failures with RHS unbound : 0
% 0.59/0.56 % BW rewrite match attempts : 8
% 0.59/0.56 % BW rewrite match successes : 8
% 0.59/0.56 % Condensation attempts : 0
% 0.59/0.56 % Condensation successes : 0
% 0.59/0.56 % Termbank termtop insertions : 82624
% 0.59/0.56 % Search garbage collected termcells : 1099
% 0.59/0.56
% 0.59/0.56 % -------------------------------------------------
% 0.59/0.56 % User time : 0.115 s
% 0.59/0.56 % System time : 0.012 s
% 0.59/0.56 % Total time : 0.127 s
% 0.59/0.56 % Maximum resident set size: 3672 pages
% 0.59/0.56
% 0.59/0.56 % -------------------------------------------------
% 0.59/0.56 % User time : 0.538 s
% 0.59/0.56 % System time : 0.046 s
% 0.59/0.56 % Total time : 0.584 s
% 0.59/0.56 % Maximum resident set size: 4864 pages
% 0.59/0.56 % E exiting
%------------------------------------------------------------------------------