TSTP Solution File: NUM977_5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM977_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 : 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:54 EDT 2024

% Result   : Theorem 0.60s 0.76s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   35
% Syntax   : Number of formulae    :   40 (   7 unt;  33 typ;   0 def)
%            Number of atoms       :    7 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    8 (   3 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :   19 (  13   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :   15 (  14 usr;   1 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;   6 con; 0-4 aty)
%            Number of variables   :   19 (   0   !;   0   ?;  19   :)
%                                         (  19  !>;   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(type_def_8,type,
    fun: ( $tType * $tType ) > $tType ).

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

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

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

tff(func_def_3,type,
    zero_zero: 
      !>[X0: $tType] : 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,
    semiring_1_of_nat: 
      !>[X0: $tType] : ( nat > X0 ) ).

tff(func_def_9,type,
    aa: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).

tff(func_def_10,type,
    fFalse: bool ).

tff(func_def_11,type,
    fTrue: bool ).

tff(func_def_12,type,
    m: int ).

tff(func_def_13,type,
    t: int ).

tff(func_def_14,type,
    tn: nat ).

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

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

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

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

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

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

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

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

tff(pred_def_9,type,
    linord219039673up_add: 
      !>[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,
    twoSqu1567020053sum2sq: int > $o ).

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

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

tff(f375,plain,
    $false,
    inference(subsumption_resolution,[],[f222,f313]) ).

tff(f313,plain,
    ~ twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),plus_plus(int,one_one(int),semiring_1_of_nat(int,zero_zero(nat))))),
    inference(cnf_transformation,[],[f2]) ).

tff(f2,axiom,
    ~ twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),plus_plus(int,one_one(int),semiring_1_of_nat(int,zero_zero(nat))))),
    file('/export/starexec/sandbox/tmp/tmp.EDPVHBo3df/Vampire---4.8_1960',fact_1_nQ1) ).

tff(f222,plain,
    twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),plus_plus(int,one_one(int),semiring_1_of_nat(int,zero_zero(nat))))),
    inference(cnf_transformation,[],[f118]) ).

tff(f118,plain,
    twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),plus_plus(int,one_one(int),semiring_1_of_nat(int,zero_zero(nat))))),
    inference(flattening,[],[f117]) ).

tff(f117,negated_conjecture,
    ~ ~ twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),plus_plus(int,one_one(int),semiring_1_of_nat(int,zero_zero(nat))))),
    inference(negated_conjecture,[],[f116]) ).

tff(f116,conjecture,
    ~ twoSqu1567020053sum2sq(times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),plus_plus(int,one_one(int),semiring_1_of_nat(int,zero_zero(nat))))),
    file('/export/starexec/sandbox/tmp/tmp.EDPVHBo3df/Vampire---4.8_1960',conj_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : NUM977_5 : TPTP v8.1.2. Released v6.0.0.
% 0.04/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.36  % Computer : n016.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % 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 17:34:41 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  This is a TF1_THM_EQU_NAR problem
% 0.16/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.EDPVHBo3df/Vampire---4.8_1960
% 0.60/0.75  % (2228)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 (2996ds/56Mi)
% 0.60/0.75  % (2227)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.60/0.75  % (2221)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.60/0.75  % (2224)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.60/0.75  % (2222)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.60/0.75  % (2223)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.60/0.75  % (2225)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.60/0.75  % (2226)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.60/0.75  % (2228)First to succeed.
% 0.60/0.76  % (2227)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.76  % (2228)Refutation found. Thanks to Tanya!
% 0.60/0.76  % SZS status Theorem for Vampire---4
% 0.60/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76  % (2228)------------------------------
% 0.60/0.76  % (2228)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.76  % (2228)Termination reason: Refutation
% 0.60/0.76  
% 0.60/0.76  % (2228)Memory used [KB]: 1140
% 0.60/0.76  % (2228)Time elapsed: 0.003 s
% 0.60/0.76  % (2228)Instructions burned: 7 (million)
% 0.60/0.76  % (2228)------------------------------
% 0.60/0.76  % (2228)------------------------------
% 0.60/0.76  % (2217)Success in time 0.387 s
% 0.60/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------