TSTP Solution File: NUM892_1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NUM892_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n021.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 18:07:08 EDT 2022

% Result   : Theorem 0.19s 0.43s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   25 (   6 unt;   2 typ;   0 def)
%            Number of atoms       :   70 (  21 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   76 (  29   ~;  31   |;  10   &)
%                                         (   4 <=>;   1  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number arithmetic     :   71 (  48 atm;   0 fun;   0 num;  23 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   23 (  15   !;   8   ?;  23   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_4,type,
    sK0: $int ).

tff(func_def_5,type,
    sK1: $int ).

tff(f110,plain,
    $false,
    inference(subsumption_resolution,[],[f104,f9]) ).

tff(f9,plain,
    ! [X0: $int] : ~ $less(X0,X0),
    introduced(theory_axiom_147,[]) ).

tff(f104,plain,
    $less(sK0,sK0),
    inference(backward_demodulation,[],[f27,f99]) ).

tff(f99,plain,
    sK0 = sK1,
    inference(resolution,[],[f73,f25]) ).

tff(f25,plain,
    ( $less(sK1,sK0)
    | ( sK0 = sK1 ) ),
    inference(subsumption_resolution,[],[f22,f11]) ).

tff(f11,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X0,X1)
      | $less(X1,X0)
      | ( X0 = X1 ) ),
    introduced(theory_axiom_149,[]) ).

tff(f22,plain,
    ( $less(sK1,sK0)
    | ( sK0 = sK1 )
    | ~ $less(sK0,sK1) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f21,plain,
    ( ( ( ( sK0 != sK1 )
        & ~ $less(sK1,sK0) )
      | $less(sK0,sK1) )
    & ( ( sK0 = sK1 )
      | $less(sK1,sK0)
      | ~ $less(sK0,sK1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f19,f20]) ).

tff(f20,plain,
    ( ? [X0: $int,X1: $int] :
        ( ( ( ( X0 != X1 )
            & ~ $less(X1,X0) )
          | $less(X0,X1) )
        & ( ( X0 = X1 )
          | $less(X1,X0)
          | ~ $less(X0,X1) ) )
   => ( ( ( ( sK0 != sK1 )
          & ~ $less(sK1,sK0) )
        | $less(sK0,sK1) )
      & ( ( sK0 = sK1 )
        | $less(sK1,sK0)
        | ~ $less(sK0,sK1) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f19,plain,
    ? [X0: $int,X1: $int] :
      ( ( ( ( X0 != X1 )
          & ~ $less(X1,X0) )
        | $less(X0,X1) )
      & ( ( X0 = X1 )
        | $less(X1,X0)
        | ~ $less(X0,X1) ) ),
    inference(flattening,[],[f18]) ).

tff(f18,plain,
    ? [X0: $int,X1: $int] :
      ( ( ( ( X0 != X1 )
          & ~ $less(X1,X0) )
        | $less(X0,X1) )
      & ( ( X0 = X1 )
        | $less(X1,X0)
        | ~ $less(X0,X1) ) ),
    inference(nnf_transformation,[],[f17]) ).

tff(f17,plain,
    ? [X0: $int,X1: $int] :
      ( ~ $less(X0,X1)
    <~> ( ( X0 = X1 )
        | $less(X1,X0) ) ),
    inference(ennf_transformation,[],[f16]) ).

tff(f16,plain,
    ~ ! [X1: $int,X0: $int] :
        ( ~ $less(X0,X1)
      <=> ( ( X0 = X1 )
          | $less(X1,X0) ) ),
    inference(rectify,[],[f3]) ).

tff(f3,plain,
    ~ ! [X1: $int,X0: $int] :
        ( ~ $less(X1,X0)
      <=> ( ( X0 = X1 )
          | $less(X0,X1) ) ),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ! [X1: $int,X0: $int] :
        ( $lesseq(X0,X1)
      <=> ( ( X0 = X1 )
          | $less(X0,X1) ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ! [X1: $int,X0: $int] :
      ( $lesseq(X0,X1)
    <=> ( ( X0 = X1 )
        | $less(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_lesseq) ).

tff(f73,plain,
    ~ $less(sK1,sK0),
    inference(resolution,[],[f56,f9]) ).

tff(f56,plain,
    ! [X0: $int] :
      ( $less(X0,sK1)
      | ~ $less(X0,sK0) ),
    inference(resolution,[],[f10,f27]) ).

tff(f10,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( ~ $less(X1,X2)
      | ~ $less(X0,X1)
      | $less(X0,X2) ),
    introduced(theory_axiom_148,[]) ).

tff(f27,plain,
    $less(sK0,sK1),
    inference(subsumption_resolution,[],[f26,f24]) ).

tff(f24,plain,
    ( $less(sK0,sK1)
    | ( sK0 != sK1 ) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f26,plain,
    ( ( sK0 = sK1 )
    | $less(sK0,sK1) ),
    inference(resolution,[],[f25,f23]) ).

tff(f23,plain,
    ( ~ $less(sK1,sK0)
    | $less(sK0,sK1) ),
    inference(cnf_transformation,[],[f21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : NUM892=1 : TPTP v8.1.0. Released v5.0.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 09:08:26 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.42  % (2972)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.42  % (2972)First to succeed.
% 0.19/0.43  % (2972)Refutation found. Thanks to Tanya!
% 0.19/0.43  % SZS status Theorem for theBenchmark
% 0.19/0.43  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.43  % (2972)------------------------------
% 0.19/0.43  % (2972)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.43  % (2972)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.43  % (2972)Termination reason: Refutation
% 0.19/0.43  
% 0.19/0.43  % (2972)Memory used [KB]: 1023
% 0.19/0.43  % (2972)Time elapsed: 0.007 s
% 0.19/0.43  % (2972)Instructions burned: 5 (million)
% 0.19/0.43  % (2972)------------------------------
% 0.19/0.43  % (2972)------------------------------
% 0.19/0.43  % (2956)Success in time 0.068 s
%------------------------------------------------------------------------------