TSTP Solution File: SEV386^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV386^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:08:17 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 46
% Number of leaves : 8
% Syntax : Number of formulae : 84 ( 7 unt; 7 typ; 0 def)
% Number of atoms : 309 ( 157 equ; 0 cnn)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 497 ( 80 ~; 161 |; 5 &; 241 @)
% ( 6 <=>; 2 =>; 0 <=; 2 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 94 ( 2 ^ 88 !; 4 ?; 94 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
p: a > $o ).
thf(decl_23,type,
esk1_1: a > a ).
thf(decl_24,type,
esk2_0: a ).
thf(decl_25,type,
esk3_0: a ).
thf(decl_26,type,
esk4_1: a > a ).
thf(decl_27,type,
esk5_1: a > a ).
thf(cTTTP5306A_pme,conjecture,
( ? [X1: a] :
( p
= ( ^ [X2: a,X1: a] : ( X2 = X1 )
@ X1 ) )
<=> ? [X1: a] :
( ( p @ X1 )
& ! [X3: a] :
( ( p @ X3 )
=> ( X1 = X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTTTP5306A_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ? [X1: a] :
( p
= ( $eq @ X1 ) )
<=> ? [X1: a] :
( ( p @ X1 )
& ! [X3: a] :
( ( p @ X3 )
=> ( X1 = X3 ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTTTP5306A_pme])])]) ).
thf(c_0_2,negated_conjecture,
! [X7: a,X8: a,X12: a] :
( ( ( p @ ( esk1_1 @ X8 ) )
| ~ ( p @ X8 )
| ( p
!= ( $eq @ X7 ) ) )
& ( ( X8
!= ( esk1_1 @ X8 ) )
| ~ ( p @ X8 )
| ( p
!= ( $eq @ X7 ) ) )
& ( ( p @ esk3_0 )
| ( p
= ( $eq @ esk2_0 ) ) )
& ( ~ ( p @ X12 )
| ( esk3_0 = X12 )
| ( p
= ( $eq @ 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,
( ( p @ esk3_0 )
| ( p
= ( $eq @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X13: a] :
( ( ( esk2_0 = X13 )
<=> ( p @ X13 ) )
| ( p @ esk3_0 ) ),
inference(arg_cong,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: a,X2: a] :
( ( p @ ( esk1_1 @ X1 ) )
| ~ ( p @ X1 )
| ( p
!= ( $eq @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X1: a] :
( ( esk2_0 = X1 )
| ( p @ esk3_0 )
| ~ ( p @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: a] :
( ( p @ ( esk1_1 @ X1 ) )
| ( p @ esk3_0 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_3]) ).
thf(c_0_8,negated_conjecture,
! [X1: a] :
( ( esk3_0 = X1 )
| ( p
= ( $eq @ esk2_0 ) )
| ~ ( p @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X1: a,X2: a] :
( ( X1
!= ( esk1_1 @ X1 ) )
| ~ ( p @ X1 )
| ( p
!= ( $eq @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X1: a] :
( ( ( esk1_1 @ X1 )
= esk2_0 )
| ( p @ esk3_0 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( p @ esk3_0 )
| ( p @ esk2_0 ) ),
inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]) ).
thf(c_0_12,negated_conjecture,
! [X14: a,X1: a] :
( ( ( esk2_0 = X14 )
<=> ( p @ X14 ) )
| ( esk3_0 = X1 )
| ~ ( p @ X1 ) ),
inference(arg_cong,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
! [X1: a] :
( ( p @ esk3_0 )
| ( ( $eq @ X1 )
!= p ) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10])]),c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X2: a,X1: a] :
( ( esk3_0 = X1 )
| ( esk2_0 = X2 )
| ~ ( p @ X2 )
| ~ ( p @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
p @ esk3_0,
inference(spm,[status(thm)],[c_0_13,c_0_3]) ).
thf(c_0_16,negated_conjecture,
! [X2: a,X1: a] :
( ( p @ ( esk1_1 @ X1 ) )
| ( ( X2
= ( esk5_1 @ X2 ) )
<~> ( p @ ( esk5_1 @ X2 ) ) )
| ~ ( p @ X1 ) ),
inference(neg_ext,[status(thm)],[c_0_5]) ).
thf(c_0_17,negated_conjecture,
! [X1: a] :
( ( esk3_0 = esk2_0 )
| ( esk3_0 = X1 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,negated_conjecture,
! [X1: a,X2: a] :
( ( ( esk5_1 @ X1 )
= X1 )
| ( p @ ( esk1_1 @ X2 ) )
| ( p @ ( esk5_1 @ X1 ) )
| ~ ( p @ X2 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X2: a,X1: a] :
( ( ( esk1_1 @ X1 )
= esk3_0 )
| ( ( esk5_1 @ X2 )
= X2 )
| ( esk3_0 = esk2_0 )
| ( p @ ( esk5_1 @ X2 ) )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_20,negated_conjecture,
! [X1: a,X2: a] :
( ( ( X1
= ( esk4_1 @ X1 ) )
<~> ( p @ ( esk4_1 @ X1 ) ) )
| ( ( esk1_1 @ X2 )
!= X2 )
| ~ ( p @ X2 ) ),
inference(neg_ext,[status(thm)],[c_0_9]) ).
thf(c_0_21,negated_conjecture,
! [X2: a,X1: a] :
( ( ( esk1_1 @ X1 )
= esk3_0 )
| ( ( esk5_1 @ X2 )
= esk3_0 )
| ( ( esk5_1 @ X2 )
= X2 )
| ( esk3_0 = esk2_0 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X1: a,X2: a] :
( ( ( esk4_1 @ X1 )
= X1 )
| ( p @ ( esk4_1 @ X1 ) )
| ( ( esk1_1 @ X2 )
!= X2 )
| ~ ( p @ X2 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_20]) ).
thf(c_0_23,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk3_0 )
= esk3_0 )
| ( ( esk1_1 @ X1 )
= esk3_0 )
| ( esk3_0 = esk2_0 )
| ~ ( p @ X1 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_21])]) ).
thf(c_0_24,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk3_0 )
= esk3_0 )
| ( esk3_0 = esk2_0 )
| ( ( esk4_1 @ X1 )
= X1 )
| ( p @ ( esk4_1 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23])]),c_0_15])]) ).
thf(c_0_25,negated_conjecture,
! [X1: a,X2: a] :
( ( ( esk4_1 @ X1 )
!= X1 )
| ( ( esk1_1 @ X2 )
!= X2 )
| ~ ( p @ ( esk4_1 @ X1 ) )
| ~ ( p @ X2 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_20]) ).
thf(c_0_26,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk3_0 )
= esk3_0 )
| ( ( esk4_1 @ X1 )
= esk3_0 )
| ( ( esk4_1 @ X1 )
= X1 )
| ( esk3_0 = esk2_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
thf(c_0_27,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk3_0 )
= esk3_0 )
| ( esk3_0 = esk2_0 )
| ( ( esk4_1 @ X1 )
!= X1 )
| ~ ( p @ ( esk4_1 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23])]),c_0_15])]) ).
thf(c_0_28,negated_conjecture,
( ( ( esk4_1 @ esk3_0 )
= esk3_0 )
| ( ( esk5_1 @ esk3_0 )
= esk3_0 )
| ( esk3_0 = esk2_0 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_26])]) ).
thf(c_0_29,negated_conjecture,
! [X2: a,X1: a] :
( ( p @ ( esk1_1 @ X1 ) )
| ( ( esk5_1 @ X2 )
!= X2 )
| ~ ( p @ ( esk5_1 @ X2 ) )
| ~ ( p @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_16]) ).
thf(c_0_30,negated_conjecture,
( ( ( esk5_1 @ esk3_0 )
= esk3_0 )
| ( esk3_0 = esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_15])]) ).
thf(c_0_31,negated_conjecture,
! [X1: a] :
( ( esk3_0 = esk2_0 )
| ( p @ ( esk1_1 @ X1 ) )
| ~ ( p @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_15])]) ).
thf(c_0_32,negated_conjecture,
! [X1: a] :
( ( ( esk1_1 @ X1 )
= esk3_0 )
| ( esk3_0 = esk2_0 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_31]) ).
thf(c_0_33,negated_conjecture,
! [X1: a] :
( ( esk3_0 = esk2_0 )
| ( ( esk4_1 @ X1 )
= X1 )
| ( p @ ( esk4_1 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32])]),c_0_15])]) ).
thf(c_0_34,negated_conjecture,
! [X1: a] :
( ( ( esk4_1 @ X1 )
= esk3_0 )
| ( ( esk4_1 @ X1 )
= X1 )
| ( esk3_0 = esk2_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
thf(c_0_35,negated_conjecture,
! [X1: a] :
( ( esk3_0 = esk2_0 )
| ( ( esk4_1 @ X1 )
!= X1 )
| ~ ( p @ ( esk4_1 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_32])]),c_0_15])]) ).
thf(c_0_36,negated_conjecture,
( ( ( esk4_1 @ esk3_0 )
= esk3_0 )
| ( esk3_0 = esk2_0 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_34])]) ).
thf(c_0_37,negated_conjecture,
esk3_0 = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_15])]) ).
thf(c_0_38,negated_conjecture,
! [X2: a,X1: a] :
( ( ( $eq @ esk2_0 )
= p )
| ( ( esk1_1 @ X1 )
= esk3_0 )
| ( ( esk5_1 @ X2 )
= X2 )
| ( p @ ( esk5_1 @ X2 ) )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
thf(c_0_39,negated_conjecture,
! [X1: a] :
( ( ( $eq @ esk2_0 )
= p )
| ( esk2_0 = X1 )
| ~ ( p @ X1 ) ),
inference(rw,[status(thm)],[c_0_8,c_0_37]) ).
thf(c_0_40,negated_conjecture,
! [X2: a,X1: a] :
( ( ( $eq @ esk2_0 )
= p )
| ( ( esk1_1 @ X1 )
= esk2_0 )
| ( ( esk5_1 @ X2 )
= X2 )
| ( p @ ( esk5_1 @ X2 ) )
| ~ ( p @ X1 ) ),
inference(rw,[status(thm)],[c_0_38,c_0_37]) ).
thf(c_0_41,negated_conjecture,
! [X2: a,X1: a] :
( ( ( $eq @ esk2_0 )
= p )
| ( ( esk1_1 @ X1 )
= esk2_0 )
| ( ( esk5_1 @ X2 )
= esk2_0 )
| ( ( esk5_1 @ X2 )
= X2 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_42,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( $eq @ esk2_0 )
= p )
| ( ( esk1_1 @ X1 )
= esk2_0 )
| ~ ( p @ X1 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_41])]) ).
thf(c_0_43,negated_conjecture,
p @ esk2_0,
inference(rw,[status(thm)],[c_0_15,c_0_37]) ).
thf(c_0_44,negated_conjecture,
! [X1: a] :
( ( ( $eq @ esk2_0 )
= p )
| ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( $eq @ X1 )
!= p ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_42])]),c_0_43])]) ).
thf(c_0_45,negated_conjecture,
! [X1: a] :
( ( ( $eq @ esk2_0 )
= p )
| ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( esk4_1 @ X1 )
= X1 )
| ( p @ ( esk4_1 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_42])]),c_0_43])]) ).
thf(c_0_46,negated_conjecture,
! [X46: a,X1: a] :
( ( ( esk2_0 = X46 )
<=> ( p @ X46 ) )
| ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( $eq @ X1 )
!= p ) ),
inference(arg_cong,[status(thm)],[c_0_44]) ).
thf(c_0_47,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( $eq @ esk2_0 )
= p )
| ( ( esk4_1 @ X1 )
= esk2_0 )
| ( ( esk4_1 @ X1 )
= X1 ) ),
inference(spm,[status(thm)],[c_0_39,c_0_45]) ).
thf(c_0_48,negated_conjecture,
! [X2: a,X1: a] :
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( esk2_0 = X1 )
| ( ( $eq @ X2 )
!= p )
| ~ ( p @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_46]) ).
thf(c_0_49,negated_conjecture,
( ( ( esk4_1 @ esk2_0 )
= esk2_0 )
| ( ( $eq @ esk2_0 )
= p )
| ( ( esk5_1 @ esk2_0 )
= esk2_0 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_47])]) ).
thf(c_0_50,negated_conjecture,
! [X1: a] :
( ( ( esk4_1 @ esk2_0 )
= esk2_0 )
| ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( esk2_0 = X1 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
thf(c_0_51,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( esk4_1 @ esk2_0 )
= esk2_0 )
| ( p @ ( esk1_1 @ X1 ) )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_49]) ).
thf(c_0_52,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( esk4_1 @ esk2_0 )
= esk2_0 )
| ( ( esk1_1 @ X1 )
= esk2_0 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
thf(c_0_53,negated_conjecture,
! [X45: a,X1: a] :
( ( ( esk2_0 = X45 )
<=> ( p @ X45 ) )
| ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( esk1_1 @ X1 )
= esk2_0 )
| ~ ( p @ X1 ) ),
inference(arg_cong,[status(thm)],[c_0_42]) ).
thf(c_0_54,negated_conjecture,
! [X1: a] :
( ( ( esk4_1 @ esk2_0 )
= esk2_0 )
| ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( $eq @ X1 )
!= p ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_52])]),c_0_43])]) ).
thf(c_0_55,negated_conjecture,
! [X2: a,X1: a] :
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( esk1_1 @ X1 )
= esk2_0 )
| ( esk2_0 = X2 )
| ~ ( p @ X2 )
| ~ ( p @ X1 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_53]) ).
thf(c_0_56,negated_conjecture,
! [X1: a] :
( ( ( $eq @ esk2_0 )
= p )
| ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( esk4_1 @ X1 )
!= X1 )
| ~ ( p @ ( esk4_1 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_42])]),c_0_43])]) ).
thf(c_0_57,negated_conjecture,
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( esk4_1 @ esk2_0 )
= esk2_0 ) ),
inference(spm,[status(thm)],[c_0_54,c_0_49]) ).
thf(c_0_58,negated_conjecture,
! [X2: a,X1: a] :
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( esk2_0 = X1 )
| ( ( esk4_1 @ X2 )
!= X2 )
| ~ ( p @ ( esk4_1 @ X2 ) )
| ~ ( p @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_55])]),c_0_43])]) ).
thf(c_0_59,negated_conjecture,
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( $eq @ esk2_0 )
= p ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_43])]) ).
thf(c_0_60,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( esk2_0 = X1 )
| ~ ( p @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_57]),c_0_43])]) ).
thf(c_0_61,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( p @ ( esk1_1 @ X1 ) )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_59]) ).
thf(c_0_62,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( esk1_1 @ X1 )
= esk2_0 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
thf(c_0_63,negated_conjecture,
! [X1: a] :
( ( ( esk5_1 @ esk2_0 )
= esk2_0 )
| ( ( $eq @ X1 )
!= p ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_62])]),c_0_43])]) ).
thf(c_0_64,negated_conjecture,
( ( esk5_1 @ esk2_0 )
= esk2_0 ),
inference(spm,[status(thm)],[c_0_63,c_0_59]) ).
thf(c_0_65,negated_conjecture,
! [X1: a,X2: a] :
( ( esk2_0 = X1 )
| ( esk2_0 = X2 )
| ~ ( p @ X1 )
| ~ ( p @ X2 ) ),
inference(rw,[status(thm)],[c_0_14,c_0_37]) ).
thf(c_0_66,negated_conjecture,
! [X1: a] :
( ( p @ ( esk1_1 @ X1 ) )
| ~ ( p @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_64]),c_0_43])]) ).
thf(c_0_67,negated_conjecture,
! [X2: a,X1: a] :
( ( ( esk1_1 @ X1 )
= esk2_0 )
| ( esk2_0 = X2 )
| ~ ( p @ X2 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
thf(c_0_68,negated_conjecture,
! [X2: a,X1: a] :
( ( ( esk1_1 @ X1 )
= esk2_0 )
| ( ( esk1_1 @ X2 )
= esk2_0 )
| ~ ( p @ X2 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_67,c_0_66]) ).
thf(c_0_69,negated_conjecture,
! [X1: a] :
( ( ( esk1_1 @ X1 )
= esk2_0 )
| ~ ( p @ X1 ) ),
inference(ef,[status(thm)],[c_0_68]) ).
thf(c_0_70,negated_conjecture,
! [X1: a] :
( ( $eq @ X1 )
!= p ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_69])]),c_0_43])]) ).
thf(c_0_71,negated_conjecture,
! [X1: a] :
( ( esk2_0 = X1 )
| ~ ( p @ X1 ) ),
inference(spm,[status(thm)],[c_0_70,c_0_39]) ).
thf(c_0_72,negated_conjecture,
! [X1: a] :
( ( ( esk4_1 @ X1 )
= X1 )
| ( p @ ( esk4_1 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_69])]),c_0_43])]) ).
thf(c_0_73,negated_conjecture,
! [X1: a] :
( ( ( esk4_1 @ X1 )
= esk2_0 )
| ( ( esk4_1 @ X1 )
= X1 ) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
thf(c_0_74,negated_conjecture,
! [X1: a] :
( ( ( esk4_1 @ X1 )
!= X1 )
| ~ ( p @ ( esk4_1 @ X1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_69])]),c_0_43])]) ).
thf(c_0_75,negated_conjecture,
( ( esk4_1 @ esk2_0 )
= esk2_0 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_73])]) ).
thf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV386^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 18:25:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.45 Running higher-order theorem proving
% 0.19/0.45 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
% 0.19/0.49 # Version: 3.1.0-ho
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # ehoh_best_nonlift_nonlambdatoforall with pid 12132 completed with status 0
% 0.19/0.49 # Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: HGHSF-FFSF11-SSSFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.49 # Starting new_bool_2 with 136s (1) cores
% 0.19/0.49 # Starting new_bool_9 with 136s (1) cores
% 0.19/0.49 # new_bool_2 with pid 12142 completed with status 0
% 0.19/0.49 # Result found by new_bool_2
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: HGHSF-FFSF11-SSSFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.49 # Starting new_bool_2 with 136s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 3
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 6
% 0.19/0.49 # Removed in clause preprocessing : 2
% 0.19/0.49 # Initial clauses in saturation : 4
% 0.19/0.49 # Processed clauses : 221
% 0.19/0.49 # ...of these trivial : 6
% 0.19/0.49 # ...subsumed : 71
% 0.19/0.49 # ...remaining for further processing : 144
% 0.19/0.49 # Other redundant clauses eliminated : 98
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 59
% 0.19/0.49 # Backward-rewritten : 39
% 0.19/0.49 # Generated clauses : 748
% 0.19/0.49 # ...of the previous two non-redundant : 557
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 4
% 0.19/0.49 # Paramodulations : 537
% 0.19/0.49 # Factorizations : 14
% 0.19/0.49 # NegExts : 20
% 0.19/0.49 # Equation resolutions : 98
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 220
% 0.19/0.49 # ...of those cached : 216
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 14
% 0.19/0.49 # Positive orientable unit clauses : 4
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 1
% 0.19/0.49 # Non-unit-clauses : 9
% 0.19/0.49 # Current number of unprocessed clauses: 123
% 0.19/0.49 # ...number of literals in the above : 662
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 130
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 491
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 301
% 0.19/0.49 # Non-unit clause-clause subsumptions : 129
% 0.19/0.49 # Unit Clause-clause subsumption calls : 12
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 4
% 0.19/0.49 # BW rewrite match successes : 4
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 33952
% 0.19/0.49 # Search garbage collected termcells : 150
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.029 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.031 s
% 0.19/0.49 # Maximum resident set size: 1808 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.130 s
% 0.19/0.49 # System time : 0.008 s
% 0.19/0.49 # Total time : 0.138 s
% 0.19/0.49 # Maximum resident set size: 1712 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------