%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV191^5 : 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 : n009.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:35:10 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 1
% Syntax : Number of formulae : 58 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 272 ( 220 equ; 0 cnn)
% Maximal formula atoms : 72 ( 4 avg)
% Number of connectives : 637 ( 65 ~; 153 |; 68 &; 340 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 12 con; 0-3 aty)
% Number of variables : 116 ( 0 ^; 80 !; 36 ?; 116 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
cP: a > a > a ).
thf(decl_24,type,
c0: a ).
thf(decl_25,type,
epred1_0: a > a > a > $o ).
thf(decl_26,type,
epred2_0: a > a > a > $o ).
thf(decl_27,type,
esk1_0: a ).
thf(decl_28,type,
esk2_0: a ).
thf(decl_29,type,
esk3_0: a ).
thf(decl_30,type,
esk4_0: a ).
thf(decl_31,type,
esk5_0: a ).
thf(decl_32,type,
esk6_0: a ).
thf(decl_33,type,
esk7_0: a ).
thf(decl_34,type,
esk8_0: a ).
thf(decl_35,type,
esk9_0: a ).
thf(cS_JOINFN_MONOTONE_pme,conjecture,
( ! [X1: a > a > a > $o] :
( $true
=> $true )
& ! [X1: a > a > a > $o,X2: a > a > a > $o] :
( ( $true
& $true
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ X4 @ X5 )
=> ( X2 @ X3 @ X4 @ X5 ) ) )
=> ! [X3: a,X4: a,X5: a] :
( ( ( ( X3 = c0 )
& ( X4 = X5 ) )
| ( ( X4 = c0 )
& ( X3 = X5 ) )
| ? [X6: a,X7: a,X8: a,X9: a,X10: a,X11: a] :
( ( X3
= ( cP @ X6 @ X7 ) )
& ( X4
= ( cP @ X8 @ X9 ) )
& ( X5
= ( cP @ X10 @ X11 ) )
& ( X1 @ X6 @ X8 @ X10 )
& ( X1 @ X7 @ X9 @ X11 ) ) )
=> ( ( ( X3 = c0 )
& ( X4 = X5 ) )
| ( ( X4 = c0 )
& ( X3 = X5 ) )
| ? [X6: a,X7: a,X8: a,X9: a,X10: a,X11: a] :
( ( X3
= ( cP @ X6 @ X7 ) )
& ( X4
= ( cP @ X8 @ X9 ) )
& ( X5
= ( cP @ X10 @ X11 ) )
& ( X2 @ X6 @ X8 @ X10 )
& ( X2 @ X7 @ X9 @ X11 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.hsrzp1W68O/E---3.1_4126046.p',cS_JOINFN_MONOTONE_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: a > a > a > $o] :
( $true
=> $true )
& ! [X1: a > a > a > $o,X2: a > a > a > $o] :
( ( $true
& $true
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ X4 @ X5 )
=> ( X2 @ X3 @ X4 @ X5 ) ) )
=> ! [X3: a,X4: a,X5: a] :
( ( ( ( X3 = c0 )
& ( X4 = X5 ) )
| ( ( X4 = c0 )
& ( X3 = X5 ) )
| ? [X6: a,X7: a,X8: a,X9: a,X10: a,X11: a] :
( ( X3
= ( cP @ X6 @ X7 ) )
& ( X4
= ( cP @ X8 @ X9 ) )
& ( X5
= ( cP @ X10 @ X11 ) )
& ( X1 @ X6 @ X8 @ X10 )
& ( X1 @ X7 @ X9 @ X11 ) ) )
=> ( ( ( X3 = c0 )
& ( X4 = X5 ) )
| ( ( X4 = c0 )
& ( X3 = X5 ) )
| ? [X6: a,X7: a,X8: a,X9: a,X10: a,X11: a] :
( ( X3
= ( cP @ X6 @ X7 ) )
& ( X4
= ( cP @ X8 @ X9 ) )
& ( X5
= ( cP @ X10 @ X11 ) )
& ( X2 @ X6 @ X8 @ X10 )
& ( X2 @ X7 @ X9 @ X11 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[cS_JOINFN_MONOTONE_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ! [X1: a > a > a > $o] : $true
& ! [X1: a > a > a > $o,X2: a > a > a > $o] :
( ( $true
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ X4 @ X5 )
=> ( X2 @ X3 @ X4 @ X5 ) ) )
=> ! [X3: a,X4: a,X5: a] :
( ( ( ( X3 = c0 )
& ( X4 = X5 ) )
| ( ( X4 = c0 )
& ( X3 = X5 ) )
| ? [X6: a,X7: a,X8: a,X9: a,X10: a,X11: a] :
( ( X3
= ( cP @ X6 @ X7 ) )
& ( X4
= ( cP @ X8 @ X9 ) )
& ( X5
= ( cP @ X10 @ X11 ) )
& ( X1 @ X6 @ X8 @ X10 )
& ( X1 @ X7 @ X9 @ X11 ) ) )
=> ( ( ( X3 = c0 )
& ( X4 = X5 ) )
| ( ( X4 = c0 )
& ( X3 = X5 ) )
| ? [X6: a,X7: a,X8: a,X9: a,X10: a,X11: a] :
( ( X3
= ( cP @ X6 @ X7 ) )
& ( X4
= ( cP @ X8 @ X9 ) )
& ( X5
= ( cP @ X10 @ X11 ) )
& ( X2 @ X6 @ X8 @ X10 )
& ( X2 @ X7 @ X9 @ X11 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X35: a,X36: a,X37: a,X47: a,X48: a,X49: a,X50: a,X51: a,X52: a] :
( $true
& ( ~ ( epred1_0 @ X35 @ X36 @ X37 )
| ( epred2_0 @ X35 @ X36 @ X37 ) )
& ( ( esk1_0
= ( cP @ esk4_0 @ esk5_0 ) )
| ( esk2_0 = c0 )
| ( esk1_0 = c0 ) )
& ( ( esk2_0
= ( cP @ esk6_0 @ esk7_0 ) )
| ( esk2_0 = c0 )
| ( esk1_0 = c0 ) )
& ( ( esk3_0
= ( cP @ esk8_0 @ esk9_0 ) )
| ( esk2_0 = c0 )
| ( esk1_0 = c0 ) )
& ( ( epred1_0 @ esk4_0 @ esk6_0 @ esk8_0 )
| ( esk2_0 = c0 )
| ( esk1_0 = c0 ) )
& ( ( epred1_0 @ esk5_0 @ esk7_0 @ esk9_0 )
| ( esk2_0 = c0 )
| ( esk1_0 = c0 ) )
& ( ( esk1_0
= ( cP @ esk4_0 @ esk5_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk1_0 = c0 ) )
& ( ( esk2_0
= ( cP @ esk6_0 @ esk7_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk1_0 = c0 ) )
& ( ( esk3_0
= ( cP @ esk8_0 @ esk9_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk1_0 = c0 ) )
& ( ( epred1_0 @ esk4_0 @ esk6_0 @ esk8_0 )
| ( esk1_0 = esk3_0 )
| ( esk1_0 = c0 ) )
& ( ( epred1_0 @ esk5_0 @ esk7_0 @ esk9_0 )
| ( esk1_0 = esk3_0 )
| ( esk1_0 = c0 ) )
& ( ( esk1_0
= ( cP @ esk4_0 @ esk5_0 ) )
| ( esk2_0 = c0 )
| ( esk2_0 = esk3_0 ) )
& ( ( esk2_0
= ( cP @ esk6_0 @ esk7_0 ) )
| ( esk2_0 = c0 )
| ( esk2_0 = esk3_0 ) )
& ( ( esk3_0
= ( cP @ esk8_0 @ esk9_0 ) )
| ( esk2_0 = c0 )
| ( esk2_0 = esk3_0 ) )
& ( ( epred1_0 @ esk4_0 @ esk6_0 @ esk8_0 )
| ( esk2_0 = c0 )
| ( esk2_0 = esk3_0 ) )
& ( ( epred1_0 @ esk5_0 @ esk7_0 @ esk9_0 )
| ( esk2_0 = c0 )
| ( esk2_0 = esk3_0 ) )
& ( ( esk1_0
= ( cP @ esk4_0 @ esk5_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk2_0 = esk3_0 ) )
& ( ( esk2_0
= ( cP @ esk6_0 @ esk7_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk2_0 = esk3_0 ) )
& ( ( esk3_0
= ( cP @ esk8_0 @ esk9_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk2_0 = esk3_0 ) )
& ( ( epred1_0 @ esk4_0 @ esk6_0 @ esk8_0 )
| ( esk1_0 = esk3_0 )
| ( esk2_0 = esk3_0 ) )
& ( ( epred1_0 @ esk5_0 @ esk7_0 @ esk9_0 )
| ( esk1_0 = esk3_0 )
| ( esk2_0 = esk3_0 ) )
& ( ( esk1_0 != c0 )
| ( esk2_0 != esk3_0 ) )
& ( ( esk2_0 != c0 )
| ( esk1_0 != esk3_0 ) )
& ( ( esk1_0
!= ( cP @ X47 @ X48 ) )
| ( esk2_0
!= ( cP @ X49 @ X50 ) )
| ( esk3_0
!= ( cP @ X51 @ X52 ) )
| ~ ( epred2_0 @ X47 @ X49 @ X51 )
| ~ ( epred2_0 @ X48 @ X50 @ X52 ) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_2])])])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X3: a,X4: a,X5: a,X6: a,X7: a,X8: a] :
( ( esk1_0
!= ( cP @ X3 @ X4 ) )
| ( esk2_0
!= ( cP @ X5 @ X6 ) )
| ( esk3_0
!= ( cP @ X7 @ X8 ) )
| ~ ( epred2_0 @ X3 @ X5 @ X7 )
| ~ ( epred2_0 @ X4 @ X6 @ X8 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( epred2_0 @ X3 @ X4 @ X5 )
| ~ ( epred1_0 @ X3 @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X3: a,X4: a,X5: a,X6: a,X7: a,X8: a] :
( ( ( cP @ X3 @ X4 )
!= esk1_0 )
| ( ( cP @ X5 @ X6 )
!= esk2_0 )
| ( ( cP @ X7 @ X8 )
!= esk3_0 )
| ~ ( epred2_0 @ X3 @ X5 @ X7 )
| ~ ( epred1_0 @ X4 @ X6 @ X8 ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X4: a,X3: a,X6: a,X5: a,X8: a,X7: a] :
( ( ( cP @ X3 @ X4 )
!= esk1_0 )
| ( ( cP @ X5 @ X6 )
!= esk2_0 )
| ( ( cP @ X7 @ X8 )
!= esk3_0 )
| ~ ( epred1_0 @ X4 @ X6 @ X8 )
| ~ ( epred1_0 @ X3 @ X5 @ X7 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
thf(c_0_8,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk7_0 @ esk9_0 )
| ( esk1_0 = esk3_0 )
| ( esk1_0 = c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( c0 = esk1_0 )
| ( esk3_0 = esk1_0 )
| ( ( cP @ X3 @ esk5_0 )
!= esk1_0 )
| ( ( cP @ X4 @ esk7_0 )
!= esk2_0 )
| ( ( cP @ X5 @ esk9_0 )
!= esk3_0 )
| ~ ( epred1_0 @ X3 @ X4 @ X5 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ esk4_0 @ esk6_0 @ esk8_0 )
| ( esk1_0 = esk3_0 )
| ( esk1_0 = c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
( ( esk3_0
= ( cP @ esk8_0 @ esk9_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk1_0 = c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,negated_conjecture,
( ( esk2_0
= ( cP @ esk6_0 @ esk7_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk1_0 = c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_13,negated_conjecture,
( ( esk1_0
= ( cP @ esk4_0 @ esk5_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk1_0 = c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_14,negated_conjecture,
( ( esk1_0 != c0 )
| ( esk2_0 != esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_15,negated_conjecture,
( ( esk3_0 = esk1_0 )
| ( c0 = esk1_0 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13]) ).
thf(c_0_16,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk7_0 @ esk9_0 )
| ( esk1_0 = esk3_0 )
| ( esk2_0 = esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_17,negated_conjecture,
( ( esk3_0 = esk1_0 )
| ( esk3_0 != esk2_0 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( esk3_0 = esk1_0 )
| ( ( cP @ X3 @ esk5_0 )
!= esk1_0 )
| ( ( cP @ X4 @ esk7_0 )
!= esk2_0 )
| ( ( cP @ X5 @ esk9_0 )
!= esk3_0 )
| ~ ( epred1_0 @ X3 @ X4 @ X5 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_17]) ).
thf(c_0_19,negated_conjecture,
( ( epred1_0 @ esk4_0 @ esk6_0 @ esk8_0 )
| ( esk1_0 = esk3_0 )
| ( esk2_0 = esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_20,negated_conjecture,
( ( esk3_0
= ( cP @ esk8_0 @ esk9_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk2_0 = esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_21,negated_conjecture,
( ( esk2_0
= ( cP @ esk6_0 @ esk7_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk2_0 = esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_22,negated_conjecture,
( ( esk1_0
= ( cP @ esk4_0 @ esk5_0 ) )
| ( esk1_0 = esk3_0 )
| ( esk2_0 = esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_23,negated_conjecture,
( ( esk2_0 != c0 )
| ( esk1_0 != esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_24,negated_conjecture,
esk3_0 = esk1_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22]),c_0_17]) ).
thf(c_0_25,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk7_0 @ esk9_0 )
| ( esk2_0 = c0 )
| ( esk1_0 = c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_26,negated_conjecture,
c0 != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
thf(c_0_27,negated_conjecture,
! [X4: a,X3: a,X6: a,X5: a,X8: a,X7: a] :
( ( ( cP @ X3 @ X4 )
!= esk1_0 )
| ( ( cP @ X5 @ X6 )
!= esk2_0 )
| ( ( cP @ X7 @ X8 )
!= esk1_0 )
| ~ ( epred1_0 @ X4 @ X6 @ X8 )
| ~ ( epred1_0 @ X3 @ X5 @ X7 ) ),
inference(rw,[status(thm)],[c_0_7,c_0_24]) ).
thf(c_0_28,negated_conjecture,
( ( c0 = esk1_0 )
| ( epred1_0 @ esk5_0 @ esk7_0 @ esk9_0 ) ),
inference(sr,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_29,negated_conjecture,
( ( epred1_0 @ esk4_0 @ esk6_0 @ esk8_0 )
| ( esk2_0 = c0 )
| ( esk1_0 = c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_30,negated_conjecture,
( ( esk3_0
= ( cP @ esk8_0 @ esk9_0 ) )
| ( esk2_0 = c0 )
| ( esk1_0 = c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_31,negated_conjecture,
( ( esk2_0
= ( cP @ esk6_0 @ esk7_0 ) )
| ( esk2_0 = c0 )
| ( esk1_0 = c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_32,negated_conjecture,
( ( esk1_0
= ( cP @ esk4_0 @ esk5_0 ) )
| ( esk2_0 = c0 )
| ( esk1_0 = c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_33,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( c0 = esk1_0 )
| ( ( cP @ X3 @ esk5_0 )
!= esk1_0 )
| ( ( cP @ X4 @ esk7_0 )
!= esk2_0 )
| ( ( cP @ X5 @ esk9_0 )
!= esk1_0 )
| ~ ( epred1_0 @ X3 @ X4 @ X5 ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_34,negated_conjecture,
( ( c0 = esk1_0 )
| ( epred1_0 @ esk4_0 @ esk6_0 @ esk8_0 ) ),
inference(sr,[status(thm)],[c_0_29,c_0_26]) ).
thf(c_0_35,negated_conjecture,
( ( ( cP @ esk8_0 @ esk9_0 )
= esk1_0 )
| ( c0 = esk1_0 ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_24]),c_0_26]) ).
thf(c_0_36,negated_conjecture,
( ( ( cP @ esk6_0 @ esk7_0 )
= esk2_0 )
| ( c0 = esk1_0 ) ),
inference(sr,[status(thm)],[c_0_31,c_0_26]) ).
thf(c_0_37,negated_conjecture,
( ( ( cP @ esk4_0 @ esk5_0 )
= esk1_0 )
| ( c0 = esk1_0 ) ),
inference(sr,[status(thm)],[c_0_32,c_0_26]) ).
thf(c_0_38,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk7_0 @ esk9_0 )
| ( esk2_0 = c0 )
| ( esk2_0 = esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_39,negated_conjecture,
( ( c0 != esk1_0 )
| ( esk1_0 != esk2_0 ) ),
inference(rw,[status(thm)],[c_0_14,c_0_24]) ).
thf(c_0_40,negated_conjecture,
c0 = esk1_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]),c_0_37]) ).
thf(c_0_41,negated_conjecture,
( ( esk1_0
= ( cP @ esk4_0 @ esk5_0 ) )
| ( esk2_0 = c0 )
| ( esk2_0 = esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_42,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( c0 = esk2_0 )
| ( esk3_0 = esk2_0 )
| ( ( cP @ X3 @ esk5_0 )
!= esk1_0 )
| ( ( cP @ X4 @ esk7_0 )
!= esk2_0 )
| ( ( cP @ X5 @ esk9_0 )
!= esk3_0 )
| ~ ( epred1_0 @ X3 @ X4 @ X5 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_38]) ).
thf(c_0_43,negated_conjecture,
esk1_0 != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
thf(c_0_44,negated_conjecture,
( ( ( cP @ esk4_0 @ esk5_0 )
= esk1_0 )
| ( esk1_0 = esk2_0 ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_24]),c_0_26]) ).
thf(c_0_45,negated_conjecture,
( ( epred1_0 @ esk4_0 @ esk6_0 @ esk8_0 )
| ( esk2_0 = c0 )
| ( esk2_0 = esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_46,negated_conjecture,
( ( esk2_0
= ( cP @ esk6_0 @ esk7_0 ) )
| ( esk2_0 = c0 )
| ( esk2_0 = esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_47,negated_conjecture,
( ( esk3_0
= ( cP @ esk8_0 @ esk9_0 ) )
| ( esk2_0 = c0 )
| ( esk2_0 = esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_48,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( ( cP @ X3 @ esk5_0 )
!= esk1_0 )
| ( ( cP @ X4 @ esk7_0 )
!= esk2_0 )
| ( ( cP @ X5 @ esk9_0 )
!= esk1_0 )
| ~ ( epred1_0 @ X3 @ X4 @ X5 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_24]),c_0_24]),c_0_40])]),c_0_43]) ).
thf(c_0_49,negated_conjecture,
( ( cP @ esk4_0 @ esk5_0 )
= esk1_0 ),
inference(sr,[status(thm)],[c_0_44,c_0_43]) ).
thf(c_0_50,negated_conjecture,
( ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk4_0 @ esk6_0 @ esk8_0 ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_24]),c_0_26]) ).
thf(c_0_51,negated_conjecture,
( ( ( cP @ esk6_0 @ esk7_0 )
= esk2_0 )
| ( esk1_0 = esk2_0 ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_24]),c_0_26]) ).
thf(c_0_52,negated_conjecture,
( ( ( cP @ esk8_0 @ esk9_0 )
= esk1_0 )
| ( esk1_0 = esk2_0 ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_24]),c_0_24]),c_0_26]) ).
thf(c_0_53,negated_conjecture,
! [X3: a,X4: a] :
( ( ( cP @ X3 @ esk7_0 )
!= esk2_0 )
| ( ( cP @ X4 @ esk9_0 )
!= esk1_0 )
| ~ ( epred1_0 @ esk4_0 @ X3 @ X4 ) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
thf(c_0_54,negated_conjecture,
epred1_0 @ esk4_0 @ esk6_0 @ esk8_0,
inference(sr,[status(thm)],[c_0_50,c_0_43]) ).
thf(c_0_55,negated_conjecture,
( ( cP @ esk6_0 @ esk7_0 )
= esk2_0 ),
inference(sr,[status(thm)],[c_0_51,c_0_43]) ).
thf(c_0_56,negated_conjecture,
( ( cP @ esk8_0 @ esk9_0 )
= esk1_0 ),
inference(sr,[status(thm)],[c_0_52,c_0_43]) ).
thf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV191^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n009.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 15:20:00 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running higher-order theorem proving
% 0.09/0.23 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.hsrzp1W68O/E---3.1_4126046.p
% 0.09/0.25 % Version: 3.5.1-ho
% 0.09/0.25 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting post_as_ho1 with 1500s (5) cores
% 0.09/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.09/0.25 % Starting new_ho_3 with 300s (1) cores
% 0.09/0.25 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.09/0.25 % post_as_ho1 with pid 4126059 completed with status 0
% 0.09/0.25 % Result found by post_as_ho1
% 0.09/0.25 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting post_as_ho1 with 1500s (5) cores
% 0.09/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.25 % No SInE strategy applied
% 0.09/0.25 % Search class: HGHSF-FFMM22-SSSFFFNN
% 0.09/0.25 % partial match(3): FGHSF-FFMM22-SFFFFFNN
% 0.09/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.25 % Starting post_as_ho1 with 151s (1) cores
% 0.09/0.25 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.25 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.25 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.25 % SubtermCWHack with pid 4126063 completed with status 0
% 0.09/0.25 % Result found by SubtermCWHack
% 0.09/0.25 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting post_as_ho1 with 1500s (5) cores
% 0.09/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.25 % No SInE strategy applied
% 0.09/0.25 % Search class: HGHSF-FFMM22-SSSFFFNN
% 0.09/0.25 % partial match(3): FGHSF-FFMM22-SFFFFFNN
% 0.09/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.25 % Preprocessing time : 0.001 s
% 0.09/0.25
% 0.09/0.25 % Proof found!
% 0.09/0.25 % SZS status Theorem
% 0.09/0.25 % SZS output start CNFRefutation
% See solution above
% 0.09/0.25 % Parsed axioms : 4
% 0.09/0.25 % Removed by relevancy pruning/SinE : 0
% 0.09/0.25 % Initial clauses : 28
% 0.09/0.25 % Removed in clause preprocessing : 4
% 0.09/0.25 % Initial clauses in saturation : 24
% 0.09/0.25 % Processed clauses : 61
% 0.09/0.25 % ...of these trivial : 0
% 0.09/0.25 % ...subsumed : 1
% 0.09/0.25 % ...remaining for further processing : 60
% 0.09/0.25 % Other redundant clauses eliminated : 0
% 0.09/0.25 % Clauses deleted for lack of memory : 0
% 0.09/0.25 % Backward-subsumed : 7
% 0.09/0.25 % Backward-rewritten : 30
% 0.09/0.25 % Generated clauses : 55
% 0.09/0.25 % ...of the previous two non-redundant : 67
% 0.09/0.25 % ...aggressively subsumed : 0
% 0.09/0.25 % Contextual simplify-reflections : 12
% 0.09/0.25 % Paramodulations : 46
% 0.09/0.25 % Factorizations : 0
% 0.09/0.25 % NegExts : 0
% 0.09/0.25 % Equation resolutions : 0
% 0.09/0.25 % Disequality decompositions : 0
% 0.09/0.25 % Total rewrite steps : 44
% 0.09/0.25 % ...of those cached : 40
% 0.09/0.25 % Propositional unsat checks : 0
% 0.09/0.25 % Propositional check models : 0
% 0.09/0.25 % Propositional check unsatisfiable : 0
% 0.09/0.25 % Propositional clauses : 0
% 0.09/0.25 % Propositional clauses after purity: 0
% 0.09/0.25 % Propositional unsat core size : 0
% 0.09/0.25 % Propositional preprocessing time : 0.000
% 0.09/0.25 % Propositional encoding time : 0.000
% 0.09/0.25 % Propositional solver time : 0.000
% 0.09/0.25 % Success case prop preproc time : 0.000
% 0.09/0.25 % Success case prop encoding time : 0.000
% 0.09/0.25 % Success case prop solver time : 0.000
% 0.09/0.25 % Current number of processed clauses : 14
% 0.09/0.25 % Positive orientable unit clauses : 7
% 0.09/0.25 % Positive unorientable unit clauses: 0
% 0.09/0.25 % Negative unit clauses : 1
% 0.09/0.25 % Non-unit-clauses : 6
% 0.09/0.25 % Current number of unprocessed clauses: 9
% 0.09/0.25 % ...number of literals in the above : 43
% 0.09/0.25 % Current number of archived formulas : 0
% 0.09/0.25 % Current number of archived clauses : 46
% 0.09/0.25 % Clause-clause subsumption calls (NU) : 225
% 0.09/0.25 % Rec. Clause-clause subsumption calls : 41
% 0.09/0.25 % Non-unit clause-clause subsumptions : 19
% 0.09/0.25 % Unit Clause-clause subsumption calls : 5
% 0.09/0.25 % Rewrite failures with RHS unbound : 0
% 0.09/0.25 % BW rewrite match attempts : 2
% 0.09/0.25 % BW rewrite match successes : 2
% 0.09/0.25 % Condensation attempts : 0
% 0.09/0.25 % Condensation successes : 0
% 0.09/0.25 % Termbank termtop insertions : 2831
% 0.09/0.25 % Search garbage collected termcells : 468
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.006 s
% 0.09/0.25 % System time : 0.003 s
% 0.09/0.25 % Total time : 0.009 s
% 0.09/0.25 % Maximum resident set size: 3640 pages
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.017 s
% 0.09/0.25 % System time : 0.011 s
% 0.09/0.25 % Total time : 0.028 s
% 0.09/0.25 % Maximum resident set size: 4864 pages
% 0.09/0.25 % E exiting
%------------------------------------------------------------------------------