TSTP Solution File: LAT005-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT005-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:07:19 EDT 2023
% Result : Unsatisfiable 2.58s 0.82s
% Output : CNFRefutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of clauses : 84 ( 51 unt; 0 nHn; 78 RR)
% Number of literals : 149 ( 0 equ; 67 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 11 con; 0-0 aty)
% Number of variables : 113 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_of_meet,axiom,
( meet(X2,X1,X3)
| ~ meet(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',commutativity_of_meet) ).
cnf(meet_r2_and_a,negated_conjecture,
meet(r2,a,d),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',meet_r2_and_a) ).
cnf(associativity_of_join2,axiom,
( join(X1,X5,X6)
| ~ join(X1,X2,X3)
| ~ join(X2,X4,X5)
| ~ join(X3,X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',associativity_of_join2) ).
cnf(join_a_and_b,negated_conjecture,
join(a,b,c2),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',join_a_and_b) ).
cnf(absorbtion1,axiom,
( join(X1,X3,X1)
| ~ meet(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',absorbtion1) ).
cnf(commutativity_of_join,axiom,
( join(X2,X1,X3)
| ~ join(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',commutativity_of_join) ).
cnf(associativity_of_meet1,axiom,
( meet(X3,X4,X6)
| ~ meet(X1,X2,X3)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',associativity_of_meet1) ).
cnf(meet_a_and_b,negated_conjecture,
meet(a,b,c),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',meet_a_and_b) ).
cnf(meet_c_and_r2,negated_conjecture,
meet(c,r2,n0),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',meet_c_and_r2) ).
cnf(modularity4,axiom,
( meet(X1,X4,X6)
| ~ meet(X1,X2,X2)
| ~ join(X3,X2,X4)
| ~ meet(X1,X3,X5)
| ~ join(X2,X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',modularity4) ).
cnf(join_r1_and_d,negated_conjecture,
join(r1,d,b2),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',join_r1_and_d) ).
cnf(join_0_and_x,axiom,
join(n0,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',join_0_and_x) ).
cnf(absorbtion2,axiom,
( meet(X1,X3,X1)
| ~ join(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',absorbtion2) ).
cnf(meet_r2_and_b,negated_conjecture,
meet(r2,b,e),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',meet_r2_and_b) ).
cnf(associativity_of_meet2,axiom,
( meet(X1,X5,X6)
| ~ meet(X1,X2,X3)
| ~ meet(X2,X4,X5)
| ~ meet(X3,X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',associativity_of_meet2) ).
cnf(meet_c2_and_r1,negated_conjecture,
meet(c2,r1,n0),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',meet_c2_and_r1) ).
cnf(meet_0_and_x,axiom,
meet(n0,X1,n0),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',meet_0_and_x) ).
cnf(join_r1_and_e,negated_conjecture,
join(r1,e,a2),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',join_r1_and_e) ).
cnf(meet_a2_and_b2,negated_conjecture,
~ meet(a2,b2,r1),
file('/export/starexec/sandbox2/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p',meet_a2_and_b2) ).
cnf(c_0_19,axiom,
( meet(X2,X1,X3)
| ~ meet(X1,X2,X3) ),
commutativity_of_meet ).
cnf(c_0_20,negated_conjecture,
meet(r2,a,d),
meet_r2_and_a ).
cnf(c_0_21,axiom,
( join(X1,X5,X6)
| ~ join(X1,X2,X3)
| ~ join(X2,X4,X5)
| ~ join(X3,X4,X6) ),
associativity_of_join2 ).
cnf(c_0_22,negated_conjecture,
join(a,b,c2),
join_a_and_b ).
cnf(c_0_23,axiom,
( join(X1,X3,X1)
| ~ meet(X1,X2,X3) ),
absorbtion1 ).
cnf(c_0_24,negated_conjecture,
meet(a,r2,d),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( join(X1,X2,c2)
| ~ join(X3,b,X2)
| ~ join(X1,X3,a) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
( join(X2,X1,X3)
| ~ join(X1,X2,X3) ),
commutativity_of_join ).
cnf(c_0_27,negated_conjecture,
join(a,d,a),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,axiom,
( meet(X3,X4,X6)
| ~ meet(X1,X2,X3)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X5,X6) ),
associativity_of_meet1 ).
cnf(c_0_29,negated_conjecture,
meet(a,b,c),
meet_a_and_b ).
cnf(c_0_30,negated_conjecture,
meet(c,r2,n0),
meet_c_and_r2 ).
cnf(c_0_31,negated_conjecture,
( join(X1,c2,c2)
| ~ join(X1,a,a) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_32,negated_conjecture,
join(d,a,a),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( meet(X1,b,X2)
| ~ meet(X3,c,X2)
| ~ meet(X3,a,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
meet(r2,c,n0),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_35,axiom,
( meet(X1,X4,X6)
| ~ meet(X1,X2,X2)
| ~ join(X3,X2,X4)
| ~ meet(X1,X3,X5)
| ~ join(X2,X5,X6) ),
modularity4 ).
cnf(c_0_36,negated_conjecture,
join(r1,d,b2),
join_r1_and_d ).
cnf(c_0_37,axiom,
join(n0,X1,X1),
join_0_and_x ).
cnf(c_0_38,axiom,
( meet(X1,X3,X1)
| ~ join(X1,X2,X3) ),
absorbtion2 ).
cnf(c_0_39,negated_conjecture,
join(d,c2,c2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
meet(r2,b,e),
meet_r2_and_b ).
cnf(c_0_41,negated_conjecture,
( meet(X1,b,n0)
| ~ meet(r2,a,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
join(b,a,c2),
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_43,negated_conjecture,
( meet(X1,b2,X2)
| ~ meet(X1,d,d)
| ~ meet(X1,r1,X3)
| ~ join(d,X3,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,plain,
join(X1,n0,X1),
inference(spm,[status(thm)],[c_0_26,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
meet(d,c2,d),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
meet(b,r2,e),
inference(spm,[status(thm)],[c_0_19,c_0_40]) ).
cnf(c_0_47,axiom,
( meet(X1,X5,X6)
| ~ meet(X1,X2,X3)
| ~ meet(X2,X4,X5)
| ~ meet(X3,X4,X6) ),
associativity_of_meet2 ).
cnf(c_0_48,negated_conjecture,
meet(d,b,n0),
inference(spm,[status(thm)],[c_0_41,c_0_20]) ).
cnf(c_0_49,negated_conjecture,
meet(b,c2,b),
inference(spm,[status(thm)],[c_0_38,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( meet(X1,b2,d)
| ~ meet(X1,d,d)
| ~ meet(X1,r1,n0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
meet(c2,d,d),
inference(spm,[status(thm)],[c_0_19,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
meet(c2,r1,n0),
meet_c2_and_r1 ).
cnf(c_0_53,negated_conjecture,
join(b,e,b),
inference(spm,[status(thm)],[c_0_23,c_0_46]) ).
cnf(c_0_54,axiom,
meet(n0,X1,n0),
meet_0_and_x ).
cnf(c_0_55,negated_conjecture,
join(r1,e,a2),
join_r1_and_e ).
cnf(c_0_56,negated_conjecture,
( meet(X1,X2,n0)
| ~ meet(X3,b,X2)
| ~ meet(X1,X3,d) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_57,negated_conjecture,
meet(c2,b,b),
inference(spm,[status(thm)],[c_0_19,c_0_49]) ).
cnf(c_0_58,negated_conjecture,
meet(c2,b2,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_59,negated_conjecture,
join(e,b,b),
inference(spm,[status(thm)],[c_0_26,c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( meet(X1,r1,X2)
| ~ meet(X3,n0,X2)
| ~ meet(X3,c2,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_52]) ).
cnf(c_0_61,plain,
meet(X1,n0,n0),
inference(spm,[status(thm)],[c_0_19,c_0_54]) ).
cnf(c_0_62,negated_conjecture,
join(e,r1,a2),
inference(spm,[status(thm)],[c_0_26,c_0_55]) ).
cnf(c_0_63,negated_conjecture,
( meet(X1,b,n0)
| ~ meet(X1,c2,d) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
meet(b2,c2,d),
inference(spm,[status(thm)],[c_0_19,c_0_58]) ).
cnf(c_0_65,negated_conjecture,
( meet(X1,a2,X2)
| ~ meet(X1,e,e)
| ~ meet(X1,r1,X3)
| ~ join(e,X3,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_55]) ).
cnf(c_0_66,negated_conjecture,
meet(e,b,e),
inference(spm,[status(thm)],[c_0_38,c_0_59]) ).
cnf(c_0_67,negated_conjecture,
( meet(X1,r1,n0)
| ~ meet(X2,c2,X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_68,negated_conjecture,
( meet(X1,a2,X2)
| ~ meet(X1,r1,r1)
| ~ meet(X1,e,X3)
| ~ join(r1,X3,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_62]) ).
cnf(c_0_69,negated_conjecture,
meet(r1,b2,r1),
inference(spm,[status(thm)],[c_0_38,c_0_36]) ).
cnf(c_0_70,plain,
( meet(X1,X2,n0)
| ~ meet(X1,X3,n0)
| ~ meet(X3,X4,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_54]) ).
cnf(c_0_71,negated_conjecture,
meet(b2,b,n0),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_72,negated_conjecture,
( meet(X1,a2,e)
| ~ meet(X1,e,e)
| ~ meet(X1,r1,n0) ),
inference(spm,[status(thm)],[c_0_65,c_0_44]) ).
cnf(c_0_73,negated_conjecture,
meet(b,e,e),
inference(spm,[status(thm)],[c_0_19,c_0_66]) ).
cnf(c_0_74,negated_conjecture,
meet(b,r1,n0),
inference(spm,[status(thm)],[c_0_67,c_0_49]) ).
cnf(c_0_75,negated_conjecture,
( meet(X1,a2,r1)
| ~ meet(X1,r1,r1)
| ~ meet(X1,e,n0) ),
inference(spm,[status(thm)],[c_0_68,c_0_44]) ).
cnf(c_0_76,negated_conjecture,
meet(b2,r1,r1),
inference(spm,[status(thm)],[c_0_19,c_0_69]) ).
cnf(c_0_77,negated_conjecture,
( meet(b2,X1,n0)
| ~ meet(b,X2,X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_78,negated_conjecture,
meet(b,a2,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_79,negated_conjecture,
( meet(b2,a2,r1)
| ~ meet(b2,e,n0) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
meet(b2,e,n0),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
meet(b2,a2,r1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]) ).
cnf(c_0_82,negated_conjecture,
~ meet(a2,b2,r1),
meet_a2_and_b2 ).
cnf(c_0_83,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_81]),c_0_82]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LAT005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 10:40:00 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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/tmp/tmp.5TaSQfuh8s/E---3.1_22033.p
% 2.58/0.82 # Version: 3.1pre001
% 2.58/0.82 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.58/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.58/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.58/0.82 # Starting new_bool_3 with 300s (1) cores
% 2.58/0.82 # Starting new_bool_1 with 300s (1) cores
% 2.58/0.82 # Starting sh5l with 300s (1) cores
% 2.58/0.82 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 22155 completed with status 0
% 2.58/0.82 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 2.58/0.82 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.58/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.58/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.58/0.82 # No SInE strategy applied
% 2.58/0.82 # Search class: FHUNM-FFMM00-SFFFFFNN
% 2.58/0.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.58/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 811s (1) cores
% 2.58/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 2.58/0.82 # Starting new_bool_3 with 136s (1) cores
% 2.58/0.82 # Starting new_bool_1 with 136s (1) cores
% 2.58/0.82 # Starting sh5l with 136s (1) cores
% 2.58/0.82 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 22160 completed with status 0
% 2.58/0.82 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 2.58/0.82 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.58/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.58/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.58/0.82 # No SInE strategy applied
% 2.58/0.82 # Search class: FHUNM-FFMM00-SFFFFFNN
% 2.58/0.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.58/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 811s (1) cores
% 2.58/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 2.58/0.82 # Preprocessing time : 0.002 s
% 2.58/0.82 # Presaturation interreduction done
% 2.58/0.82
% 2.58/0.82 # Proof found!
% 2.58/0.82 # SZS status Unsatisfiable
% 2.58/0.82 # SZS output start CNFRefutation
% See solution above
% 2.58/0.82 # Parsed axioms : 29
% 2.58/0.82 # Removed by relevancy pruning/SinE : 0
% 2.58/0.82 # Initial clauses : 29
% 2.58/0.82 # Removed in clause preprocessing : 0
% 2.58/0.82 # Initial clauses in saturation : 29
% 2.58/0.82 # Processed clauses : 3147
% 2.58/0.82 # ...of these trivial : 8
% 2.58/0.82 # ...subsumed : 236
% 2.58/0.82 # ...remaining for further processing : 2903
% 2.58/0.82 # Other redundant clauses eliminated : 0
% 2.58/0.82 # Clauses deleted for lack of memory : 0
% 2.58/0.82 # Backward-subsumed : 62
% 2.58/0.82 # Backward-rewritten : 6
% 2.58/0.82 # Generated clauses : 7784
% 2.58/0.82 # ...of the previous two non-redundant : 4913
% 2.58/0.82 # ...aggressively subsumed : 0
% 2.58/0.82 # Contextual simplify-reflections : 0
% 2.58/0.82 # Paramodulations : 7784
% 2.58/0.82 # Factorizations : 0
% 2.58/0.82 # NegExts : 0
% 2.58/0.82 # Equation resolutions : 0
% 2.58/0.82 # Total rewrite steps : 2476
% 2.58/0.82 # Propositional unsat checks : 0
% 2.58/0.82 # Propositional check models : 0
% 2.58/0.82 # Propositional check unsatisfiable : 0
% 2.58/0.82 # Propositional clauses : 0
% 2.58/0.82 # Propositional clauses after purity: 0
% 2.58/0.82 # Propositional unsat core size : 0
% 2.58/0.82 # Propositional preprocessing time : 0.000
% 2.58/0.82 # Propositional encoding time : 0.000
% 2.58/0.82 # Propositional solver time : 0.000
% 2.58/0.82 # Success case prop preproc time : 0.000
% 2.58/0.82 # Success case prop encoding time : 0.000
% 2.58/0.82 # Success case prop solver time : 0.000
% 2.58/0.82 # Current number of processed clauses : 2806
% 2.58/0.82 # Positive orientable unit clauses : 134
% 2.58/0.82 # Positive unorientable unit clauses: 0
% 2.58/0.82 # Negative unit clauses : 3
% 2.58/0.82 # Non-unit-clauses : 2669
% 2.58/0.82 # Current number of unprocessed clauses: 1808
% 2.58/0.82 # ...number of literals in the above : 5432
% 2.58/0.82 # Current number of archived formulas : 0
% 2.58/0.82 # Current number of archived clauses : 97
% 2.58/0.82 # Clause-clause subsumption calls (NU) : 394960
% 2.58/0.82 # Rec. Clause-clause subsumption calls : 356937
% 2.58/0.82 # Non-unit clause-clause subsumptions : 298
% 2.58/0.82 # Unit Clause-clause subsumption calls : 3358
% 2.58/0.82 # Rewrite failures with RHS unbound : 0
% 2.58/0.82 # BW rewrite match attempts : 62
% 2.58/0.82 # BW rewrite match successes : 6
% 2.58/0.82 # Condensation attempts : 0
% 2.58/0.82 # Condensation successes : 0
% 2.58/0.82 # Termbank termtop insertions : 106323
% 2.58/0.82
% 2.58/0.82 # -------------------------------------------------
% 2.58/0.82 # User time : 0.327 s
% 2.58/0.82 # System time : 0.006 s
% 2.58/0.82 # Total time : 0.333 s
% 2.58/0.82 # Maximum resident set size: 1648 pages
% 2.58/0.82
% 2.58/0.82 # -------------------------------------------------
% 2.58/0.82 # User time : 1.648 s
% 2.58/0.82 # System time : 0.018 s
% 2.58/0.82 # Total time : 1.666 s
% 2.58/0.82 # Maximum resident set size: 1692 pages
% 2.58/0.82 % E---3.1 exiting
% 2.58/0.82 % E---3.1 exiting
%------------------------------------------------------------------------------