TSTP Solution File: NUM604+3 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUM604+3 : TPTP v8.1.2. Released v4.0.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 : 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 : Tue Aug 22 10:52:17 EDT 2023

% Result   : Theorem 81.62s 66.05s
% Output   : CNFRefutation 81.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   96
% Syntax   : Number of formulae    :  104 (   6 unt;  92 typ;   0 def)
%            Number of atoms       :   24 (   4 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   17 (   5   ~;   3   |;   6   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :  154 (  76   >;  78   *;   0   +;   0  <<)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-2 aty)
%            Number of functors    :   83 (  83 usr;  16 con; 0-4 aty)
%            Number of variables   :    5 (;   5   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aFunction0 > aElement0 > slbdtsldtrb0 > sdtpldt0 > sdtmndt0 > sdtlpdtrp0 > sdtlcdtrc0 > sdtlbdtrb0 > sdtexdt0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > szDzozmdt0 > szDzizrdt0 > slbdtrb0 > sbrdtbr0 > xx > xk > xi > xe > xd > xc > xT > xS > xO > xN > xK > xC > szNzAzT0 > sz00 > slcrc0 > #skF_53 > #skF_47 > #skF_7 > #skF_11 > #skF_41 > #skF_17 > #skF_31 > #skF_33 > #skF_44 > #skF_6 > #skF_1 > #skF_18 > #skF_37 > #skF_54 > #skF_38 > #skF_4 > #skF_29 > #skF_52 > #skF_12 > #skF_30 > #skF_32 > #skF_23 > #skF_35 > #skF_5 > #skF_49 > #skF_19 > #skF_10 > #skF_42 > #skF_8 > #skF_20 > #skF_28 > #skF_26 > #skF_24 > #skF_34 > #skF_15 > #skF_13 > #skF_14 > #skF_50 > #skF_25 > #skF_3 > #skF_2 > #skF_48 > #skF_40 > #skF_27 > #skF_36 > #skF_43 > #skF_46 > #skF_21 > #skF_45 > #skF_9 > #skF_22 > #skF_16 > #skF_51 > #skF_39

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(aSet0,type,
    aSet0: $i > $o ).

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

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

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

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

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

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

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

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

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

tff(aElement0,type,
    aElement0: $i > $o ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(isCountable0,type,
    isCountable0: $i > $o ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(aFunction0,type,
    aFunction0: $i > $o ).

tff(isFinite0,type,
    isFinite0: $i > $o ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_1380,negated_conjecture,
    ~ aElementOf0(xx,xS),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

tff(f_1372,hypothesis,
    ( aElementOf0(xi,szNzAzT0)
    & ( sdtlpdtrp0(xe,xi) = xx ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5034) ).

tff(f_1276,hypothesis,
    ( aFunction0(xe)
    & ( szDzozmdt0(xe) = szNzAzT0 )
    & ! [W0] :
        ( aElementOf0(W0,szNzAzT0)
       => ( aElementOf0(sdtlpdtrp0(xe,W0),sdtlpdtrp0(xN,W0))
          & ! [W1] :
              ( aElementOf0(W1,sdtlpdtrp0(xN,W0))
             => sdtlseqdt0(sdtlpdtrp0(xe,W0),W1) )
          & ( sdtlpdtrp0(xe,W0) = szmzizndt0(sdtlpdtrp0(xN,W0)) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4660) ).

tff(f_1378,hypothesis,
    ( ! [W0] :
        ( aElementOf0(W0,sdtlpdtrp0(xN,xi))
       => aElementOf0(W0,xS) )
    & aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5045) ).

tff(c_9798,plain,
    ~ aElementOf0(xx,xS),
    inference(cnfTransformation,[status(thm)],[f_1380]) ).

tff(c_9792,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnfTransformation,[status(thm)],[f_1372]) ).

tff(c_9790,plain,
    sdtlpdtrp0(xe,xi) = xx,
    inference(cnfTransformation,[status(thm)],[f_1372]) ).

tff(c_10929,plain,
    ! [W0_889] :
      ( aElementOf0(sdtlpdtrp0(xe,W0_889),sdtlpdtrp0(xN,W0_889))
      | ~ aElementOf0(W0_889,szNzAzT0) ),
    inference(cnfTransformation,[status(thm)],[f_1276]) ).

tff(c_9796,plain,
    ! [W0_804] :
      ( aElementOf0(W0_804,xS)
      | ~ aElementOf0(W0_804,sdtlpdtrp0(xN,xi)) ),
    inference(cnfTransformation,[status(thm)],[f_1378]) ).

tff(c_10933,plain,
    ( aElementOf0(sdtlpdtrp0(xe,xi),xS)
    | ~ aElementOf0(xi,szNzAzT0) ),
    inference(resolution,[status(thm)],[c_10929,c_9796]) ).

tff(c_10954,plain,
    aElementOf0(xx,xS),
    inference(demodulation,[status(thm),theory(equality)],[c_9792,c_9790,c_10933]) ).

tff(c_10956,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_9798,c_10954]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM604+3 : TPTP v8.1.2. Released v4.0.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.17/0.34  % Computer : n004.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Thu Aug  3 14:52:56 EDT 2023
% 0.17/0.34  % CPUTime  : 
% 81.62/66.05  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 81.62/66.06  
% 81.62/66.06  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 81.99/66.08  
% 81.99/66.08  Inference rules
% 81.99/66.08  ----------------------
% 81.99/66.08  #Ref     : 0
% 81.99/66.08  #Sup     : 215
% 81.99/66.08  #Fact    : 0
% 81.99/66.08  #Define  : 0
% 81.99/66.08  #Split   : 13
% 81.99/66.08  #Chain   : 0
% 81.99/66.08  #Close   : 0
% 81.99/66.08  
% 81.99/66.08  Ordering : KBO
% 81.99/66.08  
% 81.99/66.08  Simplification rules
% 81.99/66.08  ----------------------
% 81.99/66.08  #Subsume      : 1142
% 81.99/66.08  #Demod        : 203
% 81.99/66.08  #Tautology    : 85
% 81.99/66.08  #SimpNegUnit  : 6
% 81.99/66.08  #BackRed      : 61
% 81.99/66.08  
% 81.99/66.08  #Partial instantiations: 0
% 81.99/66.08  #Strategies tried      : 1
% 81.99/66.08  
% 81.99/66.08  Timing (in seconds)
% 81.99/66.08  ----------------------
% 82.03/66.09  Preprocessing        : 2.39
% 82.03/66.09  Parsing              : 0.59
% 82.03/66.09  CNF conversion       : 0.17
% 82.03/66.09  Main loop            : 62.56
% 82.03/66.09  Inferencing          : 0.22
% 82.03/66.09  Reduction            : 45.76
% 82.03/66.09  Demodulation         : 39.60
% 82.03/66.09  BG Simplification    : 0.77
% 82.03/66.09  Subsumption          : 13.84
% 82.03/66.09  Abstraction          : 0.46
% 82.03/66.09  MUC search           : 0.00
% 82.03/66.09  Cooper               : 0.00
% 82.03/66.09  Total                : 65.00
% 82.03/66.09  Index Insertion      : 0.00
% 82.03/66.09  Index Deletion       : 0.00
% 82.03/66.09  Index Matching       : 0.00
% 82.03/66.09  BG Taut test         : 0.00
%------------------------------------------------------------------------------