%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV006^5 : 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 : n002.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:34:32 AM UTC 2026
% Result : Theorem 0.21s 0.27s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 221 ( 220 equ; 0 cnn)
% Maximal formula atoms : 39 ( 12 avg)
% Number of connectives : 902 ( 121 ~; 70 |; 130 &; 578 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 13 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 144 ( 0 ^; 114 !; 30 ?; 144 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
esk1_0: a > a > a ).
thf(decl_24,type,
esk2_0: a > a > a ).
thf(decl_25,type,
esk3_0: a ).
thf(decl_26,type,
esk4_0: a ).
thf(decl_27,type,
esk5_0: a ).
thf(decl_28,type,
esk6_0: a ).
thf(decl_29,type,
esk7_0: a ).
thf(decl_30,type,
esk8_0: a ).
thf(decl_31,type,
esk9_0: a ).
thf(decl_32,type,
esk10_0: a ).
thf(cPENTAGON_THM2D_pme,conjecture,
! [X1: a > a > a,X2: a > a > a] :
( ( ! [X3: a] :
( ( X1 @ X3 @ X3 )
= X3 )
& ! [X3: a] :
( ( X2 @ X3 @ X3 )
= X3 )
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
= ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a,X5: a] :
( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
= ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
= ( X1 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X2 @ X3 @ X4 )
= ( X2 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
= X4 )
& ! [X3: a,X4: a] :
( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
= X4 )
& ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
( ( X6 != X7 )
& ( X6 != X8 )
& ( X6 != X3 )
& ( X6 != X4 )
& ( X7 != X8 )
& ( X7 != X3 )
& ( X7 != X4 )
& ( X8 != X3 )
& ( X8 != X4 )
& ( X3 != X4 ) )
& ~ ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ ( X2 @ X4 @ ( X1 @ X3 @ X5 ) ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) ) )
=> ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
( ( ( X2 @ X3 @ X4 )
= X4 )
& ( ( X1 @ X3 @ X4 )
= X3 )
& ( ( X2 @ X3 @ X6 )
= X6 )
& ( ( X1 @ X3 @ X6 )
= X3 )
& ( ( X2 @ X3 @ X7 )
= X7 )
& ( ( X1 @ X3 @ X7 )
= X3 )
& ( ( X2 @ X3 @ X8 )
= X8 )
& ( ( X1 @ X3 @ X8 )
= X3 )
& ( ( X2 @ X6 @ X7 )
= X4 )
& ( ( X1 @ X6 @ X7 )
= X3 )
& ( ( X2 @ X6 @ X8 )
= X6 )
& ( ( X1 @ X6 @ X8 )
= X8 )
& ( ( X2 @ X6 @ X4 )
= X4 )
& ( ( X1 @ X6 @ X4 )
= X6 )
& ( ( X2 @ X7 @ X8 )
= X4 )
& ( ( X1 @ X7 @ X8 )
= X3 )
& ( ( X2 @ X7 @ X4 )
= X4 )
& ( ( X1 @ X7 @ X4 )
= X7 )
& ( ( X2 @ X8 @ X4 )
= X4 )
& ( ( X1 @ X8 @ X4 )
= X8 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.C6aeS0blu2/E---3.1_1404464.p',cPENTAGON_THM2D_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > a,X2: a > a > a] :
( ( ! [X3: a] :
( ( X1 @ X3 @ X3 )
= X3 )
& ! [X3: a] :
( ( X2 @ X3 @ X3 )
= X3 )
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
= ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a,X5: a] :
( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
= ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
= ( X1 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X2 @ X3 @ X4 )
= ( X2 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
= X4 )
& ! [X3: a,X4: a] :
( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
= X4 )
& ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
( ( X6 != X7 )
& ( X6 != X8 )
& ( X6 != X3 )
& ( X6 != X4 )
& ( X7 != X8 )
& ( X7 != X3 )
& ( X7 != X4 )
& ( X8 != X3 )
& ( X8 != X4 )
& ( X3 != X4 ) )
& ~ ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ ( X2 @ X4 @ ( X1 @ X3 @ X5 ) ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) ) )
=> ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
( ( ( X2 @ X3 @ X4 )
= X4 )
& ( ( X1 @ X3 @ X4 )
= X3 )
& ( ( X2 @ X3 @ X6 )
= X6 )
& ( ( X1 @ X3 @ X6 )
= X3 )
& ( ( X2 @ X3 @ X7 )
= X7 )
& ( ( X1 @ X3 @ X7 )
= X3 )
& ( ( X2 @ X3 @ X8 )
= X8 )
& ( ( X1 @ X3 @ X8 )
= X3 )
& ( ( X2 @ X6 @ X7 )
= X4 )
& ( ( X1 @ X6 @ X7 )
= X3 )
& ( ( X2 @ X6 @ X8 )
= X6 )
& ( ( X1 @ X6 @ X8 )
= X8 )
& ( ( X2 @ X6 @ X4 )
= X4 )
& ( ( X1 @ X6 @ X4 )
= X6 )
& ( ( X2 @ X7 @ X8 )
= X4 )
& ( ( X1 @ X7 @ X8 )
= X3 )
& ( ( X2 @ X7 @ X4 )
= X4 )
& ( ( X1 @ X7 @ X4 )
= X7 )
& ( ( X2 @ X8 @ X4 )
= X4 )
& ( ( X1 @ X8 @ X4 )
= X8 ) ) ),
inference(assume_negation,[status(cth)],[cPENTAGON_THM2D_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: a > a > a,X2: a > a > a] :
( ( ! [X3: a] :
( ( X1 @ X3 @ X3 )
= X3 )
& ! [X3: a] :
( ( X2 @ X3 @ X3 )
= X3 )
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
= ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a,X5: a] :
( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
= ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
= ( X1 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X2 @ X3 @ X4 )
= ( X2 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
= X4 )
& ! [X3: a,X4: a] :
( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
= X4 )
& ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
( ( X6 != X7 )
& ( X6 != X8 )
& ( X6 != X3 )
& ( X6 != X4 )
& ( X7 != X8 )
& ( X7 != X3 )
& ( X7 != X4 )
& ( X8 != X3 )
& ( X8 != X4 )
& ( X3 != X4 ) )
& ~ ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ ( X2 @ X4 @ ( X1 @ X3 @ X5 ) ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) ) )
=> ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
( ( ( X2 @ X3 @ X4 )
= X4 )
& ( ( X1 @ X3 @ X4 )
= X3 )
& ( ( X2 @ X3 @ X6 )
= X6 )
& ( ( X1 @ X3 @ X6 )
= X3 )
& ( ( X2 @ X3 @ X7 )
= X7 )
& ( ( X1 @ X3 @ X7 )
= X3 )
& ( ( X2 @ X3 @ X8 )
= X8 )
& ( ( X1 @ X3 @ X8 )
= X3 )
& ( ( X2 @ X6 @ X7 )
= X4 )
& ( ( X1 @ X6 @ X7 )
= X3 )
& ( ( X2 @ X6 @ X8 )
= X6 )
& ( ( X1 @ X6 @ X8 )
= X8 )
& ( ( X2 @ X6 @ X4 )
= X4 )
& ( ( X1 @ X6 @ X4 )
= X6 )
& ( ( X2 @ X7 @ X8 )
= X4 )
& ( ( X1 @ X7 @ X8 )
= X3 )
& ( ( X2 @ X7 @ X4 )
= X4 )
& ( ( X1 @ X7 @ X4 )
= X7 )
& ( ( X2 @ X8 @ X4 )
= X4 )
& ( ( X1 @ X8 @ X4 )
= X8 ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X42: a,X43: a,X44: a,X45: a,X46: a,X47: a,X48: a,X49: a,X50: a,X51: a,X52: a,X53: a,X54: a,X55: a,X56: a,X57: a,X66: a,X67: a,X68: a,X69: a,X70: a] :
( ( ( esk1_0 @ X42 @ X42 )
= X42 )
& ( ( esk2_0 @ X43 @ X43 )
= X43 )
& ( ( esk1_0 @ ( esk1_0 @ X44 @ X45 ) @ X46 )
= ( esk1_0 @ X44 @ ( esk1_0 @ X45 @ X46 ) ) )
& ( ( esk2_0 @ ( esk2_0 @ X47 @ X48 ) @ X49 )
= ( esk2_0 @ X47 @ ( esk2_0 @ X48 @ X49 ) ) )
& ( ( esk1_0 @ X50 @ X51 )
= ( esk1_0 @ X51 @ X50 ) )
& ( ( esk2_0 @ X52 @ X53 )
= ( esk2_0 @ X53 @ X52 ) )
& ( ( esk1_0 @ ( esk2_0 @ X54 @ X55 ) @ X55 )
= X55 )
& ( ( esk2_0 @ ( esk1_0 @ X56 @ X57 ) @ X57 )
= X57 )
& ( esk5_0 != esk6_0 )
& ( esk5_0 != esk7_0 )
& ( esk5_0 != esk3_0 )
& ( esk5_0 != esk4_0 )
& ( esk6_0 != esk7_0 )
& ( esk6_0 != esk3_0 )
& ( esk6_0 != esk4_0 )
& ( esk7_0 != esk3_0 )
& ( esk7_0 != esk4_0 )
& ( esk3_0 != esk4_0 )
& ( ( esk1_0 @ esk8_0 @ ( esk2_0 @ esk9_0 @ ( esk1_0 @ esk8_0 @ esk10_0 ) ) )
!= ( esk2_0 @ ( esk1_0 @ esk8_0 @ esk9_0 ) @ ( esk1_0 @ esk8_0 @ esk10_0 ) ) )
& ( ( ( esk2_0 @ X66 @ X67 )
!= X67 )
| ( ( esk1_0 @ X66 @ X67 )
!= X66 )
| ( ( esk2_0 @ X66 @ X68 )
!= X68 )
| ( ( esk1_0 @ X66 @ X68 )
!= X66 )
| ( ( esk2_0 @ X66 @ X69 )
!= X69 )
| ( ( esk1_0 @ X66 @ X69 )
!= X66 )
| ( ( esk2_0 @ X66 @ X70 )
!= X70 )
| ( ( esk1_0 @ X66 @ X70 )
!= X66 )
| ( ( esk2_0 @ X68 @ X69 )
!= X67 )
| ( ( esk1_0 @ X68 @ X69 )
!= X66 )
| ( ( esk2_0 @ X68 @ X70 )
!= X68 )
| ( ( esk1_0 @ X68 @ X70 )
!= X70 )
| ( ( esk2_0 @ X68 @ X67 )
!= X67 )
| ( ( esk1_0 @ X68 @ X67 )
!= X68 )
| ( ( esk2_0 @ X69 @ X70 )
!= X67 )
| ( ( esk1_0 @ X69 @ X70 )
!= X66 )
| ( ( esk2_0 @ X69 @ X67 )
!= X67 )
| ( ( esk1_0 @ X69 @ X67 )
!= X69 )
| ( ( esk2_0 @ X70 @ X67 )
!= X67 )
| ( ( esk1_0 @ X70 @ X67 )
!= X70 ) ) ),
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_2])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X3: a,X4: a] :
( ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ X4 )
= X4 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X4: a,X3: a] :
( ( esk1_0 @ X3 @ X4 )
= ( esk1_0 @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X3: a,X5: a,X4: a,X6: a,X7: a] :
( ( ( esk2_0 @ X3 @ X4 )
!= X4 )
| ( ( esk1_0 @ X3 @ X4 )
!= X3 )
| ( ( esk2_0 @ X3 @ X5 )
!= X5 )
| ( ( esk1_0 @ X3 @ X5 )
!= X3 )
| ( ( esk2_0 @ X3 @ X6 )
!= X6 )
| ( ( esk1_0 @ X3 @ X6 )
!= X3 )
| ( ( esk2_0 @ X3 @ X7 )
!= X7 )
| ( ( esk1_0 @ X3 @ X7 )
!= X3 )
| ( ( esk2_0 @ X5 @ X6 )
!= X4 )
| ( ( esk1_0 @ X5 @ X6 )
!= X3 )
| ( ( esk2_0 @ X5 @ X7 )
!= X5 )
| ( ( esk1_0 @ X5 @ X7 )
!= X7 )
| ( ( esk2_0 @ X5 @ X4 )
!= X4 )
| ( ( esk1_0 @ X5 @ X4 )
!= X5 )
| ( ( esk2_0 @ X6 @ X7 )
!= X4 )
| ( ( esk1_0 @ X6 @ X7 )
!= X3 )
| ( ( esk2_0 @ X6 @ X4 )
!= X4 )
| ( ( esk1_0 @ X6 @ X4 )
!= X6 )
| ( ( esk2_0 @ X7 @ X4 )
!= X4 )
| ( ( esk1_0 @ X7 @ X4 )
!= X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X4: a,X3: a] :
( ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ X3 ) )
= X3 ),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( esk1_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 )
= ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
! [X3: a] :
( ( esk1_0 @ X3 @ X3 )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
! [X4: a,X3: a] :
( ( esk2_0 @ X3 @ X4 )
= ( esk2_0 @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
! [X3: a,X4: a] :
( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ X4 )
= X4 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X3 ) )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X4 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X3 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X5 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk2_0 @ X3 @ X4 ) )
!= X3 )
| ( ( esk1_0 @ X5 @ X3 )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X5 @ ( esk2_0 @ X3 @ X4 ) )
!= X5 )
| ( ( esk2_0 @ X5 @ X3 )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X4 @ ( esk1_0 @ X3 @ X4 ) )
!= X4 )
| ( ( esk2_0 @ X3 @ ( esk1_0 @ X3 @ X4 ) )
!= X3 )
| ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 )
!= X5 )
| ( ( esk1_0 @ X5 @ X4 )
!= X4 )
| ( ( esk2_0 @ X5 @ X4 )
!= X5 ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])]),c_0_7]),c_0_8]),c_0_9]),c_0_8]),c_0_8]),c_0_8]),c_0_7])]),c_0_10]),c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X4: a,X3: a] :
( ( esk2_0 @ X3 @ ( esk1_0 @ X4 @ X3 ) )
= X3 ),
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X3 ) )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X4 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X3 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X5 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk2_0 @ X3 @ X4 ) )
!= X3 )
| ( ( esk1_0 @ X5 @ X3 )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X5 @ ( esk2_0 @ X3 @ X4 ) )
!= X5 )
| ( ( esk2_0 @ X5 @ X3 )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X3 @ ( esk1_0 @ X3 @ X4 ) )
!= X3 )
| ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 )
!= X5 )
| ( ( esk1_0 @ X5 @ X4 )
!= X4 )
| ( ( esk2_0 @ X5 @ X4 )
!= X5 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_15,negated_conjecture,
! [X3: a] :
( ( esk2_0 @ X3 @ X3 )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_16,negated_conjecture,
! [X3: a,X4: a] :
( ( ( esk1_0 @ X3 @ ( esk1_0 @ X3 @ X4 ) )
!= X3 )
| ( ( esk2_0 @ X4 @ X3 )
!= X3 )
| ( ( esk1_0 @ X4 @ X3 )
!= X3 )
| ( ( esk1_0 @ X4 @ X3 )
!= X4 )
| ( ( esk2_0 @ X3 @ X4 )
!= X4 )
| ( ( esk2_0 @ X4 @ X3 )
!= X4 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_9]),c_0_15]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_15]),c_0_9]),c_0_9]),c_0_9]),c_0_15]),c_0_9])]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_9]),c_0_9]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV006^5 : 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.18 % Computer : n002.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 15:00:22 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.24 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.C6aeS0blu2/E---3.1_1404464.p
% 0.21/0.27 % Version: 3.5.1-ho
% 0.21/0.27 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.21/0.27 % Starting new_ho_3 with 300s (1) cores
% 0.21/0.27 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.27 % post_as_ho1 with pid 1404477 completed with status 0
% 0.21/0.27 % Result found by post_as_ho1
% 0.21/0.27 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27 % No SInE strategy applied
% 0.21/0.27 % Search class: HUHPM-FFMF00-MSSFFFNN
% 0.21/0.27 % partial match(3): HUHPF-FFSF00-SSSFFFNN
% 0.21/0.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.27 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.27 % Starting post_as_ho1 with 151s (1) cores
% 0.21/0.27 % Starting sh5l with 136s (1) cores
% 0.21/0.27 % Starting new_bool_1 with 136s (1) cores
% 0.21/0.27 % Starting new_bool_2 with 136s (1) cores
% 0.21/0.27 % post_as_ho1 with pid 1404484 completed with status 0
% 0.21/0.27 % Result found by post_as_ho1
% 0.21/0.27 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27 % No SInE strategy applied
% 0.21/0.27 % Search class: HUHPM-FFMF00-MSSFFFNN
% 0.21/0.27 % partial match(3): HUHPF-FFSF00-SSSFFFNN
% 0.21/0.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.27 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.27 % Starting post_as_ho1 with 151s (1) cores
% 0.21/0.27 % Preprocessing time : 0.001 s
% 0.21/0.27 % Presaturation interreduction done
% 0.21/0.27
% 0.21/0.27 % Proof found!
% 0.21/0.27 % SZS status Theorem
% 0.21/0.27 % SZS output start CNFRefutation
% See solution above
% 0.21/0.27 % Parsed axioms : 2
% 0.21/0.27 % Removed by relevancy pruning/SinE : 0
% 0.21/0.27 % Initial clauses : 21
% 0.21/0.27 % Removed in clause preprocessing : 1
% 0.21/0.27 % Initial clauses in saturation : 20
% 0.21/0.27 % Processed clauses : 45
% 0.21/0.27 % ...of these trivial : 0
% 0.21/0.27 % ...subsumed : 0
% 0.21/0.27 % ...remaining for further processing : 45
% 0.21/0.27 % Other redundant clauses eliminated : 2
% 0.21/0.27 % Clauses deleted for lack of memory : 0
% 0.21/0.27 % Backward-subsumed : 0
% 0.21/0.27 % Backward-rewritten : 3
% 0.21/0.27 % Generated clauses : 49
% 0.21/0.27 % ...of the previous two non-redundant : 41
% 0.21/0.27 % ...aggressively subsumed : 0
% 0.21/0.27 % Contextual simplify-reflections : 0
% 0.21/0.27 % Paramodulations : 48
% 0.21/0.27 % Factorizations : 0
% 0.21/0.27 % NegExts : 0
% 0.21/0.27 % Equation resolutions : 2
% 0.21/0.27 % Disequality decompositions : 0
% 0.21/0.27 % Total rewrite steps : 80
% 0.21/0.27 % ...of those cached : 49
% 0.21/0.27 % Propositional unsat checks : 0
% 0.21/0.27 % Propositional check models : 0
% 0.21/0.27 % Propositional check unsatisfiable : 0
% 0.21/0.27 % Propositional clauses : 0
% 0.21/0.27 % Propositional clauses after purity: 0
% 0.21/0.27 % Propositional unsat core size : 0
% 0.21/0.27 % Propositional preprocessing time : 0.000
% 0.21/0.27 % Propositional encoding time : 0.000
% 0.21/0.27 % Propositional solver time : 0.000
% 0.21/0.27 % Success case prop preproc time : 0.000
% 0.21/0.27 % Success case prop encoding time : 0.000
% 0.21/0.27 % Success case prop solver time : 0.000
% 0.21/0.27 % Current number of processed clauses : 21
% 0.21/0.27 % Positive orientable unit clauses : 6
% 0.21/0.27 % Positive unorientable unit clauses: 2
% 0.21/0.27 % Negative unit clauses : 11
% 0.21/0.27 % Non-unit-clauses : 2
% 0.21/0.27 % Current number of unprocessed clauses: 32
% 0.21/0.27 % ...number of literals in the above : 130
% 0.21/0.27 % Current number of archived formulas : 0
% 0.21/0.27 % Current number of archived clauses : 23
% 0.21/0.27 % Clause-clause subsumption calls (NU) : 1
% 0.21/0.27 % Rec. Clause-clause subsumption calls : 0
% 0.21/0.27 % Non-unit clause-clause subsumptions : 0
% 0.21/0.27 % Unit Clause-clause subsumption calls : 1
% 0.21/0.27 % Rewrite failures with RHS unbound : 0
% 0.21/0.27 % BW rewrite match attempts : 61
% 0.21/0.27 % BW rewrite match successes : 53
% 0.21/0.27 % Condensation attempts : 0
% 0.21/0.27 % Condensation successes : 0
% 0.21/0.27 % Termbank termtop insertions : 2949
% 0.21/0.27 % Search garbage collected termcells : 922
% 0.21/0.27
% 0.21/0.27 % -------------------------------------------------
% 0.21/0.27 % User time : 0.006 s
% 0.21/0.27 % System time : 0.006 s
% 0.21/0.27 % Total time : 0.012 s
% 0.21/0.27 % Maximum resident set size: 3648 pages
% 0.21/0.27
% 0.21/0.27 % -------------------------------------------------
% 0.21/0.27 % User time : 0.030 s
% 0.21/0.27 % System time : 0.020 s
% 0.21/0.27 % Total time : 0.050 s
% 0.21/0.27 % Maximum resident set size: 4864 pages
% 0.21/0.27 % E exiting
%------------------------------------------------------------------------------