%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM892_1 : TPTP v8.1.2. Released v5.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 : n031.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:35:07 EDT 2024

% Result   : Theorem 0.61s 0.78s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   29 (   2 unt;   2 typ;   0 def)
%            Number of atoms       :   62 (  10 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   62 (  27   ~;  28   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number arithmetic     :   40 (  26 atm;   0 fun;   0 num;  14 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   3 usr;   4 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   14 (  12   !;   2   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_4,type,
    sK0: $int ).

tff(func_def_5,type,
    sK1: $int ).

tff(f58,plain,
    $false,
    inference(avatar_sat_refutation,[],[f29,f34,f35,f43,f57]) ).

tff(f57,plain,
    ( ~ spl2_1
    | ~ spl2_3 ),
    inference(avatar_contradiction_clause,[],[f56]) ).

tff(f56,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_3 ),
    inference(subsumption_resolution,[],[f51,f9]) ).

tff(f9,plain,
    ! [X0: $int] : ~ $less(X0,X0),
    introduced(theory_axiom_142,[]) ).

tff(f51,plain,
    ( $less(sK0,sK0)
    | ~ spl2_1
    | ~ spl2_3 ),
    inference(superposition,[],[f33,f24]) ).

tff(f24,plain,
    ( ( sK0 = sK1 )
    | ~ spl2_1 ),
    inference(avatar_component_clause,[],[f22]) ).

tff(f22,plain,
    ( spl2_1
  <=> ( sK0 = sK1 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).

tff(f33,plain,
    ( $less(sK1,sK0)
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f31]) ).

tff(f31,plain,
    ( spl2_3
  <=> $less(sK1,sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

tff(f43,plain,
    ( ~ spl2_2
    | ~ spl2_3 ),
    inference(avatar_contradiction_clause,[],[f42]) ).

tff(f42,plain,
    ( $false
    | ~ spl2_2
    | ~ spl2_3 ),
    inference(subsumption_resolution,[],[f37,f33]) ).

tff(f37,plain,
    ( ~ $less(sK1,sK0)
    | ~ spl2_2 ),
    inference(unit_resulting_resolution,[],[f9,f28,f10]) ).

tff(f10,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( ~ $less(X1,X2)
      | ~ $less(X0,X1)
      | $less(X0,X2) ),
    introduced(theory_axiom_143,[]) ).

tff(f28,plain,
    ( $less(sK0,sK1)
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f26]) ).

tff(f26,plain,
    ( spl2_2
  <=> $less(sK0,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).

tff(f35,plain,
    ( spl2_3
    | ~ spl2_2 ),
    inference(avatar_split_clause,[],[f17,f26,f31]) ).

tff(f17,plain,
    ( ~ $less(sK0,sK1)
    | $less(sK1,sK0) ),
    inference(cnf_transformation,[],[f16]) ).

tff(f16,plain,
    ? [X0: $int,X1: $int] :
      ( ~ $less(X1,X0)
    <~> ( ( X0 = X1 )
        | $less(X0,X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,plain,
    ~ ! [X0: $int,X1: $int] :
        ( ~ $less(X1,X0)
      <=> ( ( X0 = X1 )
          | $less(X0,X1) ) ),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ! [X0: $int,X1: $int] :
        ( $lesseq(X0,X1)
      <=> ( ( X0 = X1 )
          | $less(X0,X1) ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ! [X0: $int,X1: $int] :
      ( $lesseq(X0,X1)
    <=> ( ( X0 = X1 )
        | $less(X0,X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.BCtIRZUf0t/Vampire---4.8_8409',less_lesseq) ).

tff(f34,plain,
    ( spl2_3
    | ~ spl2_1 ),
    inference(avatar_split_clause,[],[f18,f22,f31]) ).

tff(f18,plain,
    ( ( sK0 != sK1 )
    | $less(sK1,sK0) ),
    inference(cnf_transformation,[],[f16]) ).

tff(f29,plain,
    ( spl2_1
    | spl2_2 ),
    inference(avatar_split_clause,[],[f20,f26,f22]) ).

tff(f20,plain,
    ( $less(sK0,sK1)
    | ( sK0 = sK1 ) ),
    inference(subsumption_resolution,[],[f19,f11]) ).

tff(f11,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X0,X1)
      | $less(X1,X0)
      | ( X0 = X1 ) ),
    introduced(theory_axiom_144,[]) ).

tff(f19,plain,
    ( $less(sK0,sK1)
    | ( sK0 = sK1 )
    | ~ $less(sK1,sK0) ),
    inference(cnf_transformation,[],[f16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : NUM892_1 : TPTP v8.1.2. Released v5.0.0.
% 0.05/0.11  % 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.11/0.31  % Computer : n031.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 300
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Tue Apr 30 17:28:44 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.11/0.32  This is a TF0_THM_EQU_ARI problem
% 0.11/0.32  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.BCtIRZUf0t/Vampire---4.8_8409
% 0.61/0.77  % (8523)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.77  % (8520)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.61/0.77  % (8521)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.77  % (8518)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.61/0.77  % (8522)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.61/0.77  % (8519)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.61/0.77  % (8524)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 (2995ds/83Mi)
% 0.61/0.77  % (8525)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.61/0.77  % (8525)Refutation not found, incomplete strategy% (8525)------------------------------
% 0.61/0.77  % (8525)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77  % (8525)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77  
% 0.61/0.77  % (8525)Memory used [KB]: 968
% 0.61/0.77  % (8525)Time elapsed: 0.002 s
% 0.61/0.77  % (8525)Instructions burned: 2 (million)
% 0.61/0.77  % (8525)------------------------------
% 0.61/0.77  % (8525)------------------------------
% 0.61/0.77  % (8523)Refutation not found, incomplete strategy% (8523)------------------------------
% 0.61/0.77  % (8523)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77  % (8523)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77  
% 0.61/0.77  % (8523)Memory used [KB]: 977
% 0.61/0.77  % (8523)Time elapsed: 0.003 s
% 0.61/0.77  % (8523)Instructions burned: 2 (million)
% 0.61/0.77  % (8523)------------------------------
% 0.61/0.77  % (8523)------------------------------
% 0.61/0.78  % (8524)First to succeed.
% 0.61/0.78  % (8521)Also succeeded, but the first one will report.
% 0.61/0.78  % (8524)Refutation found. Thanks to Tanya!
% 0.61/0.78  % SZS status Theorem for Vampire---4
% 0.61/0.78  % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.78  % (8524)------------------------------
% 0.61/0.78  % (8524)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.78  % (8524)Termination reason: Refutation
% 0.61/0.78  
% 0.61/0.78  % (8524)Memory used [KB]: 989
% 0.61/0.78  % (8524)Time elapsed: 0.004 s
% 0.61/0.78  % (8524)Instructions burned: 3 (million)
% 0.61/0.78  % (8524)------------------------------
% 0.61/0.78  % (8524)------------------------------
% 0.61/0.78  % (8516)Success in time 0.455 s
% 0.61/0.78  % Vampire---4.8 exiting
%------------------------------------------------------------------------------