TSTP Solution File: NUM544+2 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUM544+2 : 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 : 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 10:52:03 EDT 2023

% Result   : Theorem 7.85s 2.88s
% Output   : CNFRefutation 7.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   37
% Syntax   : Number of formulae    :   56 (  11 unt;  33 typ;   1 def)
%            Number of atoms       :   66 (   7 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   69 (  26   ~;  21   |;  10   &)
%                                         (   3 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   47 (  27   >;  20   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :   25 (  25 usr;   6 con; 0-3 aty)
%            Number of variables   :   18 (;  17   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aElement0 > sdtpldt0 > sdtmndt0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > slbdtrb0 > sbrdtbr0 > xS > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_6 > #skF_1 > #skF_4 > #skF_12 > #skF_14 > #skF_13 > #skF_5 > #skF_10 > #skF_8 > #skF_3 > #skF_2 > #skF_9

%Foreground sorts:

%Background operators:

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

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

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

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

tff(szszuzczcdt0,type,
    szszuzczcdt0: $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(aElement0,type,
    aElement0: $i > $o ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_498,negated_conjecture,
    ~ ( ~ ( ~ ? [W0] : aElementOf0(W0,xS)
          | ( xS = slcrc0 ) )
     => ( ( aElementOf0(szmzazxdt0(xS),xS)
          & ! [W0] :
              ( aElementOf0(W0,xS)
             => sdtlseqdt0(W0,szmzazxdt0(xS)) ) )
       => ( ( aSet0(slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
            & ! [W0] :
                ( aElementOf0(W0,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
              <=> ( aElementOf0(W0,szNzAzT0)
                  & sdtlseqdt0(szszuzczcdt0(W0),szszuzczcdt0(szmzazxdt0(xS))) ) ) )
         => ( ! [W0] :
                ( aElementOf0(W0,xS)
               => aElementOf0(W0,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) )
            | aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

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

tff(f_405,definition,
    ! [W0] :
      ( ( aSubsetOf0(W0,szNzAzT0)
        & isFinite0(W0)
        & ( W0 != slcrc0 ) )
     => ! [W1] :
          ( ( W1 = szmzazxdt0(W0) )
        <=> ( aElementOf0(W1,W0)
            & ! [W2] :
                ( aElementOf0(W2,W0)
               => sdtlseqdt0(W2,W1) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefMax) ).

tff(f_265,axiom,
    ! [W0,W1] :
      ( ( aElementOf0(W0,szNzAzT0)
        & aElementOf0(W1,szNzAzT0) )
     => ( sdtlseqdt0(W0,W1)
      <=> sdtlseqdt0(szszuzczcdt0(W0),szszuzczcdt0(W1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccLess) ).

tff(c_242,plain,
    xS != slcrc0,
    inference(cnfTransformation,[status(thm)],[f_498]) ).

tff(c_222,plain,
    aSubsetOf0(xS,szNzAzT0),
    inference(cnfTransformation,[status(thm)],[f_468]) ).

tff(c_220,plain,
    isFinite0(xS),
    inference(cnfTransformation,[status(thm)],[f_468]) ).

tff(c_232,plain,
    aElementOf0('#skF_14',xS),
    inference(cnfTransformation,[status(thm)],[f_498]) ).

tff(c_176,plain,
    ! [W2_130,W0_121] :
      ( sdtlseqdt0(W2_130,szmzazxdt0(W0_121))
      | ~ aElementOf0(W2_130,W0_121)
      | ( slcrc0 = W0_121 )
      | ~ isFinite0(W0_121)
      | ~ aSubsetOf0(W0_121,szNzAzT0) ),
    inference(cnfTransformation,[status(thm)],[f_405]) ).

tff(c_274,plain,
    ! [W0_155] :
      ( aElementOf0(W0_155,szNzAzT0)
      | ~ aElementOf0(W0_155,xS) ),
    inference(cnfTransformation,[status(thm)],[f_468]) ).

tff(c_286,plain,
    aElementOf0('#skF_14',szNzAzT0),
    inference(resolution,[status(thm)],[c_232,c_274]) ).

tff(c_240,plain,
    aElementOf0(szmzazxdt0(xS),xS),
    inference(cnfTransformation,[status(thm)],[f_498]) ).

tff(c_284,plain,
    aElementOf0(szmzazxdt0(xS),szNzAzT0),
    inference(resolution,[status(thm)],[c_240,c_274]) ).

tff(c_3335,plain,
    ! [W0_348,W1_349] :
      ( sdtlseqdt0(szszuzczcdt0(W0_348),szszuzczcdt0(W1_349))
      | ~ sdtlseqdt0(W0_348,W1_349)
      | ~ aElementOf0(W1_349,szNzAzT0)
      | ~ aElementOf0(W0_348,szNzAzT0) ),
    inference(cnfTransformation,[status(thm)],[f_265]) ).

tff(c_234,plain,
    ! [W0_150] :
      ( aElementOf0(W0_150,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
      | ~ sdtlseqdt0(szszuzczcdt0(W0_150),szszuzczcdt0(szmzazxdt0(xS)))
      | ~ aElementOf0(W0_150,szNzAzT0) ),
    inference(cnfTransformation,[status(thm)],[f_498]) ).

tff(c_3339,plain,
    ! [W0_348] :
      ( aElementOf0(W0_348,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
      | ~ sdtlseqdt0(W0_348,szmzazxdt0(xS))
      | ~ aElementOf0(szmzazxdt0(xS),szNzAzT0)
      | ~ aElementOf0(W0_348,szNzAzT0) ),
    inference(resolution,[status(thm)],[c_3335,c_234]) ).

tff(c_3512,plain,
    ! [W0_353] :
      ( aElementOf0(W0_353,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
      | ~ sdtlseqdt0(W0_353,szmzazxdt0(xS))
      | ~ aElementOf0(W0_353,szNzAzT0) ),
    inference(demodulation,[status(thm),theory(equality)],[c_284,c_3339]) ).

tff(c_230,plain,
    ~ aElementOf0('#skF_14',slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))),
    inference(cnfTransformation,[status(thm)],[f_498]) ).

tff(c_3533,plain,
    ( ~ sdtlseqdt0('#skF_14',szmzazxdt0(xS))
    | ~ aElementOf0('#skF_14',szNzAzT0) ),
    inference(resolution,[status(thm)],[c_3512,c_230]) ).

tff(c_3548,plain,
    ~ sdtlseqdt0('#skF_14',szmzazxdt0(xS)),
    inference(demodulation,[status(thm),theory(equality)],[c_286,c_3533]) ).

tff(c_3551,plain,
    ( ~ aElementOf0('#skF_14',xS)
    | ( xS = slcrc0 )
    | ~ isFinite0(xS)
    | ~ aSubsetOf0(xS,szNzAzT0) ),
    inference(resolution,[status(thm)],[c_176,c_3548]) ).

tff(c_3557,plain,
    xS = slcrc0,
    inference(demodulation,[status(thm),theory(equality)],[c_222,c_220,c_232,c_3551]) ).

tff(c_3559,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_242,c_3557]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : NUM544+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/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.14/0.35  % Computer : n009.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 14:20:38 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 7.85/2.88  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.85/2.88  
% 7.85/2.88  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.85/2.91  
% 7.85/2.91  Inference rules
% 7.85/2.91  ----------------------
% 7.85/2.91  #Ref     : 3
% 7.85/2.91  #Sup     : 586
% 7.85/2.91  #Fact    : 0
% 7.85/2.91  #Define  : 0
% 7.85/2.91  #Split   : 18
% 7.85/2.91  #Chain   : 0
% 7.85/2.91  #Close   : 0
% 7.85/2.91  
% 7.85/2.91  Ordering : KBO
% 7.85/2.91  
% 7.85/2.91  Simplification rules
% 7.85/2.91  ----------------------
% 7.85/2.91  #Subsume      : 110
% 7.85/2.91  #Demod        : 562
% 7.85/2.91  #Tautology    : 219
% 7.85/2.91  #SimpNegUnit  : 23
% 7.85/2.91  #BackRed      : 52
% 7.85/2.91  
% 7.85/2.91  #Partial instantiations: 0
% 7.85/2.91  #Strategies tried      : 1
% 7.85/2.91  
% 7.85/2.91  Timing (in seconds)
% 7.85/2.91  ----------------------
% 7.85/2.91  Preprocessing        : 0.73
% 7.85/2.91  Parsing              : 0.36
% 7.85/2.91  CNF conversion       : 0.07
% 7.85/2.91  Main loop            : 1.12
% 7.85/2.91  Inferencing          : 0.43
% 7.85/2.91  Reduction            : 0.33
% 7.85/2.91  Demodulation         : 0.22
% 7.85/2.91  BG Simplification    : 0.06
% 7.85/2.91  Subsumption          : 0.24
% 7.85/2.91  Abstraction          : 0.04
% 7.85/2.91  MUC search           : 0.00
% 7.85/2.92  Cooper               : 0.00
% 7.85/2.92  Total                : 1.90
% 7.85/2.92  Index Insertion      : 0.00
% 7.85/2.92  Index Deletion       : 0.00
% 7.85/2.92  Index Matching       : 0.00
% 7.85/2.92  BG Taut test         : 0.00
%------------------------------------------------------------------------------