%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM489+3 : TPTP v8.1.2. Released v4.0.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 : n015.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 03:31:33 EDT 2024

% Result   : Theorem 0.54s 0.74s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   11 (   8 unt;   1 typ;   0 def)
%            Number of atoms       :   50 (   8 equ)
%            Maximal formula atoms :    3 (   5 avg)
%            Number of connectives :    7 (   4   ~;   0   |;   2   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   37 (  37 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   1   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   4 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    4 (   3   !;   0   ?;   4   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_8,type,
    sQ13_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f367,plain,
    $false,
    inference(subsumption_resolution,[],[f284,f287]) ).

tff(f287,plain,
    ~ sQ13_eqProxy($i,xn,sdtpldt0(xp,xr)),
    inference(equality_proxy_replacement,[],[f191,f265]) ).

tff(f265,plain,
    ! [X0: $tType,X2: X0,X1: X0] :
      ( sQ13_eqProxy(X0,X1,X2)
    <=> ( X1 = X2 ) ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ13_eqProxy])]) ).

tff(f191,plain,
    xn != sdtpldt0(xp,xr),
    inference(cnf_transformation,[],[f49]) ).

tff(f49,plain,
    xn != sdtpldt0(xp,xr),
    inference(flattening,[],[f46]) ).

tff(f46,negated_conjecture,
    ( ~ xn = sdtpldt0(xp,xr) ),
    inference(negated_conjecture,[],[f45]) ).

tff(f45,conjecture,
    xn = sdtpldt0(xp,xr),
    file('/export/starexec/sandbox2/tmp/tmp.GqCC0e8v57/Vampire---4.8_4699',m__) ).

tff(f284,plain,
    sQ13_eqProxy($i,xn,sdtpldt0(xp,xr)),
    inference(equality_proxy_replacement,[],[f185,f265]) ).

tff(f185,plain,
    xn = sdtpldt0(xp,xr),
    inference(cnf_transformation,[],[f43]) ).

tff(f43,axiom,
    ( ( xr = sdtmndt0(xn,xp) )
    & ( xn = sdtpldt0(xp,xr) )
    & aNaturalNumber0(xr) ),
    file('/export/starexec/sandbox2/tmp/tmp.GqCC0e8v57/Vampire---4.8_4699',m__1883) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : NUM489+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13  % 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.13/0.33  % Computer : n015.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Apr 30 17:17:03 EDT 2024
% 0.13/0.33  % CPUTime    : 
% 0.13/0.33  This is a FOF_THM_RFO_SEQ problem
% 0.13/0.33  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.GqCC0e8v57/Vampire---4.8_4699
% 0.54/0.74  % (4888)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.54/0.74  % (4888)First to succeed.
% 0.54/0.74  % (4890)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.54/0.74  % (4889)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 (2995ds/51Mi)
% 0.54/0.74  % (4888)Refutation found. Thanks to Tanya!
% 0.54/0.74  % SZS status Theorem for Vampire---4
% 0.54/0.74  % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.74  % (4888)------------------------------
% 0.54/0.74  % (4888)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.74  % (4888)Termination reason: Refutation
% 0.54/0.74  
% 0.54/0.74  % (4888)Memory used [KB]: 1156
% 0.54/0.74  % (4888)Time elapsed: 0.004 s
% 0.54/0.74  % (4888)Instructions burned: 8 (million)
% 0.54/0.74  % (4888)------------------------------
% 0.54/0.74  % (4888)------------------------------
% 0.54/0.74  % (4859)Success in time 0.409 s
% 0.54/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------