%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN407+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 : n007.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:49 EDT 2022

% Result   : Theorem 0.19s 0.49s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   4 unt;   0 def)
%            Number of atoms       :   64 (   0 equ)
%            Maximal formula atoms :    7 (   4 avg)
%            Number of connectives :   75 (  26   ~;  22   |;  17   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   24 (  17   !;   7   ?)

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

fof(f11,plain,
    f(sK0),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ( ! [X0] :
        ( ~ f(X0)
        | ~ h(X0) )
    & f(sK0)
    & ~ g(sK0)
    & ! [X2] :
        ( h(X2)
        | ~ f(X2)
        | g(X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).

fof(f7,plain,
    ( ? [X1] :
        ( f(X1)
        & ~ g(X1) )
   => ( f(sK0)
      & ~ g(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ! [X0] :
        ( ~ f(X0)
        | ~ h(X0) )
    & ? [X1] :
        ( f(X1)
        & ~ g(X1) )
    & ! [X2] :
        ( h(X2)
        | ~ f(X2)
        | g(X2) ) ),
    inference(rectify,[],[f5]) ).

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

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

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

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

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

fof(f14,plain,
    ~ f(sK0),
    inference(resolution,[],[f13,f10]) ).

fof(f10,plain,
    ~ g(sK0),
    inference(cnf_transformation,[],[f8]) ).

fof(f13,plain,
    ! [X2] :
      ( g(X2)
      | ~ f(X2) ),
    inference(subsumption_resolution,[],[f9,f12]) ).

fof(f12,plain,
    ! [X0] :
      ( ~ h(X0)
      | ~ f(X0) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f9,plain,
    ! [X2] :
      ( h(X2)
      | ~ f(X2)
      | g(X2) ),
    inference(cnf_transformation,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN407+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_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n007.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 21:37:01 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.47  % (32421)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.19/0.49  % (32413)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.19/0.49  % (32421)First to succeed.
% 0.19/0.49  % (32421)Refutation found. Thanks to Tanya!
% 0.19/0.49  % SZS status Theorem for theBenchmark
% 0.19/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49  % (32421)------------------------------
% 0.19/0.49  % (32421)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (32421)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (32421)Termination reason: Refutation
% 0.19/0.49  
% 0.19/0.49  % (32421)Memory used [KB]: 5373
% 0.19/0.49  % (32421)Time elapsed: 0.088 s
% 0.19/0.49  % (32421)Instructions burned: 2 (million)
% 0.19/0.49  % (32421)------------------------------
% 0.19/0.49  % (32421)------------------------------
% 0.19/0.49  % (32404)Success in time 0.145 s
%------------------------------------------------------------------------------