%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO497^6 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:44:40 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 47 ( 37 unt; 0 typ; 0 def)
% Number of atoms : 139 ( 26 equ; 0 cnn)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 256 ( 51 ~; 25 |; 4 &; 173 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 5 con; 0-3 aty)
% Number of variables : 100 ( 57 ^; 43 !; 0 ?; 100 :)
% 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_27,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_34,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_40,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_41,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
rel_s5: $i > $i > $o ).
thf(decl_55,type,
mbox_s5: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
mdia_s5: ( $i > $o ) > $i > $o ).
thf(decl_57,type,
f: mu > $i > $o ).
thf(decl_58,type,
esk1_0: $i ).
thf(decl_59,type,
esk2_0: $i ).
thf(decl_60,type,
esk3_0: mu ).
thf(decl_61,type,
esk4_0: $i ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',mimplies) ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X11: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X11 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',mexists_ind) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',mforall_ind) ).
thf(mdia_s5,axiom,
( mdia_s5
= ( ^ [X6: $i > $o] : ( mnot @ ( mbox_s5 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',mdia_s5) ).
thf(mbox_s5,axiom,
( mbox_s5
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_s5 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',mbox_s5) ).
thf(msymmetric,axiom,
( msymmetric
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i] :
( ( X13 @ X15 @ X16 )
=> ( X13 @ X16 @ X15 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',msymmetric) ).
thf(prove,conjecture,
( mvalid
@ ( mimplies
@ ( mand
@ ( mbox_s5
@ ( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( f @ X1 ) @ ( mbox_s5 @ ( f @ X1 ) ) ) ) )
@ ( mdia_s5
@ ( mexists_ind
@ ^ [X1: mu] : ( f @ X1 ) ) ) )
@ ( mbox_s5
@ ( mexists_ind
@ ^ [X1: mu] : ( f @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',prove) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',mvalid) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] : ( X13 @ X15 @ X15 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',mreflexive) ).
thf(a3,axiom,
msymmetric @ rel_s5,
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',a3) ).
thf(a1,axiom,
mreflexive @ rel_s5,
file('/export/starexec/sandbox2/tmp/tmp.BsxmwYnRkb/E---3.1_363922.p',a1) ).
thf(c_0_14,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_15,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_16,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_17,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_18,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_19,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_20,plain,
( mdia_s5
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X21: $i] :
( ~ ( rel_s5 @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia_s5]) ).
thf(c_0_21,plain,
( mbox_s5
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_s5 @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s5]) ).
thf(c_0_22,plain,
( msymmetric
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i] :
( ( Z0 @ X15 @ X16 )
=> ( Z0 @ X16 @ X15 ) ) ) ),
inference(fof_simplification,[status(thm)],[msymmetric]) ).
thf(c_0_23,negated_conjecture,
~ ( mvalid
@ ( mimplies
@ ( mand
@ ( mbox_s5
@ ( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( f @ X1 ) @ ( mbox_s5 @ ( f @ X1 ) ) ) ) )
@ ( mdia_s5
@ ( mexists_ind
@ ^ [X1: mu] : ( f @ X1 ) ) ) )
@ ( mbox_s5
@ ( mexists_ind
@ ^ [X1: mu] : ( f @ X1 ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove]) ).
thf(c_0_24,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_14,c_0_15]),c_0_16]) ).
thf(c_0_25,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_17,c_0_15]),c_0_16]) ).
thf(c_0_26,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18,c_0_15]),c_0_19]) ).
thf(c_0_27,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_28,plain,
( mdia_s5
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X21: $i] :
( ~ ( rel_s5 @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20,c_0_15]),c_0_21]) ).
thf(c_0_29,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] : ( Z0 @ X15 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_30,plain,
! [X26: $i,X27: $i] :
( ( rel_s5 @ X26 @ X27 )
=> ( rel_s5 @ X27 @ X26 ) ),
inference(apply_def,[status(thm)],[a3,c_0_22]) ).
thf(c_0_31,negated_conjecture,
~ ! [X35: $i] :
( ~ ~ ( ~ ! [X30: $i] :
( ~ ( rel_s5 @ X35 @ X30 )
| ! [X29: mu] :
( ~ ( f @ X29 @ X30 )
| ! [X28: $i] :
( ~ ( rel_s5 @ X30 @ X28 )
| ( f @ X29 @ X28 ) ) ) )
| ~ ~ ! [X32: $i] :
( ~ ( rel_s5 @ X35 @ X32 )
| ~ ~ ! [X31: mu] :
~ ( f @ X31 @ X32 ) ) )
| ! [X34: $i] :
( ~ ( rel_s5 @ X35 @ X34 )
| ~ ! [X33: mu] :
~ ( f @ X33 @ X34 ) ) ),
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)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_23]),c_0_24]),c_0_25]),c_0_19]),c_0_26]),c_0_27]),c_0_21]),c_0_28])]) ).
thf(c_0_32,plain,
! [X22: $i] : ( rel_s5 @ X22 @ X22 ),
inference(apply_def,[status(thm)],[a1,c_0_29]) ).
thf(c_0_33,plain,
! [X40: $i,X41: $i] :
( ~ ( rel_s5 @ X40 @ X41 )
| ( rel_s5 @ X41 @ X40 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
thf(c_0_34,negated_conjecture,
! [X43: $i,X44: mu,X45: $i,X49: mu] :
( ( ~ ( rel_s5 @ esk1_0 @ X43 )
| ~ ( f @ X44 @ X43 )
| ~ ( rel_s5 @ X43 @ X45 )
| ( f @ X44 @ X45 ) )
& ( rel_s5 @ esk1_0 @ esk2_0 )
& ( f @ esk3_0 @ esk2_0 )
& ( rel_s5 @ esk1_0 @ esk4_0 )
& ~ ( f @ X49 @ esk4_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_31])])])])]) ).
thf(c_0_35,plain,
! [X36: $i] : ( rel_s5 @ X36 @ X36 ),
inference(variable_rename,[status(thm)],[c_0_32]) ).
thf(c_0_36,plain,
! [X3: $i,X14: $i] :
( ( rel_s5 @ X14 @ X3 )
| ~ ( rel_s5 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_37,negated_conjecture,
rel_s5 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_38,negated_conjecture,
! [X3: $i,X1: mu,X14: $i] :
( ( f @ X1 @ X14 )
| ~ ( rel_s5 @ esk1_0 @ X3 )
| ~ ( f @ X1 @ X3 )
| ~ ( rel_s5 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_39,negated_conjecture,
rel_s5 @ esk1_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_40,plain,
! [X3: $i] : ( rel_s5 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_41,negated_conjecture,
! [X1: mu] :
~ ( f @ X1 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_42,negated_conjecture,
rel_s5 @ esk2_0 @ esk1_0,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
thf(c_0_43,negated_conjecture,
! [X1: mu] :
~ ( f @ X1 @ esk1_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),c_0_41]) ).
thf(c_0_44,negated_conjecture,
f @ esk3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_45,negated_conjecture,
! [X1: mu] :
~ ( f @ X1 @ esk2_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_42]),c_0_37])]),c_0_43]) ).
thf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_44,c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO497^6 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n018.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 17:12:57 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.24 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.BsxmwYnRkb/E---3.1_363922.p
% 0.09/0.26 % Version: 3.5.1-ho
% 0.09/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.09/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.09/0.26 % Starting almost_fo_3_lam with 300s (1) cores
% 0.09/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.26 % almost_fo_3_lam with pid 363937 completed with status 0
% 0.09/0.26 % Result found by almost_fo_3_lam
% 0.09/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.09/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.09/0.26 % Starting almost_fo_3_lam with 300s (1) cores
% 0.09/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26 % No SInE strategy applied
% 0.09/0.26 % Search class: HHUNF-FFSS00-SHSSMFNN
% 0.09/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.26 % SubtermCWHack with pid 363939 completed with status 0
% 0.09/0.26 % Result found by SubtermCWHack
% 0.09/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.09/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.09/0.26 % Starting almost_fo_3_lam with 300s (1) cores
% 0.09/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26 % No SInE strategy applied
% 0.09/0.26 % Search class: HHUNF-FFSS00-SHSSMFNN
% 0.09/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.26 % Preprocessing time : 0.001 s
% 0.09/0.26
% 0.09/0.26 % Proof found!
% 0.09/0.26 % SZS status Theorem
% 0.09/0.26 % SZS output start CNFRefutation
% See solution above
% 0.09/0.26 % Parsed axioms : 73
% 0.09/0.26 % Removed by relevancy pruning/SinE : 0
% 0.09/0.26 % Initial clauses : 44
% 0.09/0.26 % Removed in clause preprocessing : 36
% 0.09/0.26 % Initial clauses in saturation : 8
% 0.09/0.26 % Processed clauses : 17
% 0.09/0.26 % ...of these trivial : 0
% 0.09/0.26 % ...subsumed : 1
% 0.09/0.26 % ...remaining for further processing : 16
% 0.09/0.26 % Other redundant clauses eliminated : 0
% 0.09/0.26 % Clauses deleted for lack of memory : 0
% 0.09/0.26 % Backward-subsumed : 0
% 0.09/0.26 % Backward-rewritten : 0
% 0.09/0.26 % Generated clauses : 28
% 0.09/0.26 % ...of the previous two non-redundant : 16
% 0.09/0.26 % ...aggressively subsumed : 0
% 0.09/0.26 % Contextual simplify-reflections : 0
% 0.09/0.26 % Paramodulations : 27
% 0.09/0.26 % Factorizations : 0
% 0.09/0.26 % NegExts : 0
% 0.09/0.26 % Equation resolutions : 0
% 0.09/0.26 % Disequality decompositions : 0
% 0.09/0.26 % Total rewrite steps : 11
% 0.09/0.26 % ...of those cached : 5
% 0.09/0.26 % Propositional unsat checks : 0
% 0.09/0.26 % Propositional check models : 0
% 0.09/0.26 % Propositional check unsatisfiable : 0
% 0.09/0.26 % Propositional clauses : 0
% 0.09/0.26 % Propositional clauses after purity: 0
% 0.09/0.26 % Propositional unsat core size : 0
% 0.09/0.26 % Propositional preprocessing time : 0.000
% 0.09/0.26 % Propositional encoding time : 0.000
% 0.09/0.26 % Propositional solver time : 0.000
% 0.09/0.26 % Success case prop preproc time : 0.000
% 0.09/0.26 % Success case prop encoding time : 0.000
% 0.09/0.26 % Success case prop solver time : 0.000
% 0.09/0.26 % Current number of processed clauses : 15
% 0.09/0.26 % Positive orientable unit clauses : 5
% 0.09/0.26 % Positive unorientable unit clauses: 0
% 0.09/0.26 % Negative unit clauses : 3
% 0.09/0.26 % Non-unit-clauses : 7
% 0.09/0.26 % Current number of unprocessed clauses: 7
% 0.09/0.26 % ...number of literals in the above : 19
% 0.09/0.26 % Current number of archived formulas : 0
% 0.09/0.26 % Current number of archived clauses : 1
% 0.09/0.26 % Clause-clause subsumption calls (NU) : 10
% 0.09/0.26 % Rec. Clause-clause subsumption calls : 10
% 0.09/0.26 % Non-unit clause-clause subsumptions : 0
% 0.09/0.26 % Unit Clause-clause subsumption calls : 4
% 0.09/0.26 % Rewrite failures with RHS unbound : 0
% 0.09/0.26 % BW rewrite match attempts : 2
% 0.09/0.26 % BW rewrite match successes : 0
% 0.09/0.26 % Condensation attempts : 0
% 0.09/0.26 % Condensation successes : 0
% 0.09/0.26 % Termbank termtop insertions : 3093
% 0.09/0.26 % Search garbage collected termcells : 705
% 0.09/0.26
% 0.09/0.26 % -------------------------------------------------
% 0.09/0.26 % User time : 0.006 s
% 0.09/0.26 % System time : 0.001 s
% 0.09/0.26 % Total time : 0.007 s
% 0.09/0.26 % Maximum resident set size: 3700 pages
% 0.09/0.26
% 0.09/0.26 % -------------------------------------------------
% 0.09/0.26 % User time : 0.008 s
% 0.09/0.26 % System time : 0.007 s
% 0.09/0.26 % Total time : 0.014 s
% 0.09/0.26 % Maximum resident set size: 4608 pages
% 0.09/0.26 % E exiting
%------------------------------------------------------------------------------