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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUM555+1 : 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/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 : n015.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:06 EDT 2023

% Result   : Theorem 6.97s 2.63s
% Output   : CNFRefutation 7.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   46
% Syntax   : Number of formulae    :   54 (   8 unt;  41 typ;   1 def)
%            Number of atoms       :   28 (   3 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   25 (  10   ~;   5   |;   7   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   56 (  31   >;  25   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :   33 (  33 usr;  10 con; 0-3 aty)
%            Number of variables   :    7 (;   7   !;   0   ?;   0   :)

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

%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(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(xP,type,
    xP: $i ).

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

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

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

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

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

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

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

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

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

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

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_544,hypothesis,
    ~ aElementOf0(xx,xQ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2338) ).

tff(f_537,hypothesis,
    ( aSet0(xQ)
    & isFinite0(xQ)
    & ( sbrdtbr0(xQ) = xk ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2291) ).

tff(f_540,hypothesis,
    ( aElement0(xy)
    & aElementOf0(xy,xQ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2304) ).

tff(f_548,negated_conjecture,
    ~ ~ aElementOf0(xx,sdtmndt0(xQ,xy)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

tff(f_156,definition,
    ! [W0,W1] :
      ( ( aSet0(W0)
        & aElement0(W1) )
     => ! [W2] :
          ( ( W2 = sdtmndt0(W0,W1) )
        <=> ( aSet0(W2)
            & ! [W3] :
                ( aElementOf0(W3,W2)
              <=> ( aElement0(W3)
                  & aElementOf0(W3,W0)
                  & ( W3 != W1 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiff) ).

tff(c_280,plain,
    ~ aElementOf0(xx,xQ),
    inference(cnfTransformation,[status(thm)],[f_544]) ).

tff(c_272,plain,
    aSet0(xQ),
    inference(cnfTransformation,[status(thm)],[f_537]) ).

tff(c_276,plain,
    aElement0(xy),
    inference(cnfTransformation,[status(thm)],[f_540]) ).

tff(c_284,plain,
    aElementOf0(xx,sdtmndt0(xQ,xy)),
    inference(cnfTransformation,[status(thm)],[f_548]) ).

tff(c_1865,plain,
    ! [W3_316,W0_317,W1_318] :
      ( aElementOf0(W3_316,W0_317)
      | ~ aElementOf0(W3_316,sdtmndt0(W0_317,W1_318))
      | ~ aElement0(W1_318)
      | ~ aSet0(W0_317) ),
    inference(cnfTransformation,[status(thm)],[f_156]) ).

tff(c_1880,plain,
    ( aElementOf0(xx,xQ)
    | ~ aElement0(xy)
    | ~ aSet0(xQ) ),
    inference(resolution,[status(thm)],[c_284,c_1865]) ).

tff(c_1886,plain,
    aElementOf0(xx,xQ),
    inference(demodulation,[status(thm),theory(equality)],[c_272,c_276,c_1880]) ).

tff(c_1888,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_280,c_1886]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : NUM555+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15  % 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.36  % Computer : n015.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 14:59:59 EDT 2023
% 0.14/0.37  % CPUTime  : 
% 6.97/2.63  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.97/2.63  
% 6.97/2.63  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.08/2.65  
% 7.08/2.65  Inference rules
% 7.08/2.65  ----------------------
% 7.08/2.65  #Ref     : 0
% 7.08/2.65  #Sup     : 293
% 7.08/2.65  #Fact    : 0
% 7.08/2.65  #Define  : 0
% 7.08/2.65  #Split   : 26
% 7.08/2.65  #Chain   : 0
% 7.08/2.65  #Close   : 0
% 7.08/2.65  
% 7.08/2.65  Ordering : KBO
% 7.08/2.65  
% 7.08/2.65  Simplification rules
% 7.08/2.65  ----------------------
% 7.08/2.65  #Subsume      : 78
% 7.08/2.65  #Demod        : 269
% 7.08/2.65  #Tautology    : 96
% 7.08/2.65  #SimpNegUnit  : 23
% 7.08/2.65  #BackRed      : 61
% 7.08/2.65  
% 7.08/2.65  #Partial instantiations: 0
% 7.08/2.66  #Strategies tried      : 1
% 7.08/2.66  
% 7.08/2.66  Timing (in seconds)
% 7.08/2.66  ----------------------
% 7.08/2.66  Preprocessing        : 0.74
% 7.08/2.66  Parsing              : 0.35
% 7.08/2.66  CNF conversion       : 0.07
% 7.08/2.66  Main loop            : 0.74
% 7.08/2.66  Inferencing          : 0.23
% 7.08/2.66  Reduction            : 0.24
% 7.08/2.66  Demodulation         : 0.17
% 7.08/2.66  BG Simplification    : 0.06
% 7.08/2.66  Subsumption          : 0.16
% 7.08/2.66  Abstraction          : 0.03
% 7.08/2.66  MUC search           : 0.00
% 7.08/2.66  Cooper               : 0.00
% 7.08/2.66  Total                : 1.53
% 7.08/2.66  Index Insertion      : 0.00
% 7.08/2.66  Index Deletion       : 0.00
% 7.08/2.66  Index Matching       : 0.00
% 7.08/2.66  BG Taut test         : 0.00
%------------------------------------------------------------------------------