TSTP Solution File: NUM900_1 by Vampire---4.8

View Problem - Process Solution

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

% Computer : n011.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:10 EDT 2024

% Result   : Theorem 0.59s 0.82s
% Output   : Refutation 0.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   37 (  14 unt;   3 typ;   0 def)
%            Number of atoms       :   61 (  14 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   48 (  21   ~;  15   |;   7   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :  103 (  33 atm;  25 fun;  12 num;  33 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :    7 (   3 usr;   4 con; 0-2 aty)
%            Number of variables   :   33 (  27   !;   6   ?;  33   :)

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

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

tff(func_def_7,type,
    sK2: $int ).

tff(f224,plain,
    $false,
    inference(avatar_sat_refutation,[],[f37,f178,f223]) ).

tff(f223,plain,
    ~ spl3_1,
    inference(avatar_contradiction_clause,[],[f222]) ).

tff(f222,plain,
    ( $false
    | ~ spl3_1 ),
    inference(subsumption_resolution,[],[f211,f9]) ).

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

tff(f211,plain,
    ( ! [X0: $int] : $less(X0,X0)
    | ~ spl3_1 ),
    inference(evaluation,[],[f202]) ).

tff(f202,plain,
    ( ! [X0: $int] : $less(X0,$sum(X0,0))
    | ~ spl3_1 ),
    inference(superposition,[],[f57,f183]) ).

tff(f183,plain,
    ( ( 0 = sK2 )
    | ~ spl3_1 ),
    inference(forward_demodulation,[],[f181,f8]) ).

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

tff(f181,plain,
    ( ( sK2 = $sum(sK0,$uminus(sK0)) )
    | ~ spl3_1 ),
    inference(superposition,[],[f18,f31]) ).

tff(f31,plain,
    ( ( sK0 = sK1 )
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f29]) ).

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

tff(f18,plain,
    sK2 = $sum(sK0,$uminus(sK1)),
    inference(cnf_transformation,[],[f17]) ).

tff(f17,plain,
    ? [X0: $int,X1: $int,X2: $int] :
      ( ~ $less(X1,X0)
      & $less(0,X2)
      & ( $sum(X0,$uminus(X1)) = X2 ) ),
    inference(flattening,[],[f16]) ).

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

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

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

tff(f1,conjecture,
    ! [X0: $int,X1: $int,X2: $int] :
      ( ( $less(0,X2)
        & ( $difference(X0,X1) = X2 ) )
     => $less(X1,X0) ),
    file('/export/starexec/sandbox/tmp/tmp.3xp5mrEC6X/Vampire---4.8_31910',difference_greater) ).

tff(f57,plain,
    ! [X0: $int] : $less(X0,$sum(X0,sK2)),
    inference(superposition,[],[f25,f4]) ).

tff(f4,plain,
    ! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
    introduced(theory_axiom_135,[]) ).

tff(f25,plain,
    ! [X0: $int] : $less(X0,$sum(sK2,X0)),
    inference(evaluation,[],[f21]) ).

tff(f21,plain,
    ! [X0: $int] : $less($sum(0,X0),$sum(sK2,X0)),
    inference(unit_resulting_resolution,[],[f19,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(f19,plain,
    $less(0,sK2),
    inference(cnf_transformation,[],[f17]) ).

tff(f178,plain,
    ~ spl3_2,
    inference(avatar_split_clause,[],[f175,f33]) ).

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

tff(f175,plain,
    ~ $less(sK0,sK1),
    inference(subsumption_resolution,[],[f163,f23]) ).

tff(f23,plain,
    ~ $less(sK2,0),
    inference(unit_resulting_resolution,[],[f9,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(f163,plain,
    ( $less(sK2,0)
    | ~ $less(sK0,sK1) ),
    inference(superposition,[],[f41,f8]) ).

tff(f41,plain,
    ! [X0: $int] :
      ( $less(sK2,$sum(X0,$uminus(sK1)))
      | ~ $less(sK0,X0) ),
    inference(superposition,[],[f12,f18]) ).

tff(f37,plain,
    ( spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f27,f33,f29]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : NUM900_1 : TPTP v8.1.2. Released v5.0.0.
% 0.12/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.33  % Computer : n011.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 16:54:46 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a TF0_THM_EQU_ARI problem
% 0.13/0.34  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.3xp5mrEC6X/Vampire---4.8_31910
% 0.59/0.81  % (32021)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.59/0.81  % (32022)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.59/0.81  % (32024)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.59/0.81  % (32025)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.59/0.81  % (32023)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.59/0.81  % (32026)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.59/0.81  % (32027)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.59/0.81  % (32028)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.59/0.82  % (32027)First to succeed.
% 0.59/0.82  % (32027)Refutation found. Thanks to Tanya!
% 0.59/0.82  % SZS status Theorem for Vampire---4
% 0.59/0.82  % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.82  % (32027)------------------------------
% 0.59/0.82  % (32027)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.82  % (32027)Termination reason: Refutation
% 0.59/0.82  
% 0.59/0.82  % (32027)Memory used [KB]: 1071
% 0.59/0.82  % (32027)Time elapsed: 0.007 s
% 0.59/0.82  % (32027)Instructions burned: 9 (million)
% 0.59/0.82  % (32027)------------------------------
% 0.59/0.82  % (32027)------------------------------
% 0.59/0.82  % (32020)Success in time 0.477 s
% 0.59/0.82  % Vampire---4.8 exiting
%------------------------------------------------------------------------------