%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM461+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 : n013.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:10 PM UTC 2026
% Result : Theorem 21.00s 3.67s
% Output : CNFRefutation 21.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 11 unt; 0 def)
% Number of atoms : 156 ( 44 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 198 ( 87 ~; 78 |; 25 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 25 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))
& sdtpldt0(xl,xm) != sdtpldt0(xn,xm)
& sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
& sdtpldt0(xm,xl) != sdtpldt0(xm,xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( sdtpldt0(X1,X3) = X2
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefLE) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( X3 = sdtmndt0(X2,X1)
<=> ( sdtpldt0(X1,X3) = X2
& aNaturalNumber0(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiff) ).
fof(m__840_03,hypothesis,
( sdtlseqdt0(xl,xn)
& xl != xn ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__840_03) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddComm) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddAsso) ).
fof(m__840,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__840) ).
fof(m__873,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__873) ).
fof(c_0_9,negated_conjecture,
~ ( sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))
& sdtpldt0(xl,xm) != sdtpldt0(xn,xm)
& sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
& sdtpldt0(xm,xl) != sdtpldt0(xm,xn) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,negated_conjecture,
~ ( sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))
& sdtpldt0(xl,xm) != sdtpldt0(xn,xm)
& sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
& sdtpldt0(xm,xl) != sdtpldt0(xm,xn) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X35,X36,X38] :
( ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| sdtlseqdt0(X35,X36)
| sdtpldt0(X35,X38) != X36
| ~ aNaturalNumber0(X38) )
& ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| ~ sdtlseqdt0(X35,X36)
| sdtpldt0(X35,esk1_2(X35,X36)) = X36 )
& ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| ~ sdtlseqdt0(X35,X36)
| aNaturalNumber0(esk1_2(X35,X36)) ) ),
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_12,plain,
! [X5,X6] :
( aNaturalNumber0(sdtpldt0(X5,X6))
| ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_13,plain,
! [X39,X40,X41] :
( ( ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X39)
| ~ sdtlseqdt0(X39,X40)
| X41 = sdtmndt0(X40,X39)
| sdtpldt0(X39,X41) != X40
| ~ aNaturalNumber0(X41) )
& ( ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X39)
| ~ sdtlseqdt0(X39,X40)
| X41 != sdtmndt0(X40,X39)
| sdtpldt0(X39,X41) = X40 )
& ( ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X39)
| ~ sdtlseqdt0(X39,X40)
| X41 != sdtmndt0(X40,X39)
| aNaturalNumber0(X41) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])])]) ).
fof(c_0_14,hypothesis,
( sdtlseqdt0(xl,xn)
& xl != xn ),
inference(fof_simplification,[status(thm)],[m__840_03]) ).
fof(c_0_15,negated_conjecture,
( ~ sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))
| sdtpldt0(xl,xm) = sdtpldt0(xn,xm)
| ~ sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
| sdtpldt0(xm,xl) = sdtpldt0(xm,xn) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
fof(c_0_16,plain,
! [X9,X10] :
( sdtpldt0(X9,X10) = sdtpldt0(X10,X9)
| ~ aNaturalNumber0(X10)
| ~ aNaturalNumber0(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
cnf(c_0_17,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X11,X12,X13] :
( sdtpldt0(sdtpldt0(X11,X12),X13) = sdtpldt0(X11,sdtpldt0(X12,X13))
| ~ aNaturalNumber0(X13)
| ~ aNaturalNumber0(X12)
| ~ aNaturalNumber0(X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])])]) ).
cnf(c_0_20,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X3)
| X2 != sdtmndt0(X3,X1)
| sdtpldt0(X1,X2) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,hypothesis,
( sdtlseqdt0(xl,xn)
& xl != xn ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X3,X2)
| X1 != sdtmndt0(X2,X3)
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( ~ sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))
| ~ sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
| sdtpldt0(xl,xm) = sdtpldt0(xn,xm)
| sdtpldt0(xm,xl) = sdtpldt0(xm,xn) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__840]) ).
cnf(c_0_26,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__873]) ).
cnf(c_0_27,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,sdtpldt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_17]),c_0_18]) ).
cnf(c_0_28,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2)
| sdtpldt0(X1,sdtmndt0(X2,X1)) = X2 ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_30,hypothesis,
sdtlseqdt0(xl,xn),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__840]) ).
cnf(c_0_32,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| aNaturalNumber0(sdtmndt0(X1,X2)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_33,negated_conjecture,
( ~ sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
| ~ sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xm,xn))
| sdtpldt0(xl,xm) = sdtpldt0(xm,xn)
| sdtpldt0(xm,xn) = sdtpldt0(xm,xl) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_34,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| sdtlseqdt0(sdtpldt0(X1,X2),sdtpldt0(X1,sdtpldt0(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]) ).
cnf(c_0_35,hypothesis,
sdtpldt0(xl,sdtmndt0(xn,xl)) = 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_25]),c_0_31])]) ).
cnf(c_0_36,hypothesis,
aNaturalNumber0(sdtmndt0(xn,xl)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_31]),c_0_25])]) ).
cnf(c_0_37,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X3)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X1)
| X1 = sdtmndt0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_38,negated_conjecture,
( ~ sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
| sdtpldt0(xm,xn) = sdtpldt0(xm,xl) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_24]),c_0_26]),c_0_31])]) ).
cnf(c_0_39,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(sdtpldt0(X1,xl),sdtpldt0(X1,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_31])]) ).
cnf(c_0_40,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtmndt0(sdtpldt0(X1,X2),X1) = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_37]),c_0_18]),c_0_27]) ).
cnf(c_0_41,negated_conjecture,
sdtpldt0(xm,xn) = sdtpldt0(xm,xl),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_26])]) ).
cnf(c_0_42,negated_conjecture,
sdtmndt0(sdtpldt0(xm,xl),xm) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_26]),c_0_25])]) ).
cnf(c_0_43,hypothesis,
xl != xn,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_42]),c_0_26]),c_0_31])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM461+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.11/0.53 % Computer : n013.cluster.edu
% 0.11/0.53 % Model : x86_64 x86_64
% 0.11/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.53 % Memory : 8046.5625MB
% 0.11/0.53 % OS : Linux 6.8.0-71-generic
% 0.11/0.53 % CPULimit : 300
% 0.11/0.53 % WCLimit : 300
% 0.11/0.53 % DateTime : Mon Sep 21 02:31:38 UTC 2026
% 0.11/0.54 % CPUTime :
% 0.11/0.54 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.57 Running first-order theorem proving
% 0.14/0.57 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
% 21.00/3.67 % Version: 3.5.1
% 21.00/3.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 21.00/3.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.00/3.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 21.00/3.67 % Starting new_bool_3 with 300s (1) cores
% 21.00/3.67 % Starting new_bool_1 with 300s (1) cores
% 21.00/3.67 % Starting sh5l with 300s (1) cores
% 21.00/3.67 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3954448 completed with status 0
% 21.00/3.67 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 21.00/3.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 21.00/3.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.00/3.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 21.00/3.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 21.00/3.67 % No SInE strategy applied
% 21.00/3.67 % Search class: FGUSF-FFMM22-SFFFFFNN
% 21.00/3.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 21.00/3.67 % Starting SubtermCWHack with 136s (1) cores
% 21.00/3.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 21.00/3.67 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 21.00/3.67 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 21.00/3.67 % Starting new_bool_3 with 136s (1) cores
% 21.00/3.67 % new_bool_3 with pid 3954459 completed with status 0
% 21.00/3.67 % Result found by new_bool_3
% 21.00/3.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 21.00/3.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.00/3.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 21.00/3.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 21.00/3.67 % No SInE strategy applied
% 21.00/3.67 % Search class: FGUSF-FFMM22-SFFFFFNN
% 21.00/3.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 21.00/3.67 % Starting SubtermCWHack with 136s (1) cores
% 21.00/3.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 21.00/3.67 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 21.00/3.67 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 21.00/3.67 % Starting new_bool_3 with 136s (1) cores
% 21.00/3.67 % Preprocessing time : 0.002 s
% 21.00/3.67 % Presaturation interreduction done
% 21.00/3.67
% 21.00/3.67 % Proof found!
% 21.00/3.67 % SZS status Theorem
% 21.00/3.67 % SZS output start CNFRefutation
% See solution above
% 21.00/3.67 % Parsed axioms : 27
% 21.00/3.67 % Removed by relevancy pruning/SinE : 0
% 21.00/3.67 % Initial clauses : 42
% 21.00/3.67 % Removed in clause preprocessing : 1
% 21.00/3.67 % Initial clauses in saturation : 41
% 21.00/3.67 % Processed clauses : 13053
% 21.00/3.67 % ...of these trivial : 411
% 21.00/3.67 % ...subsumed : 10287
% 21.00/3.67 % ...remaining for further processing : 2355
% 21.00/3.67 % Other redundant clauses eliminated : 741
% 21.00/3.67 % Clauses deleted for lack of memory : 0
% 21.00/3.67 % Backward-subsumed : 139
% 21.00/3.67 % Backward-rewritten : 480
% 21.00/3.67 % Generated clauses : 150401
% 21.00/3.67 % ...of the previous two non-redundant : 137103
% 21.00/3.67 % ...aggressively subsumed : 0
% 21.00/3.67 % Contextual simplify-reflections : 527
% 21.00/3.67 % Paramodulations : 149605
% 21.00/3.67 % Factorizations : 20
% 21.00/3.67 % NegExts : 0
% 21.00/3.67 % Equation resolutions : 776
% 21.00/3.67 % Disequality decompositions : 0
% 21.00/3.67 % Total rewrite steps : 165599
% 21.00/3.67 % ...of those cached : 165197
% 21.00/3.67 % Propositional unsat checks : 0
% 21.00/3.67 % Propositional check models : 0
% 21.00/3.67 % Propositional check unsatisfiable : 0
% 21.00/3.67 % Propositional clauses : 0
% 21.00/3.67 % Propositional clauses after purity: 0
% 21.00/3.67 % Propositional unsat core size : 0
% 21.00/3.67 % Propositional preprocessing time : 0.000
% 21.00/3.67 % Propositional encoding time : 0.000
% 21.00/3.67 % Propositional solver time : 0.000
% 21.00/3.67 % Success case prop preproc time : 0.000
% 21.00/3.67 % Success case prop encoding time : 0.000
% 21.00/3.67 % Success case prop solver time : 0.000
% 21.00/3.67 % Current number of processed clauses : 1691
% 21.00/3.67 % Positive orientable unit clauses : 311
% 21.00/3.67 % Positive unorientable unit clauses: 0
% 21.00/3.67 % Negative unit clauses : 167
% 21.00/3.67 % Non-unit-clauses : 1213
% 21.00/3.67 % Current number of unprocessed clauses: 123443
% 21.00/3.67 % ...number of literals in the above : 610760
% 21.00/3.67 % Current number of archived formulas : 0
% 21.00/3.67 % Current number of archived clauses : 659
% 21.00/3.67 % Clause-clause subsumption calls (NU) : 430725
% 21.00/3.67 % Rec. Clause-clause subsumption calls : 216344
% 21.00/3.67 % Non-unit clause-clause subsumptions : 8268
% 21.00/3.67 % Unit Clause-clause subsumption calls : 23380
% 21.00/3.67 % Rewrite failures with RHS unbound : 0
% 21.00/3.67 % BW rewrite match attempts : 863
% 21.00/3.67 % BW rewrite match successes : 110
% 21.00/3.67 % Condensation attempts : 0
% 21.00/3.67 % Condensation successes : 0
% 21.00/3.67 % Termbank termtop insertions : 2914420
% 21.00/3.67 % Search garbage collected termcells : 598
% 21.00/3.67
% 21.00/3.67 % -------------------------------------------------
% 21.00/3.67 % User time : 2.888 s
% 21.00/3.67 % System time : 0.100 s
% 21.00/3.67 % Total time : 2.988 s
% 21.00/3.67 % Maximum resident set size: 3656 pages
% 21.00/3.67
% 21.00/3.67 % -------------------------------------------------
% 21.00/3.67 % User time : 14.494 s
% 21.00/3.67 % System time : 0.558 s
% 21.00/3.67 % Total time : 15.051 s
% 21.00/3.67 % Maximum resident set size: 4864 pages
% 21.00/3.67 % E exiting
%------------------------------------------------------------------------------