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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV163+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n029.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:03:04 EDT 2023

% Result   : Theorem 10.31s 3.34s
% Output   : CNFRefutation 10.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   75
% Syntax   : Number of formulae    :   86 (  10 unt;  70 typ;   0 def)
%            Number of atoms       :   30 (   4 equ)
%            Maximal formula atoms :    8 (   1 avg)
%            Number of connectives :   24 (  10   ~;   4   |;   5   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    7 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :  165 (  52   >; 113   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   2 prp; 0-2 aty)
%            Number of functors    :   65 (  65 usr;  17 con; 0-8 aty)
%            Number of variables   :   16 (;  16   !;   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 > times > plus > minus > divide > dim > a_select2 > #nlpp > trans > succ > sqrt > pred > inv > x > use > true > tptp_sum_index > tptp_minus_1 > tptp_float_0_0 > q > pv10 > n5 > n4 > n3 > n2 > n135299 > n1 > n0 > def > center > #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_28 > #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(times,type,
    times: ( $i * $i ) > $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(n135299,type,
    n135299: $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(x,type,
    x: $i ).

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

tff('#skF_21',type,
    '#skF_21': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $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('#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(pv10,type,
    pv10: $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(n0,type,
    n0: $i ).

tff(sqrt,type,
    sqrt: $i > $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(tptp_msub,type,
    tptp_msub: ( $i * $i ) > $i ).

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

tff('#skF_9',type,
    '#skF_9': ( $i * $i * $i ) > $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(q,type,
    q: $i ).

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

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

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

tff('#skF_28',type,
    '#skF_28': $i ).

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

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

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

tff(center,type,
    center: $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(minus,type,
    minus: ( $i * $i ) > $i ).

tff(f_497,negated_conjecture,
    ~ ( ( leq(n0,pv10)
        & leq(pv10,n135299)
        & ! [A] :
            ( ( leq(n0,A)
              & leq(A,pred(pv10)) )
           => ( sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1 ) ) )
     => ! [B] :
          ( ( leq(n0,B)
            & leq(B,tptp_minus_1) )
         => ( a_select3(q,pv10,B) = divide(sqrt(times(minus(a_select3(center,B,n0),a_select2(x,pv10)),minus(a_select3(center,B,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0013) ).

tff(f_79,axiom,
    ! [X,Y,Z] :
      ( ( leq(X,Y)
        & leq(Y,Z) )
     => leq(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).

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

tff(f_115,axiom,
    ! [X,Y] :
      ( leq(X,Y)
    <=> gt(succ(Y),X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).

tff(f_70,axiom,
    ! [X] : ~ gt(X,X),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).

tff(c_516,plain,
    leq(n0,'#skF_28'),
    inference(cnfTransformation,[status(thm)],[f_497]) ).

tff(c_514,plain,
    leq('#skF_28',tptp_minus_1),
    inference(cnfTransformation,[status(thm)],[f_497]) ).

tff(c_3773,plain,
    ! [X_275,Z_276,Y_277] :
      ( leq(X_275,Z_276)
      | ~ leq(Y_277,Z_276)
      | ~ leq(X_275,Y_277) ),
    inference(cnfTransformation,[status(thm)],[f_79]) ).

tff(c_3981,plain,
    ! [X_284] :
      ( leq(X_284,tptp_minus_1)
      | ~ leq(X_284,'#skF_28') ),
    inference(resolution,[status(thm)],[c_514,c_3773]) ).

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

tff(c_2285,plain,
    ! [Y_245,X_246] :
      ( gt(succ(Y_245),X_246)
      | ~ leq(X_246,Y_245) ),
    inference(cnfTransformation,[status(thm)],[f_115]) ).

tff(c_6,plain,
    ! [X_6] : ~ gt(X_6,X_6),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_2334,plain,
    ! [Y_247] : ~ leq(succ(Y_247),Y_247),
    inference(resolution,[status(thm)],[c_2285,c_6]) ).

tff(c_2393,plain,
    ~ leq(n0,tptp_minus_1),
    inference(superposition,[status(thm),theory(equality)],[c_448,c_2334]) ).

tff(c_4000,plain,
    ~ leq(n0,'#skF_28'),
    inference(resolution,[status(thm)],[c_3981,c_2393]) ).

tff(c_4021,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_516,c_4000]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWV163+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.14  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35  % Computer : n029.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 : Thu Aug  3 22:47:53 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 10.31/3.34  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.31/3.34  
% 10.31/3.34  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 10.31/3.37  
% 10.31/3.37  Inference rules
% 10.31/3.37  ----------------------
% 10.31/3.37  #Ref     : 0
% 10.31/3.37  #Sup     : 888
% 10.31/3.37  #Fact    : 2
% 10.31/3.37  #Define  : 0
% 10.31/3.37  #Split   : 4
% 10.31/3.37  #Chain   : 0
% 10.31/3.37  #Close   : 0
% 10.31/3.37  
% 10.31/3.37  Ordering : KBO
% 10.31/3.37  
% 10.31/3.37  Simplification rules
% 10.31/3.37  ----------------------
% 10.31/3.37  #Subsume      : 66
% 10.31/3.37  #Demod        : 456
% 10.31/3.37  #Tautology    : 311
% 10.31/3.37  #SimpNegUnit  : 4
% 10.31/3.37  #BackRed      : 99
% 10.31/3.37  
% 10.31/3.37  #Partial instantiations: 0
% 10.31/3.37  #Strategies tried      : 1
% 10.31/3.37  
% 10.31/3.37  Timing (in seconds)
% 10.31/3.37  ----------------------
% 10.31/3.37  Preprocessing        : 0.93
% 10.31/3.37  Parsing              : 0.37
% 10.31/3.37  CNF conversion       : 0.07
% 10.31/3.37  Main loop            : 1.37
% 10.31/3.38  Inferencing          : 0.30
% 10.31/3.38  Reduction            : 0.55
% 10.31/3.38  Demodulation         : 0.39
% 10.31/3.38  BG Simplification    : 0.11
% 10.31/3.38  Subsumption          : 0.33
% 10.31/3.38  Abstraction          : 0.07
% 10.51/3.38  MUC search           : 0.00
% 10.51/3.38  Cooper               : 0.00
% 10.51/3.38  Total                : 2.35
% 10.51/3.38  Index Insertion      : 0.00
% 10.51/3.38  Index Deletion       : 0.00
% 10.51/3.38  Index Matching       : 0.00
% 10.51/3.38  BG Taut test         : 0.00
%------------------------------------------------------------------------------