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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWV633_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 : 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 : Sun May  5 11:10:09 EDT 2024

% Result   : Theorem 0.22s 0.45s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   44
% Syntax   : Number of formulae    :   61 (  13 unt;  40 typ;   0 def)
%            Number of atoms       :   29 (  18 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   19 (  11   ~;   4   |;   0   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :   19 (  13   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :   18 (  16 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;   7 con; 0-4 aty)
%            Number of variables   :   57 (  33   !;   0   ?;  57   :)
%                                         (  24  !>;   0  ?*;   0  @-;   0  @+)

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

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

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

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

tff(type_def_9,type,
    real: $tType ).

tff(type_def_10,type,
    fun: ( $tType * $tType ) > $tType ).

tff(func_def_0,type,
    ii: complex ).

tff(func_def_1,type,
    fFT_Mirabelle_root: nat > complex ).

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

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

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

tff(func_def_7,type,
    pls: int ).

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

tff(func_def_9,type,
    suc: nat > nat ).

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

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

tff(func_def_12,type,
    fFalse: bool ).

tff(func_def_13,type,
    fTrue: bool ).

tff(func_def_14,type,
    i: nat ).

tff(func_def_15,type,
    j: nat ).

tff(func_def_16,type,
    m: nat ).

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(pred_def_13,type,
    boolean_algebra: 
      !>[X0: $tType] : $o ).

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

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

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

tff(f1463,plain,
    $false,
    inference(trivial_inequality_removal,[],[f1462]) ).

tff(f1462,plain,
    power_power(complex,fFT_Mirabelle_root(times_times(nat,m,number_number_of(nat,bit0(bit1(pls))))),times_times(nat,i,times_times(nat,j,number_number_of(nat,bit0(bit1(pls)))))) != power_power(complex,fFT_Mirabelle_root(times_times(nat,m,number_number_of(nat,bit0(bit1(pls))))),times_times(nat,i,times_times(nat,j,number_number_of(nat,bit0(bit1(pls)))))),
    inference(backward_demodulation,[],[f569,f1460]) ).

tff(f1460,plain,
    ! [X2: nat,X0: nat,X1: nat] : ( times_times(nat,X0,times_times(nat,X1,X2)) = times_times(nat,times_times(nat,X0,X1),X2) ),
    inference(resolution,[],[f459,f385]) ).

tff(f385,plain,
    comm_semiring_1(nat),
    inference(cnf_transformation,[],[f115]) ).

tff(f115,axiom,
    comm_semiring_1(nat),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Nat_Onat___Rings_Ocomm__semiring__1) ).

tff(f459,plain,
    ! [X0: $tType,X2: X0,X3: X0,X1: X0] :
      ( ~ comm_semiring_1(X0)
      | ( times_times(X0,X3,times_times(X0,X2,X1)) = times_times(X0,times_times(X0,X3,X2),X1) ) ),
    inference(cnf_transformation,[],[f299]) ).

tff(f299,plain,
    ! [X0: $tType] :
      ( ! [X1: X0,X2: X0,X3: X0] : ( times_times(X0,X3,times_times(X0,X2,X1)) = times_times(X0,times_times(X0,X3,X2),X1) )
      | ~ comm_semiring_1(X0) ),
    inference(ennf_transformation,[],[f214]) ).

tff(f214,plain,
    ! [X0: $tType] :
      ( comm_semiring_1(X0)
     => ! [X1: X0,X2: X0,X3: X0] : ( times_times(X0,X3,times_times(X0,X2,X1)) = times_times(X0,times_times(X0,X3,X2),X1) ) ),
    inference(rectify,[],[f26]) ).

tff(f26,axiom,
    ! [X0: $tType] :
      ( comm_semiring_1(X0)
     => ! [X15: X0,X16: X0,X18: X0] : ( times_times(X0,X18,times_times(X0,X16,X15)) = times_times(X0,times_times(X0,X18,X16),X15) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_25_comm__semiring__1__class_Onormalizing__semiring__rules_I18_J) ).

tff(f569,plain,
    power_power(complex,fFT_Mirabelle_root(times_times(nat,m,number_number_of(nat,bit0(bit1(pls))))),times_times(nat,times_times(nat,i,j),number_number_of(nat,bit0(bit1(pls))))) != power_power(complex,fFT_Mirabelle_root(times_times(nat,m,number_number_of(nat,bit0(bit1(pls))))),times_times(nat,i,times_times(nat,j,number_number_of(nat,bit0(bit1(pls)))))),
    inference(forward_demodulation,[],[f568,f565]) ).

tff(f565,plain,
    ! [X0: nat,X1: nat] : ( times_times(nat,X1,X0) = times_times(nat,X0,X1) ),
    inference(resolution,[],[f447,f385]) ).

tff(f447,plain,
    ! [X0: $tType,X2: X0,X1: X0] :
      ( ~ comm_semiring_1(X0)
      | ( times_times(X0,X2,X1) = times_times(X0,X1,X2) ) ),
    inference(cnf_transformation,[],[f287]) ).

tff(f287,plain,
    ! [X0: $tType] :
      ( ! [X1: X0,X2: X0] : ( times_times(X0,X2,X1) = times_times(X0,X1,X2) )
      | ~ comm_semiring_1(X0) ),
    inference(ennf_transformation,[],[f202]) ).

tff(f202,plain,
    ! [X0: $tType] :
      ( comm_semiring_1(X0)
     => ! [X1: X0,X2: X0] : ( times_times(X0,X2,X1) = times_times(X0,X1,X2) ) ),
    inference(rectify,[],[f28]) ).

tff(f28,axiom,
    ! [X0: $tType] :
      ( comm_semiring_1(X0)
     => ! [X19: X0,X5: X0] : ( times_times(X0,X5,X19) = times_times(X0,X19,X5) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_27_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).

tff(f568,plain,
    power_power(complex,fFT_Mirabelle_root(times_times(nat,m,number_number_of(nat,bit0(bit1(pls))))),times_times(nat,i,times_times(nat,number_number_of(nat,bit0(bit1(pls))),j))) != power_power(complex,fFT_Mirabelle_root(times_times(nat,m,number_number_of(nat,bit0(bit1(pls))))),times_times(nat,times_times(nat,i,j),number_number_of(nat,bit0(bit1(pls))))),
    inference(forward_demodulation,[],[f567,f565]) ).

tff(f567,plain,
    power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,bit0(bit1(pls))),j))) != power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,times_times(nat,i,j),number_number_of(nat,bit0(bit1(pls))))),
    inference(backward_demodulation,[],[f339,f565]) ).

tff(f339,plain,
    power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,bit0(bit1(pls))),j))) != power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,number_number_of(nat,bit0(bit1(pls))),times_times(nat,i,j))),
    inference(cnf_transformation,[],[f153]) ).

tff(f153,plain,
    power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,bit0(bit1(pls))),j))) != power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,number_number_of(nat,bit0(bit1(pls))),times_times(nat,i,j))),
    inference(flattening,[],[f152]) ).

tff(f152,negated_conjecture,
    ( ~ power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,bit0(bit1(pls))),j))) = power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,number_number_of(nat,bit0(bit1(pls))),times_times(nat,i,j))) ),
    inference(negated_conjecture,[],[f151]) ).

tff(f151,conjecture,
    power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,bit0(bit1(pls))),j))) = power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,number_number_of(nat,bit0(bit1(pls))),times_times(nat,i,j))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SWV633_5 : TPTP v8.1.2. Released v6.0.0.
% 0.10/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri May  3 21:14:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  % (3610)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (3613)WARNING: value z3 for option sas not known
% 0.14/0.38  % (3614)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38  % (3615)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.38  % (3611)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38  % (3613)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.38  % (3612)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38  % (3616)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.38  % (3617)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.38  % (3617)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.14/0.38  % Exception at run slice level
% 0.14/0.38  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.38  % Exception at run slice level
% 0.14/0.38  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.38  % Exception at run slice level
% 0.14/0.38  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.40  % (3618)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.14/0.40  % (3620)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.14/0.40  % (3619)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.14/0.40  % (3618)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.14/0.40  % Exception at run slice level
% 0.14/0.40  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.40  % (3619)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.22/0.42  % (3621)ott+4_64_acc=on:anc=none:bs=on:bsr=on:fsd=off:gs=on:gsem=off:irw=on:msp=off:nwc=2.5:nicw=on:sims=off_354 on theBenchmark for (354ds/0Mi)
% 0.22/0.45  % (3620)First to succeed.
% 0.22/0.45  % (3620)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3610"
% 0.22/0.45  % (3620)Refutation found. Thanks to Tanya!
% 0.22/0.45  % SZS status Theorem for theBenchmark
% 0.22/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.45  % (3620)------------------------------
% 0.22/0.45  % (3620)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.45  % (3620)Termination reason: Refutation
% 0.22/0.45  
% 0.22/0.45  % (3620)Memory used [KB]: 1401
% 0.22/0.45  % (3620)Time elapsed: 0.052 s
% 0.22/0.45  % (3620)Instructions burned: 82 (million)
% 0.22/0.45  % (3610)Success in time 0.095 s
%------------------------------------------------------------------------------