%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO048^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 : n020.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:42:13 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 50 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 231 ( 19 equ; 0 cnn)
% Maximal formula atoms : 90 ( 4 avg)
% Number of connectives : 638 ( 138 ~; 142 |; 23 &; 335 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 52 ( 52 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 81 ( 50 ^; 31 !; 0 ?; 81 :)
% 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_33,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_38,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
epred1_0: $i > $i > $o ).
thf(decl_55,type,
esk1_0: $i ).
thf(decl_56,type,
epred2_0: $i > $o ).
thf(decl_57,type,
epred3_0: $i > $o ).
thf(decl_58,type,
esk2_0: $i ).
thf(decl_59,type,
esk3_0: $i ).
thf(decl_60,type,
esk4_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PUkSEUbl53/E---3.1_1250659.p',mimplies) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PUkSEUbl53/E---3.1_1250659.p',mor) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PUkSEUbl53/E---3.1_1250659.p',mnot) ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PUkSEUbl53/E---3.1_1250659.p',mand) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mand @ ( mimplies @ X6 @ X7 ) @ ( mimplies @ X7 @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PUkSEUbl53/E---3.1_1250659.p',mequiv) ).
thf(conj,conjecture,
! [X13: $i > $i > $o] :
( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] :
( mforall_prop
@ ^ [X19: $i > $o] : ( mequiv @ ( mbox @ X13 @ ( mand @ X18 @ X19 ) ) @ ( mand @ ( mbox @ X13 @ X18 ) @ ( mbox @ X13 @ X19 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PUkSEUbl53/E---3.1_1250659.p',conj) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PUkSEUbl53/E---3.1_1250659.p',mbox) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PUkSEUbl53/E---3.1_1250659.p',mforall_prop) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PUkSEUbl53/E---3.1_1250659.p',mvalid) ).
thf(c_0_9,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_10,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_11,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_12,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
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,
( 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_9,c_0_10]),c_0_11]) ).
thf(c_0_15,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_12,c_0_10]),c_0_11]) ).
thf(c_0_16,negated_conjecture,
~ ! [X13: $i > $i > $o] :
( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] :
( mforall_prop
@ ^ [X19: $i > $o] : ( mequiv @ ( mbox @ X13 @ ( mand @ X18 @ X19 ) ) @ ( mand @ ( mbox @ X13 @ X18 ) @ ( mbox @ X13 @ X19 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_17,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_18,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_19,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_20,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_21,negated_conjecture,
~ ! [X13: $i > $i > $o,X28: $i,X27: $i > $o,X26: $i > $o] :
~ ( ~ ( ~ ! [X23: $i] :
( ~ ( X13 @ X28 @ X23 )
| ~ ( ~ ( X27 @ X23 )
| ~ ( X26 @ X23 ) ) )
| ~ ( ~ ! [X24: $i] :
( ~ ( X13 @ X28 @ X24 )
| ( X27 @ X24 ) )
| ~ ! [X25: $i] :
( ~ ( X13 @ X28 @ X25 )
| ( X26 @ X25 ) ) ) )
| ~ ( ~ ~ ( ~ ! [X24: $i] :
( ~ ( X13 @ X28 @ X24 )
| ( X27 @ X24 ) )
| ~ ! [X25: $i] :
( ~ ( X13 @ X28 @ X25 )
| ( X26 @ X25 ) ) )
| ! [X23: $i] :
( ~ ( X13 @ X28 @ X23 )
| ~ ( ~ ( X27 @ X23 )
| ~ ( X26 @ X23 ) ) ) ) ),
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_16]),c_0_17]),c_0_15]),c_0_18]),c_0_19]),c_0_20]) ).
thf(c_0_22,negated_conjecture,
! [X33: $i,X36: $i,X37: $i] :
( ( ~ ( epred1_0 @ esk1_0 @ X36 )
| ( epred2_0 @ X36 )
| ( epred2_0 @ X33 )
| ~ ( epred1_0 @ esk1_0 @ X33 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X37 )
| ( epred3_0 @ X37 )
| ( epred2_0 @ X33 )
| ~ ( epred1_0 @ esk1_0 @ X33 ) )
& ( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred2_0 @ X33 )
| ~ ( epred1_0 @ esk1_0 @ X33 ) )
& ( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ( epred2_0 @ X33 )
| ~ ( epred1_0 @ esk1_0 @ X33 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X36 )
| ( epred2_0 @ X36 )
| ( epred3_0 @ X33 )
| ~ ( epred1_0 @ esk1_0 @ X33 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X37 )
| ( epred3_0 @ X37 )
| ( epred3_0 @ X33 )
| ~ ( epred1_0 @ esk1_0 @ X33 ) )
& ( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred3_0 @ X33 )
| ~ ( epred1_0 @ esk1_0 @ X33 ) )
& ( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ( epred3_0 @ X33 )
| ~ ( epred1_0 @ esk1_0 @ X33 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X36 )
| ( epred2_0 @ X36 )
| ( epred1_0 @ esk1_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X37 )
| ( epred3_0 @ X37 )
| ( epred1_0 @ esk1_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X36 )
| ( epred2_0 @ X36 )
| ~ ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X37 )
| ( epred3_0 @ X37 )
| ~ ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ( epred1_0 @ esk1_0 @ esk4_0 )
| ~ ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ~ ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X36 )
| ( epred2_0 @ X36 )
| ( epred1_0 @ esk1_0 @ esk3_0 )
| ~ ( epred2_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X37 )
| ( epred3_0 @ X37 )
| ( epred1_0 @ esk1_0 @ esk3_0 )
| ~ ( epred2_0 @ esk2_0 ) )
& ( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk3_0 )
| ~ ( epred2_0 @ esk2_0 ) )
& ( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk3_0 )
| ~ ( epred2_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X36 )
| ( epred2_0 @ X36 )
| ~ ( epred3_0 @ esk3_0 )
| ~ ( epred2_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk1_0 @ X37 )
| ( epred3_0 @ X37 )
| ~ ( epred3_0 @ esk3_0 )
| ~ ( epred2_0 @ esk2_0 ) )
& ( ( epred1_0 @ esk1_0 @ esk4_0 )
| ~ ( epred3_0 @ esk3_0 )
| ~ ( epred2_0 @ esk2_0 ) )
& ( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ~ ( epred3_0 @ esk3_0 )
| ~ ( epred2_0 @ 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_21])])])])])]) ).
thf(c_0_23,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred2_0 @ X3 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_24,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( epred3_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_25,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk4_0 )
| ~ ( epred3_0 @ esk3_0 )
| ~ ( epred2_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_26,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred3_0 @ X3 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_27,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_28,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk4_0 )
| ~ ( epred3_0 @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
thf(c_0_29,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk3_0 )
| ~ ( epred2_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_30,negated_conjecture,
! [X3: $i] :
( ( epred2_0 @ X3 )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_31,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ~ ( epred3_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_32,negated_conjecture,
( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ~ ( epred3_0 @ esk3_0 )
| ~ ( epred2_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_33,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 @ esk4_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
thf(c_0_34,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk4_0 )
| ~ ( epred2_0 @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_29]),c_0_28]) ).
thf(c_0_35,negated_conjecture,
! [X3: $i] :
( ( epred3_0 @ X3 )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_36,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_37,negated_conjecture,
( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ~ ( epred3_0 @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
thf(c_0_38,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk3_0 )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ~ ( epred2_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_39,negated_conjecture,
! [X3: $i,X14: $i] :
( ( epred2_0 @ X3 )
| ( epred2_0 @ X14 )
| ~ ( epred1_0 @ esk1_0 @ X3 )
| ~ ( epred1_0 @ esk1_0 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_40,negated_conjecture,
epred1_0 @ esk1_0 @ esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_33]),c_0_34]) ).
thf(c_0_41,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
thf(c_0_42,negated_conjecture,
( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 )
| ~ ( epred2_0 @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_38]),c_0_37]) ).
thf(c_0_43,negated_conjecture,
! [X3: $i] :
( ( epred2_0 @ esk4_0 )
| ( epred2_0 @ X3 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_44,negated_conjecture,
( ~ ( epred2_0 @ esk4_0 )
| ~ ( epred3_0 @ esk4_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_41]),c_0_42]) ).
thf(c_0_45,negated_conjecture,
epred2_0 @ esk4_0,
inference(spm,[status(thm)],[c_0_43,c_0_40]) ).
thf(c_0_46,negated_conjecture,
! [X3: $i,X14: $i] :
( ( epred3_0 @ X3 )
| ( epred3_0 @ X14 )
| ~ ( epred1_0 @ esk1_0 @ X3 )
| ~ ( epred1_0 @ esk1_0 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_47,negated_conjecture,
~ ( epred3_0 @ esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
thf(c_0_48,negated_conjecture,
! [X3: $i] :
( ( epred3_0 @ X3 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_40]),c_0_47]) ).
thf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_40]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO048^1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.16 % Computer : n020.cluster.edu
% 0.07/0.16 % Model : x86_64 x86_64
% 0.07/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.16 % Memory : 8046.5625MB
% 0.07/0.16 % OS : Linux 6.8.0-71-generic
% 0.07/0.16 % CPULimit : 300
% 0.07/0.16 % WCLimit : 300
% 0.07/0.16 % DateTime : Tue Sep 29 16:25:34 UTC 2026
% 0.07/0.16 % CPUTime :
% 0.07/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running higher-order theorem proving
% 0.07/0.22 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.PUkSEUbl53/E---3.1_1250659.p
% 0.07/0.25 % Version: 3.5.1-ho
% 0.07/0.25 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.07/0.25 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.07/0.25 % Starting sh5l with 300s (1) cores
% 0.07/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.07/0.25 % sh5l with pid 1250733 completed with status 0
% 0.07/0.25 % Result found by sh5l
% 0.07/0.25 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.07/0.25 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.07/0.25 % Starting sh5l with 300s (1) cores
% 0.07/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.25 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.25 % Search class: HGHNF-FFMF00-SHHSMFNN
% 0.07/0.25 % partial match(1): HGHNF-FFMF00-SHSSMFNN
% 0.07/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.25 % SubtermCWHack with pid 1250738 completed with status 0
% 0.07/0.25 % Result found by SubtermCWHack
% 0.07/0.25 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.07/0.25 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.07/0.25 % Starting sh5l with 300s (1) cores
% 0.07/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.25 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.25 % Search class: HGHNF-FFMF00-SHHSMFNN
% 0.07/0.25 % partial match(1): HGHNF-FFMF00-SHSSMFNN
% 0.07/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.25 % Preprocessing time : 0.001 s
% 0.07/0.25
% 0.07/0.25 % Proof found!
% 0.07/0.25 % SZS status Theorem
% 0.07/0.25 % SZS output start CNFRefutation
% See solution above
% 0.07/0.25 % Parsed axioms : 64
% 0.07/0.25 % Removed by relevancy pruning/SinE : 51
% 0.07/0.25 % Initial clauses : 24
% 0.07/0.25 % Removed in clause preprocessing : 0
% 0.07/0.25 % Initial clauses in saturation : 24
% 0.07/0.25 % Processed clauses : 74
% 0.07/0.25 % ...of these trivial : 0
% 0.07/0.25 % ...subsumed : 19
% 0.07/0.25 % ...remaining for further processing : 55
% 0.07/0.25 % Other redundant clauses eliminated : 0
% 0.07/0.25 % Clauses deleted for lack of memory : 0
% 0.07/0.25 % Backward-subsumed : 36
% 0.07/0.25 % Backward-rewritten : 9
% 0.07/0.25 % Generated clauses : 134
% 0.07/0.25 % ...of the previous two non-redundant : 106
% 0.07/0.25 % ...aggressively subsumed : 0
% 0.07/0.25 % Contextual simplify-reflections : 10
% 0.07/0.25 % Paramodulations : 134
% 0.07/0.25 % Factorizations : 0
% 0.07/0.25 % NegExts : 0
% 0.07/0.25 % Equation resolutions : 0
% 0.07/0.25 % Disequality decompositions : 0
% 0.07/0.25 % Total rewrite steps : 10
% 0.07/0.25 % ...of those cached : 8
% 0.07/0.25 % Propositional unsat checks : 0
% 0.07/0.25 % Propositional check models : 0
% 0.07/0.25 % Propositional check unsatisfiable : 0
% 0.07/0.25 % Propositional clauses : 0
% 0.07/0.25 % Propositional clauses after purity: 0
% 0.07/0.25 % Propositional unsat core size : 0
% 0.07/0.25 % Propositional preprocessing time : 0.000
% 0.07/0.25 % Propositional encoding time : 0.000
% 0.07/0.25 % Propositional solver time : 0.000
% 0.07/0.25 % Success case prop preproc time : 0.000
% 0.07/0.25 % Success case prop encoding time : 0.000
% 0.07/0.25 % Success case prop solver time : 0.000
% 0.07/0.25 % Current number of processed clauses : 10
% 0.07/0.25 % Positive orientable unit clauses : 2
% 0.07/0.25 % Positive unorientable unit clauses: 0
% 0.07/0.25 % Negative unit clauses : 2
% 0.07/0.25 % Non-unit-clauses : 6
% 0.07/0.25 % Current number of unprocessed clauses: 38
% 0.07/0.25 % ...number of literals in the above : 181
% 0.07/0.25 % Current number of archived formulas : 0
% 0.07/0.25 % Current number of archived clauses : 45
% 0.07/0.25 % Clause-clause subsumption calls (NU) : 78
% 0.07/0.25 % Rec. Clause-clause subsumption calls : 68
% 0.07/0.25 % Non-unit clause-clause subsumptions : 56
% 0.07/0.25 % Unit Clause-clause subsumption calls : 16
% 0.07/0.25 % Rewrite failures with RHS unbound : 0
% 0.07/0.25 % BW rewrite match attempts : 2
% 0.07/0.25 % BW rewrite match successes : 2
% 0.07/0.25 % Condensation attempts : 0
% 0.07/0.25 % Condensation successes : 0
% 0.07/0.25 % Termbank termtop insertions : 4476
% 0.07/0.25 % Search garbage collected termcells : 931
% 0.07/0.25
% 0.07/0.25 % -------------------------------------------------
% 0.07/0.25 % User time : 0.006 s
% 0.07/0.25 % System time : 0.001 s
% 0.07/0.25 % Total time : 0.007 s
% 0.07/0.25 % Maximum resident set size: 4208 pages
% 0.07/0.25
% 0.07/0.25 % -------------------------------------------------
% 0.07/0.25 % User time : 0.008 s
% 0.07/0.25 % System time : 0.006 s
% 0.07/0.25 % Total time : 0.014 s
% 0.07/0.25 % Maximum resident set size: 4864 pages
% 0.07/0.25 % E exiting
%------------------------------------------------------------------------------