%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN978+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n008.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:08 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f23,plain,
    $false,
    inference(avatar_sat_refutation,[],[f19,f21,f22]) ).

fof(f22,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f7,f12]) ).

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

fof(f7,plain,
    a,
    inference(cnf_transformation,[],[f6]) ).

fof(f6,plain,
    ( ( ~ b
      | ~ a )
    & ( b
      | a )
    & b
    & a ),
    inference(flattening,[],[f5]) ).

fof(f5,plain,
    ( ( ~ b
      | ~ a )
    & ( b
      | a )
    & b
    & a ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,plain,
    ( ( a
    <~> b )
    & b
    & a ),
    inference(flattening,[],[f3]) ).

fof(f3,plain,
    ( ( a
    <~> b )
    & b
    & a ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( b
        & a )
     => ( a
      <=> b ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( b
      & a )
   => ( a
    <=> b ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pzCQKspUQy/Vampire---4.8_19736',prove_this) ).

fof(f21,plain,
    spl0_2,
    inference(avatar_split_clause,[],[f8,f16]) ).

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

fof(f8,plain,
    b,
    inference(cnf_transformation,[],[f6]) ).

fof(f19,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f10,f16,f12]) ).

fof(f10,plain,
    ( ~ b
    | ~ a ),
    inference(cnf_transformation,[],[f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SYN978+1 : TPTP v8.1.2. Released v3.1.0.
% 0.04/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35  % Computer : n008.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Apr 30 17:26:58 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a FOF_THM_PRP problem
% 0.15/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.pzCQKspUQy/Vampire---4.8_19736
% 0.62/0.79  % (19969)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 (2995ds/34Mi)
% 0.62/0.79  % (19972)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.62/0.79  % (19969)First to succeed.
% 0.62/0.79  % (19972)Also succeeded, but the first one will report.
% 0.62/0.79  % (19965)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 (2995ds/34Mi)
% 0.62/0.80  % (19969)Refutation found. Thanks to Tanya!
% 0.62/0.80  % SZS status Theorem for Vampire---4
% 0.62/0.80  % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.80  % (19969)------------------------------
% 0.62/0.80  % (19969)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.80  % (19969)Termination reason: Refutation
% 0.62/0.80  
% 0.62/0.80  % (19969)Memory used [KB]: 954
% 0.62/0.80  % (19969)Time elapsed: 0.002 s
% 0.62/0.80  % (19969)Instructions burned: 2 (million)
% 0.62/0.80  % (19969)------------------------------
% 0.62/0.80  % (19969)------------------------------
% 0.62/0.80  % (19901)Success in time 0.434 s
% 0.62/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------