%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR146^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 07:46:40 AM UTC 2026
% Result : Theorem 0.22s 0.31s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 100 ( 3 equ; 0 cnn)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 323 ( 60 ~; 51 |; 18 &; 190 @)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 41 ( 4 ^; 34 !; 3 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_54,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_64,type,
instance_THFTYPE_IIiioIioI: ( $i > $i > $o ) > $i > $o ).
thf(decl_79,type,
lChris_THFTYPE_i: $i ).
thf(decl_84,type,
lCorina_THFTYPE_i: $i ).
thf(decl_95,type,
lIrreflexiveRelation_THFTYPE_i: $i ).
thf(decl_135,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_149,type,
n2009_THFTYPE_i: $i ).
thf(decl_178,type,
wife_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_183,type,
esk5_1: ( $i > $i > $o ) > $i ).
thf(con,conjecture,
? [X71: $i > $i > $o] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( X71 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) )
& ( X71
!= ( ^ [X5: $i,X6: $i] : $true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Dqgm6nnkM0/E---3.1_1095749.p',con) ).
thf(ax_084,axiom,
! [X52: $i,X29: $o] :
( ( holdsDuring_THFTYPE_IiooI @ X52 @ ~ X29 )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X52 @ X29 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Dqgm6nnkM0/E---3.1_1095749.p',ax_084) ).
thf(ax_110,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.Dqgm6nnkM0/E---3.1_1095749.p',ax_110) ).
thf(ax_057,axiom,
! [X7: $i] : ( holdsDuring_THFTYPE_IiooI @ X7 @ $true ),
file('/export/starexec/sandbox2/tmp/tmp.Dqgm6nnkM0/E---3.1_1095749.p',ax_057) ).
thf(ax_031,axiom,
! [X33: $i > $i > $o] :
( ( instance_THFTYPE_IIiioIioI @ X33 @ lIrreflexiveRelation_THFTYPE_i )
<=> ! [X34: $i] :
~ ( X33 @ X34 @ X34 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Dqgm6nnkM0/E---3.1_1095749.p',ax_031) ).
thf(ax_179,axiom,
instance_THFTYPE_IIiioIioI @ wife_THFTYPE_IiioI @ lIrreflexiveRelation_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.Dqgm6nnkM0/E---3.1_1095749.p',ax_179) ).
thf(c_0_6,negated_conjecture,
~ ? [X71: $i > $i > $o] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( X71 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) )
& ( X71
!= ( ^ [X5: $i,X6: $i] : $true ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_7,negated_conjecture,
~ ? [X71: $i > $i > $o] :
( ( ~ ( X71 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( X71 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) )
& ~ ! [X260: $i,X261: $i] :
( ( X71 @ X260 @ X261 )
<=> $true ) ),
inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_6])])]) ).
thf(c_0_8,plain,
! [X52: $i,X29: $o] :
( ( ( X29
| ( holdsDuring_THFTYPE_IiooI @ X52 @ $true ) )
& ( ~ X29
| ( holdsDuring_THFTYPE_IiooI @ X52 @ $false ) ) )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X52 @ X29 ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_084])]) ).
thf(c_0_9,negated_conjecture,
! [X463: $i > $i > $o,X464: $i,X465: $i] :
( ( ~ ( X463 @ X464 @ X465 )
| $true
| ~ ( X463 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ( X463 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) )
& ( ~ $true
| ( X463 @ X464 @ X465 )
| ~ ( X463 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ( X463 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) )
& ( ~ ( X463 @ X464 @ X465 )
| $true
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X463 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) )
& ( ~ $true
| ( X463 @ X464 @ X465 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X463 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) )
& ( ~ ( X463 @ X464 @ X465 )
| $true
| ~ ( X463 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ $true
| ( X463 @ X464 @ X465 )
| ~ ( X463 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( X463 @ X464 @ X465 )
| $true
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ $true
| ( X463 @ X464 @ X465 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
thf(c_0_10,axiom,
( ( ~ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_110]) ).
thf(c_0_11,plain,
! [X388: $i,X389: $o] :
( ( X389
| ~ X389
| ~ ( holdsDuring_THFTYPE_IiooI @ X388 @ X389 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X388 @ $false )
| ~ X389
| ~ ( holdsDuring_THFTYPE_IiooI @ X388 @ X389 ) )
& ( X389
| ~ ( holdsDuring_THFTYPE_IiooI @ X388 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X388 @ X389 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X388 @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ X388 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X388 @ X389 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
thf(c_0_12,plain,
! [X349: $i] : ( holdsDuring_THFTYPE_IiooI @ X349 @ $true ),
inference(variable_rename,[status(thm)],[ax_057]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i,X9: $i > $i > $o] :
( ( X9 @ X1 @ X2 )
| ~ $true
| ~ ( X9 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
( ( ~ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
! [X1: $i] :
( ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_11])])]) ).
thf(c_0_16,plain,
! [X1: $i] : ( holdsDuring_THFTYPE_IiooI @ X1 @ $true ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X2: $i,X9: $i > $i > $o] :
( ( X9 @ X1 @ X2 )
| ~ ( X9 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(cn,[status(thm)],[c_0_13]) ).
thf(c_0_18,plain,
! [X313: $i > $i > $o,X314: $i,X315: $i > $i > $o] :
( ( ~ ( instance_THFTYPE_IIiioIioI @ X313 @ lIrreflexiveRelation_THFTYPE_i )
| ~ ( X313 @ X314 @ X314 ) )
& ( ( X315 @ ( esk5_1 @ X315 ) @ ( esk5_1 @ X315 ) )
| ( instance_THFTYPE_IIiioIioI @ X315 @ lIrreflexiveRelation_THFTYPE_i ) ) ),
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)],[ax_031])])])])])]) ).
thf(c_0_19,plain,
( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_20,plain,
! [X1: $i] :
~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X2: $i,X9: $i > $i > $o] :
( ( X9 @ X1 @ X2 )
| ~ ( X9 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16])]) ).
thf(c_0_22,plain,
! [X9: $i > $i > $o,X1: $i] :
( ~ ( instance_THFTYPE_IIiioIioI @ X9 @ lIrreflexiveRelation_THFTYPE_i )
| ~ ( X9 @ X1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,plain,
instance_THFTYPE_IIiioIioI @ wife_THFTYPE_IiioI @ lIrreflexiveRelation_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_179]) ).
thf(c_0_24,plain,
wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
inference(sr,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i] : ( lChris_THFTYPE_i = X1 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_21]) ).
thf(c_0_26,plain,
! [X1: $i] :
~ ( wife_THFTYPE_IiioI @ X1 @ X1 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR146^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n006.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 17:56:24 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/0.25 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.Dqgm6nnkM0/E---3.1_1095749.p
% 0.22/0.31 % Version: 3.5.1-ho
% 0.22/0.31 % Preprocessing class: HSLMSMSMSSSNHSA.
% 0.22/0.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.31 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.31 % Starting sh7 with 300s (1) cores
% 0.22/0.31 % Starting ho_unfolding_2 with 300s (1) cores
% 0.22/0.31 % Starting new_bool_12 with 300s (1) cores
% 0.22/0.31 % ho_unfolding_3 with pid 1095782 completed with status 0
% 0.22/0.31 % Result found by ho_unfolding_3
% 0.22/0.31 % Preprocessing class: HSLMSMSMSSSNHSA.
% 0.22/0.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.31 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.31 % No SInE strategy applied
% 0.22/0.31 % Search class: HGHSS-FSLM21-SHSFFFBN
% 0.22/0.31 % partial match(3): HGHSM-FSLM31-DHSFFFBN
% 0.22/0.31 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.31 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.31 % Starting ho_unfolding_3 with 151s (1) cores
% 0.22/0.31 % Starting full_lambda_10 with 264s (1) cores
% 0.22/0.31 % Starting new_bool_8 with 262s (1) cores
% 0.22/0.31 % Starting new_bool_9 with 259s (1) cores
% 0.22/0.31 % ho_unfolding_3 with pid 1095794 completed with status 0
% 0.22/0.31 % Result found by ho_unfolding_3
% 0.22/0.31 % Preprocessing class: HSLMSMSMSSSNHSA.
% 0.22/0.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.31 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.31 % No SInE strategy applied
% 0.22/0.31 % Search class: HGHSS-FSLM21-SHSFFFBN
% 0.22/0.31 % partial match(3): HGHSM-FSLM31-DHSFFFBN
% 0.22/0.31 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.31 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.31 % Starting ho_unfolding_3 with 151s (1) cores
% 0.22/0.31 % Preprocessing time : 0.003 s
% 0.22/0.31 % Presaturation interreduction done
% 0.22/0.31
% 0.22/0.31 % Proof found!
% 0.22/0.31 % SZS status Theorem
% 0.22/0.31 % SZS output start CNFRefutation
% See solution above
% 0.22/0.31 % Parsed axioms : 500
% 0.22/0.31 % Removed by relevancy pruning/SinE : 0
% 0.22/0.31 % Initial clauses : 535
% 0.22/0.31 % Removed in clause preprocessing : 172
% 0.22/0.31 % Initial clauses in saturation : 363
% 0.22/0.31 % Processed clauses : 568
% 0.22/0.31 % ...of these trivial : 5
% 0.22/0.31 % ...subsumed : 5
% 0.22/0.31 % ...remaining for further processing : 558
% 0.22/0.31 % Other redundant clauses eliminated : 4
% 0.22/0.31 % Clauses deleted for lack of memory : 0
% 0.22/0.31 % Backward-subsumed : 0
% 0.22/0.31 % Backward-rewritten : 78
% 0.22/0.31 % Generated clauses : 16
% 0.22/0.31 % ...of the previous two non-redundant : 31
% 0.22/0.31 % ...aggressively subsumed : 0
% 0.22/0.31 % Contextual simplify-reflections : 0
% 0.22/0.31 % Paramodulations : 8
% 0.22/0.31 % Factorizations : 0
% 0.22/0.31 % NegExts : 0
% 0.22/0.31 % Equation resolutions : 4
% 0.22/0.31 % Disequality decompositions : 0
% 0.22/0.31 % Total rewrite steps : 31
% 0.22/0.31 % ...of those cached : 0
% 0.22/0.31 % Propositional unsat checks : 0
% 0.22/0.31 % Propositional check models : 0
% 0.22/0.31 % Propositional check unsatisfiable : 0
% 0.22/0.31 % Propositional clauses : 0
% 0.22/0.31 % Propositional clauses after purity: 0
% 0.22/0.31 % Propositional unsat core size : 0
% 0.22/0.31 % Propositional preprocessing time : 0.000
% 0.22/0.31 % Propositional encoding time : 0.000
% 0.22/0.31 % Propositional solver time : 0.000
% 0.22/0.31 % Success case prop preproc time : 0.000
% 0.22/0.31 % Success case prop encoding time : 0.000
% 0.22/0.31 % Success case prop solver time : 0.000
% 0.22/0.31 % Current number of processed clauses : 124
% 0.22/0.31 % Positive orientable unit clauses : 113
% 0.22/0.31 % Positive unorientable unit clauses: 1
% 0.22/0.31 % Negative unit clauses : 7
% 0.22/0.31 % Non-unit-clauses : 3
% 0.22/0.31 % Current number of unprocessed clauses: 161
% 0.22/0.31 % ...number of literals in the above : 293
% 0.22/0.31 % Current number of archived formulas : 0
% 0.22/0.31 % Current number of archived clauses : 431
% 0.22/0.31 % Clause-clause subsumption calls (NU) : 1651
% 0.22/0.31 % Rec. Clause-clause subsumption calls : 1072
% 0.22/0.31 % Non-unit clause-clause subsumptions : 1
% 0.22/0.31 % Unit Clause-clause subsumption calls : 185
% 0.22/0.31 % Rewrite failures with RHS unbound : 0
% 0.22/0.31 % BW rewrite match attempts : 323
% 0.22/0.31 % BW rewrite match successes : 70
% 0.22/0.31 % Condensation attempts : 568
% 0.22/0.31 % Condensation successes : 1
% 0.22/0.31 % Termbank termtop insertions : 20630
% 0.22/0.31 % Search garbage collected termcells : 2751
% 0.22/0.31
% 0.22/0.31 % -------------------------------------------------
% 0.22/0.31 % User time : 0.027 s
% 0.22/0.31 % System time : 0.007 s
% 0.22/0.31 % Total time : 0.034 s
% 0.22/0.31 % Maximum resident set size: 4732 pages
% 0.22/0.31
% 0.22/0.31 % -------------------------------------------------
% 0.22/0.31 % User time : 0.106 s
% 0.22/0.31 % System time : 0.031 s
% 0.22/0.31 % Total time : 0.137 s
% 0.22/0.31 % Maximum resident set size: 5120 pages
% 0.22/0.31 % E exiting
%------------------------------------------------------------------------------