TSTP Solution File: CSR021+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR021+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:13:10 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 361 ( 187 equ)
% Maximal formula atoms : 149 ( 11 avg)
% Number of connectives : 447 ( 118 ~; 229 |; 92 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(happens_terminates_not_holds,axiom,
! [X4,X5,X2] :
( ( happens(X4,X5)
& terminates(X4,X2,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
fof(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(terminates_all_defn,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) )
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).
fof(plus1_2,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2) ).
fof(happens_all_defn,axiom,
! [X4,X5] :
( happens(X4,X5)
<=> ( ( X4 = push
& X5 = n0 )
| ( X4 = pull
& X5 = n1 )
| ( X4 = pull
& X5 = n2 )
| ( X4 = push
& X5 = n2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(not_backwards_3,conjecture,
~ holdsAt(backwards,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_3) ).
fof(c_0_6,plain,
! [X4,X5,X2] :
( ( happens(X4,X5)
& terminates(X4,X2,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
inference(fof_simplification,[status(thm)],[happens_terminates_not_holds]) ).
fof(c_0_7,plain,
! [X22,X23,X24] :
( ~ happens(X22,X23)
| ~ terminates(X22,X24,X23)
| ~ holdsAt(X24,plus(X23,n1)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X40,X41] : plus(X40,X41) = plus(X41,X40),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_9,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) )
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
introduced(definition) ).
fof(c_0_10,plain,
! [X2,X4,X5] :
( epred2_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) ) ) ),
introduced(definition) ).
cnf(c_0_11,plain,
( ~ happens(X1,X2)
| ~ terminates(X1,X3,X2)
| ~ holdsAt(X3,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> epred3_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[terminates_all_defn]),c_0_9]) ).
fof(c_0_14,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( epred2_3(X5,X4,X2)
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
inference(apply_def,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( ~ holdsAt(X1,plus(n1,X2))
| ~ terminates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
plus(n1,n2) = n3,
inference(split_conjunct,[status(thm)],[plus1_2]) ).
fof(c_0_17,plain,
! [X30,X31,X32] :
( ( ~ terminates(X30,X31,X32)
| epred3_3(X32,X30,X31) )
& ( ~ epred3_3(X32,X30,X31)
| terminates(X30,X31,X32) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_18,plain,
! [X55,X56,X57] :
( ( X56 = pull
| X56 = push
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X56 = push
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X56 = push
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| X55 = spinning
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X55 = spinning
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X55 = spinning
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| ~ happens(pull,X57)
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| ~ happens(pull,X57)
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| ~ happens(pull,X57)
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| X56 = push
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X56 = push
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X56 = push
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| X55 = spinning
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X55 = spinning
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X55 = spinning
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| ~ happens(pull,X57)
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| ~ happens(pull,X57)
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| ~ happens(pull,X57)
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| X56 = push
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X56 = push
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X56 = push
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| X55 = spinning
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X55 = spinning
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X55 = spinning
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| ~ happens(pull,X57)
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| ~ happens(pull,X57)
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| ~ happens(pull,X57)
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ epred2_3(X57,X56,X55)
| epred3_3(X57,X56,X55) )
& ( X56 != pull
| X55 != backwards
| ~ happens(push,X57)
| epred3_3(X57,X56,X55) )
& ( X56 != push
| X55 != spinning
| happens(pull,X57)
| epred3_3(X57,X56,X55) )
& ( X56 != pull
| X55 != spinning
| happens(push,X57)
| epred3_3(X57,X56,X55) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_19,plain,
! [X47,X48] :
( ( X47 = push
| X47 = pull
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 != push
| X48 != n0
| happens(X47,X48) )
& ( X47 != pull
| X48 != n1
| happens(X47,X48) )
& ( X47 != pull
| X48 != n2
| happens(X47,X48) )
& ( X47 != push
| X48 != n2
| happens(X47,X48) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])]) ).
cnf(c_0_20,plain,
( ~ holdsAt(X1,n3)
| ~ terminates(X2,X1,n2)
| ~ happens(X2,n2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( terminates(X2,X3,X1)
| ~ epred3_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( epred3_3(X3,X1,X2)
| X1 != pull
| X2 != backwards
| ~ happens(push,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,negated_conjecture,
holdsAt(backwards,n3),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[not_backwards_3])]) ).
cnf(c_0_24,plain,
( happens(X1,X2)
| X1 != pull
| X2 != n2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( happens(X1,X2)
| X1 != push
| X2 != n2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ epred3_3(n2,X1,X2)
| ~ holdsAt(X2,n3)
| ~ happens(X1,n2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( epred3_3(X1,pull,backwards)
| ~ happens(push,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])]) ).
cnf(c_0_28,negated_conjecture,
holdsAt(backwards,n3),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
happens(pull,n2),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_24])]) ).
cnf(c_0_30,plain,
happens(push,n2),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_25])]) ).
cnf(c_0_31,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR021+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 00:54:52 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_1 with pid 10949 completed with status 0
% 0.19/0.49 # Result found by new_bool_1
% 0.19/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSF-FSLM22-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.19/0.49 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 10951 completed with status 0
% 0.19/0.49 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.19/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSF-FSLM22-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.002 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 48
% 0.19/0.49 # Removed by relevancy pruning/SinE : 17
% 0.19/0.49 # Initial clauses : 154
% 0.19/0.49 # Removed in clause preprocessing : 9
% 0.19/0.49 # Initial clauses in saturation : 145
% 0.19/0.49 # Processed clauses : 272
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 84
% 0.19/0.49 # ...remaining for further processing : 188
% 0.19/0.49 # Other redundant clauses eliminated : 45
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 1
% 0.19/0.49 # Backward-rewritten : 2
% 0.19/0.49 # Generated clauses : 122
% 0.19/0.49 # ...of the previous two non-redundant : 82
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 3
% 0.19/0.49 # Paramodulations : 52
% 0.19/0.49 # Factorizations : 38
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 45
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 13
% 0.19/0.49 # ...of those cached : 2
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 89
% 0.19/0.49 # Positive orientable unit clauses : 15
% 0.19/0.49 # Positive unorientable unit clauses: 1
% 0.19/0.49 # Negative unit clauses : 16
% 0.19/0.49 # Non-unit-clauses : 57
% 0.19/0.49 # Current number of unprocessed clauses: 36
% 0.19/0.49 # ...number of literals in the above : 129
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 84
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 876
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 537
% 0.19/0.49 # Non-unit clause-clause subsumptions : 73
% 0.19/0.49 # Unit Clause-clause subsumption calls : 38
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 26
% 0.19/0.49 # BW rewrite match successes : 25
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 7397
% 0.19/0.49 # Search garbage collected termcells : 1356
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.015 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.018 s
% 0.19/0.49 # Maximum resident set size: 2100 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.016 s
% 0.19/0.49 # System time : 0.006 s
% 0.19/0.49 # Total time : 0.022 s
% 0.19/0.49 # Maximum resident set size: 1748 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------