%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN053+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 : n012.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:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f32,plain,
    $false,
    inference(subsumption_resolution,[],[f31,f28]) ).

fof(f28,plain,
    ! [X0] : big_f(X0),
    inference(factoring,[],[f25]) ).

fof(f25,plain,
    ! [X2,X3] :
      ( big_f(X3)
      | big_f(X2) ),
    inference(subsumption_resolution,[],[f23,f24]) ).

fof(f24,plain,
    ~ p,
    inference(duplicate_literal_removal,[],[f18]) ).

fof(f18,plain,
    ( ~ p
    | ~ p ),
    inference(literal_reordering,[],[f12]) ).

fof(f12,plain,
    ( ~ p
    | ~ p ),
    inference(cnf_transformation,[],[f10]) ).

fof(f10,plain,
    ( ( ( ~ big_f(sK0)
        & ~ p )
      | ( ~ big_f(sK1)
        & ~ p ) )
    & ( ! [X2] :
          ( big_f(X2)
          | p )
      | ! [X3] : big_f(X3)
      | p ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).

fof(f8,plain,
    ( ? [X0] :
        ( ~ big_f(X0)
        & ~ p )
   => ( ~ big_f(sK0)
      & ~ p ) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ? [X1] : ~ big_f(X1)
   => ~ big_f(sK1) ),
    introduced(choice_axiom,[]) ).

fof(f7,plain,
    ( ( ? [X0] :
          ( ~ big_f(X0)
          & ~ p )
      | ( ? [X1] : ~ big_f(X1)
        & ~ p ) )
    & ( ! [X2] :
          ( big_f(X2)
          | p )
      | ! [X3] : big_f(X3)
      | p ) ),
    inference(rectify,[],[f6]) ).

fof(f6,plain,
    ( ( ? [X1] :
          ( ~ big_f(X1)
          & ~ p )
      | ( ? [X0] : ~ big_f(X0)
        & ~ p ) )
    & ( ! [X1] :
          ( big_f(X1)
          | p )
      | ! [X0] : big_f(X0)
      | p ) ),
    inference(flattening,[],[f5]) ).

fof(f5,plain,
    ( ( ? [X1] :
          ( ~ big_f(X1)
          & ~ p )
      | ( ? [X0] : ~ big_f(X0)
        & ~ p ) )
    & ( ! [X1] :
          ( big_f(X1)
          | p )
      | ! [X0] : big_f(X0)
      | p ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,plain,
    ( ( ! [X0] : big_f(X0)
      | p )
  <~> ! [X1] :
        ( big_f(X1)
        | p ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ! [X0] : big_f(X0)
        | p )
    <=> ! [X1] :
          ( big_f(X1)
          | p ) ),
    inference(rectify,[],[f2]) ).

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

fof(f1,conjecture,
    ( ( p
      | ! [X1] : big_f(X1) )
  <=> ! [X0] :
        ( p
        | big_f(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel23) ).

fof(f23,plain,
    ! [X2,X3] :
      ( p
      | big_f(X2)
      | big_f(X3) ),
    inference(duplicate_literal_removal,[],[f16]) ).

fof(f16,plain,
    ! [X2,X3] :
      ( p
      | p
      | big_f(X3)
      | big_f(X2) ),
    inference(literal_reordering,[],[f11]) ).

fof(f11,plain,
    ! [X2,X3] :
      ( p
      | p
      | big_f(X2)
      | big_f(X3) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f31,plain,
    ~ big_f(sK0),
    inference(subsumption_resolution,[],[f17,f28]) ).

fof(f17,plain,
    ( ~ big_f(sK1)
    | ~ big_f(sK0) ),
    inference(literal_reordering,[],[f15]) ).

fof(f15,plain,
    ( ~ big_f(sK0)
    | ~ big_f(sK1) ),
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : SYN053+1 : TPTP v8.1.0. Released v2.0.0.
% 0.02/0.10  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.30  % Computer : n012.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Tue Aug 30 21:24:05 EDT 2022
% 0.10/0.30  % CPUTime    : 
% 0.15/0.44  % (26900)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.15/0.45  % (26917)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.15/0.45  % (26908)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.15/0.45  % (26908)First to succeed.
% 0.15/0.45  % (26909)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.15/0.46  % (26901)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.15/0.46  % (26917)Also succeeded, but the first one will report.
% 0.15/0.46  % (26908)Refutation found. Thanks to Tanya!
% 0.15/0.46  % SZS status Theorem for theBenchmark
% 0.15/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.46  % (26908)------------------------------
% 0.15/0.46  % (26908)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.46  % (26908)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.46  % (26908)Termination reason: Refutation
% 0.15/0.46  
% 0.15/0.46  % (26908)Memory used [KB]: 5628
% 0.15/0.46  % (26908)Time elapsed: 0.004 s
% 0.15/0.46  % (26908)Instructions burned: 3 (million)
% 0.15/0.46  % (26908)------------------------------
% 0.15/0.46  % (26908)------------------------------
% 0.15/0.46  % (26893)Success in time 0.151 s
%------------------------------------------------------------------------------