%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN950+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 : n024.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:10 EDT 2022

% Result   : Theorem 0.21s 0.56s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   3 unt;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :   65 (  21   ~;  13   |;  18   &)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   31 (  22   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f16,plain,
    $false,
    inference(subsumption_resolution,[],[f15,f13]) ).

fof(f13,plain,
    ! [X2] : p(X2),
    inference(subsumption_resolution,[],[f12,f11]) ).

fof(f11,plain,
    ! [X3] :
      ( q(X3)
      | p(X3) ),
    inference(cnf_transformation,[],[f7]) ).

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

fof(f6,plain,
    ( ? [X0,X1] :
        ( ! [X2] :
            ( ~ q(X2)
            | p(X2) )
        & ! [X3] :
            ( ( q(X3)
              & ~ p(X1) )
            | ( p(X3)
              & ~ p(X0) ) ) )
   => ( ! [X2] :
          ( ~ q(X2)
          | p(X2) )
      & ! [X3] :
          ( ( q(X3)
            & ~ p(sK1) )
          | ( p(X3)
            & ~ p(sK0) ) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

fof(f12,plain,
    ! [X2] :
      ( ~ q(X2)
      | p(X2) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f15,plain,
    ~ p(sK0),
    inference(resolution,[],[f13,f8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYN950+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35  % Computer : n024.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 22:34:34 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.54  % (30665)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.56  % (30665)First to succeed.
% 0.21/0.56  % (30666)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.56  % (30665)Refutation found. Thanks to Tanya!
% 0.21/0.56  % SZS status Theorem for theBenchmark
% 0.21/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.56  % (30665)------------------------------
% 0.21/0.56  % (30665)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56  % (30665)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56  % (30665)Termination reason: Refutation
% 0.21/0.56  
% 0.21/0.56  % (30665)Memory used [KB]: 1407
% 0.21/0.56  % (30665)Time elapsed: 0.127 s
% 0.21/0.56  % (30665)Instructions burned: 2 (million)
% 0.21/0.56  % (30665)------------------------------
% 0.21/0.56  % (30665)------------------------------
% 0.21/0.56  % (30659)Success in time 0.203 s
%------------------------------------------------------------------------------