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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : RNG108+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/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 : n006.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:54:59 EDT 2023

% Result   : Theorem 7.50s 2.72s
% Output   : CNFRefutation 7.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   54
% Syntax   : Number of formulae    :   89 (  22 unt;  47 typ;   1 def)
%            Number of atoms       :   81 (  14 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   73 (  34   ~;  26   |;   8   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   88 (  41   >;  47   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  11 usr;   1 prp; 0-3 aty)
%            Number of functors    :   36 (  36 usr;   6 con; 0-4 aty)
%            Number of variables   :   18 (;  17   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aGcdOfAnd0 > misRelativelyPrime0 > iLess0 > doDivides0 > aElementOf0 > aDivisorOf0 > aSet0 > aNaturalNumber0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > slsdtgt0 > sbrdtbr0 > xc > xb > xa > xI > sz10 > sz00 > #skF_22 > #skF_6 > #skF_17 > #skF_20 > #skF_4 > #skF_8 > #skF_14 > #skF_15 > #skF_18 > #skF_23 > #skF_5 > #skF_19 > #skF_7 > #skF_9 > #skF_13 > #skF_11 > #skF_3 > #skF_2 > #skF_12 > #skF_1 > #skF_16 > #skF_21 > #skF_10

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_369,negated_conjecture,
    ~ ( aElementOf0(sz00,slsdtgt0(xa))
      & aElementOf0(xa,slsdtgt0(xa))
      & aElementOf0(sz00,slsdtgt0(xb))
      & aElementOf0(xb,slsdtgt0(xb)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

tff(f_352,hypothesis,
    ( aElement0(xa)
    & aElement0(xb) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).

tff(f_30,axiom,
    aElement0(sz00),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).

tff(f_115,axiom,
    ! [W0] :
      ( aElement0(W0)
     => ( ( sdtasdt0(W0,sz00) = sz00 )
        & ( sz00 = sdtasdt0(sz00,W0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulZero) ).

tff(f_345,definition,
    ! [W0] :
      ( aElement0(W0)
     => ! [W1] :
          ( ( W1 = slsdtgt0(W0) )
        <=> ( aSet0(W1)
            & ! [W2] :
                ( aElementOf0(W2,W1)
              <=> ? [W3] :
                    ( aElement0(W3)
                    & ( sdtasdt0(W0,W3) = W2 ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPrIdeal) ).

tff(f_31,axiom,
    aElement0(sz10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).

tff(f_93,axiom,
    ! [W0] :
      ( aElement0(W0)
     => ( ( sdtasdt0(W0,sz10) = W0 )
        & ( W0 = sdtasdt0(sz10,W0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulUnit) ).

tff(c_220,plain,
    ( ~ aElementOf0(xb,slsdtgt0(xb))
    | ~ aElementOf0(sz00,slsdtgt0(xb))
    | ~ aElementOf0(xa,slsdtgt0(xa))
    | ~ aElementOf0(sz00,slsdtgt0(xa)) ),
    inference(cnfTransformation,[status(thm)],[f_369]) ).

tff(c_223,plain,
    ~ aElementOf0(sz00,slsdtgt0(xa)),
    inference(splitLeft,[status(thm)],[c_220]) ).

tff(c_210,plain,
    aElement0(xa),
    inference(cnfTransformation,[status(thm)],[f_352]) ).

tff(c_4,plain,
    aElement0(sz00),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_227,plain,
    ! [W0_226] :
      ( ( sdtasdt0(W0_226,sz00) = sz00 )
      | ~ aElement0(W0_226) ),
    inference(cnfTransformation,[status(thm)],[f_115]) ).

tff(c_247,plain,
    sdtasdt0(xa,sz00) = sz00,
    inference(resolution,[status(thm)],[c_210,c_227]) ).

tff(c_1032,plain,
    ! [W0_273,W3_274] :
      ( aElementOf0(sdtasdt0(W0_273,W3_274),slsdtgt0(W0_273))
      | ~ aElement0(W3_274)
      | ~ aElement0(W0_273) ),
    inference(cnfTransformation,[status(thm)],[f_345]) ).

tff(c_1086,plain,
    ( aElementOf0(sz00,slsdtgt0(xa))
    | ~ aElement0(sz00)
    | ~ aElement0(xa) ),
    inference(superposition,[status(thm),theory(equality)],[c_247,c_1032]) ).

tff(c_1126,plain,
    aElementOf0(sz00,slsdtgt0(xa)),
    inference(demodulation,[status(thm),theory(equality)],[c_210,c_4,c_1086]) ).

tff(c_1128,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_223,c_1126]) ).

tff(c_1129,plain,
    ( ~ aElementOf0(xa,slsdtgt0(xa))
    | ~ aElementOf0(sz00,slsdtgt0(xb))
    | ~ aElementOf0(xb,slsdtgt0(xb)) ),
    inference(splitRight,[status(thm)],[c_220]) ).

tff(c_1171,plain,
    ~ aElementOf0(xb,slsdtgt0(xb)),
    inference(splitLeft,[status(thm)],[c_1129]) ).

tff(c_208,plain,
    aElement0(xb),
    inference(cnfTransformation,[status(thm)],[f_352]) ).

tff(c_6,plain,
    aElement0(sz10),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_1281,plain,
    ! [W0_282] :
      ( ( sdtasdt0(W0_282,sz10) = W0_282 )
      | ~ aElement0(W0_282) ),
    inference(cnfTransformation,[status(thm)],[f_93]) ).

tff(c_1298,plain,
    sdtasdt0(xb,sz10) = xb,
    inference(resolution,[status(thm)],[c_208,c_1281]) ).

tff(c_2180,plain,
    ! [W0_327,W3_328] :
      ( aElementOf0(sdtasdt0(W0_327,W3_328),slsdtgt0(W0_327))
      | ~ aElement0(W3_328)
      | ~ aElement0(W0_327) ),
    inference(cnfTransformation,[status(thm)],[f_345]) ).

tff(c_2231,plain,
    ( aElementOf0(xb,slsdtgt0(xb))
    | ~ aElement0(sz10)
    | ~ aElement0(xb) ),
    inference(superposition,[status(thm),theory(equality)],[c_1298,c_2180]) ).

tff(c_2281,plain,
    aElementOf0(xb,slsdtgt0(xb)),
    inference(demodulation,[status(thm),theory(equality)],[c_208,c_6,c_2231]) ).

tff(c_2283,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_1171,c_2281]) ).

tff(c_2284,plain,
    ( ~ aElementOf0(sz00,slsdtgt0(xb))
    | ~ aElementOf0(xa,slsdtgt0(xa)) ),
    inference(splitRight,[status(thm)],[c_1129]) ).

tff(c_2353,plain,
    ~ aElementOf0(xa,slsdtgt0(xa)),
    inference(splitLeft,[status(thm)],[c_2284]) ).

tff(c_2388,plain,
    ! [W0_332] :
      ( ( sdtasdt0(W0_332,sz10) = W0_332 )
      | ~ aElement0(W0_332) ),
    inference(cnfTransformation,[status(thm)],[f_93]) ).

tff(c_2409,plain,
    sdtasdt0(xa,sz10) = xa,
    inference(resolution,[status(thm)],[c_210,c_2388]) ).

tff(c_3047,plain,
    ! [W0_375,W3_376] :
      ( aElementOf0(sdtasdt0(W0_375,W3_376),slsdtgt0(W0_375))
      | ~ aElement0(W3_376)
      | ~ aElement0(W0_375) ),
    inference(cnfTransformation,[status(thm)],[f_345]) ).

tff(c_3083,plain,
    ( aElementOf0(xa,slsdtgt0(xa))
    | ~ aElement0(sz10)
    | ~ aElement0(xa) ),
    inference(superposition,[status(thm),theory(equality)],[c_2409,c_3047]) ).

tff(c_3129,plain,
    aElementOf0(xa,slsdtgt0(xa)),
    inference(demodulation,[status(thm),theory(equality)],[c_210,c_6,c_3083]) ).

tff(c_3131,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_2353,c_3129]) ).

tff(c_3132,plain,
    ~ aElementOf0(sz00,slsdtgt0(xb)),
    inference(splitRight,[status(thm)],[c_2284]) ).

tff(c_3179,plain,
    ! [W0_378] :
      ( ( sdtasdt0(W0_378,sz00) = sz00 )
      | ~ aElement0(W0_378) ),
    inference(cnfTransformation,[status(thm)],[f_115]) ).

tff(c_3196,plain,
    sdtasdt0(xb,sz00) = sz00,
    inference(resolution,[status(thm)],[c_208,c_3179]) ).

tff(c_3907,plain,
    ! [W0_420,W3_421] :
      ( aElementOf0(sdtasdt0(W0_420,W3_421),slsdtgt0(W0_420))
      | ~ aElement0(W3_421)
      | ~ aElement0(W0_420) ),
    inference(cnfTransformation,[status(thm)],[f_345]) ).

tff(c_3946,plain,
    ( aElementOf0(sz00,slsdtgt0(xb))
    | ~ aElement0(sz00)
    | ~ aElement0(xb) ),
    inference(superposition,[status(thm),theory(equality)],[c_3196,c_3907]) ).

tff(c_3991,plain,
    aElementOf0(sz00,slsdtgt0(xb)),
    inference(demodulation,[status(thm),theory(equality)],[c_208,c_4,c_3946]) ).

tff(c_3993,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_3132,c_3991]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : RNG108+1 : 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.15/0.35  % Computer : n006.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu Aug  3 18:00:13 EDT 2023
% 0.21/0.35  % CPUTime  : 
% 7.50/2.72  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.50/2.73  
% 7.50/2.73  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.50/2.76  
% 7.50/2.76  Inference rules
% 7.50/2.76  ----------------------
% 7.50/2.76  #Ref     : 0
% 7.50/2.76  #Sup     : 902
% 7.50/2.76  #Fact    : 0
% 7.50/2.76  #Define  : 0
% 7.50/2.76  #Split   : 12
% 7.50/2.76  #Chain   : 0
% 7.50/2.76  #Close   : 0
% 7.50/2.76  
% 7.50/2.76  Ordering : KBO
% 7.50/2.76  
% 7.50/2.76  Simplification rules
% 7.50/2.76  ----------------------
% 7.50/2.76  #Subsume      : 28
% 7.50/2.76  #Demod        : 634
% 7.50/2.76  #Tautology    : 486
% 7.50/2.76  #SimpNegUnit  : 4
% 7.50/2.76  #BackRed      : 0
% 7.50/2.76  
% 7.50/2.76  #Partial instantiations: 0
% 7.50/2.76  #Strategies tried      : 1
% 7.50/2.76  
% 7.50/2.76  Timing (in seconds)
% 7.50/2.76  ----------------------
% 7.50/2.76  Preprocessing        : 0.73
% 7.50/2.76  Parsing              : 0.36
% 7.50/2.76  CNF conversion       : 0.07
% 7.50/2.76  Main loop            : 0.95
% 7.50/2.76  Inferencing          : 0.33
% 7.50/2.76  Reduction            : 0.28
% 7.50/2.76  Demodulation         : 0.20
% 7.50/2.76  BG Simplification    : 0.06
% 7.50/2.76  Subsumption          : 0.20
% 7.50/2.76  Abstraction          : 0.04
% 7.50/2.76  MUC search           : 0.00
% 7.50/2.76  Cooper               : 0.00
% 7.50/2.76  Total                : 1.73
% 7.50/2.76  Index Insertion      : 0.00
% 7.50/2.76  Index Deletion       : 0.00
% 7.50/2.76  Index Matching       : 0.00
% 7.50/2.76  BG Taut test         : 0.00
%------------------------------------------------------------------------------