%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO568^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 : n015.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:43:25 AM UTC 2026
% Result : Theorem 0.10s 0.24s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 54 ( 35 unt; 0 typ; 0 def)
% Number of atoms : 173 ( 23 equ; 0 cnn)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 412 ( 71 ~; 59 |; 10 &; 266 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 40 ( 40 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 5 con; 0-3 aty)
% Number of variables : 102 ( 50 ^; 52 !; 0 ?; 102 :)
% 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_34,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
exists_in_world: mu > $i > $o ).
thf(decl_38,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_41,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_44,type,
mtransitive: ( $i > $i > $o ) > $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,
f: mu > $i > $o ).
thf(decl_59,type,
a: mu ).
thf(decl_61,type,
esk2_0: $i ).
thf(decl_62,type,
esk3_0: $i ).
thf(decl_63,type,
esk4_0: $i ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',mimplies) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mand @ ( mimplies @ X4 @ X5 ) @ ( mimplies @ X5 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',mequiv) ).
thf(con,conjecture,
( mvalid
@ ( mimplies
@ ( mforall_ind
@ ^ [X20: mu] : ( mor @ ( mbox_s4 @ ( f @ X20 ) ) @ ( mbox_s4 @ ( mnot @ ( f @ X20 ) ) ) ) )
@ ( mbox_s4 @ ( mequiv @ ( mbox_s4 @ ( f @ a ) ) @ ( f @ a ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',con) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X11: mu > $i > $o,X3: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ X3 )
=> ( X11 @ X12 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',mforall_ind) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.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.CPwxtPZn5n/E---3.1_3836384.p',mbox_s4) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X6: $i > $i > $o] :
! [X16: $i] : ( X6 @ X16 @ X16 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',mreflexive) ).
thf(mtransitive,axiom,
( mtransitive
= ( ^ [X6: $i > $i > $o] :
! [X16: $i,X17: $i,X18: $i] :
( ( ( X6 @ X16 @ X17 )
& ( X6 @ X17 @ X18 ) )
=> ( X6 @ X16 @ X18 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',mtransitive) ).
thf(a1,axiom,
mreflexive @ rel_s4,
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',a1) ).
thf(a2,axiom,
mtransitive @ rel_s4,
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',a2) ).
thf(existence_of_a_ax,axiom,
! [X7: $i] : ( exists_in_world @ a @ X7 ),
file('/export/starexec/sandbox/tmp/tmp.CPwxtPZn5n/E---3.1_3836384.p',existence_of_a_ax) ).
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,
( 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_19,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_20,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_21,negated_conjecture,
~ ( mvalid
@ ( mimplies
@ ( mforall_ind
@ ^ [X20: mu] : ( mor @ ( mbox_s4 @ ( f @ X20 ) ) @ ( mbox_s4 @ ( mnot @ ( f @ X20 ) ) ) ) )
@ ( mbox_s4 @ ( mequiv @ ( mbox_s4 @ ( f @ a ) ) @ ( f @ a ) ) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_22,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_18,c_0_19]),c_0_20]) ).
thf(c_0_23,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ Z1 )
=> ( Z0 @ X12 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_24,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_25,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_26,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X16: $i] : ( Z0 @ X16 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_27,plain,
( mtransitive
= ( ^ [Z0: $i > $i > $o] :
! [X16: $i,X17: $i,X18: $i] :
( ( ( Z0 @ X16 @ X17 )
& ( Z0 @ X17 @ X18 ) )
=> ( Z0 @ X16 @ X18 ) ) ) ),
inference(fof_simplification,[status(thm)],[mtransitive]) ).
thf(c_0_28,negated_conjecture,
~ ! [X40: $i] :
( ~ ! [X37: mu] :
( ( exists_in_world @ X37 @ X40 )
=> ( ! [X35: $i] :
( ~ ( rel_s4 @ X40 @ X35 )
| ( f @ X37 @ X35 ) )
| ! [X36: $i] :
( ~ ( rel_s4 @ X40 @ X36 )
| ~ ( f @ X37 @ X36 ) ) ) )
| ! [X39: $i] :
( ~ ( rel_s4 @ X40 @ X39 )
| ~ ( ~ ( ~ ! [X38: $i] :
( ~ ( rel_s4 @ X39 @ X38 )
| ( f @ a @ X38 ) )
| ( f @ a @ X39 ) )
| ~ ( ~ ( f @ a @ X39 )
| ! [X38: $i] :
( ~ ( rel_s4 @ X39 @ X38 )
| ( f @ a @ 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)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_21]),c_0_15]),c_0_16]),c_0_20]),c_0_22]),c_0_23]),c_0_24]),c_0_25])]) ).
thf(c_0_29,plain,
! [X31: $i] : ( rel_s4 @ X31 @ X31 ),
inference(apply_def,[status(thm)],[a1,c_0_26]) ).
thf(c_0_30,plain,
! [X32: $i,X33: $i,X34: $i] :
( ( ( rel_s4 @ X32 @ X33 )
& ( rel_s4 @ X33 @ X34 ) )
=> ( rel_s4 @ X32 @ X34 ) ),
inference(apply_def,[status(thm)],[a2,c_0_27]) ).
thf(c_0_31,negated_conjecture,
! [X52: mu,X53: $i,X54: $i,X56: $i] :
( ( ~ ( exists_in_world @ X52 @ esk2_0 )
| ~ ( rel_s4 @ esk2_0 @ X53 )
| ( f @ X52 @ X53 )
| ~ ( rel_s4 @ esk2_0 @ X54 )
| ~ ( f @ X52 @ X54 ) )
& ( rel_s4 @ esk2_0 @ esk3_0 )
& ( ( f @ a @ esk3_0 )
| ~ ( rel_s4 @ esk3_0 @ X56 )
| ( f @ a @ X56 ) )
& ( ( rel_s4 @ esk3_0 @ esk4_0 )
| ~ ( rel_s4 @ esk3_0 @ X56 )
| ( f @ a @ X56 ) )
& ( ~ ( f @ a @ esk4_0 )
| ~ ( rel_s4 @ esk3_0 @ X56 )
| ( f @ a @ X56 ) )
& ( ( f @ a @ esk3_0 )
| ~ ( f @ a @ esk3_0 ) )
& ( ( rel_s4 @ esk3_0 @ esk4_0 )
| ~ ( f @ a @ esk3_0 ) )
& ( ~ ( f @ a @ esk4_0 )
| ~ ( f @ a @ esk3_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_28])])])])])]) ).
thf(c_0_32,plain,
! [X43: $i] : ( rel_s4 @ X43 @ X43 ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
thf(c_0_33,plain,
! [X50: $i] : ( exists_in_world @ a @ X50 ),
inference(variable_rename,[status(thm)],[existence_of_a_ax]) ).
thf(c_0_34,plain,
! [X44: $i,X45: $i,X46: $i] :
( ~ ( rel_s4 @ X44 @ X45 )
| ~ ( rel_s4 @ X45 @ X46 )
| ( rel_s4 @ X44 @ X46 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
thf(c_0_35,negated_conjecture,
( ( rel_s4 @ esk3_0 @ esk4_0 )
| ~ ( f @ a @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_36,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ esk3_0 @ esk4_0 )
| ( f @ a @ X3 )
| ~ ( rel_s4 @ esk3_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_37,plain,
! [X3: $i] : ( rel_s4 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_38,negated_conjecture,
! [X3: $i] :
( ( f @ a @ esk3_0 )
| ( f @ a @ X3 )
| ~ ( rel_s4 @ esk3_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_39,negated_conjecture,
! [X3: $i,X10: mu,X7: $i] :
( ( f @ X10 @ X3 )
| ~ ( exists_in_world @ X10 @ esk2_0 )
| ~ ( rel_s4 @ esk2_0 @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X7 )
| ~ ( f @ X10 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_40,plain,
! [X3: $i] : ( exists_in_world @ a @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_41,plain,
! [X3: $i,X7: $i,X16: $i] :
( ( rel_s4 @ X3 @ X16 )
| ~ ( rel_s4 @ X3 @ X7 )
| ~ ( rel_s4 @ X7 @ X16 ) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_42,negated_conjecture,
rel_s4 @ esk3_0 @ esk4_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_43,negated_conjecture,
( ~ ( f @ a @ esk4_0 )
| ~ ( f @ a @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_44,negated_conjecture,
f @ a @ esk3_0,
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
thf(c_0_45,negated_conjecture,
! [X3: $i,X7: $i] :
( ( f @ a @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X7 )
| ~ ( rel_s4 @ esk2_0 @ X3 )
| ~ ( f @ a @ X7 ) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_46,negated_conjecture,
rel_s4 @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_47,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ X3 @ esk4_0 )
| ~ ( rel_s4 @ X3 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
thf(c_0_48,negated_conjecture,
~ ( f @ a @ esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
thf(c_0_49,negated_conjecture,
! [X3: $i] :
( ( f @ a @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_44]),c_0_46])]) ).
thf(c_0_50,negated_conjecture,
! [X3: $i,X7: $i] :
( ( rel_s4 @ X3 @ esk4_0 )
| ~ ( rel_s4 @ X7 @ esk3_0 )
| ~ ( rel_s4 @ X3 @ X7 ) ),
inference(spm,[status(thm)],[c_0_41,c_0_47]) ).
thf(c_0_51,negated_conjecture,
~ ( rel_s4 @ esk2_0 @ esk4_0 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
thf(c_0_52,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ X3 @ esk4_0 )
| ~ ( rel_s4 @ X3 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_50,c_0_46]) ).
thf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO568^7 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.16 % Computer : n015.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 17:18:48 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.CPwxtPZn5n/E---3.1_3836384.p
% 0.10/0.24 % Version: 3.5.1-ho
% 0.10/0.24 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.10/0.24 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.10/0.24 % Starting almost_fo_3_lam with 300s (1) cores
% 0.10/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.10/0.24 % ehoh_best2_full_lfho with pid 3836398 completed with status 0
% 0.10/0.24 % Result found by ehoh_best2_full_lfho
% 0.10/0.24 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.10/0.24 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.10/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.24 % No SInE strategy applied
% 0.10/0.24 % Search class: HGHNS-FFSF11-SHSSMFNN
% 0.10/0.24 % partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.10/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.24 % SubtermCWHack with pid 3836401 completed with status 0
% 0.10/0.24 % Result found by SubtermCWHack
% 0.10/0.24 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.10/0.24 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.10/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.24 % No SInE strategy applied
% 0.10/0.24 % Search class: HGHNS-FFSF11-SHSSMFNN
% 0.10/0.24 % partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.10/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.24 % Preprocessing time : 0.001 s
% 0.10/0.24
% 0.10/0.24 % Proof found!
% 0.10/0.24 % SZS status Theorem
% 0.10/0.24 % SZS output start CNFRefutation
% See solution above
% 0.10/0.24 % Parsed axioms : 76
% 0.10/0.24 % Removed by relevancy pruning/SinE : 0
% 0.10/0.24 % Initial clauses : 51
% 0.10/0.24 % Removed in clause preprocessing : 39
% 0.10/0.24 % Initial clauses in saturation : 12
% 0.10/0.24 % Processed clauses : 40
% 0.10/0.24 % ...of these trivial : 0
% 0.10/0.24 % ...subsumed : 8
% 0.10/0.24 % ...remaining for further processing : 32
% 0.10/0.24 % Other redundant clauses eliminated : 0
% 0.10/0.24 % Clauses deleted for lack of memory : 0
% 0.10/0.24 % Backward-subsumed : 2
% 0.10/0.24 % Backward-rewritten : 4
% 0.10/0.24 % Generated clauses : 40
% 0.10/0.24 % ...of the previous two non-redundant : 29
% 0.10/0.24 % ...aggressively subsumed : 0
% 0.10/0.24 % Contextual simplify-reflections : 0
% 0.10/0.24 % Paramodulations : 40
% 0.10/0.24 % Factorizations : 0
% 0.10/0.24 % NegExts : 0
% 0.10/0.24 % Equation resolutions : 0
% 0.10/0.24 % Disequality decompositions : 0
% 0.10/0.24 % Total rewrite steps : 15
% 0.10/0.24 % ...of those cached : 7
% 0.10/0.24 % Propositional unsat checks : 0
% 0.10/0.24 % Propositional check models : 0
% 0.10/0.24 % Propositional check unsatisfiable : 0
% 0.10/0.24 % Propositional clauses : 0
% 0.10/0.24 % Propositional clauses after purity: 0
% 0.10/0.24 % Propositional unsat core size : 0
% 0.10/0.24 % Propositional preprocessing time : 0.000
% 0.10/0.24 % Propositional encoding time : 0.000
% 0.10/0.24 % Propositional solver time : 0.000
% 0.10/0.24 % Success case prop preproc time : 0.000
% 0.10/0.24 % Success case prop encoding time : 0.000
% 0.10/0.24 % Success case prop solver time : 0.000
% 0.10/0.24 % Current number of processed clauses : 26
% 0.10/0.24 % Positive orientable unit clauses : 8
% 0.10/0.24 % Positive unorientable unit clauses: 0
% 0.10/0.24 % Negative unit clauses : 2
% 0.10/0.24 % Non-unit-clauses : 16
% 0.10/0.24 % Current number of unprocessed clauses: 0
% 0.10/0.24 % ...number of literals in the above : 0
% 0.10/0.24 % Current number of archived formulas : 0
% 0.10/0.24 % Current number of archived clauses : 6
% 0.10/0.24 % Clause-clause subsumption calls (NU) : 29
% 0.10/0.24 % Rec. Clause-clause subsumption calls : 28
% 0.10/0.24 % Non-unit clause-clause subsumptions : 9
% 0.10/0.24 % Unit Clause-clause subsumption calls : 4
% 0.10/0.24 % Rewrite failures with RHS unbound : 0
% 0.10/0.24 % BW rewrite match attempts : 3
% 0.10/0.24 % BW rewrite match successes : 2
% 0.10/0.24 % Condensation attempts : 0
% 0.10/0.24 % Condensation successes : 0
% 0.10/0.24 % Termbank termtop insertions : 3721
% 0.10/0.24 % Search garbage collected termcells : 728
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.005 s
% 0.10/0.24 % System time : 0.003 s
% 0.10/0.24 % Total time : 0.008 s
% 0.10/0.24 % Maximum resident set size: 3960 pages
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.008 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
%------------------------------------------------------------------------------