TSTP Solution File: NUM926+8 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM926+8 : TPTP v8.1.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n009.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  : 600s
% DateTime : Mon Jul 18 08:41:19 EDT 2022

% Result   : Theorem 108.80s 16.16s
% Output   : CNFRefutation 108.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   29
% Syntax   : Number of formulae    :  112 (  88 unt;   0 def)
%            Number of atoms       :  144 ( 100 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   62 (  30   ~;  27   |;   0   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   29 (  29 usr;  18 con; 0-4 aty)
%            Number of variables   :  129 (   4 sgn  58   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(fact_2897_succ__pred,axiom,
    ! [X10] : hAPP(int,int,succ,hAPP(int,int,pred,X10)) = ti(int,X10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2897_succ__pred) ).

fof(help_COMBI_1_1_U,axiom,
    ! [X1,X228] : hAPP(X1,X1,combi(X1),X228) = ti(X1,X228),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_COMBI_1_1_U) ).

fof(fact_89_number__of__is__id,axiom,
    ! [X19] : hAPP(int,int,number_number_of(int),X19) = ti(int,X19),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_89_number__of__is__id) ).

fof(fact_131_zmult__1,axiom,
    ! [X16] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),one_one(int)),X16) = ti(int,X16),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_131_zmult__1) ).

fof(fact_126_add__Pls__right,axiom,
    ! [X19] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X19),pls) = ti(int,X19),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_126_add__Pls__right) ).

fof(tsy_c_hAPP_arg2,axiom,
    ! [X1,X3,X4,X5] : hAPP(X1,X3,X4,ti(X1,X5)) = hAPP(X1,X3,X4,X5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_hAPP_arg2) ).

fof(fact_2898_pred__Bit1,axiom,
    ! [X19] : hAPP(int,int,pred,hAPP(int,int,bit1,X19)) = hAPP(int,int,bit0,X19),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2898_pred__Bit1) ).

fof(tsy_v_m_res,hypothesis,
    ti(int,m) = m,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_v_m_res) ).

fof(help_fNot_1_1_U,axiom,
    ! [X228] :
      ( ~ hBOOL(hAPP(bool,bool,fNot,X228))
      | ~ hBOOL(X228) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_fNot_1_1_U) ).

fof(help_If_3_1_T,axiom,
    ! [X228] :
      ( ti(bool,X228) = fTrue
      | ti(bool,X228) = fFalse ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_If_3_1_T) ).

fof(conj_0,conjecture,
    ? [X6,X7] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X6),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X7),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

fof(fact_1128_nat__number__of__def,axiom,
    ! [X14] : hAPP(int,nat,number_number_of(nat),X14) = hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),X14)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1128_nat__number__of__def) ).

fof(fact_161_one__is__num__one,axiom,
    one_one(int) = hAPP(int,int,number_number_of(int),hAPP(int,int,bit1,pls)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_161_one__is__num__one) ).

fof(fact_123_Bit0__Pls,axiom,
    hAPP(int,int,bit0,pls) = pls,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_123_Bit0__Pls) ).

fof(fact_1590_succ__Pls,axiom,
    hAPP(int,int,succ,pls) = hAPP(int,int,bit1,pls),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1590_succ__Pls) ).

fof(tsy_c_hAPP_res,axiom,
    ! [X3,X1,X4,X5] : ti(X3,hAPP(X1,X3,X4,X5)) = hAPP(X1,X3,X4,X5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_hAPP_res) ).

fof(fact_2899_pred__Bit0,axiom,
    ! [X19] : hAPP(int,int,pred,hAPP(int,int,bit0,X19)) = hAPP(int,int,bit1,hAPP(int,int,pred,X19)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2899_pred__Bit0) ).

fof(fact_1592_succ__Bit1,axiom,
    ! [X19] : hAPP(int,int,succ,hAPP(int,int,bit1,X19)) = hAPP(int,int,bit0,hAPP(int,int,succ,X19)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1592_succ__Bit1) ).

fof(fact_125_mult__Bit0,axiom,
    ! [X19,X52] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,bit0,X19)),X52) = hAPP(int,int,bit0,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X19),X52)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_125_mult__Bit0) ).

fof(fact_153_add__Bit0__Bit1,axiom,
    ! [X19,X52] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,bit0,X19)),hAPP(int,int,bit1,X52)) = hAPP(int,int,bit1,hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X19),X52)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_153_add__Bit0__Bit1) ).

fof(help_fTrue_1_1_U,axiom,
    hBOOL(fTrue),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_fTrue_1_1_U) ).

fof(tsy_v_t_____res,axiom,
    ti(int,t) = t,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_v_t_____res) ).

fof(fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
    ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t))
   => ? [X6,X7] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X6),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X7),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).

fof(help_fNot_2_1_U,axiom,
    ! [X228] :
      ( hBOOL(X228)
      | hBOOL(hAPP(bool,bool,fNot,X228)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_fNot_2_1_U) ).

fof(fact_1568_xt1_I12_J,axiom,
    ! [X1] :
      ( order(X1)
     => ! [X8,X9] :
          ( ti(X1,X8) != ti(X1,X9)
         => ( hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less_eq(X1),X9),X8))
           => hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),X9),X8)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1568_xt1_I12_J) ).

fof(fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
    ( t = one_one(int)
   => ? [X6,X7] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X6),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X7),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).

fof(fact_0_tpos,axiom,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),one_one(int)),t)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_tpos) ).

fof(help_fFalse_1_1_U,axiom,
    ~ hBOOL(fFalse),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_fFalse_1_1_U) ).

fof(arity_Int_Oint___Orderings_Oorder,axiom,
    order(int),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Orderings_Oorder) ).

fof(c_0_29,plain,
    ! [X7301] : hAPP(int,int,succ,hAPP(int,int,pred,X7301)) = ti(int,X7301),
    inference(variable_rename,[status(thm)],[fact_2897_succ__pred]) ).

fof(c_0_30,plain,
    ! [X13980,X13981] : hAPP(X13980,X13980,combi(X13980),X13981) = ti(X13980,X13981),
    inference(variable_rename,[status(thm)],[help_COMBI_1_1_U]) ).

fof(c_0_31,plain,
    ! [X594] : hAPP(int,int,number_number_of(int),X594) = ti(int,X594),
    inference(variable_rename,[status(thm)],[fact_89_number__of__is__id]) ).

fof(c_0_32,plain,
    ! [X677] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),one_one(int)),X677) = ti(int,X677),
    inference(variable_rename,[status(thm)],[fact_131_zmult__1]) ).

cnf(c_0_33,plain,
    hAPP(int,int,succ,hAPP(int,int,pred,X1)) = ti(int,X1),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_34,plain,
    hAPP(X1,X1,combi(X1),X2) = ti(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_35,plain,
    hAPP(int,int,number_number_of(int),X1) = ti(int,X1),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

fof(c_0_36,plain,
    ! [X671] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X671),pls) = ti(int,X671),
    inference(variable_rename,[status(thm)],[fact_126_add__Pls__right]) ).

fof(c_0_37,plain,
    ! [X384,X385,X386,X387] : hAPP(X384,X385,X386,ti(X384,X387)) = hAPP(X384,X385,X386,X387),
    inference(variable_rename,[status(thm)],[tsy_c_hAPP_arg2]) ).

cnf(c_0_38,plain,
    hAPP(int,int,hAPP(int,fun(int,int),times_times(int),one_one(int)),X1) = ti(int,X1),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_39,plain,
    hAPP(int,int,succ,hAPP(int,int,pred,X1)) = hAPP(int,int,combi(int),X1),
    inference(rw,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_40,plain,
    hAPP(int,int,number_number_of(int),X1) = hAPP(int,int,combi(int),X1),
    inference(rw,[status(thm)],[c_0_35,c_0_34]) ).

fof(c_0_41,plain,
    ! [X7302] : hAPP(int,int,pred,hAPP(int,int,bit1,X7302)) = hAPP(int,int,bit0,X7302),
    inference(variable_rename,[status(thm)],[fact_2898_pred__Bit1]) ).

cnf(c_0_42,hypothesis,
    ti(int,m) = m,
    inference(split_conjunct,[status(thm)],[tsy_v_m_res]) ).

cnf(c_0_43,plain,
    hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X1),pls) = ti(int,X1),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

fof(c_0_44,plain,
    ! [X13966] :
      ( ~ hBOOL(hAPP(bool,bool,fNot,X13966))
      | ~ hBOOL(X13966) ),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[help_fNot_1_1_U])]) ).

cnf(c_0_45,plain,
    hAPP(X1,X2,X3,ti(X1,X4)) = hAPP(X1,X2,X3,X4),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

fof(c_0_46,plain,
    ! [X13962] :
      ( ti(bool,X13962) = fTrue
      | ti(bool,X13962) = fFalse ),
    inference(variable_rename,[status(thm)],[help_If_3_1_T]) ).

fof(c_0_47,negated_conjecture,
    ~ ? [X6,X7] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X6),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X7),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)),
    inference(assume_negation,[status(cth)],[conj_0]) ).

fof(c_0_48,plain,
    ! [X3357] : hAPP(int,nat,number_number_of(nat),X3357) = hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),X3357)),
    inference(variable_rename,[status(thm)],[fact_1128_nat__number__of__def]) ).

cnf(c_0_49,plain,
    hAPP(int,int,hAPP(int,fun(int,int),times_times(int),one_one(int)),X1) = hAPP(int,int,combi(int),X1),
    inference(rw,[status(thm)],[c_0_38,c_0_34]) ).

cnf(c_0_50,plain,
    one_one(int) = hAPP(int,int,number_number_of(int),hAPP(int,int,bit1,pls)),
    inference(split_conjunct,[status(thm)],[fact_161_one__is__num__one]) ).

cnf(c_0_51,plain,
    hAPP(int,int,number_number_of(int),X1) = hAPP(int,int,succ,hAPP(int,int,pred,X1)),
    inference(rw,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_52,plain,
    hAPP(int,int,pred,hAPP(int,int,bit1,X1)) = hAPP(int,int,bit0,X1),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

cnf(c_0_53,plain,
    hAPP(int,int,bit0,pls) = pls,
    inference(split_conjunct,[status(thm)],[fact_123_Bit0__Pls]) ).

cnf(c_0_54,plain,
    hAPP(int,int,succ,pls) = hAPP(int,int,bit1,pls),
    inference(split_conjunct,[status(thm)],[fact_1590_succ__Pls]) ).

cnf(c_0_55,hypothesis,
    hAPP(int,int,combi(int),m) = m,
    inference(rw,[status(thm)],[c_0_42,c_0_34]) ).

cnf(c_0_56,plain,
    hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X1),pls) = hAPP(int,int,combi(int),X1),
    inference(rw,[status(thm)],[c_0_43,c_0_34]) ).

fof(c_0_57,plain,
    ! [X388,X389,X390,X391] : ti(X388,hAPP(X389,X388,X390,X391)) = hAPP(X389,X388,X390,X391),
    inference(variable_rename,[status(thm)],[tsy_c_hAPP_res]) ).

cnf(c_0_58,plain,
    ( ~ hBOOL(hAPP(bool,bool,fNot,X1))
    | ~ hBOOL(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

cnf(c_0_59,plain,
    hAPP(X1,X2,X3,hAPP(X1,X1,combi(X1),X4)) = hAPP(X1,X2,X3,X4),
    inference(rw,[status(thm)],[c_0_45,c_0_34]) ).

cnf(c_0_60,plain,
    ( ti(bool,X1) = fTrue
    | ti(bool,X1) = fFalse ),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

fof(c_0_61,negated_conjecture,
    ! [X14018,X14019] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X14018),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X14019),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) != hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])]) ).

cnf(c_0_62,plain,
    hAPP(int,nat,number_number_of(nat),X1) = hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),X1)),
    inference(split_conjunct,[status(thm)],[c_0_48]) ).

fof(c_0_63,plain,
    ! [X7303] : hAPP(int,int,pred,hAPP(int,int,bit0,X7303)) = hAPP(int,int,bit1,hAPP(int,int,pred,X7303)),
    inference(variable_rename,[status(thm)],[fact_2899_pred__Bit0]) ).

fof(c_0_64,plain,
    ! [X4398] : hAPP(int,int,succ,hAPP(int,int,bit1,X4398)) = hAPP(int,int,bit0,hAPP(int,int,succ,X4398)),
    inference(variable_rename,[status(thm)],[fact_1592_succ__Bit1]) ).

fof(c_0_65,plain,
    ! [X669,X670] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,bit0,X669)),X670) = hAPP(int,int,bit0,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X669),X670)),
    inference(variable_rename,[status(thm)],[fact_125_mult__Bit0]) ).

cnf(c_0_66,plain,
    hAPP(int,int,hAPP(int,fun(int,int),times_times(int),one_one(int)),X1) = hAPP(int,int,number_number_of(int),X1),
    inference(rw,[status(thm)],[c_0_49,c_0_40]) ).

cnf(c_0_67,plain,
    one_one(int) = hAPP(int,int,bit1,pls),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_53]),c_0_54]) ).

cnf(c_0_68,hypothesis,
    hAPP(int,int,number_number_of(int),m) = m,
    inference(rw,[status(thm)],[c_0_55,c_0_40]) ).

fof(c_0_69,plain,
    ! [X737,X738] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,bit0,X737)),hAPP(int,int,bit1,X738)) = hAPP(int,int,bit1,hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X737),X738)),
    inference(variable_rename,[status(thm)],[fact_153_add__Bit0__Bit1]) ).

cnf(c_0_70,plain,
    hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X1),pls) = hAPP(int,int,number_number_of(int),X1),
    inference(rw,[status(thm)],[c_0_56,c_0_40]) ).

cnf(c_0_71,plain,
    ti(X1,hAPP(X2,X1,X3,X4)) = hAPP(X2,X1,X3,X4),
    inference(split_conjunct,[status(thm)],[c_0_57]) ).

cnf(c_0_72,plain,
    ( ~ hBOOL(hAPP(bool,bool,combi(bool),X1))
    | ~ hBOOL(hAPP(bool,bool,fNot,X1)) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_73,plain,
    ( hAPP(bool,bool,combi(bool),X1) = fFalse
    | hAPP(bool,bool,combi(bool),X1) = fTrue ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_34]),c_0_34]) ).

cnf(c_0_74,plain,
    hBOOL(fTrue),
    inference(split_conjunct,[status(thm)],[help_fTrue_1_1_U]) ).

cnf(c_0_75,plain,
    ti(int,t) = t,
    inference(split_conjunct,[status(thm)],[tsy_v_t_____res]) ).

fof(c_0_76,plain,
    ( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t))
    | hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk3_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk4_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])]) ).

cnf(c_0_77,negated_conjecture,
    hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X1),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X2),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) != hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)),
    inference(split_conjunct,[status(thm)],[c_0_61]) ).

cnf(c_0_78,plain,
    hAPP(int,nat,number_number_of(nat),X1) = hAPP(int,nat,nat_1,hAPP(int,int,succ,hAPP(int,int,pred,X1))),
    inference(rw,[status(thm)],[c_0_62,c_0_51]) ).

cnf(c_0_79,plain,
    hAPP(int,int,pred,hAPP(int,int,bit0,X1)) = hAPP(int,int,bit1,hAPP(int,int,pred,X1)),
    inference(split_conjunct,[status(thm)],[c_0_63]) ).

cnf(c_0_80,plain,
    hAPP(int,int,succ,hAPP(int,int,bit1,X1)) = hAPP(int,int,bit0,hAPP(int,int,succ,X1)),
    inference(split_conjunct,[status(thm)],[c_0_64]) ).

cnf(c_0_81,plain,
    hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,bit0,X1)),X2) = hAPP(int,int,bit0,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X1),X2)),
    inference(split_conjunct,[status(thm)],[c_0_65]) ).

cnf(c_0_82,plain,
    hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,bit1,pls)),X1) = hAPP(int,int,succ,hAPP(int,int,pred,X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_51]),c_0_67]) ).

cnf(c_0_83,hypothesis,
    hAPP(int,int,succ,hAPP(int,int,pred,m)) = m,
    inference(rw,[status(thm)],[c_0_68,c_0_51]) ).

cnf(c_0_84,plain,
    hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,bit0,X1)),hAPP(int,int,bit1,X2)) = hAPP(int,int,bit1,hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X1),X2)),
    inference(split_conjunct,[status(thm)],[c_0_69]) ).

cnf(c_0_85,plain,
    hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X1),pls) = hAPP(int,int,succ,hAPP(int,int,pred,X1)),
    inference(rw,[status(thm)],[c_0_70,c_0_51]) ).

cnf(c_0_86,plain,
    hAPP(X1,X1,combi(X1),hAPP(X2,X1,X3,X4)) = hAPP(X2,X1,X3,X4),
    inference(rw,[status(thm)],[c_0_71,c_0_34]) ).

cnf(c_0_87,plain,
    ( hAPP(bool,bool,combi(bool),X1) = fFalse
    | ~ hBOOL(hAPP(bool,bool,fNot,X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).

fof(c_0_88,plain,
    ! [X13967] :
      ( hBOOL(X13967)
      | hBOOL(hAPP(bool,bool,fNot,X13967)) ),
    inference(variable_rename,[status(thm)],[help_fNot_2_1_U]) ).

fof(c_0_89,plain,
    ! [X4331,X4332,X4333] :
      ( ~ order(X4331)
      | ti(X4331,X4332) = ti(X4331,X4333)
      | ~ hBOOL(hAPP(X4331,bool,hAPP(X4331,fun(X4331,bool),ord_less_eq(X4331),X4333),X4332))
      | hBOOL(hAPP(X4331,bool,hAPP(X4331,fun(X4331,bool),ord_less(X4331),X4333),X4332)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1568_xt1_I12_J])])]) ).

cnf(c_0_90,plain,
    hAPP(int,int,combi(int),t) = t,
    inference(rw,[status(thm)],[c_0_75,c_0_34]) ).

cnf(c_0_91,plain,
    ( hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk3_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk4_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))
    | ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t)) ),
    inference(split_conjunct,[status(thm)],[c_0_76]) ).

cnf(c_0_92,negated_conjecture,
    hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X1),hAPP(int,nat,nat_1,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X2),hAPP(int,nat,nat_1,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) != hAPP(int,int,bit1,hAPP(int,int,bit0,m)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_52]),c_0_53]),c_0_80]),c_0_54]),c_0_78]),c_0_79]),c_0_52]),c_0_53]),c_0_80]),c_0_54]),c_0_51]),c_0_79]),c_0_79]),c_0_52]),c_0_53]),c_0_80]),c_0_80]),c_0_54]),c_0_81]),c_0_81]),c_0_82]),c_0_83]),c_0_67]),c_0_84]),c_0_85]),c_0_79]),c_0_80]),c_0_83]) ).

cnf(c_0_93,plain,
    ( hAPP(X1,bool,X2,X3) = fFalse
    | ~ hBOOL(hAPP(bool,bool,fNot,hAPP(X1,bool,X2,X3))) ),
    inference(spm,[status(thm)],[c_0_86,c_0_87]) ).

cnf(c_0_94,plain,
    ( hBOOL(X1)
    | hBOOL(hAPP(bool,bool,fNot,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_88]) ).

fof(c_0_95,plain,
    ( t != one_one(int)
    | hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk1_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk2_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])]) ).

cnf(c_0_96,plain,
    ( ti(X1,X2) = ti(X1,X3)
    | hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),X3),X2))
    | ~ order(X1)
    | ~ hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less_eq(X1),X3),X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_89]) ).

cnf(c_0_97,plain,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),one_one(int)),t)),
    inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).

cnf(c_0_98,plain,
    hAPP(int,int,number_number_of(int),t) = t,
    inference(rw,[status(thm)],[c_0_90,c_0_40]) ).

cnf(c_0_99,plain,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,bit1,pls)),t)),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_78]),c_0_79]),c_0_52]),c_0_53]),c_0_80]),c_0_54]),c_0_78]),c_0_79]),c_0_52]),c_0_53]),c_0_80]),c_0_54]),c_0_51]),c_0_79]),c_0_79]),c_0_52]),c_0_53]),c_0_80]),c_0_80]),c_0_54]),c_0_81]),c_0_81]),c_0_82]),c_0_83]),c_0_67]),c_0_84]),c_0_85]),c_0_79]),c_0_80]),c_0_83]),c_0_67]),c_0_92]) ).

cnf(c_0_100,plain,
    ( hAPP(X1,bool,X2,X3) = fFalse
    | hBOOL(hAPP(X1,bool,X2,X3)) ),
    inference(spm,[status(thm)],[c_0_93,c_0_94]) ).

cnf(c_0_101,plain,
    ( hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk1_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk2_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))
    | t != one_one(int) ),
    inference(split_conjunct,[status(thm)],[c_0_95]) ).

fof(c_0_102,plain,
    ~ hBOOL(fFalse),
    inference(fof_simplification,[status(thm)],[help_fFalse_1_1_U]) ).

cnf(c_0_103,plain,
    ( hAPP(X1,X1,combi(X1),X2) = hAPP(X1,X1,combi(X1),X3)
    | hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),X3),X2))
    | ~ order(X1)
    | ~ hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less_eq(X1),X3),X2)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_34]),c_0_34]) ).

cnf(c_0_104,plain,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),hAPP(int,int,bit1,pls)),t)),
    inference(rw,[status(thm)],[c_0_97,c_0_67]) ).

cnf(c_0_105,plain,
    hAPP(int,int,succ,hAPP(int,int,pred,t)) = t,
    inference(rw,[status(thm)],[c_0_98,c_0_51]) ).

cnf(c_0_106,plain,
    hAPP(int,int,combi(int),X1) = hAPP(int,int,succ,hAPP(int,int,pred,X1)),
    inference(rw,[status(thm)],[c_0_40,c_0_51]) ).

cnf(c_0_107,plain,
    hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,bit1,pls)),t) = fFalse,
    inference(spm,[status(thm)],[c_0_99,c_0_100]) ).

cnf(c_0_108,plain,
    order(int),
    inference(split_conjunct,[status(thm)],[arity_Int_Oint___Orderings_Oorder]) ).

cnf(c_0_109,plain,
    hAPP(int,int,bit1,pls) != t,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_78]),c_0_79]),c_0_52]),c_0_53]),c_0_80]),c_0_54]),c_0_78]),c_0_79]),c_0_52]),c_0_53]),c_0_80]),c_0_54]),c_0_51]),c_0_79]),c_0_79]),c_0_52]),c_0_53]),c_0_80]),c_0_80]),c_0_54]),c_0_81]),c_0_81]),c_0_82]),c_0_83]),c_0_67]),c_0_84]),c_0_85]),c_0_79]),c_0_80]),c_0_83]),c_0_67]),c_0_92]) ).

cnf(c_0_110,plain,
    ~ hBOOL(fFalse),
    inference(split_conjunct,[status(thm)],[c_0_102]) ).

cnf(c_0_111,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_40]),c_0_51]),c_0_105]),c_0_106]),c_0_52]),c_0_53]),c_0_54]),c_0_107]),c_0_108])]),c_0_109]),c_0_110]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem  : NUM926+8 : TPTP v8.1.0. Released v5.3.0.
% 0.02/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n009.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Tue Jul  5 21:16:09 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.47  # ENIGMATIC: Selected SinE mode:
% 0.60/0.79  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.60/0.79  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.60/0.79  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.60/0.79  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 108.80/16.16  # ENIGMATIC: Solved by autoschedule:
% 108.80/16.16  # No SInE strategy applied
% 108.80/16.16  # Trying AutoSched0 for 150 seconds
% 108.80/16.16  # AutoSched0-Mode selected heuristic SAT001_MinMin_x000000_rr
% 108.80/16.16  # and selection function SelectMaxLComplexAvoidPosPred.
% 108.80/16.16  #
% 108.80/16.16  # Preprocessing time       : 1.069 s
% 108.80/16.16  # Presaturation interreduction done
% 108.80/16.16  
% 108.80/16.16  # Proof found!
% 108.80/16.16  # SZS status Theorem
% 108.80/16.16  # SZS output start CNFRefutation
% See solution above
% 108.80/16.16  # Training examples: 0 positive, 0 negative
% 108.80/16.16  
% 108.80/16.16  # -------------------------------------------------
% 108.80/16.16  # User time                : 12.338 s
% 108.80/16.16  # System time              : 0.162 s
% 108.80/16.16  # Total time               : 12.500 s
% 108.80/16.16  # Maximum resident set size: 11292 pages
% 108.80/16.16  
%------------------------------------------------------------------------------