%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP072-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:37:47 PM UTC 2026
% Result : Unsatisfiable 1.76s 0.83s
% Output : CNFRefutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 3
% Syntax : Number of clauses : 61 ( 55 unt; 0 nHn; 8 RR)
% Number of literals : 71 ( 70 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 183 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
single_axiom ).
cnf(c_0_4,plain,
divide(divide(inverse(X1),divide(divide(X2,X3),divide(inverse(divide(X4,X1)),divide(divide(X5,X6),X4)))),divide(X3,X2)) = divide(X6,X5),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(divide(X2,X1),divide(inverse(divide(X4,X3)),divide(divide(X5,X6),X4))))) = divide(X5,X6),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(divide(X2,X1),divide(inverse(divide(X4,X3)),divide(X5,X4))))) = X5,
inference(spm,[status(thm)],[c_0_5,c_0_3]) ).
cnf(c_0_7,plain,
divide(divide(divide(divide(divide(X1,X2),inverse(divide(X2,X3))),X4),inverse(divide(X4,X5))),divide(inverse(X3),X5)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_3]) ).
cnf(c_0_8,plain,
divide(divide(X1,inverse(divide(divide(inverse(X2),X3),X4))),divide(inverse(X3),X4)) = divide(divide(X1,X5),inverse(divide(X5,X2))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_9,plain,
divide(divide(divide(divide(divide(X1,X2),inverse(divide(X2,X3))),divide(inverse(X4),X3)),X5),inverse(divide(X5,X4))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
divide(divide(inverse(divide(divide(X1,X2),X3)),X4),divide(divide(divide(X2,X1),X5),inverse(divide(X5,X4)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_11,plain,
divide(divide(X1,X2),inverse(divide(X2,X3))) = divide(divide(X1,X4),inverse(divide(X4,X3))),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_12,plain,
divide(divide(divide(divide(divide(X1,divide(inverse(X2),X3)),X4),inverse(divide(X4,X2))),X5),inverse(divide(X5,X3))) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_13,plain,
divide(divide(inverse(X1),divide(divide(X2,X3),divide(inverse(divide(divide(X4,X5),X1)),X6))),divide(X3,X2)) = divide(divide(divide(X5,X4),X7),inverse(divide(X7,X6))),
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_14,plain,
divide(divide(inverse(divide(inverse(divide(X1,X2)),X3)),divide(divide(X4,X5),inverse(divide(X5,X2)))),divide(X1,X4)) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_15,plain,
divide(X1,inverse(divide(inverse(divide(divide(inverse(X2),X3),X4)),X2))) = divide(X1,divide(inverse(X3),X4)),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_16,plain,
divide(divide(divide(X1,X2),X3),inverse(divide(X3,divide(divide(X4,X5),divide(X2,X1))))) = divide(X5,X4),
inference(spm,[status(thm)],[c_0_4,c_0_13]) ).
cnf(c_0_17,plain,
inverse(divide(inverse(divide(divide(inverse(X1),X2),X3)),X1)) = divide(inverse(X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_14]) ).
cnf(c_0_18,plain,
divide(inverse(divide(X1,divide(divide(X2,X3),divide(X4,X5)))),divide(divide(X5,X4),X1)) = divide(X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_16]),c_0_4]) ).
cnf(c_0_19,plain,
inverse(divide(inverse(X1),divide(X2,X1))) = divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)),
inference(spm,[status(thm)],[c_0_17,c_0_3]) ).
cnf(c_0_20,plain,
divide(inverse(divide(X1,divide(X2,divide(X3,X4)))),divide(divide(X4,X3),X1)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_21,plain,
inverse(divide(inverse(X1),divide(X2,X1))) = inverse(divide(inverse(X3),divide(X2,X3))),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_22,plain,
divide(inverse(divide(inverse(X1),divide(X2,X1))),divide(divide(X3,X4),inverse(divide(X4,X3)))) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
divide(inverse(divide(X1,X2)),divide(divide(X3,divide(X4,X5)),X1)) = inverse(divide(X3,divide(X2,divide(X5,X4)))),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_24,plain,
inverse(divide(X1,divide(divide(X2,divide(divide(X3,X4),X1)),divide(X4,X3)))) = X2,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
divide(inverse(divide(X1,X2)),divide(X3,X1)) = divide(inverse(divide(X4,X2)),divide(X3,X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_4]) ).
cnf(c_0_26,plain,
inverse(inverse(divide(X1,divide(X2,divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23]) ).
cnf(c_0_27,plain,
inverse(inverse(divide(X1,divide(X2,inverse(divide(inverse(X3),divide(X2,X3))))))) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_28,plain,
inverse(inverse(divide(X1,divide(inverse(divide(X2,X3)),divide(X3,X2))))) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_29,plain,
inverse(inverse(divide(inverse(X1),divide(inverse(divide(X2,X3)),X1)))) = inverse(divide(X3,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_30,plain,
inverse(divide(divide(X1,X2),inverse(X2))) = inverse(divide(divide(X1,X3),inverse(X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_29]) ).
cnf(c_0_31,plain,
divide(inverse(X1),inverse(X1)) = divide(inverse(X2),inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_30]),c_0_17]) ).
cnf(c_0_32,plain,
divide(inverse(X1),inverse(X1)) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_33,plain,
divide(X1,X1) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_32,c_0_32]) ).
cnf(c_0_34,plain,
inverse(inverse(divide(X1,divide(inverse(divide(X2,X2)),divide(X3,X3))))) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_35,plain,
divide(divide(X1,X2),inverse(divide(X2,divide(X3,X3)))) = inverse(inverse(X1)),
inference(spm,[status(thm)],[c_0_34,c_0_6]) ).
cnf(c_0_36,plain,
inverse(inverse(divide(X1,X2))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_35]) ).
cnf(c_0_37,plain,
divide(X1,divide(inverse(divide(X2,X2)),divide(X3,X3))) = X1,
inference(rw,[status(thm)],[c_0_34,c_0_36]) ).
cnf(c_0_38,plain,
inverse(divide(inverse(divide(divide(X1,X1),X2)),X3)) = divide(inverse(inverse(X3)),X2),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_39,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_22]) ).
cnf(c_0_40,plain,
divide(X1,inverse(divide(X2,X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_37]),c_0_37]) ).
cnf(c_0_41,plain,
inverse(divide(inverse(divide(divide(X1,X1),X2)),X3)) = divide(X3,X2),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
divide(X1,divide(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_40]),c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_44,plain,
divide(inverse(divide(divide(X1,X1),X2)),X3) = inverse(divide(X3,X2)),
inference(spm,[status(thm)],[c_0_39,c_0_41]) ).
cnf(c_0_45,plain,
divide(divide(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_42]),c_0_35]),c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
c_0_43 ).
cnf(c_0_47,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_48,plain,
inverse(divide(X1,inverse(X2))) = divide(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1))
| divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_47]),c_0_47]),c_0_47]),c_0_47]),c_0_47]),c_0_47]),c_0_47]) ).
cnf(c_0_50,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_48,c_0_39]) ).
cnf(c_0_51,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_39]) ).
cnf(c_0_52,negated_conjecture,
( divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ),
inference(sr,[status(thm)],[c_0_49,c_0_31]) ).
cnf(c_0_53,plain,
divide(X1,divide(X2,divide(inverse(X1),X3))) = divide(inverse(X3),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_50]),c_0_50]) ).
cnf(c_0_54,plain,
divide(X1,divide(X2,inverse(X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)) ),
inference(rw,[status(thm)],[c_0_52,c_0_48]) ).
cnf(c_0_56,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_50,c_0_42]) ).
cnf(c_0_57,plain,
divide(X1,divide(X2,inverse(X3))) = divide(divide(X1,X3),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_39]),c_0_50]) ).
cnf(c_0_58,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56]),c_0_39])]) ).
cnf(c_0_59,plain,
divide(divide(X1,inverse(X2)),X3) = divide(X1,divide(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_57]),c_0_50]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP072-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 19:56:22 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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/benchmark/theBenchmark.p
% 1.76/0.83 % Version: 3.5.1
% 1.76/0.83 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.76/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.76/0.83 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.76/0.83 % Starting new_bool_3 with 300s (1) cores
% 1.76/0.83 % Starting new_bool_1 with 300s (1) cores
% 1.76/0.83 % Starting sh5l with 300s (1) cores
% 1.76/0.83 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3276382 completed with status 0
% 1.76/0.83 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.76/0.83 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.76/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.76/0.83 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.76/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.76/0.83 % No SInE strategy applied
% 1.76/0.83 % Search class: FUHPF-FFSF21-MFFFFFNN
% 1.76/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.76/0.83 % Starting SubtermCWHack with 136s (1) cores
% 1.76/0.83 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.76/0.83 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.76/0.83 % Starting new_bool_3 with 136s (1) cores
% 1.76/0.83 % Starting new_bool_1 with 136s (1) cores
% 1.76/0.83 % new_bool_3 with pid 3276392 completed with status 0
% 1.76/0.83 % Result found by new_bool_3
% 1.76/0.83 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.76/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.76/0.83 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.76/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.76/0.83 % No SInE strategy applied
% 1.76/0.83 % Search class: FUHPF-FFSF21-MFFFFFNN
% 1.76/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.76/0.83 % Starting SubtermCWHack with 136s (1) cores
% 1.76/0.83 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.76/0.83 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.76/0.83 % Starting new_bool_3 with 136s (1) cores
% 1.76/0.83 % Preprocessing time : 0.002 s
% 1.76/0.83 % Presaturation interreduction done
% 1.76/0.83
% 1.76/0.83 % Proof found!
% 1.76/0.83 % SZS status Unsatisfiable
% 1.76/0.83 % SZS output start CNFRefutation
% See solution above
% 1.76/0.83 % Parsed axioms : 3
% 1.76/0.83 % Removed by relevancy pruning/SinE : 0
% 1.76/0.83 % Initial clauses : 3
% 1.76/0.83 % Removed in clause preprocessing : 1
% 1.76/0.83 % Initial clauses in saturation : 2
% 1.76/0.83 % Processed clauses : 167
% 1.76/0.83 % ...of these trivial : 14
% 1.76/0.83 % ...subsumed : 79
% 1.76/0.83 % ...remaining for further processing : 74
% 1.76/0.83 % Other redundant clauses eliminated : 0
% 1.76/0.83 % Clauses deleted for lack of memory : 0
% 1.76/0.83 % Backward-subsumed : 2
% 1.76/0.83 % Backward-rewritten : 53
% 1.76/0.83 % Generated clauses : 10325
% 1.76/0.83 % ...of the previous two non-redundant : 9849
% 1.76/0.83 % ...aggressively subsumed : 0
% 1.76/0.83 % Contextual simplify-reflections : 0
% 1.76/0.83 % Paramodulations : 10324
% 1.76/0.83 % Factorizations : 0
% 1.76/0.83 % NegExts : 0
% 1.76/0.83 % Equation resolutions : 0
% 1.76/0.83 % Disequality decompositions : 0
% 1.76/0.83 % Total rewrite steps : 3218
% 1.76/0.83 % ...of those cached : 2000
% 1.76/0.83 % Propositional unsat checks : 0
% 1.76/0.83 % Propositional check models : 0
% 1.76/0.83 % Propositional check unsatisfiable : 0
% 1.76/0.83 % Propositional clauses : 0
% 1.76/0.83 % Propositional clauses after purity: 0
% 1.76/0.83 % Propositional unsat core size : 0
% 1.76/0.83 % Propositional preprocessing time : 0.000
% 1.76/0.83 % Propositional encoding time : 0.000
% 1.76/0.83 % Propositional solver time : 0.000
% 1.76/0.83 % Success case prop preproc time : 0.000
% 1.76/0.83 % Success case prop encoding time : 0.000
% 1.76/0.83 % Success case prop solver time : 0.000
% 1.76/0.83 % Current number of processed clauses : 16
% 1.76/0.83 % Positive orientable unit clauses : 15
% 1.76/0.83 % Positive unorientable unit clauses: 1
% 1.76/0.83 % Negative unit clauses : 0
% 1.76/0.83 % Non-unit-clauses : 0
% 1.76/0.83 % Current number of unprocessed clauses: 9534
% 1.76/0.83 % ...number of literals in the above : 9534
% 1.76/0.83 % Current number of archived formulas : 0
% 1.76/0.83 % Current number of archived clauses : 59
% 1.76/0.83 % Clause-clause subsumption calls (NU) : 0
% 1.76/0.83 % Rec. Clause-clause subsumption calls : 0
% 1.76/0.83 % Non-unit clause-clause subsumptions : 0
% 1.76/0.83 % Unit Clause-clause subsumption calls : 124
% 1.76/0.83 % Rewrite failures with RHS unbound : 510
% 1.76/0.83 % BW rewrite match attempts : 641
% 1.76/0.83 % BW rewrite match successes : 90
% 1.76/0.83 % Condensation attempts : 0
% 1.76/0.83 % Condensation successes : 0
% 1.76/0.83 % Termbank termtop insertions : 182241
% 1.76/0.83 % Search garbage collected termcells : 8
% 1.76/0.83
% 1.76/0.83 % -------------------------------------------------
% 1.76/0.83 % User time : 0.277 s
% 1.76/0.83 % System time : 0.022 s
% 1.76/0.83 % Total time : 0.300 s
% 1.76/0.83 % Maximum resident set size: 3632 pages
% 1.76/0.83
% 1.76/0.83 % -------------------------------------------------
% 1.76/0.83 % User time : 1.148 s
% 1.76/0.83 % System time : 0.087 s
% 1.76/0.83 % Total time : 1.235 s
% 1.76/0.83 % Maximum resident set size: 4608 pages
% 1.76/0.83 % E exiting
%------------------------------------------------------------------------------