%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYN956+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n020.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 Apr 30 18:11:14 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f25,plain,
    $false,
    inference(avatar_sat_refutation,[],[f20,f22,f24]) ).

fof(f24,plain,
    ~ spl1_2,
    inference(avatar_contradiction_clause,[],[f23]) ).

fof(f23,plain,
    ( $false
    | ~ spl1_2 ),
    inference(subsumption_resolution,[],[f19,f11]) ).

fof(f11,plain,
    ! [X0] : ~ b(X0),
    inference(cnf_transformation,[],[f8]) ).

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

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

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

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

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

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

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

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

fof(f19,plain,
    ( b(sK0)
    | ~ spl1_2 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f17,plain,
    ( spl1_2
  <=> b(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).

fof(f22,plain,
    spl1_1,
    inference(avatar_contradiction_clause,[],[f21]) ).

fof(f21,plain,
    ( $false
    | spl1_1 ),
    inference(subsumption_resolution,[],[f15,f10]) ).

fof(f10,plain,
    ! [X1] : a(X1),
    inference(cnf_transformation,[],[f8]) ).

fof(f15,plain,
    ( ~ a(sK0)
    | spl1_1 ),
    inference(avatar_component_clause,[],[f13]) ).

fof(f13,plain,
    ( spl1_1
  <=> a(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).

fof(f20,plain,
    ( ~ spl1_1
    | spl1_2 ),
    inference(avatar_split_clause,[],[f9,f17,f13]) ).

fof(f9,plain,
    ( b(sK0)
    | ~ a(sK0) ),
    inference(cnf_transformation,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN956+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n020.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.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Tue Apr 30 01:49:47 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  % (24182)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (24188)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37  % (24188)First to succeed.
% 0.14/0.37  % (24188)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.38  % (24188)------------------------------
% 0.14/0.38  % (24188)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.38  % (24188)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (24188)Memory used [KB]: 729
% 0.14/0.38  % (24188)Time elapsed: 0.003 s
% 0.14/0.38  % (24188)Instructions burned: 2 (million)
% 0.14/0.38  % (24188)------------------------------
% 0.14/0.38  % (24188)------------------------------
% 0.14/0.38  % (24182)Success in time 0.002 s
%------------------------------------------------------------------------------