TSTP Solution File: SWV050+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV050+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n009.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 Aug 22 11:02:44 EDT 2023

% Result   : Theorem 7.34s 2.74s
% Output   : CNFRefutation 7.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   78
% Syntax   : Number of formulae    :   90 (  15 unt;  73 typ;   0 def)
%            Number of atoms       :   23 (  22 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   13 (   7   ~;   2   |;   3   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :  163 (  51   >; 112   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   2 prp; 0-2 aty)
%            Number of functors    :   68 (  68 usr;  21 con; 0-8 aty)
%            Number of variables   :    6 (;   6   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ lt > leq > gt > geq > tptp_update3 > tptp_update2 > tptp_const_array2 > sum > a_select3 > uniform_int_rnd > tptp_msub > tptp_mmul > tptp_madd > tptp_const_array1 > plus > minus > divide > dim > a_select2 > #nlpp > trans > succ > pred > inv > abs > use > true > tptp_minus_1 > tptp_float_0_0 > sigmaold > sigma > rhoold > rho > pv91 > pv89 > pv88 > pv87 > pv86 > n5 > n4 > n3 > n2 > n1 > n0 > muold > mu > def > #skF_13 > #skF_24 > #skF_17 > #skF_23 > #skF_6 > #skF_19 > #skF_27 > #skF_21 > #skF_25 > #skF_12 > #skF_18 > #skF_3 > #skF_26 > #skF_20 > #skF_11 > #skF_7 > #skF_9 > #skF_15 > #skF_22 > #skF_14 > #skF_2 > #skF_8 > #skF_1 > #skF_5 > #skF_4 > #skF_16 > #skF_10

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_13',type,
    '#skF_13': ( $i * $i * $i ) > $i ).

tff('#skF_24',type,
    '#skF_24': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).

tff(pv91,type,
    pv91: $i ).

tff(true,type,
    true: $o ).

tff('#skF_17',type,
    '#skF_17': ( $i * $i * $i * $i ) > $i ).

tff(tptp_const_array2,type,
    tptp_const_array2: ( $i * $i * $i ) > $i ).

tff('#skF_23',type,
    '#skF_23': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).

tff('#skF_6',type,
    '#skF_6': ( $i * $i ) > $i ).

tff(tptp_minus_1,type,
    tptp_minus_1: $i ).

tff(divide,type,
    divide: ( $i * $i ) > $i ).

tff('#skF_19',type,
    '#skF_19': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).

tff(pv87,type,
    pv87: $i ).

tff(sigmaold,type,
    sigmaold: $i ).

tff('#skF_27',type,
    '#skF_27': ( $i * $i * $i * $i ) > $i ).

tff(muold,type,
    muold: $i ).

tff('#skF_21',type,
    '#skF_21': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).

tff(rho,type,
    rho: $i ).

tff('#skF_25',type,
    '#skF_25': ( $i * $i * $i * $i * $i * $i ) > $i ).

tff('#skF_12',type,
    '#skF_12': ( $i * $i * $i ) > $i ).

tff(pv86,type,
    pv86: $i ).

tff('#skF_18',type,
    '#skF_18': ( $i * $i * $i * $i ) > $i ).

tff(a_select3,type,
    a_select3: ( $i * $i * $i ) > $i ).

tff(tptp_float_0_0,type,
    tptp_float_0_0: $i ).

tff(a_select2,type,
    a_select2: ( $i * $i ) > $i ).

tff('#skF_3',type,
    '#skF_3': ( $i * $i ) > $i ).

tff(trans,type,
    trans: $i > $i ).

tff(tptp_update3,type,
    tptp_update3: ( $i * $i * $i * $i ) > $i ).

tff(n3,type,
    n3: $i ).

tff('#skF_26',type,
    '#skF_26': ( $i * $i * $i * $i * $i * $i ) > $i ).

tff(use,type,
    use: $i ).

tff(inv,type,
    inv: $i > $i ).

tff(n1,type,
    n1: $i ).

tff(tptp_madd,type,
    tptp_madd: ( $i * $i ) > $i ).

tff(plus,type,
    plus: ( $i * $i ) > $i ).

tff('#skF_20',type,
    '#skF_20': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).

tff(abs,type,
    abs: $i > $i ).

tff(n0,type,
    n0: $i ).

tff(mu,type,
    mu: $i ).

tff('#skF_11',type,
    '#skF_11': ( $i * $i * $i ) > $i ).

tff(tptp_update2,type,
    tptp_update2: ( $i * $i * $i ) > $i ).

tff(gt,type,
    gt: ( $i * $i ) > $o ).

tff('#skF_7',type,
    '#skF_7': ( $i * $i * $i ) > $i ).

tff(n4,type,
    n4: $i ).

tff(sigma,type,
    sigma: $i ).

tff(tptp_msub,type,
    tptp_msub: ( $i * $i ) > $i ).

tff('#skF_9',type,
    '#skF_9': ( $i * $i * $i ) > $i ).

tff(rhoold,type,
    rhoold: $i ).

tff(tptp_const_array1,type,
    tptp_const_array1: ( $i * $i ) > $i ).

tff('#skF_15',type,
    '#skF_15': ( $i * $i * $i ) > $i ).

tff('#skF_22',type,
    '#skF_22': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).

tff('#skF_14',type,
    '#skF_14': ( $i * $i * $i ) > $i ).

tff(tptp_mmul,type,
    tptp_mmul: ( $i * $i ) > $i ).

tff(uniform_int_rnd,type,
    uniform_int_rnd: ( $i * $i ) > $i ).

tff(geq,type,
    geq: ( $i * $i ) > $o ).

tff(pv89,type,
    pv89: $i ).

tff(leq,type,
    leq: ( $i * $i ) > $o ).

tff(lt,type,
    lt: ( $i * $i ) > $o ).

tff('#skF_2',type,
    '#skF_2': ( $i * $i ) > $i ).

tff(def,type,
    def: $i ).

tff('#skF_8',type,
    '#skF_8': ( $i * $i * $i ) > $i ).

tff(n2,type,
    n2: $i ).

tff(n5,type,
    n5: $i ).

tff('#skF_1',type,
    '#skF_1': ( $i * $i ) > $i ).

tff(succ,type,
    succ: $i > $i ).

tff(pred,type,
    pred: $i > $i ).

tff(sum,type,
    sum: ( $i * $i * $i ) > $i ).

tff('#skF_5',type,
    '#skF_5': ( $i * $i ) > $i ).

tff('#skF_4',type,
    '#skF_4': ( $i * $i ) > $i ).

tff('#skF_16',type,
    '#skF_16': ( $i * $i * $i ) > $i ).

tff('#skF_10',type,
    '#skF_10': ( $i * $i * $i ) > $i ).

tff(dim,type,
    dim: ( $i * $i ) > $i ).

tff(pv88,type,
    pv88: $i ).

tff(minus,type,
    minus: ( $i * $i ) > $i ).

tff(f_372,axiom,
    ! [Body] : ( sum(n0,tptp_minus_1,Body) = n0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).

tff(f_377,axiom,
    succ(tptp_minus_1) = n0,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).

tff(f_401,axiom,
    ! [X] : ( pred(succ(X)) = X ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).

tff(f_399,axiom,
    ! [X] : ( minus(X,n1) = pred(X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).

tff(f_489,negated_conjecture,
    ~ ( ( ( pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))) )
        & ( pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ) )
     => ( ( n0 = sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) )
        & ( pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))) )
        & ( pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0022) ).

tff(c_444,plain,
    ! [Body_128] : ( sum(n0,tptp_minus_1,Body_128) = n0 ),
    inference(cnfTransformation,[status(thm)],[f_372]) ).

tff(c_448,plain,
    succ(tptp_minus_1) = n0,
    inference(cnfTransformation,[status(thm)],[f_377]) ).

tff(c_661,plain,
    ! [X_190] : ( pred(succ(X_190)) = X_190 ),
    inference(cnfTransformation,[status(thm)],[f_401]) ).

tff(c_682,plain,
    pred(n0) = tptp_minus_1,
    inference(superposition,[status(thm),theory(equality)],[c_448,c_661]) ).

tff(c_470,plain,
    ! [X_140] : ( minus(X_140,n1) = pred(X_140) ),
    inference(cnfTransformation,[status(thm)],[f_399]) ).

tff(c_516,plain,
    sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))) = pv86,
    inference(cnfTransformation,[status(thm)],[f_489]) ).

tff(c_514,plain,
    sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) = pv88,
    inference(cnfTransformation,[status(thm)],[f_489]) ).

tff(c_512,plain,
    ( ( sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) != pv88 )
    | ( sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))) != pv86 )
    | ( sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) != n0 ) ),
    inference(cnfTransformation,[status(thm)],[f_489]) ).

tff(c_587,plain,
    sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) != n0,
    inference(demodulation,[status(thm),theory(equality)],[c_516,c_514,c_512]) ).

tff(c_590,plain,
    sum(n0,pred(n0),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) != n0,
    inference(demodulation,[status(thm),theory(equality)],[c_470,c_587]) ).

tff(c_724,plain,
    sum(n0,tptp_minus_1,divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) != n0,
    inference(demodulation,[status(thm),theory(equality)],[c_682,c_590]) ).

tff(c_1020,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_444,c_724]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV050+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.13  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34  % Computer : n009.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 : Thu Aug  3 22:26:53 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 7.34/2.74  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.34/2.74  
% 7.34/2.74  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.34/2.77  
% 7.34/2.77  Inference rules
% 7.34/2.77  ----------------------
% 7.34/2.77  #Ref     : 0
% 7.34/2.77  #Sup     : 134
% 7.34/2.77  #Fact    : 0
% 7.34/2.77  #Define  : 0
% 7.34/2.77  #Split   : 0
% 7.34/2.77  #Chain   : 0
% 7.34/2.77  #Close   : 0
% 7.34/2.77  
% 7.34/2.77  Ordering : KBO
% 7.34/2.77  
% 7.34/2.77  Simplification rules
% 7.34/2.77  ----------------------
% 7.34/2.77  #Subsume      : 0
% 7.34/2.77  #Demod        : 63
% 7.34/2.77  #Tautology    : 101
% 7.34/2.77  #SimpNegUnit  : 0
% 7.34/2.77  #BackRed      : 3
% 7.34/2.77  
% 7.34/2.77  #Partial instantiations: 0
% 7.34/2.77  #Strategies tried      : 1
% 7.34/2.77  
% 7.34/2.77  Timing (in seconds)
% 7.34/2.77  ----------------------
% 7.34/2.77  Preprocessing        : 0.97
% 7.34/2.77  Parsing              : 0.37
% 7.34/2.77  CNF conversion       : 0.08
% 7.34/2.77  Main loop            : 0.76
% 7.34/2.77  Inferencing          : 0.12
% 7.34/2.77  Reduction            : 0.30
% 7.34/2.77  Demodulation         : 0.21
% 7.34/2.77  BG Simplification    : 0.12
% 7.34/2.77  Subsumption          : 0.22
% 7.34/2.77  Abstraction          : 0.08
% 7.34/2.77  MUC search           : 0.00
% 7.34/2.77  Cooper               : 0.00
% 7.34/2.77  Total                : 1.79
% 7.34/2.77  Index Insertion      : 0.00
% 7.34/2.77  Index Deletion       : 0.00
% 7.34/2.77  Index Matching       : 0.00
% 7.34/2.77  BG Taut test         : 0.00
%------------------------------------------------------------------------------