TSTP Solution File: NUM925+3 by ET---2.0

View Problem - Process Solution

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

% Computer : n018.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:48 EDT 2022

% Result   : Theorem 0.37s 1.54s
% Output   : CNFRefutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   44 (  41 unt;   0 def)
%            Number of atoms       :   47 (  34 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   12 (   9   ~;   2   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;   7 con; 0-2 aty)
%            Number of variables   :   23 (   1 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(fact_809_succ__Bit0,axiom,
    ! [X22] : succ(bit0(X22)) = bit1(X22),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_809_succ__Bit0) ).

fof(fact_103_Bit0__def,axiom,
    ! [X22] : bit0(X22) = plus_plus_int(X22,X22),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_103_Bit0__def) ).

fof(fact_814_succ__def,axiom,
    ! [X22] : succ(X22) = plus_plus_int(X22,one_one_int),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_814_succ__def) ).

fof(conj_0,conjecture,
    hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_0) ).

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

fof(fact_767_nat__number__of__def,axiom,
    ! [X14] : number_number_of_nat(X14) = nat(number_number_of_int(X14)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_767_nat__number__of__def) ).

fof(fact_16_one__add__one__is__two,axiom,
    plus_plus_int(one_one_int,one_one_int) = number_number_of_int(bit0(bit1(pls))),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_16_one__add__one__is__two) ).

fof(fact_98_Pls__def,axiom,
    pls = zero_zero_int,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_98_Pls__def) ).

fof(fact_1021_diff__bin__simps_I2_J,axiom,
    ! [X22] : minus_minus_int(X22,min) = succ(X22),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_1021_diff__bin__simps_I2_J) ).

fof(fact_79_bin__less__0__simps_I1_J,axiom,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),zero_zero_int)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_79_bin__less__0__simps_I1_J) ).

fof(fact_266_zero__less__power,axiom,
    ! [X79,X80] :
      ( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X80))
     => hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(X80),X79))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_266_zero__less__power) ).

fof(fact_0_n1pos,axiom,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_0_n1pos) ).

fof(c_0_12,plain,
    ! [X23] : succ(bit0(X23)) = bit1(X23),
    inference(variable_rename,[status(thm)],[fact_809_succ__Bit0]) ).

fof(c_0_13,plain,
    ! [X23] : bit0(X23) = plus_plus_int(X23,X23),
    inference(variable_rename,[status(thm)],[fact_103_Bit0__def]) ).

fof(c_0_14,plain,
    ! [X23] : succ(X23) = plus_plus_int(X23,one_one_int),
    inference(variable_rename,[status(thm)],[fact_814_succ__def]) ).

fof(c_0_15,negated_conjecture,
    ~ ( hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

cnf(c_0_16,plain,
    succ(bit0(X1)) = bit1(X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

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

cnf(c_0_18,plain,
    succ(X1) = plus_plus_int(X1,one_one_int),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    bit0(pls) = pls,
    inference(split_conjunct,[status(thm)],[fact_97_Bit0__Pls]) ).

fof(c_0_20,negated_conjecture,
    hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
    inference(fof_simplification,[status(thm)],[c_0_15]) ).

fof(c_0_21,plain,
    ! [X15] : number_number_of_nat(X15) = nat(number_number_of_int(X15)),
    inference(variable_rename,[status(thm)],[fact_767_nat__number__of__def]) ).

cnf(c_0_22,plain,
    plus_plus_int(one_one_int,one_one_int) = number_number_of_int(bit0(bit1(pls))),
    inference(split_conjunct,[status(thm)],[fact_16_one__add__one__is__two]) ).

cnf(c_0_23,plain,
    plus_plus_int(plus_plus_int(X1,X1),one_one_int) = bit1(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_24,plain,
    plus_plus_int(pls,pls) = pls,
    inference(rw,[status(thm)],[c_0_19,c_0_17]) ).

cnf(c_0_25,plain,
    pls = zero_zero_int,
    inference(split_conjunct,[status(thm)],[fact_98_Pls__def]) ).

cnf(c_0_26,negated_conjecture,
    hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_27,plain,
    number_number_of_nat(X1) = nat(number_number_of_int(X1)),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_28,plain,
    plus_plus_int(one_one_int,one_one_int) = number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_17]),c_0_23]),c_0_23]) ).

cnf(c_0_29,plain,
    plus_plus_int(zero_zero_int,zero_zero_int) = zero_zero_int,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]),c_0_25]) ).

fof(c_0_30,plain,
    ! [X23] : minus_minus_int(X23,min) = succ(X23),
    inference(variable_rename,[status(thm)],[fact_1021_diff__bin__simps_I2_J]) ).

cnf(c_0_31,negated_conjecture,
    hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),nat(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int))))) = zero_zero_int,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_17]),c_0_27]),c_0_23]),c_0_23]) ).

cnf(c_0_32,plain,
    number_number_of_int(plus_plus_int(plus_plus_int(zero_zero_int,one_one_int),plus_plus_int(zero_zero_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)],[c_0_28,c_0_25]),c_0_25]),c_0_29]),c_0_25]),c_0_25]),c_0_29]) ).

cnf(c_0_33,plain,
    minus_minus_int(X1,min) = succ(X1),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

fof(c_0_34,plain,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),zero_zero_int)),
    inference(fof_simplification,[status(thm)],[fact_79_bin__less__0__simps_I1_J]) ).

fof(c_0_35,plain,
    ! [X81,X82] :
      ( ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X82))
      | hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(X82),X81))) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_266_zero__less__power])]) ).

cnf(c_0_36,negated_conjecture,
    hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),nat(plus_plus_int(one_one_int,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)],[c_0_31,c_0_25]),c_0_25]),c_0_29]),c_0_25]),c_0_25]),c_0_29]),c_0_32]) ).

cnf(c_0_37,plain,
    plus_plus_int(X1,one_one_int) = minus_minus_int(X1,min),
    inference(rw,[status(thm)],[c_0_33,c_0_18]) ).

cnf(c_0_38,plain,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),zero_zero_int)),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_39,plain,
    ( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(X1),X2)))
    | ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_40,negated_conjecture,
    hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),nat(minus_minus_int(one_one_int,min))) = zero_zero_int,
    inference(rw,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_41,plain,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),
    inference(split_conjunct,[status(thm)],[fact_0_n1pos]) ).

cnf(c_0_42,plain,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),zero_zero_int)),
    inference(rw,[status(thm)],[c_0_38,c_0_25]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),c_0_42]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM925+3 : TPTP v8.1.0. Released v5.3.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n018.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jul  5 11:44:22 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.37/1.54  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.37/1.54  # Preprocessing time       : 0.130 s
% 0.37/1.54  
% 0.37/1.54  # Proof found!
% 0.37/1.54  # SZS status Theorem
% 0.37/1.54  # SZS output start CNFRefutation
% See solution above
% 0.37/1.54  # Proof object total steps             : 44
% 0.37/1.54  # Proof object clause steps            : 23
% 0.37/1.54  # Proof object formula steps           : 21
% 0.37/1.54  # Proof object conjectures             : 8
% 0.37/1.54  # Proof object clause conjectures      : 5
% 0.37/1.54  # Proof object formula conjectures     : 3
% 0.37/1.54  # Proof object initial clauses used    : 12
% 0.37/1.54  # Proof object initial formulas used   : 12
% 0.37/1.54  # Proof object generating inferences   : 1
% 0.37/1.54  # Proof object simplifying inferences  : 32
% 0.37/1.54  # Training examples: 0 positive, 0 negative
% 0.37/1.54  # Parsed axioms                        : 1233
% 0.37/1.54  # Removed by relevancy pruning/SinE    : 0
% 0.37/1.54  # Initial clauses                      : 1809
% 0.37/1.54  # Removed in clause preprocessing      : 121
% 0.37/1.54  # Initial clauses in saturation        : 1688
% 0.37/1.54  # Processed clauses                    : 1808
% 0.37/1.54  # ...of these trivial                  : 176
% 0.37/1.54  # ...subsumed                          : 440
% 0.37/1.54  # ...remaining for further processing  : 1192
% 0.37/1.54  # Other redundant clauses eliminated   : 86
% 0.37/1.54  # Clauses deleted for lack of memory   : 0
% 0.37/1.54  # Backward-subsumed                    : 7
% 0.37/1.54  # Backward-rewritten                   : 108
% 0.37/1.54  # Generated clauses                    : 27949
% 0.37/1.54  # ...of the previous two non-trivial   : 25300
% 0.37/1.54  # Contextual simplify-reflections      : 47
% 0.37/1.54  # Paramodulations                      : 27817
% 0.37/1.54  # Factorizations                       : 13
% 0.37/1.54  # Equation resolutions                 : 119
% 0.37/1.54  # Current number of processed clauses  : 1043
% 0.37/1.54  #    Positive orientable unit clauses  : 203
% 0.37/1.54  #    Positive unorientable unit clauses: 21
% 0.37/1.54  #    Negative unit clauses             : 33
% 0.37/1.54  #    Non-unit-clauses                  : 786
% 0.37/1.54  # Current number of unprocessed clauses: 22174
% 0.37/1.54  # ...number of literals in the above   : 67376
% 0.37/1.54  # Current number of archived formulas  : 0
% 0.37/1.54  # Current number of archived clauses   : 119
% 0.37/1.54  # Clause-clause subsumption calls (NU) : 140584
% 0.37/1.54  # Rec. Clause-clause subsumption calls : 68009
% 0.37/1.54  # Non-unit clause-clause subsumptions  : 406
% 0.37/1.54  # Unit Clause-clause subsumption calls : 3394
% 0.37/1.54  # Rewrite failures with RHS unbound    : 0
% 0.37/1.54  # BW rewrite match attempts            : 491
% 0.37/1.54  # BW rewrite match successes           : 205
% 0.37/1.54  # Condensation attempts                : 0
% 0.37/1.54  # Condensation successes               : 0
% 0.37/1.54  # Termbank termtop insertions          : 708085
% 0.37/1.54  
% 0.37/1.54  # -------------------------------------------------
% 0.37/1.54  # User time                : 0.521 s
% 0.37/1.54  # System time              : 0.032 s
% 0.37/1.54  # Total time               : 0.553 s
% 0.37/1.54  # Maximum resident set size: 36312 pages
% 0.37/23.53  eprover: CPU time limit exceeded, terminating
% 0.37/23.53  eprover: CPU time limit exceeded, terminating
% 0.37/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.55  eprover: No such file or directory
% 0.37/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.55  eprover: No such file or directory
% 0.37/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.55  eprover: No such file or directory
% 0.37/23.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.56  eprover: No such file or directory
% 0.37/23.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.56  eprover: No such file or directory
% 0.37/23.57  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.57  eprover: No such file or directory
% 0.37/23.57  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.57  eprover: No such file or directory
% 0.37/23.57  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.57  eprover: No such file or directory
% 0.37/23.58  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.58  eprover: No such file or directory
% 0.37/23.58  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.58  eprover: No such file or directory
% 0.37/23.58  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.37/23.58  eprover: No such file or directory
% 0.37/23.70  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.70  eprover: No such file or directory
% 0.37/23.70  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.70  eprover: No such file or directory
% 0.37/23.71  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.71  eprover: No such file or directory
% 0.37/23.71  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.71  eprover: No such file or directory
% 0.37/23.72  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.72  eprover: No such file or directory
% 0.37/23.72  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.72  eprover: No such file or directory
% 0.37/23.73  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.73  eprover: No such file or directory
% 0.37/23.74  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.74  eprover: No such file or directory
% 0.37/23.74  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.74  eprover: No such file or directory
% 0.37/23.75  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.75  eprover: No such file or directory
% 0.37/23.75  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.37/23.75  eprover: No such file or directory
%------------------------------------------------------------------------------