%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN964+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 : 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 : Sun May  5 12:07:59 EDT 2024

% Result   : Theorem 0.58s 0.75s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    9 (   3 unt;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   5   ~;   0   |;   3   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   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   :   11 (   4   !;   7   ?)

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

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

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

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

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

fof(f3,plain,
    ( ! [X1] : ~ p(X1)
    & ? [X0] : 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/tmp/tmp.OIPfcN5rHT/Vampire---4.8_11111',prove_this) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYN964+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/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 : n012.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   : Fri May  3 17:49:23 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a FOF_THM_EPR_NEQ 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.OIPfcN5rHT/Vampire---4.8_11111
% 0.58/0.74  % (11451)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 (2996ds/56Mi)
% 0.58/0.75  % (11451)First to succeed.
% 0.58/0.75  % (11451)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11291"
% 0.58/0.75  % (11444)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.58/0.75  % (11446)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.58/0.75  % (11447)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.58/0.75  % (11448)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.58/0.75  % (11451)Refutation found. Thanks to Tanya!
% 0.58/0.75  % SZS status Theorem for Vampire---4
% 0.58/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75  % (11451)------------------------------
% 0.58/0.75  % (11451)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75  % (11451)Termination reason: Refutation
% 0.58/0.75  
% 0.58/0.75  % (11451)Memory used [KB]: 953
% 0.58/0.75  % (11451)Time elapsed: 0.002 s
% 0.58/0.75  % (11451)Instructions burned: 2 (million)
% 0.58/0.75  % (11291)Success in time 0.384 s
% 0.58/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------