↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : NUM926+2 : TPTP v9.3.1. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:56:59 PM UTC 2026

% Result   : Theorem 3.58s 0.96s
% Output   : CNFRefutation 3.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   88 (  70 unt;   0 def)
%            Number of atoms       :  138 (  88 equ)
%            Maximal formula atoms :   13 (   1 avg)
%            Number of connectives :   86 (  36   ~;  29   |;  14   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   2 avg)
%            Maximal term depth    :   15 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   9 con; 0-2 aty)
%            Number of variables   :   90 (   8 sgn  44   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(fact_251_Bit1__def,axiom,
    ! [X23] : bit1(X23) = plus_plus_int(plus_plus_int(one_one_int,X23),X23),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_251_Bit1__def) ).

fof(conj_0,conjecture,
    ? [X3,X4] : plus_plus_int(power_power_int(X3,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X4,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/sandbox2/benchmark/theBenchmark.p',conj_0) ).

fof(fact_264_semiring__norm_I110_J,axiom,
    one_one_int = number_number_of_int(bit1(pls)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_264_semiring__norm_I110_J) ).

fof(fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J,axiom,
    ! [X84,X85] : plus_plus_int(X84,X85) = plus_plus_int(X85,X84),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).

fof(fact_201_add__Pls__right,axiom,
    ! [X23] :
      ( is_int(X23)
     => plus_plus_int(X23,pls) = X23 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_201_add__Pls__right) ).

fof(fact_253_number__of__Bit1,axiom,
    ! [X141] : number_number_of_int(bit1(X141)) = plus_plus_int(plus_plus_int(one_one_int,number_number_of_int(X141)),number_number_of_int(X141)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_253_number__of__Bit1) ).

fof(fact_31_add__special_I3_J,axiom,
    ! [X15] : plus_plus_int(number_number_of_int(X15),one_one_int) = number_number_of_int(plus_plus_int(X15,bit1(pls))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_31_add__special_I3_J) ).

fof(fact_204_Bit0__def,axiom,
    ! [X23] : bit0(X23) = plus_plus_int(X23,X23),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_204_Bit0__def) ).

fof(gsy_c_Groups_Oone__class_Oone_000tc__Int__Oint,hypothesis,
    is_int(one_one_int),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gsy_c_Groups_Oone__class_Oone_000tc__Int__Oint) ).

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
   => ? [X3,X4] :
        ( plus_plus_int(power_power_int(X3,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X4,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)
        & is_int(X4)
        & is_int(X3) ) ),
    file('/export/starexec/sandbox2/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_232_comm__semiring__1__class_Onormalizing__semiring__rules_I4_J,axiom,
    ! [X124] : plus_plus_int(X124,X124) = times_times_int(plus_plus_int(one_one_int,one_one_int),X124),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_232_comm__semiring__1__class_Onormalizing__semiring__rules_I4_J) ).

fof(fact_114_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J,axiom,
    ! [X66,X67] : times_times_int(X66,X67) = times_times_int(X67,X66),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_114_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).

fof(fact_126_comm__semiring__1__class_Onormalizing__semiring__rules_I25_J,axiom,
    ! [X78,X79,X80] : plus_plus_int(X78,plus_plus_int(X79,X80)) = plus_plus_int(plus_plus_int(X78,X79),X80),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_126_comm__semiring__1__class_Onormalizing__semiring__rules_I25_J) ).

fof(fact_248_number__of__add,axiom,
    ! [X139,X140] : number_number_of_int(plus_plus_int(X139,X140)) = plus_plus_int(number_number_of_int(X139),number_number_of_int(X140)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_248_number__of__add) ).

fof(fact_129_comm__semiring__1__class_Onormalizing__semiring__rules_I22_J,axiom,
    ! [X81,X82,X83] : plus_plus_int(X81,plus_plus_int(X82,X83)) = plus_plus_int(X82,plus_plus_int(X81,X83)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_129_comm__semiring__1__class_Onormalizing__semiring__rules_I22_J) ).

fof(fact_37_zless__le,axiom,
    ! [X19,X20] :
      ( ( is_int(X20)
        & is_int(X19) )
     => ( ord_less_int(X19,X20)
      <=> ( X19 != X20
          & ord_less_eq_int(X19,X20) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_37_zless__le) ).

fof(fact_198_Bit0__Pls,axiom,
    bit0(pls) = pls,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_198_Bit0__Pls) ).

fof(fact_390_semiring__norm_I112_J,axiom,
    zero_zero_int = number_number_of_int(pls),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_390_semiring__norm_I112_J) ).

fof(fact_356_Pls__def,axiom,
    pls = zero_zero_int,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_356_Pls__def) ).

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)
   => ? [X3,X4] :
        ( plus_plus_int(power_power_int(X3,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X4,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)
        & is_int(X4)
        & is_int(X3) ) ),
    file('/export/starexec/sandbox2/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(fact_0_tpos,axiom,
    ord_less_eq_int(one_one_int,t),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_tpos) ).

fof(gsy_v_t____,axiom,
    is_int(t),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gsy_v_t____) ).

fof(c_0_22,plain,
    ! [X804] : bit1(X804) = plus_plus_int(plus_plus_int(one_one_int,X804),X804),
    inference(variable_rename,[status(thm)],[fact_251_Bit1__def]) ).

fof(c_0_23,negated_conjecture,
    ~ ? [X3,X4] : plus_plus_int(power_power_int(X3,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X4,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]) ).

cnf(c_0_24,plain,
    one_one_int = number_number_of_int(bit1(pls)),
    inference(split_conjunct,[status(thm)],[fact_264_semiring__norm_I110_J]) ).

cnf(c_0_25,plain,
    bit1(X1) = plus_plus_int(plus_plus_int(one_one_int,X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

fof(c_0_26,plain,
    ! [X568,X569] : plus_plus_int(X568,X569) = plus_plus_int(X569,X568),
    inference(variable_rename,[status(thm)],[fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J]) ).

fof(c_0_27,plain,
    ! [X705] :
      ( plus_plus_int(X705,pls) = X705
      | ~ is_int(X705) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_201_add__Pls__right])])]) ).

fof(c_0_28,plain,
    ! [X806] : number_number_of_int(bit1(X806)) = plus_plus_int(plus_plus_int(one_one_int,number_number_of_int(X806)),number_number_of_int(X806)),
    inference(variable_rename,[status(thm)],[fact_253_number__of__Bit1]) ).

fof(c_0_29,plain,
    ! [X331] : plus_plus_int(number_number_of_int(X331),one_one_int) = number_number_of_int(plus_plus_int(X331,bit1(pls))),
    inference(variable_rename,[status(thm)],[fact_31_add__special_I3_J]) ).

fof(c_0_30,negated_conjecture,
    ! [X1659,X1660] : plus_plus_int(power_power_int(X1659,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1660,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(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).

fof(c_0_31,plain,
    ! [X709] : bit0(X709) = plus_plus_int(X709,X709),
    inference(variable_rename,[status(thm)],[fact_204_Bit0__def]) ).

cnf(c_0_32,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_24,c_0_25]) ).

cnf(c_0_33,plain,
    plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_34,plain,
    ( ~ is_int(X1)
    | plus_plus_int(X1,pls) = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_35,hypothesis,
    is_int(one_one_int),
    inference(split_conjunct,[status(thm)],[gsy_c_Groups_Oone__class_Oone_000tc__Int__Oint]) ).

cnf(c_0_36,plain,
    number_number_of_int(bit1(X1)) = plus_plus_int(plus_plus_int(one_one_int,number_number_of_int(X1)),number_number_of_int(X1)),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_37,plain,
    plus_plus_int(number_number_of_int(X1),one_one_int) = number_number_of_int(plus_plus_int(X1,bit1(pls))),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

fof(c_0_38,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) )
    & ( t != one_one_int
      | is_int(esk2_0) )
    & ( t != one_one_int
      | is_int(esk1_0) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[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_39,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_30]) ).

cnf(c_0_40,plain,
    bit0(X1) = plus_plus_int(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

fof(c_0_41,plain,
    ! [X767] : plus_plus_int(X767,X767) = times_times_int(plus_plus_int(one_one_int,one_one_int),X767),
    inference(variable_rename,[status(thm)],[fact_232_comm__semiring__1__class_Onormalizing__semiring__rules_I4_J]) ).

fof(c_0_42,plain,
    ! [X514,X515] : times_times_int(X514,X515) = times_times_int(X515,X514),
    inference(variable_rename,[status(thm)],[fact_114_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J]) ).

fof(c_0_43,plain,
    ! [X552,X553,X554] : plus_plus_int(X552,plus_plus_int(X553,X554)) = plus_plus_int(plus_plus_int(X552,X553),X554),
    inference(variable_rename,[status(thm)],[fact_126_comm__semiring__1__class_Onormalizing__semiring__rules_I25_J]) ).

fof(c_0_44,plain,
    ! [X798,X799] : number_number_of_int(plus_plus_int(X798,X799)) = plus_plus_int(number_number_of_int(X798),number_number_of_int(X799)),
    inference(variable_rename,[status(thm)],[fact_248_number__of__add]) ).

cnf(c_0_45,plain,
    number_number_of_int(plus_plus_int(pls,plus_plus_int(pls,one_one_int))) = one_one_int,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_33]) ).

cnf(c_0_46,hypothesis,
    plus_plus_int(pls,one_one_int) = one_one_int,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_33]) ).

cnf(c_0_47,plain,
    number_number_of_int(plus_plus_int(plus_plus_int(one_one_int,X1),X1)) = plus_plus_int(plus_plus_int(one_one_int,number_number_of_int(X1)),number_number_of_int(X1)),
    inference(rw,[status(thm)],[c_0_36,c_0_25]) ).

fof(c_0_48,plain,
    ! [X561,X562,X563] : plus_plus_int(X561,plus_plus_int(X562,X563)) = plus_plus_int(X562,plus_plus_int(X561,X563)),
    inference(variable_rename,[status(thm)],[fact_129_comm__semiring__1__class_Onormalizing__semiring__rules_I22_J]) ).

cnf(c_0_49,plain,
    plus_plus_int(number_number_of_int(X1),one_one_int) = number_number_of_int(plus_plus_int(X1,plus_plus_int(plus_plus_int(one_one_int,pls),pls))),
    inference(rw,[status(thm)],[c_0_37,c_0_25]) ).

fof(c_0_50,plain,
    ! [X19,X20] :
      ( ( is_int(X20)
        & is_int(X19) )
     => ( ord_less_int(X19,X20)
      <=> ( X19 != X20
          & ord_less_eq_int(X19,X20) ) ) ),
    inference(fof_simplification,[status(thm)],[fact_37_zless__le]) ).

cnf(c_0_51,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(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_52,plain,
    bit0(pls) = pls,
    inference(split_conjunct,[status(thm)],[fact_198_Bit0__Pls]) ).

cnf(c_0_53,plain,
    zero_zero_int = number_number_of_int(pls),
    inference(split_conjunct,[status(thm)],[fact_390_semiring__norm_I112_J]) ).

cnf(c_0_54,plain,
    pls = zero_zero_int,
    inference(split_conjunct,[status(thm)],[fact_356_Pls__def]) ).

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_39,c_0_40]),c_0_40]),c_0_40]),c_0_40]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).

cnf(c_0_56,plain,
    plus_plus_int(X1,X1) = times_times_int(plus_plus_int(one_one_int,one_one_int),X1),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

cnf(c_0_57,plain,
    times_times_int(X1,X2) = times_times_int(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

cnf(c_0_58,plain,
    plus_plus_int(X1,plus_plus_int(X2,X3)) = plus_plus_int(plus_plus_int(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_59,plain,
    number_number_of_int(plus_plus_int(X1,X2)) = plus_plus_int(number_number_of_int(X1),number_number_of_int(X2)),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

cnf(c_0_60,hypothesis,
    number_number_of_int(one_one_int) = one_one_int,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_46]) ).

cnf(c_0_61,plain,
    plus_plus_int(number_number_of_int(X1),plus_plus_int(one_one_int,number_number_of_int(X1))) = number_number_of_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_33]),c_0_33]) ).

cnf(c_0_62,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_48]) ).

cnf(c_0_63,plain,
    number_number_of_int(plus_plus_int(X1,plus_plus_int(pls,plus_plus_int(pls,one_one_int)))) = plus_plus_int(one_one_int,number_number_of_int(X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_33]),c_0_33]),c_0_33]) ).

fof(c_0_64,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) )
    & ( ~ ord_less_int(one_one_int,t)
      | is_int(esk4_0) )
    & ( ~ ord_less_int(one_one_int,t)
      | is_int(esk3_0) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[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])])])])]) ).

fof(c_0_65,plain,
    ! [X336,X337] :
      ( ( ~ is_int(X337)
        | ~ is_int(X336)
        | ord_less_int(X336,X337)
        | X336 = X337
        | ~ ord_less_eq_int(X336,X337) )
      & ( ~ is_int(X337)
        | ~ is_int(X336)
        | ~ ord_less_int(X336,X337)
        | X336 != X337 )
      & ( ~ is_int(X337)
        | ~ is_int(X336)
        | ~ ord_less_int(X336,X337)
        | ord_less_eq_int(X336,X337) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])])]) ).

cnf(c_0_66,plain,
    ( t != one_one_int
    | 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) ),
    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_51,c_0_40]),c_0_40]),c_0_40]),c_0_40]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).

cnf(c_0_67,plain,
    plus_plus_int(pls,pls) = pls,
    inference(rw,[status(thm)],[c_0_52,c_0_40]) ).

cnf(c_0_68,plain,
    number_number_of_int(pls) = pls,
    inference(rw,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_69,negated_conjecture,
    plus_plus_int(power_power_int(X1,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))))),power_power_int(X2,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_int(one_one_int,times_times_int(m,number_number_of_int(times_times_int(plus_plus_int(one_one_int,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))))))),
    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_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_33]),c_0_56]),c_0_57]),c_0_33]) ).

cnf(c_0_70,hypothesis,
    plus_plus_int(pls,plus_plus_int(one_one_int,X1)) = plus_plus_int(one_one_int,X1),
    inference(spm,[status(thm)],[c_0_58,c_0_46]) ).

cnf(c_0_71,hypothesis,
    number_number_of_int(plus_plus_int(one_one_int,X1)) = plus_plus_int(one_one_int,number_number_of_int(X1)),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_72,plain,
    number_number_of_int(plus_plus_int(X1,plus_plus_int(one_one_int,X1))) = plus_plus_int(one_one_int,number_number_of_int(plus_plus_int(X1,X1))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_59]) ).

cnf(c_0_73,plain,
    number_number_of_int(plus_plus_int(X1,one_one_int)) = plus_plus_int(one_one_int,number_number_of_int(X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_46]),c_0_46]) ).

cnf(c_0_74,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(split_conjunct,[status(thm)],[c_0_64]) ).

cnf(c_0_75,plain,
    ( ~ is_int(X2)
    | ~ is_int(X1)
    | ~ ord_less_eq_int(X1,X2)
    | ord_less_int(X1,X2)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_65]) ).

cnf(c_0_76,plain,
    ord_less_eq_int(one_one_int,t),
    inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).

cnf(c_0_77,plain,
    is_int(t),
    inference(split_conjunct,[status(thm)],[gsy_v_t____]) ).

cnf(c_0_78,plain,
    ( t != one_one_int
    | plus_plus_int(power_power_int(esk1_0,number_number_of_nat(plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(one_one_int,one_one_int))))))),power_power_int(esk2_0,number_number_of_nat(plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(one_one_int,one_one_int)))))))) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(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)))))))))))))) ),
    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)],[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_66,c_0_58]),c_0_33]),c_0_33]),c_0_33]),c_0_58]),c_0_62]),c_0_62]),c_0_62]),c_0_58]),c_0_33]),c_0_33]),c_0_33]),c_0_58]),c_0_62]),c_0_62]),c_0_62]),c_0_58]),c_0_33]),c_0_33]),c_0_33]),c_0_58]),c_0_62]),c_0_62]),c_0_62]),c_0_58]),c_0_33]),c_0_33]),c_0_33]),c_0_58]),c_0_62]),c_0_62]),c_0_62]),c_0_58]),c_0_58]),c_0_58]),c_0_58]),c_0_58]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_57]),c_0_33]) ).

cnf(c_0_79,plain,
    plus_plus_int(pls,plus_plus_int(pls,X1)) = plus_plus_int(pls,X1),
    inference(spm,[status(thm)],[c_0_58,c_0_67]) ).

cnf(c_0_80,plain,
    number_number_of_int(plus_plus_int(pls,X1)) = plus_plus_int(pls,number_number_of_int(X1)),
    inference(spm,[status(thm)],[c_0_59,c_0_68]) ).

cnf(c_0_81,negated_conjecture,
    plus_plus_int(power_power_int(X1,number_number_of_nat(plus_plus_int(one_one_int,one_one_int))),power_power_int(X2,number_number_of_nat(plus_plus_int(one_one_int,one_one_int)))) != plus_plus_int(one_one_int,times_times_int(plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(one_one_int,one_one_int))),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)],[inference(rw,[status(thm)],[c_0_69,c_0_58]),c_0_58]),c_0_62]),c_0_62]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_58]),c_0_58]),c_0_62]),c_0_62]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_58]),c_0_58]),c_0_62]),c_0_62]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_56]),c_0_58]),c_0_71]),c_0_72]),c_0_73]),c_0_60]),c_0_57]) ).

cnf(c_0_82,plain,
    ( ~ ord_less_int(one_one_int,t)
    | 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) ),
    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_74,c_0_40]),c_0_40]),c_0_40]),c_0_40]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).

cnf(c_0_83,plain,
    ( ord_less_int(one_one_int,t)
    | t = one_one_int ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_35])]) ).

cnf(c_0_84,plain,
    t != one_one_int,
    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)],[c_0_78,c_0_79]),c_0_70]),c_0_70]),c_0_70]),c_0_79]),c_0_70]),c_0_70]),c_0_70]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_71]),c_0_72]),c_0_73]),c_0_60]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_57]),c_0_81]) ).

cnf(c_0_85,plain,
    ( ~ ord_less_int(one_one_int,t)
    | plus_plus_int(power_power_int(esk3_0,number_number_of_nat(plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(one_one_int,one_one_int))))))),power_power_int(esk4_0,number_number_of_nat(plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(one_one_int,one_one_int)))))))) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(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)))))))))))))) ),
    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)],[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_82,c_0_58]),c_0_33]),c_0_33]),c_0_33]),c_0_58]),c_0_62]),c_0_62]),c_0_62]),c_0_58]),c_0_33]),c_0_33]),c_0_33]),c_0_58]),c_0_62]),c_0_62]),c_0_62]),c_0_58]),c_0_33]),c_0_33]),c_0_33]),c_0_58]),c_0_62]),c_0_62]),c_0_62]),c_0_58]),c_0_33]),c_0_33]),c_0_33]),c_0_58]),c_0_62]),c_0_62]),c_0_62]),c_0_58]),c_0_58]),c_0_58]),c_0_58]),c_0_58]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_57]),c_0_33]) ).

cnf(c_0_86,plain,
    ord_less_int(one_one_int,t),
    inference(sr,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_87,plain,
    $false,
    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(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_85,c_0_79]),c_0_70]),c_0_70]),c_0_70]),c_0_79]),c_0_70]),c_0_70]),c_0_70]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_71]),c_0_72]),c_0_73]),c_0_60]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_57]),c_0_86])]),c_0_81]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM926+2 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35  % Computer : n011.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Mon Sep 21 03:17:55 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.58/0.96  % Version: 3.5.1
% 3.58/0.96  % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.58/0.96  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.58/0.96  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.58/0.96  % Starting new_bool_3 with 300s (1) cores
% 3.58/0.96  % Starting new_bool_1 with 300s (1) cores
% 3.58/0.96  % Starting sh5l with 300s (1) cores
% 3.58/0.96  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 849143 completed with status 0
% 3.58/0.96  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.58/0.96  % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.58/0.96  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.58/0.96  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.58/0.96  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.58/0.96  % No SInE strategy applied
% 3.58/0.96  % Search class: FGHSM-FSLM31-DFFFFFNN
% 3.58/0.96  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.58/0.96  % Starting SubtermCWHack with 136s (1) cores
% 3.58/0.96  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.58/0.96  % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 354s (1) cores
% 3.58/0.96  % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.58/0.96  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 3.58/0.96  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 849169 completed with status 0
% 3.58/0.96  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.58/0.96  % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.58/0.96  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.58/0.96  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.58/0.96  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.58/0.96  % No SInE strategy applied
% 3.58/0.96  % Search class: FGHSM-FSLM31-DFFFFFNN
% 3.58/0.96  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.58/0.96  % Starting SubtermCWHack with 136s (1) cores
% 3.58/0.96  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.58/0.96  % Preprocessing time       : 0.015 s
% 3.58/0.96  % Presaturation interreduction done
% 3.58/0.96  
% 3.58/0.96  % Proof found!
% 3.58/0.96  % SZS status Theorem
% 3.58/0.96  % SZS output start CNFRefutation
% See solution above
% 3.58/0.96  % Parsed axioms                        : 717
% 3.58/0.96  % Removed by relevancy pruning/SinE    : 0
% 3.58/0.96  % Initial clauses                      : 964
% 3.58/0.96  % Removed in clause preprocessing      : 24
% 3.58/0.96  % Initial clauses in saturation        : 940
% 3.58/0.96  % Processed clauses                    : 3977
% 3.58/0.96  % ...of these trivial                  : 175
% 3.58/0.96  % ...subsumed                          : 2001
% 3.58/0.96  % ...remaining for further processing  : 1800
% 3.58/0.96  % Other redundant clauses eliminated   : 107
% 3.58/0.96  % Clauses deleted for lack of memory   : 0
% 3.58/0.96  % Backward-subsumed                    : 46
% 3.58/0.96  % Backward-rewritten                   : 128
% 3.58/0.96  % Generated clauses                    : 18627
% 3.58/0.96  % ...of the previous two non-redundant : 16118
% 3.58/0.96  % ...aggressively subsumed             : 0
% 3.58/0.96  % Contextual simplify-reflections      : 1
% 3.58/0.96  % Paramodulations                      : 18519
% 3.58/0.96  % Factorizations                       : 5
% 3.58/0.96  % NegExts                              : 0
% 3.58/0.96  % Equation resolutions                 : 116
% 3.58/0.96  % Disequality decompositions           : 0
% 3.58/0.96  % Total rewrite steps                  : 18711
% 3.58/0.96  % ...of those cached                   : 16927
% 3.58/0.96  % Propositional unsat checks           : 0
% 3.58/0.96  %    Propositional check models        : 0
% 3.58/0.96  %    Propositional check unsatisfiable : 0
% 3.58/0.96  %    Propositional clauses             : 0
% 3.58/0.96  %    Propositional clauses after purity: 0
% 3.58/0.96  %    Propositional unsat core size     : 0
% 3.58/0.96  %    Propositional preprocessing time  : 0.000
% 3.58/0.96  %    Propositional encoding time       : 0.000
% 3.58/0.96  %    Propositional solver time         : 0.000
% 3.58/0.96  %    Success case prop preproc time    : 0.000
% 3.58/0.96  %    Success case prop encoding time   : 0.000
% 3.58/0.96  %    Success case prop solver time     : 0.000
% 3.58/0.96  % Current number of processed clauses  : 897
% 3.58/0.96  %    Positive orientable unit clauses  : 261
% 3.58/0.96  %    Positive unorientable unit clauses: 46
% 3.58/0.96  %    Negative unit clauses             : 169
% 3.58/0.96  %    Non-unit-clauses                  : 421
% 3.58/0.96  % Current number of unprocessed clauses: 13646
% 3.58/0.96  % ...number of literals in the above   : 29192
% 3.58/0.96  % Current number of archived formulas  : 0
% 3.58/0.96  % Current number of archived clauses   : 829
% 3.58/0.96  % Clause-clause subsumption calls (NU) : 48896
% 3.58/0.96  % Rec. Clause-clause subsumption calls : 25385
% 3.58/0.96  % Non-unit clause-clause subsumptions  : 274
% 3.58/0.96  % Unit Clause-clause subsumption calls : 5561
% 3.58/0.96  % Rewrite failures with RHS unbound    : 6
% 3.58/0.96  % BW rewrite match attempts            : 1307
% 3.58/0.96  % BW rewrite match successes           : 411
% 3.58/0.96  % Condensation attempts                : 0
% 3.58/0.96  % Condensation successes               : 0
% 3.58/0.96  % Termbank termtop insertions          : 350155
% 3.58/0.96  % Search garbage collected termcells   : 9050
% 3.58/0.96  
% 3.58/0.96  % -------------------------------------------------
% 3.58/0.96  % User time                : 0.485 s
% 3.58/0.96  % System time              : 0.024 s
% 3.58/0.96  % Total time               : 0.510 s
% 3.58/0.96  % Maximum resident set size: 6852 pages
% 3.58/0.96  
% 3.58/0.96  % -------------------------------------------------
% 3.58/0.96  % User time                : 2.225 s
% 3.58/0.96  % System time              : 0.118 s
% 3.58/0.96  % Total time               : 2.343 s
% 3.58/0.96  % Maximum resident set size: 5632 pages
% 3.58/0.96  % E exiting
%------------------------------------------------------------------------------