TSTP Solution File: GRP354-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP354-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 20:47:37 EDT 2024
% Result : Unsatisfiable 0.50s 0.53s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 11
% Syntax : Number of clauses : 56 ( 22 unt; 24 nHn; 42 RR)
% Number of literals : 169 ( 168 equ; 99 neg)
% Maximal clause size : 14 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 62 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c3,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c3) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_17,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c3,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c3) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c9
| multiply(sk_c4,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_49,negated_conjecture,
( multiply(sk_c8,sk_c7) != sk_c9
| multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(sk_c9) != sk_c7
| multiply(X2,sk_c7) != sk_c8
| inverse(X2) != sk_c7
| multiply(X3,sk_c9) != sk_c8
| inverse(X3) != sk_c9
| multiply(sk_c9,sk_c7) != sk_c8
| inverse(X4) != sk_c9
| multiply(X4,sk_c8) != sk_c9
| multiply(X5,X6) != sk_c8
| inverse(X5) != X6
| multiply(X6,sk_c7) != sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_49) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c9
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_27,negated_conjecture,
( inverse(sk_c9) = sk_c7
| multiply(sk_c9,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_27) ).
cnf(c_0_11,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_12,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_13,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_14,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c3,sk_c9) = sk_c8 ),
prove_this_9 ).
cnf(c_0_16,negated_conjecture,
( multiply(inverse(sk_c3),sk_c8) = sk_c9
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c3) = sk_c9 ),
prove_this_10 ).
cnf(c_0_18,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c3,sk_c9) = sk_c8 ),
prove_this_17 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( multiply(inverse(sk_c3),sk_c8) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c3) = sk_c9 ),
prove_this_18 ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| inverse(sk_c1) = sk_c9 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
multiply(sk_c9,sk_c8) = sk_c9,
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
identity = sk_c8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_12]) ).
cnf(c_0_27,plain,
multiply(inverse(X1),X1) = sk_c8,
inference(rw,[status(thm)],[c_0_12,c_0_26]) ).
cnf(c_0_28,plain,
multiply(inverse(inverse(X1)),sk_c8) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_27]) ).
cnf(c_0_29,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_30,plain,
multiply(X1,sk_c8) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c9
| multiply(sk_c4,sk_c8) = sk_c9 ),
prove_this_5 ).
cnf(c_0_32,plain,
multiply(sk_c8,X1) = X1,
inference(rw,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_33,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c8,sk_c7) != sk_c9
| multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(sk_c9) != sk_c7
| multiply(X2,sk_c7) != sk_c8
| inverse(X2) != sk_c7
| multiply(X3,sk_c9) != sk_c8
| inverse(X3) != sk_c9
| multiply(sk_c9,sk_c7) != sk_c8
| inverse(X4) != sk_c9
| multiply(X4,sk_c8) != sk_c9
| multiply(X5,X6) != sk_c8
| inverse(X5) != X6
| multiply(X6,sk_c7) != sk_c8 ),
inference(fof_simplification,[status(thm)],[prove_this_49]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c9
| inverse(sk_c4) = sk_c9 ),
prove_this_4 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c4,sk_c8) = sk_c9
| sk_c7 = sk_c9 ),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
multiply(X1,inverse(X1)) = sk_c8,
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( inverse(sk_c9) = sk_c7
| multiply(sk_c9,sk_c7) = sk_c8 ),
prove_this_27 ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c8,sk_c7) != sk_c9
| multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(sk_c9) != sk_c7
| multiply(X2,sk_c7) != sk_c8
| inverse(X2) != sk_c7
| multiply(X3,sk_c9) != sk_c8
| inverse(X3) != sk_c9
| multiply(sk_c9,sk_c7) != sk_c8
| inverse(X4) != sk_c9
| multiply(X4,sk_c8) != sk_c9
| multiply(X5,X6) != sk_c8
| inverse(X5) != X6
| multiply(X6,sk_c7) != sk_c8 ),
c_0_34 ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c4) = sk_c9
| sk_c7 = sk_c9 ),
inference(rw,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( sk_c7 = sk_c9
| sk_c4 = sk_c9 ),
inference(rw,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_42,negated_conjecture,
multiply(sk_c9,sk_c7) = sk_c8,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( multiply(inverse(X1),sk_c7) != sk_c8
| multiply(sk_c8,sk_c7) != sk_c9
| multiply(sk_c9,sk_c7) != sk_c8
| multiply(X1,inverse(X1)) != sk_c8
| multiply(X2,sk_c8) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c7) != sk_c8
| multiply(X5,sk_c9) != sk_c8
| inverse(sk_c9) != sk_c7
| inverse(X2) != sk_c9
| inverse(X3) != sk_c9
| inverse(X4) != sk_c7
| inverse(X5) != sk_c9 ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( inverse(sk_c9) = sk_c9
| sk_c7 = sk_c9 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
inverse(sk_c9) = sk_c7,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_42]),c_0_30]) ).
cnf(c_0_46,negated_conjecture,
( multiply(inverse(X1),sk_c7) != sk_c8
| multiply(sk_c9,sk_c7) != sk_c8
| multiply(X1,inverse(X1)) != sk_c8
| multiply(X2,sk_c8) != sk_c9
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c7) != sk_c8
| multiply(X5,sk_c9) != sk_c8
| inverse(sk_c9) != sk_c7
| inverse(X2) != sk_c9
| inverse(X3) != sk_c9
| inverse(X4) != sk_c7
| inverse(X5) != sk_c9
| sk_c7 != sk_c9 ),
inference(rw,[status(thm)],[c_0_43,c_0_32]) ).
cnf(c_0_47,negated_conjecture,
sk_c7 = sk_c9,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( multiply(inverse(X1),sk_c7) != sk_c8
| multiply(sk_c9,sk_c7) != sk_c8
| multiply(X1,inverse(X1)) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(sk_c9) != sk_c7
| inverse(sk_c9) != sk_c9
| inverse(X2) != sk_c9
| inverse(X3) != sk_c7
| inverse(X4) != sk_c9
| sk_c7 != sk_c9 ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_30])]) ).
cnf(c_0_49,negated_conjecture,
multiply(sk_c9,sk_c9) = sk_c8,
inference(rw,[status(thm)],[c_0_42,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( multiply(inverse(X1),sk_c9) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(X2) != sk_c9
| inverse(X3) != sk_c9
| inverse(X4) != sk_c9 ),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_37])]),c_0_47]),c_0_47]),c_0_49]),c_0_47]),c_0_45]),c_0_47]),c_0_47]),c_0_45]),c_0_47]),c_0_47]),c_0_47])]) ).
cnf(c_0_51,negated_conjecture,
inverse(sk_c9) = sk_c9,
inference(rw,[status(thm)],[c_0_45,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( multiply(X1,sk_c9) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(X2) != sk_c9
| inverse(X3) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_49])]) ).
cnf(c_0_53,negated_conjecture,
( multiply(X1,sk_c9) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(X2) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_49]),c_0_45]),c_0_47])]) ).
cnf(c_0_54,negated_conjecture,
( multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_49]),c_0_45]),c_0_47])]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_51]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP354-1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 05:50:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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
% 0.50/0.53 # Version: 3.1.0
% 0.50/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.50/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.50/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.53 # Starting sh5l with 300s (1) cores
% 0.50/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 5684 completed with status 0
% 0.50/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.50/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.50/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.50/0.53 # No SInE strategy applied
% 0.50/0.53 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.50/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.50/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.50/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.50/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.50/0.53 # Starting sh5l with 136s (1) cores
% 0.50/0.53 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 5688 completed with status 0
% 0.50/0.53 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.50/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.50/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.50/0.53 # No SInE strategy applied
% 0.50/0.53 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.50/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.50/0.53 # Preprocessing time : 0.001 s
% 0.50/0.53 # Presaturation interreduction done
% 0.50/0.53
% 0.50/0.53 # Proof found!
% 0.50/0.53 # SZS status Unsatisfiable
% 0.50/0.53 # SZS output start CNFRefutation
% See solution above
% 0.50/0.54 # Parsed axioms : 52
% 0.50/0.54 # Removed by relevancy pruning/SinE : 0
% 0.50/0.54 # Initial clauses : 52
% 0.50/0.54 # Removed in clause preprocessing : 0
% 0.50/0.54 # Initial clauses in saturation : 52
% 0.50/0.54 # Processed clauses : 416
% 0.50/0.54 # ...of these trivial : 10
% 0.50/0.54 # ...subsumed : 85
% 0.50/0.54 # ...remaining for further processing : 321
% 0.50/0.54 # Other redundant clauses eliminated : 13
% 0.50/0.54 # Clauses deleted for lack of memory : 0
% 0.50/0.54 # Backward-subsumed : 32
% 0.50/0.54 # Backward-rewritten : 204
% 0.50/0.54 # Generated clauses : 1364
% 0.50/0.54 # ...of the previous two non-redundant : 1358
% 0.50/0.54 # ...aggressively subsumed : 0
% 0.50/0.54 # Contextual simplify-reflections : 20
% 0.50/0.54 # Paramodulations : 1351
% 0.50/0.54 # Factorizations : 0
% 0.50/0.54 # NegExts : 0
% 0.50/0.54 # Equation resolutions : 13
% 0.50/0.54 # Disequality decompositions : 0
% 0.50/0.54 # Total rewrite steps : 509
% 0.50/0.54 # ...of those cached : 444
% 0.50/0.54 # Propositional unsat checks : 0
% 0.50/0.54 # Propositional check models : 0
% 0.50/0.54 # Propositional check unsatisfiable : 0
% 0.50/0.54 # Propositional clauses : 0
% 0.50/0.54 # Propositional clauses after purity: 0
% 0.50/0.54 # Propositional unsat core size : 0
% 0.50/0.54 # Propositional preprocessing time : 0.000
% 0.50/0.54 # Propositional encoding time : 0.000
% 0.50/0.54 # Propositional solver time : 0.000
% 0.50/0.54 # Success case prop preproc time : 0.000
% 0.50/0.54 # Success case prop encoding time : 0.000
% 0.50/0.54 # Success case prop solver time : 0.000
% 0.50/0.54 # Current number of processed clauses : 32
% 0.50/0.54 # Positive orientable unit clauses : 14
% 0.50/0.54 # Positive unorientable unit clauses: 0
% 0.50/0.54 # Negative unit clauses : 0
% 0.50/0.54 # Non-unit-clauses : 18
% 0.50/0.54 # Current number of unprocessed clauses: 728
% 0.50/0.54 # ...number of literals in the above : 1814
% 0.50/0.54 # Current number of archived formulas : 0
% 0.50/0.54 # Current number of archived clauses : 288
% 0.50/0.54 # Clause-clause subsumption calls (NU) : 1406
% 0.50/0.54 # Rec. Clause-clause subsumption calls : 765
% 0.50/0.54 # Non-unit clause-clause subsumptions : 127
% 0.50/0.54 # Unit Clause-clause subsumption calls : 477
% 0.50/0.54 # Rewrite failures with RHS unbound : 0
% 0.50/0.54 # BW rewrite match attempts : 35
% 0.50/0.54 # BW rewrite match successes : 25
% 0.50/0.54 # Condensation attempts : 0
% 0.50/0.54 # Condensation successes : 0
% 0.50/0.54 # Termbank termtop insertions : 25131
% 0.50/0.54 # Search garbage collected termcells : 38
% 0.50/0.54
% 0.50/0.54 # -------------------------------------------------
% 0.50/0.54 # User time : 0.038 s
% 0.50/0.54 # System time : 0.004 s
% 0.50/0.54 # Total time : 0.042 s
% 0.50/0.54 # Maximum resident set size: 1676 pages
% 0.50/0.54
% 0.50/0.54 # -------------------------------------------------
% 0.50/0.54 # User time : 0.177 s
% 0.50/0.54 # System time : 0.009 s
% 0.50/0.54 # Total time : 0.186 s
% 0.50/0.54 # Maximum resident set size: 1724 pages
% 0.50/0.54 % E---3.1 exiting
% 0.50/0.54 % E exiting
%------------------------------------------------------------------------------