↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM926+7 : TPTP v8.1.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n007.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 09:37:55 EDT 2022

% Result   : Theorem 0.54s 25.71s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   66 (  53 unt;   0 def)
%            Number of atoms       :   85 (  64 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   40 (  21   ~;  14   |;   0   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   22 (  22 usr;  10 con; 0-4 aty)
%            Number of variables   :   72 (   8 sgn  34   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
    ? [X6,X7] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X6),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X7),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_0) ).

fof(fact_128_Bit0__def,axiom,
    ! [X19] : bit0(X19) = hAPP(int,int,plus_plus(int,X19),X19),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_128_Bit0__def) ).

fof(fact_126_add__Pls,axiom,
    ! [X19] : hAPP(int,int,plus_plus(int,pls),X19) = ti(int,X19),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_126_add__Pls) ).

fof(fact_88_number__of__is__id,axiom,
    ! [X19] : number_number_of(int,X19) = ti(int,X19),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_88_number__of__is__id) ).

fof(tsy_c_Int_OBit1_res,hypothesis,
    ! [X4] : ti(int,bit1(X4)) = bit1(X4),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',tsy_c_Int_OBit1_res) ).

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,plus_plus(int,hAPP(nat,int,power_power(int,X6),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X7),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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_37_nat__1__add__1,axiom,
    hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_37_nat__1__add__1) ).

fof(fact_151_add__Bit1__Bit0,axiom,
    ! [X19,X50] : hAPP(int,int,plus_plus(int,bit1(X19)),bit0(X50)) = bit1(hAPP(int,int,plus_plus(int,X19),X50)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_151_add__Bit1__Bit0) ).

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,plus_plus(int,hAPP(nat,int,power_power(int,X6),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X7),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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(fact_91_zadd__commute,axiom,
    ! [X16,X12] : hAPP(int,int,plus_plus(int,X16),X12) = hAPP(int,int,plus_plus(int,X12),X16),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_91_zadd__commute) ).

fof(fact_160_one__is__num__one,axiom,
    one_one(int) = number_number_of(int,bit1(pls)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_160_one__is__num__one) ).

fof(fact_89_zadd__assoc,axiom,
    ! [X42,X43,X44] : hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,X42),X43)),X44) = hAPP(int,int,plus_plus(int,X42),hAPP(int,int,plus_plus(int,X43),X44)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_89_zadd__assoc) ).

fof(fact_87_zmult__commute,axiom,
    ! [X16,X12] : hAPP(int,int,times_times(int,X16),X12) = hAPP(int,int,times_times(int,X12),X16),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_87_zmult__commute) ).

fof(fact_332_order__le__neq__implies__less,axiom,
    ! [X3] :
      ( order(X3)
     => ! [X10,X11] :
          ( hBOOL(hAPP(X3,bool,hAPP(X3,fun(X3,bool),ord_less_eq(X3),X10),X11))
         => ( ti(X3,X10) != ti(X3,X11)
           => hBOOL(hAPP(X3,bool,hAPP(X3,fun(X3,bool),ord_less(X3),X10),X11)) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_332_order__le__neq__implies__less) ).

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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_0_tpos) ).

fof(tsy_v_t_____res,axiom,
    ti(int,t) = t,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',tsy_v_t_____res) ).

fof(arity_Int_Oint___Orderings_Oorder,axiom,
    order(int),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',arity_Int_Oint___Orderings_Oorder) ).

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

fof(c_0_18,negated_conjecture,
    ! [X8,X9] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X8),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X9),number_number_of(nat,bit0(bit1(pls))))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).

fof(c_0_19,plain,
    ! [X20] : bit0(X20) = hAPP(int,int,plus_plus(int,X20),X20),
    inference(variable_rename,[status(thm)],[fact_128_Bit0__def]) ).

fof(c_0_20,plain,
    ! [X20] : hAPP(int,int,plus_plus(int,pls),X20) = ti(int,X20),
    inference(variable_rename,[status(thm)],[fact_126_add__Pls]) ).

fof(c_0_21,plain,
    ! [X20] : number_number_of(int,X20) = ti(int,X20),
    inference(variable_rename,[status(thm)],[fact_88_number__of__is__id]) ).

fof(c_0_22,hypothesis,
    ! [X5] : ti(int,bit1(X5)) = bit1(X5),
    inference(variable_rename,[status(thm)],[tsy_c_Int_OBit1_res]) ).

fof(c_0_23,plain,
    ( t != one_one(int)
    | hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk1_0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,esk2_0),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[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_24,negated_conjecture,
    hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X2),number_number_of(nat,bit0(bit1(pls))))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_25,plain,
    bit0(X1) = hAPP(int,int,plus_plus(int,X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_26,plain,
    hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
    inference(split_conjunct,[status(thm)],[fact_37_nat__1__add__1]) ).

cnf(c_0_27,plain,
    hAPP(int,int,plus_plus(int,pls),X1) = ti(int,X1),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_28,plain,
    number_number_of(int,X1) = ti(int,X1),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_29,hypothesis,
    ti(int,bit1(X1)) = bit1(X1),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

fof(c_0_30,plain,
    ! [X51,X52] : hAPP(int,int,plus_plus(int,bit1(X51)),bit0(X52)) = bit1(hAPP(int,int,plus_plus(int,X51),X52)),
    inference(variable_rename,[status(thm)],[fact_151_add__Bit1__Bit0]) ).

fof(c_0_31,plain,
    ( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t))
    | hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk3_0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,esk4_0),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[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_32,plain,
    ( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk1_0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,esk2_0),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))
    | t != one_one(int) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_33,negated_conjecture,
    hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),hAPP(nat,int,power_power(int,X2),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).

cnf(c_0_34,plain,
    hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)) = number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),
    inference(rw,[status(thm)],[c_0_26,c_0_25]) ).

cnf(c_0_35,plain,
    number_number_of(int,X1) = hAPP(int,int,plus_plus(int,pls),X1),
    inference(rw,[status(thm)],[c_0_27,c_0_28]) ).

fof(c_0_36,plain,
    ! [X17,X18] : hAPP(int,int,plus_plus(int,X17),X18) = hAPP(int,int,plus_plus(int,X18),X17),
    inference(variable_rename,[status(thm)],[fact_91_zadd__commute]) ).

cnf(c_0_37,plain,
    one_one(int) = number_number_of(int,bit1(pls)),
    inference(split_conjunct,[status(thm)],[fact_160_one__is__num__one]) ).

cnf(c_0_38,hypothesis,
    number_number_of(int,bit1(X1)) = bit1(X1),
    inference(rw,[status(thm)],[c_0_29,c_0_28]) ).

fof(c_0_39,plain,
    ! [X45,X46,X47] : hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,X45),X46)),X47) = hAPP(int,int,plus_plus(int,X45),hAPP(int,int,plus_plus(int,X46),X47)),
    inference(variable_rename,[status(thm)],[fact_89_zadd__assoc]) ).

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

fof(c_0_41,plain,
    ! [X17,X18] : hAPP(int,int,times_times(int,X17),X18) = hAPP(int,int,times_times(int,X18),X17),
    inference(variable_rename,[status(thm)],[fact_87_zmult__commute]) ).

cnf(c_0_42,plain,
    ( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk3_0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,esk4_0),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(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_31]) ).

cnf(c_0_43,plain,
    ( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk1_0),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),hAPP(nat,int,power_power(int,esk2_0),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int))
    | t != one_one(int) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).

cnf(c_0_44,negated_conjecture,
    hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))),hAPP(nat,int,power_power(int,X2),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,pls),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_34]),c_0_35]) ).

cnf(c_0_45,plain,
    hAPP(int,int,plus_plus(int,X1),X2) = hAPP(int,int,plus_plus(int,X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_46,plain,
    one_one(int) = bit1(pls),
    inference(rw,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_47,plain,
    hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,X1),X2)),X3) = hAPP(int,int,plus_plus(int,X1),hAPP(int,int,plus_plus(int,X2),X3)),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_48,plain,
    hAPP(int,int,plus_plus(int,bit1(X1)),hAPP(int,int,plus_plus(int,X2),X2)) = bit1(hAPP(int,int,plus_plus(int,X1),X2)),
    inference(rw,[status(thm)],[c_0_40,c_0_25]) ).

cnf(c_0_49,hypothesis,
    hAPP(int,int,plus_plus(int,pls),bit1(X1)) = bit1(X1),
    inference(rw,[status(thm)],[c_0_38,c_0_35]) ).

cnf(c_0_50,plain,
    hAPP(int,int,times_times(int,X1),X2) = hAPP(int,int,times_times(int,X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

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

fof(c_0_52,plain,
    ! [X12,X13,X14] :
      ( ~ order(X12)
      | ~ hBOOL(hAPP(X12,bool,hAPP(X12,fun(X12,bool),ord_less_eq(X12),X13),X14))
      | ti(X12,X13) = ti(X12,X14)
      | hBOOL(hAPP(X12,bool,hAPP(X12,fun(X12,bool),ord_less(X12),X13),X14)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_332_order__le__neq__implies__less])])])])]) ).

cnf(c_0_53,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_54,plain,
    ti(int,t) = t,
    inference(split_conjunct,[status(thm)],[tsy_v_t_____res]) ).

cnf(c_0_55,plain,
    ( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk1_0),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))),hAPP(nat,int,power_power(int,esk2_0),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,pls),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int))
    | one_one(int) != t ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_34]),c_0_34]),c_0_35]) ).

cnf(c_0_56,negated_conjecture,
    hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))),hAPP(nat,int,power_power(int,X2),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))) != hAPP(int,int,plus_plus(int,bit1(pls)),hAPP(int,int,times_times(int,m),hAPP(int,int,plus_plus(int,pls),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(bit1(pls)))))),
    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_44,c_0_45]),c_0_46]),c_0_47]),c_0_48]),c_0_49]),c_0_50]) ).

cnf(c_0_57,plain,
    ( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk3_0),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))),hAPP(nat,int,power_power(int,esk4_0),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,pls),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int))
    | ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_34]),c_0_34]),c_0_35]) ).

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

cnf(c_0_59,plain,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),bit1(pls)),t)),
    inference(rw,[status(thm)],[c_0_53,c_0_46]) ).

cnf(c_0_60,plain,
    ti(int,X1) = hAPP(int,int,plus_plus(int,pls),X1),
    inference(rw,[status(thm)],[c_0_28,c_0_35]) ).

cnf(c_0_61,plain,
    hAPP(int,int,plus_plus(int,pls),t) = t,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_28]),c_0_35]) ).

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

cnf(c_0_63,plain,
    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)],[c_0_55,c_0_45]),c_0_46]),c_0_47]),c_0_48]),c_0_49]),c_0_50]),c_0_46]),c_0_56]) ).

cnf(c_0_64,plain,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(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)],[c_0_57,c_0_45]),c_0_46]),c_0_47]),c_0_48]),c_0_49]),c_0_50]),c_0_46]),c_0_56]) ).

cnf(c_0_65,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(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_49]),c_0_28]),c_0_35]),c_0_61]),c_0_62])]),c_0_63]),c_0_64]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NUM926+7 : TPTP v8.1.0. Released v5.3.0.
% 0.04/0.12  % Command  : run_ET %s %d
% 0.13/0.33  % Computer : n007.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jul  6 08:49:28 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.53/23.54  eprover: CPU time limit exceeded, terminating
% 0.53/23.54  eprover: CPU time limit exceeded, terminating
% 0.53/23.55  eprover: CPU time limit exceeded, terminating
% 0.53/23.55  eprover: CPU time limit exceeded, terminating
% 0.54/25.71  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.54/25.71  
% 0.54/25.71  # Failure: Resource limit exceeded (time)
% 0.54/25.71  # OLD status Res
% 0.54/25.71  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.54/25.71  # Preprocessing time       : 0.078 s
% 0.54/25.71  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.54/25.71  # Preprocessing time       : 0.212 s
% 0.54/25.71  
% 0.54/25.71  # Proof found!
% 0.54/25.71  # SZS status Theorem
% 0.54/25.71  # SZS output start CNFRefutation
% See solution above
% 0.54/25.71  # Proof object total steps             : 66
% 0.54/25.71  # Proof object clause steps            : 36
% 0.54/25.71  # Proof object formula steps           : 30
% 0.54/25.71  # Proof object conjectures             : 7
% 0.54/25.71  # Proof object clause conjectures      : 4
% 0.54/25.71  # Proof object formula conjectures     : 3
% 0.54/25.71  # Proof object initial clauses used    : 17
% 0.54/25.71  # Proof object initial formulas used   : 17
% 0.54/25.71  # Proof object generating inferences   : 1
% 0.54/25.71  # Proof object simplifying inferences  : 62
% 0.54/25.71  # Training examples: 0 positive, 0 negative
% 0.54/25.71  # Parsed axioms                        : 1255
% 0.54/25.71  # Removed by relevancy pruning/SinE    : 0
% 0.54/25.71  # Initial clauses                      : 1737
% 0.54/25.71  # Removed in clause preprocessing      : 85
% 0.54/25.71  # Initial clauses in saturation        : 1652
% 0.54/25.71  # Processed clauses                    : 3072
% 0.54/25.71  # ...of these trivial                  : 223
% 0.54/25.71  # ...subsumed                          : 1129
% 0.54/25.71  # ...remaining for further processing  : 1720
% 0.54/25.71  # Other redundant clauses eliminated   : 61
% 0.54/25.71  # Clauses deleted for lack of memory   : 0
% 0.54/25.71  # Backward-subsumed                    : 10
% 0.54/25.71  # Backward-rewritten                   : 208
% 0.54/25.71  # Generated clauses                    : 83203
% 0.54/25.71  # ...of the previous two non-trivial   : 77674
% 0.54/25.71  # Contextual simplify-reflections      : 185
% 0.54/25.71  # Paramodulations                      : 83104
% 0.54/25.71  # Factorizations                       : 15
% 0.54/25.71  # Equation resolutions                 : 84
% 0.54/25.71  # Current number of processed clauses  : 1486
% 0.54/25.71  #    Positive orientable unit clauses  : 349
% 0.54/25.71  #    Positive unorientable unit clauses: 19
% 0.54/25.71  #    Negative unit clauses             : 58
% 0.54/25.71  #    Non-unit-clauses                  : 1060
% 0.54/25.71  # Current number of unprocessed clauses: 67739
% 0.54/25.71  # ...number of literals in the above   : 215928
% 0.54/25.71  # Current number of archived formulas  : 0
% 0.54/25.71  # Current number of archived clauses   : 221
% 0.54/25.71  # Clause-clause subsumption calls (NU) : 258962
% 0.54/25.71  # Rec. Clause-clause subsumption calls : 124938
% 0.54/25.71  # Non-unit clause-clause subsumptions  : 735
% 0.54/25.71  # Unit Clause-clause subsumption calls : 6368
% 0.54/25.71  # Rewrite failures with RHS unbound    : 0
% 0.54/25.71  # BW rewrite match attempts            : 23070
% 0.54/25.71  # BW rewrite match successes           : 597
% 0.54/25.71  # Condensation attempts                : 0
% 0.54/25.71  # Condensation successes               : 0
% 0.54/25.71  # Termbank termtop insertions          : 4191529
% 0.54/25.71  
% 0.54/25.71  # -------------------------------------------------
% 0.54/25.71  # User time                : 1.702 s
% 0.54/25.71  # System time              : 0.040 s
% 0.54/25.71  # Total time               : 1.742 s
% 0.54/25.71  # Maximum resident set size: 81516 pages
% 0.54/46.57  eprover: CPU time limit exceeded, terminating
% 0.54/46.57  eprover: CPU time limit exceeded, terminating
% 0.54/46.57  eprover: CPU time limit exceeded, terminating
% 0.54/46.58  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.54/46.58  eprover: No such file or directory
% 0.54/46.58  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.58  eprover: No such file or directory
% 0.54/46.58  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.58  eprover: No such file or directory
% 0.54/46.59  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.54/46.59  eprover: No such file or directory
% 0.54/46.59  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.59  eprover: No such file or directory
% 0.54/46.59  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.54/46.59  eprover: No such file or directory
% 0.54/46.59  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.59  eprover: No such file or directory
% 0.54/46.59  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.59  eprover: No such file or directory
% 0.54/46.59  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.54/46.59  eprover: No such file or directory
% 0.54/46.60  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.60  eprover: No such file or directory
% 0.54/46.60  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.60  eprover: No such file or directory
% 0.54/46.60  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.54/46.60  eprover: No such file or directory
% 0.54/46.60  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.60  eprover: No such file or directory
% 0.54/46.60  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.60  eprover: No such file or directory
% 0.54/46.60  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.54/46.60  eprover: No such file or directory
% 0.54/46.61  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.61  eprover: No such file or directory
% 0.54/46.61  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.61  eprover: No such file or directory
% 0.54/46.61  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.54/46.61  eprover: No such file or directory
% 0.54/46.61  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.54/46.61  eprover: No such file or directory
% 0.54/46.61  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.61  eprover: No such file or directory
% 0.54/46.61  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.61  eprover: No such file or directory
% 0.54/46.62  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.54/46.62  eprover: No such file or directory
% 0.54/46.62  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.62  eprover: No such file or directory
% 0.54/46.62  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.62  eprover: No such file or directory
% 0.54/46.62  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.54/46.62  eprover: No such file or directory
% 0.54/46.62  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.62  eprover: No such file or directory
% 0.54/46.62  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.62  eprover: No such file or directory
% 0.54/46.62  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.62  eprover: No such file or directory
% 0.54/46.63  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.63  eprover: No such file or directory
% 0.54/46.63  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.54/46.63  eprover: No such file or directory
%------------------------------------------------------------------------------