%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN951+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n021.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 May  1 04:45:04 EDT 2024

% Result   : Theorem 0.55s 0.75s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (   3 unt;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   76 (  27   ~;  24   |;  11   &)
%                                         (   3 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   7 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   16 (   7   !;   9   ?)

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

fof(f29,plain,
    ~ spl1_3,
    inference(avatar_contradiction_clause,[],[f26]) ).

fof(f26,plain,
    ( $false
    | ~ spl1_3 ),
    inference(unit_resulting_resolution,[],[f10,f21]) ).

fof(f21,plain,
    ( ! [X1] : ~ p(X1)
    | ~ spl1_3 ),
    inference(avatar_component_clause,[],[f20]) ).

fof(f20,plain,
    ( spl1_3
  <=> ! [X1] : ~ p(X1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).

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

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

fof(f4,plain,
    ~ ( ? [X0] : p(X0)
     => ( ( q
         => q )
        & ( ~ b
          | b )
        & ? [X1] : p(X1) ) ),
    inference(pure_predicate_removal,[],[f3]) ).

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

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

fof(f1,conjecture,
    ( ? [X0] : p(X0)
   => ( ( a
       => ( ( q
           => q )
          & ( ~ b
            | b ) ) )
      & ? [X0] : p(X0) ) ),
    file('/export/starexec/sandbox/tmp/tmp.xtnZipbM7g/Vampire---4.8_2578',prove_this) ).

fof(f25,plain,
    ( spl1_1
    | spl1_2
    | spl1_3 ),
    inference(avatar_split_clause,[],[f6,f20,f16,f12]) ).

fof(f12,plain,
    ( spl1_1
  <=> q ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).

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

fof(f6,plain,
    ! [X1] :
      ( ~ p(X1)
      | b
      | q ),
    inference(cnf_transformation,[],[f5]) ).

fof(f24,plain,
    ( ~ spl1_1
    | spl1_2
    | spl1_3 ),
    inference(avatar_split_clause,[],[f7,f20,f16,f12]) ).

fof(f7,plain,
    ! [X1] :
      ( ~ p(X1)
      | b
      | ~ q ),
    inference(cnf_transformation,[],[f5]) ).

fof(f23,plain,
    ( spl1_1
    | ~ spl1_2
    | spl1_3 ),
    inference(avatar_split_clause,[],[f8,f20,f16,f12]) ).

fof(f8,plain,
    ! [X1] :
      ( ~ p(X1)
      | ~ b
      | q ),
    inference(cnf_transformation,[],[f5]) ).

fof(f22,plain,
    ( ~ spl1_1
    | ~ spl1_2
    | spl1_3 ),
    inference(avatar_split_clause,[],[f9,f20,f16,f12]) ).

fof(f9,plain,
    ! [X1] :
      ( ~ p(X1)
      | ~ b
      | ~ q ),
    inference(cnf_transformation,[],[f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYN951+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.15  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36  % Computer : n021.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % 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 17:26:11 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a FOF_THM_EPR_NEQ problem
% 0.14/0.37  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.xtnZipbM7g/Vampire---4.8_2578
% 0.55/0.74  % (2836)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.55/0.75  % (2836)First to succeed.
% 0.55/0.75  % (2830)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.55/0.75  % (2831)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.55/0.75  % (2833)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.55/0.75  % (2832)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.55/0.75  % (2834)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.55/0.75  % (2835)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.55/0.75  % (2830)Also succeeded, but the first one will report.
% 0.55/0.75  % (2836)Refutation found. Thanks to Tanya!
% 0.55/0.75  % SZS status Theorem for Vampire---4
% 0.55/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.75  % (2836)------------------------------
% 0.55/0.75  % (2836)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.75  % (2836)Termination reason: Refutation
% 0.55/0.75  
% 0.55/0.75  % (2836)Memory used [KB]: 966
% 0.55/0.75  % (2836)Time elapsed: 0.003 s
% 0.55/0.75  % (2836)Instructions burned: 2 (million)
% 0.55/0.75  % (2836)------------------------------
% 0.55/0.75  % (2836)------------------------------
% 0.55/0.75  % (2826)Success in time 0.374 s
% 0.55/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------