%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP167^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:05:43 AM UTC 2026
% Result : Theorem 1.77s 0.58s
% Output : CNFRefutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 195 ( 0 equ; 0 cnn)
% Maximal formula atoms : 29 ( 6 avg)
% Number of connectives : 463 ( 30 ~; 28 |; 7 &; 392 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 10 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 120 ( 120 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 4 con; 0-6 aty)
% Number of variables : 57 ( 0 ^; 57 !; 0 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
list_char: $tType ).
thf(decl_sort2,type,
int: $tType ).
thf(decl_sort3,type,
com: $tType ).
thf(decl_28,type,
skip: com ).
thf(decl_65,type,
relati1310524937decomp: ( ( list_char > int ) > ( list_char > int ) > $o ) > com > com > ( ( list_char > int ) > ( list_char > int ) > $o ) > ( list_char > int ) > ( list_char > int ) > $o ).
thf(decl_68,type,
relati2102071307_hoare: ( ( list_char > int ) > ( list_char > int ) > $o ) > com > com > ( ( list_char > int ) > ( list_char > int ) > $o ) > $o ).
thf(decl_69,type,
relati775585786_valid: ( ( list_char > int ) > ( list_char > int ) > $o ) > com > com > ( ( list_char > int ) > ( list_char > int ) > $o ) > $o ).
thf(decl_89,type,
p: ( list_char > int ) > ( list_char > int ) > $o ).
thf(decl_90,type,
q: ( list_char > int ) > ( list_char > int ) > $o ).
thf(decl_91,type,
c: com ).
thf(decl_92,type,
c2: com ).
thf(conj_0,conjecture,
( ( relati2102071307_hoare @ p @ c @ c2 @ q )
<=> ( ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
& ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gd58yzY5lj/E---3.1_1777041.p',conj_0) ).
thf(fact_1_completeness,axiom,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 )
=> ( relati2102071307_hoare @ X1 @ X2 @ X3 @ X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.gd58yzY5lj/E---3.1_1777041.p',fact_1_completeness) ).
thf(fact_8_ir__valid__decomp1,axiom,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 )
=> ( ( relati775585786_valid @ X1 @ X2 @ skip @ ( relati1310524937decomp @ X1 @ X2 @ X3 @ X4 ) )
& ( relati775585786_valid @ ( relati1310524937decomp @ X1 @ X2 @ X3 @ X4 ) @ skip @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gd58yzY5lj/E---3.1_1777041.p',fact_8_ir__valid__decomp1) ).
thf(fact_0_soundness,axiom,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati2102071307_hoare @ X1 @ X2 @ X3 @ X4 )
=> ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.gd58yzY5lj/E---3.1_1777041.p',fact_0_soundness) ).
thf(fact_9_ir__valid__decomp2,axiom,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X15: ( list_char > int ) > ( list_char > int ) > $o,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( ( relati775585786_valid @ X1 @ X2 @ skip @ X15 )
& ( relati775585786_valid @ X15 @ skip @ X3 @ X4 ) )
=> ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.gd58yzY5lj/E---3.1_1777041.p',fact_9_ir__valid__decomp2) ).
thf(c_0_5,negated_conjecture,
~ ( ( relati2102071307_hoare @ p @ c @ c2 @ q )
<=> ( ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
& ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_6,negated_conjecture,
( ( ~ ( relati2102071307_hoare @ p @ c @ c2 @ q )
| ~ ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ~ ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q ) )
& ( ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) )
& ( ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
thf(c_0_7,plain,
! [X2047: ( list_char > int ) > ( list_char > int ) > $o,X2048: com,X2049: com,X2050: ( list_char > int ) > ( list_char > int ) > $o] :
( ~ ( relati775585786_valid @ X2047 @ X2048 @ X2049 @ X2050 )
| ( relati2102071307_hoare @ X2047 @ X2048 @ X2049 @ X2050 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1_completeness])])]) ).
thf(c_0_8,negated_conjecture,
( ~ ( relati2102071307_hoare @ p @ c @ c2 @ q )
| ~ ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ~ ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati2102071307_hoare @ X1 @ X2 @ X3 @ X4 )
| ~ ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
( ~ ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ~ ( relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ~ ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_11,plain,
! [X2084: ( list_char > int ) > ( list_char > int ) > $o,X2085: com,X2086: com,X2087: ( list_char > int ) > ( list_char > int ) > $o] :
( ( ( relati775585786_valid @ X2084 @ X2085 @ skip @ ( relati1310524937decomp @ X2084 @ X2085 @ X2086 @ X2087 ) )
| ~ ( relati775585786_valid @ X2084 @ X2085 @ X2086 @ X2087 ) )
& ( ( relati775585786_valid @ ( relati1310524937decomp @ X2084 @ X2085 @ X2086 @ X2087 ) @ skip @ X2086 @ X2087 )
| ~ ( relati775585786_valid @ X2084 @ X2085 @ X2086 @ X2087 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_ir__valid__decomp1])])])]) ).
thf(c_0_12,plain,
! [X2043: ( list_char > int ) > ( list_char > int ) > $o,X2044: com,X2045: com,X2046: ( list_char > int ) > ( list_char > int ) > $o] :
( ~ ( relati2102071307_hoare @ X2043 @ X2044 @ X2045 @ X2046 )
| ( relati775585786_valid @ X2043 @ X2044 @ X2045 @ X2046 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_soundness])])]) ).
thf(c_0_13,negated_conjecture,
( ~ ( relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ~ ( relati775585786_valid @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ~ ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
thf(c_0_14,plain,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ ( relati1310524937decomp @ X1 @ X2 @ X3 @ X4 ) @ skip @ X3 @ X4 )
| ~ ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,plain,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 )
| ~ ( relati2102071307_hoare @ X1 @ X2 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
( ( relati2102071307_hoare @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_17,negated_conjecture,
( ~ ( relati775585786_valid @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ~ ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
thf(c_0_18,plain,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ X1 @ X2 @ skip @ ( relati1310524937decomp @ X1 @ X2 @ X3 @ X4 ) )
| ~ ( relati775585786_valid @ X1 @ X2 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_19,plain,
! [X2088: ( list_char > int ) > ( list_char > int ) > $o,X2089: com,X2090: ( list_char > int ) > ( list_char > int ) > $o,X2091: com,X2092: ( list_char > int ) > ( list_char > int ) > $o] :
( ~ ( relati775585786_valid @ X2088 @ X2089 @ skip @ X2090 )
| ~ ( relati775585786_valid @ X2090 @ skip @ X2091 @ X2092 )
| ( relati775585786_valid @ X2088 @ X2089 @ X2091 @ X2092 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_9_ir__valid__decomp2])])]) ).
thf(c_0_20,negated_conjecture,
( ( relati775585786_valid @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ) )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_21,negated_conjecture,
~ ( relati2102071307_hoare @ p @ c @ c2 @ q ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]) ).
thf(c_0_22,negated_conjecture,
( ( relati2102071307_hoare @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_23,plain,
! [X1: ( list_char > int ) > ( list_char > int ) > $o,X2: com,X3: com,X4: ( list_char > int ) > ( list_char > int ) > $o,X5: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ X1 @ X2 @ X3 @ X5 )
| ~ ( relati775585786_valid @ X1 @ X2 @ skip @ X4 )
| ~ ( relati775585786_valid @ X4 @ skip @ X3 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_24,negated_conjecture,
relati775585786_valid @ p @ c @ skip @ ( relati1310524937decomp @ p @ c @ c2 @ q ),
inference(sr,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_25,negated_conjecture,
( ( relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q )
| ( relati2102071307_hoare @ p @ c @ c2 @ q ) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
thf(c_0_26,negated_conjecture,
! [X2: com,X1: ( list_char > int ) > ( list_char > int ) > $o] :
( ( relati775585786_valid @ p @ c @ X2 @ X1 )
| ~ ( relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_27,negated_conjecture,
relati775585786_valid @ ( relati1310524937decomp @ p @ c @ c2 @ q ) @ skip @ c2 @ q,
inference(sr,[status(thm)],[c_0_25,c_0_21]) ).
thf(c_0_28,negated_conjecture,
~ ( relati775585786_valid @ p @ c @ c2 @ q ),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
thf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP167^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.17 % Computer : n004.cluster.edu
% 0.13/0.17 % Model : x86_64 x86_64
% 0.13/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.17 % Memory : 8046.5625MB
% 0.13/0.17 % OS : Linux 6.8.0-71-generic
% 0.13/0.17 % CPULimit : 300
% 0.13/0.17 % WCLimit : 300
% 0.13/0.17 % DateTime : Tue Sep 29 20:04:52 UTC 2026
% 0.13/0.17 % CPUTime :
% 0.13/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.21 Running higher-order theorem proving
% 0.13/0.24 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.gd58yzY5lj/E---3.1_1777041.p
% 1.77/0.58 % Version: 3.5.1-ho
% 1.77/0.58 % Preprocessing class: HSLSSMSSSSLNHHA.
% 1.77/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.77/0.58 % Starting full_lambda_1 with 1200s (4) cores
% 1.77/0.58 % Starting additional_ho_7 with 600s (2) cores
% 1.77/0.58 % Starting full_lambda_3 with 300s (1) cores
% 1.77/0.58 % Starting lpo8_s with 300s (1) cores
% 1.77/0.58 % full_lambda_1 with pid 1777054 completed with status 0
% 1.77/0.58 % Result found by full_lambda_1
% 1.77/0.58 % Preprocessing class: HSLSSMSSSSLNHHA.
% 1.77/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.77/0.58 % Starting full_lambda_1 with 1200s (4) cores
% 1.77/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 1.77/0.58 % No SInE strategy applied
% 1.77/0.58 % Search class: HGHSM-FSLM32-DHHFFSBN
% 1.77/0.58 % partial match(1): HGHSM-FSLM32-DHSFFSBN
% 1.77/0.58 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 1.77/0.58 % Starting SubtermCWHack with 109s (1) cores
% 1.77/0.58 % Starting full_lambda_1 with 121s (1) cores
% 1.77/0.58 % Starting sh4l with 172s (1) cores
% 1.77/0.58 % Starting pre_casc_4 with 163s (1) cores
% 1.77/0.58 % full_lambda_1 with pid 1777063 completed with status 0
% 1.77/0.58 % Result found by full_lambda_1
% 1.77/0.58 % Preprocessing class: HSLSSMSSSSLNHHA.
% 1.77/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.77/0.58 % Starting full_lambda_1 with 1200s (4) cores
% 1.77/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 1.77/0.58 % No SInE strategy applied
% 1.77/0.58 % Search class: HGHSM-FSLM32-DHHFFSBN
% 1.77/0.58 % partial match(1): HGHSM-FSLM32-DHSFFSBN
% 1.77/0.58 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 1.77/0.58 % Starting SubtermCWHack with 109s (1) cores
% 1.77/0.58 % Starting full_lambda_1 with 121s (1) cores
% 1.77/0.58 % Preprocessing time : 0.007 s
% 1.77/0.58
% 1.77/0.58 % Proof found!
% 1.77/0.58 % SZS status Theorem
% 1.77/0.58 % SZS output start CNFRefutation
% See solution above
% 1.77/0.58 % Parsed axioms : 439
% 1.77/0.58 % Removed by relevancy pruning/SinE : 0
% 1.77/0.58 % Initial clauses : 634
% 1.77/0.58 % Removed in clause preprocessing : 106
% 1.77/0.58 % Initial clauses in saturation : 528
% 1.77/0.58 % Processed clauses : 1048
% 1.77/0.58 % ...of these trivial : 40
% 1.77/0.58 % ...subsumed : 314
% 1.77/0.58 % ...remaining for further processing : 694
% 1.77/0.58 % Other redundant clauses eliminated : 5021
% 1.77/0.58 % Clauses deleted for lack of memory : 0
% 1.77/0.58 % Backward-subsumed : 4
% 1.77/0.58 % Backward-rewritten : 25
% 1.77/0.58 % Generated clauses : 13052
% 1.77/0.58 % ...of the previous two non-redundant : 7785
% 1.77/0.58 % ...aggressively subsumed : 0
% 1.77/0.58 % Contextual simplify-reflections : 2
% 1.77/0.58 % Paramodulations : 3948
% 1.77/0.58 % Factorizations : 96
% 1.77/0.58 % NegExts : 34
% 1.77/0.58 % Equation resolutions : 5047
% 1.77/0.58 % Disequality decompositions : 0
% 1.77/0.58 % Total rewrite steps : 990
% 1.77/0.58 % ...of those cached : 670
% 1.77/0.58 % Propositional unsat checks : 0
% 1.77/0.58 % Propositional check models : 0
% 1.77/0.58 % Propositional check unsatisfiable : 0
% 1.77/0.58 % Propositional clauses : 0
% 1.77/0.58 % Propositional clauses after purity: 0
% 1.77/0.58 % Propositional unsat core size : 0
% 1.77/0.58 % Propositional preprocessing time : 0.000
% 1.77/0.58 % Propositional encoding time : 0.000
% 1.77/0.58 % Propositional solver time : 0.000
% 1.77/0.58 % Success case prop preproc time : 0.000
% 1.77/0.58 % Success case prop encoding time : 0.000
% 1.77/0.58 % Success case prop solver time : 0.000
% 1.77/0.58 % Current number of processed clauses : 597
% 1.77/0.58 % Positive orientable unit clauses : 151
% 1.77/0.58 % Positive unorientable unit clauses: 7
% 1.77/0.58 % Negative unit clauses : 65
% 1.77/0.58 % Non-unit-clauses : 374
% 1.77/0.58 % Current number of unprocessed clauses: 7245
% 1.77/0.58 % ...number of literals in the above : 40141
% 1.77/0.58 % Current number of archived formulas : 0
% 1.77/0.58 % Current number of archived clauses : 47
% 1.77/0.58 % Clause-clause subsumption calls (NU) : 40459
% 1.77/0.58 % Rec. Clause-clause subsumption calls : 20339
% 1.77/0.58 % Non-unit clause-clause subsumptions : 105
% 1.77/0.58 % Unit Clause-clause subsumption calls : 14825
% 1.77/0.58 % Rewrite failures with RHS unbound : 30
% 1.77/0.58 % BW rewrite match attempts : 199
% 1.77/0.58 % BW rewrite match successes : 70
% 1.77/0.58 % Condensation attempts : 1048
% 1.77/0.58 % Condensation successes : 0
% 1.77/0.58 % Termbank termtop insertions : 397054
% 1.77/0.58 % Search garbage collected termcells : 14072
% 1.77/0.58
% 1.77/0.58 % -------------------------------------------------
% 1.77/0.58 % User time : 0.270 s
% 1.77/0.58 % System time : 0.024 s
% 1.77/0.58 % Total time : 0.294 s
% 1.77/0.58 % Maximum resident set size: 7572 pages
% 1.77/0.58
% 1.77/0.58 % -------------------------------------------------
% 1.77/0.58 % User time : 0.812 s
% 1.77/0.58 % System time : 0.054 s
% 1.77/0.58 % Total time : 0.867 s
% 1.77/0.58 % Maximum resident set size: 5888 pages
% 1.77/0.58 % E exiting
%------------------------------------------------------------------------------