%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV430^2 : TPTP v9.3.1. Released v3.6.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 08:39:43 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 29 unt; 0 typ; 0 def)
% Number of atoms : 158 ( 22 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 308 ( 43 ~; 41 |; 7 &; 203 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 18 usr; 5 con; 0-3 aty)
% Number of variables : 91 ( 47 ^; 44 !; 0 ?; 91 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_29,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_30,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_34,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_42,type,
rel: $i > $i > $o ).
thf(decl_44,type,
icl_princ: ( $i > $o ) > $i > $o ).
thf(decl_47,type,
icl_impl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_51,type,
iclval: ( $i > $o ) > $o ).
thf(decl_52,type,
icl_impl_princ: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_53,type,
a: $i > $o ).
thf(decl_54,type,
b: $i > $o ).
thf(decl_55,type,
c: $i > $o ).
thf(decl_57,type,
esk2_2: ( $i > $o ) > $i > $i ).
thf(decl_58,type,
esk3_0: $i ).
thf(decl_59,type,
esk4_0: $i ).
thf(decl_60,type,
esk5_0: $i ).
thf(decl_61,type,
esk6_0: $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uYg7iwzavk/E---3.1_910325.p',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uYg7iwzavk/E---3.1_910325.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uYg7iwzavk/E---3.1_910325.p',mor) ).
thf(icl_impl,axiom,
( icl_impl
= ( ^ [X19: $i > $o,X20: $i > $o] : ( mbox @ rel @ ( mimpl @ X19 @ X20 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uYg7iwzavk/E---3.1_910325.p',icl_impl) ).
thf(mbox,axiom,
( mbox
= ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
! [X12: $i] :
( ( X10 @ X1 @ X12 )
=> ( X11 @ X12 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uYg7iwzavk/E---3.1_910325.p',mbox) ).
thf(icl_s4_valid,axiom,
( iclval
= ( ^ [X22: $i > $o] : ( mvalid @ X22 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uYg7iwzavk/E---3.1_910325.p',icl_s4_valid) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uYg7iwzavk/E---3.1_910325.p',mvalid) ).
thf(icl_impl_princ,axiom,
( icl_impl_princ
= ( ^ [X19: $i > $o,X20: $i > $o] : ( mbox @ rel @ ( mimpl @ X19 @ X20 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uYg7iwzavk/E---3.1_910325.p',icl_impl_princ) ).
thf(trans,conjecture,
iclval @ ( icl_impl @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ b ) ) @ ( icl_impl @ ( icl_impl_princ @ ( icl_princ @ b ) @ ( icl_princ @ c ) ) @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ c ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uYg7iwzavk/E---3.1_910325.p',trans) ).
thf(icl_princ,axiom,
( icl_princ
= ( ^ [X11: $i > $o] : X11 ) ),
file('/export/starexec/sandbox2/tmp/tmp.uYg7iwzavk/E---3.1_910325.p',icl_princ) ).
thf(trans_axiom,axiom,
! [X20: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ rel @ X20 ) @ ( mbox @ rel @ ( mbox @ rel @ X20 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uYg7iwzavk/E---3.1_910325.p',trans_axiom) ).
thf(c_0_11,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_13,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_14,plain,
( icl_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X26: $i] :
( ( rel @ Z2 @ X26 )
=> ( ~ ( Z0 @ X26 )
| ( Z1 @ X26 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[icl_impl]) ).
thf(c_0_15,plain,
( mimpl
= ( ^ [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_12]),c_0_13]) ).
thf(c_0_16,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X12: $i] :
( ( Z0 @ Z2 @ X12 )
=> ( Z1 @ X12 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_17,plain,
( iclval
= ( ^ [Z0: $i > $o] :
! [X28: $i] : ( Z0 @ X28 ) ) ),
inference(fof_simplification,[status(thm)],[icl_s4_valid]) ).
thf(c_0_18,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_19,plain,
( icl_impl_princ
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X29: $i] :
( ( rel @ Z2 @ X29 )
=> ( ~ ( Z0 @ X29 )
| ( Z1 @ X29 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[icl_impl_princ]) ).
thf(c_0_20,negated_conjecture,
~ ( iclval @ ( icl_impl @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ b ) ) @ ( icl_impl @ ( icl_impl_princ @ ( icl_princ @ b ) @ ( icl_princ @ c ) ) @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ c ) ) ) ) ),
inference(assume_negation,[status(cth)],[trans]) ).
thf(c_0_21,plain,
( icl_princ
= ( ^ [Z0: $i > $o] : Z0 ) ),
inference(fof_simplification,[status(thm)],[icl_princ]) ).
thf(c_0_22,plain,
( icl_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X26: $i] :
( ( rel @ Z2 @ X26 )
=> ( ~ ( Z0 @ X26 )
| ( Z1 @ X26 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_23,plain,
( iclval
= ( ^ [Z0: $i > $o] :
! [X28: $i] : ( Z0 @ X28 ) ) ),
inference(apply_def,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_24,plain,
( icl_impl_princ
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X29: $i] :
( ( rel @ Z2 @ X29 )
=> ( ~ ( Z0 @ X29 )
| ( Z1 @ X29 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_15]),c_0_16]) ).
thf(c_0_25,plain,
! [X20: $i > $o,X35: $i] :
( ~ ! [X32: $i] :
( ( rel @ X35 @ X32 )
=> ( X20 @ X32 ) )
| ! [X34: $i] :
( ( rel @ X35 @ X34 )
=> ! [X33: $i] :
( ( rel @ X34 @ X33 )
=> ( X20 @ X33 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[trans_axiom,c_0_15]),c_0_16]),c_0_18]) ).
thf(c_0_26,negated_conjecture,
~ ! [X41: $i,X40: $i] :
( ( rel @ X41 @ X40 )
=> ( ~ ! [X36: $i] :
( ( rel @ X40 @ X36 )
=> ( ~ ( a @ X36 )
| ( b @ X36 ) ) )
| ! [X39: $i] :
( ( rel @ X40 @ X39 )
=> ( ~ ! [X37: $i] :
( ( rel @ X39 @ X37 )
=> ( ~ ( b @ X37 )
| ( c @ X37 ) ) )
| ! [X38: $i] :
( ( rel @ X39 @ X38 )
=> ( ~ ( a @ X38 )
| ( c @ X38 ) ) ) ) ) ) ),
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_20,c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
thf(c_0_27,plain,
! [X45: $i > $o,X46: $i,X48: $i,X49: $i] :
( ( ( rel @ X46 @ ( esk2_2 @ X45 @ X46 ) )
| ~ ( rel @ X46 @ X48 )
| ~ ( rel @ X48 @ X49 )
| ( X45 @ X49 ) )
& ( ~ ( X45 @ ( esk2_2 @ X45 @ X46 ) )
| ~ ( rel @ X46 @ X48 )
| ~ ( rel @ X48 @ X49 )
| ( X45 @ X49 ) ) ),
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_25])])])])])]) ).
thf(c_0_28,negated_conjecture,
! [X52: $i,X54: $i] :
( ( rel @ esk3_0 @ esk4_0 )
& ( ~ ( rel @ esk4_0 @ X52 )
| ~ ( a @ X52 )
| ( b @ X52 ) )
& ( rel @ esk4_0 @ esk5_0 )
& ( ~ ( rel @ esk5_0 @ X54 )
| ~ ( b @ X54 )
| ( c @ X54 ) )
& ( rel @ esk5_0 @ esk6_0 )
& ( a @ esk6_0 )
& ~ ( c @ esk6_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_26])])])])]) ).
thf(c_0_29,plain,
! [X1: $i,X2: $i > $o,X3: $i,X12: $i] :
( ( rel @ X1 @ ( esk2_2 @ X2 @ X1 ) )
| ( X2 @ X12 )
| ~ ( rel @ X1 @ X3 )
| ~ ( rel @ X3 @ X12 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_30,negated_conjecture,
rel @ esk5_0 @ esk6_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_31,negated_conjecture,
~ ( c @ esk6_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i] :
( ( c @ X1 )
| ~ ( rel @ esk5_0 @ X1 )
| ~ ( b @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_33,plain,
! [X1: $i,X2: $i > $o,X3: $i,X12: $i] :
( ( X2 @ X12 )
| ~ ( X2 @ ( esk2_2 @ X2 @ X1 ) )
| ~ ( rel @ X1 @ X3 )
| ~ ( rel @ X3 @ X12 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_34,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( rel @ X1 @ ( esk2_2 @ X2 @ X1 ) )
| ( X2 @ esk6_0 )
| ~ ( rel @ X1 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_35,negated_conjecture,
~ ( b @ esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_30])]) ).
thf(c_0_36,negated_conjecture,
! [X1: $i] :
( ( b @ X1 )
| ~ ( rel @ esk4_0 @ X1 )
| ~ ( a @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_37,negated_conjecture,
a @ esk6_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_38,negated_conjecture,
! [X1: $i,X3: $i,X12: $i] :
( ( rel @ X1 @ esk6_0 )
| ( rel @ X1 @ X3 )
| ~ ( rel @ X1 @ esk5_0 )
| ~ ( rel @ X12 @ X3 )
| ~ ( rel @ X1 @ X12 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
thf(c_0_39,negated_conjecture,
~ ( rel @ esk4_0 @ esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
thf(c_0_40,negated_conjecture,
! [X1: $i] :
( ( rel @ X1 @ esk6_0 )
| ~ ( rel @ X1 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_30]) ).
thf(c_0_41,negated_conjecture,
rel @ esk4_0 @ esk5_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV430^2 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n006.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 16:02:39 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.21 Running higher-order theorem proving
% 0.07/0.23 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.uYg7iwzavk/E---3.1_910325.p
% 0.07/0.25 % Version: 3.5.1-ho
% 0.07/0.25 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.07/0.25 % Starting post_as_ho3 with 300s (1) cores
% 0.07/0.25 % Starting post_as_ho11 with 300s (1) cores
% 0.07/0.25 % Starting full_lambda_8 with 300s (1) cores
% 0.07/0.25 % new_ho_10_cnf2 with pid 910338 completed with status 0
% 0.07/0.25 % Result found by new_ho_10_cnf2
% 0.07/0.25 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.07/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.25 % No SInE strategy applied
% 0.07/0.25 % Search class: HGUNF-FFSS22-SHSSMSBN
% 0.07/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.25 % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.07/0.25 % Starting sh5l with 136s (1) cores
% 0.07/0.25 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.07/0.25 % Starting lpo1_def_fix with 136s (1) cores
% 0.07/0.25 % SubtermCWHack with pid 910342 completed with status 0
% 0.07/0.25 % Result found by SubtermCWHack
% 0.07/0.25 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.07/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.25 % No SInE strategy applied
% 0.07/0.25 % Search class: HGUNF-FFSS22-SHSSMSBN
% 0.07/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.25 % Preprocessing time : 0.001 s
% 0.07/0.25
% 0.07/0.25 % Proof found!
% 0.07/0.25 % SZS status Theorem
% 0.07/0.25 % SZS output start CNFRefutation
% See solution above
% 0.07/0.25 % Parsed axioms : 62
% 0.07/0.25 % Removed by relevancy pruning/SinE : 0
% 0.07/0.25 % Initial clauses : 45
% 0.07/0.25 % Removed in clause preprocessing : 34
% 0.07/0.25 % Initial clauses in saturation : 11
% 0.07/0.25 % Processed clauses : 56
% 0.07/0.25 % ...of these trivial : 0
% 0.07/0.25 % ...subsumed : 5
% 0.07/0.25 % ...remaining for further processing : 51
% 0.07/0.25 % Other redundant clauses eliminated : 0
% 0.07/0.25 % Clauses deleted for lack of memory : 0
% 0.07/0.25 % Backward-subsumed : 1
% 0.07/0.25 % Backward-rewritten : 0
% 0.07/0.25 % Generated clauses : 233
% 0.07/0.25 % ...of the previous two non-redundant : 213
% 0.07/0.25 % ...aggressively subsumed : 0
% 0.07/0.25 % Contextual simplify-reflections : 1
% 0.07/0.25 % Paramodulations : 225
% 0.07/0.25 % Factorizations : 8
% 0.07/0.25 % NegExts : 0
% 0.07/0.25 % Equation resolutions : 0
% 0.07/0.25 % Disequality decompositions : 0
% 0.07/0.25 % Total rewrite steps : 15
% 0.07/0.25 % ...of those cached : 8
% 0.07/0.25 % Propositional unsat checks : 0
% 0.07/0.25 % Propositional check models : 0
% 0.07/0.25 % Propositional check unsatisfiable : 0
% 0.07/0.25 % Propositional clauses : 0
% 0.07/0.25 % Propositional clauses after purity: 0
% 0.07/0.25 % Propositional unsat core size : 0
% 0.07/0.25 % Propositional preprocessing time : 0.000
% 0.07/0.25 % Propositional encoding time : 0.000
% 0.07/0.25 % Propositional solver time : 0.000
% 0.07/0.25 % Success case prop preproc time : 0.000
% 0.07/0.25 % Success case prop encoding time : 0.000
% 0.07/0.25 % Success case prop solver time : 0.000
% 0.07/0.25 % Current number of processed clauses : 50
% 0.07/0.25 % Positive orientable unit clauses : 5
% 0.07/0.25 % Positive unorientable unit clauses: 0
% 0.07/0.25 % Negative unit clauses : 3
% 0.07/0.25 % Non-unit-clauses : 42
% 0.07/0.25 % Current number of unprocessed clauses: 168
% 0.07/0.25 % ...number of literals in the above : 789
% 0.07/0.25 % Current number of archived formulas : 0
% 0.07/0.25 % Current number of archived clauses : 1
% 0.07/0.25 % Clause-clause subsumption calls (NU) : 341
% 0.07/0.25 % Rec. Clause-clause subsumption calls : 271
% 0.07/0.25 % Non-unit clause-clause subsumptions : 7
% 0.07/0.25 % Unit Clause-clause subsumption calls : 3
% 0.07/0.25 % Rewrite failures with RHS unbound : 0
% 0.07/0.25 % BW rewrite match attempts : 7
% 0.07/0.25 % BW rewrite match successes : 0
% 0.07/0.25 % Condensation attempts : 0
% 0.07/0.25 % Condensation successes : 0
% 0.07/0.25 % Termbank termtop insertions : 6932
% 0.07/0.25 % Search garbage collected termcells : 736
% 0.07/0.25
% 0.07/0.25 % -------------------------------------------------
% 0.07/0.25 % User time : 0.008 s
% 0.07/0.25 % System time : 0.003 s
% 0.07/0.25 % Total time : 0.011 s
% 0.07/0.25 % Maximum resident set size: 3632 pages
% 0.07/0.25
% 0.07/0.25 % -------------------------------------------------
% 0.07/0.25 % User time : 0.024 s
% 0.07/0.25 % System time : 0.013 s
% 0.07/0.25 % Total time : 0.036 s
% 0.07/0.25 % Maximum resident set size: 4864 pages
% 0.07/0.25 % E exiting
%------------------------------------------------------------------------------