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

% Computer : n027.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:08 EDT 2022

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

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

fof(f41,plain,
    ( ~ spl2_1
    | ~ spl2_3 ),
    inference(avatar_contradiction_clause,[],[f40]) ).

fof(f40,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_3 ),
    inference(resolution,[],[f32,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(f32,plain,
    ( p(sK0)
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f30]) ).

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

fof(f39,plain,
    ( ~ spl2_1
    | ~ spl2_4 ),
    inference(avatar_contradiction_clause,[],[f38]) ).

fof(f38,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_4 ),
    inference(resolution,[],[f36,f20]) ).

fof(f36,plain,
    ( p(sK1)
    | ~ spl2_4 ),
    inference(avatar_component_clause,[],[f34]) ).

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

fof(f37,plain,
    ( spl2_3
    | ~ spl2_2
    | spl2_4 ),
    inference(avatar_split_clause,[],[f16,f34,f23,f30]) ).

fof(f23,plain,
    ( spl2_2
  <=> c ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).

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

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

fof(f10,plain,
    ( ( ( c
        & ! [X0] : ~ p(X0) )
      | ! [X1] :
          ( c
          & ~ p(X1) ) )
    & ( ~ c
      | p(sK0)
      | ~ 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,
    ( ( ( c
        & ! [X0] : ~ p(X0) )
      | ! [X1] :
          ( c
          & ~ p(X1) ) )
    & ( ~ c
      | ? [X2] : p(X2)
      | ? [X3] :
          ( ~ c
          | p(X3) ) ) ),
    inference(rectify,[],[f6]) ).

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

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

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

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

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

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

fof(f27,plain,
    spl2_2,
    inference(avatar_split_clause,[],[f17,f23]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN934+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % 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.33  % Computer : n027.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 30 22:47:01 EDT 2022
% 0.13/0.33  % CPUTime    : 
% 0.18/0.49  % (14359)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.18/0.49  % (14354)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.49  Detected maximum model sizes of [2]
% 0.18/0.49  % (14359)First to succeed.
% 0.18/0.49  % (14351)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.49  % (14351)Also succeeded, but the first one will report.
% 0.18/0.49  TRYING [1]
% 0.18/0.49  TRYING [2]
% 0.18/0.50  % (14359)Refutation found. Thanks to Tanya!
% 0.18/0.50  % SZS status Theorem for theBenchmark
% 0.18/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50  % (14359)------------------------------
% 0.18/0.50  % (14359)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50  % (14359)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50  % (14359)Termination reason: Refutation
% 0.18/0.50  
% 0.18/0.50  % (14359)Memory used [KB]: 5884
% 0.18/0.50  % (14359)Time elapsed: 0.052 s
% 0.18/0.50  % (14359)Instructions burned: 1 (million)
% 0.18/0.50  % (14359)------------------------------
% 0.18/0.50  % (14359)------------------------------
% 0.18/0.50  % (14336)Success in time 0.155 s
%------------------------------------------------------------------------------