TSTP Solution File: LCL875-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL875-1 : TPTP v8.2.0. Bugfixed v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 00:04:00 EDT 2024
% Result : Unsatisfiable 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of clauses : 40 ( 16 unt; 0 nHn; 27 RR)
% Number of literals : 84 ( 0 equ; 59 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 24 ( 24 usr; 23 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(c,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
cnf(b,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b) ).
cnf(i,axiom,
is_a_theorem(implies(X1,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',i) ).
cnf(prove_rezus,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(implies(y,y),implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w))))),w)),implies(implies(implies(implies(implies(v6,v7),implies(implies(v7,v8),implies(v6,v8))),implies(implies(implies(implies(implies(v9,implies(v9,v10)),implies(v9,v10)),implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14)),v14),v15)),v15),implies(implies(v16,implies(implies(implies(v17,v17),implies(implies(v18,v18),implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))))),v21)),v22))),v22)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_rezus) ).
cnf(w,axiom,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',w) ).
cnf(c_0_6,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_7,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_6 ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
c ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
b ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,X1)),
i ).
cnf(c_0_12,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(implies(y,y),implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w))))),w)),implies(implies(implies(implies(implies(v6,v7),implies(implies(v7,v8),implies(v6,v8))),implies(implies(implies(implies(implies(v9,implies(v9,v10)),implies(v9,v10)),implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14)),v14),v15)),v15),implies(implies(v16,implies(implies(implies(v17,v17),implies(implies(v18,v18),implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))))),v21)),v22))),v22)),
inference(fof_simplification,[status(thm)],[prove_rezus]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(implies(y,y),implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w))))),w)),implies(implies(implies(implies(implies(v6,v7),implies(implies(v7,v8),implies(v6,v8))),implies(implies(implies(implies(implies(v9,implies(v9,v10)),implies(v9,v10)),implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14)),v14),v15)),v15),implies(implies(v16,implies(implies(implies(v17,v17),implies(implies(v18,v18),implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))))),v21)),v22))),v22)),
c_0_14 ).
cnf(c_0_18,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(implies(implies(implies(v6,v7),implies(implies(v7,v8),implies(v6,v8))),implies(implies(implies(implies(implies(v9,implies(v9,v10)),implies(v9,v10)),implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14)),v14),v15)),v15),implies(implies(v16,implies(implies(implies(v17,v17),implies(implies(v18,v18),implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))))),v21)),v22)),v22))
| ~ is_a_theorem(implies(x,implies(implies(implies(y,y),implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w))))),w))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(implies(v6,v7),implies(implies(v7,v8),implies(v6,v8))),implies(implies(implies(implies(implies(v9,implies(v9,v10)),implies(v9,v10)),implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14)),v14),v15)),v15))
| ~ is_a_theorem(implies(implies(implies(v16,implies(implies(implies(v17,v17),implies(implies(v18,v18),implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))))),v21)),v22),v22))
| ~ is_a_theorem(implies(x,implies(implies(implies(y,y),implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w))))),w))) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_22,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(implies(implies(implies(v9,implies(v9,v10)),implies(v9,v10)),implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14)),v14),v15),v15))
| ~ is_a_theorem(implies(implies(implies(v16,implies(implies(implies(v17,v17),implies(implies(v18,v18),implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))))),v21)),v22),v22))
| ~ is_a_theorem(implies(x,implies(implies(implies(y,y),implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w))))),w))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_21])]) ).
cnf(c_0_23,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(v16,implies(implies(implies(v17,v17),implies(implies(v18,v18),implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))))),v21)),v22),v22))
| ~ is_a_theorem(implies(implies(implies(implies(v9,implies(v9,v10)),implies(v9,v10)),implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14)),v14))
| ~ is_a_theorem(implies(x,implies(implies(implies(y,y),implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w))))),w))) ),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(implies(v9,implies(v9,v10)),implies(v9,v10)),implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14)),v14))
| ~ is_a_theorem(implies(x,implies(implies(implies(y,y),implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w))))),w)))
| ~ is_a_theorem(implies(v16,implies(implies(implies(v17,v17),implies(implies(v18,v18),implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))))),v21))) ),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_25,axiom,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
w ).
cnf(c_0_26,negated_conjecture,
( ~ is_a_theorem(implies(x,implies(implies(implies(y,y),implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w))))),w)))
| ~ is_a_theorem(implies(v16,implies(implies(implies(v17,v17),implies(implies(v18,v18),implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))))),v21)))
| ~ is_a_theorem(implies(implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14),v14)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18]),c_0_25])]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X4)))
| ~ is_a_theorem(implies(X3,implies(X1,X4)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( ~ is_a_theorem(implies(x,implies(implies(implies(y,y),implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w))))),w)))
| ~ is_a_theorem(implies(implies(implies(v18,v18),implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21)))),implies(v16,v21)))
| ~ is_a_theorem(implies(implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14),v14)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_11])]) ).
cnf(c_0_29,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_18]) ).
cnf(c_0_30,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(v18,v18),implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21)))),implies(v16,v21)))
| ~ is_a_theorem(implies(implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w)))),implies(x,w)))
| ~ is_a_theorem(implies(implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14),v14)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_11])]) ).
cnf(c_0_31,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X3),X1))
| ~ is_a_theorem(implies(X2,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(z,z),implies(implies(u,u),implies(implies(v,v),implies(x,w)))),implies(x,w)))
| ~ is_a_theorem(implies(implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14),v14))
| ~ is_a_theorem(implies(implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))),implies(v16,v21))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_18]),c_0_11])]) ).
cnf(c_0_33,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,implies(X2,X3)))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_34,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(implies(v11,v12),implies(implies(v12,v13),implies(v11,v13))),v14),v14))
| ~ is_a_theorem(implies(implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))),implies(v16,v21)))
| ~ is_a_theorem(implies(implies(implies(u,u),implies(implies(v,v),implies(x,w))),implies(x,w))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_18]),c_0_11])]) ).
cnf(c_0_35,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_9]),c_0_11])]) ).
cnf(c_0_36,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(v19,v19),implies(implies(v20,v20),implies(v16,v21))),implies(v16,v21)))
| ~ is_a_theorem(implies(implies(implies(u,u),implies(implies(v,v),implies(x,w))),implies(x,w))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_16]),c_0_21])]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_35,c_0_13]) ).
cnf(c_0_38,negated_conjecture,
~ is_a_theorem(implies(implies(implies(u,u),implies(implies(v,v),implies(x,w))),implies(x,w))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_18]),c_0_37]),c_0_11])]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_18]),c_0_37]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LCL875-1 : TPTP v8.2.0. Bugfixed v5.5.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 03:25:37 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.16/0.46 # Version: 3.1.0
% 0.16/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # new_bool_3 with pid 23109 completed with status 0
% 0.16/0.46 # Result found by new_bool_3
% 0.16/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FHUNM-FFSF22-DFFFFFNN
% 0.16/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.46 # SAT001_MinMin_p005000_rr_RG with pid 23112 completed with status 0
% 0.16/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FHUNM-FFSF22-DFFFFFNN
% 0.16/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Unsatisfiable
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 6
% 0.16/0.46 # Removed by relevancy pruning/SinE : 0
% 0.16/0.46 # Initial clauses : 6
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 6
% 0.16/0.46 # Processed clauses : 167
% 0.16/0.46 # ...of these trivial : 1
% 0.16/0.46 # ...subsumed : 89
% 0.16/0.46 # ...remaining for further processing : 77
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 2
% 0.16/0.46 # Backward-rewritten : 0
% 0.16/0.46 # Generated clauses : 581
% 0.16/0.46 # ...of the previous two non-redundant : 523
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 0
% 0.16/0.46 # Paramodulations : 581
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 0
% 0.16/0.46 # Disequality decompositions : 0
% 0.16/0.46 # Total rewrite steps : 65
% 0.16/0.46 # ...of those cached : 36
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 69
% 0.16/0.46 # Positive orientable unit clauses : 11
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 2
% 0.16/0.46 # Non-unit-clauses : 56
% 0.16/0.46 # Current number of unprocessed clauses: 368
% 0.16/0.46 # ...number of literals in the above : 1030
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 8
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 2257
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 1388
% 0.16/0.46 # Non-unit clause-clause subsumptions : 90
% 0.16/0.46 # Unit Clause-clause subsumption calls : 12
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 109
% 0.16/0.46 # BW rewrite match successes : 0
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 8179
% 0.16/0.46 # Search garbage collected termcells : 8
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.015 s
% 0.16/0.46 # System time : 0.000 s
% 0.16/0.46 # Total time : 0.015 s
% 0.16/0.46 # Maximum resident set size: 1640 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.017 s
% 0.16/0.46 # System time : 0.001 s
% 0.16/0.46 # Total time : 0.018 s
% 0.16/0.46 # Maximum resident set size: 1712 pages
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------