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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : RNG088+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 : n026.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:55 EDT 2023

% Result   : Theorem 7.10s 2.89s
% Output   : CNFRefutation 7.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   38
% Syntax   : Number of formulae    :   53 (  10 unt;  33 typ;   1 def)
%            Number of atoms       :   43 (   2 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   40 (  17   ~;  11   |;   8   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   47 (  22   >;  25   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   29 (  29 usr;  11 con; 0-4 aty)
%            Number of variables   :   10 (;  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ aElementOf0 > aSet0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > xz > xy > xx > xn > xm > xl > xk > xJ > xI > sz10 > sz00 > #skF_6 > #skF_4 > #skF_8 > #skF_5 > #skF_7 > #skF_9 > #skF_13 > #skF_11 > #skF_3 > #skF_2 > #skF_12 > #skF_1 > #skF_10

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(xk,type,
    xk: $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_208,hypothesis,
    ( aIdeal0(xI)
    & aIdeal0(xJ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).

tff(f_218,hypothesis,
    ( aElementOf0(xk,xI)
    & aElementOf0(xl,xJ)
    & ( xx = sdtpldt0(xk,xl) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__934) ).

tff(f_223,hypothesis,
    ( aElementOf0(xm,xI)
    & aElementOf0(xn,xJ)
    & ( xy = sdtpldt0(xm,xn) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__967) ).

tff(f_205,definition,
    ! [W0] :
      ( aIdeal0(W0)
    <=> ( aSet0(W0)
        & ! [W1] :
            ( aElementOf0(W1,W0)
           => ( ! [W2] :
                  ( aElementOf0(W2,W0)
                 => aElementOf0(sdtpldt0(W1,W2),W0) )
              & ! [W2] :
                  ( aElement0(W2)
                 => aElementOf0(sdtasdt0(W2,W1),W0) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).

tff(f_227,negated_conjecture,
    ~ ( aElementOf0(sdtpldt0(xk,xm),xI)
      & aElementOf0(sdtpldt0(xl,xn),xJ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

tff(c_124,plain,
    aIdeal0(xJ),
    inference(cnfTransformation,[status(thm)],[f_208]) ).

tff(c_136,plain,
    aElementOf0(xl,xJ),
    inference(cnfTransformation,[status(thm)],[f_218]) ).

tff(c_142,plain,
    aElementOf0(xn,xJ),
    inference(cnfTransformation,[status(thm)],[f_223]) ).

tff(c_5849,plain,
    ! [W1_239,W2_240,W0_241] :
      ( aElementOf0(sdtpldt0(W1_239,W2_240),W0_241)
      | ~ aElementOf0(W2_240,W0_241)
      | ~ aElementOf0(W1_239,W0_241)
      | ~ aIdeal0(W0_241) ),
    inference(cnfTransformation,[status(thm)],[f_205]) ).

tff(c_126,plain,
    aIdeal0(xI),
    inference(cnfTransformation,[status(thm)],[f_208]) ).

tff(c_138,plain,
    aElementOf0(xk,xI),
    inference(cnfTransformation,[status(thm)],[f_218]) ).

tff(c_144,plain,
    aElementOf0(xm,xI),
    inference(cnfTransformation,[status(thm)],[f_223]) ).

tff(c_2061,plain,
    ! [W1_180,W2_181,W0_182] :
      ( aElementOf0(sdtpldt0(W1_180,W2_181),W0_182)
      | ~ aElementOf0(W2_181,W0_182)
      | ~ aElementOf0(W1_180,W0_182)
      | ~ aIdeal0(W0_182) ),
    inference(cnfTransformation,[status(thm)],[f_205]) ).

tff(c_146,plain,
    ( ~ aElementOf0(sdtpldt0(xl,xn),xJ)
    | ~ aElementOf0(sdtpldt0(xk,xm),xI) ),
    inference(cnfTransformation,[status(thm)],[f_227]) ).

tff(c_147,plain,
    ~ aElementOf0(sdtpldt0(xk,xm),xI),
    inference(splitLeft,[status(thm)],[c_146]) ).

tff(c_2075,plain,
    ( ~ aElementOf0(xm,xI)
    | ~ aElementOf0(xk,xI)
    | ~ aIdeal0(xI) ),
    inference(resolution,[status(thm)],[c_2061,c_147]) ).

tff(c_2166,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_126,c_138,c_144,c_2075]) ).

tff(c_2167,plain,
    ~ aElementOf0(sdtpldt0(xl,xn),xJ),
    inference(splitRight,[status(thm)],[c_146]) ).

tff(c_5863,plain,
    ( ~ aElementOf0(xn,xJ)
    | ~ aElementOf0(xl,xJ)
    | ~ aIdeal0(xJ) ),
    inference(resolution,[status(thm)],[c_5849,c_2167]) ).

tff(c_5969,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_124,c_136,c_142,c_5863]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : RNG088+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % 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.35  % Computer : n026.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 18:22:32 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 7.10/2.89  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.10/2.89  
% 7.10/2.89  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.80/2.92  
% 7.80/2.92  Inference rules
% 7.80/2.92  ----------------------
% 7.80/2.92  #Ref     : 0
% 7.80/2.92  #Sup     : 1482
% 7.80/2.92  #Fact    : 0
% 7.80/2.92  #Define  : 0
% 7.80/2.92  #Split   : 7
% 7.80/2.92  #Chain   : 0
% 7.80/2.92  #Close   : 0
% 7.80/2.92  
% 7.80/2.92  Ordering : KBO
% 7.80/2.92  
% 7.80/2.92  Simplification rules
% 7.80/2.92  ----------------------
% 7.80/2.92  #Subsume      : 9
% 7.80/2.92  #Demod        : 957
% 7.80/2.92  #Tautology    : 732
% 7.80/2.92  #SimpNegUnit  : 38
% 7.80/2.92  #BackRed      : 0
% 7.80/2.92  
% 7.80/2.92  #Partial instantiations: 0
% 7.80/2.92  #Strategies tried      : 1
% 7.80/2.92  
% 7.80/2.92  Timing (in seconds)
% 7.80/2.92  ----------------------
% 7.80/2.92  Preprocessing        : 0.65
% 7.80/2.92  Parsing              : 0.33
% 7.80/2.92  CNF conversion       : 0.05
% 7.80/2.92  Main loop            : 1.21
% 7.80/2.92  Inferencing          : 0.41
% 7.80/2.92  Reduction            : 0.43
% 7.80/2.92  Demodulation         : 0.32
% 7.80/2.92  BG Simplification    : 0.05
% 7.80/2.92  Subsumption          : 0.23
% 7.80/2.93  Abstraction          : 0.05
% 7.80/2.93  MUC search           : 0.00
% 7.80/2.93  Cooper               : 0.00
% 7.80/2.93  Total                : 1.91
% 7.80/2.93  Index Insertion      : 0.00
% 7.80/2.93  Index Deletion       : 0.00
% 7.80/2.93  Index Matching       : 0.00
% 7.80/2.93  BG Taut test         : 0.00
%------------------------------------------------------------------------------