%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN940+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 : n019.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:09 EDT 2022

% Result   : Theorem 0.16s 0.48s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   33 (   3 unt;   0 def)
%            Number of atoms       :   92 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   98 (  39   ~;  32   |;  12   &)
%                                         (   6 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   7 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   35 (  27   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f51,plain,
    $false,
    inference(avatar_sat_refutation,[],[f20,f24,f31,f33,f44,f48,f50]) ).

fof(f50,plain,
    ( spl2_2
    | ~ spl2_4 ),
    inference(avatar_contradiction_clause,[],[f49]) ).

fof(f49,plain,
    ( $false
    | spl2_2
    | ~ spl2_4 ),
    inference(subsumption_resolution,[],[f16,f23]) ).

fof(f23,plain,
    ( ! [X3] : r(X3)
    | ~ spl2_4 ),
    inference(avatar_component_clause,[],[f22]) ).

fof(f22,plain,
    ( spl2_4
  <=> ! [X3] : r(X3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).

fof(f16,plain,
    ( ~ r(sK0)
    | spl2_2 ),
    inference(avatar_component_clause,[],[f14]) ).

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

fof(f48,plain,
    ( spl2_1
    | ~ spl2_4 ),
    inference(avatar_contradiction_clause,[],[f46]) ).

fof(f46,plain,
    ( $false
    | spl2_1
    | ~ spl2_4 ),
    inference(resolution,[],[f23,f12]) ).

fof(f12,plain,
    ( ~ r(sK1)
    | spl2_1 ),
    inference(avatar_component_clause,[],[f10]) ).

fof(f10,plain,
    ( spl2_1
  <=> r(sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).

fof(f44,plain,
    ( ~ spl2_3
    | ~ spl2_6 ),
    inference(avatar_contradiction_clause,[],[f43]) ).

fof(f43,plain,
    ( $false
    | ~ spl2_3
    | ~ spl2_6 ),
    inference(subsumption_resolution,[],[f34,f30]) ).

fof(f30,plain,
    ( ! [X3] : p(f(X3))
    | ~ spl2_6 ),
    inference(avatar_component_clause,[],[f29]) ).

fof(f29,plain,
    ( spl2_6
  <=> ! [X3] : p(f(X3)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_6])]) ).

fof(f34,plain,
    ( ! [X0] : ~ p(f(X0))
    | ~ spl2_3 ),
    inference(unit_resulting_resolution,[],[f8,f19]) ).

fof(f19,plain,
    ( ! [X4] :
        ( ~ p(X4)
        | ~ q(X4) )
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f18]) ).

fof(f18,plain,
    ( spl2_3
  <=> ! [X4] :
        ( ~ q(X4)
        | ~ p(X4) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

fof(f8,plain,
    ! [X2] : q(f(X2)),
    inference(cnf_transformation,[],[f4]) ).

fof(f4,plain,
    ? [X1,X0] :
      ( ! [X3,X4] :
          ( ~ q(X4)
          | ( p(f(X3))
            & ( ~ p(X4)
              | ( r(X3)
                & ( ~ r(X1)
                  | ~ r(X0) ) ) ) ) )
      & ! [X2] : q(f(X2)) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ! [X1,X0] :
        ( ! [X2] : q(f(X2))
       => ? [X4,X3] :
            ( q(X4)
            & ( p(f(X3))
             => ( ( r(X3)
                 => ( r(X1)
                    & r(X0) ) )
                & p(X4) ) ) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ! [X1,X0] :
        ( ! [X2] : q(f(X2))
       => ? [X4,X3] :
            ( q(X3)
            & ( p(f(X4))
             => ( ( r(X4)
                 => ( r(X1)
                    & r(X0) ) )
                & p(X3) ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ! [X1,X0] :
      ( ! [X2] : q(f(X2))
     => ? [X4,X3] :
          ( q(X3)
          & ( p(f(X4))
           => ( ( r(X4)
               => ( r(X1)
                  & r(X0) ) )
              & p(X3) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f33,plain,
    ~ spl2_5,
    inference(avatar_contradiction_clause,[],[f32]) ).

fof(f32,plain,
    ( $false
    | ~ spl2_5 ),
    inference(subsumption_resolution,[],[f8,f27]) ).

fof(f27,plain,
    ( ! [X4] : ~ q(X4)
    | ~ spl2_5 ),
    inference(avatar_component_clause,[],[f26]) ).

fof(f26,plain,
    ( spl2_5
  <=> ! [X4] : ~ q(X4) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).

fof(f31,plain,
    ( spl2_5
    | spl2_6 ),
    inference(avatar_split_clause,[],[f7,f29,f26]) ).

fof(f7,plain,
    ! [X3,X4] :
      ( p(f(X3))
      | ~ q(X4) ),
    inference(cnf_transformation,[],[f4]) ).

fof(f24,plain,
    ( spl2_3
    | spl2_4 ),
    inference(avatar_split_clause,[],[f6,f22,f18]) ).

fof(f6,plain,
    ! [X3,X4] :
      ( r(X3)
      | ~ q(X4)
      | ~ p(X4) ),
    inference(cnf_transformation,[],[f4]) ).

fof(f20,plain,
    ( ~ spl2_1
    | ~ spl2_2
    | spl2_3 ),
    inference(avatar_split_clause,[],[f5,f18,f14,f10]) ).

fof(f5,plain,
    ! [X4] :
      ( ~ q(X4)
      | ~ r(sK0)
      | ~ p(X4)
      | ~ r(sK1) ),
    inference(cnf_transformation,[],[f4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem    : SYN940+1 : TPTP v8.1.0. Released v3.1.0.
% 0.05/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.11/0.32  % Computer : n019.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Aug 30 23:24:05 EDT 2022
% 0.11/0.32  % CPUTime    : 
% 0.16/0.47  % (24436)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.16/0.47  % (24437)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.16/0.48  % (24446)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.16/0.48  % (24445)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.16/0.48  % (24437)First to succeed.
% 0.16/0.48  % (24437)Refutation found. Thanks to Tanya!
% 0.16/0.48  % SZS status Theorem for theBenchmark
% 0.16/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48  % (24437)------------------------------
% 0.16/0.48  % (24437)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.48  % (24437)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.48  % (24437)Termination reason: Refutation
% 0.16/0.48  
% 0.16/0.48  % (24437)Memory used [KB]: 5884
% 0.16/0.48  % (24437)Time elapsed: 0.094 s
% 0.16/0.48  % (24437)Instructions burned: 1 (million)
% 0.16/0.48  % (24437)------------------------------
% 0.16/0.48  % (24437)------------------------------
% 0.16/0.48  % (24428)Success in time 0.156 s
%------------------------------------------------------------------------------