TSTP Solution File: SYN398+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN398+1 : TPTP v8.1.0. Released v2.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 : n007.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 19:37:47 EDT 2022

% Result   : Theorem 0.21s 0.50s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   33 (   2 unt;   0 def)
%            Number of atoms       :  101 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  112 (  44   ~;  40   |;  18   &)
%                                         (   7 <=>;   2  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   7 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   29 (  21   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f42,plain,
    $false,
    inference(avatar_sat_refutation,[],[f26,f27,f37,f39,f41]) ).

fof(f41,plain,
    ( ~ spl3_2
    | spl3_3 ),
    inference(avatar_contradiction_clause,[],[f40]) ).

fof(f40,plain,
    ( $false
    | ~ spl3_2
    | spl3_3 ),
    inference(subsumption_resolution,[],[f32,f25]) ).

fof(f25,plain,
    ( ! [X3] : f(X3)
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f24]) ).

fof(f24,plain,
    ( spl3_2
  <=> ! [X3] : f(X3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

fof(f32,plain,
    ( ~ f(sK1)
    | spl3_3 ),
    inference(avatar_component_clause,[],[f30]) ).

fof(f30,plain,
    ( spl3_3
  <=> f(sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).

fof(f39,plain,
    ( ~ spl3_2
    | spl3_4 ),
    inference(avatar_contradiction_clause,[],[f38]) ).

fof(f38,plain,
    ( $false
    | ~ spl3_2
    | spl3_4 ),
    inference(subsumption_resolution,[],[f36,f25]) ).

fof(f36,plain,
    ( ~ f(sK0)
    | spl3_4 ),
    inference(avatar_component_clause,[],[f34]) ).

fof(f34,plain,
    ( spl3_4
  <=> f(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).

fof(f37,plain,
    ( ~ spl3_3
    | ~ spl3_4 ),
    inference(avatar_split_clause,[],[f28,f34,f30]) ).

fof(f28,plain,
    ( ~ f(sK0)
    | ~ f(sK1) ),
    inference(subsumption_resolution,[],[f17,f18]) ).

fof(f18,plain,
    p,
    inference(duplicate_literal_removal,[],[f12]) ).

fof(f12,plain,
    ( p
    | p ),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ( ~ p
      | ~ f(sK0)
      | ~ f(sK1)
      | ~ p )
    & ( ( p
        & ! [X2] : f(X2) )
      | ! [X3] :
          ( f(X3)
          & p ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).

fof(f7,plain,
    ( ? [X0] : ~ f(X0)
   => ~ f(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ( ? [X1] :
        ( ~ f(X1)
        | ~ p )
   => ( ~ f(sK1)
      | ~ p ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ( ~ p
      | ? [X0] : ~ f(X0)
      | ? [X1] :
          ( ~ f(X1)
          | ~ p ) )
    & ( ( p
        & ! [X2] : f(X2) )
      | ! [X3] :
          ( f(X3)
          & p ) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ( ~ p
      | ? [X1] : ~ f(X1)
      | ? [X0] :
          ( ~ f(X0)
          | ~ p ) )
    & ( ( p
        & ! [X1] : f(X1) )
      | ! [X0] :
          ( f(X0)
          & p ) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ( ~ p
      | ? [X1] : ~ f(X1)
      | ? [X0] :
          ( ~ f(X0)
          | ~ p ) )
    & ( ( p
        & ! [X1] : f(X1) )
      | ! [X0] :
          ( f(X0)
          & p ) ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,plain,
    ( ! [X0] :
        ( f(X0)
        & p )
  <~> ( p
      & ! [X1] : f(X1) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0] :
          ( f(X0)
          & p )
    <=> ( p
        & ! [X1] : f(X1) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ! [X0] :
        ( f(X0)
        & p )
  <=> ( p
      & ! [X1] : f(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish215) ).

fof(f17,plain,
    ( ~ f(sK1)
    | ~ p
    | ~ f(sK0) ),
    inference(duplicate_literal_removal,[],[f14]) ).

fof(f14,plain,
    ( ~ f(sK0)
    | ~ f(sK1)
    | ~ p
    | ~ p ),
    inference(cnf_transformation,[],[f9]) ).

fof(f27,plain,
    ( spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f15,f24,f20]) ).

fof(f20,plain,
    ( spl3_1
  <=> sP2 ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

fof(f15,plain,
    ! [X2] :
      ( f(X2)
      | sP2 ),
    inference(cnf_transformation,[],[f15_D]) ).

fof(f15_D,plain,
    ( ! [X2] : f(X2)
  <=> ~ sP2 ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP2])]) ).

fof(f26,plain,
    ( ~ spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f16,f24,f20]) ).

fof(f16,plain,
    ! [X3] :
      ( f(X3)
      | ~ sP2 ),
    inference(general_splitting,[],[f11,f15_D]) ).

fof(f11,plain,
    ! [X2,X3] :
      ( f(X2)
      | f(X3) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYN398+1 : TPTP v8.1.0. Released v2.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.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 21:36:31 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.21/0.48  % (31198)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.21/0.49  % (31215)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/500Mi)
% 0.21/0.49  % (31211)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.21/0.49  % (31198)Instruction limit reached!
% 0.21/0.49  % (31198)------------------------------
% 0.21/0.49  % (31198)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49  % (31198)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.49  % (31198)Termination reason: Unknown
% 0.21/0.49  % (31198)Termination phase: Saturation
% 0.21/0.49  
% 0.21/0.49  % (31198)Memory used [KB]: 5373
% 0.21/0.49  % (31198)Time elapsed: 0.098 s
% 0.21/0.49  % (31198)Instructions burned: 2 (million)
% 0.21/0.49  % (31198)------------------------------
% 0.21/0.49  % (31198)------------------------------
% 0.21/0.49  % (31211)First to succeed.
% 0.21/0.49  % (31203)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.21/0.50  % (31211)Refutation found. Thanks to Tanya!
% 0.21/0.50  % SZS status Theorem for theBenchmark
% 0.21/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.50  % (31211)------------------------------
% 0.21/0.50  % (31211)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50  % (31211)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50  % (31211)Termination reason: Refutation
% 0.21/0.50  
% 0.21/0.50  % (31211)Memory used [KB]: 5373
% 0.21/0.50  % (31211)Time elapsed: 0.005 s
% 0.21/0.50  % (31211)Instructions burned: 1 (million)
% 0.21/0.50  % (31211)------------------------------
% 0.21/0.50  % (31211)------------------------------
% 0.21/0.50  % (31189)Success in time 0.146 s
%------------------------------------------------------------------------------