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

View Problem - Process Solution

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

% Computer : n021.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:44 EDT 2022

% Result   : Theorem 0.28s 1.46s
% Output   : CNFRefutation 0.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   54 (  54 unt;   0 def)
%            Number of atoms       :   54 (  42 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-3 aty)
%            Number of variables   :   50 (   1 sgn  32   !;   0   ?)

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

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

fof(conj_0,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/solver/bin/../tmp/theBenchmark.p',conj_0) ).

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

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

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

fof(fact_3_t,axiom,
    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/solver/bin/../tmp/theBenchmark.p',fact_3_t) ).

fof(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,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/solver/bin/../tmp/theBenchmark.p',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(fact_61_nat__1__add__1,axiom,
    plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',fact_61_nat__1__add__1) ).

fof(fact_94_zadd__assoc,axiom,
    ! [X18,X19,X20] : plus_plus(int,plus_plus(int,X18,X19),X20) = plus_plus(int,X18,plus_plus(int,X19,X20)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',fact_94_zadd__assoc) ).

fof(fact_95_zadd__left__commute,axiom,
    ! [X5,X6,X15] : plus_plus(int,X5,plus_plus(int,X6,X15)) = plus_plus(int,X6,plus_plus(int,X5,X15)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',fact_95_zadd__left__commute) ).

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

fof(fact_96_zadd__commute,axiom,
    ! [X15,X11] : plus_plus(int,X15,X11) = plus_plus(int,X11,X15),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',fact_96_zadd__commute) ).

fof(fact_23_zmult__commute,axiom,
    ! [X15,X11] : times_times(int,X15,X11) = times_times(int,X11,X15),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',fact_23_zmult__commute) ).

fof(fact_62_mult__Pls,axiom,
    ! [X11] : times_times(int,pls,X11) = pls,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',fact_62_mult__Pls) ).

fof(c_0_15,plain,
    ! [X15] : plus_plus(int,X15,pls) = ti(int,X15),
    inference(variable_rename,[status(thm)],[fact_127_add__Pls__right]) ).

fof(c_0_16,plain,
    ! [X15] : number_number_of(int,X15) = ti(int,X15),
    inference(variable_rename,[status(thm)],[fact_22_number__of__is__id]) ).

fof(c_0_17,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)],[conj_0]) ).

fof(c_0_18,plain,
    ! [X15] : bit0(X15) = plus_plus(int,X15,X15),
    inference(variable_rename,[status(thm)],[fact_130_Bit0__def]) ).

fof(c_0_19,plain,
    ! [X15] : bit1(X15) = plus_plus(int,plus_plus(int,one_one(int),X15),X15),
    inference(variable_rename,[status(thm)],[fact_162_Bit1__def]) ).

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

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

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

fof(c_0_23,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)],[c_0_17]) ).

cnf(c_0_24,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)],[fact_3_t]) ).

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

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

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

cnf(c_0_28,plain,
    number_number_of(int,X1) = plus_plus(int,X1,pls),
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_29,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)],[c_0_23]) ).

cnf(c_0_30,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)],[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]) ).

cnf(c_0_31,plain,
    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)) = 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),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_24,c_0_25]),c_0_25]),c_0_25]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]) ).

cnf(c_0_32,plain,
    plus_plus(int,X1,pls) = plus_plus(int,pls,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_22]),c_0_28]) ).

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

fof(c_0_34,plain,
    ! [X21,X22,X23] : plus_plus(int,plus_plus(int,X21,X22),X23) = plus_plus(int,X21,plus_plus(int,X22,X23)),
    inference(variable_rename,[status(thm)],[fact_94_zadd__assoc]) ).

fof(c_0_35,plain,
    ! [X16,X17,X18] : plus_plus(int,X16,plus_plus(int,X17,X18)) = plus_plus(int,X17,plus_plus(int,X16,X18)),
    inference(variable_rename,[status(thm)],[fact_95_zadd__left__commute]) ).

cnf(c_0_36,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)],[inference(rw,[status(thm)],[c_0_29,c_0_25]),c_0_26]),c_0_26]) ).

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

fof(c_0_38,plain,
    ! [X16,X17] : plus_plus(int,X16,X17) = plus_plus(int,X17,X16),
    inference(variable_rename,[status(thm)],[fact_96_zadd__commute]) ).

cnf(c_0_39,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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]) ).

cnf(c_0_40,plain,
    times_times(int,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)),t) = plus_plus(int,power_power(int,s,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)))))),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)],[c_0_31,c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_28]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]) ).

cnf(c_0_41,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_33,c_0_25]),c_0_26]),c_0_26]) ).

cnf(c_0_42,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_34]) ).

cnf(c_0_43,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_35]) ).

fof(c_0_44,plain,
    ! [X16,X17] : times_times(int,X16,X17) = times_times(int,X17,X16),
    inference(variable_rename,[status(thm)],[fact_23_zmult__commute]) ).

fof(c_0_45,plain,
    ! [X12] : times_times(int,pls,X12) = pls,
    inference(variable_rename,[status(thm)],[fact_62_mult__Pls]) ).

cnf(c_0_46,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)],[c_0_36,c_0_37]) ).

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

cnf(c_0_48,plain,
    ord_less(int,plus_plus(int,power_power(int,s,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)))))),one_one(int)),times_times(int,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)),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)],[c_0_39,c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_28]),c_0_32]),c_0_40]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_28]),c_0_32]),c_0_37]) ).

cnf(c_0_49,plain,
    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(nat,one_one(nat),one_one(nat)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_41,c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_42]),c_0_42]),c_0_43]),c_0_43]) ).

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

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

cnf(c_0_52,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)],[inference(rw,[status(thm)],[c_0_46,c_0_41]),c_0_47]) ).

cnf(c_0_53,plain,
    $false,
    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_48,c_0_47]),c_0_47]),c_0_42]),c_0_42]),c_0_43]),c_0_43]),c_0_49]),c_0_50]),c_0_42]),c_0_42]),c_0_42]),c_0_43]),c_0_43]),c_0_42]),c_0_42]),c_0_43]),c_0_43]),c_0_43]),c_0_43]),c_0_42]),c_0_42]),c_0_43]),c_0_43]),c_0_43]),c_0_43]),c_0_43]),c_0_43]),c_0_50]),c_0_51]),c_0_52]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : NUM924+6 : TPTP v8.1.0. Released v5.3.0.
% 0.12/0.13  % Command  : run_ET %s %d
% 0.14/0.34  % Computer : n021.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Tue Jul  5 21:24:33 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.28/1.46  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.28/1.46  # Preprocessing time       : 0.121 s
% 0.28/1.46  
% 0.28/1.46  # Proof found!
% 0.28/1.46  # SZS status Theorem
% 0.28/1.46  # SZS output start CNFRefutation
% See solution above
% 0.28/1.46  # Proof object total steps             : 54
% 0.28/1.46  # Proof object clause steps            : 27
% 0.28/1.46  # Proof object formula steps           : 27
% 0.28/1.46  # Proof object conjectures             : 7
% 0.28/1.46  # Proof object clause conjectures      : 4
% 0.28/1.46  # Proof object formula conjectures     : 3
% 0.28/1.46  # Proof object initial clauses used    : 15
% 0.28/1.46  # Proof object initial formulas used   : 15
% 0.28/1.46  # Proof object generating inferences   : 0
% 0.28/1.46  # Proof object simplifying inferences  : 107
% 0.28/1.46  # Training examples: 0 positive, 0 negative
% 0.28/1.46  # Parsed axioms                        : 650
% 0.28/1.46  # Removed by relevancy pruning/SinE    : 0
% 0.28/1.46  # Initial clauses                      : 850
% 0.28/1.46  # Removed in clause preprocessing      : 8
% 0.28/1.46  # Initial clauses in saturation        : 842
% 0.28/1.46  # Processed clauses                    : 921
% 0.28/1.46  # ...of these trivial                  : 10
% 0.28/1.46  # ...subsumed                          : 108
% 0.28/1.46  # ...remaining for further processing  : 802
% 0.28/1.46  # Other redundant clauses eliminated   : 3
% 0.28/1.46  # Clauses deleted for lack of memory   : 0
% 0.28/1.46  # Backward-subsumed                    : 2
% 0.28/1.46  # Backward-rewritten                   : 166
% 0.28/1.46  # Generated clauses                    : 17141
% 0.28/1.46  # ...of the previous two non-trivial   : 15912
% 0.28/1.46  # Contextual simplify-reflections      : 10
% 0.28/1.46  # Paramodulations                      : 17124
% 0.28/1.46  # Factorizations                       : 7
% 0.28/1.46  # Equation resolutions                 : 10
% 0.28/1.46  # Current number of processed clauses  : 632
% 0.28/1.46  #    Positive orientable unit clauses  : 166
% 0.28/1.46  #    Positive unorientable unit clauses: 9
% 0.28/1.46  #    Negative unit clauses             : 16
% 0.28/1.46  #    Non-unit-clauses                  : 441
% 0.28/1.46  # Current number of unprocessed clauses: 11344
% 0.28/1.46  # ...number of literals in the above   : 31121
% 0.28/1.46  # Current number of archived formulas  : 0
% 0.28/1.46  # Current number of archived clauses   : 170
% 0.28/1.46  # Clause-clause subsumption calls (NU) : 37699
% 0.28/1.46  # Rec. Clause-clause subsumption calls : 20204
% 0.28/1.46  # Non-unit clause-clause subsumptions  : 89
% 0.28/1.46  # Unit Clause-clause subsumption calls : 847
% 0.28/1.46  # Rewrite failures with RHS unbound    : 0
% 0.28/1.46  # BW rewrite match attempts            : 795
% 0.28/1.46  # BW rewrite match successes           : 159
% 0.28/1.46  # Condensation attempts                : 0
% 0.28/1.46  # Condensation successes               : 0
% 0.28/1.46  # Termbank termtop insertions          : 621325
% 0.28/1.46  
% 0.28/1.46  # -------------------------------------------------
% 0.28/1.46  # User time                : 0.367 s
% 0.28/1.46  # System time              : 0.016 s
% 0.28/1.46  # Total time               : 0.383 s
% 0.28/1.46  # Maximum resident set size: 20432 pages
% 0.31/23.45  eprover: CPU time limit exceeded, terminating
% 0.31/23.46  eprover: CPU time limit exceeded, terminating
% 0.31/23.46  eprover: CPU time limit exceeded, terminating
% 0.31/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.47  eprover: No such file or directory
% 0.31/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.48  eprover: No such file or directory
% 0.31/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.48  eprover: No such file or directory
% 0.31/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/23.48  eprover: No such file or directory
% 0.31/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.48  eprover: No such file or directory
% 0.31/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.48  eprover: No such file or directory
% 0.31/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.49  eprover: No such file or directory
% 0.31/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/23.49  eprover: No such file or directory
% 0.31/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.49  eprover: No such file or directory
% 0.31/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.49  eprover: No such file or directory
% 0.31/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.49  eprover: No such file or directory
% 0.31/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/23.49  eprover: No such file or directory
% 0.31/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.50  eprover: No such file or directory
% 0.31/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.50  eprover: No such file or directory
% 0.31/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/23.50  eprover: No such file or directory
% 0.31/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.50  eprover: No such file or directory
% 0.31/23.50  eprover: eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.inCannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.50  
% 0.31/23.50  eprover: No such file or directory
% 0.31/23.50  eprover: No such file or directory
% 0.31/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/23.50  eprover: No such file or directory
% 0.31/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.51  eprover: No such file or directory
% 0.31/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.51  eprover: No such file or directory
% 0.31/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/23.51  eprover: No such file or directory
% 0.31/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.51  eprover: No such file or directory
% 0.31/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.51  eprover: No such file or directory
% 0.31/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/23.51  eprover: No such file or directory
% 0.31/23.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.52  eprover: No such file or directory
% 0.31/23.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.52  eprover: No such file or directory
% 0.31/23.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/23.52  eprover: No such file or directory
% 0.31/23.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.52  eprover: No such file or directory
% 0.31/23.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/23.52  eprover: No such file or directory
% 0.31/23.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.53  eprover: No such file or directory
% 0.31/23.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/23.53  eprover: No such file or directory
% 0.31/23.54  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/23.54  eprover: No such file or directory
%------------------------------------------------------------------------------