%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL584^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:11:57 AM UTC 2026
% Result : Theorem 0.22s 0.27s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 8
% Syntax : Number of formulae : 58 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 271 ( 16 equ; 0 cnn)
% Maximal formula atoms : 90 ( 4 avg)
% Number of connectives : 659 ( 114 ~; 140 |; 32 &; 365 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 69 ( 40 ^; 29 !; 0 ?; 69 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_29,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_30,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
miff: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_34,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_42,type,
a: $i > $o ).
thf(decl_43,type,
b: $i > $o ).
thf(decl_44,type,
r: $i > $i > $o ).
thf(decl_46,type,
esk1_0: $i ).
thf(decl_47,type,
esk2_0: $i ).
thf(decl_48,type,
esk3_0: $i ).
thf(decl_49,type,
esk4_0: $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZjQF6g58rB/E---3.1_77623.p',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZjQF6g58rB/E---3.1_77623.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZjQF6g58rB/E---3.1_77623.p',mor) ).
thf(miff,axiom,
( miff
= ( ^ [X9: $i > $o,X8: $i > $o] : ( mand @ ( mimpl @ X9 @ X8 ) @ ( mimpl @ X8 @ X9 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZjQF6g58rB/E---3.1_77623.p',miff) ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X5: $i > $o,X3: $i] :
( ( X6 @ X3 )
& ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZjQF6g58rB/E---3.1_77623.p',mand) ).
thf(thm,conjecture,
mvalid @ ( miff @ ( mbox @ r @ ( mand @ a @ b ) ) @ ( mand @ ( mbox @ r @ a ) @ ( mbox @ r @ b ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZjQF6g58rB/E---3.1_77623.p',thm) ).
thf(mbox,axiom,
( mbox
= ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
! [X12: $i] :
( ( X10 @ X1 @ X12 )
=> ( X11 @ X12 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZjQF6g58rB/E---3.1_77623.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZjQF6g58rB/E---3.1_77623.p',mvalid) ).
thf(c_0_8,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_9,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
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,
( miff
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
& ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[miff]) ).
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,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
thf(c_0_14,negated_conjecture,
~ ( mvalid @ ( miff @ ( mbox @ r @ ( mand @ a @ b ) ) @ ( mand @ ( mbox @ r @ a ) @ ( mbox @ r @ b ) ) ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_15,plain,
( miff
= ( ^ [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_11,c_0_12]),c_0_13]) ).
thf(c_0_16,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X12: $i] :
( ( Z0 @ Z2 @ X12 )
=> ( Z1 @ X12 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_17,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_18,negated_conjecture,
~ ! [X22: $i] :
( ( ~ ! [X19: $i] :
( ( r @ X22 @ X19 )
=> ( ( a @ X19 )
& ( b @ X19 ) ) )
| ( ! [X20: $i] :
( ( r @ X22 @ X20 )
=> ( a @ X20 ) )
& ! [X21: $i] :
( ( r @ X22 @ X21 )
=> ( b @ X21 ) ) ) )
& ( ~ ( ! [X20: $i] :
( ( r @ X22 @ X20 )
=> ( a @ X20 ) )
& ! [X21: $i] :
( ( r @ X22 @ X21 )
=> ( b @ X21 ) ) )
| ! [X19: $i] :
( ( r @ X22 @ X19 )
=> ( ( a @ X19 )
& ( b @ X19 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_12]),c_0_15]),c_0_16]),c_0_17]) ).
thf(c_0_19,negated_conjecture,
! [X24: $i,X27: $i,X28: $i] :
( ( ~ ( r @ esk1_0 @ X27 )
| ( a @ X27 )
| ( a @ X24 )
| ~ ( r @ esk1_0 @ X24 ) )
& ( ~ ( r @ esk1_0 @ X28 )
| ( b @ X28 )
| ( a @ X24 )
| ~ ( r @ esk1_0 @ X24 ) )
& ( ( r @ esk1_0 @ esk4_0 )
| ( a @ X24 )
| ~ ( r @ esk1_0 @ X24 ) )
& ( ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 )
| ( a @ X24 )
| ~ ( r @ esk1_0 @ X24 ) )
& ( ~ ( r @ esk1_0 @ X27 )
| ( a @ X27 )
| ( b @ X24 )
| ~ ( r @ esk1_0 @ X24 ) )
& ( ~ ( r @ esk1_0 @ X28 )
| ( b @ X28 )
| ( b @ X24 )
| ~ ( r @ esk1_0 @ X24 ) )
& ( ( r @ esk1_0 @ esk4_0 )
| ( b @ X24 )
| ~ ( r @ esk1_0 @ X24 ) )
& ( ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 )
| ( b @ X24 )
| ~ ( r @ esk1_0 @ X24 ) )
& ( ~ ( r @ esk1_0 @ X27 )
| ( a @ X27 )
| ( r @ esk1_0 @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 ) )
& ( ~ ( r @ esk1_0 @ X28 )
| ( b @ X28 )
| ( r @ esk1_0 @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 ) )
& ( ( r @ esk1_0 @ esk4_0 )
| ( r @ esk1_0 @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 ) )
& ( ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 )
| ( r @ esk1_0 @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 ) )
& ( ~ ( r @ esk1_0 @ X27 )
| ( a @ X27 )
| ~ ( b @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 ) )
& ( ~ ( r @ esk1_0 @ X28 )
| ( b @ X28 )
| ~ ( b @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 ) )
& ( ( r @ esk1_0 @ esk4_0 )
| ~ ( b @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 ) )
& ( ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 )
| ~ ( b @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 ) )
& ( ~ ( r @ esk1_0 @ X27 )
| ( a @ X27 )
| ( r @ esk1_0 @ esk3_0 )
| ~ ( a @ esk2_0 ) )
& ( ~ ( r @ esk1_0 @ X28 )
| ( b @ X28 )
| ( r @ esk1_0 @ esk3_0 )
| ~ ( a @ esk2_0 ) )
& ( ( r @ esk1_0 @ esk4_0 )
| ( r @ esk1_0 @ esk3_0 )
| ~ ( a @ esk2_0 ) )
& ( ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 )
| ( r @ esk1_0 @ esk3_0 )
| ~ ( a @ esk2_0 ) )
& ( ~ ( r @ esk1_0 @ X27 )
| ( a @ X27 )
| ~ ( b @ esk3_0 )
| ~ ( a @ esk2_0 ) )
& ( ~ ( r @ esk1_0 @ X28 )
| ( b @ X28 )
| ~ ( b @ esk3_0 )
| ~ ( a @ esk2_0 ) )
& ( ( r @ esk1_0 @ esk4_0 )
| ~ ( b @ esk3_0 )
| ~ ( a @ esk2_0 ) )
& ( ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 )
| ~ ( b @ esk3_0 )
| ~ ( a @ 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_18])])])])])]) ).
thf(c_0_20,negated_conjecture,
( ( r @ esk1_0 @ esk4_0 )
| ~ ( b @ esk3_0 )
| ~ ( a @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i] :
( ( r @ esk1_0 @ esk4_0 )
| ( b @ X1 )
| ~ ( r @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_22,negated_conjecture,
( ( r @ esk1_0 @ esk4_0 )
| ( r @ esk1_0 @ esk3_0 )
| ~ ( a @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_23,negated_conjecture,
( ( r @ esk1_0 @ esk4_0 )
| ~ ( a @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i] :
( ( r @ esk1_0 @ esk4_0 )
| ( a @ X1 )
| ~ ( r @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_25,negated_conjecture,
( ( r @ esk1_0 @ esk4_0 )
| ( r @ esk1_0 @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_26,negated_conjecture,
( ( r @ esk1_0 @ esk4_0 )
| ~ ( r @ esk1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_27,negated_conjecture,
( ( r @ esk1_0 @ esk4_0 )
| ( r @ esk1_0 @ esk2_0 )
| ~ ( b @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_28,negated_conjecture,
( ( r @ esk1_0 @ esk4_0 )
| ( r @ esk1_0 @ esk3_0 ) ),
inference(csr,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i,X3: $i] :
( ( a @ X1 )
| ( a @ X3 )
| ~ ( r @ esk1_0 @ X1 )
| ~ ( r @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_30,negated_conjecture,
r @ esk1_0 @ esk4_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_21]),c_0_28]),c_0_26]) ).
thf(c_0_31,negated_conjecture,
! [X1: $i] :
( ( a @ esk4_0 )
| ( a @ X1 )
| ~ ( r @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i] :
( ( b @ X1 )
| ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 )
| ~ ( r @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_33,negated_conjecture,
a @ esk4_0,
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
thf(c_0_34,negated_conjecture,
( ( r @ esk1_0 @ esk3_0 )
| ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 )
| ~ ( a @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_35,negated_conjecture,
! [X1: $i] :
( ( b @ X1 )
| ( r @ esk1_0 @ esk3_0 )
| ~ ( r @ esk1_0 @ X1 )
| ~ ( a @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_36,negated_conjecture,
! [X1: $i] :
( ( a @ X1 )
| ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 )
| ~ ( r @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_37,negated_conjecture,
! [X1: $i,X3: $i] :
( ( b @ X1 )
| ( b @ X3 )
| ~ ( r @ esk1_0 @ X1 )
| ~ ( r @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_38,negated_conjecture,
! [X1: $i] :
( ( b @ X1 )
| ~ ( r @ esk1_0 @ X1 )
| ~ ( b @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
thf(c_0_39,negated_conjecture,
( ( r @ esk1_0 @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 )
| ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_40,negated_conjecture,
( ( r @ esk1_0 @ esk3_0 )
| ~ ( a @ esk2_0 )
| ~ ( a @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_30])]) ).
thf(c_0_41,negated_conjecture,
! [X1: $i] :
( ( a @ X1 )
| ~ ( r @ esk1_0 @ X1 )
| ~ ( b @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_33])]) ).
thf(c_0_42,negated_conjecture,
! [X1: $i] :
( ( b @ X1 )
| ~ ( r @ esk1_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_30]),c_0_38]) ).
thf(c_0_43,negated_conjecture,
( ( r @ esk1_0 @ esk2_0 )
| ( r @ esk1_0 @ esk3_0 )
| ~ ( b @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_33])]) ).
thf(c_0_44,negated_conjecture,
! [X1: $i] :
( ( b @ X1 )
| ( r @ esk1_0 @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 )
| ~ ( r @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_45,negated_conjecture,
( ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 )
| ~ ( b @ esk3_0 )
| ~ ( a @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_46,negated_conjecture,
( ( r @ esk1_0 @ esk3_0 )
| ~ ( a @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_33])]) ).
thf(c_0_47,negated_conjecture,
! [X1: $i] :
( ( a @ X1 )
| ~ ( r @ esk1_0 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_30])]) ).
thf(c_0_48,negated_conjecture,
( ( r @ esk1_0 @ esk3_0 )
| ( r @ esk1_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_30])]) ).
thf(c_0_49,negated_conjecture,
( ~ ( a @ esk2_0 )
| ~ ( b @ esk3_0 )
| ~ ( b @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_33])]) ).
thf(c_0_50,negated_conjecture,
r @ esk1_0 @ esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
thf(c_0_51,negated_conjecture,
( ~ ( a @ esk2_0 )
| ~ ( b @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_42]),c_0_50])]) ).
thf(c_0_52,negated_conjecture,
( ( r @ esk1_0 @ esk2_0 )
| ~ ( a @ esk4_0 )
| ~ ( b @ esk4_0 )
| ~ ( b @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_53,negated_conjecture,
~ ( a @ esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_42]),c_0_30])]) ).
thf(c_0_54,negated_conjecture,
( ( r @ esk1_0 @ esk2_0 )
| ~ ( b @ esk3_0 )
| ~ ( b @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_33])]) ).
thf(c_0_55,negated_conjecture,
~ ( r @ esk1_0 @ esk2_0 ),
inference(spm,[status(thm)],[c_0_53,c_0_47]) ).
thf(c_0_56,negated_conjecture,
~ ( b @ esk4_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_42]),c_0_50])]),c_0_55]) ).
thf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_42]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL584^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n016.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 09:03:19 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.25 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.ZjQF6g58rB/E---3.1_77623.p
% 0.22/0.27 % Version: 3.5.1-ho
% 0.22/0.27 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.22/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27 % Starting new_ho_9 with 1500s (5) cores
% 0.22/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.22/0.27 % Starting sh1l with 300s (1) cores
% 0.22/0.27 % Starting post_as_ho10 with 300s (1) cores
% 0.22/0.27 % sh1l with pid 77638 completed with status 0
% 0.22/0.27 % Result found by sh1l
% 0.22/0.27 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.22/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27 % Starting new_ho_9 with 1500s (5) cores
% 0.22/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.22/0.27 % Starting sh1l with 300s (1) cores
% 0.22/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.27 % No SInE strategy applied
% 0.22/0.27 % Search class: HGHNF-FFMF00-SHSSMFNN
% 0.22/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.27 % SubtermCWHack with pid 77643 completed with status 0
% 0.22/0.27 % Result found by SubtermCWHack
% 0.22/0.27 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.22/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27 % Starting new_ho_9 with 1500s (5) cores
% 0.22/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.22/0.27 % Starting sh1l with 300s (1) cores
% 0.22/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.27 % No SInE strategy applied
% 0.22/0.27 % Search class: HGHNF-FFMF00-SHSSMFNN
% 0.22/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.27 % Preprocessing time : 0.001 s
% 0.22/0.27
% 0.22/0.27 % Proof found!
% 0.22/0.27 % SZS status Theorem
% 0.22/0.27 % SZS output start CNFRefutation
% See solution above
% 0.22/0.27 % Parsed axioms : 40
% 0.22/0.27 % Removed by relevancy pruning/SinE : 0
% 0.22/0.27 % Initial clauses : 48
% 0.22/0.27 % Removed in clause preprocessing : 24
% 0.22/0.27 % Initial clauses in saturation : 24
% 0.22/0.27 % Processed clauses : 44
% 0.22/0.27 % ...of these trivial : 0
% 0.22/0.27 % ...subsumed : 1
% 0.22/0.27 % ...remaining for further processing : 43
% 0.22/0.27 % Other redundant clauses eliminated : 0
% 0.22/0.27 % Clauses deleted for lack of memory : 0
% 0.22/0.27 % Backward-subsumed : 21
% 0.22/0.27 % Backward-rewritten : 14
% 0.22/0.27 % Generated clauses : 50
% 0.22/0.27 % ...of the previous two non-redundant : 35
% 0.22/0.27 % ...aggressively subsumed : 0
% 0.22/0.27 % Contextual simplify-reflections : 6
% 0.22/0.27 % Paramodulations : 50
% 0.22/0.27 % Factorizations : 0
% 0.22/0.27 % NegExts : 0
% 0.22/0.27 % Equation resolutions : 0
% 0.22/0.27 % Disequality decompositions : 0
% 0.22/0.27 % Total rewrite steps : 27
% 0.22/0.27 % ...of those cached : 24
% 0.22/0.27 % Propositional unsat checks : 0
% 0.22/0.27 % Propositional check models : 0
% 0.22/0.27 % Propositional check unsatisfiable : 0
% 0.22/0.27 % Propositional clauses : 0
% 0.22/0.27 % Propositional clauses after purity: 0
% 0.22/0.27 % Propositional unsat core size : 0
% 0.22/0.27 % Propositional preprocessing time : 0.000
% 0.22/0.27 % Propositional encoding time : 0.000
% 0.22/0.27 % Propositional solver time : 0.000
% 0.22/0.27 % Success case prop preproc time : 0.000
% 0.22/0.27 % Success case prop encoding time : 0.000
% 0.22/0.27 % Success case prop solver time : 0.000
% 0.22/0.27 % Current number of processed clauses : 8
% 0.22/0.27 % Positive orientable unit clauses : 3
% 0.22/0.27 % Positive unorientable unit clauses: 0
% 0.22/0.27 % Negative unit clauses : 3
% 0.22/0.27 % Non-unit-clauses : 2
% 0.22/0.27 % Current number of unprocessed clauses: 0
% 0.22/0.27 % ...number of literals in the above : 0
% 0.22/0.27 % Current number of archived formulas : 0
% 0.22/0.27 % Current number of archived clauses : 35
% 0.22/0.27 % Clause-clause subsumption calls (NU) : 35
% 0.22/0.27 % Rec. Clause-clause subsumption calls : 32
% 0.22/0.27 % Non-unit clause-clause subsumptions : 25
% 0.22/0.27 % Unit Clause-clause subsumption calls : 11
% 0.22/0.27 % Rewrite failures with RHS unbound : 0
% 0.22/0.27 % BW rewrite match attempts : 3
% 0.22/0.27 % BW rewrite match successes : 3
% 0.22/0.27 % Condensation attempts : 0
% 0.22/0.27 % Condensation successes : 0
% 0.22/0.27 % Termbank termtop insertions : 2930
% 0.22/0.27 % Search garbage collected termcells : 360
% 0.22/0.27
% 0.22/0.27 % -------------------------------------------------
% 0.22/0.27 % User time : 0.005 s
% 0.22/0.27 % System time : 0.004 s
% 0.22/0.27 % Total time : 0.009 s
% 0.22/0.27 % Maximum resident set size: 3668 pages
% 0.22/0.27
% 0.22/0.27 % -------------------------------------------------
% 0.22/0.27 % User time : 0.009 s
% 0.22/0.27 % System time : 0.007 s
% 0.22/0.27 % Total time : 0.016 s
% 0.22/0.27 % Maximum resident set size: 4864 pages
% 0.22/0.27 % E exiting
%------------------------------------------------------------------------------