%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU868^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 : Wed Sep 30 08:28:01 AM UTC 2026
% Result : Theorem 0.08s 0.26s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU868^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n014.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 14:41:56 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.6atRXVNO9R/E---3.1_2755023.p
% 0.08/0.26 % Version: 3.5.1-ho
% 0.08/0.26 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting post_as_ho5 with 1500s (5) cores
% 0.08/0.26 % Starting sh2lt with 300s (1) cores
% 0.08/0.26 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.08/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.08/0.26 % sh2lt with pid 2755037 completed with status 0
% 0.08/0.26 % Result found by sh2lt
% 0.08/0.26 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting post_as_ho5 with 1500s (5) cores
% 0.08/0.26 % Starting sh2lt with 300s (1) cores
% 0.08/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.08/0.26 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.08/0.26 % Search class: HGUSF-FFSF31-SHHFFMBN
% 0.08/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26 % SubtermCWHack with pid 2755046 completed with status 0
% 0.08/0.26 % Result found by SubtermCWHack
% 0.08/0.26 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting post_as_ho5 with 1500s (5) cores
% 0.08/0.26 % Starting sh2lt with 300s (1) cores
% 0.08/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.08/0.26 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.08/0.26 % Search class: HGUSF-FFSF31-SHHFFMBN
% 0.08/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26 % Preprocessing time : 0.001 s
% 0.08/0.26
% 0.08/0.26 % Proof found!
% 0.08/0.26 % SZS status Theorem
% 0.08/0.26 % SZS output start CNFRefutation
% 0.08/0.26 thf(decl_sort1, type, a: $tType).
% 0.08/0.26 thf(decl_23, type, cC: a > $o).
% 0.08/0.26 thf(decl_24, type, epred1_1: ((a > $o) > $o) > a > $o).
% 0.08/0.26 thf(decl_25, type, esk1_1: ((a > $o) > $o) > a).
% 0.08/0.26 thf(decl_26, type, epred2_0: (a > $o) > $o).
% 0.08/0.26 thf(decl_27, type, esk2_1: (a > $o) > a).
% 0.08/0.26 thf(decl_28, type, esk3_3: (a > $o) > a > (a > $o) > a).
% 0.08/0.26 thf(decl_29, type, epred3_1: ((a > $o) > $o) > a > $o).
% 0.08/0.26 thf(decl_30, type, epred4_0: a > $o).
% 0.08/0.26 thf(cTHM551_pme, conjecture, (![X1:(a > $o) > $o]:((((X1 @ (^[X2:a]:(~($true))))&![X3:a > $o, X2:a]:(((X1 @ X3)=>(X1 @ (^[X4:a]:((((X3 @ X4))|(((X4)=(X2))))))))))=>(X1 @ cC)))=>![X5:(a > $o) > $o]:(((![X6:a > $o]:((~(?[X4:a]:((X6 @ X4)))=>(X5 @ X6)))&![X7:a > $o, X2:a, X8:a > $o]:((((X5 @ X7)&![X9:a]:(((X8 @ X9)<=>((X7 @ X9)|((X9)=(X2))))))=>(X5 @ X8))))=>(X5 @ cC)))), file('/export/starexec/sandbox/tmp/tmp.6atRXVNO9R/E---3.1_2755023.p', cTHM551_pme)).
% 0.08/0.26 thf(c_0_1, negated_conjecture, ~((![X1:(a > $o) > $o]:((((X1 @ (^[X2:a]:(~($true))))&![X3:a > $o, X2:a]:(((X1 @ X3)=>(X1 @ (^[X4:a]:((((X3 @ X4))|(((X4)=(X2))))))))))=>(X1 @ cC)))=>![X5:(a > $o) > $o]:(((![X6:a > $o]:((~(?[X4:a]:((X6 @ X4)))=>(X5 @ X6)))&![X7:a > $o, X2:a, X8:a > $o]:((((X5 @ X7)&![X9:a]:(((X8 @ X9)<=>((X7 @ X9)|((X9)=(X2))))))=>(X5 @ X8))))=>(X5 @ cC))))), inference(assume_negation,[status(cth)],[cTHM551_pme])).
% 0.08/0.26 thf(c_0_2, negated_conjecture, ~((![X1:(a > $o) > $o]:((((X1 @ (^[Z0:a]:(~($true))))&![X3:a > $o, X2:a]:(((X1 @ X3)=>(X1 @ (^[Z0:a]:(((X3 @ Z0)|(((Z0)=(X2))))))))))=>(X1 @ cC)))=>![X5:(a > $o) > $o]:(((![X6:a > $o]:((~(?[X4:a]:((X6 @ X4)))=>(X5 @ X6)))&![X7:a > $o, X2:a, X8:a > $o]:((((X5 @ X7)&![X9:a]:(((X8 @ X9)<=>((X7 @ X9)|((X9)=(X2))))))=>(X5 @ X8))))=>(X5 @ cC))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.08/0.26 thf(c_0_3, plain, ![X35:a]:(((~(epred4_0 @ X35)|~($true))&(($true)|(epred4_0 @ X35)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.08/0.26 thf(c_0_4, negated_conjecture, ![X20:(a > $o) > $o, X24:a > $o, X26:a > $o, X27:a, X28:a > $o]:(((((X20 @ (epred1_1 @ X20))|~(X20 @ (^[Z0:a]:(~($true))))|(X20 @ cC))&(~(X20 @ (^[Z0:a]:(((epred1_1 @ X20 @ Z0)|(((Z0)=(esk1_1 @ X20)))))))|~(X20 @ (^[Z0:a]:(~($true))))|(X20 @ cC)))&((((X24 @ (esk2_1 @ X24))|(epred2_0 @ X24))&(((~(X26 @ (esk3_3 @ X26 @ X27 @ X28))|~(X28 @ (esk3_3 @ X26 @ X27 @ X28))|~(epred2_0 @ X26)|(epred2_0 @ X28))&(((esk3_3 @ X26 @ X27 @ X28)!=(X27))|~(X28 @ (esk3_3 @ X26 @ X27 @ X28))|~(epred2_0 @ X26)|(epred2_0 @ X28)))&((X28 @ (esk3_3 @ X26 @ X27 @ X28))|((X26 @ (esk3_3 @ X26 @ X27 @ X28))|((esk3_3 @ X26 @ X27 @ X28)=(X27)))|~(epred2_0 @ X26)|(epred2_0 @ X28))))&~(epred2_0 @ cC)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])])).
% 0.08/0.26 thf(c_0_5, plain, ![X31:a]:(((epred4_0 @ X31)<=>~(($true)))), introduced(definition)).
% 0.08/0.26 thf(c_0_6, plain, ![X2:a]:((~((epred4_0 @ X2))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.08/0.26 thf(c_0_7, negated_conjecture, ![X1:(a > $o) > $o]:(((X1 @ (epred1_1 @ X1))|(X1 @ cC)|~((((X1 @ epred4_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4]), c_0_5])).
% 0.08/0.26 thf(c_0_8, plain, ![X2:a]:(~((epred4_0 @ X2))), inference(cn,[status(thm)],[c_0_6])).
% 0.08/0.26 thf(c_0_9, negated_conjecture, ![X3:a > $o]:(((X3 @ (esk2_1 @ X3))|(epred2_0 @ X3))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.08/0.26 thf(c_0_10, plain, ![X33:a, X34:(a > $o) > $o]:(((~(epred3_1 @ X34 @ X33)|((epred1_1 @ X34 @ X33)|((X33)=(esk1_1 @ X34))))&((~(epred1_1 @ X34 @ X33)|(epred3_1 @ X34 @ X33))&(((X33)!=(esk1_1 @ X34))|(epred3_1 @ X34 @ X33))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 0.08/0.26 thf(c_0_11, negated_conjecture, ![X2:a, X3:a > $o, X6:a > $o]:(((X3 @ (esk3_3 @ X6 @ X2 @ X3))|(X6 @ (esk3_3 @ X6 @ X2 @ X3))|((esk3_3 @ X6 @ X2 @ X3)=(X2))|(epred2_0 @ X3)|~((epred2_0 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.08/0.26 thf(c_0_12, negated_conjecture, ![X1:(a > $o) > $o]:(((X1 @ (epred1_1 @ X1))|(X1 @ cC)|~((X1 @ epred4_0)))), inference(cn,[status(thm)],[c_0_7])).
% 0.08/0.26 thf(c_0_13, plain, (epred2_0 @ epred4_0), inference(spm,[status(thm)],[c_0_8, c_0_9])).
% 0.08/0.26 thf(c_0_14, negated_conjecture, ~((epred2_0 @ cC)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.08/0.26 thf(c_0_15, plain, ![X1:(a > $o) > $o, X2:a]:(((epred3_1 @ X1 @ X2)|~((epred1_1 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.08/0.26 thf(c_0_16, negated_conjecture, ![X2:a, X3:a > $o]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3)=(X2))|(epred1_1 @ epred2_0 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3))|(X3 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3))|(epred2_0 @ X3))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])]), c_0_14])).
% 0.08/0.26 thf(c_0_17, plain, ![X2:a, X3:a > $o]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3)=(X2))|(epred3_1 @ epred2_0 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3))|(X3 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3))|(epred2_0 @ X3))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.08/0.26 thf(c_0_18, negated_conjecture, ![X2:a, X6:a > $o, X3:a > $o]:(((epred2_0 @ X6)|~((X3 @ (esk3_3 @ X3 @ X2 @ X6)))|~((X6 @ (esk3_3 @ X3 @ X2 @ X6)))|~((epred2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.08/0.26 thf(c_0_19, plain, ![X2:a]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(X2))|(epred3_1 @ epred2_0 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0)))|(epred2_0 @ (epred3_1 @ epred2_0)))), inference(ef,[status(thm)],[c_0_17])).
% 0.08/0.26 thf(c_0_20, plain, ![X1:(a > $o) > $o, X2:a]:(((epred1_1 @ X1 @ X2)|((X2)=(esk1_1 @ X1))|~((epred3_1 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.08/0.26 thf(c_0_21, negated_conjecture, ![X2:a]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(X2))|(epred2_0 @ (epred3_1 @ epred2_0))|~((epred1_1 @ epred2_0 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))))|~((epred2_0 @ (epred1_1 @ epred2_0))))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
% 0.08/0.26 thf(c_0_22, plain, ![X2:a]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(esk1_1 @ epred2_0))|((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(X2))|(epred1_1 @ epred2_0 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0)))|(epred2_0 @ (epred3_1 @ epred2_0)))), inference(spm,[status(thm)],[c_0_20, c_0_19])).
% 0.08/0.26 thf(c_0_23, negated_conjecture, ![X2:a]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(esk1_1 @ epred2_0))|((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(X2))|(epred2_0 @ (epred3_1 @ epred2_0))|~((epred2_0 @ (epred1_1 @ epred2_0))))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
% 0.08/0.26 thf(c_0_24, negated_conjecture, ![X2:a]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(esk1_1 @ epred2_0))|((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(X2))|(epred2_0 @ (epred3_1 @ epred2_0)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_12]), c_0_13])]), c_0_14])).
% 0.08/0.26 thf(c_0_25, plain, ![X2:a, X1:(a > $o) > $o]:(((epred3_1 @ X1 @ X2)|((X2)!=(esk1_1 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.08/0.26 thf(c_0_26, plain, ![X30:a, X1:(a > $o) > $o]:(((epred3_1 @ X1 @ X30)<=>((epred1_1 @ X1 @ X30)|((X30)=(esk1_1 @ X1))))), introduced(definition)).
% 0.08/0.26 thf(c_0_27, negated_conjecture, ![X2:a, X6:a > $o, X3:a > $o]:(((epred2_0 @ X6)|((esk3_3 @ X3 @ X2 @ X6)!=(X2))|~((X6 @ (esk3_3 @ X3 @ X2 @ X6)))|~((epred2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.08/0.26 thf(c_0_28, negated_conjecture, (((esk3_3 @ (epred1_1 @ epred2_0) @ (esk1_1 @ epred2_0) @ (epred3_1 @ epred2_0))=(esk1_1 @ epred2_0))|(epred2_0 @ (epred3_1 @ epred2_0))), inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_24])])).
% 0.08/0.26 thf(c_0_29, plain, ![X1:(a > $o) > $o]:((epred3_1 @ X1 @ (esk1_1 @ X1))), inference(er,[status(thm)],[c_0_25])).
% 0.08/0.26 thf(c_0_30, negated_conjecture, ![X1:(a > $o) > $o]:(((X1 @ cC)|~((((X1 @ (epred3_1 @ X1)))=(($true))))|~((((X1 @ epred4_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4]), c_0_5]), c_0_26])).
% 0.08/0.26 thf(c_0_31, negated_conjecture, ((epred2_0 @ (epred3_1 @ epred2_0))|~((epred2_0 @ (epred1_1 @ epred2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29])])).
% 0.08/0.26 thf(c_0_32, negated_conjecture, ![X1:(a > $o) > $o]:(((X1 @ cC)|~((X1 @ (epred3_1 @ X1)))|~((X1 @ epred4_0)))), inference(cn,[status(thm)],[c_0_30])).
% 0.08/0.26 thf(c_0_33, negated_conjecture, (epred2_0 @ (epred3_1 @ epred2_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_12]), c_0_13])]), c_0_14])).
% 0.08/0.26 thf(c_0_34, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_13])]), c_0_14]), ['proof']).
% 0.08/0.26 % SZS output end CNFRefutation
% 0.08/0.26 % Parsed axioms : 3
% 0.08/0.26 % Removed by relevancy pruning/SinE : 2
% 0.08/0.26 % Initial clauses : 12
% 0.08/0.26 % Removed in clause preprocessing : 1
% 0.08/0.26 % Initial clauses in saturation : 11
% 0.08/0.26 % Processed clauses : 47
% 0.08/0.26 % ...of these trivial : 0
% 0.08/0.26 % ...subsumed : 13
% 0.08/0.26 % ...remaining for further processing : 34
% 0.08/0.26 % Other redundant clauses eliminated : 4
% 0.08/0.26 % Clauses deleted for lack of memory : 0
% 0.08/0.26 % Backward-subsumed : 3
% 0.08/0.26 % Backward-rewritten : 4
% 0.08/0.26 % Generated clauses : 71
% 0.08/0.26 % ...of the previous two non-redundant : 54
% 0.08/0.26 % ...aggressively subsumed : 0
% 0.08/0.26 % Contextual simplify-reflections : 0
% 0.08/0.26 % Paramodulations : 57
% 0.08/0.26 % Factorizations : 10
% 0.08/0.26 % NegExts : 0
% 0.08/0.26 % Equation resolutions : 4
% 0.08/0.26 % Disequality decompositions : 0
% 0.08/0.26 % Total rewrite steps : 17
% 0.08/0.26 % ...of those cached : 14
% 0.08/0.26 % Propositional unsat checks : 0
% 0.08/0.26 % Propositional check models : 0
% 0.08/0.26 % Propositional check unsatisfiable : 0
% 0.08/0.26 % Propositional clauses : 0
% 0.08/0.26 % Propositional clauses after purity: 0
% 0.08/0.26 % Propositional unsat core size : 0
% 0.08/0.26 % Propositional preprocessing time : 0.000
% 0.08/0.26 % Propositional encoding time : 0.000
% 0.08/0.26 % Propositional solver time : 0.000
% 0.08/0.26 % Success case prop preproc time : 0.000
% 0.08/0.26 % Success case prop encoding time : 0.000
% 0.08/0.26 % Success case prop solver time : 0.000
% 0.08/0.26 % Current number of processed clauses : 26
% 0.08/0.26 % Positive orientable unit clauses : 3
% 0.08/0.26 % Positive unorientable unit clauses: 0
% 0.08/0.26 % Negative unit clauses : 2
% 0.08/0.26 % Non-unit-clauses : 21
% 0.08/0.26 % Current number of unprocessed clauses: 18
% 0.08/0.26 % ...number of literals in the above : 78
% 0.08/0.26 % Current number of archived formulas : 0
% 0.08/0.26 % Current number of archived clauses : 7
% 0.08/0.26 % Clause-clause subsumption calls (NU) : 180
% 0.08/0.26 % Rec. Clause-clause subsumption calls : 34
% 0.08/0.26 % Non-unit clause-clause subsumptions : 15
% 0.08/0.26 % Unit Clause-clause subsumption calls : 7
% 0.08/0.26 % Rewrite failures with RHS unbound : 0
% 0.08/0.26 % BW rewrite match attempts : 1
% 0.08/0.26 % BW rewrite match successes : 1
% 0.08/0.26 % Condensation attempts : 0
% 0.08/0.26 % Condensation successes : 0
% 0.08/0.26 % Termbank termtop insertions : 3165
% 0.08/0.26 % Search garbage collected termcells : 479
% 0.08/0.26
% 0.08/0.26 % -------------------------------------------------
% 0.08/0.26 % User time : 0.007 s
% 0.08/0.26 % System time : 0.004 s
% 0.08/0.26 % Total time : 0.010 s
% 0.08/0.26 % Maximum resident set size: 3896 pages
% 0.08/0.26
% 0.08/0.26 % -------------------------------------------------
% 0.08/0.26 % User time : 0.007 s
% 0.08/0.26 % System time : 0.009 s
% 0.08/0.26 % Total time : 0.016 s
% 0.08/0.26 % Maximum resident set size: 4864 pages
% 0.08/0.26 % E exiting
%------------------------------------------------------------------------------