TSTP Solution File: DAT022_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : DAT022_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 : 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 16:03:55 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   48 (   6 unt;   8 typ;   0 def)
%            Number of atoms       :  135 (  31 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  145 (  50   ~;  40   |;  35   &)
%                                         (   6 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :  121 (  24 atm;   0 fun;  53 num;  44 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    9 (   6 usr;   7 con; 0-2 aty)
%            Number of variables   :   70 (  59   !;  11   ?;  70   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    collection: $tType ).

tff(func_def_0,type,
    empty: collection ).

tff(func_def_1,type,
    add: ( $int * collection ) > collection ).

tff(func_def_2,type,
    remove: ( $int * collection ) > collection ).

tff(func_def_9,type,
    sK0: collection ).

tff(func_def_10,type,
    sK1: collection ).

tff(func_def_11,type,
    sK2: $int ).

tff(pred_def_1,type,
    in: ( $int * collection ) > $o ).

tff(f154,plain,
    $false,
    inference(avatar_sat_refutation,[],[f112,f126,f153]) ).

tff(f153,plain,
    ~ spl3_3,
    inference(avatar_contradiction_clause,[],[f152]) ).

tff(f152,plain,
    ( $false
    | ~ spl3_3 ),
    inference(subsumption_resolution,[],[f149,f39]) ).

tff(f39,plain,
    ~ $less(0,sK2),
    inference(cnf_transformation,[],[f30]) ).

tff(f30,plain,
    ( ! [X2: $int] :
        ( ~ in(X2,sK0)
        | $less(0,X2) )
    & ( sK1 = add(2,remove(7,sK0)) )
    & ~ $less(0,sK2)
    & in(sK2,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f27,f29,f28]) ).

tff(f28,plain,
    ( ? [X0: collection,X1: collection] :
        ( ! [X2: $int] :
            ( ~ in(X2,X0)
            | $less(0,X2) )
        & ( add(2,remove(7,X0)) = X1 )
        & ? [X3: $int] :
            ( ~ $less(0,X3)
            & in(X3,X1) ) )
   => ( ! [X2: $int] :
          ( ~ in(X2,sK0)
          | $less(0,X2) )
      & ( sK1 = add(2,remove(7,sK0)) )
      & ? [X3: $int] :
          ( ~ $less(0,X3)
          & in(X3,sK1) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f29,plain,
    ( ? [X3: $int] :
        ( ~ $less(0,X3)
        & in(X3,sK1) )
   => ( ~ $less(0,sK2)
      & in(sK2,sK1) ) ),
    introduced(choice_axiom,[]) ).

tff(f27,plain,
    ? [X0: collection,X1: collection] :
      ( ! [X2: $int] :
          ( ~ in(X2,X0)
          | $less(0,X2) )
      & ( add(2,remove(7,X0)) = X1 )
      & ? [X3: $int] :
          ( ~ $less(0,X3)
          & in(X3,X1) ) ),
    inference(flattening,[],[f26]) ).

tff(f26,plain,
    ? [X1: collection,X0: collection] :
      ( ? [X3: $int] :
          ( ~ $less(0,X3)
          & in(X3,X1) )
      & ! [X2: $int] :
          ( ~ in(X2,X0)
          | $less(0,X2) )
      & ( add(2,remove(7,X0)) = X1 ) ),
    inference(ennf_transformation,[],[f21]) ).

tff(f21,plain,
    ~ ! [X1: collection,X0: collection] :
        ( ( ! [X2: $int] :
              ( in(X2,X0)
             => $less(0,X2) )
          & ( add(2,remove(7,X0)) = X1 ) )
       => ! [X3: $int] :
            ( in(X3,X1)
           => $less(0,X3) ) ),
    inference(rectify,[],[f8]) ).

tff(f8,plain,
    ~ ! [X1: collection,X0: collection] :
        ( ( ( add(2,remove(7,X1)) = X0 )
          & ! [X2: $int] :
              ( in(X2,X1)
             => $less(0,X2) ) )
       => ! [X3: $int] :
            ( in(X3,X0)
           => $less(0,X3) ) ),
    inference(theory_normalization,[],[f7]) ).

tff(f7,negated_conjecture,
    ~ ! [X1: collection,X0: collection] :
        ( ( ( add(2,remove(7,X1)) = X0 )
          & ! [X2: $int] :
              ( in(X2,X1)
             => $greater(X2,0) ) )
       => ! [X3: $int] :
            ( in(X3,X0)
           => $greater(X3,0) ) ),
    inference(negated_conjecture,[],[f6]) ).

tff(f6,conjecture,
    ! [X1: collection,X0: collection] :
      ( ( ( add(2,remove(7,X1)) = X0 )
        & ! [X2: $int] :
            ( in(X2,X1)
           => $greater(X2,0) ) )
     => ! [X3: $int] :
          ( in(X3,X0)
         => $greater(X3,0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(f149,plain,
    ( $less(0,sK2)
    | ~ spl3_3 ),
    inference(resolution,[],[f134,f41]) ).

tff(f41,plain,
    ! [X2: $int] :
      ( ~ in(X2,sK0)
      | $less(0,X2) ),
    inference(cnf_transformation,[],[f30]) ).

tff(f134,plain,
    ( in(sK2,sK0)
    | ~ spl3_3 ),
    inference(resolution,[],[f107,f45]) ).

tff(f45,plain,
    ! [X2: $int,X0: $int,X1: collection] :
      ( ~ in(X0,remove(X2,X1))
      | in(X0,X1) ),
    inference(cnf_transformation,[],[f34]) ).

tff(f34,plain,
    ! [X0: $int,X1: collection,X2: $int] :
      ( ( ( ( X0 != X2 )
          & in(X0,X1) )
        | ~ in(X0,remove(X2,X1)) )
      & ( in(X0,remove(X2,X1))
        | ( X0 = X2 )
        | ~ in(X0,X1) ) ),
    inference(rectify,[],[f33]) ).

tff(f33,plain,
    ! [X2: $int,X0: collection,X1: $int] :
      ( ( ( ( X1 != X2 )
          & in(X2,X0) )
        | ~ in(X2,remove(X1,X0)) )
      & ( in(X2,remove(X1,X0))
        | ( X1 = X2 )
        | ~ in(X2,X0) ) ),
    inference(flattening,[],[f32]) ).

tff(f32,plain,
    ! [X2: $int,X0: collection,X1: $int] :
      ( ( ( ( X1 != X2 )
          & in(X2,X0) )
        | ~ in(X2,remove(X1,X0)) )
      & ( in(X2,remove(X1,X0))
        | ( X1 = X2 )
        | ~ in(X2,X0) ) ),
    inference(nnf_transformation,[],[f25]) ).

tff(f25,plain,
    ! [X2: $int,X0: collection,X1: $int] :
      ( ( ( X1 != X2 )
        & in(X2,X0) )
    <=> in(X2,remove(X1,X0)) ),
    inference(rectify,[],[f5]) ).

tff(f5,axiom,
    ! [X9: collection,X10: $int,X8: $int] :
      ( in(X8,remove(X10,X9))
    <=> ( ( X8 != X10 )
        & in(X8,X9) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).

tff(f107,plain,
    ( in(sK2,remove(7,sK0))
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f105]) ).

tff(f105,plain,
    ( spl3_3
  <=> in(sK2,remove(7,sK0)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).

tff(f126,plain,
    ~ spl3_4,
    inference(avatar_contradiction_clause,[],[f125]) ).

tff(f125,plain,
    ( $false
    | ~ spl3_4 ),
    inference(evaluation,[],[f123]) ).

tff(f123,plain,
    ( ~ $less(0,2)
    | ~ spl3_4 ),
    inference(superposition,[],[f39,f111]) ).

tff(f111,plain,
    ( ( 2 = sK2 )
    | ~ spl3_4 ),
    inference(avatar_component_clause,[],[f109]) ).

tff(f109,plain,
    ( spl3_4
  <=> ( 2 = sK2 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).

tff(f112,plain,
    ( spl3_3
    | spl3_4 ),
    inference(avatar_split_clause,[],[f88,f109,f105]) ).

tff(f88,plain,
    ( ( 2 = sK2 )
    | in(sK2,remove(7,sK0)) ),
    inference(resolution,[],[f68,f38]) ).

tff(f38,plain,
    in(sK2,sK1),
    inference(cnf_transformation,[],[f30]) ).

tff(f68,plain,
    ! [X0: $int] :
      ( ~ in(X0,sK1)
      | ( 2 = X0 )
      | in(X0,remove(7,sK0)) ),
    inference(superposition,[],[f47,f40]) ).

tff(f40,plain,
    sK1 = add(2,remove(7,sK0)),
    inference(cnf_transformation,[],[f30]) ).

tff(f47,plain,
    ! [X2: $int,X0: collection,X1: $int] :
      ( ~ in(X1,add(X2,X0))
      | ( X1 = X2 )
      | in(X1,X0) ),
    inference(cnf_transformation,[],[f37]) ).

tff(f37,plain,
    ! [X0: collection,X1: $int,X2: $int] :
      ( ( in(X1,add(X2,X0))
        | ( ( X1 != X2 )
          & ~ in(X1,X0) ) )
      & ( ( X1 = X2 )
        | in(X1,X0)
        | ~ in(X1,add(X2,X0)) ) ),
    inference(rectify,[],[f36]) ).

tff(f36,plain,
    ! [X1: collection,X2: $int,X0: $int] :
      ( ( in(X2,add(X0,X1))
        | ( ( X0 != X2 )
          & ~ in(X2,X1) ) )
      & ( ( X0 = X2 )
        | in(X2,X1)
        | ~ in(X2,add(X0,X1)) ) ),
    inference(flattening,[],[f35]) ).

tff(f35,plain,
    ! [X1: collection,X2: $int,X0: $int] :
      ( ( in(X2,add(X0,X1))
        | ( ( X0 != X2 )
          & ~ in(X2,X1) ) )
      & ( ( X0 = X2 )
        | in(X2,X1)
        | ~ in(X2,add(X0,X1)) ) ),
    inference(nnf_transformation,[],[f22]) ).

tff(f22,plain,
    ! [X1: collection,X2: $int,X0: $int] :
      ( in(X2,add(X0,X1))
    <=> ( ( X0 = X2 )
        | in(X2,X1) ) ),
    inference(rectify,[],[f4]) ).

tff(f4,axiom,
    ! [X7: $int,X6: collection,X5: $int] :
      ( in(X5,add(X7,X6))
    <=> ( ( X5 = X7 )
        | in(X5,X6) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : DAT022=1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/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.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   : Mon Aug 29 20:13:10 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.50  % (16543)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51  % (16534)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 (2999ds/2Mi)
% 0.19/0.51  % (16534)Instruction limit reached!
% 0.19/0.51  % (16534)------------------------------
% 0.19/0.51  % (16534)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (16534)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (16534)Termination reason: Unknown
% 0.19/0.51  % (16534)Termination phase: Saturation
% 0.19/0.51  
% 0.19/0.51  % (16534)Memory used [KB]: 5500
% 0.19/0.51  % (16534)Time elapsed: 0.004 s
% 0.19/0.51  % (16534)Instructions burned: 2 (million)
% 0.19/0.51  % (16534)------------------------------
% 0.19/0.51  % (16534)------------------------------
% 0.19/0.51  % (16526)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 (2999ds/36Mi)
% 0.19/0.51  % (16543)First to succeed.
% 0.19/0.51  % (16526)Also succeeded, but the first one will report.
% 0.19/0.52  % (16543)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Theorem for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (16543)------------------------------
% 0.19/0.52  % (16543)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (16543)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (16543)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (16543)Memory used [KB]: 5500
% 0.19/0.52  % (16543)Time elapsed: 0.068 s
% 0.19/0.52  % (16543)Instructions burned: 5 (million)
% 0.19/0.52  % (16543)------------------------------
% 0.19/0.52  % (16543)------------------------------
% 0.19/0.52  % (16516)Success in time 0.168 s
%------------------------------------------------------------------------------