%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN934+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_sat --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 19:46:08 EDT 2022

% Result   : Theorem 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (   2 unt;   0 def)
%            Number of atoms       :   95 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  106 (  40   ~;  39   |;  12   &)
%                                         (   6 <=>;   8  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   5 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   28 (  12   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f36,plain,
    $false,
    inference(avatar_sat_refutation,[],[f21,f31,f33,f35]) ).

fof(f35,plain,
    ( ~ spl2_1
    | ~ spl2_2 ),
    inference(avatar_contradiction_clause,[],[f34]) ).

fof(f34,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_2 ),
    inference(subsumption_resolution,[],[f26,f20]) ).

fof(f20,plain,
    ( ! [X1] : ~ p(X1)
    | ~ spl2_1 ),
    inference(avatar_component_clause,[],[f19]) ).

fof(f19,plain,
    ( spl2_1
  <=> ! [X1] : ~ p(X1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).

fof(f26,plain,
    ( p(sK0)
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f24]) ).

fof(f24,plain,
    ( spl2_2
  <=> p(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).

fof(f33,plain,
    ( ~ spl2_1
    | ~ spl2_3 ),
    inference(avatar_contradiction_clause,[],[f32]) ).

fof(f32,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_3 ),
    inference(subsumption_resolution,[],[f30,f20]) ).

fof(f30,plain,
    ( p(sK1)
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f28]) ).

fof(f28,plain,
    ( spl2_3
  <=> p(sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

fof(f31,plain,
    ( spl2_2
    | spl2_3 ),
    inference(avatar_split_clause,[],[f22,f28,f24]) ).

fof(f22,plain,
    ( p(sK1)
    | p(sK0) ),
    inference(subsumption_resolution,[],[f16,f17]) ).

fof(f17,plain,
    c,
    inference(duplicate_literal_removal,[],[f13]) ).

fof(f13,plain,
    ( c
    | c ),
    inference(cnf_transformation,[],[f10]) ).

fof(f10,plain,
    ( ( ( ! [X0] : ~ p(X0)
        & c )
      | ! [X1] :
          ( c
          & ~ p(X1) ) )
    & ( p(sK0)
      | ~ c
      | ~ c
      | p(sK1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).

fof(f8,plain,
    ( ? [X2] : p(X2)
   => p(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ? [X3] :
        ( ~ c
        | p(X3) )
   => ( ~ c
      | p(sK1) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f4,plain,
    ( ? [X1] :
        ( ~ c
        | p(X1) )
  <~> ( ? [X0] : p(X0)
      | ~ c ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ? [X1] :
          ( c
         => p(X1) )
    <=> ( c
       => ? [X0] : p(X0) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( c
       => ? [X0] : p(X0) )
    <=> ? [X0] :
          ( c
         => p(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( c
     => ? [X0] : p(X0) )
  <=> ? [X0] :
        ( c
       => p(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f16,plain,
    ( ~ c
    | p(sK1)
    | p(sK0) ),
    inference(duplicate_literal_removal,[],[f11]) ).

fof(f11,plain,
    ( ~ c
    | p(sK0)
    | ~ c
    | p(sK1) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f21,plain,
    ( spl2_1
    | spl2_1 ),
    inference(avatar_split_clause,[],[f14,f19,f19]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ~ p(X0)
      | ~ p(X1) ),
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN934+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/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 : n026.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 22:46:06 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.49  % (3730)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/177Mi)
% 0.20/0.50  % (3716)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.20/0.50  % (3716)First to succeed.
% 0.20/0.50  % (3724)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.20/0.50  % (3716)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Theorem for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (3716)------------------------------
% 0.20/0.50  % (3716)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (3716)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (3716)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (3716)Memory used [KB]: 5373
% 0.20/0.50  % (3716)Time elapsed: 0.003 s
% 0.20/0.50  % (3716)Instructions burned: 1 (million)
% 0.20/0.50  % (3716)------------------------------
% 0.20/0.50  % (3716)------------------------------
% 0.20/0.50  % (3701)Success in time 0.158 s
%------------------------------------------------------------------------------