%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NUM531+1 : TPTP v8.1.0. Released v4.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 : n013.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 18:05:39 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   8 unt;   0 def)
%            Number of atoms       :   43 (   8 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   40 (  16   ~;   7   |;  13   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    9 (   6   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f44,plain,
    $false,
    inference(subsumption_resolution,[],[f43,f30]) ).

fof(f30,plain,
    aSet0(sK0),
    inference(cnf_transformation,[],[f22]) ).

fof(f22,plain,
    ( slcrc0 = sK0
    & isCountable0(sK0)
    & aSet0(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f20,f21]) ).

fof(f21,plain,
    ( ? [X0] :
        ( slcrc0 = X0
        & isCountable0(X0)
        & aSet0(X0) )
   => ( slcrc0 = sK0
      & isCountable0(sK0)
      & aSet0(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f20,plain,
    ? [X0] :
      ( slcrc0 = X0
      & isCountable0(X0)
      & aSet0(X0) ),
    inference(flattening,[],[f19]) ).

fof(f19,plain,
    ? [X0] :
      ( slcrc0 = X0
      & isCountable0(X0)
      & aSet0(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,negated_conjecture,
    ~ ! [X0] :
        ( ( isCountable0(X0)
          & aSet0(X0) )
       => slcrc0 != X0 ),
    inference(negated_conjecture,[],[f9]) ).

fof(f9,conjecture,
    ! [X0] :
      ( ( isCountable0(X0)
        & aSet0(X0) )
     => slcrc0 != X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f43,plain,
    ~ aSet0(sK0),
    inference(subsumption_resolution,[],[f42,f36]) ).

fof(f36,plain,
    isFinite0(sK0),
    inference(definition_unfolding,[],[f29,f32]) ).

fof(f32,plain,
    slcrc0 = sK0,
    inference(cnf_transformation,[],[f22]) ).

fof(f29,plain,
    isFinite0(slcrc0),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,axiom,
    isFinite0(slcrc0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEmpFin) ).

fof(f42,plain,
    ( ~ isFinite0(sK0)
    | ~ aSet0(sK0) ),
    inference(resolution,[],[f28,f31]) ).

fof(f31,plain,
    isCountable0(sK0),
    inference(cnf_transformation,[],[f22]) ).

fof(f28,plain,
    ! [X0] :
      ( ~ isCountable0(X0)
      | ~ isFinite0(X0)
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ! [X0] :
      ( ~ isCountable0(X0)
      | ~ isFinite0(X0)
      | ~ aSet0(X0) ),
    inference(flattening,[],[f17]) ).

fof(f17,plain,
    ! [X0] :
      ( ~ isFinite0(X0)
      | ~ aSet0(X0)
      | ~ isCountable0(X0) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,axiom,
    ! [X0] :
      ( ( aSet0(X0)
        & isCountable0(X0) )
     => ~ isFinite0(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCountNFin) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : NUM531+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/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.33  % Computer : n013.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 06:54:17 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.49  % (19636)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.49  % (19629)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.50  % (19644)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.50  % (19636)First to succeed.
% 0.19/0.50  % (19636)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (19636)------------------------------
% 0.19/0.50  % (19636)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (19636)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (19636)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (19636)Memory used [KB]: 5373
% 0.19/0.50  % (19636)Time elapsed: 0.104 s
% 0.19/0.50  % (19636)Instructions burned: 2 (million)
% 0.19/0.50  % (19636)------------------------------
% 0.19/0.50  % (19636)------------------------------
% 0.19/0.50  % (19623)Success in time 0.157 s
%------------------------------------------------------------------------------