TSTP Solution File: SWV617_5 by Vampire---4.8

View Problem - Process Solution

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

% Computer : n004.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 10:38:47 EDT 2024

% Result   : Theorem 0.63s 0.84s
% Output   : Refutation 0.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   50
% Syntax   : Number of formulae    :   76 (  23 unt;  41 typ;   0 def)
%            Number of atoms       :   47 (  22 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   26 (  14   ~;   6   |;   0   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :   19 (  11   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :   27 (  25 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   4 con; 0-4 aty)
%            Number of variables   :   61 (  30   !;   0   ?;  61   :)
%                                         (  31  !>;   0  ?*;   0  @-;   0  @+)

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

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

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

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

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

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

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

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

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

tff(func_def_5,type,
    zero_zero: 
      !>[X0: $tType] : X0 ).

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

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

tff(func_def_8,type,
    fFalse: bool ).

tff(func_def_9,type,
    fTrue: bool ).

tff(func_def_10,type,
    k: nat ).

tff(func_def_11,type,
    n: nat ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(pred_def_16,type,
    field_inverse_zero: 
      !>[X0: $tType] : $o ).

tff(pred_def_17,type,
    ordered_ab_group_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_18,type,
    ring_n68954251visors: 
      !>[X0: $tType] : $o ).

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

tff(pred_def_20,type,
    divisi14063676e_zero: 
      !>[X0: $tType] : $o ).

tff(pred_def_21,type,
    linord1117847801e_zero: 
      !>[X0: $tType] : $o ).

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

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

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

tff(pred_def_25,type,
    sP0: complex > $o ).

tff(f590,plain,
    $false,
    inference(subsumption_resolution,[],[f589,f502]) ).

tff(f502,plain,
    sP0(zero_zero(complex)),
    inference(inequality_splitting,[],[f500,f501]) ).

tff(f501,plain,
    ~ sP0(inverse_divide(complex,minus_minus(complex,power_power(complex,power_power(complex,fFT_Mirabelle_root(n),n),k),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex)))),
    introduced(inequality_splitting_name_introduction,[new_symbols(naming,[sP0])]) ).

tff(f500,plain,
    inverse_divide(complex,minus_minus(complex,power_power(complex,power_power(complex,fFT_Mirabelle_root(n),n),k),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex))) != zero_zero(complex),
    inference(cnf_transformation,[],[f220]) ).

tff(f220,plain,
    inverse_divide(complex,minus_minus(complex,power_power(complex,power_power(complex,fFT_Mirabelle_root(n),n),k),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex))) != zero_zero(complex),
    inference(flattening,[],[f128]) ).

tff(f128,negated_conjecture,
    ( ~ inverse_divide(complex,minus_minus(complex,power_power(complex,power_power(complex,fFT_Mirabelle_root(n),n),k),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex))) = zero_zero(complex) ),
    inference(negated_conjecture,[],[f127]) ).

tff(f127,conjecture,
    inverse_divide(complex,minus_minus(complex,power_power(complex,power_power(complex,fFT_Mirabelle_root(n),n),k),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex))) = zero_zero(complex),
    file('/export/starexec/sandbox2/tmp/tmp.mbb8NOQS4E/Vampire---4.8_6387',conj_0) ).

tff(f589,plain,
    ~ sP0(zero_zero(complex)),
    inference(backward_demodulation,[],[f584,f587]) ).

tff(f587,plain,
    ! [X0: complex] : ( zero_zero(complex) = inverse_divide(complex,zero_zero(complex),X0) ),
    inference(unit_resulting_resolution,[],[f488,f346]) ).

tff(f346,plain,
    ! [X0: $tType,X1: X0] :
      ( ~ division_ring(X0)
      | ( zero_zero(X0) = inverse_divide(X0,zero_zero(X0),X1) ) ),
    inference(cnf_transformation,[],[f235]) ).

tff(f235,plain,
    ! [X0: $tType] :
      ( ! [X1: X0] : ( zero_zero(X0) = inverse_divide(X0,zero_zero(X0),X1) )
      | ~ division_ring(X0) ),
    inference(ennf_transformation,[],[f133]) ).

tff(f133,plain,
    ! [X0: $tType] :
      ( division_ring(X0)
     => ! [X1: X0] : ( zero_zero(X0) = inverse_divide(X0,zero_zero(X0),X1) ) ),
    inference(rectify,[],[f7]) ).

tff(f7,axiom,
    ! [X0: $tType] :
      ( division_ring(X0)
     => ! [X3: X0] : ( zero_zero(X0) = inverse_divide(X0,zero_zero(X0),X3) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.mbb8NOQS4E/Vampire---4.8_6387',fact_6_divide__zero__left) ).

tff(f488,plain,
    division_ring(complex),
    inference(cnf_transformation,[],[f115]) ).

tff(f115,axiom,
    division_ring(complex),
    file('/export/starexec/sandbox2/tmp/tmp.mbb8NOQS4E/Vampire---4.8_6387',arity_Complex_Ocomplex___Fields_Odivision__ring) ).

tff(f584,plain,
    ~ sP0(inverse_divide(complex,zero_zero(complex),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex)))),
    inference(forward_demodulation,[],[f582,f560]) ).

tff(f560,plain,
    ! [X0: complex] : ( zero_zero(complex) = minus_minus(complex,X0,X0) ),
    inference(unit_resulting_resolution,[],[f492,f351]) ).

tff(f351,plain,
    ! [X0: $tType,X1: X0] :
      ( ~ group_add(X0)
      | ( zero_zero(X0) = minus_minus(X0,X1,X1) ) ),
    inference(cnf_transformation,[],[f239]) ).

tff(f239,plain,
    ! [X0: $tType] :
      ( ! [X1: X0] : ( zero_zero(X0) = minus_minus(X0,X1,X1) )
      | ~ group_add(X0) ),
    inference(ennf_transformation,[],[f136]) ).

tff(f136,plain,
    ! [X0: $tType] :
      ( group_add(X0)
     => ! [X1: X0] : ( zero_zero(X0) = minus_minus(X0,X1,X1) ) ),
    inference(rectify,[],[f10]) ).

tff(f10,axiom,
    ! [X0: $tType] :
      ( group_add(X0)
     => ! [X3: X0] : ( zero_zero(X0) = minus_minus(X0,X3,X3) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.mbb8NOQS4E/Vampire---4.8_6387',fact_9_diff__self) ).

tff(f492,plain,
    group_add(complex),
    inference(cnf_transformation,[],[f119]) ).

tff(f119,axiom,
    group_add(complex),
    file('/export/starexec/sandbox2/tmp/tmp.mbb8NOQS4E/Vampire---4.8_6387',arity_Complex_Ocomplex___Groups_Ogroup__add) ).

tff(f582,plain,
    ~ sP0(inverse_divide(complex,minus_minus(complex,one_one(complex),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex)))),
    inference(backward_demodulation,[],[f555,f581]) ).

tff(f581,plain,
    ! [X0: nat] : ( one_one(complex) = power_power(complex,one_one(complex),X0) ),
    inference(unit_resulting_resolution,[],[f490,f345]) ).

tff(f345,plain,
    ! [X0: $tType,X1: nat] :
      ( ~ monoid_mult(X0)
      | ( one_one(X0) = power_power(X0,one_one(X0),X1) ) ),
    inference(cnf_transformation,[],[f234]) ).

tff(f234,plain,
    ! [X0: $tType] :
      ( ! [X1: nat] : ( one_one(X0) = power_power(X0,one_one(X0),X1) )
      | ~ monoid_mult(X0) ),
    inference(ennf_transformation,[],[f132]) ).

tff(f132,plain,
    ! [X0: $tType] :
      ( monoid_mult(X0)
     => ! [X1: nat] : ( one_one(X0) = power_power(X0,one_one(X0),X1) ) ),
    inference(rectify,[],[f6]) ).

tff(f6,axiom,
    ! [X0: $tType] :
      ( monoid_mult(X0)
     => ! [X2: nat] : ( one_one(X0) = power_power(X0,one_one(X0),X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.mbb8NOQS4E/Vampire---4.8_6387',fact_5_power__one) ).

tff(f490,plain,
    monoid_mult(complex),
    inference(cnf_transformation,[],[f117]) ).

tff(f117,axiom,
    monoid_mult(complex),
    file('/export/starexec/sandbox2/tmp/tmp.mbb8NOQS4E/Vampire---4.8_6387',arity_Complex_Ocomplex___Groups_Omonoid__mult) ).

tff(f555,plain,
    ~ sP0(inverse_divide(complex,minus_minus(complex,power_power(complex,one_one(complex),k),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex)))),
    inference(forward_demodulation,[],[f501,f342]) ).

tff(f342,plain,
    ! [X0: nat] : ( one_one(complex) = power_power(complex,fFT_Mirabelle_root(X0),X0) ),
    inference(cnf_transformation,[],[f130]) ).

tff(f130,plain,
    ! [X0: nat] : ( one_one(complex) = power_power(complex,fFT_Mirabelle_root(X0),X0) ),
    inference(rectify,[],[f4]) ).

tff(f4,axiom,
    ! [X2: nat] : ( one_one(complex) = power_power(complex,fFT_Mirabelle_root(X2),X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.mbb8NOQS4E/Vampire---4.8_6387',fact_3_root__unity) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SWV617_5 : TPTP v8.1.2. Released v6.0.0.
% 0.12/0.15  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36  % Computer : n004.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 21:13:53 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a TF1_THM_EQU_NAR problem
% 0.15/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.mbb8NOQS4E/Vampire---4.8_6387
% 0.63/0.83  % (6594)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.63/0.83  % (6591)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.63/0.83  % (6586)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.63/0.83  % (6588)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.63/0.83  % (6587)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.63/0.83  % (6589)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.63/0.83  % (6590)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.63/0.83  % (6594)Refutation not found, incomplete strategy% (6594)------------------------------
% 0.63/0.83  % (6594)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.83  % (6594)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.83  
% 0.63/0.83  % (6594)Memory used [KB]: 1131
% 0.63/0.83  % (6594)Time elapsed: 0.002 s
% 0.63/0.83  % (6594)Instructions burned: 5 (million)
% 0.63/0.83  % (6592)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.63/0.83  % (6594)------------------------------
% 0.63/0.83  % (6594)------------------------------
% 0.63/0.83  % (6591)Refutation not found, incomplete strategy% (6591)------------------------------
% 0.63/0.83  % (6591)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.83  % (6591)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.83  
% 0.63/0.83  % (6591)Memory used [KB]: 1128
% 0.63/0.83  % (6591)Time elapsed: 0.003 s
% 0.63/0.83  % (6591)Instructions burned: 5 (million)
% 0.63/0.83  % (6591)------------------------------
% 0.63/0.83  % (6591)------------------------------
% 0.63/0.84  % (6592)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.63/0.84  % (6592)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.63/0.84  % (6596)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.63/0.84  % (6597)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.63/0.84  % (6592)Refutation not found, incomplete strategy% (6592)------------------------------
% 0.63/0.84  % (6592)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.84  % (6592)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.84  
% 0.63/0.84  % (6592)Memory used [KB]: 1129
% 0.63/0.84  % (6592)Time elapsed: 0.005 s
% 0.63/0.84  % (6592)Instructions burned: 7 (million)
% 0.63/0.84  % (6592)------------------------------
% 0.63/0.84  % (6592)------------------------------
% 0.63/0.84  % (6590)Refutation not found, incomplete strategy% (6590)------------------------------
% 0.63/0.84  % (6590)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.84  % (6590)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.84  
% 0.63/0.84  % (6590)Memory used [KB]: 1256
% 0.63/0.84  % (6590)Time elapsed: 0.007 s
% 0.63/0.84  % (6590)Instructions burned: 11 (million)
% 0.63/0.84  % (6590)------------------------------
% 0.63/0.84  % (6590)------------------------------
% 0.63/0.84  % (6597)Refutation not found, incomplete strategy% (6597)------------------------------
% 0.63/0.84  % (6597)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.84  % (6597)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.84  
% 0.63/0.84  % (6597)Memory used [KB]: 1306
% 0.63/0.84  % (6597)Time elapsed: 0.004 s
% 0.63/0.84  % (6597)Instructions burned: 11 (million)
% 0.63/0.84  % (6597)------------------------------
% 0.63/0.84  % (6597)------------------------------
% 0.63/0.84  % (6587)Also succeeded, but the first one will report.
% 0.63/0.84  % (6596)First to succeed.
% 0.63/0.84  % (6596)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6550"
% 0.63/0.84  % (6601)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.63/0.84  % (6596)Refutation found. Thanks to Tanya!
% 0.63/0.84  % SZS status Theorem for Vampire---4
% 0.63/0.84  % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.84  % (6596)------------------------------
% 0.63/0.84  % (6596)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.84  % (6596)Termination reason: Refutation
% 0.63/0.84  
% 0.63/0.84  % (6596)Memory used [KB]: 1294
% 0.63/0.84  % (6596)Time elapsed: 0.006 s
% 0.63/0.84  % (6596)Instructions burned: 18 (million)
% 0.63/0.84  % (6550)Success in time 0.473 s
% 0.63/0.84  % Vampire---4.8 exiting
%------------------------------------------------------------------------------