TSTP Solution File: SWW498_5 by Vampire-SAT---4.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.9
% Problem  : SWW498_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire %s %d SAT

% Computer : n007.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 : Mon Jun 24 18:53:26 EDT 2024

% Result   : Theorem 0.23s 0.47s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   36 (  24 unt;   0 typ;   0 def)
%            Number of atoms       :   48 (  18 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   23 (  11   ~;   6   |;   0   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-3 aty)
%            Number of variables   :   35 (  35   !;   0   ?;  35   :)

% 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(func_def_0,type,
    fundam1563812824_csqrt: complex > complex ).

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

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

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

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

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

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

tff(func_def_7,type,
    min: int ).

tff(func_def_8,type,
    pls: int ).

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

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

tff(func_def_11,type,
    fFalse: bool ).

tff(func_def_12,type,
    fTrue: bool ).

tff(func_def_13,type,
    x: real ).

tff(func_def_14,type,
    y: real ).

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

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

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

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

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

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

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

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

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

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

tff(f1123,plain,
    $false,
    inference(resolution,[],[f1122,f676]) ).

tff(f676,plain,
    ~ ord_less_eq(real,power_power(real,times_times(real,x,number_number_of(real,bit0(bit1(pls)))),number_number_of(nat,bit0(bit1(pls)))),one_one(real)),
    inference(backward_demodulation,[],[f454,f670]) ).

tff(f670,plain,
    ! [X0: real,X1: real] : ( times_times(real,X0,X1) = times_times(real,X1,X0) ),
    inference(resolution,[],[f367,f311]) ).

tff(f311,plain,
    comm_semiring_1(real),
    inference(cnf_transformation,[],[f112]) ).

tff(f112,axiom,
    comm_semiring_1(real),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

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

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

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

tff(f81,axiom,
    ! [X0: $tType] :
      ( comm_semiring_1(X0)
     => ! [X29: X0,X7: X0] : ( times_times(X0,X7,X29) = times_times(X0,X29,X7) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

tff(f454,plain,
    ~ ord_less_eq(real,power_power(real,times_times(real,number_number_of(real,bit0(bit1(pls))),x),number_number_of(nat,bit0(bit1(pls)))),one_one(real)),
    inference(backward_demodulation,[],[f282,f341]) ).

tff(f341,plain,
    ! [X0: real] : ( times_times(real,number_number_of(real,bit0(bit0(bit1(pls)))),power_power(real,X0,number_number_of(nat,bit0(bit1(pls))))) = power_power(real,times_times(real,number_number_of(real,bit0(bit1(pls))),X0),number_number_of(nat,bit0(bit1(pls)))) ),
    inference(cnf_transformation,[],[f138]) ).

tff(f138,plain,
    ! [X0: real] : ( times_times(real,number_number_of(real,bit0(bit0(bit1(pls)))),power_power(real,X0,number_number_of(nat,bit0(bit1(pls))))) = power_power(real,times_times(real,number_number_of(real,bit0(bit1(pls))),X0),number_number_of(nat,bit0(bit1(pls)))) ),
    inference(rectify,[],[f12]) ).

tff(f12,axiom,
    ! [X5: real] : ( times_times(real,number_number_of(real,bit0(bit0(bit1(pls)))),power_power(real,X5,number_number_of(nat,bit0(bit1(pls))))) = power_power(real,times_times(real,number_number_of(real,bit0(bit1(pls))),X5),number_number_of(nat,bit0(bit1(pls)))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

tff(f282,plain,
    ~ ord_less_eq(real,times_times(real,number_number_of(real,bit0(bit0(bit1(pls)))),power_power(real,x,number_number_of(nat,bit0(bit1(pls))))),one_one(real)),
    inference(cnf_transformation,[],[f130]) ).

tff(f130,plain,
    ~ ord_less_eq(real,times_times(real,number_number_of(real,bit0(bit0(bit1(pls)))),power_power(real,x,number_number_of(nat,bit0(bit1(pls))))),one_one(real)),
    inference(flattening,[],[f129]) ).

tff(f129,negated_conjecture,
    ~ ord_less_eq(real,times_times(real,number_number_of(real,bit0(bit0(bit1(pls)))),power_power(real,x,number_number_of(nat,bit0(bit1(pls))))),one_one(real)),
    inference(negated_conjecture,[],[f128]) ).

tff(f128,conjecture,
    ord_less_eq(real,times_times(real,number_number_of(real,bit0(bit0(bit1(pls)))),power_power(real,x,number_number_of(nat,bit0(bit1(pls))))),one_one(real)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

tff(f1122,plain,
    ord_less_eq(real,power_power(real,times_times(real,x,number_number_of(real,bit0(bit1(pls)))),number_number_of(nat,bit0(bit1(pls)))),one_one(real)),
    inference(backward_demodulation,[],[f675,f1119]) ).

tff(f1119,plain,
    ! [X0: real] : ( power_power(real,X0,number_number_of(nat,bit0(bit1(pls)))) = power_power(real,abs_abs(real,X0),number_number_of(nat,bit0(bit1(pls)))) ),
    inference(resolution,[],[f345,f285]) ).

tff(f285,plain,
    linordered_idom(real),
    inference(cnf_transformation,[],[f111]) ).

tff(f111,axiom,
    linordered_idom(real),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

tff(f345,plain,
    ! [X0: $tType,X1: X0] :
      ( ~ linordered_idom(X0)
      | ( power_power(X0,X1,number_number_of(nat,bit0(bit1(pls)))) = power_power(X0,abs_abs(X0,X1),number_number_of(nat,bit0(bit1(pls)))) ) ),
    inference(cnf_transformation,[],[f204]) ).

tff(f204,plain,
    ! [X0: $tType] :
      ( ! [X1: X0] : ( power_power(X0,X1,number_number_of(nat,bit0(bit1(pls)))) = power_power(X0,abs_abs(X0,X1),number_number_of(nat,bit0(bit1(pls)))) )
      | ~ linordered_idom(X0) ),
    inference(ennf_transformation,[],[f141]) ).

tff(f141,plain,
    ! [X0: $tType] :
      ( linordered_idom(X0)
     => ! [X1: X0] : ( power_power(X0,X1,number_number_of(nat,bit0(bit1(pls)))) = power_power(X0,abs_abs(X0,X1),number_number_of(nat,bit0(bit1(pls)))) ) ),
    inference(rectify,[],[f58]) ).

tff(f58,axiom,
    ! [X0: $tType] :
      ( linordered_idom(X0)
     => ! [X7: X0] : ( power_power(X0,X7,number_number_of(nat,bit0(bit1(pls)))) = power_power(X0,abs_abs(X0,X7),number_number_of(nat,bit0(bit1(pls)))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

tff(f675,plain,
    ord_less_eq(real,power_power(real,abs_abs(real,times_times(real,x,number_number_of(real,bit0(bit1(pls))))),number_number_of(nat,bit0(bit1(pls)))),one_one(real)),
    inference(backward_demodulation,[],[f575,f670]) ).

tff(f575,plain,
    ord_less_eq(real,power_power(real,abs_abs(real,times_times(real,number_number_of(real,bit0(bit1(pls))),x)),number_number_of(nat,bit0(bit1(pls)))),one_one(real)),
    inference(backward_demodulation,[],[f333,f574]) ).

tff(f574,plain,
    ! [X0: nat] : ( one_one(real) = power_power(real,one_one(real),X0) ),
    inference(resolution,[],[f359,f307]) ).

tff(f307,plain,
    monoid_mult(real),
    inference(cnf_transformation,[],[f114]) ).

tff(f114,axiom,
    monoid_mult(real),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

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

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

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

tff(f96,axiom,
    ! [X0: $tType] :
      ( monoid_mult(X0)
     => ! [X6: nat] : ( one_one(X0) = power_power(X0,one_one(X0),X6) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

tff(f333,plain,
    ord_less_eq(real,power_power(real,abs_abs(real,times_times(real,number_number_of(real,bit0(bit1(pls))),x)),number_number_of(nat,bit0(bit1(pls)))),power_power(real,one_one(real),number_number_of(nat,bit0(bit1(pls))))),
    inference(cnf_transformation,[],[f2]) ).

tff(f2,axiom,
    ord_less_eq(real,power_power(real,abs_abs(real,times_times(real,number_number_of(real,bit0(bit1(pls))),x)),number_number_of(nat,bit0(bit1(pls)))),power_power(real,one_one(real),number_number_of(nat,bit0(bit1(pls))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWW498_5 : TPTP v8.2.0. Released v6.0.0.
% 0.03/0.12  % Command    : run_vampire %s %d SAT
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Wed Jun 19 04:20:24 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.21/0.36  This is a TF1_THM_EQU_NAR problem
% 0.21/0.37  Running first-order model finding
% 0.21/0.37  Running /export/starexec/sandbox/solver/bin/vampire --mode casc_sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.44  % (19666)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.44  % (19671)ott+21_1:1_sil=4000:i=104:fsd=on:fd=off:newcnf=on_0 on theBenchmark for (2999ds/104Mi)
% 0.21/0.44  % (19671)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.23/0.44  % (19666)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44  % (19667)fmb+10_1:1_sil=256000:i=98885:tgt=full:fmbsr=1.3:fmbss=10_0 on theBenchmark for (2999ds/98885Mi)
% 0.23/0.44  % (19666)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44  % (19672)ott+11_8:59_sil=16000:sp=occurrence:lsd=20:abs=on:i=146:aac=none:nm=16:fdi=10:rawr=on:nicw=on_0 on theBenchmark for (2999ds/146Mi)
% 0.23/0.44  % (19666)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44  % (19670)fmb+10_1:1_sil=256000:fmbss=23:fmbes=contour:newcnf=on:fmbsr=1.14:i=152523:nm=2:gsp=on:rp=on_0 on theBenchmark for (2999ds/152523Mi)
% 0.23/0.44  % (19670)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.23/0.44  % (19666)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44  % (19669)fmb+10_1:1_sil=256000:fmbes=contour:i=214858:bce=on_0 on theBenchmark for (2999ds/214858Mi)
% 0.23/0.44  % Exception at run slice level
% 0.23/0.44  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.45  % (19666)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.45  % (19673)ott-4_1:1_sil=4000:sp=reverse_arity:lcm=predicate:newcnf=on:i=115:bce=on:fd=off:fs=off:fsr=off_0 on theBenchmark for (2999ds/115Mi)
% 0.23/0.45  % (19666)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.45  % (19668)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:i=99418_0 on theBenchmark for (2999ds/99418Mi)
% 0.23/0.45  % (19670)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.23/0.45  % (19673)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.23/0.45  % Exception at run slice level
% 0.23/0.45  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.45  % Exception at run slice level
% 0.23/0.45  User error: Immediate (shared) subterms of  term/literal number_number_of(min,X0) have different types/not well-typed!
% 0.23/0.45  % Exception at run slice level
% 0.23/0.45  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.46  % (19673)First to succeed.
% 0.23/0.46  % (19673)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-19666"
% 0.23/0.46  % (19671)Also succeeded, but the first one will report.
% 0.23/0.47  % (19666)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.47  % (19673)Refutation found. Thanks to Tanya!
% 0.23/0.47  % SZS status Theorem for theBenchmark
% 0.23/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.47  % (19673)------------------------------
% 0.23/0.47  % (19673)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.23/0.47  % (19673)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.23/0.47  % (19673)Termination reason: Refutation
% 0.23/0.47  
% 0.23/0.47  % (19673)Memory used [KB]: 1209
% 0.23/0.47  % (19673)Time elapsed: 0.021 s
% 0.23/0.47  % (19673)Instructions burned: 32 (million)
% 0.23/0.47  % (19673)------------------------------
% 0.23/0.47  % (19673)------------------------------
% 0.23/0.47  % (19666)Success in time 0.084 s
%------------------------------------------------------------------------------