TSTP Solution File: SWW101+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWW101+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 20:08:41 EDT 2023
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 62 ( 27 unt; 0 def)
% Number of atoms : 212 ( 79 equ)
% Maximal formula atoms : 75 ( 3 avg)
% Number of connectives : 235 ( 85 ~; 101 |; 43 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 46 ( 2 sgn; 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(def_false2,axiom,
? [X5] :
( false2 = phi(f7(X5))
& ~ ? [X10] : forallprefers(f7(X10),f7(X5)) ),
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',def_false2) ).
fof(def_f7,axiom,
! [X5] : f7(X5) = lazy_impl(prop(X5),X5),
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',def_f7) ).
fof(prop_false,axiom,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',prop_false) ).
fof(lazy_impl_axiom2,axiom,
! [X4] : lazy_impl(false,X4) = true,
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',lazy_impl_axiom2) ).
fof(def_phi,axiom,
! [X1] :
( ( d(X1)
& phi(X1) = X1 )
| ( ~ d(X1)
& phi(X1) = err ) ),
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',def_phi) ).
fof(prop_true,axiom,
! [X1] :
( prop(X1) = true
<=> bool(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',prop_true) ).
fof(lazy_impl_axiom3,axiom,
! [X4] : lazy_impl(true,X4) = phi(X4),
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',lazy_impl_axiom3) ).
fof(def_forallprefers,axiom,
! [X1,X2] :
( forallprefers(X1,X2)
<=> ( ( ~ d(X1)
& d(X2) )
| ( d(X1)
& d(X2)
& ~ bool(X1)
& bool(X2) )
| ( X1 = false
& X2 = true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',def_forallprefers) ).
fof(def_bool,axiom,
! [X1] :
( bool(X1)
<=> ( X1 = false
| X1 = true ) ),
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',def_bool) ).
fof(false_true_err_in_d,axiom,
( d(true)
& d(false)
& d(err) ),
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',false_true_err_in_d) ).
fof(false1_false2,conjecture,
false1 = false2,
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',false1_false2) ).
fof(def_false1,axiom,
false1 = false,
file('/export/starexec/sandbox2/tmp/tmp.Z6EmN7MBqq/E---3.1_24201.p',def_false1) ).
fof(c_0_12,plain,
! [X83] :
( false2 = phi(f7(esk7_0))
& ~ forallprefers(f7(X83),f7(esk7_0)) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_false2])])])]) ).
fof(c_0_13,plain,
! [X81] : f7(X81) = lazy_impl(prop(X81),X81),
inference(variable_rename,[status(thm)],[def_f7]) ).
fof(c_0_14,plain,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
inference(fof_simplification,[status(thm)],[prop_false]) ).
cnf(c_0_15,plain,
~ forallprefers(f7(X1),f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
f7(X1) = lazy_impl(prop(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X18] :
( ( prop(X18) != false
| ~ bool(X18) )
& ( bool(X18)
| prop(X18) = false ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
fof(c_0_18,plain,
! [X27] : lazy_impl(false,X27) = true,
inference(variable_rename,[status(thm)],[lazy_impl_axiom2]) ).
fof(c_0_19,plain,
! [X1] :
( ( d(X1)
& phi(X1) = X1 )
| ( ~ d(X1)
& phi(X1) = err ) ),
inference(fof_simplification,[status(thm)],[def_phi]) ).
cnf(c_0_20,plain,
~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_21,plain,
( bool(X1)
| prop(X1) = false ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
lazy_impl(false,X1) = true,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X17] :
( ( prop(X17) != true
| bool(X17) )
& ( ~ bool(X17)
| prop(X17) = true ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prop_true])]) ).
fof(c_0_24,plain,
! [X16] :
( ( ~ d(X16)
| d(X16) )
& ( phi(X16) = err
| d(X16) )
& ( ~ d(X16)
| phi(X16) = X16 )
& ( phi(X16) = err
| phi(X16) = X16 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_19])]) ).
fof(c_0_25,plain,
! [X28] : lazy_impl(true,X28) = phi(X28),
inference(variable_rename,[status(thm)],[lazy_impl_axiom3]) ).
fof(c_0_26,plain,
! [X1,X2] :
( forallprefers(X1,X2)
<=> ( ( ~ d(X1)
& d(X2) )
| ( d(X1)
& d(X2)
& ~ bool(X1)
& bool(X2) )
| ( X1 = false
& X2 = true ) ) ),
inference(fof_simplification,[status(thm)],[def_forallprefers]) ).
cnf(c_0_27,plain,
( bool(esk7_0)
| ~ forallprefers(lazy_impl(prop(X1),X1),true) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_28,plain,
( prop(X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( phi(X1) = X1
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
lazy_impl(true,X1) = phi(X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_31,plain,
! [X12,X13] :
( ( X12 = false
| d(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| d(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| ~ bool(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| ~ bool(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| bool(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| bool(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| d(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| d(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| ~ bool(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| ~ bool(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| bool(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| bool(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( d(X12)
| ~ d(X13)
| forallprefers(X12,X13) )
& ( ~ d(X12)
| ~ d(X13)
| bool(X12)
| ~ bool(X13)
| forallprefers(X12,X13) )
& ( X12 != false
| X13 != true
| forallprefers(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
fof(c_0_32,plain,
! [X11] :
( ( ~ bool(X11)
| X11 = false
| X11 = true )
& ( X11 != false
| bool(X11) )
& ( X11 != true
| bool(X11) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_bool])])]) ).
cnf(c_0_33,plain,
false2 = phi(f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,plain,
( bool(esk7_0)
| ~ forallprefers(lazy_impl(true,X1),true)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( lazy_impl(true,X1) = X1
| ~ d(X1) ),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( forallprefers(X1,X2)
| X1 != false
| X2 != true ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( bool(X1)
| X1 != false ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
false2 = lazy_impl(true,lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_30]),c_0_16]) ).
cnf(c_0_39,plain,
( bool(esk7_0)
| ~ forallprefers(X1,true)
| ~ d(X1)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
forallprefers(false,true),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_36])]) ).
cnf(c_0_41,plain,
d(false),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_42,plain,
bool(false),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
( lazy_impl(true,lazy_impl(true,esk7_0)) = false2
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_28]) ).
cnf(c_0_44,plain,
bool(esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_45,plain,
lazy_impl(true,lazy_impl(true,esk7_0)) = false2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_46,plain,
( X1 = false
| X1 = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_47,negated_conjecture,
false1 != false2,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[false1_false2])]) ).
cnf(c_0_48,plain,
( ~ forallprefers(lazy_impl(true,X1),lazy_impl(prop(esk7_0),esk7_0))
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_49,plain,
( lazy_impl(true,esk7_0) = false2
| ~ d(esk7_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_50,plain,
( esk7_0 = true
| esk7_0 = false ),
inference(spm,[status(thm)],[c_0_46,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
false1 != false2,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,plain,
false1 = false,
inference(split_conjunct,[status(thm)],[def_false1]) ).
cnf(c_0_53,plain,
( ~ forallprefers(lazy_impl(true,X1),lazy_impl(true,esk7_0))
| ~ bool(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_28]),c_0_44])]) ).
cnf(c_0_54,plain,
( lazy_impl(true,false) = false2
| esk7_0 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_41])]) ).
cnf(c_0_55,negated_conjecture,
false2 != false,
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( ~ forallprefers(lazy_impl(true,X1),esk7_0)
| ~ d(esk7_0)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_35]) ).
cnf(c_0_57,plain,
esk7_0 = true,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_54]),c_0_41])]),c_0_55]) ).
cnf(c_0_58,plain,
d(true),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_59,plain,
( ~ forallprefers(lazy_impl(true,X1),true)
| ~ bool(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_57]),c_0_58])]) ).
cnf(c_0_60,plain,
( ~ forallprefers(X1,true)
| ~ d(X1)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_35]) ).
cnf(c_0_61,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_40]),c_0_41]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWW101+1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n006.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 22:21:55 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.Z6EmN7MBqq/E---3.1_24201.p
% 0.13/0.42 # Version: 3.1pre001
% 0.13/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 # Starting sh5l with 300s (1) cores
% 0.13/0.42 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24285 completed with status 0
% 0.13/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 # No SInE strategy applied
% 0.13/0.42 # Search class: FGHSS-FFMM21-DFFFFFNN
% 0.13/0.42 # partial match(1): FGHSS-FFMM21-SFFFFFNN
% 0.13/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 811s (1) cores
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.42 # Starting new_bool_3 with 136s (1) cores
% 0.13/0.42 # Starting new_bool_1 with 136s (1) cores
% 0.13/0.42 # Starting sh5l with 136s (1) cores
% 0.13/0.42 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 24291 completed with status 0
% 0.13/0.42 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.13/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 # No SInE strategy applied
% 0.13/0.42 # Search class: FGHSS-FFMM21-DFFFFFNN
% 0.13/0.42 # partial match(1): FGHSS-FFMM21-SFFFFFNN
% 0.13/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 811s (1) cores
% 0.13/0.42 # Preprocessing time : 0.001 s
% 0.13/0.42 # Presaturation interreduction done
% 0.13/0.42
% 0.13/0.42 # Proof found!
% 0.13/0.42 # SZS status Theorem
% 0.13/0.42 # SZS output start CNFRefutation
% See solution above
% 0.13/0.42 # Parsed axioms : 45
% 0.13/0.42 # Removed by relevancy pruning/SinE : 0
% 0.13/0.42 # Initial clauses : 99
% 0.13/0.42 # Removed in clause preprocessing : 19
% 0.13/0.42 # Initial clauses in saturation : 80
% 0.13/0.42 # Processed clauses : 286
% 0.13/0.42 # ...of these trivial : 2
% 0.13/0.42 # ...subsumed : 70
% 0.13/0.42 # ...remaining for further processing : 214
% 0.13/0.42 # Other redundant clauses eliminated : 8
% 0.13/0.42 # Clauses deleted for lack of memory : 0
% 0.13/0.42 # Backward-subsumed : 20
% 0.13/0.42 # Backward-rewritten : 46
% 0.13/0.42 # Generated clauses : 565
% 0.13/0.42 # ...of the previous two non-redundant : 465
% 0.13/0.42 # ...aggressively subsumed : 0
% 0.13/0.42 # Contextual simplify-reflections : 7
% 0.13/0.42 # Paramodulations : 552
% 0.13/0.42 # Factorizations : 7
% 0.13/0.42 # NegExts : 0
% 0.13/0.42 # Equation resolutions : 8
% 0.13/0.42 # Total rewrite steps : 298
% 0.13/0.42 # Propositional unsat checks : 0
% 0.13/0.42 # Propositional check models : 0
% 0.13/0.42 # Propositional check unsatisfiable : 0
% 0.13/0.42 # Propositional clauses : 0
% 0.13/0.42 # Propositional clauses after purity: 0
% 0.13/0.42 # Propositional unsat core size : 0
% 0.13/0.42 # Propositional preprocessing time : 0.000
% 0.13/0.42 # Propositional encoding time : 0.000
% 0.13/0.42 # Propositional solver time : 0.000
% 0.13/0.42 # Success case prop preproc time : 0.000
% 0.13/0.42 # Success case prop encoding time : 0.000
% 0.13/0.42 # Success case prop solver time : 0.000
% 0.13/0.42 # Current number of processed clauses : 80
% 0.13/0.42 # Positive orientable unit clauses : 18
% 0.13/0.42 # Positive unorientable unit clauses: 0
% 0.13/0.42 # Negative unit clauses : 13
% 0.13/0.42 # Non-unit-clauses : 49
% 0.13/0.42 # Current number of unprocessed clauses: 313
% 0.13/0.42 # ...number of literals in the above : 824
% 0.13/0.42 # Current number of archived formulas : 0
% 0.13/0.42 # Current number of archived clauses : 144
% 0.13/0.42 # Clause-clause subsumption calls (NU) : 1596
% 0.13/0.42 # Rec. Clause-clause subsumption calls : 1273
% 0.13/0.42 # Non-unit clause-clause subsumptions : 75
% 0.13/0.42 # Unit Clause-clause subsumption calls : 109
% 0.13/0.42 # Rewrite failures with RHS unbound : 0
% 0.13/0.42 # BW rewrite match attempts : 6
% 0.13/0.42 # BW rewrite match successes : 6
% 0.13/0.42 # Condensation attempts : 0
% 0.13/0.42 # Condensation successes : 0
% 0.13/0.42 # Termbank termtop insertions : 10813
% 0.13/0.42
% 0.13/0.42 # -------------------------------------------------
% 0.13/0.42 # User time : 0.015 s
% 0.13/0.42 # System time : 0.000 s
% 0.13/0.42 # Total time : 0.015 s
% 0.13/0.42 # Maximum resident set size: 1980 pages
% 0.13/0.42
% 0.13/0.42 # -------------------------------------------------
% 0.13/0.42 # User time : 0.060 s
% 0.13/0.42 # System time : 0.004 s
% 0.13/0.42 # Total time : 0.064 s
% 0.13/0.42 # Maximum resident set size: 1724 pages
% 0.13/0.42 % E---3.1 exiting
% 0.13/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------