%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ086^1 : 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 : n007.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:20:33 AM UTC 2026
% Result : Theorem 0.23s 0.28s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 48 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 159 ( 16 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 300 ( 56 ~; 48 |; 8 &; 188 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 6 con; 0-3 aty)
% Number of variables : 87 ( 36 ^; 51 !; 0 ?; 87 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_25,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_40,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
peter: $i > $i > $o ).
thf(decl_55,type,
john: $i > $i > $o ).
thf(decl_57,type,
time: $i > $o ).
thf(decl_58,type,
place: $i > $o ).
thf(decl_59,type,
appointment: $i > $o ).
thf(decl_64,type,
esk5_0: $i ).
thf(decl_65,type,
esk6_0: $i ).
thf(decl_66,type,
esk7_0: $i ).
thf(decl_67,type,
esk8_0: $i ).
thf(decl_68,type,
esk9_0: $i ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',mvalid) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] : ( X13 @ X15 @ X15 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',mreflexive) ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',mimplies) ).
thf(ax_b,axiom,
mvalid @ ( mbox @ peter @ ( mbox @ john @ place ) ),
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',ax_b) ).
thf(refl_peter,axiom,
mreflexive @ peter,
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',refl_peter) ).
thf(ax_a,axiom,
mvalid @ ( mbox @ peter @ time ),
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',ax_a) ).
thf(refl_john,axiom,
mreflexive @ john,
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',refl_john) ).
thf(ax_d,axiom,
mvalid @ ( mbox @ peter @ ( mbox @ john @ ( mimplies @ ( mand @ place @ time ) @ appointment ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',ax_d) ).
thf(conj,conjecture,
mvalid @ ( mand @ ( mbox @ peter @ ( mbox @ john @ appointment ) ) @ ( mbox @ john @ ( mbox @ peter @ appointment ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Uas1FLfO5p/E---3.1_3343729.p',conj) ).
thf(c_0_13,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_14,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_15,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] : ( Z0 @ X15 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_16,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_17,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_18,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_19,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_20,plain,
! [X48: $i,X47: $i] :
( ~ ( peter @ X48 @ X47 )
| ! [X46: $i] :
( ~ ( john @ X47 @ X46 )
| ( place @ X46 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax_b,c_0_13]),c_0_14])]) ).
thf(c_0_21,plain,
! [X22: $i] : ( peter @ X22 @ X22 ),
inference(apply_def,[status(thm)],[refl_peter,c_0_15]) ).
thf(c_0_22,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
thf(c_0_23,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_17]),c_0_18]) ).
thf(c_0_24,plain,
! [X45: $i,X44: $i] :
( ~ ( peter @ X45 @ X44 )
| ( time @ X44 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax_a,c_0_13]),c_0_14])]) ).
thf(c_0_25,plain,
! [X85: $i,X86: $i,X87: $i] :
( ~ ( peter @ X85 @ X86 )
| ~ ( john @ X86 @ X87 )
| ( place @ X87 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_20])])]) ).
thf(c_0_26,plain,
! [X61: $i] : ( peter @ X61 @ X61 ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
thf(c_0_27,plain,
! [X23: $i] : ( john @ X23 @ X23 ),
inference(apply_def,[status(thm)],[refl_john,c_0_15]) ).
thf(c_0_28,plain,
! [X55: $i,X54: $i] :
( ~ ( peter @ X55 @ X54 )
| ! [X53: $i] :
( ~ ( john @ X54 @ X53 )
| ~ ~ ( ~ ( place @ X53 )
| ~ ( time @ X53 ) )
| ( appointment @ X53 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax_d,c_0_22]),c_0_23]),c_0_13]),c_0_14])]) ).
thf(c_0_29,plain,
! [X83: $i,X84: $i] :
( ~ ( peter @ X83 @ X84 )
| ( time @ X84 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_24])]) ).
thf(c_0_30,plain,
! [X3: $i,X14: $i,X15: $i] :
( ( place @ X15 )
| ~ ( peter @ X3 @ X14 )
| ~ ( john @ X14 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_31,plain,
! [X3: $i] : ( peter @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_32,plain,
! [X62: $i] : ( john @ X62 @ X62 ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
thf(c_0_33,plain,
! [X92: $i,X93: $i,X94: $i] :
( ~ ( peter @ X92 @ X93 )
| ~ ( john @ X93 @ X94 )
| ~ ( place @ X94 )
| ~ ( time @ X94 )
| ( appointment @ X94 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])]) ).
thf(c_0_34,plain,
! [X3: $i,X14: $i] :
( ( time @ X14 )
| ~ ( peter @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_35,plain,
! [X14: $i,X3: $i] :
( ( place @ X3 )
| ~ ( john @ X14 @ X3 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_36,plain,
! [X3: $i] : ( john @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_37,negated_conjecture,
~ ( mvalid @ ( mand @ ( mbox @ peter @ ( mbox @ john @ appointment ) ) @ ( mbox @ john @ ( mbox @ peter @ appointment ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_38,plain,
! [X3: $i,X14: $i,X15: $i] :
( ( appointment @ X15 )
| ~ ( peter @ X3 @ X14 )
| ~ ( john @ X14 @ X15 )
| ~ ( place @ X15 )
| ~ ( time @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_39,plain,
! [X3: $i] : ( time @ X3 ),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
thf(c_0_40,plain,
! [X3: $i] : ( place @ X3 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
thf(c_0_41,negated_conjecture,
~ ! [X60: $i] :
~ ( ~ ! [X57: $i] :
( ~ ( peter @ X60 @ X57 )
| ! [X56: $i] :
( ~ ( john @ X57 @ X56 )
| ( appointment @ X56 ) ) )
| ~ ! [X59: $i] :
( ~ ( john @ X60 @ X59 )
| ! [X58: $i] :
( ~ ( peter @ X59 @ X58 )
| ( appointment @ X58 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_37,c_0_22]),c_0_13]),c_0_14])]) ).
thf(c_0_42,plain,
! [X15: $i,X14: $i,X3: $i] :
( ( appointment @ X3 )
| ~ ( peter @ X14 @ X15 )
| ~ ( john @ X15 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
thf(c_0_43,negated_conjecture,
( ( ( john @ esk5_0 @ esk8_0 )
| ( peter @ esk5_0 @ esk6_0 ) )
& ( ( peter @ esk8_0 @ esk9_0 )
| ( peter @ esk5_0 @ esk6_0 ) )
& ( ~ ( appointment @ esk9_0 )
| ( peter @ esk5_0 @ esk6_0 ) )
& ( ( john @ esk5_0 @ esk8_0 )
| ( john @ esk6_0 @ esk7_0 ) )
& ( ( peter @ esk8_0 @ esk9_0 )
| ( john @ esk6_0 @ esk7_0 ) )
& ( ~ ( appointment @ esk9_0 )
| ( john @ esk6_0 @ esk7_0 ) )
& ( ( john @ esk5_0 @ esk8_0 )
| ~ ( appointment @ esk7_0 ) )
& ( ( peter @ esk8_0 @ esk9_0 )
| ~ ( appointment @ esk7_0 ) )
& ( ~ ( appointment @ esk9_0 )
| ~ ( appointment @ esk7_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])])]) ).
thf(c_0_44,plain,
! [X14: $i,X3: $i] :
( ( appointment @ X3 )
| ~ ( john @ X14 @ X3 ) ),
inference(spm,[status(thm)],[c_0_42,c_0_31]) ).
thf(c_0_45,negated_conjecture,
( ~ ( appointment @ esk9_0 )
| ~ ( appointment @ esk7_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
thf(c_0_46,plain,
! [X3: $i] : ( appointment @ X3 ),
inference(spm,[status(thm)],[c_0_44,c_0_36]) ).
thf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ086^1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n007.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 13:19:55 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.08/0.26 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.Uas1FLfO5p/E---3.1_3343729.p
% 0.23/0.28 % Version: 3.5.1-ho
% 0.23/0.28 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.28 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.28 % Starting almost_fo_3_lam with 300s (1) cores
% 0.23/0.28 % Starting post_as_ho1 with 300s (1) cores
% 0.23/0.28 % ehoh_best2_full_lfho with pid 3343743 completed with status 0
% 0.23/0.28 % Result found by ehoh_best2_full_lfho
% 0.23/0.28 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.28 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.28 % No SInE strategy applied
% 0.23/0.28 % Search class: HGHNS-FFMS22-SHSSMSBN
% 0.23/0.28 % partial match(3): HGHNF-FFMF21-SHSSMSBN
% 0.23/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.28 % SubtermCWHack with pid 3343748 completed with status 0
% 0.23/0.28 % Result found by SubtermCWHack
% 0.23/0.28 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.28 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.28 % No SInE strategy applied
% 0.23/0.28 % Search class: HGHNS-FFMS22-SHSSMSBN
% 0.23/0.28 % partial match(3): HGHNF-FFMF21-SHSSMSBN
% 0.23/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.28 % Preprocessing time : 0.002 s
% 0.23/0.28
% 0.23/0.28 % Proof found!
% 0.23/0.28 % SZS status Theorem
% 0.23/0.28 % SZS output start CNFRefutation
% See solution above
% 0.23/0.28 % Parsed axioms : 82
% 0.23/0.28 % Removed by relevancy pruning/SinE : 0
% 0.23/0.28 % Initial clauses : 63
% 0.23/0.28 % Removed in clause preprocessing : 38
% 0.23/0.28 % Initial clauses in saturation : 25
% 0.23/0.28 % Processed clauses : 24
% 0.23/0.28 % ...of these trivial : 0
% 0.23/0.28 % ...subsumed : 0
% 0.23/0.28 % ...remaining for further processing : 24
% 0.23/0.28 % Other redundant clauses eliminated : 0
% 0.23/0.28 % Clauses deleted for lack of memory : 0
% 0.23/0.28 % Backward-subsumed : 2
% 0.23/0.28 % Backward-rewritten : 8
% 0.23/0.28 % Generated clauses : 23
% 0.23/0.28 % ...of the previous two non-redundant : 21
% 0.23/0.28 % ...aggressively subsumed : 0
% 0.23/0.28 % Contextual simplify-reflections : 0
% 0.23/0.28 % Paramodulations : 23
% 0.23/0.28 % Factorizations : 0
% 0.23/0.28 % NegExts : 0
% 0.23/0.28 % Equation resolutions : 0
% 0.23/0.28 % Disequality decompositions : 0
% 0.23/0.28 % Total rewrite steps : 12
% 0.23/0.28 % ...of those cached : 5
% 0.23/0.28 % Propositional unsat checks : 0
% 0.23/0.28 % Propositional check models : 0
% 0.23/0.28 % Propositional check unsatisfiable : 0
% 0.23/0.28 % Propositional clauses : 0
% 0.23/0.28 % Propositional clauses after purity: 0
% 0.23/0.28 % Propositional unsat core size : 0
% 0.23/0.28 % Propositional preprocessing time : 0.000
% 0.23/0.28 % Propositional encoding time : 0.000
% 0.23/0.28 % Propositional solver time : 0.000
% 0.23/0.28 % Success case prop preproc time : 0.000
% 0.23/0.28 % Success case prop encoding time : 0.000
% 0.23/0.28 % Success case prop solver time : 0.000
% 0.23/0.28 % Current number of processed clauses : 14
% 0.23/0.28 % Positive orientable unit clauses : 6
% 0.23/0.28 % Positive unorientable unit clauses: 0
% 0.23/0.28 % Negative unit clauses : 0
% 0.23/0.28 % Non-unit-clauses : 8
% 0.23/0.28 % Current number of unprocessed clauses: 15
% 0.23/0.28 % ...number of literals in the above : 46
% 0.23/0.28 % Current number of archived formulas : 0
% 0.23/0.28 % Current number of archived clauses : 10
% 0.23/0.28 % Clause-clause subsumption calls (NU) : 10
% 0.23/0.28 % Rec. Clause-clause subsumption calls : 9
% 0.23/0.28 % Non-unit clause-clause subsumptions : 2
% 0.23/0.28 % Unit Clause-clause subsumption calls : 16
% 0.23/0.28 % Rewrite failures with RHS unbound : 0
% 0.23/0.28 % BW rewrite match attempts : 5
% 0.23/0.28 % BW rewrite match successes : 5
% 0.23/0.28 % Condensation attempts : 0
% 0.23/0.28 % Condensation successes : 0
% 0.23/0.28 % Termbank termtop insertions : 4822
% 0.23/0.28 % Search garbage collected termcells : 1455
% 0.23/0.28
% 0.23/0.28 % -------------------------------------------------
% 0.23/0.28 % User time : 0.007 s
% 0.23/0.28 % System time : 0.005 s
% 0.23/0.28 % Total time : 0.012 s
% 0.23/0.28 % Maximum resident set size: 3960 pages
% 0.23/0.28
% 0.23/0.28 % -------------------------------------------------
% 0.23/0.28 % User time : 0.008 s
% 0.23/0.28 % System time : 0.011 s
% 0.23/0.28 % Total time : 0.019 s
% 0.23/0.28 % Maximum resident set size: 4864 pages
% 0.23/0.28 % E exiting
%------------------------------------------------------------------------------