%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PHI002^2 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:20:06 AM UTC 2026
% Result : Theorem 0.10s 0.23s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 42 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 119 ( 24 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 281 ( 30 ~; 22 |; 12 &; 209 @)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 92 ( 92 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 18 usr; 2 con; 0-3 aty)
% Number of variables : 121 ( 73 ^; 40 !; 8 ?; 121 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_26,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_29,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_34,type,
mforall_indset: ( ( mu > $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_36,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_39,type,
mbox_generic: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_40,type,
mdia_generic: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_41,type,
rel: $i > $i > $o ).
thf(decl_42,type,
mbox: ( $i > $o ) > $i > $o ).
thf(decl_43,type,
mdia: ( $i > $o ) > $i > $o ).
thf(decl_44,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_46,type,
positive: ( mu > $i > $o ) > $i > $o ).
thf(decl_47,type,
esk1_0: $i ).
thf(decl_48,type,
epred1_0: mu > $i > $o ).
thf(decl_49,type,
esk2_3: $i > ( mu > $i > $o ) > ( mu > $i > $o ) > $i ).
thf(decl_50,type,
esk3_3: $i > ( mu > $i > $o ) > ( mu > $i > $o ) > mu ).
thf(mdia_generic,axiom,
( mdia_generic
= ( ^ [X15: $i > $i > $o,X4: $i > $o,X3: $i] :
? [X16: $i] :
( ( X15 @ X3 @ X16 )
& ( X4 @ X16 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mdia_generic) ).
thf(mbox_generic,axiom,
( mbox_generic
= ( ^ [X15: $i > $i > $o,X4: $i > $o,X3: $i] :
! [X16: $i] :
( ~ ( X15 @ X3 @ X16 )
| ( X4 @ X16 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mbox_generic) ).
thf(thmT1,conjecture,
( mvalid
@ ( mforall_indset
@ ^ [X20: mu > $i > $o] :
( mimplies @ ( positive @ X20 )
@ ( mdia
@ ( mexists_ind
@ ^ [X1: mu] : ( X20 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',thmT1) ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X11: mu > $i > $o,X3: $i] :
? [X1: mu] : ( X11 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mexists_ind) ).
thf(mdia,axiom,
( mdia
= ( ^ [Z0: $i > $o,Z1: $i] :
? [X22: $i] :
( ( rel @ Z1 @ X22 )
& ( Z0 @ X22 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mdia) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
=> ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mimplies) ).
thf(mforall_indset,axiom,
( mforall_indset
= ( ^ [X7: ( mu > $i > $o ) > $i > $o,X3: $i] :
! [X8: mu > $i > $o] : ( X7 @ X8 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mforall_indset) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mvalid) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X6: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X6 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mforall_ind) ).
thf(mbox,axiom,
( mbox
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X21: $i] :
( ~ ( rel @ Z1 @ X21 )
| ( Z0 @ X21 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mbox) ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
& ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mand) ).
thf(axA2,axiom,
( mvalid
@ ( mforall_indset
@ ^ [X18: mu > $i > $o] :
( mforall_indset
@ ^ [X19: mu > $i > $o] :
( mimplies
@ ( mand @ ( positive @ X18 )
@ ( mbox
@ ( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( X18 @ X1 ) @ ( X19 @ X1 ) ) ) ) )
@ ( positive @ X19 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',axA2) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mnot) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
<=> ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',mequiv) ).
thf(axA1,axiom,
( mvalid
@ ( mforall_indset
@ ^ [X17: mu > $i > $o] :
( mequiv
@ ( positive
@ ^ [X1: mu] : ( mnot @ ( X17 @ X1 ) ) )
@ ( mnot @ ( positive @ X17 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hB7cKyzsBL/E---3.1_2081612.p',axA1) ).
thf(c_0_15,plain,
( mdia_generic
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
? [X16: $i] :
( ( Z0 @ Z2 @ X16 )
& ( Z1 @ X16 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia_generic]) ).
thf(c_0_16,plain,
( mbox_generic
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X16: $i] :
( ~ ( Z0 @ Z2 @ X16 )
| ( Z1 @ X16 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_generic]) ).
thf(c_0_17,negated_conjecture,
~ ( mvalid
@ ( mforall_indset
@ ^ [X20: mu > $i > $o] :
( mimplies @ ( positive @ X20 )
@ ( mdia
@ ( mexists_ind
@ ^ [X1: mu] : ( X20 @ X1 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[thmT1]) ).
thf(c_0_18,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
? [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_19,axiom,
( mdia
= ( ^ [Z0: $i > $o,Z1: $i] :
? [X22: $i] :
( ( rel @ Z1 @ X22 )
& ( Z0 @ X22 ) ) ) ),
inference(apply_def,[status(thm)],[mdia,c_0_15]) ).
thf(c_0_20,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_21,plain,
( mforall_indset
= ( ^ [Z0: ( mu > $i > $o ) > $i > $o,Z1: $i] :
! [X8: mu > $i > $o] : ( Z0 @ X8 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_indset]) ).
thf(c_0_22,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_23,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_24,axiom,
( mbox
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X21: $i] :
( ~ ( rel @ Z1 @ X21 )
| ( Z0 @ X21 ) ) ) ),
inference(apply_def,[status(thm)],[mbox,c_0_16]) ).
thf(c_0_25,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_26,negated_conjecture,
~ ! [X26: $i,X25: mu > $i > $o] :
( ( positive @ X25 @ X26 )
=> ? [X24: $i] :
( ( rel @ X26 @ X24 )
& ? [X23: mu] : ( X25 @ X23 @ X24 ) ) ),
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_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21]),c_0_22]) ).
thf(c_0_27,plain,
! [X33: $i,X32: mu > $i > $o,X31: mu > $i > $o] :
( ( ( positive @ X32 @ X33 )
& ! [X30: $i] :
( ~ ( rel @ X33 @ X30 )
| ! [X29: mu] :
( ( X32 @ X29 @ X30 )
=> ( X31 @ X29 @ X30 ) ) ) )
=> ( positive @ X31 @ X33 ) ),
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(fof_simplification,[status(thm)],[axA2]),c_0_23]),c_0_24]),c_0_25]),c_0_20]),c_0_21]),c_0_22])]) ).
thf(c_0_28,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_29,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
<=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv]) ).
thf(c_0_30,negated_conjecture,
! [X36: $i,X37: mu] :
( ( positive @ epred1_0 @ esk1_0 )
& ( ~ ( rel @ esk1_0 @ X36 )
| ~ ( epred1_0 @ X37 @ X36 ) ) ),
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_31,plain,
! [X40: $i,X41: mu > $i > $o,X42: mu > $i > $o] :
( ( ( rel @ X40 @ ( esk2_3 @ X40 @ X41 @ X42 ) )
| ~ ( positive @ X41 @ X40 )
| ( positive @ X42 @ X40 ) )
& ( ( X41 @ ( esk3_3 @ X40 @ X41 @ X42 ) @ ( esk2_3 @ X40 @ X41 @ X42 ) )
| ~ ( positive @ X41 @ X40 )
| ( positive @ X42 @ X40 ) )
& ( ~ ( X42 @ ( esk3_3 @ X40 @ X41 @ X42 ) @ ( esk2_3 @ X40 @ X41 @ X42 ) )
| ~ ( positive @ X41 @ X40 )
| ( positive @ X42 @ X40 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])])]) ).
thf(c_0_32,plain,
! [X28: $i,X27: mu > $i > $o] :
( ( positive
@ ^ [Z0: mu,Z1: $i] :
~ ( X27 @ Z0 @ Z1 )
@ X28 )
<=> ~ ( positive @ X27 @ X28 ) ),
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(fof_simplification,[status(thm)],[axA1]),c_0_28]),c_0_29]),c_0_21]),c_0_22])]) ).
thf(c_0_33,negated_conjecture,
! [X1: mu,X3: $i] :
( ~ ( rel @ esk1_0 @ X3 )
| ~ ( epred1_0 @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_34,plain,
! [X8: mu > $i > $o,X6: mu > $i > $o,X3: $i] :
( ( rel @ X3 @ ( esk2_3 @ X3 @ X6 @ X8 ) )
| ( positive @ X8 @ X3 )
| ~ ( positive @ X6 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_35,plain,
! [X38: $i,X39: mu > $i > $o] :
( ( ~ ( positive
@ ^ [Z0: mu,Z1: $i] :
~ ( X39 @ Z0 @ Z1 )
@ X38 )
| ~ ( positive @ X39 @ X38 ) )
& ( ( positive @ X39 @ X38 )
| ( positive
@ ^ [Z0: mu,Z1: $i] :
~ ( X39 @ Z0 @ Z1 )
@ X38 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])]) ).
thf(c_0_36,negated_conjecture,
! [X6: mu > $i > $o,X1: mu,X8: mu > $i > $o] :
( ( positive @ X6 @ esk1_0 )
| ~ ( epred1_0 @ X1 @ ( esk2_3 @ esk1_0 @ X8 @ X6 ) )
| ~ ( positive @ X8 @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
thf(c_0_37,plain,
! [X8: mu > $i > $o,X6: mu > $i > $o,X3: $i] :
( ( X6 @ ( esk3_3 @ X3 @ X6 @ X8 ) @ ( esk2_3 @ X3 @ X6 @ X8 ) )
| ( positive @ X8 @ X3 )
| ~ ( positive @ X6 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_38,negated_conjecture,
positive @ epred1_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_39,plain,
! [X6: mu > $i > $o,X3: $i] :
( ~ ( positive
@ ^ [Z0: mu,Z1: $i] :
~ ( X6 @ Z0 @ Z1 )
@ X3 )
| ~ ( positive @ X6 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_40,negated_conjecture,
! [X6: mu > $i > $o] : ( positive @ X6 @ esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
thf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PHI002^2 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.16 % Computer : n013.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 13:16:21 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running higher-order theorem proving
% 0.10/0.21 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.hB7cKyzsBL/E---3.1_2081612.p
% 0.10/0.23 % Version: 3.5.1-ho
% 0.10/0.23 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.10/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.23 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.10/0.23 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.10/0.23 % Starting sh5l with 300s (1) cores
% 0.10/0.23 % Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.23 % sh5l with pid 2081627 completed with status 0
% 0.10/0.23 % Result found by sh5l
% 0.10/0.23 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.10/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.23 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.10/0.23 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.10/0.23 % Starting sh5l with 300s (1) cores
% 0.10/0.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.23 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.23 % Search class: HGHNF-FFSF33-MHHSMSBN
% 0.10/0.23 % partial match(1): HGHNF-FFSF33-SHHSMSBN
% 0.10/0.23 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.23 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.23 % SubtermCWHack with pid 2081631 completed with status 0
% 0.10/0.23 % Result found by SubtermCWHack
% 0.10/0.23 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.10/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.23 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.10/0.23 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.10/0.23 % Starting sh5l with 300s (1) cores
% 0.10/0.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.23 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.23 % Search class: HGHNF-FFSF33-MHHSMSBN
% 0.10/0.23 % partial match(1): HGHNF-FFSF33-SHHSMSBN
% 0.10/0.23 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.23 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.23 % Preprocessing time : 0.001 s
% 0.10/0.23
% 0.10/0.23 % Proof found!
% 0.10/0.23 % SZS status Theorem
% 0.10/0.23 % SZS output start CNFRefutation
% See solution above
% 0.10/0.23 % Parsed axioms : 50
% 0.10/0.23 % Removed by relevancy pruning/SinE : 35
% 0.10/0.23 % Initial clauses : 7
% 0.10/0.23 % Removed in clause preprocessing : 0
% 0.10/0.23 % Initial clauses in saturation : 7
% 0.10/0.23 % Processed clauses : 8
% 0.10/0.23 % ...of these trivial : 0
% 0.10/0.23 % ...subsumed : 0
% 0.10/0.23 % ...remaining for further processing : 8
% 0.10/0.23 % Other redundant clauses eliminated : 0
% 0.10/0.23 % Clauses deleted for lack of memory : 0
% 0.10/0.23 % Backward-subsumed : 0
% 0.10/0.23 % Backward-rewritten : 2
% 0.10/0.23 % Generated clauses : 4
% 0.10/0.23 % ...of the previous two non-redundant : 2
% 0.10/0.23 % ...aggressively subsumed : 0
% 0.10/0.23 % Contextual simplify-reflections : 0
% 0.10/0.23 % Paramodulations : 4
% 0.10/0.23 % Factorizations : 0
% 0.10/0.23 % NegExts : 0
% 0.10/0.23 % Equation resolutions : 0
% 0.10/0.23 % Disequality decompositions : 0
% 0.10/0.23 % Total rewrite steps : 5
% 0.10/0.23 % ...of those cached : 1
% 0.10/0.23 % Propositional unsat checks : 0
% 0.10/0.23 % Propositional check models : 0
% 0.10/0.23 % Propositional check unsatisfiable : 0
% 0.10/0.23 % Propositional clauses : 0
% 0.10/0.23 % Propositional clauses after purity: 0
% 0.10/0.23 % Propositional unsat core size : 0
% 0.10/0.23 % Propositional preprocessing time : 0.000
% 0.10/0.23 % Propositional encoding time : 0.000
% 0.10/0.23 % Propositional solver time : 0.000
% 0.10/0.23 % Success case prop preproc time : 0.000
% 0.10/0.23 % Success case prop encoding time : 0.000
% 0.10/0.23 % Success case prop solver time : 0.000
% 0.10/0.23 % Current number of processed clauses : 6
% 0.10/0.23 % Positive orientable unit clauses : 1
% 0.10/0.23 % Positive unorientable unit clauses: 0
% 0.10/0.23 % Negative unit clauses : 0
% 0.10/0.23 % Non-unit-clauses : 5
% 0.10/0.23 % Current number of unprocessed clauses: 1
% 0.10/0.23 % ...number of literals in the above : 3
% 0.10/0.23 % Current number of archived formulas : 0
% 0.10/0.23 % Current number of archived clauses : 2
% 0.10/0.23 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.23 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.23 % Non-unit clause-clause subsumptions : 0
% 0.10/0.23 % Unit Clause-clause subsumption calls : 0
% 0.10/0.23 % Rewrite failures with RHS unbound : 0
% 0.10/0.23 % BW rewrite match attempts : 3
% 0.10/0.23 % BW rewrite match successes : 3
% 0.10/0.23 % Condensation attempts : 0
% 0.10/0.23 % Condensation successes : 0
% 0.10/0.24 % Termbank termtop insertions : 1719
% 0.10/0.24 % Search garbage collected termcells : 657
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.004 s
% 0.10/0.24 % System time : 0.004 s
% 0.10/0.24 % Total time : 0.008 s
% 0.10/0.24 % Maximum resident set size: 3632 pages
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.007 s
% 0.10/0.24 % System time : 0.007 s
% 0.10/0.24 % Total time : 0.015 s
% 0.10/0.24 % Maximum resident set size: 4864 pages
% 0.10/0.24 % E exiting
%------------------------------------------------------------------------------