%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEV074^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 : n006.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:55 AM UTC 2026
% Result : Theorem 0.25s 0.37s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 1
% Syntax : Number of formulae : 34 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 135 ( 80 equ; 0 cnn)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 720 ( 72 ~; 168 |; 9 &; 465 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 9 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 54 ( 54 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 162 ( 118 ^; 44 !; 0 ?; 162 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: a > a > $o ).
thf(decl_24,type,
esk1_0: a ).
thf(decl_25,type,
esk2_0: a ).
thf(decl_26,type,
epred2_0: a > a > $o ).
thf(decl_27,type,
esk3_1: ( a > a > $o ) > a ).
thf(decl_28,type,
esk4_1: ( a > a > $o ) > a ).
thf(decl_29,type,
esk5_1: ( a > a > $o ) > a ).
thf(cTHM523_pme,conjecture,
! [X1: a > a > $o,X2: a,X3: a] :
( ( ( X1 @ X2 @ X3 )
| ( X2 = X3 ) )
<=> ! [X4: a > a > $o] :
( ( ! [X5: a,X6: a] :
( ( X1 @ X5 @ X6 )
=> ( X4 @ X5 @ X6 ) )
& ! [X5: a] : ( X4 @ X5 @ X5 ) )
=> ( X4 @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hnY4mbLmj9/E---3.1_842225.p',cTHM523_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > $o,X2: a,X3: a] :
( ( ( X1 @ X2 @ X3 )
| ( X2 = X3 ) )
<=> ! [X4: a > a > $o] :
( ( ! [X5: a,X6: a] :
( ( X1 @ X5 @ X6 )
=> ( X4 @ X5 @ X6 ) )
& ! [X5: a] : ( X4 @ X5 @ X5 ) )
=> ( X4 @ X2 @ X3 ) ) ),
inference(assume_negation,[status(cth)],[cTHM523_pme]) ).
thf(c_0_2,negated_conjecture,
! [X18: a,X19: a,X20: a,X21: a > a > $o] :
( ( ~ ( epred1_0 @ X18 @ X19 )
| ( epred2_0 @ X18 @ X19 )
| ~ ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ( epred2_0 @ X20 @ X20 )
| ~ ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ X18 @ X19 )
| ( epred2_0 @ X18 @ X19 )
| ( esk1_0 != esk2_0 ) )
& ( ( epred2_0 @ X20 @ X20 )
| ( esk1_0 != esk2_0 ) )
& ( ~ ( epred2_0 @ esk1_0 @ esk2_0 )
| ( esk1_0 != esk2_0 ) )
& ( ( epred1_0 @ ( esk3_1 @ X21 ) @ ( esk4_1 @ X21 ) )
| ~ ( X21 @ ( esk5_1 @ X21 ) @ ( esk5_1 @ X21 ) )
| ( X21 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( esk1_0 = esk2_0 ) )
& ( ~ ( X21 @ ( esk3_1 @ X21 ) @ ( esk4_1 @ X21 ) )
| ~ ( X21 @ ( esk5_1 @ X21 ) @ ( esk5_1 @ X21 ) )
| ( X21 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( esk1_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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: a > a > $o] :
( ( epred1_0 @ ( esk3_1 @ X1 ) @ ( esk4_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( esk1_0 = esk2_0 )
| ~ ( X1 @ ( esk5_1 @ X1 ) @ ( esk5_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: a > a > $o] :
( ( X1 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( esk1_0 = esk2_0 )
| ~ ( X1 @ ( esk3_1 @ X1 ) @ ( esk4_1 @ X1 ) )
| ~ ( X1 @ ( esk5_1 @ X1 ) @ ( esk5_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X36: a > a > $o,X35: a > a > $o] :
( ( esk1_0 = esk2_0 )
| ( epred1_0
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( X36 @ Z0 @ Z1 )
| ( X35 @ Z0 @ Z1 ) ) )
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( X36 @ Z0 @ Z1 )
| ( X35 @ Z0 @ Z1 ) ) ) )
| ( X36 @ esk1_0 @ esk2_0 )
| ( X35 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( ( X36
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X36 @ Z0 @ Z1 )
| ( X35 @ Z0 @ Z1 ) ) )
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X36 @ Z0 @ Z1 )
| ( X35 @ Z0 @ Z1 ) ) ) )
| ( X35
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X36 @ Z0 @ Z1 )
| ( X35 @ Z0 @ Z1 ) ) )
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X36 @ Z0 @ Z1 )
| ( X35 @ Z0 @ Z1 ) ) ) ) ) ),
inference(primitive_enumeration,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X29: a > a > $o,X28: a > a > $o] :
( ( esk1_0 = esk2_0 )
| ( X29 @ esk1_0 @ esk2_0 )
| ( X28 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ~ ( ( X29
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( X29 @ Z0 @ Z1 )
| ( X28 @ Z0 @ Z1 ) ) )
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( X29 @ Z0 @ Z1 )
| ( X28 @ Z0 @ Z1 ) ) ) )
| ( X28
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( X29 @ Z0 @ Z1 )
| ( X28 @ Z0 @ Z1 ) ) )
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( X29 @ Z0 @ Z1 )
| ( X28 @ Z0 @ Z1 ) ) ) ) )
| ~ ( ( X29
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X29 @ Z0 @ Z1 )
| ( X28 @ Z0 @ Z1 ) ) )
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X29 @ Z0 @ Z1 )
| ( X28 @ Z0 @ Z1 ) ) ) )
| ( X28
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X29 @ Z0 @ Z1 )
| ( X28 @ Z0 @ Z1 ) ) )
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X29 @ Z0 @ Z1 )
| ( X28 @ Z0 @ Z1 ) ) ) ) ) ),
inference(primitive_enumeration,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: a > a > $o,X4: a > a > $o] :
( ( esk1_0 = esk2_0 )
| ( epred1_0
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( X4 @ Z0 @ Z1 ) ) )
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( X4 @ Z0 @ Z1 ) ) ) )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X4 @ esk1_0 @ esk2_0 )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X4
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( X4 @ Z0 @ Z1 ) ) )
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( X4 @ Z0 @ Z1 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X4: a > a > $o,X1: a > a > $o] :
( ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X1 @ esk1_0 @ esk2_0 )
| ( X4 @ esk1_0 @ esk2_0 )
| ~ ( X1
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) )
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) ) )
| ~ ( X1
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) )
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: a > a > $o] :
( ( ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( Z0 != esk1_0 ) ) )
= esk1_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( Z0 != esk1_0 ) ) )
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( Z0 != esk1_0 ) ) ) )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: a > a > $o] :
( ( ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( Z0 != esk1_0 ) ) )
= esk1_0 )
| ( ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( Z0 != esk1_0 ) ) )
= esk1_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X4: a > a > $o,X1: a > a > $o] :
( ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X1 @ esk1_0 @ esk2_0 )
| ( X4 @ esk1_0 @ esk2_0 )
| ~ ( X4
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) )
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) ) )
| ~ ( X4
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) )
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_6]) ).
thf(c_0_12,negated_conjecture,
! [X1: a > a > $o] :
( ( ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( Z0 != esk1_0 ) ) )
= esk1_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( Z0 != esk1_0 ) ) ) )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: a > a > $o] :
( ( ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( X1 @ Z0 @ Z1 ) ) )
= esk2_0 )
| ( ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( X1 @ Z0 @ Z1 ) ) )
= esk2_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X1: a > a > $o,X4: a > a > $o] :
( ( esk1_0 = esk2_0 )
| ( epred1_0
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( X4 @ Z0 @ Z1 ) ) )
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( X4 @ Z0 @ Z1 ) ) ) )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X4 @ esk1_0 @ esk2_0 )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( X4 @ Z0 @ Z1 ) ) )
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X1 @ Z0 @ Z1 )
| ( X4 @ Z0 @ Z1 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_15,negated_conjecture,
( ( ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) )
= esk2_0 )
| ( ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) )
= esk1_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])])]) ).
thf(c_0_16,negated_conjecture,
( ( ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) )
= esk2_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) )
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) ) )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15])])]) ).
thf(c_0_17,negated_conjecture,
! [X4: a > a > $o,X1: a > a > $o] :
( ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X1 @ esk1_0 @ esk2_0 )
| ( X4 @ esk1_0 @ esk2_0 )
| ~ ( X4
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) )
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) ) )
| ~ ( X1
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) )
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_6]) ).
thf(c_0_18,negated_conjecture,
( ( ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) )
= esk2_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) )
@ esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13])])]) ).
thf(c_0_19,negated_conjecture,
( ( ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) )
= esk1_0 )
| ( ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) )
= esk2_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15])])]) ).
thf(c_0_20,negated_conjecture,
! [X4: a > a > $o,X1: a > a > $o] :
( ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 )
| ( X1 @ esk1_0 @ esk2_0 )
| ( X4 @ esk1_0 @ esk2_0 )
| ~ ( X1
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) )
@ ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) ) )
| ~ ( X4
@ ( esk3_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) )
@ ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( X4 @ Z0 @ Z1 )
| ( X1 @ Z0 @ Z1 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_6]) ).
thf(c_0_21,negated_conjecture,
( ( ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) )
= esk2_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,negated_conjecture,
( ( ( esk4_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) )
= esk2_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])])]) ).
thf(c_0_23,negated_conjecture,
( ( ( esk5_1
@ ^ [Z0: a,Z1: a] :
( ( Z1 != esk2_0 )
| ( Z0 != esk1_0 ) ) )
= esk1_0 )
| ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_22])])]) ).
thf(c_0_24,negated_conjecture,
( ~ ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_25,negated_conjecture,
( ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_23]) ).
thf(c_0_26,negated_conjecture,
( ~ ( epred2_0 @ esk1_0 @ esk2_0 )
| ( esk1_0 != esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_27,negated_conjecture,
! [X2: a,X3: a] :
( ( epred2_0 @ X2 @ X3 )
| ~ ( epred1_0 @ X2 @ X3 )
| ~ ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_28,negated_conjecture,
~ ( epred2_0 @ esk1_0 @ esk2_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
thf(c_0_29,negated_conjecture,
esk1_0 = esk2_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_28]),c_0_25]) ).
thf(c_0_30,negated_conjecture,
! [X2: a] :
( ( epred2_0 @ X2 @ X2 )
| ( esk1_0 != esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_31,negated_conjecture,
~ ( epred2_0 @ esk2_0 @ esk2_0 ),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_32,negated_conjecture,
! [X2: a] : ( epred2_0 @ X2 @ X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_29])]) ).
thf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV074^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 % Computer : n006.cluster.edu
% 0.08/0.21 % Model : x86_64 x86_64
% 0.08/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21 % Memory : 8046.5625MB
% 0.08/0.21 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Tue Sep 29 15:06:09 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.28 Running higher-order theorem proving
% 0.25/0.29 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.hnY4mbLmj9/E---3.1_842225.p
% 0.25/0.37 % Version: 3.5.1-ho
% 0.25/0.37 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.25/0.37 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.37 % Starting post_as_ho12 with 300s (1) cores
% 0.25/0.37 % Starting new_bool_9 with 300s (1) cores
% 0.25/0.37 % Starting post_as_ho1 with 300s (1) cores
% 0.25/0.37 % Starting post_as_ho4 with 300s (1) cores
% 0.25/0.37 % Starting post_as_ho2 with 300s (1) cores
% 0.25/0.37 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.25/0.37 % Starting full_lambda_10 with 300s (1) cores
% 0.25/0.37 % Starting new_ho_8 with 300s (1) cores
% 0.25/0.37 % ehoh_best2_full_lfho with pid 842243 completed with status 0
% 0.25/0.37 % Result found by ehoh_best2_full_lfho
% 0.25/0.37 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.25/0.37 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.37 % Starting post_as_ho12 with 300s (1) cores
% 0.25/0.37 % Starting new_bool_9 with 300s (1) cores
% 0.25/0.37 % Starting post_as_ho1 with 300s (1) cores
% 0.25/0.37 % Starting post_as_ho4 with 300s (1) cores
% 0.25/0.37 % Starting post_as_ho2 with 300s (1) cores
% 0.25/0.37 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.25/0.37 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.37 % No SInE strategy applied
% 0.25/0.37 % Search class: HGHSF-FFSF11-SSSFFSBN
% 0.25/0.37 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.37 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.37 % SubtermCWHack with pid 842252 completed with status 10
% 0.25/0.37 % Starting ehoh_best2_full_lfho with 181s (1) cores
% 0.25/0.37 % ehoh_best2_full_lfho with pid 842259 completed with status 0
% 0.25/0.37 % Result found by ehoh_best2_full_lfho
% 0.25/0.37 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.25/0.37 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.37 % Starting post_as_ho12 with 300s (1) cores
% 0.25/0.37 % Starting new_bool_9 with 300s (1) cores
% 0.25/0.37 % Starting post_as_ho1 with 300s (1) cores
% 0.25/0.37 % Starting post_as_ho4 with 300s (1) cores
% 0.25/0.37 % Starting post_as_ho2 with 300s (1) cores
% 0.25/0.37 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.25/0.37 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.37 % No SInE strategy applied
% 0.25/0.37 % Search class: HGHSF-FFSF11-SSSFFSBN
% 0.25/0.37 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.37 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.37 % SubtermCWHack with pid 842252 completed with status 10
% 0.25/0.37 % Starting ehoh_best2_full_lfho with 181s (1) cores
% 0.25/0.37 % Preprocessing time : 0.001 s
% 0.25/0.37
% 0.25/0.37 % Proof found!
% 0.25/0.37 % SZS status Theorem
% 0.25/0.37 % SZS output start CNFRefutation
% See solution above
% 0.25/0.37 % Parsed axioms : 2
% 0.25/0.37 % Removed by relevancy pruning/SinE : 0
% 0.25/0.37 % Initial clauses : 9
% 0.25/0.37 % Removed in clause preprocessing : 1
% 0.25/0.37 % Initial clauses in saturation : 8
% 0.25/0.37 % Processed clauses : 174
% 0.25/0.37 % ...of these trivial : 0
% 0.25/0.37 % ...subsumed : 29
% 0.25/0.37 % ...remaining for further processing : 145
% 0.25/0.37 % Other redundant clauses eliminated : 0
% 0.25/0.37 % Clauses deleted for lack of memory : 0
% 0.25/0.37 % Backward-subsumed : 112
% 0.25/0.37 % Backward-rewritten : 8
% 0.25/0.37 % Generated clauses : 378
% 0.25/0.37 % ...of the previous two non-redundant : 285
% 0.25/0.37 % ...aggressively subsumed : 0
% 0.25/0.37 % Contextual simplify-reflections : 3
% 0.25/0.37 % Paramodulations : 131
% 0.25/0.37 % Factorizations : 1
% 0.25/0.37 % NegExts : 28
% 0.25/0.37 % Equation resolutions : 1
% 0.25/0.37 % Disequality decompositions : 0
% 0.25/0.37 % Total rewrite steps : 9
% 0.25/0.37 % ...of those cached : 6
% 0.25/0.37 % Propositional unsat checks : 0
% 0.25/0.37 % Propositional check models : 0
% 0.25/0.37 % Propositional check unsatisfiable : 0
% 0.25/0.37 % Propositional clauses : 0
% 0.25/0.37 % Propositional clauses after purity: 0
% 0.25/0.37 % Propositional unsat core size : 0
% 0.25/0.37 % Propositional preprocessing time : 0.000
% 0.25/0.37 % Propositional encoding time : 0.000
% 0.25/0.37 % Propositional solver time : 0.000
% 0.25/0.37 % Success case prop preproc time : 0.000
% 0.25/0.37 % Success case prop encoding time : 0.000
% 0.25/0.37 % Success case prop solver time : 0.000
% 0.25/0.37 % Current number of processed clauses : 2
% 0.25/0.37 % Positive orientable unit clauses : 2
% 0.25/0.37 % Positive unorientable unit clauses: 0
% 0.25/0.37 % Negative unit clauses : 0
% 0.25/0.37 % Non-unit-clauses : 0
% 0.25/0.37 % Current number of unprocessed clauses: 119
% 0.25/0.37 % ...number of literals in the above : 699
% 0.25/0.37 % Current number of archived formulas : 0
% 0.25/0.37 % Current number of archived clauses : 143
% 0.25/0.37 % Clause-clause subsumption calls (NU) : 1555
% 0.25/0.37 % Rec. Clause-clause subsumption calls : 174
% 0.25/0.37 % Non-unit clause-clause subsumptions : 142
% 0.25/0.37 % Unit Clause-clause subsumption calls : 2
% 0.25/0.37 % Rewrite failures with RHS unbound : 0
% 0.25/0.37 % BW rewrite match attempts : 3
% 0.25/0.37 % BW rewrite match successes : 3
% 0.25/0.37 % Condensation attempts : 0
% 0.25/0.37 % Condensation successes : 0
% 0.25/0.37 % Termbank termtop insertions : 31404
% 0.25/0.37 % Search garbage collected termcells : 246
% 0.25/0.37
% 0.25/0.37 % -------------------------------------------------
% 0.25/0.37 % User time : 0.043 s
% 0.25/0.37 % System time : 0.005 s
% 0.25/0.37 % Total time : 0.048 s
% 0.25/0.37 % Maximum resident set size: 3632 pages
% 0.25/0.37
% 0.25/0.37 % -------------------------------------------------
% 0.25/0.37 % User time : 0.046 s
% 0.25/0.37 % System time : 0.009 s
% 0.25/0.37 % Total time : 0.055 s
% 0.25/0.37 % Maximum resident set size: 4864 pages
% 0.25/0.37 % E exiting
%------------------------------------------------------------------------------