TSTP Solution File: NUN004_5 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : NUN004_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n032.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 : Tue Apr 30 14:40:10 EDT 2024

% Result   : Theorem 0.14s 0.32s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   46
% Syntax   : Number of formulae    :   54 (  11 unt;  43 typ;   0 def)
%            Number of atoms       :   11 (  10 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :   17 (  12   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :   19 (  17 usr;   1 prp; 0-3 aty)
%            Number of functors    :   23 (  23 usr;  14 con; 0-3 aty)
%            Number of variables   :   21 (   0   !;   0   ?;  21   :)
%                                         (  21  !>;   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,
    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,
    power_power: 
      !>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).

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,
    m1: int ).

tff(func_def_14,type,
    n: nat ).

tff(func_def_15,type,
    t: int ).

tff(func_def_16,type,
    v: int ).

tff(func_def_17,type,
    w: int ).

tff(func_def_18,type,
    x: int ).

tff(func_def_19,type,
    y: int ).

tff(func_def_20,type,
    sK0: int ).

tff(func_def_21,type,
    sK1: int ).

tff(func_def_22,type,
    sK2: int ).

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,
    monoid_mult: 
      !>[X0: $tType] : $o ).

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

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

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

tff(pred_def_10,type,
    linord581940658strict: 
      !>[X0: $tType] : $o ).

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

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

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

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

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

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

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

tff(f465,plain,
    $false,
    inference(trivial_inequality_removal,[],[f464]) ).

tff(f464,plain,
    times_times(int,plus_plus(int,power_power(int,x,number_number_of(nat,bit0(bit1(pls)))),power_power(int,y,number_number_of(nat,bit0(bit1(pls))))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)) != times_times(int,plus_plus(int,power_power(int,x,number_number_of(nat,bit0(bit1(pls)))),power_power(int,y,number_number_of(nat,bit0(bit1(pls))))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),
    inference(backward_demodulation,[],[f463,f324]) ).

tff(f324,plain,
    plus_plus(int,power_power(int,x,number_number_of(nat,bit0(bit1(pls)))),power_power(int,y,number_number_of(nat,bit0(bit1(pls))))) = 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,n))),
    inference(cnf_transformation,[],[f2]) ).

tff(f2,axiom,
    plus_plus(int,power_power(int,x,number_number_of(nat,bit0(bit1(pls)))),power_power(int,y,number_number_of(nat,bit0(bit1(pls))))) = 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,n))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_xy) ).

tff(f463,plain,
    times_times(int,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,n))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)) != times_times(int,plus_plus(int,power_power(int,x,number_number_of(nat,bit0(bit1(pls)))),power_power(int,y,number_number_of(nat,bit0(bit1(pls))))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),
    inference(backward_demodulation,[],[f289,f323]) ).

tff(f323,plain,
    plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))) = times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1),
    inference(cnf_transformation,[],[f1]) ).

tff(f1,axiom,
    plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))) = times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_m1) ).

tff(f289,plain,
    times_times(int,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,n))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))) != times_times(int,plus_plus(int,power_power(int,x,number_number_of(nat,bit0(bit1(pls)))),power_power(int,y,number_number_of(nat,bit0(bit1(pls))))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))),
    inference(cnf_transformation,[],[f120]) ).

tff(f120,plain,
    times_times(int,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,n))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))) != times_times(int,plus_plus(int,power_power(int,x,number_number_of(nat,bit0(bit1(pls)))),power_power(int,y,number_number_of(nat,bit0(bit1(pls))))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))),
    inference(flattening,[],[f119]) ).

tff(f119,negated_conjecture,
    ( ~ times_times(int,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,n))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))) = times_times(int,plus_plus(int,power_power(int,x,number_number_of(nat,bit0(bit1(pls)))),power_power(int,y,number_number_of(nat,bit0(bit1(pls))))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))) ),
    inference(negated_conjecture,[],[f118]) ).

tff(f118,conjecture,
    times_times(int,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,n))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))) = times_times(int,plus_plus(int,power_power(int,x,number_number_of(nat,bit0(bit1(pls)))),power_power(int,y,number_number_of(nat,bit0(bit1(pls))))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : NUN004_5 : TPTP v8.1.2. Released v6.0.0.
% 0.08/0.10  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.09/0.29  % Computer : n032.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit   : 300
% 0.09/0.29  % WCLimit    : 300
% 0.09/0.29  % DateTime   : Tue Apr 30 02:35:51 EDT 2024
% 0.09/0.29  % CPUTime    : 
% 0.14/0.30  % (4063)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.31  % (4067)WARNING: value z3 for option sas not known
% 0.14/0.31  % (4070)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.31  % (4071)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.31  % (4066)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.31  % (4065)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.31  % (4067)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.32  % (4071)First to succeed.
% 0.14/0.32  % (4072)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.32  % Exception at run slice level
% 0.14/0.32  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.32  % Exception at run slice level
% 0.14/0.32  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.32  % (4069)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.32  % (4071)Refutation found. Thanks to Tanya!
% 0.14/0.32  % SZS status Theorem for theBenchmark
% 0.14/0.32  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.32  % (4071)------------------------------
% 0.14/0.32  % (4071)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.32  % (4071)Termination reason: Refutation
% 0.14/0.32  
% 0.14/0.32  % (4071)Memory used [KB]: 947
% 0.14/0.32  % (4071)Time elapsed: 0.004 s
% 0.14/0.32  % (4071)Instructions burned: 11 (million)
% 0.14/0.32  % (4071)------------------------------
% 0.14/0.32  % (4071)------------------------------
% 0.14/0.32  % (4063)Success in time 0.019 s
%------------------------------------------------------------------------------