%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN405+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_sat --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:37:48 EDT 2022

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

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

fof(f7,plain,
    ! [X0] : f(X0),
    inference(cnf_transformation,[],[f4]) ).

fof(f4,plain,
    ( ! [X0] : f(X0)
    & ! [X2] :
        ( ~ g(X2)
        | ~ f(X2) )
    & ? [X1] : g(X1) ),
    inference(flattening,[],[f3]) ).

fof(f3,plain,
    ( ! [X2] :
        ( ~ g(X2)
        | ~ f(X2) )
    & ? [X1] : g(X1)
    & ! [X0] : f(X0) ),
    inference(ennf_transformation,[],[f2]) ).

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

fof(f1,conjecture,
    ( ( ? [X1] : g(X1)
      & ! [X0] : f(X0) )
   => ? [X2] :
        ( g(X2)
        & f(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish239) ).

fof(f8,plain,
    ~ f(sK0),
    inference(resolution,[],[f5,f6]) ).

fof(f6,plain,
    g(sK0),
    inference(cnf_transformation,[],[f4]) ).

fof(f5,plain,
    ! [X2] :
      ( ~ g(X2)
      | ~ f(X2) ),
    inference(cnf_transformation,[],[f4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SYN405+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.33  % Computer : n019.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 21:55:20 EDT 2022
% 0.13/0.33  % CPUTime    : 
% 0.20/0.49  % (17507)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.50  % (17517)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.50  % (17517)First to succeed.
% 0.20/0.50  % (17518)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.20/0.50  % (17514)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.50  % (17522)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.20/0.50  % (17522)Also succeeded, but the first one will report.
% 0.20/0.51  % (17517)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Theorem for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (17517)------------------------------
% 0.20/0.51  % (17517)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (17517)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (17517)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (17517)Memory used [KB]: 5373
% 0.20/0.51  % (17517)Time elapsed: 0.119 s
% 0.20/0.51  % (17517)------------------------------
% 0.20/0.51  % (17517)------------------------------
% 0.20/0.51  % (17505)Success in time 0.165 s
%------------------------------------------------------------------------------