TSTP Solution File: MGT020+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT020+1 : TPTP v8.1.2. Released v2.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:36:01 EDT 2023
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 5 unt; 0 def)
% Number of atoms : 148 ( 9 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 172 ( 68 ~; 68 |; 20 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn; 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp_positive_function_difference,axiom,
! [X1,X2,X3,X4] :
( ( environment(X1)
& greater_or_equal(X2,X3)
& greater_or_equal(X4,X2)
& subpopulations(first_movers,efficient_producers,X1,X4)
& greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3)) )
=> ( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
=> greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZmYxkUQzH8/E---3.1_4110.p',mp_positive_function_difference) ).
fof(mp_times_in_order,axiom,
! [X1,X3,X4] :
( ( environment(X1)
& greater_or_equal(X3,start_time(X1))
& greater(X4,X3)
& in_environment(X1,X4) )
=> in_environment(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ZmYxkUQzH8/E---3.1_4110.p',mp_times_in_order) ).
fof(mp_initial_time,axiom,
! [X1] :
( environment(X1)
=> greater_or_equal(initial_FM_EP(X1),start_time(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.ZmYxkUQzH8/E---3.1_4110.p',mp_initial_time) ).
fof(mp_greater_or_equal,axiom,
! [X5,X6] :
( greater_or_equal(X5,X6)
=> ( greater(X5,X6)
| X5 = X6 ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZmYxkUQzH8/E---3.1_4110.p',mp_greater_or_equal) ).
fof(mp_earliest_time_point,axiom,
! [X1,X2] :
( environment(X1)
=> ( ( in_environment(X1,initial_FM_EP(X1))
=> subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1)) )
& ( subpopulations(first_movers,efficient_producers,X1,X2)
=> greater_or_equal(X2,initial_FM_EP(X1)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZmYxkUQzH8/E---3.1_4110.p',mp_earliest_time_point) ).
fof(a8,hypothesis,
! [X1] :
( environment(X1)
=> greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.ZmYxkUQzH8/E---3.1_4110.p',a8) ).
fof(prove_l2,conjecture,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> greater(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.ZmYxkUQzH8/E---3.1_4110.p',prove_l2) ).
fof(mp_time_point_occurs,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> in_environment(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ZmYxkUQzH8/E---3.1_4110.p',mp_time_point_occurs) ).
fof(l3,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.ZmYxkUQzH8/E---3.1_4110.p',l3) ).
fof(c_0_9,plain,
! [X1,X2,X3,X4] :
( ( environment(X1)
& greater_or_equal(X2,X3)
& greater_or_equal(X4,X2)
& subpopulations(first_movers,efficient_producers,X1,X4)
& greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3)) )
=> ( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
=> greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)) ) ),
inference(fof_simplification,[status(thm)],[mp_positive_function_difference]) ).
fof(c_0_10,plain,
! [X19,X20,X21] :
( ~ environment(X19)
| ~ greater_or_equal(X20,start_time(X19))
| ~ greater(X21,X20)
| ~ in_environment(X19,X21)
| in_environment(X19,X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_times_in_order])]) ).
fof(c_0_11,plain,
! [X18] :
( ~ environment(X18)
| greater_or_equal(initial_FM_EP(X18),start_time(X18)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_initial_time])]) ).
fof(c_0_12,plain,
! [X25,X26] :
( ~ greater_or_equal(X25,X26)
| greater(X25,X26)
| X25 = X26 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_or_equal])]) ).
fof(c_0_13,plain,
! [X10,X11] :
( ( ~ in_environment(X10,initial_FM_EP(X10))
| subpopulations(first_movers,efficient_producers,X10,initial_FM_EP(X10))
| ~ environment(X10) )
& ( ~ subpopulations(first_movers,efficient_producers,X10,X11)
| greater_or_equal(X11,initial_FM_EP(X10))
| ~ environment(X10) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_earliest_time_point])])]) ).
fof(c_0_14,plain,
! [X12,X13,X14,X15] :
( ~ environment(X12)
| ~ greater_or_equal(X13,X14)
| ~ greater_or_equal(X15,X13)
| ~ subpopulations(first_movers,efficient_producers,X12,X15)
| ~ greater(disbanding_rate(first_movers,X14),disbanding_rate(efficient_producers,X14))
| decreases(difference(disbanding_rate(first_movers,X13),disbanding_rate(efficient_producers,X13)))
| greater(disbanding_rate(first_movers,X15),disbanding_rate(efficient_producers,X15)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
fof(c_0_15,hypothesis,
! [X27] :
( ~ environment(X27)
| greater(disbanding_rate(first_movers,initial_FM_EP(X27)),disbanding_rate(efficient_producers,initial_FM_EP(X27))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a8])]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> greater(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)) ),
inference(assume_negation,[status(cth)],[prove_l2]) ).
cnf(c_0_17,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ greater_or_equal(X2,start_time(X1))
| ~ greater(X3,X2)
| ~ in_environment(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( greater_or_equal(initial_FM_EP(X1),start_time(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( greater_or_equal(X2,initial_FM_EP(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X16,X17] :
( ~ environment(X16)
| ~ subpopulations(first_movers,efficient_producers,X16,X17)
| in_environment(X16,X17) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_occurs])]) ).
cnf(c_0_22,plain,
( decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))
| ~ environment(X1)
| ~ greater_or_equal(X2,X3)
| ~ greater_or_equal(X4,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X4)
| ~ greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,hypothesis,
( greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1)))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_24,negated_conjecture,
( environment(esk1_0)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& ~ greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_25,plain,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
inference(fof_simplification,[status(thm)],[l3]) ).
cnf(c_0_26,plain,
( in_environment(X1,initial_FM_EP(X1))
| ~ greater(X2,initial_FM_EP(X1))
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
( X1 = initial_FM_EP(X2)
| greater(X1,initial_FM_EP(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,hypothesis,
( greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ greater_or_equal(X2,initial_FM_EP(X3))
| ~ greater_or_equal(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X4,X1)
| ~ environment(X4)
| ~ environment(X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
~ greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_33,plain,
! [X8,X9] :
( ~ environment(X8)
| ~ subpopulations(first_movers,efficient_producers,X8,X9)
| ~ decreases(difference(disbanding_rate(first_movers,X9),disbanding_rate(efficient_producers,X9))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])]) ).
cnf(c_0_34,plain,
( X1 = initial_FM_EP(X2)
| in_environment(X2,initial_FM_EP(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))
| ~ greater_or_equal(X1,initial_FM_EP(X2))
| ~ greater_or_equal(esk2_0,X1)
| ~ environment(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_36,plain,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
( subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1))
| ~ in_environment(X1,initial_FM_EP(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_38,negated_conjecture,
( initial_FM_EP(esk1_0) = esk2_0
| in_environment(esk1_0,initial_FM_EP(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_31])]) ).
cnf(c_0_39,negated_conjecture,
( ~ greater_or_equal(esk2_0,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_20]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( initial_FM_EP(esk1_0) = esk2_0
| subpopulations(first_movers,efficient_producers,esk1_0,initial_FM_EP(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31])]) ).
cnf(c_0_41,negated_conjecture,
( initial_FM_EP(esk1_0) = esk2_0
| ~ greater_or_equal(esk2_0,initial_FM_EP(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_31])]) ).
cnf(c_0_42,negated_conjecture,
initial_FM_EP(esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_20]),c_0_30]),c_0_31])]) ).
cnf(c_0_43,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_42]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT020+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % 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 : Tue Oct 3 00:22:59 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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.ZmYxkUQzH8/E---3.1_4110.p
% 0.21/0.54 # Version: 3.1pre001
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4235 completed with status 0
% 0.21/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.54 # Starting sh5l with 136s (1) cores
% 0.21/0.54 # SAT001_MinMin_p005000_rr_RG with pid 4241 completed with status 0
% 0.21/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.54 # Preprocessing time : 0.002 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 11
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 14
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 14
% 0.21/0.54 # Processed clauses : 57
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 1
% 0.21/0.54 # ...remaining for further processing : 56
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 6
% 0.21/0.54 # Backward-rewritten : 7
% 0.21/0.54 # Generated clauses : 61
% 0.21/0.54 # ...of the previous two non-redundant : 49
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 2
% 0.21/0.54 # Paramodulations : 61
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Total rewrite steps : 36
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 29
% 0.21/0.54 # Positive orientable unit clauses : 3
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 2
% 0.21/0.54 # Non-unit-clauses : 24
% 0.21/0.54 # Current number of unprocessed clauses: 19
% 0.21/0.54 # ...number of literals in the above : 105
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 27
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 252
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 88
% 0.21/0.54 # Non-unit clause-clause subsumptions : 9
% 0.21/0.54 # Unit Clause-clause subsumption calls : 27
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 1
% 0.21/0.54 # BW rewrite match successes : 1
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 2972
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.016 s
% 0.21/0.54 # System time : 0.001 s
% 0.21/0.54 # Total time : 0.017 s
% 0.21/0.54 # Maximum resident set size: 1744 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.055 s
% 0.21/0.54 # System time : 0.008 s
% 0.21/0.54 # Total time : 0.063 s
% 0.21/0.54 # Maximum resident set size: 1688 pages
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------