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

View Problem - Process Solution

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

% Computer : n122.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:08 EST 2018

% Result   : Theorem 0.06s
% Output   : CNFRefutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   27 (  14 unt;   0 def)
%            Number of atoms       :   62 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   68 (  33   ~;  29   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   67 (   1 sgn  37   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(10,axiom,
    rdn_digit_add(rdnn(n3),rdnn(n0),rdnn(n3),rdnn(n0)),
    file('/export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_4',rdn_digit_add_n3_n0_n3_n0) ).

fof(54,axiom,
    ! [X1,X2,X13,X16,X17,X18] :
      ( ( rdn_translate(X1,rdn_pos(X16))
        & rdn_translate(X2,rdn_pos(X17))
        & rdn_add_with_carry(rdnn(n0),X16,X17,X18)
        & rdn_translate(X13,rdn_pos(X18)) )
     => sum(X1,X2,X13) ),
    file('/export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_4',sum_entry_point_pos_pos) ).

fof(68,axiom,
    rdn_translate(n0,rdn_pos(rdnn(n0))),
    file('/export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_4',rdn0) ).

fof(71,axiom,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    file('/export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_4',rdn3) ).

fof(131,axiom,
    ! [X5,X6,X8,X9,X20] :
      ( ( rdn_digit_add(rdnn(X6),rdnn(X8),rdnn(X20),rdnn(n0))
        & rdn_digit_add(rdnn(X20),rdnn(X5),rdnn(X9),rdnn(n0)) )
     => rdn_add_with_carry(rdnn(X5),rdnn(X6),rdnn(X8),rdnn(X9)) ),
    file('/export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_4',add_digit_digit_digit) ).

fof(149,conjecture,
    ? [X1,X2] : sum(X1,X2,X1),
    file('/export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_4',sum_something_anotherthing_firstthing) ).

fof(150,negated_conjecture,
    ~ ? [X1,X2] : sum(X1,X2,X1),
    inference(assume_negation,[status(cth)],[149]) ).

cnf(160,plain,
    rdn_digit_add(rdnn(n3),rdnn(n0),rdnn(n3),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[10]) ).

fof(214,plain,
    ! [X1,X2,X13,X16,X17,X18] :
      ( ~ rdn_translate(X1,rdn_pos(X16))
      | ~ rdn_translate(X2,rdn_pos(X17))
      | ~ rdn_add_with_carry(rdnn(n0),X16,X17,X18)
      | ~ rdn_translate(X13,rdn_pos(X18))
      | sum(X1,X2,X13) ),
    inference(fof_nnf,[status(thm)],[54]) ).

fof(215,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)],[214]) ).

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

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

cnf(233,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(split_conjunct,[status(thm)],[71]) ).

fof(315,plain,
    ! [X5,X6,X8,X9,X20] :
      ( ~ rdn_digit_add(rdnn(X6),rdnn(X8),rdnn(X20),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X20),rdnn(X5),rdnn(X9),rdnn(n0))
      | rdn_add_with_carry(rdnn(X5),rdnn(X6),rdnn(X8),rdnn(X9)) ),
    inference(fof_nnf,[status(thm)],[131]) ).

fof(316,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)],[315]) ).

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

fof(339,negated_conjecture,
    ! [X1,X2] : ~ sum(X1,X2,X1),
    inference(fof_nnf,[status(thm)],[150]) ).

fof(340,negated_conjecture,
    ! [X3,X4] : ~ sum(X3,X4,X3),
    inference(variable_rename,[status(thm)],[339]) ).

cnf(341,negated_conjecture,
    ~ sum(X1,X2,X1),
    inference(split_conjunct,[status(thm)],[340]) ).

cnf(362,plain,
    ( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n3))
    | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n3),rdnn(n0)) ),
    inference(spm,[status(thm)],[317,160,theory(equality)]) ).

cnf(552,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_translate(X3,rdn_pos(rdnn(n3)))
    | ~ rdn_translate(X2,rdn_pos(rdnn(X4)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(X5)))
    | ~ rdn_digit_add(rdnn(X5),rdnn(X4),rdnn(n3),rdnn(n0)) ),
    inference(spm,[status(thm)],[216,362,theory(equality)]) ).

cnf(1219,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_translate(X3,rdn_pos(rdnn(n3)))
    | ~ rdn_translate(X2,rdn_pos(rdnn(n0)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n3))) ),
    inference(spm,[status(thm)],[552,160,theory(equality)]) ).

cnf(1223,plain,
    ( sum(X1,X2,n3)
    | ~ rdn_translate(X2,rdn_pos(rdnn(n0)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n3))) ),
    inference(spm,[status(thm)],[1219,233,theory(equality)]) ).

cnf(1224,plain,
    ( sum(X1,n0,n3)
    | ~ rdn_translate(X1,rdn_pos(rdnn(n3))) ),
    inference(spm,[status(thm)],[1223,230,theory(equality)]) ).

cnf(1225,plain,
    sum(n3,n0,n3),
    inference(spm,[status(thm)],[1224,233,theory(equality)]) ).

cnf(1226,plain,
    $false,
    inference(sr,[status(thm)],[1225,341,theory(equality)]) ).

cnf(1227,plain,
    $false,
    1226,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM328+1 : TPTP v7.0.0. Released v3.1.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.03/0.23  % Computer : n122.star.cs.uiowa.edu
% 0.03/0.23  % Model    : x86_64 x86_64
% 0.03/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23  % Memory   : 32218.625MB
% 0.03/0.23  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23  % CPULimit : 300
% 0.03/0.23  % DateTime : Fri Jan  5 02:24:45 CST 2018
% 0.03/0.23  % CPUTime  : 
% 0.03/0.28  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.28  --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.06/0.41  -running prover on /export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.41  -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/tmpaaTMgd/sel_theBenchmark.p_1']
% 0.06/0.41  -prover status CounterSatisfiable
% 0.06/0.41  -running prover on /export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_2 with time limit 89
% 0.06/0.41  -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=89', '/export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_2']
% 0.06/0.41  -prover status CounterSatisfiable
% 0.06/0.41  --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.06/0.47  -running prover on /export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_3 with time limit 119
% 0.06/0.47  -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=119', '/export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_3']
% 0.06/0.47  -prover status CounterSatisfiable
% 0.06/0.47  --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.06/0.58  -running prover on /export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_4 with time limit 149
% 0.06/0.58  -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=149', '/export/starexec/sandbox2/tmp/tmpaaTMgd/sel_theBenchmark.p_4']
% 0.06/0.58  -prover status Theorem
% 0.06/0.58  Problem theBenchmark.p solved in phase 3.
% 0.06/0.58  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.58  % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.58  Solved 1 out of 1.
% 0.06/0.58  # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.58  # SZS status Theorem
% 0.06/0.58  # SZS output start CNFRefutation.
% See solution above
% 0.41/0.60  # SZS output end CNFRefutation
%------------------------------------------------------------------------------