%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWW957+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 : n005.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:13:06 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of formulae : 66 ( 39 unt; 0 def)
% Number of atoms : 97 ( 25 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 60 ( 29 ~; 23 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 88 ( 4 sgn 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax49,axiom,
! [X10] : constr_xor(X10,constr_ZERO) = X10,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(ax50,axiom,
! [X11,X12] : constr_xor(X11,X12) = constr_xor(X12,X11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax50) ).
fof(ax51,axiom,
! [X13,X14,X15] : constr_xor(X13,constr_xor(X14,X15)) = constr_xor(constr_xor(X13,X14),X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).
fof(ax48,axiom,
! [X9] : constr_xor(X9,X9) = constr_ZERO,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax48) ).
fof(ax54,axiom,
! [X18] :
( pred_attacker(X18)
=> pred_attacker(constr_split(X18)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax54) ).
fof(ax45,axiom,
! [X1,X2] : constr_split(constr_concat(X1,X2)) = tuple_2(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax45) ).
fof(ax52,axiom,
! [X16,X17] :
( ( pred_attacker(X17)
& pred_attacker(X16) )
=> pred_attacker(constr_xor(X16,X17)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax52) ).
fof(ax72,axiom,
! [X36,X37] :
( pred_attacker(tuple_B_out_1(X36,X37))
=> pred_attacker(X37) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax72) ).
fof(ax82,axiom,
pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_concat(name_objective,constr_C(name_objective)),constr_RC4(name_v,name_Kab)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(ax81,axiom,
! [X50] :
( pred_attacker(tuple_enc_oracle_in_1(X50))
=> pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X50,constr_C(X50)),constr_RC4(name_v,name_Kab)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(ax47,axiom,
! [X7,X8] : constr_C(constr_xor(X7,X8)) = constr_xor(constr_C(X7),constr_C(X8)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax47) ).
fof(ax46,axiom,
! [X3,X4,X5,X6] : constr_xor(constr_concat(X3,X5),constr_concat(X4,X6)) = constr_concat(constr_xor(X3,X4),constr_xor(X5,X6)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
fof(ax74,axiom,
! [X40,X41] :
( pred_attacker(tuple_2(X40,X41))
=> pred_attacker(X40) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax74) ).
fof(ax58,axiom,
! [X23,X24] :
( pred_attacker(tuple_enc_oracle_out_2(X23,X24))
=> pred_attacker(X24) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(ax59,axiom,
! [X25] :
( pred_attacker(X25)
=> pred_attacker(tuple_enc_oracle_in_1(X25)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax59) ).
fof(ax62,axiom,
pred_attacker(constr_ZERO),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax62) ).
fof(c_0_17,plain,
! [X60] : constr_xor(X60,constr_ZERO) = X60,
inference(variable_rename,[status(thm)],[ax49]) ).
fof(c_0_18,plain,
! [X61,X62] : constr_xor(X61,X62) = constr_xor(X62,X61),
inference(variable_rename,[status(thm)],[ax50]) ).
fof(c_0_19,plain,
! [X63,X64,X65] : constr_xor(X63,constr_xor(X64,X65)) = constr_xor(constr_xor(X63,X64),X65),
inference(variable_rename,[status(thm)],[ax51]) ).
fof(c_0_20,plain,
! [X59] : constr_xor(X59,X59) = constr_ZERO,
inference(variable_rename,[status(thm)],[ax48]) ).
cnf(c_0_21,plain,
constr_xor(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X94] :
( pred_attacker(constr_split(X94))
| ~ pred_attacker(X94) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])])]) ).
fof(c_0_24,plain,
! [X75,X76] : constr_split(constr_concat(X75,X76)) = tuple_2(X75,X76),
inference(variable_rename,[status(thm)],[ax45]) ).
fof(c_0_25,plain,
! [X51,X52] :
( pred_attacker(constr_xor(X51,X52))
| ~ pred_attacker(X52)
| ~ pred_attacker(X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax52])])]) ).
cnf(c_0_26,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(constr_xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
constr_xor(X1,X1) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_29,plain,
! [X71,X72] :
( pred_attacker(X72)
| ~ pred_attacker(tuple_B_out_1(X71,X72)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax72])])]) ).
cnf(c_0_30,plain,
pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_concat(name_objective,constr_C(name_objective)),constr_RC4(name_v,name_Kab)))),
inference(split_conjunct,[status(thm)],[ax82]) ).
fof(c_0_31,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
fof(c_0_32,plain,
! [X66] :
( pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X66,constr_C(X66)),constr_RC4(name_v,name_Kab))))
| ~ pred_attacker(tuple_enc_oracle_in_1(X66)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
fof(c_0_33,plain,
! [X57,X58] : constr_C(constr_xor(X57,X58)) = constr_xor(constr_C(X57),constr_C(X58)),
inference(variable_rename,[status(thm)],[ax47]) ).
fof(c_0_34,plain,
! [X53,X54,X55,X56] : constr_xor(constr_concat(X53,X55),constr_concat(X54,X56)) = constr_concat(constr_xor(X53,X54),constr_xor(X55,X56)),
inference(variable_rename,[status(thm)],[ax46]) ).
fof(c_0_35,plain,
! [X90,X91] :
( pred_attacker(X90)
| ~ pred_attacker(tuple_2(X90,X91)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax74])])]) ).
cnf(c_0_36,plain,
( ~ pred_attacker(X1)
| pred_attacker(constr_split(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_37,plain,
constr_split(constr_concat(X1,X2)) = tuple_2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(constr_xor(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_39,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_40,plain,
( ~ pred_attacker(tuple_B_out_1(X1,X2))
| pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,plain,
pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_RC4(name_v,name_Kab),constr_concat(name_objective,constr_C(name_objective))))),
inference(rw,[status(thm)],[c_0_30,c_0_22]) ).
fof(c_0_42,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
( ~ pred_attacker(tuple_enc_oracle_in_1(X1))
| pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X1,constr_C(X1)),constr_RC4(name_v,name_Kab)))) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
constr_C(constr_xor(X1,X2)) = constr_xor(constr_C(X1),constr_C(X2)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_45,plain,
constr_xor(constr_concat(X1,X2),constr_concat(X3,X4)) = constr_concat(constr_xor(X1,X3),constr_xor(X2,X4)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_46,plain,
( ~ pred_attacker(tuple_2(X1,X2))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_47,plain,
( ~ pred_attacker(constr_concat(X1,X2))
| pred_attacker(tuple_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_48,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(constr_xor(X2,X1))
| pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_49,plain,
pred_attacker(constr_xor(constr_RC4(name_v,name_Kab),constr_concat(name_objective,constr_C(name_objective)))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
fof(c_0_50,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_42]) ).
fof(c_0_51,plain,
! [X84,X85] :
( pred_attacker(X85)
| ~ pred_attacker(tuple_enc_oracle_out_2(X84,X85)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_52,plain,
( ~ pred_attacker(tuple_enc_oracle_in_1(X1))
| pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_RC4(name_v,name_Kab),constr_concat(X1,constr_C(X1))))) ),
inference(rw,[status(thm)],[c_0_43,c_0_22]) ).
cnf(c_0_53,plain,
constr_C(constr_ZERO) = constr_ZERO,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_44]),c_0_27]) ).
cnf(c_0_54,plain,
constr_concat(constr_ZERO,constr_ZERO) = constr_ZERO,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_45]),c_0_27]),c_0_27]) ).
cnf(c_0_55,plain,
( ~ pred_attacker(constr_concat(X1,X2))
| pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_56,plain,
( ~ pred_attacker(constr_RC4(name_v,name_Kab))
| pred_attacker(constr_concat(name_objective,constr_C(name_objective))) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_58,plain,
( ~ pred_attacker(tuple_enc_oracle_out_2(X1,X2))
| pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_59,plain,
( ~ pred_attacker(tuple_enc_oracle_in_1(constr_ZERO))
| pred_attacker(tuple_enc_oracle_out_2(name_v,constr_RC4(name_v,name_Kab))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_21]) ).
cnf(c_0_60,plain,
~ pred_attacker(constr_RC4(name_v,name_Kab)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
fof(c_0_61,plain,
! [X86] :
( pred_attacker(tuple_enc_oracle_in_1(X86))
| ~ pred_attacker(X86) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax59])])]) ).
cnf(c_0_62,plain,
~ pred_attacker(tuple_enc_oracle_in_1(constr_ZERO)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_63,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_enc_oracle_in_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_64,plain,
pred_attacker(constr_ZERO),
inference(split_conjunct,[status(thm)],[ax62]) ).
cnf(c_0_65,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW957+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n005.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 : Mon Sep 21 10:20:17 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % sh5l with pid 3210342 completed with status 0
% 0.10/0.45 % Result found by sh5l
% 0.10/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.45 % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.10/0.45 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.45 % SubtermCWHack with pid 3210343 completed with status 0
% 0.10/0.45 % Result found by SubtermCWHack
% 0.10/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.45 % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.10/0.45 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.45 % Preprocessing time : 0.002 s
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 84
% 0.10/0.45 % Removed by relevancy pruning/SinE : 6
% 0.10/0.45 % Initial clauses : 78
% 0.10/0.45 % Removed in clause preprocessing : 0
% 0.10/0.45 % Initial clauses in saturation : 78
% 0.10/0.45 % Processed clauses : 115
% 0.10/0.45 % ...of these trivial : 3
% 0.10/0.45 % ...subsumed : 14
% 0.10/0.45 % ...remaining for further processing : 98
% 0.10/0.45 % Other redundant clauses eliminated : 0
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 2
% 0.10/0.45 % Backward-rewritten : 0
% 0.10/0.45 % Generated clauses : 120
% 0.10/0.45 % ...of the previous two non-redundant : 61
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 0
% 0.10/0.45 % Paramodulations : 120
% 0.10/0.45 % Factorizations : 0
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 0
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 92
% 0.10/0.45 % ...of those cached : 51
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 96
% 0.10/0.45 % Positive orientable unit clauses : 23
% 0.10/0.45 % Positive unorientable unit clauses: 1
% 0.10/0.45 % Negative unit clauses : 49
% 0.10/0.45 % Non-unit-clauses : 23
% 0.10/0.45 % Current number of unprocessed clauses: 23
% 0.10/0.45 % ...number of literals in the above : 42
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 2
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 292
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 284
% 0.10/0.45 % Non-unit clause-clause subsumptions : 10
% 0.10/0.45 % Unit Clause-clause subsumption calls : 402
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 8
% 0.10/0.45 % BW rewrite match successes : 4
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 3495
% 0.10/0.45 % Search garbage collected termcells : 438
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.008 s
% 0.10/0.45 % System time : 0.002 s
% 0.10/0.45 % Total time : 0.010 s
% 0.10/0.45 % Maximum resident set size: 3708 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.012 s
% 0.10/0.45 % System time : 0.005 s
% 0.10/0.45 % Total time : 0.017 s
% 0.10/0.45 % Maximum resident set size: 4608 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------