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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : NUM291+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 : n014.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.20s 0.55s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   25 (  13 unt;   0 def)
%            Number of atoms       :   59 (   5 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   63 (  29   ~;  22   |;   9   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   35 (  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1158,plain,
    $false,
    inference(resolution,[],[f1155,f905]) ).

fof(f905,plain,
    ~ less(n2,n3),
    inference(resolution,[],[f732,f586]) ).

fof(f586,plain,
    less(n3,n2),
    inference(cnf_transformation,[],[f420]) ).

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

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

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

fof(f732,plain,
    ! [X0,X1] :
      ( ~ less(X1,X0)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f487]) ).

fof(f487,plain,
    ! [X0,X1] :
      ( ( less(X0,X1)
        | X0 = X1
        | less(X1,X0) )
      & ( ( X0 != X1
          & ~ less(X1,X0) )
        | ~ less(X0,X1) ) ),
    inference(flattening,[],[f486]) ).

fof(f486,plain,
    ! [X0,X1] :
      ( ( less(X0,X1)
        | X0 = X1
        | less(X1,X0) )
      & ( ( X0 != X1
          & ~ less(X1,X0) )
        | ~ less(X0,X1) ) ),
    inference(nnf_transformation,[],[f284]) ).

fof(f284,axiom,
    ! [X0,X1] :
      ( less(X0,X1)
    <=> ( X0 != X1
        & ~ less(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).

fof(f1155,plain,
    less(n2,n3),
    inference(resolution,[],[f985,f833]) ).

fof(f833,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(f985,plain,
    ! [X0] :
      ( ~ rdn_translate(X0,rdn_pos(rdnn(n2)))
      | less(X0,n3) ),
    inference(resolution,[],[f936,f861]) ).

fof(f861,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(f936,plain,
    ! [X2,X3] :
      ( ~ rdn_positive_less(X2,rdnn(n3))
      | less(X3,n3)
      | ~ rdn_translate(X3,rdn_pos(X2)) ),
    inference(resolution,[],[f533,f767]) ).

fof(f767,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(f533,plain,
    ! [X2,X3,X0,X1] :
      ( ~ rdn_translate(X3,rdn_pos(X0))
      | ~ rdn_positive_less(X1,X0)
      | less(X2,X3)
      | ~ rdn_translate(X2,rdn_pos(X1)) ),
    inference(cnf_transformation,[],[f476]) ).

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : NUM291+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/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.13/0.35  % Computer : n014.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:20:18 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.51  % (22425)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52  % (22433)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.52  % (22425)Instruction limit reached!
% 0.20/0.52  % (22425)------------------------------
% 0.20/0.52  % (22425)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (22425)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (22425)Termination reason: Unknown
% 0.20/0.52  % (22425)Termination phase: shuffling
% 0.20/0.52  
% 0.20/0.52  % (22425)Memory used [KB]: 1791
% 0.20/0.52  % (22425)Time elapsed: 0.004 s
% 0.20/0.52  % (22425)Instructions burned: 3 (million)
% 0.20/0.52  % (22425)------------------------------
% 0.20/0.52  % (22425)------------------------------
% 0.20/0.53  % (22435)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54  % (22427)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.54  % (22433)First to succeed.
% 0.20/0.55  % (22433)Refutation found. Thanks to Tanya!
% 0.20/0.55  % SZS status Theorem for theBenchmark
% 0.20/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55  % (22433)------------------------------
% 0.20/0.55  % (22433)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (22433)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (22433)Termination reason: Refutation
% 0.20/0.55  
% 0.20/0.55  % (22433)Memory used [KB]: 6524
% 0.20/0.55  % (22433)Time elapsed: 0.099 s
% 0.20/0.55  % (22433)Instructions burned: 23 (million)
% 0.20/0.55  % (22433)------------------------------
% 0.20/0.55  % (22433)------------------------------
% 0.20/0.55  % (22378)Success in time 0.178 s
%------------------------------------------------------------------------------