TSTP Solution File: SWC172-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC172-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Tue May 21 04:28:06 EDT 2024
% Result : Unsatisfiable 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 21
% Syntax : Number of clauses : 70 ( 30 unt; 13 nHn; 70 RR)
% Number of literals : 190 ( 36 equ; 113 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
~ neq(sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(co1_11,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause181,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(clause183,axiom,
( lt(X2,X4)
| lt(X4,X2)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause183) ).
cnf(co1_18,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_14,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause63,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause63) ).
cnf(clause5,axiom,
strictorderP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause5) ).
cnf(c_0_21,negated_conjecture,
~ neq(sk5,sk6),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_22,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_23,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_11 ).
cnf(c_0_24,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_25,negated_conjecture,
~ neq(sk5,sk6),
c_0_21 ).
cnf(c_0_26,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_28,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_29,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk3,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_31,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_32,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk5,nil)),sk8) = sk3,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_31 ).
cnf(c_0_34,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_35,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_36,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_37,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_35 ).
cnf(c_0_38,axiom,
ssList(nil),
clause8 ).
cnf(c_0_39,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_40,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
| ~ ssList(app(sk7,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_27]),c_0_38])]) ).
cnf(c_0_41,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_39 ).
cnf(c_0_42,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_43,plain,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
inference(fof_simplification,[status(thm)],[clause181]) ).
cnf(c_0_44,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_45,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_46,plain,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
c_0_43 ).
cnf(c_0_47,negated_conjecture,
app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_37]),c_0_27]),c_0_38])]) ).
cnf(c_0_48,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_45 ).
cnf(c_0_49,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_50,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_51,plain,
( lt(X2,X4)
| lt(X4,X2)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderP(X6)
| ~ ssList(X6) ),
inference(fof_simplification,[status(thm)],[clause183]) ).
cnf(c_0_52,plain,
( lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
app(app(sk7,cons(sk5,nil)),cons(sk5,sk8)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_27]),c_0_34])]) ).
cnf(c_0_54,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_49,c_0_24]) ).
cnf(c_0_55,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_50 ).
cnf(c_0_56,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
co1_18 ).
cnf(c_0_57,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
co1_14 ).
cnf(c_0_58,plain,
( lt(X2,X4)
| lt(X4,X2)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderP(X6)
| ~ ssList(X6) ),
c_0_51 ).
cnf(c_0_59,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause63]) ).
cnf(c_0_60,negated_conjecture,
( lt(sk5,sk5)
| ~ strictorderedP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_27]),c_0_54]),c_0_34]),c_0_38]),c_0_42])]) ).
cnf(c_0_61,negated_conjecture,
( sk3 = nil
| strictorderedP(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_62,plain,
( lt(X1,X2)
| lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderP(app(app(X3,cons(X2,X4)),cons(X1,X5))) ),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_63,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
c_0_59 ).
cnf(c_0_64,negated_conjecture,
( sk3 = nil
| lt(sk5,sk5) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( lt(sk5,sk5)
| ~ strictorderP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_53]),c_0_27]),c_0_54]),c_0_34]),c_0_38]),c_0_42])]) ).
cnf(c_0_66,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_27])]) ).
cnf(c_0_67,axiom,
strictorderP(nil),
clause5 ).
cnf(c_0_68,negated_conjecture,
lt(sk5,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_68]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC172-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 02:39:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.56 # Version: 3.1.0
% 0.19/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.56 # Starting sh5l with 300s (1) cores
% 0.19/0.56 # sh5l with pid 6578 completed with status 0
% 0.19/0.56 # Result found by sh5l
% 0.19/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.56 # Starting sh5l with 300s (1) cores
% 0.19/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.56 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.19/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 6586 completed with status 0
% 0.19/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.19/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.56 # Starting sh5l with 300s (1) cores
% 0.19/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.56 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.19/0.56 # Preprocessing time : 0.003 s
% 0.19/0.56 # Presaturation interreduction done
% 0.19/0.56
% 0.19/0.56 # Proof found!
% 0.19/0.56 # SZS status Unsatisfiable
% 0.19/0.56 # SZS output start CNFRefutation
% See solution above
% 0.19/0.56 # Parsed axioms : 205
% 0.19/0.56 # Removed by relevancy pruning/SinE : 33
% 0.19/0.56 # Initial clauses : 172
% 0.19/0.56 # Removed in clause preprocessing : 0
% 0.19/0.56 # Initial clauses in saturation : 172
% 0.19/0.56 # Processed clauses : 754
% 0.19/0.56 # ...of these trivial : 14
% 0.19/0.56 # ...subsumed : 155
% 0.19/0.56 # ...remaining for further processing : 585
% 0.19/0.56 # Other redundant clauses eliminated : 42
% 0.19/0.56 # Clauses deleted for lack of memory : 0
% 0.19/0.56 # Backward-subsumed : 17
% 0.19/0.56 # Backward-rewritten : 201
% 0.19/0.56 # Generated clauses : 1743
% 0.19/0.56 # ...of the previous two non-redundant : 1680
% 0.19/0.56 # ...aggressively subsumed : 0
% 0.19/0.56 # Contextual simplify-reflections : 60
% 0.19/0.56 # Paramodulations : 1697
% 0.19/0.56 # Factorizations : 0
% 0.19/0.56 # NegExts : 0
% 0.19/0.56 # Equation resolutions : 47
% 0.19/0.56 # Disequality decompositions : 0
% 0.19/0.56 # Total rewrite steps : 1845
% 0.19/0.56 # ...of those cached : 1771
% 0.19/0.56 # Propositional unsat checks : 0
% 0.19/0.56 # Propositional check models : 0
% 0.19/0.56 # Propositional check unsatisfiable : 0
% 0.19/0.56 # Propositional clauses : 0
% 0.19/0.56 # Propositional clauses after purity: 0
% 0.19/0.56 # Propositional unsat core size : 0
% 0.19/0.56 # Propositional preprocessing time : 0.000
% 0.19/0.56 # Propositional encoding time : 0.000
% 0.19/0.56 # Propositional solver time : 0.000
% 0.19/0.56 # Success case prop preproc time : 0.000
% 0.19/0.56 # Success case prop encoding time : 0.000
% 0.19/0.56 # Success case prop solver time : 0.000
% 0.19/0.56 # Current number of processed clauses : 183
% 0.19/0.56 # Positive orientable unit clauses : 49
% 0.19/0.56 # Positive unorientable unit clauses: 0
% 0.19/0.56 # Negative unit clauses : 1
% 0.19/0.56 # Non-unit-clauses : 133
% 0.19/0.56 # Current number of unprocessed clauses: 1256
% 0.19/0.56 # ...number of literals in the above : 6444
% 0.19/0.56 # Current number of archived formulas : 0
% 0.19/0.56 # Current number of archived clauses : 382
% 0.19/0.56 # Clause-clause subsumption calls (NU) : 20855
% 0.19/0.56 # Rec. Clause-clause subsumption calls : 7256
% 0.19/0.56 # Non-unit clause-clause subsumptions : 232
% 0.19/0.56 # Unit Clause-clause subsumption calls : 625
% 0.19/0.56 # Rewrite failures with RHS unbound : 0
% 0.19/0.56 # BW rewrite match attempts : 44
% 0.19/0.56 # BW rewrite match successes : 20
% 0.19/0.56 # Condensation attempts : 0
% 0.19/0.56 # Condensation successes : 0
% 0.19/0.56 # Termbank termtop insertions : 42461
% 0.19/0.56 # Search garbage collected termcells : 624
% 0.19/0.56
% 0.19/0.56 # -------------------------------------------------
% 0.19/0.56 # User time : 0.068 s
% 0.19/0.56 # System time : 0.006 s
% 0.19/0.56 # Total time : 0.074 s
% 0.19/0.56 # Maximum resident set size: 2236 pages
% 0.19/0.56
% 0.19/0.56 # -------------------------------------------------
% 0.19/0.56 # User time : 0.071 s
% 0.19/0.56 # System time : 0.009 s
% 0.19/0.56 # Total time : 0.080 s
% 0.19/0.56 # Maximum resident set size: 1880 pages
% 0.19/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------