%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW949+1 : TPTP v9.3.1. Released v7.4.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 03:11:26 PM UTC 2026
% Result : Theorem 0.07s 0.36s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 64 ( 33 unt; 0 def)
% Number of atoms : 106 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 78 ( 36 ~; 32 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 71 ( 2 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax81,axiom,
! [X5,X6,X7] : constr_xor(X5,constr_xor(X6,X7)) = constr_xor(constr_xor(X5,X6),X7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(ax80,axiom,
! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax80) ).
fof(ax79,axiom,
! [X2] : constr_xor(X2,constr_ZERO) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax79) ).
fof(ax122,axiom,
! [X45] :
( pred_attacker(tuple_R_in_2(X45,constr_f(constr_xor(name_r1,constr_xor(X45,name_t)),name_t)))
=> pred_attacker(tuple_R_out_4(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax122) ).
fof(ax104,axiom,
! [X32,X33] :
( ( pred_attacker(X33)
& pred_attacker(X32) )
=> pred_attacker(tuple_R_in_2(X32,X33)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax104) ).
fof(ax78,axiom,
! [X1] : constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(ax103,axiom,
! [X31] :
( pred_attacker(tuple_R_out_1(X31))
=> pred_attacker(X31) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax103) ).
fof(ax82,axiom,
! [X8,X9] :
( ( pred_attacker(X9)
& pred_attacker(X8) )
=> pred_attacker(constr_xor(X8,X9)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(ax120,axiom,
pred_attacker(tuple_R_out_1(name_r1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax120) ).
fof(ax88,axiom,
! [X16,X17] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X16,X17))
=> pred_attacker(X17) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax88) ).
fof(ax118,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax118) ).
fof(ax87,axiom,
! [X14,X15] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X14,X15))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax87) ).
fof(ax90,axiom,
! [X19] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X19))
=> pred_attacker(X19) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax90) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(ax117,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax117) ).
fof(ax99,axiom,
! [X27] :
( pred_attacker(tuple_R_out_4(X27))
=> pred_attacker(X27) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax99) ).
fof(c_0_16,plain,
! [X50,X51,X52] : constr_xor(X50,constr_xor(X51,X52)) = constr_xor(constr_xor(X50,X51),X52),
inference(variable_rename,[status(thm)],[ax81]) ).
fof(c_0_17,plain,
! [X48,X49] : constr_xor(X48,X49) = constr_xor(X49,X48),
inference(variable_rename,[status(thm)],[ax80]) ).
fof(c_0_18,plain,
! [X47] : constr_xor(X47,constr_ZERO) = X47,
inference(variable_rename,[status(thm)],[ax79]) ).
fof(c_0_19,plain,
! [X90] :
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(X90,constr_f(constr_xor(name_r1,constr_xor(X90,name_t)),name_t))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax122])])]) ).
fof(c_0_20,plain,
! [X77,X78] :
( pred_attacker(tuple_R_in_2(X77,X78))
| ~ pred_attacker(X78)
| ~ pred_attacker(X77) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax104])])]) ).
cnf(c_0_21,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(constr_xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X46] : constr_xor(X46,X46) = constr_ZERO,
inference(variable_rename,[status(thm)],[ax78]) ).
cnf(c_0_24,plain,
constr_xor(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ~ pred_attacker(tuple_R_in_2(X1,constr_f(constr_xor(name_r1,constr_xor(X1,name_t)),name_t)))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_R_in_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X2,constr_xor(X3,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
constr_xor(X1,X1) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
fof(c_0_30,plain,
! [X76] :
( pred_attacker(X76)
| ~ pred_attacker(tuple_R_out_1(X76)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax103])])]) ).
cnf(c_0_31,plain,
( ~ pred_attacker(X1)
| ~ pred_attacker(constr_f(constr_xor(name_t,constr_xor(name_r1,X1)),name_t))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_32,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_28]),c_0_29]) ).
fof(c_0_33,plain,
! [X53,X54] :
( pred_attacker(constr_xor(X53,X54))
| ~ pred_attacker(X54)
| ~ pred_attacker(X53) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_34,plain,
( ~ pred_attacker(tuple_R_out_1(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
pred_attacker(tuple_R_out_1(name_r1)),
inference(split_conjunct,[status(thm)],[ax120]) ).
cnf(c_0_36,plain,
( ~ pred_attacker(constr_xor(name_r1,X1))
| ~ pred_attacker(constr_f(constr_xor(name_t,X1),name_t))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(constr_xor(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
pred_attacker(name_r1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_39,plain,
! [X61,X62] :
( pred_attacker(X62)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X61,X62)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax88])])]) ).
cnf(c_0_40,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t))),
inference(split_conjunct,[status(thm)],[ax118]) ).
fof(c_0_41,plain,
! [X59,X60] :
( pred_attacker(X59)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X59,X60)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax87])])]) ).
cnf(c_0_42,plain,
( ~ pred_attacker(X1)
| ~ pred_attacker(constr_f(constr_xor(name_t,X1),name_t))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_43,plain,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2))
| pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr_f(constr_xor(name_r2_from_1st,name_r1_from_1st),name_t))),
inference(rw,[status(thm)],[c_0_40,c_0_22]) ).
cnf(c_0_45,plain,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_46,plain,
! [X64] :
( pred_attacker(X64)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X64)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax90])])]) ).
fof(c_0_47,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_48,plain,
( ~ pred_attacker(constr_xor(name_t,X1))
| ~ pred_attacker(constr_f(X1,name_t))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(spm,[status(thm)],[c_0_42,c_0_32]) ).
cnf(c_0_49,plain,
pred_attacker(constr_f(constr_xor(name_r2_from_1st,name_r1_from_1st),name_t)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
( ~ pred_attacker(X3)
| ~ pred_attacker(constr_xor(X1,X2))
| pred_attacker(constr_xor(X1,constr_xor(X2,X3))) ),
inference(spm,[status(thm)],[c_0_37,c_0_21]) ).
cnf(c_0_51,plain,
pred_attacker(constr_xor(name_t,name_r2_from_1st)),
inference(spm,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_52,plain,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
inference(split_conjunct,[status(thm)],[ax117]) ).
fof(c_0_54,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_47]) ).
fof(c_0_55,plain,
! [X72] :
( pred_attacker(X72)
| ~ pred_attacker(tuple_R_out_4(X72)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax99])])]) ).
cnf(c_0_56,plain,
( ~ pred_attacker(constr_xor(name_t,constr_xor(name_r2_from_1st,name_r1_from_1st)))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,plain,
( ~ pred_attacker(X1)
| pred_attacker(constr_xor(name_t,constr_xor(name_r2_from_1st,X1))) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,plain,
pred_attacker(name_r1_from_1st),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
fof(c_0_59,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_54]) ).
cnf(c_0_60,plain,
( ~ pred_attacker(tuple_R_out_4(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_61,plain,
pred_attacker(tuple_R_out_4(name_objective)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_62,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_63,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWW949+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.30 % Computer : n012.cluster.edu
% 0.05/0.30 % Model : x86_64 x86_64
% 0.05/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.30 % Memory : 8046.5625MB
% 0.05/0.30 % OS : Linux 6.8.0-71-generic
% 0.05/0.30 % CPULimit : 300
% 0.05/0.30 % WCLimit : 300
% 0.05/0.30 % DateTime : Mon Sep 21 10:19:51 UTC 2026
% 0.05/0.30 % CPUTime :
% 0.05/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.32 Running first-order theorem proving
% 0.05/0.32 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.07/0.36 % Version: 3.5.1
% 0.07/0.36 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.36 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.36 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.36 % Starting sh5l with 300s (1) cores
% 0.07/0.36 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2157374 completed with status 0
% 0.07/0.36 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.07/0.36 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.36 % No SInE strategy applied
% 0.07/0.36 % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.07/0.36 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.07/0.36 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.36 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.07/0.36 % Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_S0Y with 212s (1) cores
% 0.07/0.36 % Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.07/0.36 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.07/0.36 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2157381 completed with status 0
% 0.07/0.36 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.07/0.36 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.36 % No SInE strategy applied
% 0.07/0.36 % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.07/0.36 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.07/0.36 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.36 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.07/0.36 % Preprocessing time : 0.001 s
% 0.07/0.36 % Presaturation interreduction done
% 0.07/0.36
% 0.07/0.36 % Proof found!
% 0.07/0.36 % SZS status Theorem
% 0.07/0.36 % SZS output start CNFRefutation
% See solution above
% 0.07/0.36 % Parsed axioms : 124
% 0.07/0.36 % Removed by relevancy pruning/SinE : 0
% 0.07/0.36 % Initial clauses : 124
% 0.07/0.36 % Removed in clause preprocessing : 0
% 0.07/0.36 % Initial clauses in saturation : 124
% 0.07/0.36 % Processed clauses : 791
% 0.07/0.36 % ...of these trivial : 14
% 0.07/0.36 % ...subsumed : 394
% 0.07/0.36 % ...remaining for further processing : 383
% 0.07/0.36 % Other redundant clauses eliminated : 0
% 0.07/0.36 % Clauses deleted for lack of memory : 0
% 0.07/0.36 % Backward-subsumed : 2
% 0.07/0.36 % Backward-rewritten : 22
% 0.07/0.36 % Generated clauses : 1757
% 0.07/0.36 % ...of the previous two non-redundant : 1452
% 0.07/0.36 % ...aggressively subsumed : 0
% 0.07/0.36 % Contextual simplify-reflections : 0
% 0.07/0.36 % Paramodulations : 1757
% 0.07/0.36 % Factorizations : 0
% 0.07/0.36 % NegExts : 0
% 0.07/0.36 % Equation resolutions : 0
% 0.07/0.36 % Disequality decompositions : 0
% 0.07/0.36 % Total rewrite steps : 1433
% 0.07/0.36 % ...of those cached : 1039
% 0.07/0.36 % Propositional unsat checks : 0
% 0.07/0.36 % Propositional check models : 0
% 0.07/0.36 % Propositional check unsatisfiable : 0
% 0.07/0.36 % Propositional clauses : 0
% 0.07/0.36 % Propositional clauses after purity: 0
% 0.07/0.36 % Propositional unsat core size : 0
% 0.07/0.36 % Propositional preprocessing time : 0.000
% 0.07/0.36 % Propositional encoding time : 0.000
% 0.07/0.36 % Propositional solver time : 0.000
% 0.07/0.36 % Success case prop preproc time : 0.000
% 0.07/0.36 % Success case prop encoding time : 0.000
% 0.07/0.36 % Success case prop solver time : 0.000
% 0.07/0.36 % Current number of processed clauses : 235
% 0.07/0.36 % Positive orientable unit clauses : 29
% 0.07/0.36 % Positive unorientable unit clauses: 3
% 0.07/0.36 % Negative unit clauses : 79
% 0.07/0.36 % Non-unit-clauses : 124
% 0.07/0.36 % Current number of unprocessed clauses: 888
% 0.07/0.36 % ...number of literals in the above : 2309
% 0.07/0.36 % Current number of archived formulas : 0
% 0.07/0.36 % Current number of archived clauses : 148
% 0.07/0.36 % Clause-clause subsumption calls (NU) : 11951
% 0.07/0.36 % Rec. Clause-clause subsumption calls : 10830
% 0.07/0.36 % Non-unit clause-clause subsumptions : 365
% 0.07/0.36 % Unit Clause-clause subsumption calls : 1433
% 0.07/0.36 % Rewrite failures with RHS unbound : 0
% 0.07/0.36 % BW rewrite match attempts : 58
% 0.07/0.36 % BW rewrite match successes : 40
% 0.07/0.36 % Condensation attempts : 0
% 0.07/0.36 % Condensation successes : 0
% 0.07/0.36 % Termbank termtop insertions : 24930
% 0.07/0.36 % Search garbage collected termcells : 614
% 0.07/0.36
% 0.07/0.36 % -------------------------------------------------
% 0.07/0.36 % User time : 0.026 s
% 0.07/0.36 % System time : 0.000 s
% 0.07/0.36 % Total time : 0.026 s
% 0.07/0.36 % Maximum resident set size: 3724 pages
% 0.07/0.36
% 0.07/0.36 % -------------------------------------------------
% 0.07/0.36 % User time : 0.111 s
% 0.07/0.36 % System time : 0.011 s
% 0.07/0.36 % Total time : 0.122 s
% 0.07/0.36 % Maximum resident set size: 4864 pages
% 0.07/0.36 % E exiting
%------------------------------------------------------------------------------