TSTP Solution File: SEU371+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU371+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 19:31:51 EDT 2023
% Result : Theorem 17.62s 2.89s
% Output : CNFRefutation 17.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 24 unt; 0 def)
% Number of atoms : 170 ( 34 equ)
% Maximal formula atoms : 25 ( 3 avg)
% Number of connectives : 173 ( 48 ~; 39 |; 81 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 22 ( 20 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 9 sgn; 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t18_yellow_1,conjecture,
! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox2/tmp/tmp.GE8Fl941Fs/E---3.1_23893.p',t18_yellow_1) ).
fof(t4_yellow_1,lemma,
! [X1] : boole_POSet(X1) = incl_POSet(powerset(X1)),
file('/export/starexec/sandbox2/tmp/tmp.GE8Fl941Fs/E---3.1_23893.p',t4_yellow_1) ).
fof(d2_yellow_1,axiom,
! [X1] : boole_POSet(X1) = poset_of_lattice(boole_lattice(X1)),
file('/export/starexec/sandbox2/tmp/tmp.GE8Fl941Fs/E---3.1_23893.p',d2_yellow_1) ).
fof(t50_lattice3,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& complete_latt_str(X1)
& latt_str(X1) )
=> ( ~ empty_carrier(X1)
& lattice(X1)
& lower_bounded_semilattstr(X1)
& latt_str(X1)
& bottom_of_semilattstr(X1) = join_of_latt_set(X1,empty_set) ) ),
file('/export/starexec/sandbox2/tmp/tmp.GE8Fl941Fs/E---3.1_23893.p',t50_lattice3) ).
fof(fc1_knaster,axiom,
! [X1] :
( ~ empty_carrier(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1))
& join_commutative(boole_lattice(X1))
& join_associative(boole_lattice(X1))
& meet_commutative(boole_lattice(X1))
& meet_associative(boole_lattice(X1))
& meet_absorbing(boole_lattice(X1))
& join_absorbing(boole_lattice(X1))
& lattice(boole_lattice(X1))
& distributive_lattstr(boole_lattice(X1))
& modular_lattstr(boole_lattice(X1))
& lower_bounded_semilattstr(boole_lattice(X1))
& upper_bounded_semilattstr(boole_lattice(X1))
& bounded_lattstr(boole_lattice(X1))
& complemented_lattstr(boole_lattice(X1))
& boolean_lattstr(boole_lattice(X1))
& complete_latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.GE8Fl941Fs/E---3.1_23893.p',fc1_knaster) ).
fof(d11_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> bottom_of_relstr(X1) = join_on_relstr(X1,empty_set) ),
file('/export/starexec/sandbox2/tmp/tmp.GE8Fl941Fs/E---3.1_23893.p',d11_yellow_0) ).
fof(dt_k2_yellow_1,axiom,
! [X1] :
( strict_rel_str(incl_POSet(X1))
& rel_str(incl_POSet(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.GE8Fl941Fs/E---3.1_23893.p',dt_k2_yellow_1) ).
fof(t3_lattice3,lemma,
! [X1] :
( lower_bounded_semilattstr(boole_lattice(X1))
& bottom_of_semilattstr(boole_lattice(X1)) = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.GE8Fl941Fs/E---3.1_23893.p',t3_lattice3) ).
fof(dt_k1_lattice3,axiom,
! [X1] :
( strict_latt_str(boole_lattice(X1))
& latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.GE8Fl941Fs/E---3.1_23893.p',dt_k1_lattice3) ).
fof(t29_yellow_0,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& complete_latt_str(X1)
& latt_str(X1) )
=> ! [X2] :
( join_of_latt_set(X1,X2) = join_on_relstr(poset_of_lattice(X1),X2)
& meet_of_latt_set(X1,X2) = meet_on_relstr(poset_of_lattice(X1),X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.GE8Fl941Fs/E---3.1_23893.p',t29_yellow_0) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
inference(assume_negation,[status(cth)],[t18_yellow_1]) ).
fof(c_0_11,negated_conjecture,
bottom_of_relstr(boole_POSet(esk464_0)) != empty_set,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_12,lemma,
! [X2226] : boole_POSet(X2226) = incl_POSet(powerset(X2226)),
inference(variable_rename,[status(thm)],[t4_yellow_1]) ).
fof(c_0_13,plain,
! [X461] : boole_POSet(X461) = poset_of_lattice(boole_lattice(X461)),
inference(variable_rename,[status(thm)],[d2_yellow_1]) ).
cnf(c_0_14,negated_conjecture,
bottom_of_relstr(boole_POSet(esk464_0)) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,lemma,
boole_POSet(X1) = incl_POSet(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
boole_POSet(X1) = poset_of_lattice(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& complete_latt_str(X1)
& latt_str(X1) )
=> ( ~ empty_carrier(X1)
& lattice(X1)
& lower_bounded_semilattstr(X1)
& latt_str(X1)
& bottom_of_semilattstr(X1) = join_of_latt_set(X1,empty_set) ) ),
inference(fof_simplification,[status(thm)],[t50_lattice3]) ).
fof(c_0_18,plain,
! [X1] :
( ~ empty_carrier(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1))
& join_commutative(boole_lattice(X1))
& join_associative(boole_lattice(X1))
& meet_commutative(boole_lattice(X1))
& meet_associative(boole_lattice(X1))
& meet_absorbing(boole_lattice(X1))
& join_absorbing(boole_lattice(X1))
& lattice(boole_lattice(X1))
& distributive_lattstr(boole_lattice(X1))
& modular_lattstr(boole_lattice(X1))
& lower_bounded_semilattstr(boole_lattice(X1))
& upper_bounded_semilattstr(boole_lattice(X1))
& bounded_lattstr(boole_lattice(X1))
& complemented_lattstr(boole_lattice(X1))
& boolean_lattstr(boole_lattice(X1))
& complete_latt_str(boole_lattice(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_knaster]) ).
cnf(c_0_19,negated_conjecture,
bottom_of_relstr(incl_POSet(powerset(esk464_0))) != empty_set,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
poset_of_lattice(boole_lattice(X1)) = incl_POSet(powerset(X1)),
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
fof(c_0_21,plain,
! [X159] :
( ~ rel_str(X159)
| bottom_of_relstr(X159) = join_on_relstr(X159,empty_set) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d11_yellow_0])]) ).
fof(c_0_22,plain,
! [X786] :
( strict_rel_str(incl_POSet(X786))
& rel_str(incl_POSet(X786)) ),
inference(variable_rename,[status(thm)],[dt_k2_yellow_1]) ).
fof(c_0_23,lemma,
! [X2143] :
( lower_bounded_semilattstr(boole_lattice(X2143))
& bottom_of_semilattstr(boole_lattice(X2143)) = empty_set ),
inference(variable_rename,[status(thm)],[t3_lattice3]) ).
fof(c_0_24,lemma,
! [X2227] :
( ( ~ empty_carrier(X2227)
| empty_carrier(X2227)
| ~ lattice(X2227)
| ~ complete_latt_str(X2227)
| ~ latt_str(X2227) )
& ( lattice(X2227)
| empty_carrier(X2227)
| ~ lattice(X2227)
| ~ complete_latt_str(X2227)
| ~ latt_str(X2227) )
& ( lower_bounded_semilattstr(X2227)
| empty_carrier(X2227)
| ~ lattice(X2227)
| ~ complete_latt_str(X2227)
| ~ latt_str(X2227) )
& ( latt_str(X2227)
| empty_carrier(X2227)
| ~ lattice(X2227)
| ~ complete_latt_str(X2227)
| ~ latt_str(X2227) )
& ( bottom_of_semilattstr(X2227) = join_of_latt_set(X2227,empty_set)
| empty_carrier(X2227)
| ~ lattice(X2227)
| ~ complete_latt_str(X2227)
| ~ latt_str(X2227) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
fof(c_0_25,plain,
! [X907] :
( ~ empty_carrier(boole_lattice(X907))
& strict_latt_str(boole_lattice(X907))
& join_commutative(boole_lattice(X907))
& join_associative(boole_lattice(X907))
& meet_commutative(boole_lattice(X907))
& meet_associative(boole_lattice(X907))
& meet_absorbing(boole_lattice(X907))
& join_absorbing(boole_lattice(X907))
& lattice(boole_lattice(X907))
& distributive_lattstr(boole_lattice(X907))
& modular_lattstr(boole_lattice(X907))
& lower_bounded_semilattstr(boole_lattice(X907))
& upper_bounded_semilattstr(boole_lattice(X907))
& bounded_lattstr(boole_lattice(X907))
& complemented_lattstr(boole_lattice(X907))
& boolean_lattstr(boole_lattice(X907))
& complete_latt_str(boole_lattice(X907)) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
fof(c_0_26,plain,
! [X748] :
( strict_latt_str(boole_lattice(X748))
& latt_str(boole_lattice(X748)) ),
inference(variable_rename,[status(thm)],[dt_k1_lattice3]) ).
fof(c_0_27,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& complete_latt_str(X1)
& latt_str(X1) )
=> ! [X2] :
( join_of_latt_set(X1,X2) = join_on_relstr(poset_of_lattice(X1),X2)
& meet_of_latt_set(X1,X2) = meet_on_relstr(poset_of_lattice(X1),X2) ) ),
inference(fof_simplification,[status(thm)],[t29_yellow_0]) ).
cnf(c_0_28,negated_conjecture,
bottom_of_relstr(poset_of_lattice(boole_lattice(esk464_0))) != empty_set,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( bottom_of_relstr(X1) = join_on_relstr(X1,empty_set)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,lemma,
bottom_of_semilattstr(boole_lattice(X1)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,lemma,
( bottom_of_semilattstr(X1) = join_of_latt_set(X1,empty_set)
| empty_carrier(X1)
| ~ lattice(X1)
| ~ complete_latt_str(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
complete_latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
lattice(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
~ empty_carrier(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_37,lemma,
! [X2059,X2060] :
( ( join_of_latt_set(X2059,X2060) = join_on_relstr(poset_of_lattice(X2059),X2060)
| empty_carrier(X2059)
| ~ lattice(X2059)
| ~ complete_latt_str(X2059)
| ~ latt_str(X2059) )
& ( meet_of_latt_set(X2059,X2060) = meet_on_relstr(poset_of_lattice(X2059),X2060)
| empty_carrier(X2059)
| ~ lattice(X2059)
| ~ complete_latt_str(X2059)
| ~ latt_str(X2059) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
cnf(c_0_38,negated_conjecture,
( join_on_relstr(poset_of_lattice(boole_lattice(esk464_0)),empty_set) != empty_set
| ~ rel_str(poset_of_lattice(boole_lattice(esk464_0))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,plain,
rel_str(poset_of_lattice(boole_lattice(X1))),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_40,lemma,
join_of_latt_set(boole_lattice(X1),empty_set) = empty_set,
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_31,c_0_32]),c_0_33]),c_0_34]),c_0_35])]),c_0_36]) ).
cnf(c_0_41,lemma,
( join_of_latt_set(X1,X2) = join_on_relstr(poset_of_lattice(X1),X2)
| empty_carrier(X1)
| ~ lattice(X1)
| ~ complete_latt_str(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
join_on_relstr(poset_of_lattice(boole_lattice(esk464_0)),empty_set) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_43,lemma,
join_on_relstr(poset_of_lattice(boole_lattice(X1)),empty_set) = empty_set,
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_40,c_0_41]),c_0_33]),c_0_34]),c_0_35])]),c_0_36]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU371+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n031.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 09:05:43 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.52 Running first-order model finding
% 0.18/0.52 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.GE8Fl941Fs/E---3.1_23893.p
% 17.62/2.89 # Version: 3.1pre001
% 17.62/2.89 # Preprocessing class: FSLMSMSSSSSNFFN.
% 17.62/2.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.62/2.89 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 17.62/2.89 # Starting new_bool_3 with 600s (2) cores
% 17.62/2.89 # Starting new_bool_1 with 600s (2) cores
% 17.62/2.89 # Starting sh5l with 300s (1) cores
% 17.62/2.89 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 23971 completed with status 0
% 17.62/2.89 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 17.62/2.89 # Preprocessing class: FSLMSMSSSSSNFFN.
% 17.62/2.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.62/2.89 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 17.62/2.89 # No SInE strategy applied
% 17.62/2.89 # Search class: FGHSM-SMLM32-MFFFFFNN
% 17.62/2.89 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 17.62/2.89 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 17.62/2.89 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 17.62/2.89 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 68s (1) cores
% 17.62/2.89 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 23981 completed with status 0
% 17.62/2.89 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 17.62/2.89 # Preprocessing class: FSLMSMSSSSSNFFN.
% 17.62/2.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.62/2.89 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 17.62/2.89 # No SInE strategy applied
% 17.62/2.89 # Search class: FGHSM-SMLM32-MFFFFFNN
% 17.62/2.89 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 17.62/2.89 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 17.62/2.89 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 17.62/2.89 # Preprocessing time : 0.033 s
% 17.62/2.89 # Presaturation interreduction done
% 17.62/2.89
% 17.62/2.89 # Proof found!
% 17.62/2.89 # SZS status Theorem
% 17.62/2.89 # SZS output start CNFRefutation
% See solution above
% 17.62/2.89 # Parsed axioms : 756
% 17.62/2.89 # Removed by relevancy pruning/SinE : 0
% 17.62/2.89 # Initial clauses : 3317
% 17.62/2.89 # Removed in clause preprocessing : 74
% 17.62/2.89 # Initial clauses in saturation : 3243
% 17.62/2.89 # Processed clauses : 11518
% 17.62/2.89 # ...of these trivial : 191
% 17.62/2.89 # ...subsumed : 4953
% 17.62/2.89 # ...remaining for further processing : 6374
% 17.62/2.89 # Other redundant clauses eliminated : 1048
% 17.62/2.89 # Clauses deleted for lack of memory : 0
% 17.62/2.89 # Backward-subsumed : 111
% 17.62/2.89 # Backward-rewritten : 122
% 17.62/2.89 # Generated clauses : 22865
% 17.62/2.89 # ...of the previous two non-redundant : 19834
% 17.62/2.89 # ...aggressively subsumed : 0
% 17.62/2.89 # Contextual simplify-reflections : 354
% 17.62/2.89 # Paramodulations : 22055
% 17.62/2.89 # Factorizations : 0
% 17.62/2.89 # NegExts : 0
% 17.62/2.89 # Equation resolutions : 1056
% 17.62/2.89 # Total rewrite steps : 7514
% 17.62/2.89 # Propositional unsat checks : 1
% 17.62/2.89 # Propositional check models : 1
% 17.62/2.89 # Propositional check unsatisfiable : 0
% 17.62/2.89 # Propositional clauses : 0
% 17.62/2.89 # Propositional clauses after purity: 0
% 17.62/2.89 # Propositional unsat core size : 0
% 17.62/2.89 # Propositional preprocessing time : 0.000
% 17.62/2.89 # Propositional encoding time : 0.012
% 17.62/2.89 # Propositional solver time : 0.004
% 17.62/2.89 # Success case prop preproc time : 0.000
% 17.62/2.89 # Success case prop encoding time : 0.000
% 17.62/2.89 # Success case prop solver time : 0.000
% 17.62/2.89 # Current number of processed clauses : 2520
% 17.62/2.89 # Positive orientable unit clauses : 500
% 17.62/2.89 # Positive unorientable unit clauses: 6
% 17.62/2.89 # Negative unit clauses : 518
% 17.62/2.89 # Non-unit-clauses : 1496
% 17.62/2.89 # Current number of unprocessed clauses: 14220
% 17.62/2.89 # ...number of literals in the above : 47049
% 17.62/2.89 # Current number of archived formulas : 0
% 17.62/2.89 # Current number of archived clauses : 3199
% 17.62/2.89 # Clause-clause subsumption calls (NU) : 4483123
% 17.62/2.89 # Rec. Clause-clause subsumption calls : 502129
% 17.62/2.89 # Non-unit clause-clause subsumptions : 1875
% 17.62/2.89 # Unit Clause-clause subsumption calls : 84368
% 17.62/2.89 # Rewrite failures with RHS unbound : 26
% 17.62/2.89 # BW rewrite match attempts : 179
% 17.62/2.89 # BW rewrite match successes : 131
% 17.62/2.89 # Condensation attempts : 0
% 17.62/2.89 # Condensation successes : 0
% 17.62/2.89 # Termbank termtop insertions : 519124
% 17.62/2.89
% 17.62/2.89 # -------------------------------------------------
% 17.62/2.89 # User time : 2.123 s
% 17.62/2.89 # System time : 0.033 s
% 17.62/2.89 # Total time : 2.156 s
% 17.62/2.89 # Maximum resident set size: 10792 pages
% 17.62/2.89
% 17.62/2.89 # -------------------------------------------------
% 17.62/2.89 # User time : 6.217 s
% 17.62/2.89 # System time : 0.102 s
% 17.62/2.89 # Total time : 6.319 s
% 17.62/2.89 # Maximum resident set size: 2752 pages
% 17.62/2.89 % E---3.1 exiting
%------------------------------------------------------------------------------