%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN336+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_uns --cores 0 -t %d %s

% Computer : n015.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:26:16 EDT 2022

% Result   : Theorem 0.21s 0.55s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   3 unt;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :   10 (   4 avg)
%            Number of connectives :   52 (  10   ~;   0   |;  28   &)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   35 (  21   !;  14   ?)

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

fof(f10,plain,
    ! [X2] : big_f(X2,sK0),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ! [X1,X2] :
      ( big_f(X1,sK1(X1,X2))
      & big_f(sK0,sK1(X1,X2))
      & ~ big_f(sK1(X1,X2),X1)
      & big_f(X2,sK0)
      & big_f(X2,sK1(X1,X2)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f7,f6]) ).

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

fof(f7,plain,
    ! [X1,X2] :
      ( ? [X3] :
          ( big_f(X1,X3)
          & big_f(sK0,X3)
          & ~ big_f(X3,X1)
          & big_f(X2,sK0)
          & big_f(X2,X3) )
     => ( big_f(X1,sK1(X1,X2))
        & big_f(sK0,sK1(X1,X2))
        & ~ big_f(sK1(X1,X2),X1)
        & big_f(X2,sK0)
        & big_f(X2,sK1(X1,X2)) ) ),
    introduced(choice_axiom,[]) ).

fof(f5,plain,
    ? [X0] :
    ! [X1,X2] :
    ? [X3] :
      ( big_f(X1,X3)
      & big_f(X0,X3)
      & ~ big_f(X3,X1)
      & big_f(X2,X0)
      & big_f(X2,X3) ),
    inference(flattening,[],[f4]) ).

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

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

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

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

fof(f11,plain,
    ! [X2,X1] : ~ big_f(sK1(X1,X2),X1),
    inference(cnf_transformation,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN336+1 : TPTP v8.1.0. Released v2.0.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.14/0.35  % Computer : n015.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 21:56:36 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.54  % (4551)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.54  % (4551)First to succeed.
% 0.21/0.55  % (4551)Refutation found. Thanks to Tanya!
% 0.21/0.55  % SZS status Theorem for theBenchmark
% 0.21/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.55  % (4551)------------------------------
% 0.21/0.55  % (4551)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55  % (4551)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55  % (4551)Termination reason: Refutation
% 0.21/0.55  
% 0.21/0.55  % (4551)Memory used [KB]: 5884
% 0.21/0.55  % (4551)Time elapsed: 0.124 s
% 0.21/0.55  % (4551)Instructions burned: 1 (million)
% 0.21/0.55  % (4551)------------------------------
% 0.21/0.55  % (4551)------------------------------
% 0.21/0.55  % (4536)Success in time 0.19 s
%------------------------------------------------------------------------------