TSTP Solution File: NUM326+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : NUM326+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n004.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  : 300s
% DateTime : Wed Aug 31 17:58:08 EDT 2022

% Result   : Theorem 0.20s 0.56s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (  10 unt;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  14   ~;   9   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-1 aty)
%            Number of variables   :   25 (  23   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f478,plain,
    $false,
    inference(resolution,[],[f477,f472]) ).

fof(f472,plain,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,axiom,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn5) ).

fof(f477,plain,
    ! [X0] : ~ rdn_translate(X0,rdn_pos(rdnn(n5))),
    inference(resolution,[],[f476,f474]) ).

fof(f474,plain,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    inference(cnf_transformation,[],[f133]) ).

fof(f133,axiom,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdnn5) ).

fof(f476,plain,
    ! [X0,X1] :
      ( ~ rdn_translate(nn5,rdn_neg(X1))
      | ~ rdn_translate(X0,rdn_pos(X1)) ),
    inference(resolution,[],[f475,f471]) ).

fof(f471,plain,
    ! [X2,X0,X1] :
      ( sum(X1,X0,n0)
      | ~ rdn_translate(X1,rdn_pos(X2))
      | ~ rdn_translate(X0,rdn_neg(X2)) ),
    inference(cnf_transformation,[],[f463]) ).

fof(f463,plain,
    ! [X0,X1,X2] :
      ( ~ rdn_translate(X1,rdn_pos(X2))
      | sum(X1,X0,n0)
      | ~ rdn_translate(X0,rdn_neg(X2)) ),
    inference(rectify,[],[f460]) ).

fof(f460,plain,
    ! [X1,X0,X2] :
      ( ~ rdn_translate(X0,rdn_pos(X2))
      | sum(X0,X1,n0)
      | ~ rdn_translate(X1,rdn_neg(X2)) ),
    inference(flattening,[],[f459]) ).

fof(f459,plain,
    ! [X0,X1,X2] :
      ( sum(X0,X1,n0)
      | ~ rdn_translate(X1,rdn_neg(X2))
      | ~ rdn_translate(X0,rdn_pos(X2)) ),
    inference(ennf_transformation,[],[f405]) ).

fof(f405,plain,
    ! [X0,X1,X2] :
      ( ( rdn_translate(X1,rdn_neg(X2))
        & rdn_translate(X0,rdn_pos(X2)) )
     => sum(X0,X1,n0) ),
    inference(rectify,[],[f291]) ).

fof(f291,axiom,
    ! [X12,X13,X9] :
      ( ( rdn_translate(X13,rdn_neg(X9))
        & rdn_translate(X12,rdn_pos(X9)) )
     => sum(X12,X13,n0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_entry_point_posx_negx) ).

fof(f475,plain,
    ! [X0] : ~ sum(X0,nn5,n0),
    inference(cnf_transformation,[],[f461]) ).

fof(f461,plain,
    ! [X0] : ~ sum(X0,nn5,n0),
    inference(ennf_transformation,[],[f403]) ).

fof(f403,negated_conjecture,
    ~ ? [X0] : sum(X0,nn5,n0),
    inference(negated_conjecture,[],[f402]) ).

fof(f402,conjecture,
    ? [X0] : sum(X0,nn5,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_what_nn5_n0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : NUM326+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.15/0.35  % Computer : n004.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Aug 30 06:19:34 EDT 2022
% 0.15/0.35  % CPUTime    : 
% 0.20/0.54  % (32364)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.55  % (32369)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.55  % (32380)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.56  % (32369)First to succeed.
% 0.20/0.56  % (32369)Refutation found. Thanks to Tanya!
% 0.20/0.56  % SZS status Theorem for theBenchmark
% 0.20/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56  % (32369)------------------------------
% 0.20/0.56  % (32369)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (32369)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (32369)Termination reason: Refutation
% 0.20/0.56  
% 0.20/0.56  % (32369)Memory used [KB]: 1791
% 0.20/0.56  % (32369)Time elapsed: 0.125 s
% 0.20/0.56  % (32369)Instructions burned: 3 (million)
% 0.20/0.56  % (32369)------------------------------
% 0.20/0.56  % (32369)------------------------------
% 0.20/0.56  % (32363)Success in time 0.208 s
%------------------------------------------------------------------------------