%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN927+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 : n005.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:07 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   3 unt;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   13 (   6   ~;   0   |;   4   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   11 (   9   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,plain,
    $false,
    inference(resolution,[],[f7,f6]) ).

fof(f6,plain,
    ! [X1] : p(X1),
    inference(cnf_transformation,[],[f5]) ).

fof(f5,plain,
    ( ~ p(sK0)
    & ! [X1] : p(X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f3,f4]) ).

fof(f4,plain,
    ( ? [X0] :
        ( ~ p(X0)
        & ! [X1] : p(X1) )
   => ( ~ p(sK0)
      & ! [X1] : p(X1) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f7,plain,
    ~ p(sK0),
    inference(cnf_transformation,[],[f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN927+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/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.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 22:31:33 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.51  % (21355)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52  % (21355)First to succeed.
% 0.20/0.52  % (21355)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  % (21355)------------------------------
% 0.20/0.52  % (21355)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (21355)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (21355)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (21355)Memory used [KB]: 5884
% 0.20/0.52  % (21355)Time elapsed: 0.108 s
% 0.20/0.52  % (21355)------------------------------
% 0.20/0.52  % (21355)------------------------------
% 0.20/0.52  % (21353)Success in time 0.166 s
%------------------------------------------------------------------------------