↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : NUM344+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:11:07 AM UTC 2026

% Result   : Theorem 48.21s 6.53s
% Output   : CNFRefutation 48.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   30 (  15 unt;   0 def)
%            Number of atoms       :   61 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   54 (  23   ~;  20   |;   8   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 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   :   47 (   0 sgn  15   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(rdn0,axiom,
    'rdn$utranslate'(n0,'rdn$upos'(rdnn(n0))) ).

fof(rdn1,axiom,
    'rdn$utranslate'(n1,'rdn$upos'(rdnn(n1))) ).

fof(rdn_positive_less01,axiom,
    'rdn$upositive$uless'(rdnn(n0),rdnn(n1)) ).

fof(less_entry_point_pos_pos,axiom,
    ! [X0,X1,X2,X3] :
      ( ( 'rdn$upositive$uless'(X2,X3)
        & 'rdn$utranslate'(X1,'rdn$upos'(X3))
        & 'rdn$utranslate'(X0,'rdn$upos'(X2)) )
     => less(X0,X1) ) ).

fof(sum_entry_point_pos_pos,axiom,
    ! [X0,X1,X2,X3,X4,X5] :
      ( ( 'rdn$utranslate'(X2,'rdn$upos'(X5))
        & 'rdn$uadd$uwith$ucarry'(rdnn(n0),X3,X4,X5)
        & 'rdn$utranslate'(X1,'rdn$upos'(X4))
        & 'rdn$utranslate'(X0,'rdn$upos'(X3)) )
     => sum(X0,X1,X2) ) ).

fof(add_digit_digit_digit,axiom,
    ! [X0,X1,X2,X3,X4] :
      ( ( 'rdn$udigit$uadd'(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0))
        & 'rdn$udigit$uadd'(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0)) )
     => 'rdn$uadd$uwith$ucarry'(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3)) ) ).

fof(rdn_digit_add_n0_n1_n1_n0,axiom,
    'rdn$udigit$uadd'(rdnn(n0),rdnn(n1),rdnn(n1),rdnn(n0)) ).

fof(rdn_digit_add_n1_n0_n1_n0,axiom,
    'rdn$udigit$uadd'(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)) ).

fof(exist_bigger_plus_one,conjecture,
    ? [X0,X1] :
      ( less(X0,X1)
      & sum(X0,n1,X1) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0,X1] :
        ( less(X0,X1)
        & sum(X0,n1,X1) ),
    inference(negate_conjecture,[status(cth)],[exist_bigger_plus_one]) ).

cnf(c0,plain,
    'rdn$utranslate'(n0,'rdn$upos'(rdnn(n0))),
    inference(clausification,[status(esa)],[rdn0]) ).

cnf(c1,plain,
    'rdn$utranslate'(n1,'rdn$upos'(rdnn(n1))),
    inference(clausification,[status(esa)],[rdn1]) ).

cnf(c2,plain,
    'rdn$upositive$uless'(rdnn(n0),rdnn(n1)),
    inference(clausification,[status(esa)],[rdn_positive_less01]) ).

cnf(c13,plain,
    ( less(X0,X2)
    | ~ 'rdn$upositive$uless'(X1,X3)
    | ~ 'rdn$utranslate'(X2,'rdn$upos'(X3))
    | ~ 'rdn$utranslate'(X0,'rdn$upos'(X1)) ),
    inference(clausification,[status(esa)],[less_entry_point_pos_pos]) ).

cnf(c19,plain,
    ( ~ 'rdn$uadd$uwith$ucarry'(rdnn(n0),X3,X5,X1)
    | ~ 'rdn$utranslate'(X4,'rdn$upos'(X5))
    | sum(X2,X4,X0)
    | ~ 'rdn$utranslate'(X2,'rdn$upos'(X3))
    | ~ 'rdn$utranslate'(X0,'rdn$upos'(X1)) ),
    inference(clausification,[status(esa)],[sum_entry_point_pos_pos]) ).

cnf(c28,plain,
    ( 'rdn$uadd$uwith$ucarry'(rdnn(X3),rdnn(X0),rdnn(X1),rdnn(X4))
    | ~ 'rdn$udigit$uadd'(rdnn(X2),rdnn(X3),rdnn(X4),rdnn(n0))
    | ~ 'rdn$udigit$uadd'(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(n0)) ),
    inference(clausification,[status(esa)],[add_digit_digit_digit]) ).

cnf(c34,plain,
    'rdn$udigit$uadd'(rdnn(n0),rdnn(n1),rdnn(n1),rdnn(n0)),
    inference(clausification,[status(esa)],[rdn_digit_add_n0_n1_n1_n0]) ).

cnf(c36,plain,
    'rdn$udigit$uadd'(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)),
    inference(clausification,[status(esa)],[rdn_digit_add_n1_n0_n1_n0]) ).

cnf(c39,plain,
    ( ~ less(X0,X1)
    | ~ sum(X0,n1,X1) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ 'rdn$udigit$uadd'(rdnn(X0),rdnn(X1),rdnn(n1),rdnn(n0))
    | 'rdn$uadd$uwith$ucarry'(rdnn(n0),rdnn(X0),rdnn(X1),rdnn(n1)) ),
    inference(resolution,[status(thm)],[c28,c36]) ).

cnf(d1,plain,
    'rdn$uadd$uwith$ucarry'(rdnn(n0),rdnn(n0),rdnn(n1),rdnn(n1)),
    inference(resolution,[status(thm)],[d0,c34]) ).

cnf(d2,plain,
    ( sum(X1,X0,X2)
    | ~ 'rdn$utranslate'(X2,'rdn$upos'(rdnn(n1)))
    | ~ 'rdn$utranslate'(X1,'rdn$upos'(rdnn(n0)))
    | ~ 'rdn$utranslate'(X0,'rdn$upos'(rdnn(n1))) ),
    inference(resolution,[status(thm)],[d1,c19]) ).

cnf(d3,plain,
    ( sum(X1,n1,X0)
    | ~ 'rdn$utranslate'(X1,'rdn$upos'(rdnn(n0)))
    | ~ 'rdn$utranslate'(X0,'rdn$upos'(rdnn(n1))) ),
    inference(resolution,[status(thm)],[d2,c1]) ).

cnf(d4,plain,
    ( sum(X0,n1,n1)
    | ~ 'rdn$utranslate'(X0,'rdn$upos'(rdnn(n0))) ),
    inference(resolution,[status(thm)],[d3,c1]) ).

cnf(d5,plain,
    sum(n0,n1,n1),
    inference(resolution,[status(thm)],[d4,c0]) ).

cnf(d6,plain,
    ~ less(n0,n1),
    inference(resolution,[status(thm)],[d5,c39]) ).

cnf(d7,plain,
    ( less(X0,n1)
    | ~ 'rdn$upositive$uless'(X1,rdnn(n1))
    | ~ 'rdn$utranslate'(X0,'rdn$upos'(X1)) ),
    inference(resolution,[status(thm)],[c13,c1]) ).

cnf(d8,plain,
    ( less(X0,n1)
    | ~ 'rdn$utranslate'(X0,'rdn$upos'(rdnn(n0))) ),
    inference(resolution,[status(thm)],[d7,c2]) ).

cnf(d9,plain,
    less(n0,n1),
    inference(resolution,[status(thm)],[d8,c0]) ).

cnf(d10,plain,
    $false,
    inference(resolution,[status(thm)],[d9,d6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM344+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35  % Computer : n003.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Sat Sep 26 02:30:53 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 48.21/6.53  % SZS status Theorem for theBenchmark.p
% 48.21/6.53  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------