TSTP Solution File: NUM921_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM921_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 : n016.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:13 EDT 2024

% Result   : Theorem 0.65s 0.81s
% Output   : Refutation 0.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   28 (   7 unt;   2 typ;   0 def)
%            Number of atoms       :   47 (   5 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  17   ~;  15   |;   1   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number arithmetic     :   93 (  25 atm;  30 fun;  18 num;  20 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :    6 (   2 usr;   2 con; 0-2 aty)
%            Number of variables   :   20 (  19   !;   1   ?;  20   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    f: $int > $int ).

tff(func_def_6,type,
    sK0: $int ).

tff(f185,plain,
    $false,
    inference(avatar_sat_refutation,[],[f37,f172,f184]) ).

tff(f184,plain,
    ~ spl1_1,
    inference(avatar_contradiction_clause,[],[f183]) ).

tff(f183,plain,
    ( $false
    | ~ spl1_1 ),
    inference(evaluation,[],[f182]) ).

tff(f182,plain,
    ( $less(0,0)
    | ~ spl1_1 ),
    inference(forward_demodulation,[],[f177,f8]) ).

tff(f8,plain,
    ! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
    introduced(theory_axiom_140,[]) ).

tff(f177,plain,
    ( $less(0,$sum(f(sK0),$uminus(f(sK0))))
    | ~ spl1_1 ),
    inference(superposition,[],[f19,f31]) ).

tff(f31,plain,
    ( ( 0 = $sum(sK0,$uminus(f(sK0))) )
    | ~ spl1_1 ),
    inference(avatar_component_clause,[],[f29]) ).

tff(f29,plain,
    ( spl1_1
  <=> ( 0 = $sum(sK0,$uminus(f(sK0))) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).

tff(f19,plain,
    ! [X0: $int,X1: $int] : $less($sum(X0,X1),$sum(f(X0),X1)),
    inference(unit_resulting_resolution,[],[f17,f12]) ).

tff(f12,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( $less($sum(X0,X2),$sum(X1,X2))
      | ~ $less(X0,X1) ),
    introduced(theory_axiom_145,[]) ).

tff(f17,plain,
    ! [X0: $int] : $less(X0,f(X0)),
    inference(cnf_transformation,[],[f16]) ).

tff(f16,plain,
    ( ? [X1: $int] : ~ $less($sum(X1,$uminus(f(X1))),0)
    & ! [X0: $int] : $less(X0,f(X0)) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,plain,
    ~ ( ! [X0: $int] : $less(X0,f(X0))
     => ! [X1: $int] : $less($sum(X1,$uminus(f(X1))),0) ),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ( ! [X0: $int] : $greater(f(X0),X0)
     => ! [X1: $int] : $less($difference(X1,f(X1)),0) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ( ! [X0: $int] : $greater(f(X0),X0)
   => ! [X1: $int] : $less($difference(X1,f(X1)),0) ),
    file('/export/starexec/sandbox2/tmp/tmp.ypwNpOWYZD/Vampire---4.8_3286',co1) ).

tff(f172,plain,
    ~ spl1_2,
    inference(avatar_contradiction_clause,[],[f171]) ).

tff(f171,plain,
    ( $false
    | ~ spl1_2 ),
    inference(evaluation,[],[f170]) ).

tff(f170,plain,
    ( $less(0,0)
    | ~ spl1_2 ),
    inference(forward_demodulation,[],[f150,f8]) ).

tff(f150,plain,
    ( $less(0,$sum(f(sK0),$uminus(f(sK0))))
    | ~ spl1_2 ),
    inference(unit_resulting_resolution,[],[f35,f19,f10]) ).

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

tff(f35,plain,
    ( $less(0,$sum(sK0,$uminus(f(sK0))))
    | ~ spl1_2 ),
    inference(avatar_component_clause,[],[f33]) ).

tff(f33,plain,
    ( spl1_2
  <=> $less(0,$sum(sK0,$uminus(f(sK0)))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).

tff(f37,plain,
    ( spl1_1
    | spl1_2 ),
    inference(avatar_split_clause,[],[f27,f33,f29]) ).

tff(f27,plain,
    ( $less(0,$sum(sK0,$uminus(f(sK0))))
    | ( 0 = $sum(sK0,$uminus(f(sK0))) ) ),
    inference(resolution,[],[f18,f11]) ).

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

tff(f18,plain,
    ~ $less($sum(sK0,$uminus(f(sK0))),0),
    inference(cnf_transformation,[],[f16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : NUM921_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/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.16/0.35  % Computer : n016.cluster.edu
% 0.16/0.35  % Model    : x86_64 x86_64
% 0.16/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35  % Memory   : 8042.1875MB
% 0.16/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35  % CPULimit   : 300
% 0.16/0.35  % WCLimit    : 300
% 0.16/0.35  % DateTime   : Tue Apr 30 17:34:56 EDT 2024
% 0.16/0.35  % CPUTime    : 
% 0.16/0.35  This is a TF0_THM_NEQ_ARI problem
% 0.16/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.ypwNpOWYZD/Vampire---4.8_3286
% 0.62/0.80  % (3489)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  % (3491)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.62/0.80  % (3490)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.62/0.80  % (3492)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.62/0.80  % (3493)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.80  % (3494)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.62/0.80  % (3495)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.62/0.80  % (3496)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.81  % (3495)First to succeed.
% 0.65/0.81  % (3495)Refutation found. Thanks to Tanya!
% 0.65/0.81  % SZS status Theorem for Vampire---4
% 0.65/0.81  % SZS output start Proof for Vampire---4
% See solution above
% 0.65/0.81  % (3495)------------------------------
% 0.65/0.81  % (3495)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.65/0.81  % (3495)Termination reason: Refutation
% 0.65/0.81  
% 0.65/0.81  % (3495)Memory used [KB]: 1065
% 0.65/0.81  % (3495)Time elapsed: 0.008 s
% 0.65/0.81  % (3495)Instructions burned: 9 (million)
% 0.65/0.81  % (3495)------------------------------
% 0.65/0.81  % (3495)------------------------------
% 0.65/0.81  % (3442)Success in time 0.444 s
% 0.65/0.81  % Vampire---4.8 exiting
%------------------------------------------------------------------------------