%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO463^6 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:08 AM UTC 2026
% Result : Theorem 0.30s 0.26s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 66 ( 31 unt; 0 typ; 0 def)
% Number of atoms : 212 ( 21 equ; 0 cnn)
% Maximal formula atoms : 31 ( 3 avg)
% Number of connectives : 504 ( 97 ~; 90 |; 14 &; 297 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 5 con; 0-3 aty)
% Number of variables : 97 ( 44 ^; 53 !; 0 ?; 97 :)
% 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_41,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(decl_43,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
rel_s5: $i > $i > $o ).
thf(decl_55,type,
mbox_s5: ( $i > $o ) > $i > $o ).
thf(decl_57,type,
p: $i > $o ).
thf(decl_58,type,
q: $i > $o ).
thf(decl_59,type,
esk1_0: $i ).
thf(decl_60,type,
esk2_0: $i ).
thf(decl_61,type,
esk3_0: $i ).
thf(decl_62,type,
esk4_0: $i ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',mimplies) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mand @ ( mimplies @ X6 @ X7 ) @ ( mimplies @ X7 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',mequiv) ).
thf(msymmetric,axiom,
( msymmetric
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i] :
( ( X13 @ X15 @ X16 )
=> ( X13 @ X16 @ X15 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',msymmetric) ).
thf(prove,conjecture,
mvalid @ ( mimplies @ ( mbox_s5 @ ( mequiv @ p @ q ) ) @ ( mbox_s5 @ ( mequiv @ ( mbox_s5 @ p ) @ ( mbox_s5 @ q ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',prove) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',mvalid) ).
thf(mbox_s5,axiom,
( mbox_s5
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_s5 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',mbox_s5) ).
thf(mtransitive,axiom,
( mtransitive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( X13 @ X15 @ X16 )
& ( X13 @ X16 @ X17 ) )
=> ( X13 @ X15 @ X17 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',mtransitive) ).
thf(a3,axiom,
msymmetric @ rel_s5,
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',a3) ).
thf(a2,axiom,
mtransitive @ rel_s5,
file('/export/starexec/sandbox2/tmp/tmp.u3lUDLKBXN/E---3.1_3433107.p',a2) ).
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,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_14,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_15,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_16,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_17,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_13]),c_0_14]) ).
thf(c_0_18,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_15,c_0_13]),c_0_14]) ).
thf(c_0_19,plain,
( msymmetric
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i] :
( ( Z0 @ X15 @ X16 )
=> ( Z0 @ X16 @ X15 ) ) ) ),
inference(fof_simplification,[status(thm)],[msymmetric]) ).
thf(c_0_20,negated_conjecture,
~ ( mvalid @ ( mimplies @ ( mbox_s5 @ ( mequiv @ p @ q ) ) @ ( mbox_s5 @ ( mequiv @ ( mbox_s5 @ p ) @ ( mbox_s5 @ q ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove]) ).
thf(c_0_21,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_16,c_0_17]),c_0_18]) ).
thf(c_0_22,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_23,plain,
( mbox_s5
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_s5 @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s5]) ).
thf(c_0_24,plain,
( mtransitive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( Z0 @ X15 @ X16 )
& ( Z0 @ X16 @ X17 ) )
=> ( Z0 @ X15 @ X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[mtransitive]) ).
thf(c_0_25,plain,
! [X26: $i,X27: $i] :
( ( rel_s5 @ X26 @ X27 )
=> ( rel_s5 @ X27 @ X26 ) ),
inference(apply_def,[status(thm)],[a3,c_0_19]) ).
thf(c_0_26,negated_conjecture,
~ ! [X32: $i] :
( ~ ! [X28: $i] :
( ~ ( rel_s5 @ X32 @ X28 )
| ~ ( ~ ( ~ ( p @ X28 )
| ( q @ X28 ) )
| ~ ( ~ ( q @ X28 )
| ( p @ X28 ) ) ) )
| ! [X31: $i] :
( ~ ( rel_s5 @ X32 @ X31 )
| ~ ( ~ ( ~ ! [X29: $i] :
( ~ ( rel_s5 @ X31 @ X29 )
| ( p @ X29 ) )
| ! [X30: $i] :
( ~ ( rel_s5 @ X31 @ X30 )
| ( q @ X30 ) ) )
| ~ ( ~ ! [X30: $i] :
( ~ ( rel_s5 @ X31 @ X30 )
| ( q @ X30 ) )
| ! [X29: $i] :
( ~ ( rel_s5 @ X31 @ X29 )
| ( p @ X29 ) ) ) ) ) ),
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)],[c_0_20,c_0_18]),c_0_21]),c_0_22]),c_0_23])]) ).
thf(c_0_27,plain,
! [X23: $i,X24: $i,X25: $i] :
( ( ( rel_s5 @ X23 @ X24 )
& ( rel_s5 @ X24 @ X25 ) )
=> ( rel_s5 @ X23 @ X25 ) ),
inference(apply_def,[status(thm)],[a2,c_0_24]) ).
thf(c_0_28,plain,
! [X37: $i,X38: $i] :
( ~ ( rel_s5 @ X37 @ X38 )
| ( rel_s5 @ X38 @ X37 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).
thf(c_0_29,negated_conjecture,
! [X40: $i,X42: $i,X44: $i] :
( ( ~ ( p @ X40 )
| ( q @ X40 )
| ~ ( rel_s5 @ esk1_0 @ X40 ) )
& ( ~ ( q @ X40 )
| ( p @ X40 )
| ~ ( rel_s5 @ esk1_0 @ X40 ) )
& ( rel_s5 @ esk1_0 @ esk2_0 )
& ( ~ ( rel_s5 @ esk2_0 @ X44 )
| ( q @ X44 )
| ~ ( rel_s5 @ esk2_0 @ X42 )
| ( p @ X42 ) )
& ( ( rel_s5 @ esk2_0 @ esk4_0 )
| ~ ( rel_s5 @ esk2_0 @ X42 )
| ( p @ X42 ) )
& ( ~ ( p @ esk4_0 )
| ~ ( rel_s5 @ esk2_0 @ X42 )
| ( p @ X42 ) )
& ( ~ ( rel_s5 @ esk2_0 @ X44 )
| ( q @ X44 )
| ( rel_s5 @ esk2_0 @ esk3_0 ) )
& ( ( rel_s5 @ esk2_0 @ esk4_0 )
| ( rel_s5 @ esk2_0 @ esk3_0 ) )
& ( ~ ( p @ esk4_0 )
| ( rel_s5 @ esk2_0 @ esk3_0 ) )
& ( ~ ( rel_s5 @ esk2_0 @ X44 )
| ( q @ X44 )
| ~ ( q @ esk3_0 ) )
& ( ( rel_s5 @ esk2_0 @ esk4_0 )
| ~ ( q @ esk3_0 ) )
& ( ~ ( p @ esk4_0 )
| ~ ( q @ 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_26])])])])])]) ).
thf(c_0_30,plain,
! [X34: $i,X35: $i,X36: $i] :
( ~ ( rel_s5 @ X34 @ X35 )
| ~ ( rel_s5 @ X35 @ X36 )
| ( rel_s5 @ X34 @ X36 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])]) ).
thf(c_0_31,plain,
! [X3: $i,X14: $i] :
( ( rel_s5 @ X14 @ X3 )
| ~ ( rel_s5 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_32,negated_conjecture,
rel_s5 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_33,plain,
! [X3: $i,X14: $i,X15: $i] :
( ( rel_s5 @ X3 @ X15 )
| ~ ( rel_s5 @ X3 @ X14 )
| ~ ( rel_s5 @ X14 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_34,negated_conjecture,
rel_s5 @ esk2_0 @ esk1_0,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_35,negated_conjecture,
! [X3: $i] :
( ( rel_s5 @ X3 @ esk1_0 )
| ~ ( rel_s5 @ X3 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
thf(c_0_36,negated_conjecture,
( ( rel_s5 @ esk2_0 @ esk4_0 )
| ( rel_s5 @ esk2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_37,negated_conjecture,
! [X3: $i] :
( ( p @ X3 )
| ~ ( q @ X3 )
| ~ ( rel_s5 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_38,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ( rel_s5 @ esk2_0 @ esk3_0 )
| ~ ( rel_s5 @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_39,negated_conjecture,
! [X3: $i] :
( ( rel_s5 @ esk1_0 @ X3 )
| ~ ( rel_s5 @ X3 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_31,c_0_35]) ).
thf(c_0_40,negated_conjecture,
( ( rel_s5 @ esk2_0 @ esk3_0 )
| ( rel_s5 @ esk4_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_31,c_0_36]) ).
thf(c_0_41,negated_conjecture,
( ( rel_s5 @ esk2_0 @ esk3_0 )
| ~ ( p @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_42,negated_conjecture,
! [X3: $i] :
( ( rel_s5 @ esk2_0 @ esk3_0 )
| ( p @ X3 )
| ~ ( rel_s5 @ esk1_0 @ X3 )
| ~ ( rel_s5 @ esk2_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
thf(c_0_43,negated_conjecture,
( ( rel_s5 @ esk2_0 @ esk3_0 )
| ( rel_s5 @ esk1_0 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_44,negated_conjecture,
( ( rel_s5 @ esk2_0 @ esk4_0 )
| ~ ( q @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_45,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( p @ X3 )
| ~ ( rel_s5 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_46,negated_conjecture,
rel_s5 @ esk2_0 @ esk3_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_36]),c_0_43]) ).
thf(c_0_47,negated_conjecture,
( ( rel_s5 @ esk2_0 @ esk4_0 )
| ~ ( rel_s5 @ esk1_0 @ esk3_0 )
| ~ ( p @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
thf(c_0_48,negated_conjecture,
! [X3: $i] :
( ( rel_s5 @ esk2_0 @ esk4_0 )
| ( p @ X3 )
| ~ ( rel_s5 @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_49,negated_conjecture,
rel_s5 @ esk3_0 @ esk2_0,
inference(spm,[status(thm)],[c_0_31,c_0_46]) ).
thf(c_0_50,negated_conjecture,
( ~ ( p @ esk4_0 )
| ~ ( q @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_51,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( rel_s5 @ esk2_0 @ X3 )
| ~ ( q @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_52,negated_conjecture,
! [X3: $i,X14: $i] :
( ( q @ X3 )
| ( p @ X14 )
| ~ ( rel_s5 @ esk2_0 @ X3 )
| ~ ( rel_s5 @ esk2_0 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_53,negated_conjecture,
( ( rel_s5 @ esk2_0 @ esk4_0 )
| ~ ( rel_s5 @ esk1_0 @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_36]) ).
thf(c_0_54,negated_conjecture,
rel_s5 @ esk1_0 @ esk3_0,
inference(spm,[status(thm)],[c_0_39,c_0_49]) ).
thf(c_0_55,negated_conjecture,
( ~ ( rel_s5 @ esk1_0 @ esk3_0 )
| ~ ( p @ esk4_0 )
| ~ ( p @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_50,c_0_45]) ).
thf(c_0_56,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( rel_s5 @ esk1_0 @ esk3_0 )
| ~ ( rel_s5 @ esk2_0 @ X3 )
| ~ ( p @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_51,c_0_45]) ).
thf(c_0_57,negated_conjecture,
! [X3: $i] :
( ( p @ esk3_0 )
| ( q @ X3 )
| ~ ( rel_s5 @ esk2_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_52,c_0_46]) ).
thf(c_0_58,negated_conjecture,
rel_s5 @ esk2_0 @ esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
thf(c_0_59,negated_conjecture,
( ~ ( p @ esk4_0 )
| ~ ( p @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_54])]) ).
thf(c_0_60,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( rel_s5 @ esk2_0 @ X3 ) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_54])]),c_0_57]) ).
thf(c_0_61,negated_conjecture,
rel_s5 @ esk4_0 @ esk2_0,
inference(spm,[status(thm)],[c_0_31,c_0_58]) ).
thf(c_0_62,negated_conjecture,
~ ( p @ esk4_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_57]),c_0_46])]),c_0_59]) ).
thf(c_0_63,negated_conjecture,
! [X3: $i] :
( ( p @ X3 )
| ~ ( rel_s5 @ esk1_0 @ X3 )
| ~ ( rel_s5 @ esk2_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_37,c_0_60]) ).
thf(c_0_64,negated_conjecture,
rel_s5 @ esk1_0 @ esk4_0,
inference(spm,[status(thm)],[c_0_39,c_0_61]) ).
thf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO463^6 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n008.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 17:00:09 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 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.u3lUDLKBXN/E---3.1_3433107.p
% 0.30/0.26 % Version: 3.5.1-ho
% 0.30/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.30/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.30/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.30/0.26 % Starting almost_fo_3_lam with 300s (1) cores
% 0.30/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.30/0.26 % almost_fo_3_lam with pid 3433122 completed with status 0
% 0.30/0.26 % Result found by almost_fo_3_lam
% 0.30/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.30/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.30/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.30/0.26 % Starting almost_fo_3_lam with 300s (1) cores
% 0.30/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.26 % No SInE strategy applied
% 0.30/0.26 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.30/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.26 % SubtermCWHack with pid 3433128 completed with status 0
% 0.30/0.26 % Result found by SubtermCWHack
% 0.30/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.30/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.30/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.30/0.26 % Starting almost_fo_3_lam with 300s (1) cores
% 0.30/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.26 % No SInE strategy applied
% 0.30/0.26 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.30/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.26 % Preprocessing time : 0.001 s
% 0.30/0.26
% 0.30/0.26 % Proof found!
% 0.30/0.26 % SZS status Theorem
% 0.30/0.26 % SZS output start CNFRefutation
% See solution above
% 0.30/0.26 % Parsed axioms : 74
% 0.30/0.26 % Removed by relevancy pruning/SinE : 0
% 0.30/0.26 % Initial clauses : 52
% 0.30/0.26 % Removed in clause preprocessing : 37
% 0.30/0.26 % Initial clauses in saturation : 15
% 0.30/0.26 % Processed clauses : 100
% 0.30/0.26 % ...of these trivial : 0
% 0.30/0.26 % ...subsumed : 28
% 0.30/0.26 % ...remaining for further processing : 72
% 0.30/0.26 % Other redundant clauses eliminated : 0
% 0.30/0.26 % Clauses deleted for lack of memory : 0
% 0.30/0.26 % Backward-subsumed : 8
% 0.30/0.26 % Backward-rewritten : 23
% 0.30/0.26 % Generated clauses : 194
% 0.30/0.26 % ...of the previous two non-redundant : 117
% 0.30/0.26 % ...aggressively subsumed : 0
% 0.30/0.26 % Contextual simplify-reflections : 9
% 0.30/0.26 % Paramodulations : 194
% 0.30/0.26 % Factorizations : 0
% 0.30/0.26 % NegExts : 0
% 0.30/0.26 % Equation resolutions : 0
% 0.30/0.26 % Disequality decompositions : 0
% 0.30/0.26 % Total rewrite steps : 124
% 0.30/0.26 % ...of those cached : 105
% 0.30/0.26 % Propositional unsat checks : 0
% 0.30/0.26 % Propositional check models : 0
% 0.30/0.26 % Propositional check unsatisfiable : 0
% 0.30/0.26 % Propositional clauses : 0
% 0.30/0.26 % Propositional clauses after purity: 0
% 0.30/0.26 % Propositional unsat core size : 0
% 0.30/0.26 % Propositional preprocessing time : 0.000
% 0.30/0.26 % Propositional encoding time : 0.000
% 0.30/0.26 % Propositional solver time : 0.000
% 0.30/0.26 % Success case prop preproc time : 0.000
% 0.30/0.26 % Success case prop encoding time : 0.000
% 0.30/0.26 % Success case prop solver time : 0.000
% 0.30/0.26 % Current number of processed clauses : 41
% 0.30/0.26 % Positive orientable unit clauses : 15
% 0.30/0.26 % Positive unorientable unit clauses: 0
% 0.30/0.26 % Negative unit clauses : 1
% 0.30/0.26 % Non-unit-clauses : 25
% 0.30/0.26 % Current number of unprocessed clauses: 6
% 0.30/0.26 % ...number of literals in the above : 19
% 0.30/0.26 % Current number of archived formulas : 0
% 0.30/0.26 % Current number of archived clauses : 31
% 0.30/0.26 % Clause-clause subsumption calls (NU) : 331
% 0.30/0.26 % Rec. Clause-clause subsumption calls : 297
% 0.30/0.26 % Non-unit clause-clause subsumptions : 41
% 0.30/0.26 % Unit Clause-clause subsumption calls : 12
% 0.30/0.26 % Rewrite failures with RHS unbound : 0
% 0.30/0.26 % BW rewrite match attempts : 6
% 0.30/0.26 % BW rewrite match successes : 5
% 0.30/0.26 % Condensation attempts : 0
% 0.30/0.26 % Condensation successes : 0
% 0.30/0.26 % Termbank termtop insertions : 5033
% 0.30/0.26 % Search garbage collected termcells : 671
% 0.30/0.26
% 0.30/0.26 % -------------------------------------------------
% 0.30/0.26 % User time : 0.008 s
% 0.30/0.26 % System time : 0.002 s
% 0.30/0.26 % Total time : 0.010 s
% 0.30/0.26 % Maximum resident set size: 3700 pages
% 0.30/0.26
% 0.30/0.26 % -------------------------------------------------
% 0.30/0.26 % User time : 0.011 s
% 0.30/0.26 % System time : 0.006 s
% 0.30/0.26 % Total time : 0.017 s
% 0.30/0.26 % Maximum resident set size: 4864 pages
% 0.30/0.26 % E exiting
%------------------------------------------------------------------------------