%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO399^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 : n026.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:20 AM UTC 2026
% Result : Theorem 0.06s 0.25s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 193 ( 20 equ; 0 cnn)
% Maximal formula atoms : 48 ( 4 avg)
% Number of connectives : 431 ( 103 ~; 90 |; 15 &; 223 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 31 ( 31 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 4 con; 0-3 aty)
% Number of variables : 66 ( 45 ^; 21 !; 0 ?; 66 :)
% 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_30,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
rel_k: $i > $i > $o ).
thf(decl_55,type,
mbox_k: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
mdia_k: ( $i > $o ) > $i > $o ).
thf(decl_58,type,
q: $i > $o ).
thf(decl_59,type,
r: $i > $o ).
thf(decl_60,type,
esk1_0: $i ).
thf(decl_61,type,
esk2_0: $i ).
thf(decl_62,type,
esk3_0: $i ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.is9Ula3LSa/E---3.1_855135.p',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.is9Ula3LSa/E---3.1_855135.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.is9Ula3LSa/E---3.1_855135.p',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.is9Ula3LSa/E---3.1_855135.p',mimplies) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mand @ ( mimplies @ X6 @ X7 ) @ ( mimplies @ X7 @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.is9Ula3LSa/E---3.1_855135.p',mequiv) ).
thf(mdia_k,axiom,
( mdia_k
= ( ^ [X6: $i > $o] : ( mnot @ ( mbox_k @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.is9Ula3LSa/E---3.1_855135.p',mdia_k) ).
thf(mbox_k,axiom,
( mbox_k
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_k @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.is9Ula3LSa/E---3.1_855135.p',mbox_k) ).
thf(prove,conjecture,
mvalid @ ( mequiv @ ( mnot @ ( mdia_k @ ( mand @ q @ r ) ) ) @ ( mbox_k @ ( mimplies @ q @ ( mnot @ r ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.is9Ula3LSa/E---3.1_855135.p',prove) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.is9Ula3LSa/E---3.1_855135.p',mvalid) ).
thf(c_0_9,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_12,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_13,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv]) ).
thf(c_0_14,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_9,c_0_10]),c_0_11]) ).
thf(c_0_15,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_12,c_0_10]),c_0_11]) ).
thf(c_0_16,plain,
( mdia_k
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X21: $i] :
( ~ ( rel_k @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia_k]) ).
thf(c_0_17,plain,
( mbox_k
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_k @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_k]) ).
thf(c_0_18,negated_conjecture,
~ ( mvalid @ ( mequiv @ ( mnot @ ( mdia_k @ ( mand @ q @ r ) ) ) @ ( mbox_k @ ( mimplies @ q @ ( mnot @ r ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove]) ).
thf(c_0_19,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
thf(c_0_20,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_21,plain,
( mdia_k
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X21: $i] :
( ~ ( rel_k @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16,c_0_10]),c_0_17]) ).
thf(c_0_22,negated_conjecture,
~ ! [X24: $i] :
~ ( ~ ( ~ ~ ~ ! [X22: $i] :
( ~ ( rel_k @ X24 @ X22 )
| ~ ~ ( ~ ( q @ X22 )
| ~ ( r @ X22 ) ) )
| ! [X23: $i] :
( ~ ( rel_k @ X24 @ X23 )
| ~ ( q @ X23 )
| ~ ( r @ X23 ) ) )
| ~ ( ~ ! [X23: $i] :
( ~ ( rel_k @ X24 @ X23 )
| ~ ( q @ X23 )
| ~ ( r @ X23 ) )
| ~ ~ ! [X22: $i] :
( ~ ( rel_k @ X24 @ X22 )
| ~ ~ ( ~ ( q @ X22 )
| ~ ( r @ X22 ) ) ) ) ),
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)],[c_0_18,c_0_10]),c_0_14]),c_0_15]),c_0_19]),c_0_20]),c_0_17]),c_0_21])]) ).
thf(c_0_23,negated_conjecture,
! [X26: $i,X28: $i] :
( ( ~ ( rel_k @ esk1_0 @ X28 )
| ~ ( q @ X28 )
| ~ ( r @ X28 )
| ~ ( rel_k @ esk1_0 @ X26 )
| ~ ( q @ X26 )
| ~ ( r @ X26 ) )
& ( ( rel_k @ esk1_0 @ esk3_0 )
| ~ ( rel_k @ esk1_0 @ X26 )
| ~ ( q @ X26 )
| ~ ( r @ X26 ) )
& ( ( q @ esk3_0 )
| ~ ( rel_k @ esk1_0 @ X26 )
| ~ ( q @ X26 )
| ~ ( r @ X26 ) )
& ( ( r @ esk3_0 )
| ~ ( rel_k @ esk1_0 @ X26 )
| ~ ( q @ X26 )
| ~ ( r @ X26 ) )
& ( ~ ( rel_k @ esk1_0 @ X28 )
| ~ ( q @ X28 )
| ~ ( r @ X28 )
| ( rel_k @ esk1_0 @ esk2_0 ) )
& ( ( rel_k @ esk1_0 @ esk3_0 )
| ( rel_k @ esk1_0 @ esk2_0 ) )
& ( ( q @ esk3_0 )
| ( rel_k @ esk1_0 @ esk2_0 ) )
& ( ( r @ esk3_0 )
| ( rel_k @ esk1_0 @ esk2_0 ) )
& ( ~ ( rel_k @ esk1_0 @ X28 )
| ~ ( q @ X28 )
| ~ ( r @ X28 )
| ( q @ esk2_0 ) )
& ( ( rel_k @ esk1_0 @ esk3_0 )
| ( q @ esk2_0 ) )
& ( ( q @ esk3_0 )
| ( q @ esk2_0 ) )
& ( ( r @ esk3_0 )
| ( q @ esk2_0 ) )
& ( ~ ( rel_k @ esk1_0 @ X28 )
| ~ ( q @ X28 )
| ~ ( r @ X28 )
| ( r @ esk2_0 ) )
& ( ( rel_k @ esk1_0 @ esk3_0 )
| ( r @ esk2_0 ) )
& ( ( q @ esk3_0 )
| ( r @ esk2_0 ) )
& ( ( r @ esk3_0 )
| ( r @ esk2_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_24,negated_conjecture,
! [X3: $i] :
( ( q @ esk2_0 )
| ~ ( rel_k @ esk1_0 @ X3 )
| ~ ( q @ X3 )
| ~ ( r @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_25,negated_conjecture,
( ( rel_k @ esk1_0 @ esk3_0 )
| ( q @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_26,negated_conjecture,
( ( r @ esk3_0 )
| ( q @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_27,negated_conjecture,
( ( q @ esk3_0 )
| ( q @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i] :
( ( q @ esk3_0 )
| ~ ( rel_k @ esk1_0 @ X3 )
| ~ ( q @ X3 )
| ~ ( r @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_29,negated_conjecture,
( ( q @ esk3_0 )
| ( rel_k @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_30,negated_conjecture,
q @ esk2_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]) ).
thf(c_0_31,negated_conjecture,
( ( q @ esk3_0 )
| ( r @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_32,negated_conjecture,
! [X3: $i] :
( ( r @ esk2_0 )
| ~ ( rel_k @ esk1_0 @ X3 )
| ~ ( q @ X3 )
| ~ ( r @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_33,negated_conjecture,
( ( rel_k @ esk1_0 @ esk3_0 )
| ( r @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_34,negated_conjecture,
q @ esk3_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),c_0_31]) ).
thf(c_0_35,negated_conjecture,
( ( r @ esk3_0 )
| ( r @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_36,negated_conjecture,
! [X3: $i] :
( ( rel_k @ esk1_0 @ esk3_0 )
| ~ ( rel_k @ esk1_0 @ X3 )
| ~ ( q @ X3 )
| ~ ( r @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_37,negated_conjecture,
( ( rel_k @ esk1_0 @ esk3_0 )
| ( rel_k @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_38,negated_conjecture,
r @ esk2_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]) ).
thf(c_0_39,negated_conjecture,
! [X3: $i] :
( ( r @ esk3_0 )
| ~ ( rel_k @ esk1_0 @ X3 )
| ~ ( q @ X3 )
| ~ ( r @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_40,negated_conjecture,
( ( r @ esk3_0 )
| ( rel_k @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_41,negated_conjecture,
! [X3: $i,X14: $i] :
( ~ ( rel_k @ esk1_0 @ X3 )
| ~ ( q @ X3 )
| ~ ( r @ X3 )
| ~ ( rel_k @ esk1_0 @ X14 )
| ~ ( q @ X14 )
| ~ ( r @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_42,negated_conjecture,
rel_k @ esk1_0 @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_30]),c_0_38])]) ).
thf(c_0_43,negated_conjecture,
r @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_30]),c_0_38])]) ).
thf(c_0_44,negated_conjecture,
! [X3: $i] :
( ~ ( rel_k @ esk1_0 @ X3 )
| ~ ( q @ X3 )
| ~ ( r @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_34]),c_0_43])]) ).
thf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_42]),c_0_34]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO399^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.06/0.18 % Computer : n026.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Tue Sep 29 16:53:27 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.22 Running higher-order theorem proving
% 0.06/0.23 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.is9Ula3LSa/E---3.1_855135.p
% 0.06/0.25 % Version: 3.5.1-ho
% 0.06/0.25 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.06/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.06/0.25 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.06/0.25 % Starting almost_fo_3_lam with 300s (1) cores
% 0.06/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.06/0.25 % almost_fo_3_lam with pid 855150 completed with status 0
% 0.06/0.25 % Result found by almost_fo_3_lam
% 0.06/0.25 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.06/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.06/0.25 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.06/0.25 % Starting almost_fo_3_lam with 300s (1) cores
% 0.06/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.25 % No SInE strategy applied
% 0.06/0.25 % Search class: HGHNF-FFSM00-SHSSMFNN
% 0.06/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.25 % SubtermCWHack with pid 855156 completed with status 0
% 0.06/0.25 % Result found by SubtermCWHack
% 0.06/0.25 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.06/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.06/0.25 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.06/0.25 % Starting almost_fo_3_lam with 300s (1) cores
% 0.06/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.25 % No SInE strategy applied
% 0.06/0.25 % Search class: HGHNF-FFSM00-SHSSMFNN
% 0.06/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.25 % Preprocessing time : 0.001 s
% 0.06/0.25
% 0.06/0.25 % Proof found!
% 0.06/0.25 % SZS status Theorem
% 0.06/0.25 % SZS output start CNFRefutation
% See solution above
% 0.06/0.25 % Parsed axioms : 72
% 0.06/0.25 % Removed by relevancy pruning/SinE : 0
% 0.06/0.25 % Initial clauses : 54
% 0.06/0.25 % Removed in clause preprocessing : 38
% 0.06/0.25 % Initial clauses in saturation : 16
% 0.06/0.25 % Processed clauses : 24
% 0.06/0.25 % ...of these trivial : 0
% 0.06/0.25 % ...subsumed : 1
% 0.06/0.25 % ...remaining for further processing : 23
% 0.06/0.25 % Other redundant clauses eliminated : 0
% 0.06/0.25 % Clauses deleted for lack of memory : 0
% 0.06/0.25 % Backward-subsumed : 3
% 0.06/0.25 % Backward-rewritten : 13
% 0.06/0.25 % Generated clauses : 22
% 0.06/0.25 % ...of the previous two non-redundant : 13
% 0.06/0.25 % ...aggressively subsumed : 0
% 0.06/0.25 % Contextual simplify-reflections : 4
% 0.06/0.25 % Paramodulations : 22
% 0.06/0.25 % Factorizations : 0
% 0.06/0.25 % NegExts : 0
% 0.06/0.25 % Equation resolutions : 0
% 0.06/0.25 % Disequality decompositions : 0
% 0.06/0.25 % Total rewrite steps : 33
% 0.06/0.25 % ...of those cached : 27
% 0.06/0.25 % Propositional unsat checks : 0
% 0.06/0.25 % Propositional check models : 0
% 0.06/0.25 % Propositional check unsatisfiable : 0
% 0.06/0.25 % Propositional clauses : 0
% 0.06/0.25 % Propositional clauses after purity: 0
% 0.06/0.25 % Propositional unsat core size : 0
% 0.06/0.25 % Propositional preprocessing time : 0.000
% 0.06/0.25 % Propositional encoding time : 0.000
% 0.06/0.25 % Propositional solver time : 0.000
% 0.06/0.25 % Success case prop preproc time : 0.000
% 0.06/0.25 % Success case prop encoding time : 0.000
% 0.06/0.25 % Success case prop solver time : 0.000
% 0.06/0.25 % Current number of processed clauses : 7
% 0.06/0.25 % Positive orientable unit clauses : 6
% 0.06/0.25 % Positive unorientable unit clauses: 0
% 0.06/0.25 % Negative unit clauses : 0
% 0.06/0.25 % Non-unit-clauses : 1
% 0.06/0.25 % Current number of unprocessed clauses: 1
% 0.06/0.25 % ...number of literals in the above : 3
% 0.06/0.25 % Current number of archived formulas : 0
% 0.06/0.25 % Current number of archived clauses : 16
% 0.06/0.25 % Clause-clause subsumption calls (NU) : 13
% 0.06/0.25 % Rec. Clause-clause subsumption calls : 13
% 0.06/0.25 % Non-unit clause-clause subsumptions : 6
% 0.06/0.25 % Unit Clause-clause subsumption calls : 5
% 0.06/0.25 % Rewrite failures with RHS unbound : 0
% 0.06/0.25 % BW rewrite match attempts : 6
% 0.06/0.25 % BW rewrite match successes : 6
% 0.06/0.25 % Condensation attempts : 0
% 0.06/0.25 % Condensation successes : 0
% 0.06/0.25 % Termbank termtop insertions : 3287
% 0.06/0.25 % Search garbage collected termcells : 571
% 0.06/0.25
% 0.06/0.25 % -------------------------------------------------
% 0.06/0.25 % User time : 0.004 s
% 0.06/0.25 % System time : 0.003 s
% 0.06/0.25 % Total time : 0.007 s
% 0.06/0.25 % Maximum resident set size: 3700 pages
% 0.06/0.25
% 0.06/0.25 % -------------------------------------------------
% 0.06/0.25 % User time : 0.007 s
% 0.06/0.25 % System time : 0.008 s
% 0.06/0.25 % Total time : 0.014 s
% 0.06/0.25 % Maximum resident set size: 4864 pages
% 0.06/0.25 % E exiting
%------------------------------------------------------------------------------