TSTP Solution File: NUM958_5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM958_5 : TPTP v8.1.2. Released v6.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 : n008.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:48 EDT 2024

% Result   : Theorem 0.58s 0.75s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   36
% Syntax   : Number of formulae    :   47 (  15 unt;  32 typ;   0 def)
%            Number of atoms       :   15 (  14 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   2 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :   18 (  12   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  14 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   7 con; 0-3 aty)
%            Number of variables   :   23 (   6   !;   0   ?;  23   :)
%                                         (  17  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    bool: $tType ).

tff(type_def_6,type,
    int: $tType ).

tff(type_def_7,type,
    nat: $tType ).

tff(func_def_0,type,
    minus_minus: 
      !>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).

tff(func_def_1,type,
    one_one: 
      !>[X0: $tType] : X0 ).

tff(func_def_2,type,
    plus_plus: 
      !>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).

tff(func_def_3,type,
    times_times: 
      !>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).

tff(func_def_4,type,
    bit0: int > int ).

tff(func_def_5,type,
    bit1: int > int ).

tff(func_def_6,type,
    pls: int ).

tff(func_def_7,type,
    number_number_of: 
      !>[X0: $tType] : ( int > X0 ) ).

tff(func_def_8,type,
    power_power: 
      !>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).

tff(func_def_9,type,
    fFalse: bool ).

tff(func_def_10,type,
    fTrue: bool ).

tff(func_def_11,type,
    m: int ).

tff(func_def_12,type,
    s: int ).

tff(func_def_13,type,
    t: int ).

tff(func_def_14,type,
    sK0: int ).

tff(pred_def_1,type,
    number: 
      !>[X0: $tType] : $o ).

tff(pred_def_2,type,
    ring: 
      !>[X0: $tType] : $o ).

tff(pred_def_3,type,
    semiring: 
      !>[X0: $tType] : $o ).

tff(pred_def_4,type,
    number_ring: 
      !>[X0: $tType] : $o ).

tff(pred_def_5,type,
    ring_char_0: 
      !>[X0: $tType] : $o ).

tff(pred_def_6,type,
    semiring_1: 
      !>[X0: $tType] : $o ).

tff(pred_def_7,type,
    monoid_mult: 
      !>[X0: $tType] : $o ).

tff(pred_def_8,type,
    number_semiring: 
      !>[X0: $tType] : $o ).

tff(pred_def_9,type,
    linordered_idom: 
      !>[X0: $tType] : $o ).

tff(pred_def_10,type,
    zprime: int > $o ).

tff(pred_def_11,type,
    ord_less: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_12,type,
    dvd_dvd: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_13,type,
    twoSqu1567020053sum2sq: int > $o ).

tff(pred_def_14,type,
    pp: bool > $o ).

tff(f407,plain,
    $false,
    inference(subsumption_resolution,[],[f339,f376]) ).

tff(f376,plain,
    plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),t),
    inference(definition_unfolding,[],[f288,f251,f237,f251,f251,f237]) ).

tff(f237,plain,
    ! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
    inference(cnf_transformation,[],[f120]) ).

tff(f120,plain,
    ! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
    inference(rectify,[],[f95]) ).

tff(f95,axiom,
    ! [X6: int] : ( bit1(X6) = plus_plus(int,plus_plus(int,one_one(int),X6),X6) ),
    file('/export/starexec/sandbox/tmp/tmp.FdlrqDhOPI/Vampire---4.8_372',fact_94_Bit1__def) ).

tff(f251,plain,
    ! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
    inference(cnf_transformation,[],[f127]) ).

tff(f127,plain,
    ! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
    inference(rectify,[],[f86]) ).

tff(f86,axiom,
    ! [X6: int] : ( bit0(X6) = plus_plus(int,X6,X6) ),
    file('/export/starexec/sandbox/tmp/tmp.FdlrqDhOPI/Vampire---4.8_372',fact_85_Bit0__def) ).

tff(f288,plain,
    plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
    inference(cnf_transformation,[],[f1]) ).

tff(f1,axiom,
    plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
    file('/export/starexec/sandbox/tmp/tmp.FdlrqDhOPI/Vampire---4.8_372',fact_0_t) ).

tff(f339,plain,
    plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),one_one(int)) != times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),t),
    inference(definition_unfolding,[],[f234,f251,f237,f251,f251,f237]) ).

tff(f234,plain,
    plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) != times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
    inference(cnf_transformation,[],[f117]) ).

tff(f117,plain,
    plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) != times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
    inference(flattening,[],[f116]) ).

tff(f116,negated_conjecture,
    ( ~ plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t) ),
    inference(negated_conjecture,[],[f115]) ).

tff(f115,conjecture,
    plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
    file('/export/starexec/sandbox/tmp/tmp.FdlrqDhOPI/Vampire---4.8_372',conj_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : NUM958_5 : TPTP v8.1.2. Released v6.0.0.
% 0.14/0.15  % 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.16/0.35  % Computer : n008.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.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Tue Apr 30 16:56:57 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  This is a TF1_THM_EQU_NAR problem
% 0.22/0.36  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.FdlrqDhOPI/Vampire---4.8_372
% 0.58/0.74  % (676)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 (2996ds/83Mi)
% 0.58/0.74  % (670)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.74  % (672)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.74  % (676)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.58/0.74  % (673)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.74  % (674)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.74  % (671)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 (2996ds/51Mi)
% 0.58/0.74  % (675)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.58/0.74  % (676)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.58/0.75  % (676)First to succeed.
% 0.58/0.75  % (676)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  % (676)------------------------------
% 0.58/0.75  % (676)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75  % (676)Termination reason: Refutation
% 0.58/0.75  
% 0.58/0.75  % (676)Memory used [KB]: 1230
% 0.58/0.75  % (676)Time elapsed: 0.006 s
% 0.58/0.75  % (676)Instructions burned: 16 (million)
% 0.58/0.75  % (676)------------------------------
% 0.58/0.75  % (676)------------------------------
% 0.58/0.75  % (666)Success in time 0.378 s
% 0.58/0.75  terminate called after throwing an instance of 'Lib::SystemFailException'
% 0.58/0.75  666 Aborted by signal SIGABRT on /export/starexec/sandbox/tmp/tmp.FdlrqDhOPI/Vampire---4.8_372
% 0.58/0.75  % (666)------------------------------
% 0.58/0.75  % (666)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75  % (666)Termination reason: Unknown
% 0.58/0.75  % (666)Termination phase: Unknown
% 0.58/0.75  
% 0.58/0.75  % (666)Memory used [KB]: 486
% 0.58/0.75  % (666)Time elapsed: 0.378 s
% 0.58/0.75  % (666)Instructions burned: 967 (million)
% 0.58/0.75  % (666)------------------------------
% 0.58/0.75  % (666)------------------------------
% 0.58/0.75  Version : Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75  ???
% 0.58/0.75   ???
% 0.58/0.75    ???
% 0.58/0.75     ???
% 0.58/0.75      ???
% 0.58/0.75       ???
% 0.58/0.75        ???
% 0.58/0.75         ???
% 0.58/0.75          ???
% 0.58/0.75           ???
% 0.58/0.75            ???
% 0.58/0.75             ???
% 0.58/0.75              ???
% 0.58/0.75               ???
% 0.58/0.75                ???
% 0.58/0.75                 ???
% 0.58/0.75                  ???
% 0.58/0.75                   ???
% 0.58/0.75                    ???
% 0.58/0.75                     ???
% 0.58/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------