%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV061^7 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:39:41 AM UTC 2026
% Result : Theorem 1.36s 0.64s
% Output : CNFRefutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 168 ( 16 equ; 0 cnn)
% Maximal formula atoms : 56 ( 5 avg)
% Number of connectives : 389 ( 62 ~; 59 |; 21 &; 247 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 19 usr; 9 con; 0-3 aty)
% Number of variables : 63 ( 34 ^; 29 !; 0 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_25,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_41,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_51,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_55,type,
rel_s4: $i > $i > $o ).
thf(decl_56,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_58,type,
true: $i > $o ).
thf(decl_61,type,
gt: mu > mu > $i > $o ).
thf(decl_83,type,
loopcounter: mu ).
thf(decl_87,type,
n1: mu ).
thf(decl_217,type,
esk114_0: $i ).
thf(decl_218,type,
esk115_0: $i ).
thf(decl_219,type,
esk116_0: $i ).
thf(decl_220,type,
esk117_1: $i > $i ).
thf(decl_221,type,
esk118_0: $i ).
thf(decl_222,type,
esk119_0: $i ).
thf(decl_223,type,
esk120_0: $i ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uvQM2nlARm/E---3.1_3337910.p',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uvQM2nlARm/E---3.1_3337910.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uvQM2nlARm/E---3.1_3337910.p',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uvQM2nlARm/E---3.1_3337910.p',mimplies) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uvQM2nlARm/E---3.1_3337910.p',mvalid) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X4: $i > $o,X3: $i] :
! [X7: $i] :
( ~ ( rel_s4 @ X3 @ X7 )
| ( X4 @ X7 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uvQM2nlARm/E---3.1_3337910.p',mbox_s4) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X6: $i > $i > $o] :
! [X16: $i] : ( X6 @ X16 @ X16 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uvQM2nlARm/E---3.1_3337910.p',mreflexive) ).
thf(cl5_nebula_array_0002,conjecture,
mvalid @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ true ) @ ( mand @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( mnot @ ( mbox_s4 @ ( gt @ loopcounter @ n1 ) ) ) ) @ ( mbox_s4 @ true ) ) ) @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( gt @ loopcounter @ n1 ) ) @ ( mbox_s4 @ true ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uvQM2nlARm/E---3.1_3337910.p',cl5_nebula_array_0002) ).
thf(ttrue,axiom,
mvalid @ ( mbox_s4 @ true ),
file('/export/starexec/sandbox/tmp/tmp.uvQM2nlARm/E---3.1_3337910.p',ttrue) ).
thf(a1,axiom,
mreflexive @ rel_s4,
file('/export/starexec/sandbox/tmp/tmp.uvQM2nlARm/E---3.1_3337910.p',a1) ).
thf(c_0_10,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_11,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_12,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_13,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_14,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_15,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X7: $i] :
( ~ ( rel_s4 @ Z1 @ X7 )
| ( Z0 @ X7 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_16,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X16: $i] : ( Z0 @ X16 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_17,negated_conjecture,
~ ( mvalid @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ true ) @ ( mand @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( mnot @ ( mbox_s4 @ ( gt @ loopcounter @ n1 ) ) ) ) @ ( mbox_s4 @ true ) ) ) @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( gt @ loopcounter @ n1 ) ) @ ( mbox_s4 @ true ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_array_0002]) ).
thf(c_0_18,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_10,c_0_11]),c_0_12]) ).
thf(c_0_19,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_13,c_0_11]),c_0_12]) ).
thf(c_0_20,plain,
! [X1353: $i,X1352: $i] :
( ~ ( rel_s4 @ X1353 @ X1352 )
| ( true @ X1352 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ttrue,c_0_14]),c_0_15])]) ).
thf(c_0_21,plain,
! [X194: $i] : ( rel_s4 @ X194 @ X194 ),
inference(apply_def,[status(thm)],[a1,c_0_16]) ).
thf(c_0_22,negated_conjecture,
~ ! [X1475: $i,X1474: $i] :
( ~ ( rel_s4 @ X1475 @ X1474 )
| ~ ! [X1466: $i] :
( ~ ( rel_s4 @ X1474 @ X1466 )
| ( true @ X1466 ) )
| ~ ( ~ ! [X1470: $i] :
( ~ ( rel_s4 @ X1474 @ X1470 )
| ~ ! [X1468: $i] :
( ~ ( rel_s4 @ X1470 @ X1468 )
| ~ ! [X1467: $i] :
( ~ ( rel_s4 @ X1468 @ X1467 )
| ( gt @ loopcounter @ n1 @ X1467 ) ) )
| ! [X1469: $i] :
( ~ ( rel_s4 @ X1470 @ X1469 )
| ( true @ X1469 ) ) )
| ~ ! [X1473: $i] :
( ~ ( rel_s4 @ X1474 @ X1473 )
| ~ ! [X1471: $i] :
( ~ ( rel_s4 @ X1473 @ X1471 )
| ( gt @ loopcounter @ n1 @ X1471 ) )
| ! [X1472: $i] :
( ~ ( rel_s4 @ X1473 @ X1472 )
| ( true @ X1472 ) ) ) ) ),
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)],[inference(apply_def,[status(thm)],[c_0_17,c_0_11]),c_0_18]),c_0_19]),c_0_14]),c_0_15])]) ).
thf(c_0_23,plain,
! [X2497: $i,X2498: $i] :
( ~ ( rel_s4 @ X2497 @ X2498 )
| ( true @ X2498 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_20])]) ).
thf(c_0_24,plain,
! [X1478: $i] : ( rel_s4 @ X1478 @ X1478 ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
thf(c_0_25,negated_conjecture,
! [X2613: $i,X2615: $i,X2619: $i] :
( ( rel_s4 @ esk114_0 @ esk115_0 )
& ( ~ ( rel_s4 @ esk115_0 @ X2613 )
| ( true @ X2613 ) )
& ( ( rel_s4 @ esk115_0 @ esk119_0 )
| ( rel_s4 @ esk115_0 @ esk116_0 ) )
& ( ~ ( rel_s4 @ esk119_0 @ X2619 )
| ( gt @ loopcounter @ n1 @ X2619 )
| ( rel_s4 @ esk115_0 @ esk116_0 ) )
& ( ( rel_s4 @ esk119_0 @ esk120_0 )
| ( rel_s4 @ esk115_0 @ esk116_0 ) )
& ( ~ ( true @ esk120_0 )
| ( rel_s4 @ esk115_0 @ esk116_0 ) )
& ( ( rel_s4 @ esk115_0 @ esk119_0 )
| ( rel_s4 @ X2615 @ ( esk117_1 @ X2615 ) )
| ~ ( rel_s4 @ esk116_0 @ X2615 ) )
& ( ~ ( rel_s4 @ esk119_0 @ X2619 )
| ( gt @ loopcounter @ n1 @ X2619 )
| ( rel_s4 @ X2615 @ ( esk117_1 @ X2615 ) )
| ~ ( rel_s4 @ esk116_0 @ X2615 ) )
& ( ( rel_s4 @ esk119_0 @ esk120_0 )
| ( rel_s4 @ X2615 @ ( esk117_1 @ X2615 ) )
| ~ ( rel_s4 @ esk116_0 @ X2615 ) )
& ( ~ ( true @ esk120_0 )
| ( rel_s4 @ X2615 @ ( esk117_1 @ X2615 ) )
| ~ ( rel_s4 @ esk116_0 @ X2615 ) )
& ( ( rel_s4 @ esk115_0 @ esk119_0 )
| ~ ( gt @ loopcounter @ n1 @ ( esk117_1 @ X2615 ) )
| ~ ( rel_s4 @ esk116_0 @ X2615 ) )
& ( ~ ( rel_s4 @ esk119_0 @ X2619 )
| ( gt @ loopcounter @ n1 @ X2619 )
| ~ ( gt @ loopcounter @ n1 @ ( esk117_1 @ X2615 ) )
| ~ ( rel_s4 @ esk116_0 @ X2615 ) )
& ( ( rel_s4 @ esk119_0 @ esk120_0 )
| ~ ( gt @ loopcounter @ n1 @ ( esk117_1 @ X2615 ) )
| ~ ( rel_s4 @ esk116_0 @ X2615 ) )
& ( ~ ( true @ esk120_0 )
| ~ ( gt @ loopcounter @ n1 @ ( esk117_1 @ X2615 ) )
| ~ ( rel_s4 @ esk116_0 @ X2615 ) )
& ( ( rel_s4 @ esk115_0 @ esk119_0 )
| ( rel_s4 @ esk116_0 @ esk118_0 ) )
& ( ~ ( rel_s4 @ esk119_0 @ X2619 )
| ( gt @ loopcounter @ n1 @ X2619 )
| ( rel_s4 @ esk116_0 @ esk118_0 ) )
& ( ( rel_s4 @ esk119_0 @ esk120_0 )
| ( rel_s4 @ esk116_0 @ esk118_0 ) )
& ( ~ ( true @ esk120_0 )
| ( rel_s4 @ esk116_0 @ esk118_0 ) )
& ( ( rel_s4 @ esk115_0 @ esk119_0 )
| ~ ( true @ esk118_0 ) )
& ( ~ ( rel_s4 @ esk119_0 @ X2619 )
| ( gt @ loopcounter @ n1 @ X2619 )
| ~ ( true @ esk118_0 ) )
& ( ( rel_s4 @ esk119_0 @ esk120_0 )
| ~ ( true @ esk118_0 ) )
& ( ~ ( true @ esk120_0 )
| ~ ( true @ esk118_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])])]) ).
thf(c_0_26,plain,
! [X3: $i,X7: $i] :
( ( true @ X7 )
| ~ ( rel_s4 @ X3 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_27,plain,
! [X3: $i] : ( rel_s4 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_28,negated_conjecture,
( ~ ( true @ esk120_0 )
| ~ ( true @ esk118_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_29,plain,
! [X3: $i] : ( true @ X3 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV061^7 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.17 % Computer : n008.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 16:00:39 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running higher-order theorem proving
% 0.10/0.24 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.uvQM2nlARm/E---3.1_3337910.p
% 1.36/0.64 % Version: 3.5.1-ho
% 1.36/0.64 % Preprocessing class: HSLSSMSMMLLNHSN.
% 1.36/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.36/0.64 % Starting new_ho_10 with 900s (3) cores
% 1.36/0.64 % Starting ehoh_best8_lambda with 900s (3) cores
% 1.36/0.64 % Starting ho_unfolding_3 with 300s (1) cores
% 1.36/0.64 % Starting new_ho_16 with 300s (1) cores
% 1.36/0.64 % new_ho_16 with pid 3337951 completed with status 9
% 1.36/0.64 % ho_unfolding_3 with pid 3337949 completed with status 0
% 1.36/0.64 % Result found by ho_unfolding_3
% 1.36/0.64 % Preprocessing class: HSLSSMSMMLLNHSN.
% 1.36/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.36/0.64 % Starting new_ho_10 with 900s (3) cores
% 1.36/0.64 % Starting ehoh_best8_lambda with 900s (3) cores
% 1.36/0.64 % Starting ho_unfolding_3 with 300s (1) cores
% 1.36/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.36/0.64 % No SInE strategy applied
% 1.36/0.64 % Search class: HGHNM-SMLS33-DHSSMFNN
% 1.36/0.64 % partial match(1): HGHNM-SMLF33-DHSSMFNN
% 1.36/0.64 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.36/0.64 % Starting SubtermCWHack with 28s (1) cores
% 1.36/0.64 % SubtermCWHack with pid 3338048 completed with status 0
% 1.36/0.64 % Result found by SubtermCWHack
% 1.36/0.64 % Preprocessing class: HSLSSMSMMLLNHSN.
% 1.36/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.36/0.64 % Starting new_ho_10 with 900s (3) cores
% 1.36/0.64 % Starting ehoh_best8_lambda with 900s (3) cores
% 1.36/0.64 % Starting ho_unfolding_3 with 300s (1) cores
% 1.36/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.36/0.64 % No SInE strategy applied
% 1.36/0.64 % Search class: HGHNM-SMLS33-DHSSMFNN
% 1.36/0.64 % partial match(1): HGHNM-SMLF33-DHSSMFNN
% 1.36/0.64 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.36/0.64 % Starting SubtermCWHack with 28s (1) cores
% 1.36/0.64 % Preprocessing time : 0.070 s
% 1.36/0.64
% 1.36/0.64 % Proof found!
% 1.36/0.64 % SZS status Theorem
% 1.36/0.64 % SZS output start CNFRefutation
% See solution above
% 1.36/0.64 % Parsed axioms : 269
% 1.36/0.64 % Removed by relevancy pruning/SinE : 0
% 1.36/0.64 % Initial clauses : 1933
% 1.36/0.64 % Removed in clause preprocessing : 70
% 1.36/0.64 % Initial clauses in saturation : 1863
% 1.36/0.64 % Processed clauses : 27
% 1.36/0.64 % ...of these trivial : 0
% 1.36/0.64 % ...subsumed : 0
% 1.36/0.64 % ...remaining for further processing : 27
% 1.36/0.64 % Other redundant clauses eliminated : 0
% 1.36/0.64 % Clauses deleted for lack of memory : 0
% 1.36/0.64 % Backward-subsumed : 1
% 1.36/0.64 % Backward-rewritten : 7
% 1.36/0.64 % Generated clauses : 7
% 1.36/0.64 % ...of the previous two non-redundant : 11
% 1.36/0.64 % ...aggressively subsumed : 0
% 1.36/0.64 % Contextual simplify-reflections : 0
% 1.36/0.64 % Paramodulations : 7
% 1.36/0.64 % Factorizations : 0
% 1.36/0.64 % NegExts : 0
% 1.36/0.64 % Equation resolutions : 0
% 1.36/0.64 % Disequality decompositions : 0
% 1.36/0.64 % Total rewrite steps : 8
% 1.36/0.64 % ...of those cached : 4
% 1.36/0.64 % Propositional unsat checks : 0
% 1.36/0.64 % Propositional check models : 0
% 1.36/0.64 % Propositional check unsatisfiable : 0
% 1.36/0.64 % Propositional clauses : 0
% 1.36/0.64 % Propositional clauses after purity: 0
% 1.36/0.64 % Propositional unsat core size : 0
% 1.36/0.64 % Propositional preprocessing time : 0.000
% 1.36/0.64 % Propositional encoding time : 0.000
% 1.36/0.64 % Propositional solver time : 0.000
% 1.36/0.64 % Success case prop preproc time : 0.000
% 1.36/0.64 % Success case prop encoding time : 0.000
% 1.36/0.64 % Success case prop solver time : 0.000
% 1.36/0.64 % Current number of processed clauses : 19
% 1.36/0.64 % Positive orientable unit clauses : 19
% 1.36/0.64 % Positive unorientable unit clauses: 0
% 1.36/0.64 % Negative unit clauses : 0
% 1.36/0.64 % Non-unit-clauses : 0
% 1.36/0.64 % Current number of unprocessed clauses: 1843
% 1.36/0.64 % ...number of literals in the above : 18529
% 1.36/0.64 % Current number of archived formulas : 0
% 1.36/0.64 % Current number of archived clauses : 8
% 1.36/0.64 % Clause-clause subsumption calls (NU) : 15
% 1.36/0.64 % Rec. Clause-clause subsumption calls : 13
% 1.36/0.64 % Non-unit clause-clause subsumptions : 1
% 1.36/0.64 % Unit Clause-clause subsumption calls : 5
% 1.36/0.64 % Rewrite failures with RHS unbound : 0
% 1.36/0.64 % BW rewrite match attempts : 5
% 1.36/0.64 % BW rewrite match successes : 4
% 1.36/0.64 % Condensation attempts : 0
% 1.36/0.64 % Condensation successes : 0
% 1.36/0.64 % Termbank termtop insertions : 292946
% 1.36/0.64 % Search garbage collected termcells : 98380
% 1.36/0.64
% 1.36/0.64 % -------------------------------------------------
% 1.36/0.64 % User time : 0.321 s
% 1.36/0.64 % System time : 0.043 s
% 1.36/0.64 % Total time : 0.364 s
% 1.36/0.64 % Maximum resident set size: 18404 pages
% 1.36/0.64
% 1.36/0.64 % -------------------------------------------------
% 1.36/0.64 % User time : 0.378 s
% 1.36/0.64 % System time : 0.082 s
% 1.36/0.64 % Total time : 0.460 s
% 1.36/0.64 % Maximum resident set size: 5376 pages
% 1.36/0.64 % E exiting
%------------------------------------------------------------------------------