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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUM634+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 : n003.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:25 EDT 2023

% Result   : Theorem 10.15s 3.36s
% Output   : CNFRefutation 10.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   70
% Syntax   : Number of formulae    :   73 (   5 unt;  68 typ;   0 def)
%            Number of atoms       :    5 (   4 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :  130 (  61   >;  69   *;   0   +;   0  <<)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-2 aty)
%            Number of functors    :   59 (  59 usr;   7 con; 0-4 aty)
%            Number of variables   :    0 (;   0   !;   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 > xc > xT > xS > xK > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_37 > #skF_11 > #skF_17 > #skF_31 > #skF_33 > #skF_6 > #skF_1 > #skF_18 > #skF_38 > #skF_4 > #skF_29 > #skF_12 > #skF_30 > #skF_32 > #skF_23 > #skF_35 > #skF_5 > #skF_19 > #skF_10 > #skF_8 > #skF_20 > #skF_28 > #skF_26 > #skF_24 > #skF_34 > #skF_15 > #skF_13 > #skF_14 > #skF_25 > #skF_3 > #skF_2 > #skF_27 > #skF_36 > #skF_21 > #skF_9 > #skF_22 > #skF_16

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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('#skF_29',type,
    '#skF_29': ( $i * $i * $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('#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_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_8',type,
    '#skF_8': ( $i * $i ) > $i ).

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

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

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

tff(slcrc0,type,
    slcrc0: $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(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(szmzazxdt0,type,
    szmzazxdt0: $i > $i ).

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

tff(xK,type,
    xK: $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(f_822,hypothesis,
    xK != sz00,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3520) ).

tff(f_819,hypothesis,
    xK != sz00,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3462) ).

tff(c_8316,plain,
    xK = sz00,
    inference(cnfTransformation,[status(thm)],[f_822]) ).

tff(c_8314,plain,
    xK != sz00,
    inference(cnfTransformation,[status(thm)],[f_819]) ).

tff(c_8360,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_8316,c_8314]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : NUM634+3 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.14  % 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.15/0.36  % Computer : n003.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 : Thu Aug  3 14:57:38 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 10.15/3.36  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.15/3.36  
% 10.15/3.36  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.15/3.38  
% 10.15/3.38  Inference rules
% 10.15/3.38  ----------------------
% 10.15/3.38  #Ref     : 0
% 10.15/3.38  #Sup     : 0
% 10.15/3.38  #Fact    : 0
% 10.15/3.39  #Define  : 0
% 10.15/3.39  #Split   : 0
% 10.15/3.39  #Chain   : 0
% 10.15/3.39  #Close   : 0
% 10.15/3.39  
% 10.15/3.39  Ordering : KBO
% 10.15/3.39  
% 10.15/3.39  Simplification rules
% 10.15/3.39  ----------------------
% 10.15/3.39  #Subsume      : 4168
% 10.15/3.39  #Demod        : 7
% 10.15/3.39  #Tautology    : 7
% 10.15/3.39  #SimpNegUnit  : 0
% 10.15/3.39  #BackRed      : 0
% 10.15/3.39  
% 10.15/3.39  #Partial instantiations: 0
% 10.15/3.39  #Strategies tried      : 1
% 10.15/3.39  
% 10.15/3.39  Timing (in seconds)
% 10.15/3.39  ----------------------
% 10.15/3.39  Preprocessing        : 2.04
% 10.15/3.39  Parsing              : 0.43
% 10.15/3.39  CNF conversion       : 0.16
% 10.15/3.39  Main loop            : 0.19
% 10.15/3.39  Inferencing          : 0.00
% 10.15/3.39  Reduction            : 0.07
% 10.15/3.39  Demodulation         : 0.05
% 10.15/3.39  BG Simplification    : 0.66
% 10.15/3.39  Subsumption          : 0.08
% 10.15/3.39  Abstraction          : 0.15
% 10.15/3.39  MUC search           : 0.00
% 10.15/3.39  Cooper               : 0.00
% 10.15/3.39  Total                : 2.28
% 10.15/3.39  Index Insertion      : 0.00
% 10.15/3.39  Index Deletion       : 0.00
% 10.15/3.39  Index Matching       : 0.00
% 10.15/3.39  BG Taut test         : 0.00
%------------------------------------------------------------------------------