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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : NUM290+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 : n013.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:02 EDT 2022

% Result   : Theorem 0.21s 0.51s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   20 (  12 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   39 (  18   ~;  15   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   27 (  27   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f596,plain,
    $false,
    inference(subsumption_resolution,[],[f595,f538]) ).

fof(f538,plain,
    ~ less(n2,n3),
    inference(cnf_transformation,[],[f404]) ).

fof(f404,plain,
    ~ less(n2,n3),
    inference(flattening,[],[f403]) ).

fof(f403,negated_conjecture,
    ~ less(n2,n3),
    inference(negated_conjecture,[],[f402]) ).

fof(f402,conjecture,
    less(n2,n3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',n2_less_n3) ).

fof(f595,plain,
    less(n2,n3),
    inference(resolution,[],[f581,f529]) ).

fof(f529,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn2) ).

fof(f581,plain,
    ! [X2] :
      ( ~ rdn_translate(X2,rdn_pos(rdnn(n2)))
      | less(X2,n3) ),
    inference(resolution,[],[f552,f540]) ).

fof(f540,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    inference(cnf_transformation,[],[f268]) ).

fof(f268,axiom,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn_positive_less23) ).

fof(f552,plain,
    ! [X6,X7] :
      ( ~ rdn_positive_less(X7,rdnn(n3))
      | ~ rdn_translate(X6,rdn_pos(X7))
      | less(X6,n3) ),
    inference(resolution,[],[f544,f536]) ).

fof(f536,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(cnf_transformation,[],[f4]) ).

fof(f4,axiom,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn3) ).

fof(f544,plain,
    ! [X2,X3,X0,X1] :
      ( ~ rdn_translate(X3,rdn_pos(X0))
      | ~ rdn_translate(X2,rdn_pos(X1))
      | ~ rdn_positive_less(X1,X0)
      | less(X2,X3) ),
    inference(cnf_transformation,[],[f522]) ).

fof(f522,plain,
    ! [X0,X1,X2,X3] :
      ( ~ rdn_translate(X2,rdn_pos(X1))
      | ~ rdn_translate(X3,rdn_pos(X0))
      | ~ rdn_positive_less(X1,X0)
      | less(X2,X3) ),
    inference(rectify,[],[f514]) ).

fof(f514,plain,
    ! [X0,X2,X3,X1] :
      ( ~ rdn_translate(X3,rdn_pos(X2))
      | ~ rdn_translate(X1,rdn_pos(X0))
      | ~ rdn_positive_less(X2,X0)
      | less(X3,X1) ),
    inference(flattening,[],[f513]) ).

fof(f513,plain,
    ! [X1,X0,X2,X3] :
      ( less(X3,X1)
      | ~ rdn_translate(X3,rdn_pos(X2))
      | ~ rdn_positive_less(X2,X0)
      | ~ rdn_translate(X1,rdn_pos(X0)) ),
    inference(ennf_transformation,[],[f407]) ).

fof(f407,plain,
    ! [X1,X0,X2,X3] :
      ( ( rdn_translate(X3,rdn_pos(X2))
        & rdn_positive_less(X2,X0)
        & rdn_translate(X1,rdn_pos(X0)) )
     => less(X3,X1) ),
    inference(rectify,[],[f281]) ).

fof(f281,axiom,
    ! [X10,X1,X9,X0] :
      ( ( rdn_translate(X0,rdn_pos(X9))
        & rdn_translate(X1,rdn_pos(X10))
        & rdn_positive_less(X9,X10) )
     => less(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_entry_point_pos_pos) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : NUM290+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35  % Computer : n013.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 06:15:47 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.21/0.49  % (4903)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.21/0.49  % (4895)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.50  % (4895)Instruction limit reached!
% 0.21/0.50  % (4895)------------------------------
% 0.21/0.50  % (4895)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50  % (4903)First to succeed.
% 0.21/0.50  % (4895)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50  % (4895)Termination reason: Unknown
% 0.21/0.50  % (4895)Termination phase: Preprocessing 3
% 0.21/0.50  
% 0.21/0.50  % (4895)Memory used [KB]: 1791
% 0.21/0.50  % (4895)Time elapsed: 0.004 s
% 0.21/0.50  % (4895)Instructions burned: 4 (million)
% 0.21/0.50  % (4895)------------------------------
% 0.21/0.50  % (4895)------------------------------
% 0.21/0.51  % (4903)Refutation found. Thanks to Tanya!
% 0.21/0.51  % SZS status Theorem for theBenchmark
% 0.21/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51  % (4903)------------------------------
% 0.21/0.51  % (4903)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (4903)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (4903)Termination reason: Refutation
% 0.21/0.51  
% 0.21/0.51  % (4903)Memory used [KB]: 6268
% 0.21/0.51  % (4903)Time elapsed: 0.075 s
% 0.21/0.51  % (4903)Instructions burned: 7 (million)
% 0.21/0.51  % (4903)------------------------------
% 0.21/0.51  % (4903)------------------------------
% 0.21/0.51  % (4877)Success in time 0.149 s
%------------------------------------------------------------------------------