%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN396+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 : 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:37:47 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f20,plain,
    $false,
    inference(subsumption_resolution,[],[f19,f16]) ).

fof(f16,plain,
    ! [X0] : f(X0),
    inference(factoring,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( f(X0)
      | f(X1) ),
    inference(literal_reordering,[],[f11]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( f(X0)
      | f(X1) ),
    inference(cnf_transformation,[],[f9]) ).

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

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

fof(f8,plain,
    ( ? [X3] : ~ f(X3)
   => ~ f(sK1) ),
    introduced(choice_axiom,[]) ).

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

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

fof(f4,plain,
    ( ? [X1] : ~ f(X1)
  <~> ? [X0] : ~ f(X0) ),
    inference(ennf_transformation,[],[f3]) ).

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

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

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

fof(f19,plain,
    ~ f(sK0),
    inference(subsumption_resolution,[],[f12,f16]) ).

fof(f12,plain,
    ( ~ f(sK1)
    | ~ f(sK0) ),
    inference(literal_reordering,[],[f10]) ).

fof(f10,plain,
    ( ~ f(sK1)
    | ~ f(sK0) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : SYN396+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.32  % Computer : n005.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Aug 30 21:51:03 EDT 2022
% 0.11/0.32  % CPUTime    : 
% 0.16/0.46  % (26962)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.16/0.47  % (26954)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.16/0.47  % (26962)First to succeed.
% 0.16/0.48  % (26971)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.16/0.48  % (26970)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.16/0.48  % (26971)Also succeeded, but the first one will report.
% 0.16/0.48  % (26962)Refutation found. Thanks to Tanya!
% 0.16/0.48  % SZS status Theorem for theBenchmark
% 0.16/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48  % (26962)------------------------------
% 0.16/0.48  % (26962)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.48  % (26962)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.48  % (26962)Termination reason: Refutation
% 0.16/0.48  
% 0.16/0.48  % (26962)Memory used [KB]: 5628
% 0.16/0.48  % (26962)Time elapsed: 0.006 s
% 0.16/0.48  % (26962)Instructions burned: 3 (million)
% 0.16/0.48  % (26962)------------------------------
% 0.16/0.48  % (26962)------------------------------
% 0.16/0.48  % (26947)Success in time 0.159 s
%------------------------------------------------------------------------------