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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUM582+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 : n022.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:12 EDT 2023

% Result   : Theorem 82.89s 62.98s
% Output   : CNFRefutation 82.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   81
% Syntax   : Number of formulae    :   98 (  11 unt;  73 typ;   1 def)
%            Number of atoms       :   82 (   4 equ)
%            Maximal formula atoms :   22 (   3 avg)
%            Number of connectives :   82 (  25   ~;  22   |;  20   &)
%                                         (   2 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :  129 (  61   >;  68   *;   0   +;   0  <<)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-2 aty)
%            Number of functors    :   64 (  64 usr;  12 con; 0-4 aty)
%            Number of variables   :   23 (;  23   !;   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 > xk > xi > xc > xT > xS > xQ > xN > xK > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_17 > #skF_31 > #skF_33 > #skF_6 > #skF_1 > #skF_18 > #skF_37 > #skF_38 > #skF_4 > #skF_29 > #skF_12 > #skF_30 > #skF_32 > #skF_23 > #skF_39 > #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(xk,type,
    xk: $i ).

tff('#skF_7',type,
    '#skF_7': $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('#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(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_39',type,
    '#skF_39': $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(xN,type,
    xN: $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(xQ,type,
    xQ: $i ).

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_924,hypothesis,
    aElementOf0(xi,szNzAzT0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3989) ).

tff(f_252,axiom,
    ! [W0] :
      ( aElementOf0(W0,szNzAzT0)
     => sdtlseqdt0(sz00,W0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroLess) ).

tff(f_981,negated_conjecture,
    ~ ( ! [W0] :
          ( aElementOf0(W0,sdtlpdtrp0(xN,xi))
         => aElementOf0(W0,xS) )
      | aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

tff(f_212,axiom,
    aElementOf0(sz00,szNzAzT0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).

tff(f_674,hypothesis,
    ( aSet0(xS)
    & ! [W0] :
        ( aElementOf0(W0,xS)
       => aElementOf0(W0,szNzAzT0) )
    & aSubsetOf0(xS,szNzAzT0)
    & isCountable0(xS) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).

tff(f_873,hypothesis,
    ( aFunction0(xN)
    & ( szDzozmdt0(xN) = szNzAzT0 )
    & ( sdtlpdtrp0(xN,sz00) = xS )
    & ! [W0] :
        ( aElementOf0(W0,szNzAzT0)
       => ( ( ( ( aSet0(sdtlpdtrp0(xN,W0))
                & ! [W1] :
                    ( aElementOf0(W1,sdtlpdtrp0(xN,W0))
                   => aElementOf0(W1,szNzAzT0) ) )
              | aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0) )
            & isCountable0(sdtlpdtrp0(xN,W0)) )
         => ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,W0)),sdtlpdtrp0(xN,W0))
            & ! [W1] :
                ( aElementOf0(W1,sdtlpdtrp0(xN,W0))
               => sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,W0)),W1) )
            & aSet0(sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0))))
            & ! [W1] :
                ( aElementOf0(W1,sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0))))
              <=> ( aElement0(W1)
                  & aElementOf0(W1,sdtlpdtrp0(xN,W0))
                  & ( W1 != szmzizndt0(sdtlpdtrp0(xN,W0)) ) ) )
            & aSet0(sdtlpdtrp0(xN,szszuzczcdt0(W0)))
            & ! [W1] :
                ( aElementOf0(W1,sdtlpdtrp0(xN,szszuzczcdt0(W0)))
               => aElementOf0(W1,sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0)))) )
            & aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(W0)),sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0))))
            & isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(W0))) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3623) ).

tff(f_899,hypothesis,
    ! [W0,W1] :
      ( ( aElementOf0(W0,szNzAzT0)
        & aElementOf0(W1,szNzAzT0) )
     => ( sdtlseqdt0(W1,W0)
       => ( ! [W2] :
              ( aElementOf0(W2,sdtlpdtrp0(xN,W0))
             => aElementOf0(W2,sdtlpdtrp0(xN,W1)) )
          & aSubsetOf0(sdtlpdtrp0(xN,W0),sdtlpdtrp0(xN,W1)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3754) ).

tff(f_84,definition,
    ! [W0] :
      ( aSet0(W0)
     => ! [W1] :
          ( aSubsetOf0(W1,W0)
        <=> ( aSet0(W1)
            & ! [W2] :
                ( aElementOf0(W2,W1)
               => aElementOf0(W2,W0) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).

tff(c_8416,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnfTransformation,[status(thm)],[f_924]) ).

tff(c_126,plain,
    ! [W0_80] :
      ( sdtlseqdt0(sz00,W0_80)
      | ~ aElementOf0(W0_80,szNzAzT0) ),
    inference(cnfTransformation,[status(thm)],[f_252]) ).

tff(c_8460,plain,
    ~ aElementOf0('#skF_39',xS),
    inference(cnfTransformation,[status(thm)],[f_981]) ).

tff(c_110,plain,
    aElementOf0(sz00,szNzAzT0),
    inference(cnfTransformation,[status(thm)],[f_212]) ).

tff(c_344,plain,
    aSet0(xS),
    inference(cnfTransformation,[status(thm)],[f_674]) ).

tff(c_8322,plain,
    sdtlpdtrp0(xN,sz00) = xS,
    inference(cnfTransformation,[status(thm)],[f_873]) ).

tff(c_22794,plain,
    ! [W0_1083,W1_1084] :
      ( aSubsetOf0(sdtlpdtrp0(xN,W0_1083),sdtlpdtrp0(xN,W1_1084))
      | ~ sdtlseqdt0(W1_1084,W0_1083)
      | ~ aElementOf0(W1_1084,szNzAzT0)
      | ~ aElementOf0(W0_1083,szNzAzT0) ),
    inference(cnfTransformation,[status(thm)],[f_899]) ).

tff(c_8462,plain,
    aElementOf0('#skF_39',sdtlpdtrp0(xN,xi)),
    inference(cnfTransformation,[status(thm)],[f_981]) ).

tff(c_9833,plain,
    ! [W2_703,W0_704,W1_705] :
      ( aElementOf0(W2_703,W0_704)
      | ~ aElementOf0(W2_703,W1_705)
      | ~ aSubsetOf0(W1_705,W0_704)
      | ~ aSet0(W0_704) ),
    inference(cnfTransformation,[status(thm)],[f_84]) ).

tff(c_9883,plain,
    ! [W0_704] :
      ( aElementOf0('#skF_39',W0_704)
      | ~ aSubsetOf0(sdtlpdtrp0(xN,xi),W0_704)
      | ~ aSet0(W0_704) ),
    inference(resolution,[status(thm)],[c_8462,c_9833]) ).

tff(c_22806,plain,
    ! [W1_1084] :
      ( aElementOf0('#skF_39',sdtlpdtrp0(xN,W1_1084))
      | ~ aSet0(sdtlpdtrp0(xN,W1_1084))
      | ~ sdtlseqdt0(W1_1084,xi)
      | ~ aElementOf0(W1_1084,szNzAzT0)
      | ~ aElementOf0(xi,szNzAzT0) ),
    inference(resolution,[status(thm)],[c_22794,c_9883]) ).

tff(c_22984,plain,
    ! [W1_1087] :
      ( aElementOf0('#skF_39',sdtlpdtrp0(xN,W1_1087))
      | ~ aSet0(sdtlpdtrp0(xN,W1_1087))
      | ~ sdtlseqdt0(W1_1087,xi)
      | ~ aElementOf0(W1_1087,szNzAzT0) ),
    inference(demodulation,[status(thm),theory(equality)],[c_8416,c_22806]) ).

tff(c_22997,plain,
    ( aElementOf0('#skF_39',xS)
    | ~ aSet0(sdtlpdtrp0(xN,sz00))
    | ~ sdtlseqdt0(sz00,xi)
    | ~ aElementOf0(sz00,szNzAzT0) ),
    inference(superposition,[status(thm),theory(equality)],[c_8322,c_22984]) ).

tff(c_23007,plain,
    ( aElementOf0('#skF_39',xS)
    | ~ sdtlseqdt0(sz00,xi) ),
    inference(demodulation,[status(thm),theory(equality)],[c_110,c_344,c_8322,c_22997]) ).

tff(c_23008,plain,
    ~ sdtlseqdt0(sz00,xi),
    inference(negUnitSimplification,[status(thm)],[c_8460,c_23007]) ).

tff(c_23011,plain,
    ~ aElementOf0(xi,szNzAzT0),
    inference(resolution,[status(thm)],[c_126,c_23008]) ).

tff(c_23015,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_8416,c_23011]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : NUM582+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.35  % Computer : n022.cluster.edu
% 0.17/0.35  % Model    : x86_64 x86_64
% 0.17/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35  % Memory   : 8042.1875MB
% 0.17/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35  % CPULimit : 300
% 0.17/0.35  % WCLimit  : 300
% 0.17/0.35  % DateTime : Thu Aug  3 15:09:03 EDT 2023
% 0.17/0.35  % CPUTime  : 
% 82.89/62.98  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 82.89/62.98  
% 82.89/62.98  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 82.89/63.01  
% 82.89/63.01  Inference rules
% 82.89/63.01  ----------------------
% 82.89/63.01  #Ref     : 3
% 82.89/63.01  #Sup     : 2785
% 82.89/63.01  #Fact    : 0
% 82.89/63.01  #Define  : 0
% 82.89/63.01  #Split   : 83
% 82.89/63.01  #Chain   : 0
% 82.89/63.01  #Close   : 0
% 82.89/63.01  
% 82.89/63.01  Ordering : KBO
% 82.89/63.01  
% 82.89/63.01  Simplification rules
% 82.89/63.01  ----------------------
% 82.89/63.01  #Subsume      : 1200
% 82.89/63.01  #Demod        : 2368
% 82.89/63.01  #Tautology    : 591
% 82.89/63.01  #SimpNegUnit  : 216
% 82.89/63.01  #BackRed      : 181
% 82.89/63.01  
% 82.89/63.01  #Partial instantiations: 0
% 82.89/63.01  #Strategies tried      : 1
% 82.89/63.01  
% 82.89/63.01  Timing (in seconds)
% 82.89/63.01  ----------------------
% 82.89/63.01  Preprocessing        : 2.14
% 82.89/63.01  Parsing              : 0.45
% 82.89/63.01  CNF conversion       : 0.17
% 82.89/63.01  Main loop            : 59.81
% 82.89/63.01  Inferencing          : 0.95
% 82.89/63.01  Reduction            : 44.53
% 82.89/63.01  Demodulation         : 38.58
% 82.89/63.01  BG Simplification    : 0.74
% 82.89/63.01  Subsumption          : 11.64
% 82.89/63.01  Abstraction          : 0.48
% 82.89/63.01  MUC search           : 0.00
% 82.89/63.01  Cooper               : 0.00
% 82.89/63.01  Total                : 62.00
% 82.89/63.01  Index Insertion      : 0.00
% 82.89/63.01  Index Deletion       : 0.00
% 82.89/63.01  Index Matching       : 0.00
% 82.89/63.01  BG Taut test         : 0.00
%------------------------------------------------------------------------------