TSTP Solution File: NUM892_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---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_uns --cores 0 -t %d %s

% Computer : n026.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:02:47 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   36 (   2 unt;   2 typ;   0 def)
%            Number of atoms       :  105 (  23 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  120 (  49   ~;  50   |;  12   &)
%                                         (   7 <=>;   1  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number arithmetic     :   79 (  54 atm;   0 fun;   0 num;  25 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   3 usr;   4 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   25 (  15   !;  10   ?;  25   :)

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

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

tff(f84,plain,
    $false,
    inference(avatar_sat_refutation,[],[f34,f40,f41,f78,f83]) ).

tff(f83,plain,
    ( ~ spl2_1
    | ~ spl2_2 ),
    inference(avatar_contradiction_clause,[],[f82]) ).

tff(f82,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_2 ),
    inference(subsumption_resolution,[],[f81,f9]) ).

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

tff(f81,plain,
    ( $less(sK0,sK0)
    | ~ spl2_1
    | ~ spl2_2 ),
    inference(superposition,[],[f33,f28]) ).

tff(f28,plain,
    ( ( sK0 = sK1 )
    | ~ spl2_1 ),
    inference(avatar_component_clause,[],[f27]) ).

tff(f27,plain,
    ( spl2_1
  <=> ( sK0 = sK1 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).

tff(f33,plain,
    ( $less(sK1,sK0)
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f31]) ).

tff(f31,plain,
    ( spl2_2
  <=> $less(sK1,sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).

tff(f78,plain,
    ( ~ spl2_2
    | ~ spl2_3 ),
    inference(avatar_contradiction_clause,[],[f77]) ).

tff(f77,plain,
    ( $false
    | ~ spl2_2
    | ~ spl2_3 ),
    inference(subsumption_resolution,[],[f76,f9]) ).

tff(f76,plain,
    ( $less(sK0,sK0)
    | ~ spl2_2
    | ~ spl2_3 ),
    inference(resolution,[],[f42,f39]) ).

tff(f39,plain,
    ( $less(sK0,sK1)
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f37]) ).

tff(f37,plain,
    ( spl2_3
  <=> $less(sK0,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

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

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

tff(f41,plain,
    ( spl2_2
    | ~ spl2_3 ),
    inference(avatar_split_clause,[],[f25,f37,f31]) ).

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

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

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

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

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

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

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

tff(f16,plain,
    ~ ! [X0: $int,X1: $int] :
        ( ~ $less(X0,X1)
      <=> ( $less(X1,X0)
          | ( X0 = X1 ) ) ),
    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/sandbox/benchmark/theBenchmark.p',less_lesseq) ).

tff(f40,plain,
    ( spl2_3
    | spl2_1 ),
    inference(avatar_split_clause,[],[f35,f27,f37]) ).

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

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

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

tff(f34,plain,
    ( ~ spl2_1
    | spl2_2 ),
    inference(avatar_split_clause,[],[f24,f31,f27]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : NUM892=1 : TPTP v8.1.0. Released v5.0.0.
% 0.10/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 : n026.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 09:26:05 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.51  % (4042)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/32Mi)
% 0.20/0.51  % (4050)lrs+22_1:1_amm=sco:fsr=off:gve=force:sos=on:uwa=all:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.51  % (4059)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.51  % (4051)dis+20_1:12_aac=none:acc=model:awrs=converge:fd=preordered:fsr=off:nicw=on:nwc=3.0:s2a=on:s2agt=16:spb=goal:to=lpo:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.51  % (4049)dis+10_1:64_nwc=1.4:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/21Mi)
% 0.20/0.52  % (4058)dis+2_1:1_av=off:bsr=on:erd=off:s2pl=on:sgt=16:sos=on:sp=frequency:ss=axioms:i=46:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/46Mi)
% 0.20/0.52  % (4051)Instruction limit reached!
% 0.20/0.52  % (4051)------------------------------
% 0.20/0.52  % (4051)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (4051)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (4051)Termination reason: Unknown
% 0.20/0.52  % (4051)Termination phase: Saturation
% 0.20/0.52  
% 0.20/0.52  % (4051)Memory used [KB]: 5373
% 0.20/0.52  % (4051)Time elapsed: 0.005 s
% 0.20/0.52  % (4051)Instructions burned: 2 (million)
% 0.20/0.52  % (4051)------------------------------
% 0.20/0.52  % (4051)------------------------------
% 0.20/0.52  % (4059)First to succeed.
% 0.20/0.52  % (4043)lrs+1010_1:1_bd=off:fd=off:fde=none:ins=3:sac=on:sos=on:spb=goal:to=lpo:i=36:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/36Mi)
% 0.20/0.52  % (4050)Also succeeded, but the first one will report.
% 0.20/0.52  % (4059)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Theorem for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (4059)------------------------------
% 0.20/0.52  % (4059)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (4059)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (4059)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (4059)Memory used [KB]: 5500
% 0.20/0.52  % (4059)Time elapsed: 0.070 s
% 0.20/0.52  % (4059)Instructions burned: 3 (million)
% 0.20/0.52  % (4059)------------------------------
% 0.20/0.52  % (4059)------------------------------
% 0.20/0.52  % (4034)Success in time 0.163 s
%------------------------------------------------------------------------------