TSTP Solution File: NUM344+1 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : NUM344+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : n088.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:02:10 EST 2018

% Result   : Theorem 185.35s
% Output   : CNFRefutation 185.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   40 (  15 unt;   0 def)
%            Number of atoms       :   96 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  105 (  49   ~;  45   |;   8   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   85 (   0 sgn  49   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(55,axiom,
    ! [X1,X2,X15,X3,X4,X18] :
      ( ( rdn_translate(X1,rdn_pos(X3))
        & rdn_translate(X2,rdn_pos(X4))
        & rdn_add_with_carry(rdnn(n0),X3,X4,X18)
        & rdn_translate(X15,rdn_pos(X18)) )
     => sum(X1,X2,X15) ),
    file('/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_4',sum_entry_point_pos_pos) ).

fof(69,axiom,
    rdn_translate(n0,rdn_pos(rdnn(n0))),
    file('/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_4',rdn0) ).

fof(70,axiom,
    rdn_translate(n1,rdn_pos(rdnn(n1))),
    file('/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_4',rdn1) ).

fof(94,axiom,
    rdn_positive_less(rdnn(n0),rdnn(n1)),
    file('/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_4',rdn_positive_less01) ).

fof(102,axiom,
    rdn_digit_add(rdnn(n0),rdnn(n1),rdnn(n1),rdnn(n0)),
    file('/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_4',rdn_digit_add_n0_n1_n1_n0) ).

fof(120,axiom,
    ! [X1,X2,X3,X4] :
      ( ( rdn_translate(X1,rdn_pos(X3))
        & rdn_translate(X2,rdn_pos(X4))
        & rdn_positive_less(X3,X4) )
     => less(X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_4',less_entry_point_pos_pos) ).

fof(134,axiom,
    ! [X7,X8,X10,X11,X20] :
      ( ( rdn_digit_add(rdnn(X8),rdnn(X10),rdnn(X20),rdnn(n0))
        & rdn_digit_add(rdnn(X20),rdnn(X7),rdnn(X11),rdnn(n0)) )
     => rdn_add_with_carry(rdnn(X7),rdnn(X8),rdnn(X10),rdnn(X11)) ),
    file('/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_4',add_digit_digit_digit) ).

fof(152,axiom,
    rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)),
    file('/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_4',rdn_digit_add_n1_n0_n1_n0) ).

fof(153,conjecture,
    ? [X1,X2] :
      ( sum(X1,n1,X2)
      & less(X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_4',exist_bigger_plus_one) ).

fof(154,negated_conjecture,
    ~ ? [X1,X2] :
        ( sum(X1,n1,X2)
        & less(X1,X2) ),
    inference(assume_negation,[status(cth)],[153]) ).

fof(224,plain,
    ! [X1,X2,X15,X3,X4,X18] :
      ( ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X2,rdn_pos(X4))
      | ~ rdn_add_with_carry(rdnn(n0),X3,X4,X18)
      | ~ rdn_translate(X15,rdn_pos(X18))
      | sum(X1,X2,X15) ),
    inference(fof_nnf,[status(thm)],[55]) ).

fof(225,plain,
    ! [X19,X20,X21,X22,X23,X24] :
      ( ~ rdn_translate(X19,rdn_pos(X22))
      | ~ rdn_translate(X20,rdn_pos(X23))
      | ~ rdn_add_with_carry(rdnn(n0),X22,X23,X24)
      | ~ rdn_translate(X21,rdn_pos(X24))
      | sum(X19,X20,X21) ),
    inference(variable_rename,[status(thm)],[224]) ).

cnf(226,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_translate(X3,rdn_pos(X4))
    | ~ rdn_add_with_carry(rdnn(n0),X5,X6,X4)
    | ~ rdn_translate(X2,rdn_pos(X6))
    | ~ rdn_translate(X1,rdn_pos(X5)) ),
    inference(split_conjunct,[status(thm)],[225]) ).

cnf(240,plain,
    rdn_translate(n0,rdn_pos(rdnn(n0))),
    inference(split_conjunct,[status(thm)],[69]) ).

cnf(241,plain,
    rdn_translate(n1,rdn_pos(rdnn(n1))),
    inference(split_conjunct,[status(thm)],[70]) ).

cnf(269,plain,
    rdn_positive_less(rdnn(n0),rdnn(n1)),
    inference(split_conjunct,[status(thm)],[94]) ).

cnf(279,plain,
    rdn_digit_add(rdnn(n0),rdnn(n1),rdnn(n1),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[102]) ).

fof(305,plain,
    ! [X1,X2,X3,X4] :
      ( ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X2,rdn_pos(X4))
      | ~ rdn_positive_less(X3,X4)
      | less(X1,X2) ),
    inference(fof_nnf,[status(thm)],[120]) ).

fof(306,plain,
    ! [X5,X6,X7,X8] :
      ( ~ rdn_translate(X5,rdn_pos(X7))
      | ~ rdn_translate(X6,rdn_pos(X8))
      | ~ rdn_positive_less(X7,X8)
      | less(X5,X6) ),
    inference(variable_rename,[status(thm)],[305]) ).

cnf(307,plain,
    ( less(X1,X2)
    | ~ rdn_positive_less(X3,X4)
    | ~ rdn_translate(X2,rdn_pos(X4))
    | ~ rdn_translate(X1,rdn_pos(X3)) ),
    inference(split_conjunct,[status(thm)],[306]) ).

fof(329,plain,
    ! [X7,X8,X10,X11,X20] :
      ( ~ rdn_digit_add(rdnn(X8),rdnn(X10),rdnn(X20),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X20),rdnn(X7),rdnn(X11),rdnn(n0))
      | rdn_add_with_carry(rdnn(X7),rdnn(X8),rdnn(X10),rdnn(X11)) ),
    inference(fof_nnf,[status(thm)],[134]) ).

fof(330,plain,
    ! [X21,X22,X23,X24,X25] :
      ( ~ rdn_digit_add(rdnn(X22),rdnn(X23),rdnn(X25),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X25),rdnn(X21),rdnn(X24),rdnn(n0))
      | rdn_add_with_carry(rdnn(X21),rdnn(X22),rdnn(X23),rdnn(X24)) ),
    inference(variable_rename,[status(thm)],[329]) ).

cnf(331,plain,
    ( rdn_add_with_carry(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(X4))
    | ~ rdn_digit_add(rdnn(X5),rdnn(X1),rdnn(X4),rdnn(n0))
    | ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X5),rdnn(n0)) ),
    inference(split_conjunct,[status(thm)],[330]) ).

cnf(358,plain,
    rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[152]) ).

fof(359,negated_conjecture,
    ! [X1,X2] :
      ( ~ sum(X1,n1,X2)
      | ~ less(X1,X2) ),
    inference(fof_nnf,[status(thm)],[154]) ).

fof(360,negated_conjecture,
    ! [X3,X4] :
      ( ~ sum(X3,n1,X4)
      | ~ less(X3,X4) ),
    inference(variable_rename,[status(thm)],[359]) ).

cnf(361,negated_conjecture,
    ( ~ less(X1,X2)
    | ~ sum(X1,n1,X2) ),
    inference(split_conjunct,[status(thm)],[360]) ).

cnf(379,plain,
    ( less(X1,n1)
    | ~ rdn_translate(X1,rdn_pos(X2))
    | ~ rdn_positive_less(X2,rdnn(n1)) ),
    inference(spm,[status(thm)],[307,241,theory(equality)]) ).

cnf(409,plain,
    ( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n1))
    | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n1),rdnn(n0)) ),
    inference(spm,[status(thm)],[331,358,theory(equality)]) ).

cnf(582,plain,
    ( less(n0,n1)
    | ~ rdn_positive_less(rdnn(n0),rdnn(n1)) ),
    inference(spm,[status(thm)],[379,240,theory(equality)]) ).

cnf(590,plain,
    ( less(n0,n1)
    | $false ),
    inference(rw,[status(thm)],[582,269,theory(equality)]) ).

cnf(591,plain,
    less(n0,n1),
    inference(cn,[status(thm)],[590,theory(equality)]) ).

cnf(593,negated_conjecture,
    ~ sum(n0,n1,n1),
    inference(spm,[status(thm)],[361,591,theory(equality)]) ).

cnf(1115,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_translate(X3,rdn_pos(rdnn(n1)))
    | ~ rdn_translate(X2,rdn_pos(rdnn(X5)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(X4)))
    | ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n1),rdnn(n0)) ),
    inference(spm,[status(thm)],[226,409,theory(equality)]) ).

cnf(2804,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_translate(X3,rdn_pos(rdnn(n1)))
    | ~ rdn_translate(X2,rdn_pos(rdnn(n1)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n0))) ),
    inference(spm,[status(thm)],[1115,279,theory(equality)]) ).

cnf(2806,plain,
    ( sum(X1,X2,n1)
    | ~ rdn_translate(X2,rdn_pos(rdnn(n1)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n0))) ),
    inference(spm,[status(thm)],[2804,241,theory(equality)]) ).

cnf(2807,plain,
    ( sum(X1,n1,n1)
    | ~ rdn_translate(X1,rdn_pos(rdnn(n0))) ),
    inference(spm,[status(thm)],[2806,241,theory(equality)]) ).

cnf(2808,plain,
    sum(n0,n1,n1),
    inference(spm,[status(thm)],[2807,240,theory(equality)]) ).

cnf(2809,plain,
    $false,
    inference(sr,[status(thm)],[2808,593,theory(equality)]) ).

cnf(2810,plain,
    $false,
    2809,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM344+1 : TPTP v7.0.0. Released v3.1.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.02/0.23  % Computer : n088.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 01:22:45 CST 2018
% 0.02/0.23  % CPUTime  : 
% 0.02/0.28  % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.28  --creating new selector for [NUM005+0.ax, NUM005+1.ax, NUM005+2.ax]
% 29.05/29.38  eprover: CPU time limit exceeded, terminating
% 110.14/110.55  eprover: CPU time limit exceeded, terminating
% 110.23/110.62  -running prover on /export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_1 with time limit 29
% 110.23/110.62  -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_1']
% 110.23/110.62  -prover status ResourceOut
% 110.23/110.62  -running prover on /export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_2 with time limit 81
% 110.23/110.62  -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=81', '/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_2']
% 110.23/110.62  -prover status ResourceOut
% 110.23/110.62  --creating new selector for [NUM005+0.ax, NUM005+1.ax, NUM005+2.ax]
% 185.23/185.71  eprover: CPU time limit exceeded, terminating
% 185.23/185.78  -running prover on /export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_3 with time limit 75
% 185.23/185.78  -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=75', '/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_3']
% 185.23/185.78  -prover status ResourceOut
% 185.23/185.78  --creating new selector for [NUM005+0.ax, NUM005+1.ax, NUM005+2.ax]
% 185.35/185.98  -running prover on /export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_4 with time limit 57
% 185.35/185.98  -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=57', '/export/starexec/sandbox/tmp/tmp63GH6s/sel_theBenchmark.p_4']
% 185.35/185.98  -prover status Theorem
% 185.35/185.98  Problem theBenchmark.p solved in phase 3.
% 185.35/185.98  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 185.35/185.98  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 185.35/185.98  Solved 1 out of 1.
% 185.35/185.98  # Problem is unsatisfiable (or provable), constructing proof object
% 185.35/185.98  # SZS status Theorem
% 185.35/185.98  # SZS output start CNFRefutation.
% See solution above
% 185.35/185.99  # SZS output end CNFRefutation
%------------------------------------------------------------------------------