%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP127-1.004 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:41:58 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of clauses : 74 ( 29 unt; 29 nHn; 72 RR)
% Number of literals : 184 ( 0 equ; 61 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_4)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_total_function1) ).
cnf(product_left_cancellation,axiom,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_1) ).
cnf(product_right_cancellation,axiom,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_idempotence) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_4) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_4_is_not_e_1) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_3) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_4) ).
cnf(qg3,negated_conjecture,
( ~ product(X3,X1,X4)
| ~ product(X1,X2,X3)
| product(X4,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qg3) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_1) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_4) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_3) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_4_is_not_e_3) ).
cnf(c_0_14,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_4)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_15,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_16,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_4)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
c_0_14 ).
cnf(c_0_17,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_18,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_19,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
c_0_15 ).
cnf(c_0_20,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_21,plain,
( ~ group_element(X1)
| product(X1,e_1,e_4)
| product(X1,e_1,e_3)
| product(X1,e_1,e_2)
| product(X1,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_23,plain,
~ equalish(e_4,e_1),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_1]) ).
cnf(c_0_24,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_25,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
c_0_18 ).
cnf(c_0_26,plain,
( ~ product(X1,X2,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( product(e_4,e_1,e_1)
| product(e_4,e_1,e_2)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
~ equalish(e_4,e_1),
c_0_23 ).
cnf(c_0_29,plain,
~ equalish(e_1,e_4),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_4]) ).
cnf(c_0_30,negated_conjecture,
( ~ product(X3,X1,X4)
| ~ product(X1,X2,X3)
| product(X4,X1,X2) ),
inference(fof_simplification,[status(thm)],[qg3]) ).
cnf(c_0_31,plain,
( ~ group_element(X1)
| product(X1,e_3,e_4)
| product(X1,e_3,e_3)
| product(X1,e_3,e_2)
| product(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_32,plain,
( ~ product(X2,X1,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_33,plain,
( product(e_4,e_1,e_4)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_34,plain,
~ equalish(e_1,e_4),
c_0_29 ).
cnf(c_0_35,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_36,negated_conjecture,
( ~ product(X3,X1,X4)
| ~ product(X1,X2,X3)
| product(X4,X1,X2) ),
c_0_30 ).
cnf(c_0_37,plain,
( product(e_4,e_3,e_1)
| product(e_4,e_3,e_2)
| product(e_4,e_3,e_3)
| product(e_4,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_31,c_0_22]) ).
cnf(c_0_38,plain,
( product(e_4,e_1,e_2)
| product(e_4,e_1,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_39,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_40,plain,
~ equalish(e_3,e_1),
c_0_35 ).
cnf(c_0_41,negated_conjecture,
( ~ product(e_3,X1,e_4)
| product(e_1,e_3,X1)
| product(e_4,e_3,e_4)
| product(e_4,e_3,e_3)
| product(e_4,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
~ equalish(e_3,e_4),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_4]) ).
cnf(c_0_43,negated_conjecture,
( ~ product(e_1,X1,e_4)
| product(e_3,e_1,X1)
| product(e_4,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_36,c_0_38]) ).
cnf(c_0_44,plain,
( product(e_1,e_3,e_4)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_39]),c_0_40]) ).
cnf(c_0_45,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_46,negated_conjecture,
( ~ product(e_3,e_1,e_4)
| product(e_4,e_3,e_2)
| product(e_4,e_3,e_3)
| product(e_4,e_3,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_41]),c_0_40]) ).
cnf(c_0_47,plain,
~ equalish(e_3,e_4),
c_0_42 ).
cnf(c_0_48,plain,
~ equalish(e_4,e_3),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_3]) ).
cnf(c_0_49,negated_conjecture,
( product(e_4,e_1,e_2)
| product(e_3,e_1,e_3)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
~ equalish(e_1,e_3),
c_0_45 ).
cnf(c_0_51,negated_conjecture,
( ~ product(e_3,e_1,e_4)
| product(e_4,e_3,e_3)
| product(e_4,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_46]),c_0_47]) ).
cnf(c_0_52,plain,
~ equalish(e_4,e_3),
c_0_48 ).
cnf(c_0_53,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_3,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_49]),c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( ~ product(e_3,e_1,e_4)
| product(e_4,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_51]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( ~ product(X1,e_3,e_2)
| equalish(X1,e_1)
| product(e_4,e_1,e_2)
| product(e_3,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_19,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( ~ product(e_4,X1,e_2)
| ~ product(e_3,e_1,e_4)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_25,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( ~ product(e_3,e_1,e_4)
| product(e_3,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_54]),c_0_28]) ).
cnf(c_0_58,plain,
( product(e_3,e_1,e_1)
| product(e_3,e_1,e_2)
| product(e_3,e_1,e_3)
| product(e_3,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_59,plain,
( ~ group_element(X1)
| product(X1,e_4,e_4)
| product(X1,e_4,e_3)
| product(X1,e_4,e_2)
| product(X1,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_60,negated_conjecture,
( ~ product(e_3,e_1,e_4)
| product(e_3,e_1,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_50]) ).
cnf(c_0_61,plain,
( product(e_3,e_1,e_4)
| product(e_3,e_1,e_3)
| product(e_3,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_58]),c_0_40]) ).
cnf(c_0_62,plain,
( product(e_3,e_4,e_1)
| product(e_3,e_4,e_2)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_59,c_0_24]) ).
cnf(c_0_63,negated_conjecture,
( product(e_3,e_1,e_3)
| product(e_3,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
( ~ product(e_4,X1,e_3)
| product(e_1,e_4,X1)
| product(e_3,e_4,e_4)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_36,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
product(e_3,e_1,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_63]),c_0_50]) ).
cnf(c_0_66,negated_conjecture,
( ~ product(e_4,e_1,e_3)
| product(e_3,e_4,e_2)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_64]),c_0_28]) ).
cnf(c_0_67,negated_conjecture,
( ~ product(X1,e_1,e_2)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_19,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( product(e_3,e_4,e_4)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_2)
| product(e_4,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_66,c_0_38]) ).
cnf(c_0_69,negated_conjecture,
( product(e_3,e_4,e_2)
| product(e_3,e_4,e_3)
| product(e_3,e_4,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_52]) ).
cnf(c_0_70,negated_conjecture,
( product(e_3,e_4,e_3)
| product(e_3,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_69]),c_0_47]) ).
cnf(c_0_71,negated_conjecture,
( ~ product(e_3,X1,e_2)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_25,c_0_65]) ).
cnf(c_0_72,negated_conjecture,
product(e_3,e_4,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_70]),c_0_52]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP127-1.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n012.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 19:59:52 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.44 % Version: 3.5.1
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % Starting sh5l with 300s (1) cores
% 0.13/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 742802 completed with status 0
% 0.13/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGUNF-FFSS00-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.44 % SubtermCWHack with pid 742806 completed with status 0
% 0.13/0.44 % Result found by SubtermCWHack
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGUNF-FFSS00-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Preprocessing time : 0.001 s
% 0.13/0.44
% 0.13/0.44 % Proof found!
% 0.13/0.44 % SZS status Unsatisfiable
% 0.13/0.44 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44 % Parsed axioms : 22
% 0.13/0.44 % Removed by relevancy pruning/SinE : 0
% 0.13/0.44 % Initial clauses : 22
% 0.13/0.44 % Removed in clause preprocessing : 0
% 0.13/0.44 % Initial clauses in saturation : 22
% 0.13/0.44 % Processed clauses : 183
% 0.13/0.44 % ...of these trivial : 0
% 0.13/0.44 % ...subsumed : 27
% 0.13/0.44 % ...remaining for further processing : 156
% 0.13/0.44 % Other redundant clauses eliminated : 0
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 39
% 0.13/0.44 % Backward-rewritten : 7
% 0.13/0.44 % Generated clauses : 540
% 0.13/0.44 % ...of the previous two non-redundant : 431
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 2
% 0.13/0.44 % Paramodulations : 540
% 0.13/0.44 % Factorizations : 0
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 0
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 119
% 0.13/0.44 % ...of those cached : 107
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 110
% 0.13/0.44 % Positive orientable unit clauses : 8
% 0.13/0.44 % Positive unorientable unit clauses: 0
% 0.13/0.44 % Negative unit clauses : 12
% 0.13/0.44 % Non-unit-clauses : 90
% 0.13/0.44 % Current number of unprocessed clauses: 209
% 0.13/0.44 % ...number of literals in the above : 1091
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 46
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 2903
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 1377
% 0.13/0.44 % Non-unit clause-clause subsumptions : 67
% 0.13/0.44 % Unit Clause-clause subsumption calls : 132
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 21
% 0.13/0.44 % BW rewrite match successes : 2
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 8899
% 0.13/0.44 % Search garbage collected termcells : 48
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.017 s
% 0.13/0.44 % System time : 0.002 s
% 0.13/0.44 % Total time : 0.019 s
% 0.13/0.44 % Maximum resident set size: 3640 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.064 s
% 0.13/0.44 % System time : 0.010 s
% 0.13/0.44 % Total time : 0.074 s
% 0.13/0.44 % Maximum resident set size: 4864 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------