%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEV198^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 : n014.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:36:16 AM UTC 2026
% Result : Theorem 6.39s 1.61s
% Output : CNFRefutation 6.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 146 ( 119 equ; 0 cnn)
% Maximal formula atoms : 79 ( 6 avg)
% Number of connectives : 789 ( 51 ~; 137 |; 51 &; 535 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 11 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 63 ( 63 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 134 ( 60 ^; 56 !; 18 ?; 134 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
c0: a ).
thf(decl_24,type,
x: a ).
thf(decl_25,type,
cP: a > a > a ).
thf(decl_26,type,
esk1_1: ( a > a > a > $o ) > a ).
thf(decl_27,type,
esk2_1: ( a > a > a > $o ) > a ).
thf(decl_28,type,
esk3_1: ( a > a > a > $o ) > a ).
thf(decl_29,type,
esk4_1: ( a > a > a > $o ) > a ).
thf(decl_30,type,
esk5_1: ( a > a > a > $o ) > a ).
thf(decl_31,type,
esk6_1: ( a > a > a > $o ) > a ).
thf(decl_32,type,
esk7_1: ( a > a > a > $o ) > a ).
thf(decl_33,type,
esk8_1: ( a > a > a > $o ) > a ).
thf(decl_34,type,
esk9_1: ( a > a > a > $o ) > a ).
thf(cS_INCL_LEM6_pme,conjecture,
( ( ! [X1: a,X2: a,X3: a,X4: a] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
!= c0 ) )
=> ( ! [X5: a > a > a > $o] :
( ( $true
& ! [X6: a,X7: a,X8: a] :
( ( ( ( X6 = c0 )
& ( X7 = X8 ) )
| ( ( X7 = c0 )
& ( X6 = X8 ) )
| ? [X9: a,X10: a,X11: a,X12: a,X13: a,X14: a] :
( ( X6
= ( cP @ X9 @ X10 ) )
& ( X7
= ( cP @ X11 @ X12 ) )
& ( X8
= ( cP @ X13 @ X14 ) )
& ( X5 @ X9 @ X11 @ X13 )
& ( X5 @ X10 @ X12 @ X14 ) ) )
=> ( X5 @ X6 @ X7 @ X8 ) ) )
=> ( X5 @ x @ c0 @ c0 ) )
=> ( x = c0 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Ded4Aifvso/E---3.1_2796973.p',cS_INCL_LEM6_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X3: a,X4: a] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
!= c0 ) )
=> ( ! [X5: a > a > a > $o] :
( ( $true
& ! [X6: a,X7: a,X8: a] :
( ( ( ( X6 = c0 )
& ( X7 = X8 ) )
| ( ( X7 = c0 )
& ( X6 = X8 ) )
| ? [X9: a,X10: a,X11: a,X12: a,X13: a,X14: a] :
( ( X6
= ( cP @ X9 @ X10 ) )
& ( X7
= ( cP @ X11 @ X12 ) )
& ( X8
= ( cP @ X13 @ X14 ) )
& ( X5 @ X9 @ X11 @ X13 )
& ( X5 @ X10 @ X12 @ X14 ) ) )
=> ( X5 @ X6 @ X7 @ X8 ) ) )
=> ( X5 @ x @ c0 @ c0 ) )
=> ( x = c0 ) ) ),
inference(assume_negation,[status(cth)],[cS_INCL_LEM6_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X3: a,X4: a] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
!= c0 ) )
=> ( ! [X5: a > a > a > $o] :
( ( $true
& ! [X6: a,X7: a,X8: a] :
( ( ( ( X6 = c0 )
& ( X7 = X8 ) )
| ( ( X7 = c0 )
& ( X6 = X8 ) )
| ? [X9: a,X10: a,X11: a,X12: a,X13: a,X14: a] :
( ( X6
= ( cP @ X9 @ X10 ) )
& ( X7
= ( cP @ X11 @ X12 ) )
& ( X8
= ( cP @ X13 @ X14 ) )
& ( X5 @ X9 @ X11 @ X13 )
& ( X5 @ X10 @ X12 @ X14 ) ) )
=> ( X5 @ X6 @ X7 @ X8 ) ) )
=> ( X5 @ x @ c0 @ c0 ) )
=> ( x = c0 ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X31: a,X32: a,X33: a,X34: a,X35: a,X36: a,X37: a > a > a > $o] :
( ( ( X31 = X32 )
| ( ( cP @ X31 @ X33 )
!= ( cP @ X32 @ X34 ) ) )
& ( ( X33 = X34 )
| ( ( cP @ X31 @ X33 )
!= ( cP @ X32 @ X34 ) ) )
& ( ( cP @ X35 @ X36 )
!= c0 )
& ( ( ( esk1_1 @ X37 )
= ( cP @ ( esk4_1 @ X37 ) @ ( esk5_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk2_1 @ X37 )
= ( cP @ ( esk6_1 @ X37 ) @ ( esk7_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk3_1 @ X37 )
= ( cP @ ( esk8_1 @ X37 ) @ ( esk9_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk4_1 @ X37 ) @ ( esk6_1 @ X37 ) @ ( esk8_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk5_1 @ X37 ) @ ( esk7_1 @ X37 ) @ ( esk9_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk1_1 @ X37 )
= ( cP @ ( esk4_1 @ X37 ) @ ( esk5_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk2_1 @ X37 )
= ( cP @ ( esk6_1 @ X37 ) @ ( esk7_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk3_1 @ X37 )
= ( cP @ ( esk8_1 @ X37 ) @ ( esk9_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk4_1 @ X37 ) @ ( esk6_1 @ X37 ) @ ( esk8_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk5_1 @ X37 ) @ ( esk7_1 @ X37 ) @ ( esk9_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk1_1 @ X37 )
= ( cP @ ( esk4_1 @ X37 ) @ ( esk5_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk2_1 @ X37 )
= ( cP @ ( esk6_1 @ X37 ) @ ( esk7_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk3_1 @ X37 )
= ( cP @ ( esk8_1 @ X37 ) @ ( esk9_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk4_1 @ X37 ) @ ( esk6_1 @ X37 ) @ ( esk8_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk5_1 @ X37 ) @ ( esk7_1 @ X37 ) @ ( esk9_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk1_1 @ X37 )
= ( cP @ ( esk4_1 @ X37 ) @ ( esk5_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk2_1 @ X37 )
= ( cP @ ( esk6_1 @ X37 ) @ ( esk7_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk3_1 @ X37 )
= ( cP @ ( esk8_1 @ X37 ) @ ( esk9_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk4_1 @ X37 ) @ ( esk6_1 @ X37 ) @ ( esk8_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk5_1 @ X37 ) @ ( esk7_1 @ X37 ) @ ( esk9_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ~ ( X37 @ ( esk1_1 @ X37 ) @ ( esk2_1 @ X37 ) @ ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( x != c0 ) ),
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_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X5: a > a > a > $o] :
( ( X5 @ x @ c0 @ c0 )
| ~ ( X5 @ ( esk1_1 @ X5 ) @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X5: a > a > a > $o] :
( ( X5 @ x @ c0 @ c0 )
| ~ ( X5 @ ( esk1_1 @ X5 ) @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk3_1 @ X5 )
= ( cP @ ( esk8_1 @ X5 ) @ ( esk9_1 @ X5 ) ) )
| ( ( esk1_1 @ X5 )
= ( esk3_1 @ X5 ) )
| ( ( esk1_1 @ X5 )
= c0 )
| ( X5 @ x @ c0 @ c0 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X51: a > a > a > $o,X50: a > a > a > $o] :
( ( X51 @ x @ c0 @ c0 )
| ( X50 @ x @ c0 @ c0 )
| ~ ( ( X51
@ ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk2_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) ) )
| ( X50
@ ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk2_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) ) ) ) ),
inference(primitive_enumeration,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
!= c0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk1_1 @ X5 )
= c0 )
| ( ( esk3_1 @ X5 )
= ( esk1_1 @ X5 ) )
| ( ( esk3_1 @ X5 )
= ( cP @ ( esk8_1 @ X5 ) @ ( esk9_1 @ X5 ) ) )
| ( X5 @ x @ c0 @ c0 ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X21: a > a > a > $o,X5: a > a > a > $o] :
( ( X5 @ x @ c0 @ c0 )
| ( X21 @ x @ c0 @ c0 )
| ~ ( X5
@ ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk2_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk3_1 @ X5 )
= ( esk1_1 @ X5 ) )
| ( ( esk1_1 @ X5 )
= c0 )
| ( X5 @ x @ c0 @ c0 )
| ( ( esk3_1 @ X5 )
!= c0 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
= c0 )
| ( X5 @ x @ c0 @ c0 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
= c0 )
| ( X5 @ x @ c0 @ c0 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12])])]) ).
thf(c_0_14,negated_conjecture,
! [X5: a > a > a > $o] :
( ( X5 @ x @ c0 @ c0 )
| ~ ( ( X5 @ c0
@ ( esk2_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
@ ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) ) )
| ( ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
!= c0 ) ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13])])]) ).
thf(c_0_15,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
= c0 )
| ( X5 @ x @ c0 @ c0 ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_14])]) ).
thf(c_0_16,negated_conjecture,
! [X21: a > a > a > $o,X5: a > a > a > $o] :
( ( X5 @ x @ c0 @ c0 )
| ( X21 @ x @ c0 @ c0 )
| ~ ( X21
@ ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk2_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_7]) ).
thf(c_0_17,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
= c0 )
| ( X5 @ x @ c0 @ c0 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15])])]) ).
thf(c_0_18,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( Z0 != x )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) )
= x )
| ( X5 @ x @ c0 @ c0 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_16]) ).
thf(c_0_19,negated_conjecture,
x != c0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18])])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV198^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 : n014.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:20:00 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.Ded4Aifvso/E---3.1_2796973.p
% 6.39/1.61 % Version: 3.5.1-ho
% 6.39/1.61 % Preprocessing class: HSMSSMSSSSSNSSA.
% 6.39/1.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.39/1.61 % Starting post_as_ho1 with 1500s (5) cores
% 6.39/1.61 % Starting post_as_ho12 with 300s (1) cores
% 6.39/1.61 % Starting new_ho_3 with 300s (1) cores
% 6.39/1.61 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 6.39/1.61 % ehoh_best2_full_lfho with pid 2797002 completed with status 0
% 6.39/1.61 % Result found by ehoh_best2_full_lfho
% 6.39/1.61 % Preprocessing class: HSMSSMSSSSSNSSA.
% 6.39/1.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.39/1.61 % Starting post_as_ho1 with 1500s (5) cores
% 6.39/1.61 % Starting post_as_ho12 with 300s (1) cores
% 6.39/1.61 % Starting new_ho_3 with 300s (1) cores
% 6.39/1.61 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 6.39/1.61 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.39/1.61 % No SInE strategy applied
% 6.39/1.61 % Search class: HGUSF-FFMF21-SSSFFMBN
% 6.39/1.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.39/1.61 % Starting SubtermCWHack with 31s (1) cores
% 6.39/1.61 % SubtermCWHack with pid 2797003 completed with status 10
% 6.39/1.61 % Starting ehoh_best2_full_lfho with 172s (1) cores
% 6.39/1.61 % ehoh_best2_full_lfho with pid 2797014 completed with status 0
% 6.39/1.61 % Result found by ehoh_best2_full_lfho
% 6.39/1.61 % Preprocessing class: HSMSSMSSSSSNSSA.
% 6.39/1.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.39/1.61 % Starting post_as_ho1 with 1500s (5) cores
% 6.39/1.61 % Starting post_as_ho12 with 300s (1) cores
% 6.39/1.61 % Starting new_ho_3 with 300s (1) cores
% 6.39/1.61 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 6.39/1.61 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.39/1.61 % No SInE strategy applied
% 6.39/1.61 % Search class: HGUSF-FFMF21-SSSFFMBN
% 6.39/1.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.39/1.61 % Starting SubtermCWHack with 31s (1) cores
% 6.39/1.61 % SubtermCWHack with pid 2797003 completed with status 10
% 6.39/1.61 % Starting ehoh_best2_full_lfho with 172s (1) cores
% 6.39/1.61 % Preprocessing time : 0.002 s
% 6.39/1.61
% 6.39/1.61 % Proof found!
% 6.39/1.61 % SZS status Theorem
% 6.39/1.61 % SZS output start CNFRefutation
% See solution above
% 6.39/1.61 % Parsed axioms : 5
% 6.39/1.61 % Removed by relevancy pruning/SinE : 0
% 6.39/1.61 % Initial clauses : 29
% 6.39/1.61 % Removed in clause preprocessing : 4
% 6.39/1.61 % Initial clauses in saturation : 25
% 6.39/1.61 % Processed clauses : 2284
% 6.39/1.61 % ...of these trivial : 3
% 6.39/1.61 % ...subsumed : 1004
% 6.39/1.61 % ...remaining for further processing : 1277
% 6.39/1.61 % Other redundant clauses eliminated : 0
% 6.39/1.61 % Clauses deleted for lack of memory : 0
% 6.39/1.61 % Backward-subsumed : 107
% 6.39/1.61 % Backward-rewritten : 0
% 6.39/1.61 % Generated clauses : 12454
% 6.39/1.61 % ...of the previous two non-redundant : 11329
% 6.39/1.61 % ...aggressively subsumed : 0
% 6.39/1.61 % Contextual simplify-reflections : 0
% 6.39/1.61 % Paramodulations : 4924
% 6.39/1.61 % Factorizations : 3
% 6.39/1.61 % NegExts : 530
% 6.39/1.61 % Equation resolutions : 101
% 6.39/1.61 % Disequality decompositions : 0
% 6.39/1.61 % Total rewrite steps : 1230
% 6.39/1.61 % ...of those cached : 1225
% 6.39/1.61 % Propositional unsat checks : 0
% 6.39/1.61 % Propositional check models : 0
% 6.39/1.61 % Propositional check unsatisfiable : 0
% 6.39/1.61 % Propositional clauses : 0
% 6.39/1.61 % Propositional clauses after purity: 0
% 6.39/1.61 % Propositional unsat core size : 0
% 6.39/1.61 % Propositional preprocessing time : 0.000
% 6.39/1.61 % Propositional encoding time : 0.000
% 6.39/1.61 % Propositional solver time : 0.000
% 6.39/1.61 % Success case prop preproc time : 0.000
% 6.39/1.61 % Success case prop encoding time : 0.000
% 6.39/1.61 % Success case prop solver time : 0.000
% 6.39/1.61 % Current number of processed clauses : 989
% 6.39/1.61 % Positive orientable unit clauses : 8
% 6.39/1.61 % Positive unorientable unit clauses: 0
% 6.39/1.61 % Negative unit clauses : 2
% 6.39/1.61 % Non-unit-clauses : 979
% 6.39/1.61 % Current number of unprocessed clauses: 8692
% 6.39/1.61 % ...number of literals in the above : 63447
% 6.39/1.61 % Current number of archived formulas : 0
% 6.39/1.61 % Current number of archived clauses : 288
% 6.39/1.61 % Clause-clause subsumption calls (NU) : 131453
% 6.39/1.61 % Rec. Clause-clause subsumption calls : 10077
% 6.39/1.61 % Non-unit clause-clause subsumptions : 1046
% 6.39/1.61 % Unit Clause-clause subsumption calls : 157
% 6.39/1.61 % Rewrite failures with RHS unbound : 0
% 6.39/1.61 % BW rewrite match attempts : 5
% 6.39/1.61 % BW rewrite match successes : 3
% 6.39/1.61 % Condensation attempts : 0
% 6.39/1.61 % Condensation successes : 0
% 6.39/1.61 % Termbank termtop insertions : 972107
% 6.39/1.61 % Search garbage collected termcells : 573
% 6.39/1.61
% 6.39/1.61 % -------------------------------------------------
% 6.39/1.61 % User time : 1.312 s
% 6.39/1.61 % System time : 0.032 s
% 6.39/1.61 % Total time : 1.344 s
% 6.39/1.61 % Maximum resident set size: 3844 pages
% 6.39/1.61
% 6.39/1.61 % -------------------------------------------------
% 6.39/1.61 % User time : 1.313 s
% 6.39/1.61 % System time : 0.036 s
% 6.39/1.61 % Total time : 1.349 s
% 6.39/1.61 % Maximum resident set size: 4864 pages
% 6.39/1.61 % E exiting
%------------------------------------------------------------------------------