TSTP Solution File: KLE145-10 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE145-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:05:16 EDT 2023
% Result : Unsatisfiable 2.60s 0.76s
% Output : CNFRefutation 2.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 22
% Syntax : Number of clauses : 74 ( 74 unt; 0 nHn; 4 RR)
% Number of literals : 74 ( 73 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-4 aty)
% Number of variables : 128 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(additive_associativity,axiom,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',additive_associativity) ).
cnf(idempotence,axiom,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',idempotence) ).
cnf(order,axiom,
ifeq3(addition(X1,X2),X2,leq(X1,X2),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',order) ).
cnf(ifeq_axiom,axiom,
ifeq3(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',ifeq_axiom) ).
cnf(additive_commutativity,axiom,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',additive_commutativity) ).
cnf(infty_unfold1,axiom,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',infty_unfold1) ).
cnf(star_induction1,axiom,
ifeq(leq(addition(multiplication(X1,X2),X3),X2),true,leq(multiplication(star(X1),X3),X2),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',star_induction1) ).
cnf(order_1,axiom,
ifeq2(leq(X1,X2),true,addition(X1,X2),X2) = X2,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',order_1) ).
cnf(ifeq_axiom_001,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',ifeq_axiom_001) ).
cnf(star_unfold2,axiom,
addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',star_unfold2) ).
cnf(ifeq_axiom_002,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',ifeq_axiom_002) ).
cnf(distributivity2,axiom,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',distributivity2) ).
cnf(multiplicative_left_identity,axiom,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',multiplicative_left_identity) ).
cnf(distributivity1,axiom,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',distributivity1) ).
cnf(multiplicative_right_identity,axiom,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',multiplicative_right_identity) ).
cnf(star_unfold1,axiom,
addition(one,multiplication(X1,star(X1))) = star(X1),
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',star_unfold1) ).
cnf(left_annihilation,axiom,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',left_annihilation) ).
cnf(additive_identity,axiom,
addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',additive_identity) ).
cnf(isolation,axiom,
strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',isolation) ).
cnf(multiplicative_associativity,axiom,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',multiplicative_associativity) ).
cnf(star_induction2,axiom,
ifeq(leq(addition(multiplication(X1,X2),X3),X1),true,leq(multiplication(X3,star(X2)),X1),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',star_induction2) ).
cnf(goals,negated_conjecture,
star(strong_iteration(sK1_goals_X0)) != strong_iteration(sK1_goals_X0),
file('/export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p',goals) ).
cnf(c_0_22,axiom,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
additive_associativity ).
cnf(c_0_23,axiom,
addition(X1,X1) = X1,
idempotence ).
cnf(c_0_24,axiom,
ifeq3(addition(X1,X2),X2,leq(X1,X2),true) = true,
order ).
cnf(c_0_25,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,axiom,
ifeq3(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_27,plain,
leq(X1,addition(X1,X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_28,axiom,
addition(X1,X2) = addition(X2,X1),
additive_commutativity ).
cnf(c_0_29,axiom,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
infty_unfold1 ).
cnf(c_0_30,plain,
leq(X1,addition(X2,X1)) = true,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_32,axiom,
ifeq(leq(addition(multiplication(X1,X2),X3),X2),true,leq(multiplication(star(X1),X3),X2),true) = true,
star_induction1 ).
cnf(c_0_33,axiom,
ifeq2(leq(X1,X2),true,addition(X1,X2),X2) = X2,
order_1 ).
cnf(c_0_34,plain,
leq(multiplication(X1,strong_iteration(X1)),strong_iteration(X1)) = true,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_36,axiom,
addition(one,multiplication(star(X1),X1)) = star(X1),
star_unfold2 ).
cnf(c_0_37,plain,
ifeq(leq(addition(X1,multiplication(X2,X3)),X3),true,leq(multiplication(star(X2),X1),X3),true) = true,
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_38,plain,
addition(strong_iteration(X1),multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_28]) ).
cnf(c_0_39,plain,
leq(X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_26]) ).
cnf(c_0_40,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_002 ).
cnf(c_0_41,axiom,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
distributivity2 ).
cnf(c_0_42,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_25,c_0_36]) ).
cnf(c_0_43,axiom,
multiplication(one,X1) = X1,
multiplicative_left_identity ).
cnf(c_0_44,axiom,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
distributivity1 ).
cnf(c_0_45,axiom,
multiplication(X1,one) = X1,
multiplicative_right_identity ).
cnf(c_0_46,axiom,
addition(one,multiplication(X1,star(X1))) = star(X1),
star_unfold1 ).
cnf(c_0_47,axiom,
multiplication(zero,X1) = zero,
left_annihilation ).
cnf(c_0_48,axiom,
addition(X1,zero) = X1,
additive_identity ).
cnf(c_0_49,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_50,axiom,
strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
isolation ).
cnf(c_0_51,axiom,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
multiplicative_associativity ).
cnf(c_0_52,plain,
ifeq2(leq(X1,X2),true,addition(X2,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_53,plain,
leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]) ).
cnf(c_0_54,plain,
addition(X1,multiplication(star(X2),X1)) = multiplication(star(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_55,plain,
addition(X1,multiplication(X1,multiplication(star(X2),X2))) = multiplication(X1,star(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_45]) ).
cnf(c_0_56,plain,
star(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_57,plain,
leq(X1,addition(X2,addition(X1,X3))) = true,
inference(spm,[status(thm)],[c_0_27,c_0_49]) ).
cnf(c_0_58,plain,
leq(multiplication(star(X1),X1),star(X1)) = true,
inference(spm,[status(thm)],[c_0_30,c_0_36]) ).
cnf(c_0_59,axiom,
ifeq(leq(addition(multiplication(X1,X2),X3),X1),true,leq(multiplication(X3,star(X2)),X1),true) = true,
star_induction2 ).
cnf(c_0_60,plain,
addition(multiplication(strong_iteration(X1),zero),multiplication(star(X1),X2)) = multiplication(strong_iteration(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_50]),c_0_51]),c_0_47]),c_0_28]) ).
cnf(c_0_61,plain,
multiplication(star(X1),strong_iteration(X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_35]) ).
cnf(c_0_62,plain,
addition(X1,multiplication(X1,zero)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_43]),c_0_45]) ).
cnf(c_0_63,plain,
leq(X1,addition(X2,multiplication(star(X3),X1))) = true,
inference(spm,[status(thm)],[c_0_57,c_0_54]) ).
cnf(c_0_64,plain,
addition(star(X1),multiplication(star(X1),X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_58]),c_0_35]),c_0_28]) ).
cnf(c_0_65,plain,
ifeq(leq(addition(one,multiplication(X1,X2)),X1),true,leq(star(X2),X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_43]),c_0_28]) ).
cnf(c_0_66,plain,
multiplication(strong_iteration(X1),strong_iteration(X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_28]),c_0_62]) ).
cnf(c_0_67,plain,
addition(one,strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_68,plain,
leq(X1,star(X1)) = true,
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,plain,
leq(star(strong_iteration(X1)),strong_iteration(X1)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_39]),c_0_40]) ).
cnf(c_0_70,plain,
addition(X1,star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_68]),c_0_35]) ).
cnf(c_0_71,negated_conjecture,
star(strong_iteration(sK1_goals_X0)) != strong_iteration(sK1_goals_X0),
goals ).
cnf(c_0_72,plain,
star(strong_iteration(X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_69]),c_0_70]),c_0_35]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KLE145-10 : TPTP v8.1.2. Released v7.3.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 04:44:09 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.m1ZVW0hXt5/E---3.1_3431.p
% 2.60/0.76 # Version: 3.1pre001
% 2.60/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.60/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.60/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.60/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.60/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.60/0.76 # Starting sh5l with 300s (1) cores
% 2.60/0.76 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3508 completed with status 0
% 2.60/0.76 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.60/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.60/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.60/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.60/0.76 # No SInE strategy applied
% 2.60/0.76 # Search class: FUUPM-FFMF32-MFFFFFNN
% 2.60/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.60/0.76 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 583s (1) cores
% 2.60/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.60/0.76 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 2.60/0.76 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 2.60/0.76 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 2.60/0.76 # G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with pid 3517 completed with status 0
% 2.60/0.76 # Result found by G-E--_208_B02_F1_AE_CS_SP_PS_S0Y
% 2.60/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.60/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.60/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.60/0.76 # No SInE strategy applied
% 2.60/0.76 # Search class: FUUPM-FFMF32-MFFFFFNN
% 2.60/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.60/0.76 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 583s (1) cores
% 2.60/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.60/0.76 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 2.60/0.76 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 2.60/0.76 # Preprocessing time : 0.001 s
% 2.60/0.76 # Presaturation interreduction done
% 2.60/0.76
% 2.60/0.76 # Proof found!
% 2.60/0.76 # SZS status Unsatisfiable
% 2.60/0.76 # SZS output start CNFRefutation
% See solution above
% 2.60/0.76 # Parsed axioms : 23
% 2.60/0.76 # Removed by relevancy pruning/SinE : 0
% 2.60/0.76 # Initial clauses : 23
% 2.60/0.76 # Removed in clause preprocessing : 0
% 2.60/0.76 # Initial clauses in saturation : 23
% 2.60/0.76 # Processed clauses : 1130
% 2.60/0.76 # ...of these trivial : 543
% 2.60/0.76 # ...subsumed : 33
% 2.60/0.76 # ...remaining for further processing : 554
% 2.60/0.76 # Other redundant clauses eliminated : 0
% 2.60/0.76 # Clauses deleted for lack of memory : 0
% 2.60/0.76 # Backward-subsumed : 0
% 2.60/0.76 # Backward-rewritten : 160
% 2.60/0.76 # Generated clauses : 26852
% 2.60/0.76 # ...of the previous two non-redundant : 12675
% 2.60/0.76 # ...aggressively subsumed : 0
% 2.60/0.76 # Contextual simplify-reflections : 0
% 2.60/0.76 # Paramodulations : 26852
% 2.60/0.76 # Factorizations : 0
% 2.60/0.76 # NegExts : 0
% 2.60/0.76 # Equation resolutions : 0
% 2.60/0.76 # Total rewrite steps : 64239
% 2.60/0.76 # Propositional unsat checks : 0
% 2.60/0.76 # Propositional check models : 0
% 2.60/0.76 # Propositional check unsatisfiable : 0
% 2.60/0.76 # Propositional clauses : 0
% 2.60/0.76 # Propositional clauses after purity: 0
% 2.60/0.76 # Propositional unsat core size : 0
% 2.60/0.76 # Propositional preprocessing time : 0.000
% 2.60/0.76 # Propositional encoding time : 0.000
% 2.60/0.76 # Propositional solver time : 0.000
% 2.60/0.76 # Success case prop preproc time : 0.000
% 2.60/0.76 # Success case prop encoding time : 0.000
% 2.60/0.76 # Success case prop solver time : 0.000
% 2.60/0.76 # Current number of processed clauses : 371
% 2.60/0.76 # Positive orientable unit clauses : 368
% 2.60/0.76 # Positive unorientable unit clauses: 3
% 2.60/0.76 # Negative unit clauses : 0
% 2.60/0.76 # Non-unit-clauses : 0
% 2.60/0.76 # Current number of unprocessed clauses: 11437
% 2.60/0.76 # ...number of literals in the above : 11437
% 2.60/0.76 # Current number of archived formulas : 0
% 2.60/0.76 # Current number of archived clauses : 183
% 2.60/0.76 # Clause-clause subsumption calls (NU) : 0
% 2.60/0.76 # Rec. Clause-clause subsumption calls : 0
% 2.60/0.76 # Non-unit clause-clause subsumptions : 0
% 2.60/0.76 # Unit Clause-clause subsumption calls : 3
% 2.60/0.76 # Rewrite failures with RHS unbound : 0
% 2.60/0.76 # BW rewrite match attempts : 3270
% 2.60/0.76 # BW rewrite match successes : 129
% 2.60/0.76 # Condensation attempts : 0
% 2.60/0.76 # Condensation successes : 0
% 2.60/0.76 # Termbank termtop insertions : 428357
% 2.60/0.76
% 2.60/0.76 # -------------------------------------------------
% 2.60/0.76 # User time : 0.268 s
% 2.60/0.76 # System time : 0.013 s
% 2.60/0.76 # Total time : 0.280 s
% 2.60/0.76 # Maximum resident set size: 1560 pages
% 2.60/0.76
% 2.60/0.76 # -------------------------------------------------
% 2.60/0.76 # User time : 1.428 s
% 2.60/0.76 # System time : 0.074 s
% 2.60/0.76 # Total time : 1.501 s
% 2.60/0.76 # Maximum resident set size: 1684 pages
% 2.60/0.76 % E---3.1 exiting
%------------------------------------------------------------------------------