%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYN925+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -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 : Tue May 21 08:43:43 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f8,plain,
    $false,
    inference(resolution,[],[f7,f6]) ).

fof(f6,plain,
    ! [X0] : p(X0),
    inference(cnf_transformation,[],[f5]) ).

fof(f5,plain,
    ! [X0] :
      ( ~ p(sK0)
      & p(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f3,f4]) ).

fof(f4,plain,
    ( ? [X1] : ~ p(X1)
   => ~ p(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f3,plain,
    ! [X0] :
      ( ? [X1] : ~ p(X1)
      & p(X0) ),
    inference(ennf_transformation,[],[f2]) ).

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

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

fof(f7,plain,
    ~ p(sK0),
    inference(cnf_transformation,[],[f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SYN925+1 : TPTP v8.2.0. Released v3.1.0.
% 0.10/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n012.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   : Mon May 20 14:27:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  % (10234)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (10242)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.14/0.37  % (10242)First to succeed.
% 0.14/0.37  % (10242)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-10234"
% 0.14/0.37  % (10242)Refutation found. Thanks to Tanya!
% 0.14/0.37  % SZS status Theorem for theBenchmark
% 0.14/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37  % (10242)------------------------------
% 0.14/0.37  % (10242)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.37  % (10242)Termination reason: Refutation
% 0.14/0.37  
% 0.14/0.37  % (10242)Memory used [KB]: 729
% 0.14/0.37  % (10242)Time elapsed: 0.002 s
% 0.14/0.37  % (10242)Instructions burned: 2 (million)
% 0.14/0.37  % (10234)Success in time 0.014 s
%------------------------------------------------------------------------------