%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYN924+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 : n027.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 : Sun May  5 12:18:25 EDT 2024

% Result   : Theorem 0.15s 0.36s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   2 unt;   0 def)
%            Number of atoms       :   71 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   75 (  22   ~;  34   |;  12   &)
%                                         (   3 <=>;   3  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   40 (  16   !;  24   ?)

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

fof(f13,plain,
    ! [X2,X1] :
      ( ~ p(X1)
      | ~ p(X2) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,plain,
    ( ( ( ! [X0] : ~ q(X0)
        & ! [X1] : ~ p(X1) )
      | ! [X2] :
          ( ~ q(X2)
          & ~ p(X2) ) )
    & ( q(sK0)
      | p(sK1)
      | q(sK2)
      | p(sK2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).

fof(f8,plain,
    ( ? [X3] : q(X3)
   => q(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ? [X4] : p(X4)
   => p(sK1) ),
    introduced(choice_axiom,[]) ).

fof(f10,plain,
    ( ? [X5] :
        ( q(X5)
        | p(X5) )
   => ( q(sK2)
      | p(sK2) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

fof(f2,negated_conjecture,
    ~ ( ? [X0] :
          ( q(X0)
          | p(X0) )
    <=> ( ? [X0] : q(X0)
        | ? [X0] : p(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

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

fof(f19,plain,
    p(sK2),
    inference(subsumption_resolution,[],[f18,f16]) ).

fof(f16,plain,
    ! [X2,X0] :
      ( ~ q(X0)
      | ~ q(X2) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f18,plain,
    ( q(sK2)
    | p(sK2) ),
    inference(subsumption_resolution,[],[f17,f13]) ).

fof(f17,plain,
    ( p(sK1)
    | q(sK2)
    | p(sK2) ),
    inference(subsumption_resolution,[],[f12,f16]) ).

fof(f12,plain,
    ( q(sK0)
    | p(sK1)
    | q(sK2)
    | p(sK2) ),
    inference(cnf_transformation,[],[f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN924+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.15/0.34  % Computer : n027.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Fri May  3 17:12:38 EDT 2024
% 0.15/0.34  % CPUTime    : 
% 0.15/0.35  % (21287)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.36  % (21292)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.36  % (21292)First to succeed.
% 0.15/0.36  % (21292)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21287"
% 0.15/0.36  % (21292)Refutation found. Thanks to Tanya!
% 0.15/0.36  % SZS status Theorem for theBenchmark
% 0.15/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.36  % (21292)------------------------------
% 0.15/0.36  % (21292)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.36  % (21292)Termination reason: Refutation
% 0.15/0.36  
% 0.15/0.36  % (21292)Memory used [KB]: 740
% 0.15/0.36  % (21292)Time elapsed: 0.002 s
% 0.15/0.36  % (21292)Instructions burned: 2 (million)
% 0.15/0.36  % (21287)Success in time 0.014 s
%------------------------------------------------------------------------------