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

% Computer : n011.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:26:22 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% 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 :  106 (  39   ~;  35   |;  22   &)
%                                         (   7 <=>;   2  =>;   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   :   30 (  14   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f42,plain,
    $false,
    inference(avatar_sat_refutation,[],[f30,f31,f36,f39,f41]) ).

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

fof(f40,plain,
    ( $false
    | ~ spl2_2
    | ~ spl2_3 ),
    inference(subsumption_resolution,[],[f25,f29]) ).

fof(f29,plain,
    ( ! [X0] : ~ big_q(X0)
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f28]) ).

fof(f28,plain,
    ( spl2_3
  <=> ! [X0] : ~ big_q(X0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

fof(f25,plain,
    ( big_q(sK1)
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f23]) ).

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

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

fof(f38,plain,
    ( $false
    | ~ spl2_3
    | ~ spl2_4 ),
    inference(subsumption_resolution,[],[f35,f29]) ).

fof(f35,plain,
    ( big_q(sK0)
    | ~ spl2_4 ),
    inference(avatar_component_clause,[],[f33]) ).

fof(f33,plain,
    ( spl2_4
  <=> big_q(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).

fof(f36,plain,
    ( spl2_4
    | spl2_2 ),
    inference(avatar_split_clause,[],[f13,f23,f33]) ).

fof(f13,plain,
    ( big_q(sK1)
    | big_q(sK0) ),
    inference(cnf_transformation,[],[f10]) ).

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

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

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

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

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

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

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

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

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

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

fof(f31,plain,
    spl2_1,
    inference(avatar_split_clause,[],[f16,f19]) ).

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

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

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

fof(f30,plain,
    ( spl2_3
    | spl2_3
    | ~ spl2_1 ),
    inference(avatar_split_clause,[],[f17,f19,f28,f28]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ~ p
      | ~ big_q(X1)
      | ~ big_q(X0) ),
    inference(duplicate_literal_removal,[],[f15]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN358+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/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.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 21:45:10 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.51  % (21929)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51  % (21937)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.51  % (21929)First to succeed.
% 0.20/0.52  % (21929)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Theorem for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (21929)------------------------------
% 0.20/0.52  % (21929)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (21929)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (21929)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (21929)Memory used [KB]: 5884
% 0.20/0.52  % (21929)Time elapsed: 0.003 s
% 0.20/0.52  % (21929)Instructions burned: 1 (million)
% 0.20/0.52  % (21929)------------------------------
% 0.20/0.52  % (21929)------------------------------
% 0.20/0.52  % (21925)Success in time 0.155 s
%------------------------------------------------------------------------------