TSTP Solution File: PHI005^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PHI005^4 : TPTP v8.2.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 02:18:06 EDT 2024
% Result : Theorem 18.75s 2.82s
% Output : CNFRefutation 18.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 35
% Syntax : Number of formulae : 119 ( 31 unt; 25 typ; 0 def)
% Number of atoms : 222 ( 27 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 809 ( 122 ~; 86 |; 12 &; 570 @)
% ( 3 <=>; 15 =>; 0 <=; 1 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 192 ( 192 >; 0 *; 0 +; 0 <<)
% Number of symbols : 26 ( 23 usr; 10 con; 0-5 aty)
% Number of variables : 286 ( 95 ^ 187 !; 4 ?; 286 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
qML_mu: $tType ).
thf(decl_sort2,type,
qML_i: $tType ).
thf(decl_22,type,
scott_G: qML_mu > qML_i > $o ).
thf(decl_23,type,
scott_NE_QML_mu: qML_mu > qML_i > $o ).
thf(decl_24,type,
scott_P: ( qML_mu > qML_i > $o ) > qML_i > $o ).
thf(decl_25,type,
scott_ess_QML_mu: ( qML_mu > qML_i > $o ) > qML_mu > qML_i > $o ).
thf(decl_26,type,
epred1_2: qML_mu > qML_i > qML_mu > qML_i > $o ).
thf(decl_27,type,
esk1_3: qML_i > ( qML_mu > qML_i > $o ) > ( qML_mu > qML_i > $o ) > qML_i ).
thf(decl_28,type,
esk2_3: qML_i > ( qML_mu > qML_i > $o ) > ( qML_mu > qML_i > $o ) > qML_mu ).
thf(decl_29,type,
epred2_3: ( qML_mu > qML_i > $o ) > qML_mu > qML_i > qML_mu > qML_i > $o ).
thf(decl_30,type,
esk3_3: ( qML_mu > qML_i > $o ) > qML_mu > qML_i > qML_i ).
thf(decl_31,type,
esk4_3: ( qML_mu > qML_i > $o ) > qML_mu > qML_i > qML_mu ).
thf(decl_32,type,
esk5_4: qML_mu > qML_i > ( qML_mu > qML_i > $o ) > qML_i > qML_mu ).
thf(decl_33,type,
epred3_2: qML_mu > qML_i > qML_mu > qML_i > $o ).
thf(decl_34,type,
esk6_2: qML_mu > qML_i > qML_i ).
thf(decl_35,type,
esk7_0: qML_i ).
thf(decl_72,type,
esk44_0: qML_mu ).
thf(decl_74,type,
esk46_0: qML_i ).
thf(decl_85,type,
esk57_0: qML_mu ).
thf(decl_87,type,
esk59_0: qML_i ).
thf(decl_113,type,
esk85_1: ( qML_mu > qML_i > $o ) > qML_mu ).
thf(decl_114,type,
esk86_1: ( qML_mu > qML_i > $o ) > qML_i ).
thf(decl_475,type,
esk447_0: qML_mu ).
thf(decl_477,type,
esk449_0: qML_i ).
thf(decl_1344,type,
esk1316_0: qML_i ).
thf(fact_7_A1a,axiom,
! [X5: qML_i,X6: qML_mu > qML_i > $o] :
( ( scott_P
@ ^ [X15: qML_mu,X8: qML_i] :
~ ( X6 @ X15 @ X8 )
@ X5 )
=> ~ ( scott_P @ X6 @ X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_7_A1a) ).
thf(fact_4_A2,axiom,
! [X5: qML_i,X6: qML_mu > qML_i > $o,X9: qML_mu > qML_i > $o] :
( ( ( scott_P @ X6 @ X5 )
& ! [X10: qML_i,X11: qML_mu] :
( ( X6 @ X11 @ X10 )
=> ( X9 @ X11 @ X10 ) ) )
=> ( scott_P @ X9 @ X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4_A2) ).
thf(fact_1_A3,axiom,
! [X4: qML_i] : ( scott_P @ scott_G @ X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_A3) ).
thf(fact_3_A1b,axiom,
! [X5: qML_i,X6: qML_mu > qML_i > $o] :
( ~ ( scott_P @ X6 @ X5 )
=> ( scott_P
@ ^ [X7: qML_mu,X8: qML_i] :
~ ( X6 @ X7 @ X8 )
@ X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_A1b) ).
thf(fact_0_G__def,axiom,
( scott_G
= ( ^ [X1: qML_mu,X2: qML_i] :
! [X3: qML_mu > qML_i > $o] :
( ( scott_P @ X3 @ X2 )
=> ( X3 @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_G__def) ).
thf(fact_2_A4,axiom,
! [X5: qML_i,X6: qML_mu > qML_i > $o] :
( ( scott_P @ X6 @ X5 )
=> ! [X4: qML_i] : ( scott_P @ X6 @ X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_A4) ).
thf(fact_6_ess__def,axiom,
( scott_ess_QML_mu
= ( ^ [X12: qML_mu > qML_i > $o,X1: qML_mu,X2: qML_i] :
( ( X12 @ X1 @ X2 )
& ! [X3: qML_mu > qML_i > $o] :
( ( X3 @ X1 @ X2 )
=> ! [X13: qML_i,X14: qML_mu] :
( ( X12 @ X14 @ X13 )
=> ( X3 @ X14 @ X13 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6_ess__def) ).
thf(fact_5_A5,axiom,
! [X4: qML_i] : ( scott_P @ scott_NE_QML_mu @ X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_A5) ).
thf(fact_8_NE__def,axiom,
( scott_NE_QML_mu
= ( ^ [X1: qML_mu,X2: qML_i] :
! [X3: qML_mu > qML_i > $o] :
( ( scott_ess_QML_mu @ X3 @ X1 @ X2 )
=> ! [X13: qML_i] :
? [X16: qML_mu] : ( X3 @ X16 @ X13 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_8_NE__def) ).
thf(conj_0,conjecture,
! [X17: qML_i,X10: qML_i] :
? [X18: qML_mu] : ( scott_G @ X18 @ X10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(c_0_10,plain,
! [X5: qML_i,X6: qML_mu > qML_i > $o] :
( ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X6 @ Z0 @ Z1 )
@ X5 )
=> ~ ( scott_P @ X6 @ X5 ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_7_A1a])]) ).
thf(c_0_11,plain,
! [X55: qML_i,X56: qML_mu > qML_i > $o,X57: qML_mu > qML_i > $o] :
( ( ( X56 @ ( esk2_3 @ X55 @ X56 @ X57 ) @ ( esk1_3 @ X55 @ X56 @ X57 ) )
| ~ ( scott_P @ X56 @ X55 )
| ( scott_P @ X57 @ X55 ) )
& ( ~ ( X57 @ ( esk2_3 @ X55 @ X56 @ X57 ) @ ( esk1_3 @ X55 @ X56 @ X57 ) )
| ~ ( scott_P @ X56 @ X55 )
| ( scott_P @ X57 @ X55 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_4_A2])])])])]) ).
thf(c_0_12,plain,
! [X73: qML_i,X74: qML_mu > qML_i > $o] :
( ~ ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X74 @ Z0 @ Z1 )
@ X73 )
| ~ ( scott_P @ X74 @ X73 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
thf(c_0_13,plain,
! [X6: qML_mu > qML_i > $o,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( scott_P @ X3 @ X2 )
| ~ ( X3 @ ( esk2_3 @ X2 @ X6 @ X3 ) @ ( esk1_3 @ X2 @ X6 @ X3 ) )
| ~ ( scott_P @ X6 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,plain,
! [X3: qML_mu > qML_i > $o,X2: qML_i] :
( ~ ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 )
@ X2 )
| ~ ( scott_P @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,plain,
! [X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] : $true
@ X2 )
| ~ ( scott_P @ X3 @ X2 ) ),
inference(primitive_enumeration,[status(thm)],[c_0_13]) ).
thf(c_0_16,plain,
! [X49: qML_i] : ( scott_P @ scott_G @ X49 ),
inference(variable_rename,[status(thm)],[fact_1_A3]) ).
thf(c_0_17,plain,
! [X5: qML_i,X6: qML_mu > qML_i > $o] :
( ~ ( scott_P @ X6 @ X5 )
=> ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X6 @ Z0 @ Z1 )
@ X5 ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_3_A1b])]) ).
thf(c_0_18,plain,
! [X6: qML_mu > qML_i > $o,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 ) )
!= ( ^ [Z0: qML_mu,Z1: qML_i] : $true ) )
| ~ ( scott_P @ X3 @ X2 )
| ~ ( scott_P @ X6 @ X2 ) ),
inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_14,c_0_15])]) ).
thf(c_0_19,plain,
! [X2: qML_i] : ( scott_P @ scott_G @ X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_20,plain,
! [X53: qML_i,X54: qML_mu > qML_i > $o] :
( ( scott_P @ X54 @ X53 )
| ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X54 @ Z0 @ Z1 )
@ X53 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
thf(c_0_21,plain,
! [X36: qML_mu,X37: qML_i] :
( ( scott_G @ X36 @ X37 )
<=> ! [X3: qML_mu > qML_i > $o] :
( ( scott_P @ X3 @ X37 )
=> ( X3 @ X36 @ X37 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_0_G__def])]) ).
thf(c_0_22,plain,
! [X50: qML_i,X51: qML_mu > qML_i > $o,X52: qML_i] :
( ~ ( scott_P @ X51 @ X50 )
| ( scott_P @ X51 @ X52 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2_A4])])])]) ).
thf(c_0_23,plain,
! [X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( scott_G @ Z0 @ Z1 ) )
!= ( ^ [Z0: qML_mu,Z1: qML_i] : $true ) )
| ~ ( scott_P @ X3 @ X2 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_24,plain,
! [X38: qML_mu > qML_i > $o,X39: qML_mu,X40: qML_i] :
( ( scott_ess_QML_mu @ X38 @ X39 @ X40 )
<=> ( ( X38 @ X39 @ X40 )
& ! [X3: qML_mu > qML_i > $o] :
( ( X3 @ X39 @ X40 )
=> ! [X13: qML_i,X14: qML_mu] :
( ( X38 @ X14 @ X13 )
=> ( X3 @ X14 @ X13 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_6_ess__def])]) ).
thf(c_0_25,plain,
! [X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( scott_P @ X3 @ X2 )
| ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 )
@ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_26,plain,
! [X60: qML_i] : ( scott_P @ scott_NE_QML_mu @ X60 ),
inference(variable_rename,[status(thm)],[fact_5_A5]) ).
thf(c_0_27,plain,
! [X43: qML_mu,X44: qML_i,X45: qML_mu > qML_i > $o,X46: qML_mu,X47: qML_i] :
( ( ~ ( scott_G @ X43 @ X44 )
| ~ ( scott_P @ X45 @ X44 )
| ( X45 @ X43 @ X44 ) )
& ( ( scott_P @ ( epred1_2 @ X46 @ X47 ) @ X47 )
| ( scott_G @ X46 @ X47 ) )
& ( ~ ( epred1_2 @ X46 @ X47 @ X46 @ X47 )
| ( scott_G @ X46 @ X47 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])])])]) ).
thf(c_0_28,plain,
! [X4: qML_i,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( scott_P @ X3 @ X4 )
| ~ ( scott_P @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_29,plain,
! [X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( ( ^ [Z0: qML_i] :
~ ( scott_G @ esk57_0 @ Z0 ) )
!= ( ^ [Z0: qML_i] : $true ) )
| ~ ( scott_P @ X3 @ X2 ) ),
inference(neg_ext,[status(thm)],[c_0_23]) ).
thf(c_0_30,plain,
! [X61: qML_mu > qML_i > $o,X62: qML_mu,X63: qML_i,X64: qML_mu > qML_i > $o,X65: qML_i,X66: qML_mu,X67: qML_mu > qML_i > $o,X68: qML_mu,X69: qML_i] :
( ( ( X61 @ X62 @ X63 )
| ~ ( scott_ess_QML_mu @ X61 @ X62 @ X63 ) )
& ( ~ ( X64 @ X62 @ X63 )
| ~ ( X61 @ X66 @ X65 )
| ( X64 @ X66 @ X65 )
| ~ ( scott_ess_QML_mu @ X61 @ X62 @ X63 ) )
& ( ( epred2_3 @ X67 @ X68 @ X69 @ X68 @ X69 )
| ~ ( X67 @ X68 @ X69 )
| ( scott_ess_QML_mu @ X67 @ X68 @ X69 ) )
& ( ( X67 @ ( esk4_3 @ X67 @ X68 @ X69 ) @ ( esk3_3 @ X67 @ X68 @ X69 ) )
| ~ ( X67 @ X68 @ X69 )
| ( scott_ess_QML_mu @ X67 @ X68 @ X69 ) )
& ( ~ ( epred2_3 @ X67 @ X68 @ X69 @ ( esk4_3 @ X67 @ X68 @ X69 ) @ ( esk3_3 @ X67 @ X68 @ X69 ) )
| ~ ( X67 @ X68 @ X69 )
| ( scott_ess_QML_mu @ X67 @ X68 @ X69 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])])])]) ).
thf(c_0_31,plain,
! [X6: qML_mu > qML_i > $o,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 )
@ X2 )
| ( ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 ) )
!= ( ^ [Z0: qML_mu,Z1: qML_i] : $true ) )
| ~ ( scott_P @ X6 @ X2 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
thf(c_0_32,plain,
! [X2: qML_i] : ( scott_P @ scott_NE_QML_mu @ X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_33,plain,
! [X1: qML_mu,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( X3 @ X1 @ X2 )
| ~ ( scott_G @ X1 @ X2 )
| ~ ( scott_P @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_34,plain,
! [X2: qML_i,X3: qML_mu > qML_i > $o,X4: qML_i] :
( ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 )
@ X2 )
| ( scott_P @ X3 @ X4 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
thf(c_0_35,plain,
! [X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( scott_G @ esk57_0 @ esk59_0 )
| ~ ( scott_P @ X3 @ X2 ) ),
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_29])]) ).
thf(c_0_36,plain,
! [X1: qML_mu,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( X3 @ X1 @ X2 )
| ~ ( scott_ess_QML_mu @ X3 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_37,plain,
! [X2: qML_i,X3: qML_mu > qML_i > $o] :
( ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 )
@ X2 )
| ( ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 ) )
!= ( ^ [Z0: qML_mu,Z1: qML_i] : $true ) ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_38,plain,
! [X1: qML_mu,X3: qML_mu > qML_i > $o,X2: qML_i,X4: qML_i] :
( ( scott_P @ X3 @ X2 )
| ~ ( scott_G @ X1 @ X4 )
| ~ ( X3 @ X1 @ X4 ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34])]) ).
thf(c_0_39,plain,
scott_G @ esk57_0 @ esk59_0,
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
thf(c_0_40,plain,
! [X1: qML_mu,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( epred2_3 @ X3 @ X1 @ X2 @ X1 @ X2 )
| ( scott_ess_QML_mu @ X3 @ X1 @ X2 )
| ~ ( X3 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_41,plain,
! [X1: qML_mu,X2: qML_i] :
~ ( scott_ess_QML_mu
@ ^ [Z0: qML_mu,Z1: qML_i] : ~ $true
@ X1
@ X2 ),
inference(primitive_enumeration,[status(thm)],[c_0_36]) ).
thf(c_0_42,plain,
! [X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( X3 @ ( esk85_1 @ X3 ) @ ( esk86_1 @ X3 ) )
| ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 )
@ X2 ) ),
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_37])]) ).
thf(c_0_43,plain,
! [X2: qML_i,X3: qML_mu > qML_i > $o] :
( ( scott_P @ X3 @ X2 )
| ~ ( X3 @ esk57_0 @ esk59_0 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
thf(c_0_44,plain,
( ( epred2_3 @ scott_G @ esk57_0 @ esk59_0 @ esk57_0 @ esk59_0 )
| ( scott_ess_QML_mu @ scott_G @ esk57_0 @ esk59_0 ) ),
inference(spm,[status(thm)],[c_0_40,c_0_39]) ).
thf(c_0_45,plain,
! [X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 ) )
!= scott_G )
| ~ ( scott_P @ X3 @ X2 ) ),
inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_14,c_0_19])]) ).
thf(c_0_46,plain,
! [X2: qML_i] :
( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( scott_ess_QML_mu
@ ^ [Z2: qML_mu,Z3: qML_i] : ~ $true
@ Z0
@ Z1 )
@ X2 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
thf(c_0_47,plain,
! [X2: qML_i] :
( ( scott_P @ ( epred2_3 @ scott_G @ esk57_0 @ esk59_0 ) @ X2 )
| ( scott_ess_QML_mu @ scott_G @ esk57_0 @ esk59_0 ) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
thf(c_0_48,plain,
! [X1: qML_mu,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( X3 @ ( esk4_3 @ X3 @ X1 @ X2 ) @ ( esk3_3 @ X3 @ X1 @ X2 ) )
| ( scott_ess_QML_mu @ X3 @ X1 @ X2 )
| ~ ( X3 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_49,plain,
( ( ^ [Z0: qML_mu,Z1: qML_i] :
( scott_ess_QML_mu
@ ^ [Z2: qML_mu,Z3: qML_i] : ~ $true
@ Z0
@ Z1 ) )
!= scott_G ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46])]) ).
thf(c_0_50,plain,
! [X1: qML_mu,X2: qML_i] :
( ( epred2_3 @ scott_G @ esk57_0 @ esk59_0 @ X1 @ X2 )
| ( scott_ess_QML_mu @ scott_G @ esk57_0 @ esk59_0 )
| ~ ( scott_G @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_47]) ).
thf(c_0_51,plain,
( ( scott_G @ ( esk4_3 @ scott_G @ esk57_0 @ esk59_0 ) @ ( esk3_3 @ scott_G @ esk57_0 @ esk59_0 ) )
| ( scott_ess_QML_mu @ scott_G @ esk57_0 @ esk59_0 ) ),
inference(spm,[status(thm)],[c_0_48,c_0_39]) ).
thf(c_0_52,plain,
( ( scott_ess_QML_mu
@ ^ [Z0: qML_mu,Z1: qML_i] : ~ $true
@ esk447_0 )
!= ( scott_G @ esk447_0 ) ),
inference(neg_ext,[status(thm)],[c_0_49]) ).
thf(c_0_53,plain,
! [X1: qML_mu,X3: qML_mu > qML_i > $o,X7: qML_mu,X6: qML_mu > qML_i > $o,X4: qML_i,X2: qML_i] :
( ( X3 @ X7 @ X4 )
| ~ ( X3 @ X1 @ X2 )
| ~ ( X6 @ X7 @ X4 )
| ~ ( scott_ess_QML_mu @ X6 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_54,plain,
! [X1: qML_mu,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( scott_ess_QML_mu @ X3 @ X1 @ X2 )
| ~ ( epred2_3 @ X3 @ X1 @ X2 @ ( esk4_3 @ X3 @ X1 @ X2 ) @ ( esk3_3 @ X3 @ X1 @ X2 ) )
| ~ ( X3 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_55,plain,
( ( epred2_3 @ scott_G @ esk57_0 @ esk59_0 @ ( esk4_3 @ scott_G @ esk57_0 @ esk59_0 ) @ ( esk3_3 @ scott_G @ esk57_0 @ esk59_0 ) )
| ( scott_ess_QML_mu @ scott_G @ esk57_0 @ esk59_0 ) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
thf(c_0_56,plain,
( ( scott_ess_QML_mu
@ ^ [Z0: qML_mu,Z1: qML_i] : ~ $true
@ esk447_0
@ esk449_0 )
<~> ( scott_G @ esk447_0 @ esk449_0 ) ),
inference(neg_ext,[status(thm)],[c_0_52]) ).
thf(c_0_57,plain,
! [X1: qML_mu,X2: qML_i,X3: qML_mu > qML_i > $o,X7: qML_mu,X4: qML_i] :
( ( X1 = X7 )
| ~ ( scott_ess_QML_mu @ X3 @ X1 @ X2 )
| ~ ( X3 @ X7 @ X4 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_53]) ).
thf(c_0_58,plain,
scott_ess_QML_mu @ scott_G @ esk57_0 @ esk59_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_39])]) ).
thf(c_0_59,plain,
( ( scott_ess_QML_mu
@ ^ [Z0: qML_mu,Z1: qML_i] : ~ $true
@ esk447_0
@ esk449_0 )
| ( scott_G @ esk447_0 @ esk449_0 ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_56])]) ).
thf(c_0_60,plain,
! [X2: qML_i] :
( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] : $true
@ X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
thf(c_0_61,plain,
! [X1: qML_mu,X2: qML_i] :
( ( esk57_0 = X1 )
| ~ ( scott_G @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
thf(c_0_62,plain,
scott_G @ esk447_0 @ esk449_0,
inference(spm,[status(thm)],[c_0_36,c_0_59]) ).
thf(c_0_63,plain,
( ( ^ [Z0: qML_mu,Z1: qML_i] : ~ $true )
!= scott_G ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_60])]) ).
thf(c_0_64,plain,
! [X1: qML_mu,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 )
@ X2 )
| ( X3 @ X1 @ X2 )
| ~ ( scott_G @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_25]) ).
thf(c_0_65,plain,
esk57_0 = esk447_0,
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
thf(c_0_66,plain,
( ( ^ [Z0: qML_i] : ~ $true )
!= ( scott_G @ esk44_0 ) ),
inference(neg_ext,[status(thm)],[c_0_63]) ).
thf(c_0_67,plain,
! [X1: qML_mu,X6: qML_mu > qML_i > $o,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( X3 @ X1 @ X2 )
| ( ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X6 @ Z0 @ Z1 ) )
!= ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 ) ) )
| ~ ( scott_P @ X6 @ X2 )
| ~ ( scott_G @ X1 @ X2 ) ),
inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_14,c_0_64])]) ).
thf(c_0_68,plain,
! [X1: qML_mu,X2: qML_i,X3: qML_mu > qML_i > $o,X7: qML_mu,X4: qML_i] :
( ( X2 = X4 )
| ~ ( scott_ess_QML_mu @ X3 @ X1 @ X2 )
| ~ ( X3 @ X7 @ X4 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_53]) ).
thf(c_0_69,plain,
scott_ess_QML_mu @ scott_G @ esk447_0 @ esk59_0,
inference(rw,[status(thm)],[c_0_58,c_0_65]) ).
thf(c_0_70,plain,
! [X1: qML_mu,X2: qML_i] :
( ( esk447_0 = X1 )
| ~ ( scott_G @ X1 @ X2 ) ),
inference(rw,[status(thm)],[c_0_61,c_0_65]) ).
thf(c_0_71,plain,
scott_G @ esk44_0 @ esk46_0,
inference(neg_ext,[status(thm)],[c_0_66]) ).
thf(c_0_72,plain,
! [X3: qML_mu > qML_i > $o,X2: qML_i,X1: qML_mu,X6: qML_mu > qML_i > $o,X4: qML_i] :
( ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 )
@ X2 )
| ( X6 @ X1 @ X4 )
| ( ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 ) )
!= ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X6 @ Z0 @ Z1 ) ) )
| ~ ( scott_G @ X1 @ X4 ) ),
inference(spm,[status(thm)],[c_0_67,c_0_34]) ).
thf(c_0_73,plain,
! [X1: qML_mu,X2: qML_i] :
( ( esk59_0 = X2 )
| ~ ( scott_G @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
thf(c_0_74,plain,
esk44_0 = esk447_0,
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
thf(c_0_75,plain,
! [X2: qML_i,X3: qML_mu > qML_i > $o,X6: qML_mu > qML_i > $o] :
( ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 )
@ X2 )
| ( X6 @ esk57_0 @ esk59_0 )
| ( ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 ) )
!= ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X6 @ Z0 @ Z1 ) ) ) ),
inference(spm,[status(thm)],[c_0_72,c_0_39]) ).
thf(c_0_76,plain,
esk59_0 = esk449_0,
inference(spm,[status(thm)],[c_0_73,c_0_62]) ).
thf(c_0_77,plain,
( ( ^ [Z0: qML_i] : ~ $true )
!= ( scott_G @ esk447_0 ) ),
inference(rw,[status(thm)],[c_0_66,c_0_74]) ).
thf(c_0_78,plain,
! [X2: qML_i,X3: qML_mu > qML_i > $o] :
( ( scott_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X3 @ Z0 @ Z1 )
@ X2 )
| ( X3 @ esk57_0 @ esk59_0 ) ),
inference(er,[status(thm)],[c_0_75]) ).
thf(c_0_79,plain,
! [X41: qML_mu,X42: qML_i] :
( ( scott_NE_QML_mu @ X41 @ X42 )
<=> ! [X3: qML_mu > qML_i > $o] :
( ( scott_ess_QML_mu @ X3 @ X41 @ X42 )
=> ! [X13: qML_i] :
? [X16: qML_mu] : ( X3 @ X16 @ X13 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_8_NE__def])]) ).
thf(c_0_80,plain,
! [X1: qML_mu,X2: qML_i] :
( ( esk449_0 = X2 )
| ~ ( scott_G @ X1 @ X2 ) ),
inference(rw,[status(thm)],[c_0_73,c_0_76]) ).
thf(c_0_81,plain,
scott_G @ esk447_0 @ esk1316_0,
inference(neg_ext,[status(thm)],[c_0_77]) ).
thf(c_0_82,plain,
! [X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( X3 @ esk57_0 @ esk59_0 )
| ~ ( scott_P @ X3 @ X2 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_78]) ).
thf(c_0_83,negated_conjecture,
~ ! [X17: qML_i,X10: qML_i] :
? [X18: qML_mu] : ( scott_G @ X18 @ X10 ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_84,plain,
! [X75: qML_mu,X76: qML_i,X77: qML_mu > qML_i > $o,X78: qML_i,X80: qML_mu,X81: qML_i,X84: qML_mu] :
( ( ~ ( scott_NE_QML_mu @ X75 @ X76 )
| ~ ( scott_ess_QML_mu @ X77 @ X75 @ X76 )
| ( X77 @ ( esk5_4 @ X75 @ X76 @ X77 @ X78 ) @ X78 ) )
& ( ( scott_ess_QML_mu @ ( epred3_2 @ X80 @ X81 ) @ X80 @ X81 )
| ( scott_NE_QML_mu @ X80 @ X81 ) )
& ( ~ ( epred3_2 @ X80 @ X81 @ X84 @ ( esk6_2 @ X80 @ X81 ) )
| ( scott_NE_QML_mu @ X80 @ X81 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_79])])])])])])]) ).
thf(c_0_85,plain,
esk449_0 = esk1316_0,
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
thf(c_0_86,plain,
scott_NE_QML_mu @ esk57_0 @ esk59_0,
inference(spm,[status(thm)],[c_0_82,c_0_32]) ).
thf(c_0_87,negated_conjecture,
! [X86: qML_mu] :
~ ( scott_G @ X86 @ esk7_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_83])])])])]) ).
thf(c_0_88,plain,
! [X1: qML_mu,X4: qML_i,X3: qML_mu > qML_i > $o,X2: qML_i] :
( ( X3 @ ( esk5_4 @ X1 @ X2 @ X3 @ X4 ) @ X4 )
| ~ ( scott_NE_QML_mu @ X1 @ X2 )
| ~ ( scott_ess_QML_mu @ X3 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
thf(c_0_89,plain,
scott_ess_QML_mu @ scott_G @ esk447_0 @ esk1316_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_76]),c_0_85]) ).
thf(c_0_90,plain,
scott_NE_QML_mu @ esk447_0 @ esk1316_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_65]),c_0_76]),c_0_85]) ).
thf(c_0_91,negated_conjecture,
! [X1: qML_mu] :
~ ( scott_G @ X1 @ esk7_0 ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
thf(c_0_92,plain,
! [X2: qML_i] : ( scott_G @ ( esk5_4 @ esk447_0 @ esk1316_0 @ scott_G @ X2 ) @ X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90])]) ).
thf(c_0_93,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_91,c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PHI005^4 : TPTP v8.2.0. Released v6.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.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 : Sat May 18 14:46:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 18.75/2.82 # Version: 3.1.0-ho
% 18.75/2.82 # Preprocessing class: HSMSSMSSSSMNHFA.
% 18.75/2.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.75/2.82 # Starting ehoh_best_nonlift with 1500s (5) cores
% 18.75/2.82 # Starting lpo6_lambda_fix with 300s (1) cores
% 18.75/2.82 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 18.75/2.82 # Starting ehoh_best3_fo with 300s (1) cores
% 18.75/2.82 # ehoh_best_nonlift with pid 25433 completed with status 0
% 18.75/2.82 # Result found by ehoh_best_nonlift
% 18.75/2.82 # Preprocessing class: HSMSSMSSSSMNHFA.
% 18.75/2.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.75/2.82 # Starting ehoh_best_nonlift with 1500s (5) cores
% 18.75/2.82 # No SInE strategy applied
% 18.75/2.82 # Search class: HGHNS-FFSF33-MHFFFSBN
% 18.75/2.82 # partial match(4): HGHNS-FFMF32-SHSFFSBN
% 18.75/2.82 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 18.75/2.82 # Starting ho_unfolding_3 with 901s (1) cores
% 18.75/2.82 # Starting ehoh_best_nonlift_rwall with 151s (1) cores
% 18.75/2.82 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 18.75/2.82 # Starting ehoh_best8_lambda with 151s (1) cores
% 18.75/2.82 # Starting ehoh_best_nonlift with 146s (1) cores
% 18.75/2.82 # ehoh_best_nonlift_nonlambdatoforall with pid 25441 completed with status 0
% 18.75/2.82 # Result found by ehoh_best_nonlift_nonlambdatoforall
% 18.75/2.82 # Preprocessing class: HSMSSMSSSSMNHFA.
% 18.75/2.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.75/2.82 # Starting ehoh_best_nonlift with 1500s (5) cores
% 18.75/2.82 # No SInE strategy applied
% 18.75/2.82 # Search class: HGHNS-FFSF33-MHFFFSBN
% 18.75/2.82 # partial match(4): HGHNS-FFMF32-SHSFFSBN
% 18.75/2.82 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 18.75/2.82 # Starting ho_unfolding_3 with 901s (1) cores
% 18.75/2.82 # Starting ehoh_best_nonlift_rwall with 151s (1) cores
% 18.75/2.82 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 18.75/2.82 # Preprocessing time : 0.002 s
% 18.75/2.82 # Presaturation interreduction done
% 18.75/2.82
% 18.75/2.82 # Proof found!
% 18.75/2.82 # SZS status Theorem
% 18.75/2.82 # SZS output start CNFRefutation
% See solution above
% 18.75/2.82 # Parsed axioms : 16
% 18.75/2.82 # Removed by relevancy pruning/SinE : 0
% 18.75/2.82 # Initial clauses : 25
% 18.75/2.82 # Removed in clause preprocessing : 6
% 18.75/2.82 # Initial clauses in saturation : 19
% 18.75/2.82 # Processed clauses : 9742
% 18.75/2.82 # ...of these trivial : 527
% 18.75/2.82 # ...subsumed : 4780
% 18.75/2.82 # ...remaining for further processing : 4435
% 18.75/2.82 # Other redundant clauses eliminated : 3965
% 18.75/2.82 # Clauses deleted for lack of memory : 0
% 18.75/2.82 # Backward-subsumed : 190
% 18.75/2.82 # Backward-rewritten : 2930
% 18.75/2.82 # Generated clauses : 94903
% 18.75/2.82 # ...of the previous two non-redundant : 77812
% 18.75/2.82 # ...aggressively subsumed : 0
% 18.75/2.82 # Contextual simplify-reflections : 1
% 18.75/2.82 # Paramodulations : 88604
% 18.75/2.82 # Factorizations : 24
% 18.75/2.82 # NegExts : 1322
% 18.75/2.82 # Equation resolutions : 4208
% 18.75/2.82 # Disequality decompositions : 0
% 18.75/2.82 # Total rewrite steps : 20552
% 18.75/2.82 # ...of those cached : 20415
% 18.75/2.82 # Propositional unsat checks : 0
% 18.75/2.82 # Propositional check models : 0
% 18.75/2.82 # Propositional check unsatisfiable : 0
% 18.75/2.82 # Propositional clauses : 0
% 18.75/2.82 # Propositional clauses after purity: 0
% 18.75/2.82 # Propositional unsat core size : 0
% 18.75/2.82 # Propositional preprocessing time : 0.000
% 18.75/2.82 # Propositional encoding time : 0.000
% 18.75/2.82 # Propositional solver time : 0.000
% 18.75/2.82 # Success case prop preproc time : 0.000
% 18.75/2.82 # Success case prop encoding time : 0.000
% 18.75/2.82 # Success case prop solver time : 0.000
% 18.75/2.82 # Current number of processed clauses : 962
% 18.75/2.82 # Positive orientable unit clauses : 56
% 18.75/2.82 # Positive unorientable unit clauses: 0
% 18.75/2.82 # Negative unit clauses : 31
% 18.75/2.82 # Non-unit-clauses : 875
% 18.75/2.82 # Current number of unprocessed clauses: 66171
% 18.75/2.82 # ...number of literals in the above : 211991
% 18.75/2.82 # Current number of archived formulas : 0
% 18.75/2.82 # Current number of archived clauses : 3473
% 18.75/2.82 # Clause-clause subsumption calls (NU) : 503526
% 18.75/2.82 # Rec. Clause-clause subsumption calls : 434160
% 18.75/2.82 # Non-unit clause-clause subsumptions : 4856
% 18.75/2.82 # Unit Clause-clause subsumption calls : 13923
% 18.75/2.82 # Rewrite failures with RHS unbound : 0
% 18.75/2.82 # BW rewrite match attempts : 72
% 18.75/2.82 # BW rewrite match successes : 57
% 18.75/2.82 # Condensation attempts : 0
% 18.75/2.82 # Condensation successes : 0
% 18.75/2.82 # Termbank termtop insertions : 4798981
% 18.75/2.82 # Search garbage collected termcells : 581
% 18.75/2.82
% 18.75/2.82 # -------------------------------------------------
% 18.75/2.82 # User time : 2.240 s
% 18.75/2.82 # System time : 0.044 s
% 18.75/2.82 # Total time : 2.284 s
% 18.75/2.82 # Maximum resident set size: 1876 pages
% 18.75/2.82
% 18.75/2.82 # -------------------------------------------------
% 18.75/2.82 # User time : 11.244 s
% 18.75/2.82 # System time : 0.229 s
% 18.75/2.82 # Total time : 11.473 s
% 18.75/2.82 # Maximum resident set size: 1744 pages
% 18.75/2.82 % E---3.1 exiting
% 18.75/2.82 % E exiting
%------------------------------------------------------------------------------