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

% Computer : n001.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:36:12 EDT 2022

% Result   : Theorem 0.19s 0.49s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   23 (   1 unt;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   52 (  22   ~;  19   |;   3   &)
%                                         (   5 <=>;   2  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   4 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   22 (  10   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f28,plain,
    $false,
    inference(avatar_sat_refutation,[],[f14,f23,f25,f27]) ).

fof(f27,plain,
    ( ~ spl2_1
    | ~ spl2_2 ),
    inference(avatar_contradiction_clause,[],[f26]) ).

fof(f26,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_2 ),
    inference(resolution,[],[f18,f13]) ).

fof(f13,plain,
    ( ! [X0] : ~ p(X0)
    | ~ spl2_1 ),
    inference(avatar_component_clause,[],[f12]) ).

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

fof(f18,plain,
    ( p(sK1)
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f16]) ).

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

fof(f25,plain,
    ( ~ spl2_1
    | ~ spl2_3 ),
    inference(avatar_contradiction_clause,[],[f24]) ).

fof(f24,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_3 ),
    inference(resolution,[],[f22,f13]) ).

fof(f22,plain,
    ( p(sK0)
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f20]) ).

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

fof(f23,plain,
    ( spl2_2
    | spl2_3 ),
    inference(avatar_split_clause,[],[f9,f20,f16]) ).

fof(f9,plain,
    ( p(sK0)
    | p(sK1) ),
    inference(cnf_transformation,[],[f8]) ).

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

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

fof(f7,plain,
    ( ? [X3] : p(X3)
   => p(sK1) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

fof(f14,plain,
    ( spl2_1
    | spl2_1 ),
    inference(avatar_split_clause,[],[f10,f12,f12]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN963+1 : TPTP v8.1.0. Released v3.1.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.33  % Computer : n001.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 22:54:02 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.48  % (8331)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.48  % (8331)First to succeed.
% 0.19/0.49  % (8331)Refutation found. Thanks to Tanya!
% 0.19/0.49  % SZS status Theorem for theBenchmark
% 0.19/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49  % (8331)------------------------------
% 0.19/0.49  % (8331)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (8331)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (8331)Termination reason: Refutation
% 0.19/0.49  
% 0.19/0.49  % (8331)Memory used [KB]: 5884
% 0.19/0.49  % (8331)Time elapsed: 0.088 s
% 0.19/0.49  % (8331)Instructions burned: 1 (million)
% 0.19/0.49  % (8331)------------------------------
% 0.19/0.49  % (8331)------------------------------
% 0.19/0.49  % (8311)Success in time 0.144 s
%------------------------------------------------------------------------------