TSTP Solution File: NUM924+6 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : NUM924+6 : TPTP v7.0.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : n096.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.625MB
% OS       : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan  8 15:22:40 EST 2018

% Result   : Theorem 0.68s
% Output   : CNFRefutation 0.68s
% Verified : 
% SZS Type : None (Could not find formula named 174))
% Syntax   : Number of formulae    : 81

% Comments : 
%------------------------------------------------------------------------------
fof(32,axiom,
    ! [X17] : equal(bit0(X17),plus_plus(int,X17,X17)),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_130_Bit0__def) ).

fof(45,axiom,
    equal(plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_3_t) ).

fof(54,axiom,
    ! [X19] : equal(times_times(int,pls,X19),pls),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_62_mult__Pls) ).

fof(92,axiom,
    number_semiring(nat),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',arity_Nat_Onat___Int_Onumber__semiring) ).

fof(94,axiom,
    ! [X18,X19] : equal(plus_plus(int,number_number_of(int,X18),number_number_of(int,X19)),number_number_of(int,plus_plus(int,X18,X19))),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_67_plus__numeral__code_I9_J) ).

fof(106,axiom,
    ! [X8] : equal(bit0(ti(int,X8)),bit0(X8)),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',tsy_c_Int_OBit0_arg1) ).

fof(131,axiom,
    equal(plus_plus(nat,one_one(nat),one_one(nat)),number_number_of(nat,bit0(bit1(pls)))),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_61_nat__1__add__1) ).

fof(205,axiom,
    ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).

fof(258,axiom,
    ! [X20,X19] : equal(times_times(int,X20,X19),times_times(int,X19,X20)),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_23_zmult__commute) ).

fof(330,axiom,
    ! [X17] : equal(bit1(X17),plus_plus(int,plus_plus(int,one_one(int),X17),X17)),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_162_Bit1__def) ).

fof(337,axiom,
    ! [X52,X53,X54] : equal(plus_plus(int,plus_plus(int,X52,X53),X54),plus_plus(int,X52,plus_plus(int,X53,X54))),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_94_zadd__assoc) ).

fof(365,axiom,
    equal(pls,zero_zero(int)),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_120_Pls__def) ).

fof(392,conjecture,
    ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',conj_0) ).

fof(441,axiom,
    ! [X1] :
      ( number_semiring(X1)
     => equal(plus_plus(X1,one_one(X1),one_one(X1)),number_number_of(X1,bit0(bit1(pls)))) ),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_175_semiring__one__add__one__is__two) ).

fof(443,axiom,
    ! [X20,X19] : equal(plus_plus(int,X20,X19),plus_plus(int,X19,X20)),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_96_zadd__commute) ).

fof(507,axiom,
    ! [X17] : equal(plus_plus(int,pls,X17),ti(int,X17)),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_128_add__Pls) ).

fof(549,axiom,
    ! [X17] : equal(plus_plus(int,X17,pls),ti(int,X17)),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_127_add__Pls__right) ).

fof(552,axiom,
    ! [X17] : equal(number_number_of(int,X17),ti(int,X17)),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_22_number__of__is__id) ).

fof(594,axiom,
    ! [X2,X22,X20] : equal(plus_plus(int,X2,plus_plus(int,X22,X20)),plus_plus(int,X22,plus_plus(int,X2,X20))),
    file('/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1',fact_95_zadd__left__commute) ).

fof(651,negated_conjecture,
    ~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
    inference(assume_negation,[status(cth)],[392]) ).

fof(669,negated_conjecture,
    ~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
    inference(fof_simplification,[status(thm)],[651,theory(equality)]) ).

fof(781,plain,
    ! [X18] : equal(bit0(X18),plus_plus(int,X18,X18)),
    inference(variable_rename,[status(thm)],[32]) ).

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

cnf(830,plain,
    plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
    inference(split_conjunct,[status(thm)],[45]) ).

fof(857,plain,
    ! [X20] : equal(times_times(int,pls,X20),pls),
    inference(variable_rename,[status(thm)],[54]) ).

cnf(858,plain,
    times_times(int,pls,X1) = pls,
    inference(split_conjunct,[status(thm)],[857]) ).

cnf(984,plain,
    number_semiring(nat),
    inference(split_conjunct,[status(thm)],[92]) ).

fof(986,plain,
    ! [X20,X21] : equal(plus_plus(int,number_number_of(int,X20),number_number_of(int,X21)),number_number_of(int,plus_plus(int,X20,X21))),
    inference(variable_rename,[status(thm)],[94]) ).

cnf(987,plain,
    plus_plus(int,number_number_of(int,X1),number_number_of(int,X2)) = number_number_of(int,plus_plus(int,X1,X2)),
    inference(split_conjunct,[status(thm)],[986]) ).

fof(1022,plain,
    ! [X9] : equal(bit0(ti(int,X9)),bit0(X9)),
    inference(variable_rename,[status(thm)],[106]) ).

cnf(1023,plain,
    bit0(ti(int,X1)) = bit0(X1),
    inference(split_conjunct,[status(thm)],[1022]) ).

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

cnf(1356,plain,
    ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
    inference(split_conjunct,[status(thm)],[205]) ).

fof(1532,plain,
    ! [X21,X22] : equal(times_times(int,X21,X22),times_times(int,X22,X21)),
    inference(variable_rename,[status(thm)],[258]) ).

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

fof(1743,plain,
    ! [X18] : equal(bit1(X18),plus_plus(int,plus_plus(int,one_one(int),X18),X18)),
    inference(variable_rename,[status(thm)],[330]) ).

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

fof(1764,plain,
    ! [X55,X56,X57] : equal(plus_plus(int,plus_plus(int,X55,X56),X57),plus_plus(int,X55,plus_plus(int,X56,X57))),
    inference(variable_rename,[status(thm)],[337]) ).

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

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

cnf(1918,negated_conjecture,
    ~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
    inference(split_conjunct,[status(thm)],[669]) ).

fof(2076,plain,
    ! [X1] :
      ( ~ number_semiring(X1)
      | equal(plus_plus(X1,one_one(X1),one_one(X1)),number_number_of(X1,bit0(bit1(pls)))) ),
    inference(fof_nnf,[status(thm)],[441]) ).

fof(2077,plain,
    ! [X2] :
      ( ~ number_semiring(X2)
      | equal(plus_plus(X2,one_one(X2),one_one(X2)),number_number_of(X2,bit0(bit1(pls)))) ),
    inference(variable_rename,[status(thm)],[2076]) ).

cnf(2078,plain,
    ( plus_plus(X1,one_one(X1),one_one(X1)) = number_number_of(X1,bit0(bit1(pls)))
    | ~ number_semiring(X1) ),
    inference(split_conjunct,[status(thm)],[2077]) ).

fof(2082,plain,
    ! [X21,X22] : equal(plus_plus(int,X21,X22),plus_plus(int,X22,X21)),
    inference(variable_rename,[status(thm)],[443]) ).

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

fof(2284,plain,
    ! [X18] : equal(plus_plus(int,pls,X18),ti(int,X18)),
    inference(variable_rename,[status(thm)],[507]) ).

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

fof(2419,plain,
    ! [X18] : equal(plus_plus(int,X18,pls),ti(int,X18)),
    inference(variable_rename,[status(thm)],[549]) ).

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

fof(2432,plain,
    ! [X18] : equal(number_number_of(int,X18),ti(int,X18)),
    inference(variable_rename,[status(thm)],[552]) ).

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

fof(2551,plain,
    ! [X23,X24,X25] : equal(plus_plus(int,X23,plus_plus(int,X24,X25)),plus_plus(int,X24,plus_plus(int,X23,X25))),
    inference(variable_rename,[status(thm)],[594]) ).

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

cnf(2728,plain,
    plus_plus(int,ti(int,X1),ti(int,X1)) = plus_plus(int,X1,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[1023,782,theory(equality)]),782,theory(equality)]),
    [unfolding] ).

cnf(2746,plain,
    plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls))),
    inference(rw,[status(thm)],[1117,782,theory(equality)]),
    [unfolding] ).

cnf(2769,plain,
    times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),t) = plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))),one_one(int)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[830,782,theory(equality)]),782,theory(equality)]),782,theory(equality)]),
    [unfolding] ).

cnf(2775,plain,
    ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),zero_zero(int))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1356,782,theory(equality)]),782,theory(equality)]),782,theory(equality)]),782,theory(equality)]),
    [unfolding] ).

cnf(2827,plain,
    ( plus_plus(X1,one_one(X1),one_one(X1)) = number_number_of(X1,plus_plus(int,bit1(pls),bit1(pls)))
    | ~ number_semiring(X1) ),
    inference(rw,[status(thm)],[2078,782,theory(equality)]),
    [unfolding] ).

cnf(2883,negated_conjecture,
    ~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))),one_one(int)),zero_zero(int)),
    inference(rw,[status(thm)],[1918,782,theory(equality)]),
    [unfolding] ).

cnf(2910,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)],[2746,1744,theory(equality)]),1744,theory(equality)]),
    [unfolding] ).

cnf(2933,plain,
    times_times(int,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) = plus_plus(int,power_power(int,s,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)))),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)],[2769,1744,theory(equality)]),1744,theory(equality)]),1744,theory(equality)]),1744,theory(equality)]),1744,theory(equality)]),1744,theory(equality)]),
    [unfolding] ).

cnf(2939,plain,
    ord_less(int,times_times(int,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),times_times(int,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)),zero_zero(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)],[2775,1744,theory(equality)]),1744,theory(equality)]),1744,theory(equality)]),1744,theory(equality)]),1744,theory(equality)]),1744,theory(equality)]),1744,theory(equality)]),1744,theory(equality)]),
    [unfolding] ).

cnf(2996,plain,
    ( plus_plus(X1,one_one(X1),one_one(X1)) = number_number_of(X1,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)))
    | ~ number_semiring(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[2827,1744,theory(equality)]),1744,theory(equality)]),
    [unfolding] ).

cnf(3062,negated_conjecture,
    ~ ord_less(int,plus_plus(int,power_power(int,s,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)))),one_one(int)),zero_zero(int)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[2883,1744,theory(equality)]),1744,theory(equality)]),
    [unfolding] ).

cnf(3076,negated_conjecture,
    ~ ord_less(int,plus_plus(int,power_power(int,s,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)))),one_one(int)),pls),
    inference(rw,[status(thm)],[3062,1844,theory(equality)]) ).

cnf(3083,negated_conjecture,
    ~ ord_less(int,plus_plus(int,power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat))),one_one(int)),pls),
    inference(rw,[status(thm)],[3076,2910,theory(equality)]) ).

cnf(3168,plain,
    plus_plus(int,X1,pls) = number_number_of(int,X1),
    inference(rw,[status(thm)],[2420,2433,theory(equality)]) ).

cnf(3182,plain,
    plus_plus(int,pls,X1) = plus_plus(int,X1,pls),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[2285,2433,theory(equality)]),3168,theory(equality)]) ).

cnf(3568,plain,
    plus_plus(int,plus_plus(int,X1,pls),plus_plus(int,X2,pls)) = number_number_of(int,plus_plus(int,X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[987,3168,theory(equality)]),3168,theory(equality)]) ).

cnf(3569,plain,
    plus_plus(int,plus_plus(int,X1,pls),plus_plus(int,X2,pls)) = plus_plus(int,pls,plus_plus(int,X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[3568,3168,theory(equality)]),2083,theory(equality)]) ).

cnf(4455,plain,
    plus_plus(int,pls,plus_plus(int,X1,X1)) = plus_plus(int,X1,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2728,2433,theory(equality)]),3168,theory(equality)]),2433,theory(equality)]),3168,theory(equality)]),3569,theory(equality)]) ).

cnf(5033,plain,
    ( number_number_of(X1,plus_plus(int,one_one(int),one_one(int))) = plus_plus(X1,one_one(X1),one_one(X1))
    | ~ number_semiring(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2996,3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),2083,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]) ).

cnf(5034,plain,
    number_number_of(nat,plus_plus(int,one_one(int),one_one(int))) = plus_plus(nat,one_one(nat),one_one(nat)),
    inference(spm,[status(thm)],[5033,984,theory(equality)]) ).

cnf(6258,plain,
    times_times(int,t,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))) = plus_plus(int,power_power(int,s,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)))),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)],[2933,3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),2083,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),2083,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),2552,theory(equality)]),2083,theory(equality)]),3168,theory(equality)]),1765,theory(equality)]),1765,theory(equality)]),2083,theory(equality)]),4455,theory(equality)]),2083,theory(equality)]),1533,theory(equality)]) ).

cnf(6259,plain,
    times_times(int,t,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))) = plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,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)],[6258,3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),2083,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),2083,theory(equality)]) ).

cnf(21003,plain,
    ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,plus_plus(int,one_one(int),one_one(int))))),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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2939,3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),2083,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),2083,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),2552,theory(equality)]),2083,theory(equality)]),3168,theory(equality)]),1765,theory(equality)]),1765,theory(equality)]),2083,theory(equality)]),4455,theory(equality)]),2083,theory(equality)]),1533,theory(equality)]),6259,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),2083,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),3182,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),2083,theory(equality)]),2552,theory(equality)]),2552,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),4455,theory(equality)]),2552,theory(equality)]),2083,theory(equality)]),3168,theory(equality)]),1765,theory(equality)]),1765,theory(equality)]),2083,theory(equality)]),4455,theory(equality)]),2083,theory(equality)]),1844,theory(equality)]),1533,theory(equality)]),858,theory(equality)]) ).

cnf(43049,negated_conjecture,
    ~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat)))),pls),
    inference(rw,[status(thm)],[3083,2083,theory(equality)]) ).

cnf(43264,plain,
    ord_less(int,plus_plus(int,one_one(int),power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat)))),pls),
    inference(rw,[status(thm)],[21003,5034,theory(equality)]) ).

cnf(43265,plain,
    $false,
    inference(sr,[status(thm)],[43264,43049,theory(equality)]) ).

cnf(43266,plain,
    $false,
    43265,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM924+6 : TPTP v7.0.0. Released v5.3.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.02/0.23  % Computer : n096.star.cs.uiowa.edu
% 0.02/0.23  % Model    : x86_64 x86_64
% 0.02/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23  % Memory   : 32218.625MB
% 0.02/0.23  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23  % CPULimit : 300
% 0.02/0.23  % DateTime : Fri Jan  5 15:56:19 CST 2018
% 0.02/0.23  % CPUTime  : 
% 0.06/0.28  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28  --creating new selector for []
% 0.68/1.17  -running prover on /export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1 with time limit 29
% 0.68/1.17  -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpC61haV/sel_theBenchmark.p_1']
% 0.68/1.17  -prover status Theorem
% 0.68/1.17  Problem theBenchmark.p solved in phase 0.
% 0.68/1.17  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.68/1.17  % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.68/1.17  Solved 1 out of 1.
% 0.68/1.17  # Problem is unsatisfiable (or provable), constructing proof object
% 0.68/1.17  # SZS status Theorem
% 0.68/1.17  # SZS output start CNFRefutation.
% See solution above
% 0.68/1.17  # SZS output end CNFRefutation
%------------------------------------------------------------------------------