%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : AGT030^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 07:44:28 AM UTC 2026
% Result : Theorem 0.21s 0.31s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 52 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 136 ( 23 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 337 ( 57 ~; 42 |; 4 &; 234 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 57 ( 57 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 18 usr; 3 con; 0-3 aty)
% Number of variables : 120 ( 54 ^; 66 !; 0 ?; 120 :)
% 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_28,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_33,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_34,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_38,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_39,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
r1: $i > $i > $o ).
thf(decl_57,type,
r4: $i > $i > $o ).
thf(decl_59,type,
john: mu ).
thf(decl_63,type,
good_in_maths: mu > $i > $o ).
thf(decl_64,type,
maths_teacher: mu > $i > $o ).
thf(decl_85,type,
esk17_2: $i > ( $i > $o ) > $i ).
thf(decl_86,type,
esk18_2: $i > ( $i > $o ) > $i ).
thf(decl_97,type,
esk29_2: $i > ( $i > $o ) > $i ).
thf(decl_135,type,
esk67_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',mor) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',mforall_prop) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',mvalid) ).
thf(axiom_I_for_r4_r1,axiom,
( mvalid
@ ( mforall_prop
@ ^ [X6: $i > $o] : ( mimplies @ ( mbox @ r4 @ X6 ) @ ( mbox @ r1 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',axiom_I_for_r4_r1) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',mforall_ind) ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X11: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X11 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',mexists_ind) ).
thf(mdia,axiom,
( mdia
= ( ^ [X13: $i > $i > $o,X6: $i > $o] : ( mnot @ ( mbox @ X13 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',mdia) ).
thf(axiom_r1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( maths_teacher @ X1 ) @ ( mbox @ r4 @ ( good_in_maths @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',axiom_r1) ).
thf(conj,conjecture,
( mvalid
@ ( mexists_ind
@ ^ [X1: mu] : ( mdia @ r1 @ ( good_in_maths @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',conj) ).
thf(axiom_D_for_r1,axiom,
( mvalid
@ ( mforall_prop
@ ^ [X6: $i > $o] : ( mimplies @ ( mbox @ r1 @ X6 ) @ ( mnot @ ( mbox @ r1 @ ( mnot @ X6 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',axiom_D_for_r1) ).
thf(axiom_a6,axiom,
mvalid @ ( maths_teacher @ john ),
file('/export/starexec/sandbox2/tmp/tmp.heQZUhKwlq/E---3.1_2411128.p',axiom_a6) ).
thf(c_0_14,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
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(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_18,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_19,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_20,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_21,plain,
! [X131: $i,X130: $i > $o] :
( ~ ! [X128: $i] :
( ~ ( r4 @ X131 @ X128 )
| ( X130 @ X128 ) )
| ! [X129: $i] :
( ~ ( r1 @ X131 @ X129 )
| ( X130 @ X129 ) ) ),
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)],[axiom_I_for_r4_r1]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).
thf(c_0_22,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_23,plain,
! [X420: $i,X421: $i > $o,X423: $i] :
( ( ( r4 @ X420 @ ( esk29_2 @ X420 @ X421 ) )
| ~ ( r1 @ X420 @ X423 )
| ( X421 @ X423 ) )
& ( ~ ( X421 @ ( esk29_2 @ X420 @ X421 ) )
| ~ ( r1 @ X420 @ X423 )
| ( X421 @ X423 ) ) ),
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_21])])])])])]) ).
thf(c_0_24,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_25,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X20: $i] :
( ~ ( Z0 @ Z2 @ X20 )
| ~ ( Z1 @ X20 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia]) ).
thf(c_0_26,plain,
! [X23: $i,X22: mu] :
( ~ ( maths_teacher @ X22 @ X23 )
| ! [X21: $i] :
( ~ ( r4 @ X23 @ X21 )
| ( good_in_maths @ X22 @ X21 ) ) ),
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)],[axiom_r1]),c_0_17]),c_0_22]),c_0_19]),c_0_20])]) ).
thf(c_0_27,plain,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( X4 @ X14 )
| ~ ( X4 @ ( esk29_2 @ X3 @ X4 ) )
| ~ ( r1 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_28,negated_conjecture,
~ ( mvalid
@ ( mexists_ind
@ ^ [X1: mu] : ( mdia @ r1 @ ( good_in_maths @ X1 ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_29,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_24,c_0_15]),c_0_22]) ).
thf(c_0_30,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X20: $i] :
( ~ ( Z0 @ Z2 @ X20 )
| ~ ( Z1 @ X20 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_25,c_0_15]),c_0_19]) ).
thf(c_0_31,plain,
! [X103: $i,X102: $i > $o] :
( ~ ! [X100: $i] :
( ~ ( r1 @ X103 @ X100 )
| ( X102 @ X100 ) )
| ~ ! [X101: $i] :
( ~ ( r1 @ X103 @ X101 )
| ~ ( X102 @ X101 ) ) ),
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(fof_simplification,[status(thm)],[axiom_D_for_r1]),c_0_15]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).
thf(c_0_32,plain,
! [X313: $i,X314: mu,X315: $i] :
( ~ ( maths_teacher @ X314 @ X313 )
| ~ ( r4 @ X313 @ X315 )
| ( good_in_maths @ X314 @ X315 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_26])])]) ).
thf(c_0_33,plain,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( r4 @ X3 @ ( esk29_2 @ X3 @ X4 ) )
| ( X4 @ X14 )
| ~ ( r1 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_34,plain,
! [X3: $i,X14: $i] :
( ( ( esk29_2 @ X3
@ ^ [Z0: $i] : ( Z0 != X14 ) )
= X14 )
| ~ ( r1 @ X3 @ X14 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_27]) ).
thf(c_0_35,plain,
! [X93: $i] : ( maths_teacher @ john @ X93 ),
inference(apply_def,[status(thm)],[axiom_a6,c_0_20]) ).
thf(c_0_36,negated_conjecture,
~ ! [X312: $i] :
~ ! [X311: mu] :
~ ~ ! [X310: $i] :
( ~ ( r1 @ X312 @ X310 )
| ~ ( good_in_maths @ X311 @ X310 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_28]),c_0_29]),c_0_30]),c_0_20])]) ).
thf(c_0_37,plain,
! [X392: $i,X393: $i > $o] :
( ( ( r1 @ X392 @ ( esk18_2 @ X392 @ X393 ) )
| ( r1 @ X392 @ ( esk17_2 @ X392 @ X393 ) ) )
& ( ( X393 @ ( esk18_2 @ X392 @ X393 ) )
| ( r1 @ X392 @ ( esk17_2 @ X392 @ X393 ) ) )
& ( ( r1 @ X392 @ ( esk18_2 @ X392 @ X393 ) )
| ~ ( X393 @ ( esk17_2 @ X392 @ X393 ) ) )
& ( ( X393 @ ( esk18_2 @ X392 @ X393 ) )
| ~ ( X393 @ ( esk17_2 @ X392 @ X393 ) ) ) ),
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_31])])])])]) ).
thf(c_0_38,plain,
! [X3: $i,X1: mu,X14: $i] :
( ( good_in_maths @ X1 @ X14 )
| ~ ( maths_teacher @ X1 @ X3 )
| ~ ( r4 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_39,plain,
! [X3: $i,X14: $i] :
( ( r4 @ X3 @ X14 )
| ~ ( r1 @ X3 @ X14 ) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34])])]) ).
thf(c_0_40,plain,
! [X385: $i] : ( maths_teacher @ john @ X385 ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
thf(c_0_41,negated_conjecture,
! [X603: mu,X604: $i] :
( ~ ( r1 @ esk67_0 @ X604 )
| ~ ( good_in_maths @ X603 @ X604 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])]) ).
thf(c_0_42,plain,
! [X3: $i,X4: $i > $o] :
( ( X4 @ ( esk18_2 @ X3 @ X4 ) )
| ~ ( X4 @ ( esk17_2 @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_43,plain,
! [X3: $i,X4: $i > $o] :
( ( r1 @ X3 @ ( esk18_2 @ X3 @ X4 ) )
| ( r1 @ X3 @ ( esk17_2 @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_44,plain,
! [X14: $i,X1: mu,X3: $i] :
( ( good_in_maths @ X1 @ X3 )
| ~ ( maths_teacher @ X1 @ X14 )
| ~ ( r1 @ X14 @ X3 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
thf(c_0_45,plain,
! [X3: $i] : ( maths_teacher @ john @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
thf(c_0_46,negated_conjecture,
! [X1: mu,X3: $i] :
( ~ ( r1 @ esk67_0 @ X3 )
| ~ ( good_in_maths @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
thf(c_0_47,plain,
! [X3: $i] : ( r1 @ X3 @ ( esk18_2 @ X3 @ ( r1 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
thf(c_0_48,plain,
! [X14: $i,X3: $i] :
( ( good_in_maths @ john @ X3 )
| ~ ( r1 @ X14 @ X3 ) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
thf(c_0_49,negated_conjecture,
! [X1: mu] :
~ ( good_in_maths @ X1 @ ( esk18_2 @ esk67_0 @ ( r1 @ esk67_0 ) ) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
thf(c_0_50,plain,
! [X3: $i] : ( good_in_maths @ john @ ( esk18_2 @ X3 @ ( r1 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_48,c_0_47]) ).
thf(c_0_51,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_49,c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : AGT030^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n013.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 17:28:59 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/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.heQZUhKwlq/E---3.1_2411128.p
% 0.21/0.31 % Version: 3.5.1-ho
% 0.21/0.31 % Preprocessing class: HSLSSMSSMLLNHSN.
% 0.21/0.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.31 % Starting almost_fo_3 with 1500s (5) cores
% 0.21/0.31 % Starting sh10 with 300s (1) cores
% 0.21/0.31 % Starting new_ho_16 with 300s (1) cores
% 0.21/0.31 % Starting post_as_ho11 with 300s (1) cores
% 0.21/0.31 % new_ho_16 with pid 2411143 completed with status 9
% 0.21/0.31 % almost_fo_3 with pid 2411141 completed with status 0
% 0.21/0.31 % Result found by almost_fo_3
% 0.21/0.31 % Preprocessing class: HSLSSMSSMLLNHSN.
% 0.21/0.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.31 % Starting almost_fo_3 with 1500s (5) cores
% 0.21/0.31 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.31 % No SInE strategy applied
% 0.21/0.31 % Search class: HGHNF-FSLF32-SHSSMMBN
% 0.21/0.31 % partial match(2): HGUNS-FSLF32-SHSSMMBN
% 0.21/0.31 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.31 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.31 % Starting almost_fo_3 with 151s (1) cores
% 0.21/0.31 % Starting ehoh_best8_lambda with 136s (1) cores
% 0.21/0.31 % Starting ho_unfolding_6 with 136s (1) cores
% 0.21/0.31 % Starting sh4l with 136s (1) cores
% 0.21/0.31 % sh4l with pid 2411153 completed with status 0
% 0.21/0.31 % Result found by sh4l
% 0.21/0.31 % Preprocessing class: HSLSSMSSMLLNHSN.
% 0.21/0.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.31 % Starting almost_fo_3 with 1500s (5) cores
% 0.21/0.31 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.31 % No SInE strategy applied
% 0.21/0.31 % Search class: HGHNF-FSLF32-SHSSMMBN
% 0.21/0.31 % partial match(2): HGUNS-FSLF32-SHSSMMBN
% 0.21/0.31 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.31 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.31 % Starting almost_fo_3 with 151s (1) cores
% 0.21/0.31 % Starting ehoh_best8_lambda with 136s (1) cores
% 0.21/0.31 % Starting ho_unfolding_6 with 136s (1) cores
% 0.21/0.31 % Starting sh4l with 136s (1) cores
% 0.21/0.31 % Preprocessing time : 0.003 s
% 0.21/0.31
% 0.21/0.31 % Proof found!
% 0.21/0.31 % SZS status Theorem
% 0.21/0.31 % SZS output start CNFRefutation
% See solution above
% 0.21/0.31 % Parsed axioms : 145
% 0.21/0.31 % Removed by relevancy pruning/SinE : 0
% 0.21/0.31 % Initial clauses : 185
% 0.21/0.31 % Removed in clause preprocessing : 47
% 0.21/0.31 % Initial clauses in saturation : 138
% 0.21/0.31 % Processed clauses : 196
% 0.21/0.31 % ...of these trivial : 3
% 0.21/0.31 % ...subsumed : 7
% 0.21/0.31 % ...remaining for further processing : 186
% 0.21/0.31 % Other redundant clauses eliminated : 7
% 0.21/0.31 % Clauses deleted for lack of memory : 0
% 0.21/0.31 % Backward-subsumed : 3
% 0.21/0.31 % Backward-rewritten : 0
% 0.21/0.31 % Generated clauses : 1974
% 0.21/0.31 % ...of the previous two non-redundant : 1912
% 0.21/0.31 % ...aggressively subsumed : 0
% 0.21/0.31 % Contextual simplify-reflections : 1
% 0.21/0.31 % Paramodulations : 1847
% 0.21/0.31 % Factorizations : 80
% 0.21/0.31 % NegExts : 0
% 0.21/0.31 % Equation resolutions : 7
% 0.21/0.31 % Disequality decompositions : 0
% 0.21/0.31 % Total rewrite steps : 48
% 0.21/0.31 % ...of those cached : 41
% 0.21/0.31 % Propositional unsat checks : 0
% 0.21/0.31 % Propositional check models : 0
% 0.21/0.31 % Propositional check unsatisfiable : 0
% 0.21/0.31 % Propositional clauses : 0
% 0.21/0.31 % Propositional clauses after purity: 0
% 0.21/0.31 % Propositional unsat core size : 0
% 0.21/0.31 % Propositional preprocessing time : 0.000
% 0.21/0.31 % Propositional encoding time : 0.000
% 0.21/0.31 % Propositional solver time : 0.000
% 0.21/0.31 % Success case prop preproc time : 0.000
% 0.21/0.31 % Success case prop encoding time : 0.000
% 0.21/0.31 % Success case prop solver time : 0.000
% 0.21/0.31 % Current number of processed clauses : 183
% 0.21/0.31 % Positive orientable unit clauses : 11
% 0.21/0.31 % Positive unorientable unit clauses: 0
% 0.21/0.31 % Negative unit clauses : 3
% 0.21/0.31 % Non-unit-clauses : 169
% 0.21/0.31 % Current number of unprocessed clauses: 1853
% 0.21/0.31 % ...number of literals in the above : 6808
% 0.21/0.31 % Current number of archived formulas : 0
% 0.21/0.31 % Current number of archived clauses : 3
% 0.21/0.31 % Clause-clause subsumption calls (NU) : 2708
% 0.21/0.31 % Rec. Clause-clause subsumption calls : 1447
% 0.21/0.31 % Non-unit clause-clause subsumptions : 7
% 0.21/0.31 % Unit Clause-clause subsumption calls : 237
% 0.21/0.31 % Rewrite failures with RHS unbound : 0
% 0.21/0.31 % BW rewrite match attempts : 0
% 0.21/0.31 % BW rewrite match successes : 0
% 0.21/0.31 % Condensation attempts : 196
% 0.21/0.31 % Condensation successes : 0
% 0.21/0.31 % Termbank termtop insertions : 129771
% 0.21/0.31 % Search garbage collected termcells : 13654
% 0.21/0.31
% 0.21/0.31 % -------------------------------------------------
% 0.21/0.31 % User time : 0.044 s
% 0.21/0.31 % System time : 0.012 s
% 0.21/0.31 % Total time : 0.057 s
% 0.21/0.31 % Maximum resident set size: 6076 pages
% 0.21/0.31
% 0.21/0.31 % -------------------------------------------------
% 0.21/0.31 % User time : 0.213 s
% 0.21/0.31 % System time : 0.064 s
% 0.21/0.31 % Total time : 0.277 s
% 0.21/0.31 % Maximum resident set size: 4864 pages
% 0.21/0.31 % E exiting
%------------------------------------------------------------------------------