TSTP Solution File: SEV064^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV064^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:07:31 EDT 2024
% Result : Theorem 1.52s 0.66s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 236 ( 10 equ; 0 cnn)
% Maximal formula atoms : 72 ( 9 avg)
% Number of connectives : 828 ( 99 ~; 85 |; 13 &; 628 @)
% ( 0 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 21 ( 12 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 306 ( 306 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 272 ( 195 ^ 73 !; 4 ?; 272 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epred1_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_23,type,
esk1_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i ).
thf(decl_24,type,
epred2_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_25,type,
epred3_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_26,type,
epred4_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_27,type,
esk2_2: ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > ( ( $i > $o ) > ( $i > $o ) > $i > $o ) > $i ).
thf(cTHM120C_pme,conjecture,
? [X1: ( $i > $o ) > ( $i > $o ) > $i > $o,X2: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ~ ! [X3: $i] :
( ( X2
@ ^ [X4: $i] : $true
@ ^ [X4: $i] : ~ $true
@ X3 )
| ( X1
@ ^ [X4: $i] : $true
@ ^ [X4: $i] : ~ $true
@ X3 ) )
& ! [X5: $i > $o,X3: $i] :
( ( X2 @ X5 @ X5 @ X3 )
| ( X1 @ X5 @ X5 @ X3 ) )
& ! [X6: $i > $o,X7: $i > $o,X8: $i > $o] :
( ( ! [X3: $i] :
( ( X2 @ X6 @ X7 @ X3 )
| ( X1 @ X6 @ X7 @ X3 ) )
& ! [X3: $i] :
( ( X2 @ X7 @ X8 @ X3 )
| ( X1 @ X7 @ X8 @ X3 ) ) )
=> ! [X3: $i] :
( ( X2 @ X6 @ X8 @ X3 )
| ( X1 @ X6 @ X8 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM120C_pme) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: ( $i > $o ) > ( $i > $o ) > $i > $o,X2: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ~ ! [X3: $i] :
( ( X2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 ) )
& ! [X5: $i > $o,X3: $i] :
( ( X2 @ X5 @ X5 @ X3 )
| ( X1 @ X5 @ X5 @ X3 ) )
& ! [X6: $i > $o,X7: $i > $o,X8: $i > $o] :
( ( ! [X3: $i] :
( ( X2 @ X6 @ X7 @ X3 )
| ( X1 @ X6 @ X7 @ X3 ) )
& ! [X3: $i] :
( ( X2 @ X7 @ X8 @ X3 )
| ( X1 @ X7 @ X8 @ X3 ) ) )
=> ! [X3: $i] :
( ( X2 @ X6 @ X8 @ X3 )
| ( X1 @ X6 @ X8 @ X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM120C_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X20: ( $i > $o ) > ( $i > $o ) > $i > $o,X21: ( $i > $o ) > ( $i > $o ) > $i > $o,X22: $i,X28: $i,X29: $i] :
( ( ( X21 @ ( epred2_2 @ X20 @ X21 ) @ ( epred3_2 @ X20 @ X21 ) @ X28 )
| ( X20 @ ( epred2_2 @ X20 @ X21 ) @ ( epred3_2 @ X20 @ X21 ) @ X28 )
| ~ ( X21 @ ( epred1_2 @ X20 @ X21 ) @ ( epred1_2 @ X20 @ X21 ) @ ( esk1_2 @ X20 @ X21 ) )
| ( X21
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 )
| ( X20
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 ) )
& ( ( X21 @ ( epred3_2 @ X20 @ X21 ) @ ( epred4_2 @ X20 @ X21 ) @ X29 )
| ( X20 @ ( epred3_2 @ X20 @ X21 ) @ ( epred4_2 @ X20 @ X21 ) @ X29 )
| ~ ( X21 @ ( epred1_2 @ X20 @ X21 ) @ ( epred1_2 @ X20 @ X21 ) @ ( esk1_2 @ X20 @ X21 ) )
| ( X21
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 )
| ( X20
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 ) )
& ( ~ ( X21 @ ( epred2_2 @ X20 @ X21 ) @ ( epred4_2 @ X20 @ X21 ) @ ( esk2_2 @ X20 @ X21 ) )
| ~ ( X21 @ ( epred1_2 @ X20 @ X21 ) @ ( epred1_2 @ X20 @ X21 ) @ ( esk1_2 @ X20 @ X21 ) )
| ( X21
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 )
| ( X20
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 ) )
& ( ~ ( X20 @ ( epred2_2 @ X20 @ X21 ) @ ( epred4_2 @ X20 @ X21 ) @ ( esk2_2 @ X20 @ X21 ) )
| ~ ( X21 @ ( epred1_2 @ X20 @ X21 ) @ ( epred1_2 @ X20 @ X21 ) @ ( esk1_2 @ X20 @ X21 ) )
| ( X21
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 )
| ( X20
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 ) )
& ( ( X21 @ ( epred2_2 @ X20 @ X21 ) @ ( epred3_2 @ X20 @ X21 ) @ X28 )
| ( X20 @ ( epred2_2 @ X20 @ X21 ) @ ( epred3_2 @ X20 @ X21 ) @ X28 )
| ~ ( X20 @ ( epred1_2 @ X20 @ X21 ) @ ( epred1_2 @ X20 @ X21 ) @ ( esk1_2 @ X20 @ X21 ) )
| ( X21
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 )
| ( X20
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 ) )
& ( ( X21 @ ( epred3_2 @ X20 @ X21 ) @ ( epred4_2 @ X20 @ X21 ) @ X29 )
| ( X20 @ ( epred3_2 @ X20 @ X21 ) @ ( epred4_2 @ X20 @ X21 ) @ X29 )
| ~ ( X20 @ ( epred1_2 @ X20 @ X21 ) @ ( epred1_2 @ X20 @ X21 ) @ ( esk1_2 @ X20 @ X21 ) )
| ( X21
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 )
| ( X20
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 ) )
& ( ~ ( X21 @ ( epred2_2 @ X20 @ X21 ) @ ( epred4_2 @ X20 @ X21 ) @ ( esk2_2 @ X20 @ X21 ) )
| ~ ( X20 @ ( epred1_2 @ X20 @ X21 ) @ ( epred1_2 @ X20 @ X21 ) @ ( esk1_2 @ X20 @ X21 ) )
| ( X21
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 )
| ( X20
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 ) )
& ( ~ ( X20 @ ( epred2_2 @ X20 @ X21 ) @ ( epred4_2 @ X20 @ X21 ) @ ( esk2_2 @ X20 @ X21 ) )
| ~ ( X20 @ ( epred1_2 @ X20 @ X21 ) @ ( epred1_2 @ X20 @ X21 ) @ ( esk1_2 @ X20 @ X21 ) )
| ( X21
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 )
| ( X20
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X22 ) ) ),
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,
! [X3: $i,X2: ( $i > $o ) > ( $i > $o ) > $i > $o,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ( X2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ~ ( X1 @ ( epred2_2 @ X2 @ X1 ) @ ( epred4_2 @ X2 @ X1 ) @ ( esk2_2 @ X2 @ X1 ) )
| ~ ( X2 @ ( epred1_2 @ X2 @ X1 ) @ ( epred1_2 @ X2 @ X1 ) @ ( esk1_2 @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $i > $o,X3: $i,X2: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ~ ( X1 @ ( epred2_2 @ X1 @ X2 ) @ ( epred4_2 @ X1 @ X2 ) @ ( esk2_2 @ X1 @ X2 ) )
| ~ ( X1 @ ( epred1_2 @ X1 @ X2 ) @ ( epred1_2 @ X1 @ X2 ) @ ( esk1_2 @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X3: $i,X2: ( $i > $o ) > ( $i > $o ) > $i > $o,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ( X2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ~ ( X2 @ ( epred1_2 @ X2 @ X1 ) @ ( epred1_2 @ X2 @ X1 ) @ ( esk1_2 @ X2 @ X1 ) )
| ~ ( X1 @ ( epred2_2 @ X2 @ X1 ) @ ( epred4_2 @ X2 @ X1 ) @ ( esk2_2 @ X2 @ X1 ) ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X4: $i,X3: $i,X2: ( $i > $o ) > ( $i > $o ) > $i > $o,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X1 @ ( epred3_2 @ X2 @ X1 ) @ ( epred4_2 @ X2 @ X1 ) @ X3 )
| ( X2 @ ( epred3_2 @ X2 @ X1 ) @ ( epred4_2 @ X2 @ X1 ) @ X3 )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ( X2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ~ ( X2 @ ( epred1_2 @ X2 @ X1 ) @ ( epred1_2 @ X2 @ X1 ) @ ( esk1_2 @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $i > $o,X3: $i,X2: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ( X2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ~ ( X1 @ ( epred1_2 @ X1 @ X2 ) @ ( epred1_2 @ X1 @ X2 ) @ ( esk1_2 @ X1 @ X2 ) )
| ~ ( X1 @ ( epred2_2 @ X1 @ X2 ) @ ( epred4_2 @ X1 @ X2 ) @ ( esk2_2 @ X1 @ X2 ) ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X3: $i,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( ( ^ [Z0: $i] : ~ $true )
= ( ^ [Z0: $i] : $true ) )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ~ ( X1
@ ( epred2_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 )
@ ( epred4_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 )
@ ( esk2_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X4: $i,X3: $i,X2: ( $i > $o ) > ( $i > $o ) > $i > $o,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X1 @ ( epred3_2 @ X2 @ X1 ) @ ( epred4_2 @ X2 @ X1 ) @ X3 )
| ( X2 @ ( epred3_2 @ X2 @ X1 ) @ ( epred4_2 @ X2 @ X1 ) @ X3 )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ( X2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ~ ( X2 @ ( epred1_2 @ X2 @ X1 ) @ ( epred1_2 @ X2 @ X1 ) @ ( esk1_2 @ X2 @ X1 ) ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( ( ^ [Z0: $i] : ~ $true )
= ( ^ [Z0: $i] : $true ) )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ( ( epred4_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 )
!= ( epred2_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X3: $i,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ~ ( X1
@ ( epred2_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 )
@ ( epred4_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 )
@ ( esk2_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 ) ) ),
inference(cn,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_8])]) ).
thf(c_0_12,negated_conjecture,
! [X4: $i,X3: $i,X2: ( $i > $o ) > ( $i > $o ) > $i > $o,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X1 @ ( epred2_2 @ X2 @ X1 ) @ ( epred3_2 @ X2 @ X1 ) @ X3 )
| ( X2 @ ( epred2_2 @ X2 @ X1 ) @ ( epred3_2 @ X2 @ X1 ) @ X3 )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ( X2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ~ ( X2 @ ( epred1_2 @ X2 @ X1 ) @ ( epred1_2 @ X2 @ X1 ) @ ( esk1_2 @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,plain,
! [X1: ( $i > $o ) > ( $i > $o ) > $i > $o,X3: $i,X4: $i,X2: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X2 @ ( epred3_2 @ X1 @ X2 ) @ ( epred4_2 @ X1 @ X2 ) @ X3 )
| ( X2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ( ( X1 @ ( epred3_2 @ X1 @ X2 ) @ ( epred4_2 @ X1 @ X2 ) @ X3 )
<~> ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 ) )
| ~ ( X1 @ ( epred1_2 @ X1 @ X2 ) @ ( epred1_2 @ X1 @ X2 ) @ ( esk1_2 @ X1 @ X2 ) ) ),
inference(ext_eqfact,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X3 )
| ( ( epred4_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 )
!= ( epred2_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 ) ) ),
inference(cn,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_10])]) ).
thf(c_0_15,negated_conjecture,
( ( ( epred4_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : ~ Z0 )
= ( epred2_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : ~ Z0 ) )
| ( ( ^ [Z0: $i] : ~ $true )
!= ( ^ [Z0: $i] : $true ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_11]) ).
thf(c_0_16,negated_conjecture,
! [X4: $i,X3: $i,X2: ( $i > $o ) > ( $i > $o ) > $i > $o,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X1 @ ( epred2_2 @ X2 @ X1 ) @ ( epred3_2 @ X2 @ X1 ) @ X3 )
| ( X2 @ ( epred2_2 @ X2 @ X1 ) @ ( epred3_2 @ X2 @ X1 ) @ X3 )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ( X2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ~ ( X2 @ ( epred1_2 @ X2 @ X1 ) @ ( epred1_2 @ X2 @ X1 ) @ ( esk1_2 @ X2 @ X1 ) ) ),
inference(cn,[status(thm)],[c_0_12]) ).
thf(c_0_17,plain,
! [X4: $i,X3: $i,X2: ( $i > $o ) > ( $i > $o ) > $i > $o,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X1 @ ( epred3_2 @ X2 @ X1 ) @ ( epred4_2 @ X2 @ X1 ) @ X3 )
| ( X2 @ ( epred3_2 @ X2 @ X1 ) @ ( epred4_2 @ X2 @ X1 ) @ X3 )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ( X2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ~ ( X2 @ ( epred1_2 @ X2 @ X1 ) @ ( epred1_2 @ X2 @ X1 ) @ ( esk1_2 @ X2 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_13])])]) ).
thf(c_0_18,negated_conjecture,
( ( ^ [Z0: $i] : ~ $true )
!= ( ^ [Z0: $i] : $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15])])]) ).
thf(c_0_19,negated_conjecture,
! [X4: $i,X3: $i,X1: ( $i > $o ) > ( $i > $o ) > $i > $o] :
( ( X1
@ ( epred2_2 @ X1
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : ~ $true )
@ ( epred3_2 @ X1
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : ~ $true )
@ X3 )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 )
| ~ ( X1
@ ( epred1_2 @ X1
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : ~ $true )
@ ( epred1_2 @ X1
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : ~ $true )
@ ( esk1_2 @ X1
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : ~ $true ) ) ),
inference(primitive_enumeration,[status(thm)],[c_0_16]) ).
thf(c_0_20,negated_conjecture,
( ( epred4_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : ~ $true )
!= ( epred2_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : ~ $true ) ),
inference(primitive_enumeration,[status(thm)],[c_0_14]) ).
thf(c_0_21,plain,
! [X1: ( $i > $o ) > ( $i > $o ) > $i > $o,X3: $i,X4: $i] :
( ( ( epred4_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 )
= ( epred3_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 ) )
| ( X1
@ ( epred3_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 )
@ ( epred4_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ X1 )
@ X3 )
| ( X1
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] : ~ $true
@ X4 ) ),
inference(sr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_17]),c_0_18]) ).
thf(c_0_22,negated_conjecture,
( ( epred3_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : ~ $true )
= ( epred2_2
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : Z0
@ ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] : ~ $true ) ),
inference(sr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_19]),c_0_18]) ).
thf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV064^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 19:08:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running higher-order theorem proving
% 0.20/0.46 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/benchmark/theBenchmark.p
% 1.52/0.66 # Version: 3.1.0-ho
% 1.52/0.66 # Preprocessing class: HSSSSMSSSSMNHHA.
% 1.52/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.66 # Starting post_as_ho5 with 1500s (5) cores
% 1.52/0.66 # Starting sh2lt with 300s (1) cores
% 1.52/0.66 # Starting ehoh_best8_lambda with 300s (1) cores
% 1.52/0.66 # Starting post_as_ho10 with 300s (1) cores
% 1.52/0.66 # post_as_ho5 with pid 22001 completed with status 0
% 1.52/0.66 # Result found by post_as_ho5
% 1.52/0.66 # Preprocessing class: HSSSSMSSSSMNHHA.
% 1.52/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.66 # Starting post_as_ho5 with 1500s (5) cores
% 1.52/0.66 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 1.52/0.66 # Search class: HGUNF-FFMF22-SHHFFMBN
% 1.52/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.52/0.66 # Starting ehoh_best_nonlift with 811s (1) cores
% 1.52/0.66 # Starting post_as_ho5 with 151s (1) cores
% 1.52/0.66 # Starting sh2l with 136s (1) cores
% 1.52/0.66 # Starting lpo1_def_fix with 136s (1) cores
% 1.52/0.66 # Starting ehoh_best3_rw with 136s (1) cores
% 1.52/0.66 # ehoh_best3_rw with pid 22011 completed with status 0
% 1.52/0.66 # Result found by ehoh_best3_rw
% 1.52/0.66 # Preprocessing class: HSSSSMSSSSMNHHA.
% 1.52/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.66 # Starting post_as_ho5 with 1500s (5) cores
% 1.52/0.66 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 1.52/0.66 # Search class: HGUNF-FFMF22-SHHFFMBN
% 1.52/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.52/0.66 # Starting ehoh_best_nonlift with 811s (1) cores
% 1.52/0.66 # Starting post_as_ho5 with 151s (1) cores
% 1.52/0.66 # Starting sh2l with 136s (1) cores
% 1.52/0.66 # Starting lpo1_def_fix with 136s (1) cores
% 1.52/0.66 # Starting ehoh_best3_rw with 136s (1) cores
% 1.52/0.66 # Preprocessing time : 0.001 s
% 1.52/0.66 # Presaturation interreduction done
% 1.52/0.66
% 1.52/0.66 # Proof found!
% 1.52/0.66 # SZS status Theorem
% 1.52/0.66 # SZS output start CNFRefutation
% See solution above
% 1.52/0.66 # Parsed axioms : 1
% 1.52/0.66 # Removed by relevancy pruning/SinE : 0
% 1.52/0.66 # Initial clauses : 8
% 1.52/0.66 # Removed in clause preprocessing : 0
% 1.52/0.66 # Initial clauses in saturation : 8
% 1.52/0.66 # Processed clauses : 386
% 1.52/0.66 # ...of these trivial : 16
% 1.52/0.66 # ...subsumed : 98
% 1.52/0.66 # ...remaining for further processing : 272
% 1.52/0.66 # Other redundant clauses eliminated : 15
% 1.52/0.66 # Clauses deleted for lack of memory : 0
% 1.52/0.66 # Backward-subsumed : 40
% 1.52/0.66 # Backward-rewritten : 8
% 1.52/0.66 # Generated clauses : 1850
% 1.52/0.66 # ...of the previous two non-redundant : 1281
% 1.52/0.66 # ...aggressively subsumed : 0
% 1.52/0.66 # Contextual simplify-reflections : 1
% 1.52/0.66 # Paramodulations : 892
% 1.52/0.66 # Factorizations : 4
% 1.52/0.66 # NegExts : 25
% 1.52/0.66 # Equation resolutions : 15
% 1.52/0.66 # Disequality decompositions : 0
% 1.52/0.66 # Total rewrite steps : 75
% 1.52/0.66 # ...of those cached : 46
% 1.52/0.66 # Propositional unsat checks : 0
% 1.52/0.66 # Propositional check models : 0
% 1.52/0.66 # Propositional check unsatisfiable : 0
% 1.52/0.66 # Propositional clauses : 0
% 1.52/0.66 # Propositional clauses after purity: 0
% 1.52/0.66 # Propositional unsat core size : 0
% 1.52/0.66 # Propositional preprocessing time : 0.000
% 1.52/0.66 # Propositional encoding time : 0.000
% 1.52/0.66 # Propositional solver time : 0.000
% 1.52/0.66 # Success case prop preproc time : 0.000
% 1.52/0.66 # Success case prop encoding time : 0.000
% 1.52/0.66 # Success case prop solver time : 0.000
% 1.52/0.66 # Current number of processed clauses : 178
% 1.52/0.66 # Positive orientable unit clauses : 27
% 1.52/0.66 # Positive unorientable unit clauses: 5
% 1.52/0.66 # Negative unit clauses : 12
% 1.52/0.66 # Non-unit-clauses : 134
% 1.52/0.66 # Current number of unprocessed clauses: 905
% 1.52/0.66 # ...number of literals in the above : 3520
% 1.52/0.66 # Current number of archived formulas : 0
% 1.52/0.66 # Current number of archived clauses : 94
% 1.52/0.66 # Clause-clause subsumption calls (NU) : 2570
% 1.52/0.66 # Rec. Clause-clause subsumption calls : 1476
% 1.52/0.66 # Non-unit clause-clause subsumptions : 75
% 1.52/0.66 # Unit Clause-clause subsumption calls : 428
% 1.52/0.66 # Rewrite failures with RHS unbound : 0
% 1.52/0.66 # BW rewrite match attempts : 1202
% 1.52/0.66 # BW rewrite match successes : 222
% 1.52/0.66 # Condensation attempts : 0
% 1.52/0.66 # Condensation successes : 0
% 1.52/0.66 # Termbank termtop insertions : 484161
% 1.52/0.66 # Search garbage collected termcells : 256
% 1.52/0.66
% 1.52/0.66 # -------------------------------------------------
% 1.52/0.66 # User time : 0.164 s
% 1.52/0.66 # System time : 0.012 s
% 1.52/0.66 # Total time : 0.176 s
% 1.52/0.66 # Maximum resident set size: 1840 pages
% 1.52/0.66
% 1.52/0.66 # -------------------------------------------------
% 1.52/0.66 # User time : 0.853 s
% 1.52/0.66 # System time : 0.041 s
% 1.52/0.66 # Total time : 0.894 s
% 1.52/0.66 # Maximum resident set size: 1708 pages
% 1.52/0.66 % E---3.1 exiting
% 1.52/0.66 % E exiting
%------------------------------------------------------------------------------