%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV107^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 : 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 08:39:46 AM UTC 2026
% Result : Theorem 1.15s 0.66s
% Output : CNFRefutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 176 ( 14 equ; 0 cnn)
% Maximal formula atoms : 37 ( 7 avg)
% Number of connectives : 461 ( 58 ~; 46 |; 17 &; 340 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 25 usr; 16 con; 0-3 aty)
% Number of variables : 69 ( 32 ^; 37 !; 0 ?; 69 :)
% 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_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_60,type,
geq: mu > mu > $i > $o ).
thf(decl_82,type,
minus: mu > mu > mu ).
thf(decl_84,type,
n999: mu ).
thf(decl_87,type,
n6: mu ).
thf(decl_88,type,
n1: mu ).
thf(decl_89,type,
n2: mu ).
thf(decl_90,type,
n3: mu ).
thf(decl_91,type,
n0: mu ).
thf(decl_220,type,
esk116_0: $i ).
thf(decl_221,type,
esk117_0: $i ).
thf(decl_222,type,
esk118_0: $i ).
thf(decl_223,type,
esk119_0: $i ).
thf(decl_224,type,
esk120_0: $i ).
thf(decl_225,type,
esk121_0: $i ).
thf(decl_226,type,
esk122_0: $i ).
thf(decl_227,type,
esk123_0: $i ).
thf(decl_228,type,
esk124_0: $i ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bp1EPXcoTX/E---3.1_907175.p',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bp1EPXcoTX/E---3.1_907175.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bp1EPXcoTX/E---3.1_907175.p',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bp1EPXcoTX/E---3.1_907175.p',mimplies) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bp1EPXcoTX/E---3.1_907175.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.bp1EPXcoTX/E---3.1_907175.p',mbox_s4) ).
thf(quaternion_ds1_inuse_0019,conjecture,
mvalid @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( geq @ ( minus @ n3 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( geq @ ( minus @ n6 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( mimplies @ ( mand @ ( mbox_s4 @ ( geq @ n2 @ n0 ) ) @ ( mbox_s4 @ ( geq @ ( minus @ n999 @ n1 ) @ n0 ) ) ) @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( geq @ ( minus @ n6 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( geq @ ( minus @ n6 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( geq @ ( minus @ n6 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( mimplies @ ( mand @ ( mbox_s4 @ ( geq @ ( minus @ n3 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( geq @ ( minus @ n999 @ n1 ) @ n0 ) ) ) @ ( mbox_s4 @ true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bp1EPXcoTX/E---3.1_907175.p',quaternion_ds1_inuse_0019) ).
thf(ttrue,axiom,
mvalid @ ( mbox_s4 @ true ),
file('/export/starexec/sandbox/tmp/tmp.bp1EPXcoTX/E---3.1_907175.p',ttrue) ).
thf(c_0_8,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_9,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_10,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_11,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_12,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_13,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_14,negated_conjecture,
~ ( mvalid @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( geq @ ( minus @ n3 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( geq @ ( minus @ n6 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( mimplies @ ( mand @ ( mbox_s4 @ ( geq @ n2 @ n0 ) ) @ ( mbox_s4 @ ( geq @ ( minus @ n999 @ n1 ) @ n0 ) ) ) @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( geq @ ( minus @ n6 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( geq @ ( minus @ n6 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( geq @ ( minus @ n6 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( mimplies @ ( mand @ ( mbox_s4 @ ( geq @ ( minus @ n3 @ n1 ) @ n0 ) ) @ ( mbox_s4 @ ( geq @ ( minus @ n999 @ n1 ) @ n0 ) ) ) @ ( mbox_s4 @ true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0019]) ).
thf(c_0_15,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_8,c_0_9]),c_0_10]) ).
thf(c_0_16,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_11,c_0_9]),c_0_10]) ).
thf(c_0_17,plain,
! [X1355: $i,X1354: $i] :
( ~ ( rel_s4 @ X1355 @ X1354 )
| ( true @ X1354 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ttrue,c_0_12]),c_0_13])]) ).
thf(c_0_18,negated_conjecture,
~ ! [X1530: $i,X1529: $i] :
( ~ ( rel_s4 @ X1530 @ X1529 )
| ~ ! [X1513: $i] :
( ~ ( rel_s4 @ X1529 @ X1513 )
| ( geq @ ( minus @ n3 @ n1 ) @ n0 @ X1513 ) )
| ! [X1528: $i] :
( ~ ( rel_s4 @ X1529 @ X1528 )
| ~ ! [X1514: $i] :
( ~ ( rel_s4 @ X1528 @ X1514 )
| ( geq @ ( minus @ n6 @ n1 ) @ n0 @ X1514 ) )
| ! [X1527: $i] :
( ~ ( rel_s4 @ X1528 @ X1527 )
| ~ ~ ( ~ ! [X1515: $i] :
( ~ ( rel_s4 @ X1527 @ X1515 )
| ( geq @ n2 @ n0 @ X1515 ) )
| ~ ! [X1516: $i] :
( ~ ( rel_s4 @ X1527 @ X1516 )
| ( geq @ ( minus @ n999 @ n1 ) @ n0 @ X1516 ) ) )
| ! [X1526: $i] :
( ~ ( rel_s4 @ X1527 @ X1526 )
| ~ ! [X1517: $i] :
( ~ ( rel_s4 @ X1526 @ X1517 )
| ( geq @ ( minus @ n6 @ n1 ) @ n0 @ X1517 ) )
| ! [X1525: $i] :
( ~ ( rel_s4 @ X1526 @ X1525 )
| ~ ! [X1518: $i] :
( ~ ( rel_s4 @ X1525 @ X1518 )
| ( geq @ ( minus @ n6 @ n1 ) @ n0 @ X1518 ) )
| ! [X1524: $i] :
( ~ ( rel_s4 @ X1525 @ X1524 )
| ~ ! [X1519: $i] :
( ~ ( rel_s4 @ X1524 @ X1519 )
| ( geq @ ( minus @ n6 @ n1 ) @ n0 @ X1519 ) )
| ! [X1523: $i] :
( ~ ( rel_s4 @ X1524 @ X1523 )
| ~ ~ ( ~ ! [X1520: $i] :
( ~ ( rel_s4 @ X1523 @ X1520 )
| ( geq @ ( minus @ n3 @ n1 ) @ n0 @ X1520 ) )
| ~ ! [X1521: $i] :
( ~ ( rel_s4 @ X1523 @ X1521 )
| ( geq @ ( minus @ n999 @ n1 ) @ n0 @ X1521 ) ) )
| ! [X1522: $i] :
( ~ ( rel_s4 @ X1523 @ X1522 )
| ( true @ X1522 ) ) ) ) ) ) ) ) ),
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)],[c_0_14,c_0_15]),c_0_16]),c_0_12]),c_0_13])]) ).
thf(c_0_19,plain,
! [X2553: $i,X2554: $i] :
( ~ ( rel_s4 @ X2553 @ X2554 )
| ( true @ X2554 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_17])]) ).
thf(c_0_20,negated_conjecture,
! [X2714: $i,X2716: $i,X2718: $i,X2719: $i,X2721: $i,X2723: $i,X2725: $i,X2727: $i,X2728: $i] :
( ( rel_s4 @ esk116_0 @ esk117_0 )
& ( ~ ( rel_s4 @ esk117_0 @ X2714 )
| ( geq @ ( minus @ n3 @ n1 ) @ n0 @ X2714 ) )
& ( rel_s4 @ esk117_0 @ esk118_0 )
& ( ~ ( rel_s4 @ esk118_0 @ X2716 )
| ( geq @ ( minus @ n6 @ n1 ) @ n0 @ X2716 ) )
& ( rel_s4 @ esk118_0 @ esk119_0 )
& ( ~ ( rel_s4 @ esk119_0 @ X2718 )
| ( geq @ n2 @ n0 @ X2718 ) )
& ( ~ ( rel_s4 @ esk119_0 @ X2719 )
| ( geq @ ( minus @ n999 @ n1 ) @ n0 @ X2719 ) )
& ( rel_s4 @ esk119_0 @ esk120_0 )
& ( ~ ( rel_s4 @ esk120_0 @ X2721 )
| ( geq @ ( minus @ n6 @ n1 ) @ n0 @ X2721 ) )
& ( rel_s4 @ esk120_0 @ esk121_0 )
& ( ~ ( rel_s4 @ esk121_0 @ X2723 )
| ( geq @ ( minus @ n6 @ n1 ) @ n0 @ X2723 ) )
& ( rel_s4 @ esk121_0 @ esk122_0 )
& ( ~ ( rel_s4 @ esk122_0 @ X2725 )
| ( geq @ ( minus @ n6 @ n1 ) @ n0 @ X2725 ) )
& ( rel_s4 @ esk122_0 @ esk123_0 )
& ( ~ ( rel_s4 @ esk123_0 @ X2727 )
| ( geq @ ( minus @ n3 @ n1 ) @ n0 @ X2727 ) )
& ( ~ ( rel_s4 @ esk123_0 @ X2728 )
| ( geq @ ( minus @ n999 @ n1 ) @ n0 @ X2728 ) )
& ( rel_s4 @ esk123_0 @ esk124_0 )
& ~ ( true @ esk124_0 ) ),
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_18])])])])]) ).
thf(c_0_21,plain,
! [X3: $i,X7: $i] :
( ( true @ X7 )
| ~ ( rel_s4 @ X3 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_22,negated_conjecture,
rel_s4 @ esk123_0 @ esk124_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_23,negated_conjecture,
~ ( true @ esk124_0 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV107^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.08/0.18 % Computer : n006.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 16:00:39 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.21/0.27 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.bp1EPXcoTX/E---3.1_907175.p
% 1.15/0.66 % Version: 3.5.1-ho
% 1.15/0.66 % Preprocessing class: HSLSSMSMMLLNHSN.
% 1.15/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.66 % Starting new_ho_10 with 900s (3) cores
% 1.15/0.66 % Starting ehoh_best8_lambda with 900s (3) cores
% 1.15/0.66 % Starting ho_unfolding_3 with 300s (1) cores
% 1.15/0.66 % Starting new_ho_16 with 300s (1) cores
% 1.15/0.66 % new_ho_16 with pid 907191 completed with status 9
% 1.15/0.66 % ehoh_best8_lambda with pid 907189 completed with status 0
% 1.15/0.66 % Result found by ehoh_best8_lambda
% 1.15/0.66 % Preprocessing class: HSLSSMSMMLLNHSN.
% 1.15/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.66 % Starting new_ho_10 with 900s (3) cores
% 1.15/0.66 % Starting ehoh_best8_lambda with 900s (3) cores
% 1.15/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 1.15/0.66 % No SInE strategy applied
% 1.15/0.66 % Search class: HGHNM-SMLM33-DHSSMFNN
% 1.15/0.66 % partial match(1): HGHNM-SMLF33-DHSSMFNN
% 1.15/0.66 % Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 1.15/0.66 % Starting SubtermCWHack with 91s (1) cores
% 1.15/0.66 % Starting new_ho_15 with 386s (1) cores
% 1.15/0.66 % Starting new_ho_16 with 129s (1) cores
% 1.15/0.66 % SubtermCWHack with pid 907205 completed with status 0
% 1.15/0.66 % Result found by SubtermCWHack
% 1.15/0.66 % Preprocessing class: HSLSSMSMMLLNHSN.
% 1.15/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.66 % Starting new_ho_10 with 900s (3) cores
% 1.15/0.66 % Starting ehoh_best8_lambda with 900s (3) cores
% 1.15/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 1.15/0.66 % No SInE strategy applied
% 1.15/0.66 % Search class: HGHNM-SMLM33-DHSSMFNN
% 1.15/0.66 % partial match(1): HGHNM-SMLF33-DHSSMFNN
% 1.15/0.66 % Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 1.15/0.66 % Starting SubtermCWHack with 91s (1) cores
% 1.15/0.66 % Preprocessing time : 0.056 s
% 1.15/0.66
% 1.15/0.66 % Proof found!
% 1.15/0.66 % SZS status Theorem
% 1.15/0.66 % SZS output start CNFRefutation
% See solution above
% 1.15/0.66 % Parsed axioms : 288
% 1.15/0.66 % Removed by relevancy pruning/SinE : 0
% 1.15/0.66 % Initial clauses : 1951
% 1.15/0.66 % Removed in clause preprocessing : 71
% 1.15/0.66 % Initial clauses in saturation : 1880
% 1.15/0.66 % Processed clauses : 28
% 1.15/0.66 % ...of these trivial : 0
% 1.15/0.66 % ...subsumed : 0
% 1.15/0.66 % ...remaining for further processing : 28
% 1.15/0.66 % Other redundant clauses eliminated : 0
% 1.15/0.66 % Clauses deleted for lack of memory : 0
% 1.15/0.66 % Backward-subsumed : 0
% 1.15/0.66 % Backward-rewritten : 0
% 1.15/0.66 % Generated clauses : 9
% 1.15/0.66 % ...of the previous two non-redundant : 0
% 1.15/0.66 % ...aggressively subsumed : 0
% 1.15/0.66 % Contextual simplify-reflections : 0
% 1.15/0.66 % Paramodulations : 9
% 1.15/0.66 % Factorizations : 0
% 1.15/0.66 % NegExts : 0
% 1.15/0.66 % Equation resolutions : 0
% 1.15/0.66 % Disequality decompositions : 0
% 1.15/0.66 % Total rewrite steps : 0
% 1.15/0.66 % ...of those cached : 0
% 1.15/0.66 % Propositional unsat checks : 0
% 1.15/0.66 % Propositional check models : 0
% 1.15/0.66 % Propositional check unsatisfiable : 0
% 1.15/0.66 % Propositional clauses : 0
% 1.15/0.66 % Propositional clauses after purity: 0
% 1.15/0.66 % Propositional unsat core size : 0
% 1.15/0.66 % Propositional preprocessing time : 0.000
% 1.15/0.66 % Propositional encoding time : 0.000
% 1.15/0.66 % Propositional solver time : 0.000
% 1.15/0.66 % Success case prop preproc time : 0.000
% 1.15/0.66 % Success case prop encoding time : 0.000
% 1.15/0.66 % Success case prop solver time : 0.000
% 1.15/0.66 % Current number of processed clauses : 28
% 1.15/0.66 % Positive orientable unit clauses : 26
% 1.15/0.66 % Positive unorientable unit clauses: 0
% 1.15/0.66 % Negative unit clauses : 1
% 1.15/0.66 % Non-unit-clauses : 1
% 1.15/0.66 % Current number of unprocessed clauses: 1852
% 1.15/0.66 % ...number of literals in the above : 18602
% 1.15/0.66 % Current number of archived formulas : 0
% 1.15/0.66 % Current number of archived clauses : 0
% 1.15/0.66 % Clause-clause subsumption calls (NU) : 0
% 1.15/0.66 % Rec. Clause-clause subsumption calls : 0
% 1.15/0.66 % Non-unit clause-clause subsumptions : 0
% 1.15/0.66 % Unit Clause-clause subsumption calls : 0
% 1.15/0.66 % Rewrite failures with RHS unbound : 0
% 1.15/0.66 % BW rewrite match attempts : 8
% 1.15/0.66 % BW rewrite match successes : 0
% 1.15/0.66 % Condensation attempts : 0
% 1.15/0.66 % Condensation successes : 0
% 1.15/0.66 % Termbank termtop insertions : 297440
% 1.15/0.66 % Search garbage collected termcells : 100034
% 1.15/0.66
% 1.15/0.66 % -------------------------------------------------
% 1.15/0.66 % User time : 0.312 s
% 1.15/0.66 % System time : 0.045 s
% 1.15/0.66 % Total time : 0.357 s
% 1.15/0.66 % Maximum resident set size: 18728 pages
% 1.15/0.66
% 1.15/0.66 % -------------------------------------------------
% 1.15/0.66 % User time : 0.454 s
% 1.15/0.66 % System time : 0.108 s
% 1.15/0.66 % Total time : 0.562 s
% 1.15/0.66 % Maximum resident set size: 5120 pages
% 1.15/0.66 % E exiting
%------------------------------------------------------------------------------