TSTP Solution File: NUM926+6 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM926+6 : TPTP v8.1.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n011.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:54 EDT 2022

% Result   : Theorem 0.32s 3.51s
% Output   : CNFRefutation 0.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   93 (  71 unt;   0 def)
%            Number of atoms       :  124 (  86 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   62 (  31   ~;  24   |;   1   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :   16 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   18 (  18 usr;   9 con; 0-3 aty)
%            Number of variables   :   99 (  11 sgn  45   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(fact_123_add__Pls__right,axiom,
    ! [X19] : plus_plus(int,X19,pls) = ti(int,X19),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_123_add__Pls__right) ).

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

fof(fact_149_add__Bit1__Bit0,axiom,
    ! [X19,X48] : plus_plus(int,bit1(X19),bit0(X48)) = bit1(plus_plus(int,X19,X48)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_149_add__Bit1__Bit0) ).

fof(fact_126_Bit0__def,axiom,
    ! [X19] : bit0(X19) = plus_plus(int,X19,X19),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_126_Bit0__def) ).

fof(fact_151_Bit1__def,axiom,
    ! [X19] : bit1(X19) = plus_plus(int,plus_plus(int,one_one(int),X19),X19),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_151_Bit1__def) ).

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

fof(fact_124_add__Pls,axiom,
    ! [X19] : plus_plus(int,pls,X19) = ti(int,X19),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_124_add__Pls) ).

fof(fact_89_zadd__commute,axiom,
    ! [X16,X12] : plus_plus(int,X16,X12) = plus_plus(int,X12,X16),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_89_zadd__commute) ).

fof(fact_87_zadd__assoc,axiom,
    ! [X40,X41,X42] : plus_plus(int,plus_plus(int,X40,X41),X42) = plus_plus(int,X40,plus_plus(int,X41,X42)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_87_zadd__assoc) ).

fof(fact_37_nat__1__add__1,axiom,
    plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_37_nat__1__add__1) ).

fof(fact_158_one__is__num__one,axiom,
    one_one(int) = number_number_of(int,bit1(pls)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_158_one__is__num__one) ).

fof(fact_120_Bit0__Pls,axiom,
    bit0(pls) = pls,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_120_Bit0__Pls) ).

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,
    ( ord_less(int,one_one(int),t)
   => ? [X5,X6] : plus_plus(int,power_power(int,X5,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X6,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/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(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)
   => ? [X5,X6] : plus_plus(int,power_power(int,X5,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X6,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/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_85_zmult__commute,axiom,
    ! [X16,X12] : times_times(int,X16,X12) = times_times(int,X12,X16),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_85_zmult__commute) ).

fof(fact_88_zadd__left__commute,axiom,
    ! [X9,X10,X16] : plus_plus(int,X9,plus_plus(int,X10,X16)) = plus_plus(int,X10,plus_plus(int,X9,X16)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_88_zadd__left__commute) ).

fof(fact_241_int__one__le__iff__zero__less,axiom,
    ! [X17] :
      ( ord_less_eq(int,one_one(int),X17)
    <=> ord_less(int,zero_zero(int),X17) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_241_int__one__le__iff__zero__less) ).

fof(fact_327_order__le__neq__implies__less,axiom,
    ! [X3] :
      ( order(X3)
     => ! [X9,X10] :
          ( ord_less_eq(X3,X9,X10)
         => ( ti(X3,X9) != ti(X3,X10)
           => ord_less(X3,X9,X10) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_327_order__le__neq__implies__less) ).

fof(fact_202_Pls__def,axiom,
    pls = zero_zero(int),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_202_Pls__def) ).

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

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

fof(fact_0_tpos,axiom,
    ord_less_eq(int,one_one(int),t),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_0_tpos) ).

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

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

fof(c_0_24,plain,
    ! [X49,X50] : plus_plus(int,bit1(X49),bit0(X50)) = bit1(plus_plus(int,X49,X50)),
    inference(variable_rename,[status(thm)],[fact_149_add__Bit1__Bit0]) ).

fof(c_0_25,plain,
    ! [X20] : bit0(X20) = plus_plus(int,X20,X20),
    inference(variable_rename,[status(thm)],[fact_126_Bit0__def]) ).

fof(c_0_26,plain,
    ! [X20] : bit1(X20) = plus_plus(int,plus_plus(int,one_one(int),X20),X20),
    inference(variable_rename,[status(thm)],[fact_151_Bit1__def]) ).

fof(c_0_27,negated_conjecture,
    ~ ? [X5,X6] : plus_plus(int,power_power(int,X5,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X6,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(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_28,plain,
    ! [X20] : plus_plus(int,pls,X20) = ti(int,X20),
    inference(variable_rename,[status(thm)],[fact_124_add__Pls]) ).

cnf(c_0_29,plain,
    plus_plus(int,X1,pls) = ti(int,X1),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

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

cnf(c_0_31,plain,
    plus_plus(int,bit1(X1),bit0(X2)) = bit1(plus_plus(int,X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

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

cnf(c_0_33,plain,
    bit1(X1) = plus_plus(int,plus_plus(int,one_one(int),X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

fof(c_0_34,plain,
    ! [X17,X18] : plus_plus(int,X17,X18) = plus_plus(int,X18,X17),
    inference(variable_rename,[status(thm)],[fact_89_zadd__commute]) ).

fof(c_0_35,plain,
    ! [X43,X44,X45] : plus_plus(int,plus_plus(int,X43,X44),X45) = plus_plus(int,X43,plus_plus(int,X44,X45)),
    inference(variable_rename,[status(thm)],[fact_87_zadd__assoc]) ).

fof(c_0_36,negated_conjecture,
    ! [X7,X8] : plus_plus(int,power_power(int,X7,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X8,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(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_27])]) ).

cnf(c_0_37,plain,
    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_38,plain,
    plus_plus(int,pls,X1) = ti(int,X1),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_39,plain,
    number_number_of(int,X1) = plus_plus(int,X1,pls),
    inference(rw,[status(thm)],[c_0_29,c_0_30]) ).

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

cnf(c_0_41,plain,
    plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),X1),X1),plus_plus(int,X2,X2)) = plus_plus(int,plus_plus(int,one_one(int),plus_plus(int,X1,X2)),plus_plus(int,X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_33]) ).

cnf(c_0_42,plain,
    plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_43,plain,
    plus_plus(int,plus_plus(int,X1,X2),X3) = plus_plus(int,X1,plus_plus(int,X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_44,plain,
    bit0(pls) = pls,
    inference(split_conjunct,[status(thm)],[fact_120_Bit0__Pls]) ).

fof(c_0_45,plain,
    ( ~ ord_less(int,one_one(int),t)
    | plus_plus(int,power_power(int,esk3_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(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])])])])]) ).

fof(c_0_46,plain,
    ( t != one_one(int)
    | plus_plus(int,power_power(int,esk1_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(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_47,negated_conjecture,
    plus_plus(int,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X2,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_48,plain,
    plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_32]),c_0_33]),c_0_33]) ).

cnf(c_0_49,plain,
    plus_plus(int,X1,pls) = plus_plus(int,pls,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_30]),c_0_39]) ).

cnf(c_0_50,plain,
    one_one(int) = number_number_of(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls)),
    inference(rw,[status(thm)],[c_0_40,c_0_33]) ).

cnf(c_0_51,plain,
    plus_plus(int,X1,plus_plus(int,one_one(int),plus_plus(int,X1,plus_plus(int,X2,X2)))) = plus_plus(int,one_one(int),plus_plus(int,X1,plus_plus(int,X2,plus_plus(int,X1,X2)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_43]),c_0_43]),c_0_43]) ).

cnf(c_0_52,plain,
    plus_plus(int,pls,pls) = pls,
    inference(rw,[status(thm)],[c_0_44,c_0_32]) ).

cnf(c_0_53,plain,
    ( plus_plus(int,power_power(int,esk3_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))
    | ~ ord_less(int,one_one(int),t) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_54,plain,
    ( plus_plus(int,power_power(int,esk1_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(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_46]) ).

cnf(c_0_55,negated_conjecture,
    plus_plus(int,power_power(int,X1,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,X2,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))) != plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),
    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_47,c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]) ).

cnf(c_0_56,plain,
    number_number_of(nat,plus_plus(int,plus_plus(int,pls,plus_plus(int,pls,one_one(int))),plus_plus(int,pls,plus_plus(int,pls,one_one(int))))) = plus_plus(nat,one_one(nat),one_one(nat)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_49]),c_0_49]),c_0_49]) ).

fof(c_0_57,plain,
    ! [X17,X18] : times_times(int,X17,X18) = times_times(int,X18,X17),
    inference(variable_rename,[status(thm)],[fact_85_zmult__commute]) ).

cnf(c_0_58,plain,
    plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,one_one(int)))) = one_one(int),
    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_50,c_0_39]),c_0_49]),c_0_49]),c_0_43]),c_0_43]),c_0_49]) ).

cnf(c_0_59,plain,
    plus_plus(int,pls,plus_plus(int,pls,one_one(int))) = plus_plus(int,pls,one_one(int)),
    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_51,c_0_52]),c_0_52]),c_0_52]),c_0_49]),c_0_52]),c_0_52]),c_0_49]) ).

fof(c_0_60,plain,
    ! [X17,X18,X19] : plus_plus(int,X17,plus_plus(int,X18,X19)) = plus_plus(int,X18,plus_plus(int,X17,X19)),
    inference(variable_rename,[status(thm)],[fact_88_zadd__left__commute]) ).

cnf(c_0_61,plain,
    ( plus_plus(int,power_power(int,esk3_0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,esk4_0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))) = plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int))
    | ~ ord_less(int,one_one(int),t) ),
    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_53,c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]) ).

fof(c_0_62,plain,
    ! [X18,X18] :
      ( ( ~ ord_less_eq(int,one_one(int),X18)
        | ord_less(int,zero_zero(int),X18) )
      & ( ~ ord_less(int,zero_zero(int),X18)
        | ord_less_eq(int,one_one(int),X18) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_241_int__one__le__iff__zero__less])])])]) ).

cnf(c_0_63,plain,
    ( plus_plus(int,power_power(int,esk1_0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,esk2_0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))) = plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),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)],[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_54,c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]) ).

cnf(c_0_64,negated_conjecture,
    plus_plus(int,power_power(int,X1,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,X2,plus_plus(nat,one_one(nat),one_one(nat)))) != plus_plus(int,times_times(int,plus_plus(int,pls,plus_plus(int,plus_plus(int,plus_plus(int,pls,plus_plus(int,pls,one_one(int))),plus_plus(int,pls,plus_plus(int,pls,one_one(int)))),plus_plus(int,plus_plus(int,pls,plus_plus(int,pls,one_one(int))),plus_plus(int,pls,plus_plus(int,pls,one_one(int)))))),m),one_one(int)),
    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_55,c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_56]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_56]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_39]),c_0_49]) ).

cnf(c_0_65,plain,
    times_times(int,X1,X2) = times_times(int,X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_57]) ).

cnf(c_0_66,plain,
    plus_plus(int,pls,one_one(int)) = one_one(int),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_59]) ).

cnf(c_0_67,plain,
    plus_plus(int,X1,plus_plus(int,X2,X3)) = plus_plus(int,X2,plus_plus(int,X1,X3)),
    inference(split_conjunct,[status(thm)],[c_0_60]) ).

cnf(c_0_68,plain,
    ( plus_plus(int,times_times(int,plus_plus(int,pls,plus_plus(int,plus_plus(int,plus_plus(int,pls,plus_plus(int,pls,one_one(int))),plus_plus(int,pls,plus_plus(int,pls,one_one(int)))),plus_plus(int,plus_plus(int,pls,plus_plus(int,pls,one_one(int))),plus_plus(int,pls,plus_plus(int,pls,one_one(int)))))),m),one_one(int)) = plus_plus(int,power_power(int,esk3_0,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,esk4_0,plus_plus(nat,one_one(nat),one_one(nat))))
    | ~ ord_less(int,one_one(int),t) ),
    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_61,c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_56]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_56]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_39]),c_0_49]) ).

fof(c_0_69,plain,
    ! [X11,X12,X13] :
      ( ~ order(X11)
      | ~ ord_less_eq(X11,X12,X13)
      | ti(X11,X12) = ti(X11,X13)
      | ord_less(X11,X12,X13) ),
    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_327_order__le__neq__implies__less])])])])]) ).

cnf(c_0_70,plain,
    ( ord_less_eq(int,one_one(int),X1)
    | ~ ord_less(int,zero_zero(int),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

cnf(c_0_71,plain,
    pls = zero_zero(int),
    inference(split_conjunct,[status(thm)],[fact_202_Pls__def]) ).

cnf(c_0_72,plain,
    ( ord_less(int,zero_zero(int),X1)
    | ~ ord_less_eq(int,one_one(int),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

cnf(c_0_73,plain,
    ( plus_plus(int,times_times(int,plus_plus(int,pls,plus_plus(int,plus_plus(int,plus_plus(int,pls,plus_plus(int,pls,one_one(int))),plus_plus(int,pls,plus_plus(int,pls,one_one(int)))),plus_plus(int,plus_plus(int,pls,plus_plus(int,pls,one_one(int))),plus_plus(int,pls,plus_plus(int,pls,one_one(int)))))),m),one_one(int)) = plus_plus(int,power_power(int,esk1_0,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,esk2_0,plus_plus(nat,one_one(nat),one_one(nat))))
    | one_one(int) != t ),
    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_63,c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_56]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_56]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_39]),c_0_49]) ).

cnf(c_0_74,negated_conjecture,
    plus_plus(int,power_power(int,X1,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,X2,plus_plus(nat,one_one(nat),one_one(nat)))) != plus_plus(int,one_one(int),times_times(int,m,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int))))))))))),
    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_64,c_0_42]),c_0_65]),c_0_43]),c_0_66]),c_0_66]),c_0_66]),c_0_66]),c_0_43]),c_0_43]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]) ).

cnf(c_0_75,plain,
    plus_plus(int,pls,plus_plus(int,pls,X1)) = plus_plus(int,pls,X1),
    inference(spm,[status(thm)],[c_0_43,c_0_52]) ).

cnf(c_0_76,plain,
    ( plus_plus(int,one_one(int),times_times(int,m,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int))))))))))) = plus_plus(int,power_power(int,esk3_0,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,esk4_0,plus_plus(nat,one_one(nat),one_one(nat))))
    | ~ ord_less(int,one_one(int),t) ),
    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_68,c_0_42]),c_0_65]),c_0_43]),c_0_66]),c_0_66]),c_0_66]),c_0_66]),c_0_43]),c_0_43]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]) ).

cnf(c_0_77,plain,
    plus_plus(int,X1,plus_plus(int,X2,X3)) = plus_plus(int,X3,plus_plus(int,X1,X2)),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_78,plain,
    ( ord_less(X1,X2,X3)
    | ti(X1,X2) = ti(X1,X3)
    | ~ ord_less_eq(X1,X2,X3)
    | ~ order(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_69]) ).

cnf(c_0_79,plain,
    ( ord_less_eq(int,one_one(int),X1)
    | ~ ord_less(int,pls,X1) ),
    inference(rw,[status(thm)],[c_0_70,c_0_71]) ).

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

cnf(c_0_81,plain,
    ti(int,X1) = plus_plus(int,X1,pls),
    inference(rw,[status(thm)],[c_0_30,c_0_39]) ).

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

cnf(c_0_83,plain,
    ( ord_less(int,pls,X1)
    | ~ ord_less_eq(int,one_one(int),X1) ),
    inference(rw,[status(thm)],[c_0_72,c_0_71]) ).

cnf(c_0_84,plain,
    ord_less_eq(int,one_one(int),t),
    inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).

cnf(c_0_85,plain,
    ( plus_plus(int,one_one(int),times_times(int,m,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int))))))))))))))) = plus_plus(int,power_power(int,esk1_0,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,esk2_0,plus_plus(nat,one_one(nat),one_one(nat))))
    | one_one(int) != t ),
    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_73,c_0_42]),c_0_65]),c_0_43]),c_0_43]),c_0_43]),c_0_67]),c_0_67]),c_0_43]),c_0_43]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_43]),c_0_43]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]) ).

cnf(c_0_86,negated_conjecture,
    plus_plus(int,power_power(int,X1,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,X2,plus_plus(nat,one_one(nat),one_one(nat)))) != plus_plus(int,one_one(int),times_times(int,m,plus_plus(int,pls,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_75]),c_0_75]),c_0_75]) ).

cnf(c_0_87,plain,
    ~ ord_less(int,one_one(int),t),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_74]) ).

cnf(c_0_88,plain,
    ( one_one(int) = plus_plus(int,X1,pls)
    | ord_less(int,one_one(int),X1)
    | ~ ord_less(int,pls,X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_30]),c_0_39]),c_0_80])]),c_0_81]),c_0_49]),c_0_66]) ).

cnf(c_0_89,plain,
    plus_plus(int,pls,t) = t,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_30]),c_0_39]),c_0_42]) ).

cnf(c_0_90,plain,
    ord_less(int,pls,t),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_91,plain,
    one_one(int) != 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)],[c_0_85,c_0_75]),c_0_75]),c_0_75]),c_0_75]),c_0_75]),c_0_75]),c_0_75]),c_0_75]),c_0_86]) ).

cnf(c_0_92,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_42]),c_0_89]),c_0_90])]),c_0_91]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : NUM926+6 : TPTP v8.1.0. Released v5.3.0.
% 0.07/0.14  % Command  : run_ET %s %d
% 0.14/0.36  % Computer : n011.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Thu Jul  7 17:21:54 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.32/3.51  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.32/3.51  # Preprocessing time       : 0.118 s
% 0.32/3.51  
% 0.32/3.51  # Proof found!
% 0.32/3.51  # SZS status Theorem
% 0.32/3.51  # SZS output start CNFRefutation
% See solution above
% 0.32/3.51  # Proof object total steps             : 93
% 0.32/3.51  # Proof object clause steps            : 55
% 0.32/3.51  # Proof object formula steps           : 38
% 0.32/3.51  # Proof object conjectures             : 8
% 0.32/3.51  # Proof object clause conjectures      : 5
% 0.32/3.51  # Proof object formula conjectures     : 3
% 0.32/3.51  # Proof object initial clauses used    : 23
% 0.32/3.51  # Proof object initial formulas used   : 22
% 0.32/3.51  # Proof object generating inferences   : 7
% 0.32/3.51  # Proof object simplifying inferences  : 221
% 0.32/3.51  # Training examples: 0 positive, 0 negative
% 0.32/3.51  # Parsed axioms                        : 653
% 0.32/3.51  # Removed by relevancy pruning/SinE    : 0
% 0.32/3.51  # Initial clauses                      : 854
% 0.32/3.51  # Removed in clause preprocessing      : 8
% 0.32/3.51  # Initial clauses in saturation        : 846
% 0.32/3.51  # Processed clauses                    : 12344
% 0.32/3.51  # ...of these trivial                  : 300
% 0.32/3.51  # ...subsumed                          : 9048
% 0.32/3.51  # ...remaining for further processing  : 2996
% 0.32/3.51  # Other redundant clauses eliminated   : 22
% 0.32/3.51  # Clauses deleted for lack of memory   : 0
% 0.32/3.51  # Backward-subsumed                    : 76
% 0.32/3.51  # Backward-rewritten                   : 422
% 0.32/3.51  # Generated clauses                    : 132549
% 0.32/3.51  # ...of the previous two non-trivial   : 121346
% 0.32/3.51  # Contextual simplify-reflections      : 571
% 0.32/3.51  # Paramodulations                      : 132461
% 0.32/3.51  # Factorizations                       : 12
% 0.32/3.51  # Equation resolutions                 : 72
% 0.32/3.51  # Current number of processed clauses  : 2490
% 0.32/3.51  #    Positive orientable unit clauses  : 323
% 0.32/3.51  #    Positive unorientable unit clauses: 24
% 0.32/3.51  #    Negative unit clauses             : 300
% 0.32/3.51  #    Non-unit-clauses                  : 1843
% 0.32/3.51  # Current number of unprocessed clauses: 90364
% 0.32/3.51  # ...number of literals in the above   : 261203
% 0.32/3.51  # Current number of archived formulas  : 0
% 0.32/3.51  # Current number of archived clauses   : 504
% 0.32/3.51  # Clause-clause subsumption calls (NU) : 668295
% 0.32/3.51  # Rec. Clause-clause subsumption calls : 416018
% 0.32/3.51  # Non-unit clause-clause subsumptions  : 2914
% 0.32/3.51  # Unit Clause-clause subsumption calls : 44312
% 0.32/3.51  # Rewrite failures with RHS unbound    : 0
% 0.32/3.51  # BW rewrite match attempts            : 7167
% 0.32/3.51  # BW rewrite match successes           : 746
% 0.32/3.51  # Condensation attempts                : 0
% 0.32/3.51  # Condensation successes               : 0
% 0.32/3.51  # Termbank termtop insertions          : 3260332
% 0.32/3.51  
% 0.32/3.51  # -------------------------------------------------
% 0.32/3.51  # User time                : 2.110 s
% 0.32/3.51  # System time              : 0.061 s
% 0.32/3.51  # Total time               : 2.171 s
% 0.32/3.51  # Maximum resident set size: 87608 pages
% 0.32/23.48  eprover: CPU time limit exceeded, terminating
% 0.32/23.48  eprover: CPU time limit exceeded, terminating
% 0.32/23.49  eprover: CPU time limit exceeded, terminating
% 0.32/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.50  eprover: No such file or directory
% 0.32/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.50  eprover: No such file or directory
% 0.32/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.50  eprover: No such file or directory
% 0.32/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.50  eprover: No such file or directory
% 0.32/23.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.51  eprover: No such file or directory
% 0.32/23.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.51  eprover: No such file or directory
% 0.32/23.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.51  eprover: No such file or directory
% 0.32/23.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.51  eprover: No such file or directory
% 0.32/23.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.51  eprover: No such file or directory
% 0.32/23.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.52  eprover: No such file or directory
% 0.32/23.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.52  eprover: No such file or directory
% 0.32/23.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.52  eprover: No such file or directory
% 0.32/23.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.52  eprover: No such file or directory
% 0.32/23.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.52  eprover: No such file or directory
% 0.32/23.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.52  eprover: No such file or directory
% 0.32/23.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.52  eprover: No such file or directory
% 0.32/23.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.53  eprover: No such file or directory
% 0.32/23.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.53  eprover: No such file or directory
% 0.32/23.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.53  eprover: No such file or directory
% 0.32/23.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.53  eprover: No such file or directory
% 0.32/23.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.53  eprover: No such file or directory
% 0.32/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.54  eprover: No such file or directory
% 0.32/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.54  eprover: No such file or directory
% 0.32/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.54  eprover: No such file or directory
% 0.32/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.54  eprover: No such file or directory
% 0.32/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.54  eprover: No such file or directory
% 0.32/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.54  eprover: No such file or directory
% 0.32/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.54  eprover: No such file or directory
% 0.32/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.55  eprover: No such file or directory
% 0.32/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.55  eprover: No such file or directory
% 0.32/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.55  eprover: No such file or directory
% 0.32/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.55  eprover: No such file or directory
% 0.32/23.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.32/23.56  eprover: No such file or directory
%------------------------------------------------------------------------------