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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : RNG089+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/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 : 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:55 EDT 2023

% Result   : Theorem 6.53s 2.60s
% Output   : CNFRefutation 6.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   41
% Syntax   : Number of formulae    :   53 (   7 unt;  37 typ;   0 def)
%            Number of atoms       :   47 (   3 equ)
%            Maximal formula atoms :   14 (   2 avg)
%            Number of connectives :   44 (  13   ~;   7   |;  18   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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    :   33 (  33 usr;  15 con; 0-4 aty)
%            Number of variables   :   14 (;  10   !;   4   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ aElementOf0 > aSet0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > xz > xy > xx > xn > xm > xl > xk > xJ > xI > sz10 > sz00 > #skF_17 > #skF_6 > #skF_15 > #skF_4 > #skF_8 > #skF_16 > #skF_14 > #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_17',type,
    '#skF_17': $i ).

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

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

tff('#skF_15',type,
    '#skF_15': $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('#skF_16',type,
    '#skF_16': $i ).

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

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

tff('#skF_14',type,
    '#skF_14': $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_262,hypothesis,
    ( aElementOf0(xk,xI)
    & aElementOf0(xl,xJ)
    & ( xx = sdtpldt0(xk,xl) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__934) ).

tff(f_257,hypothesis,
    ( ? [W0,W1] :
        ( aElementOf0(W0,xI)
        & aElementOf0(W1,xJ)
        & ( sdtpldt0(W0,W1) = xx ) )
    & aElementOf0(xx,sdtpldt1(xI,xJ))
    & ? [W0,W1] :
        ( aElementOf0(W0,xI)
        & aElementOf0(W1,xJ)
        & ( sdtpldt0(W0,W1) = xy ) )
    & aElementOf0(xy,sdtpldt1(xI,xJ))
    & aElement0(xz) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__901) ).

tff(f_238,hypothesis,
    ( aSet0(xI)
    & ! [W0] :
        ( aElementOf0(W0,xI)
       => ( ! [W1] :
              ( aElementOf0(W1,xI)
             => aElementOf0(sdtpldt0(W0,W1),xI) )
          & ! [W1] :
              ( aElement0(W1)
             => aElementOf0(sdtasdt0(W1,W0),xI) ) ) )
    & aIdeal0(xI)
    & aSet0(xJ)
    & ! [W0] :
        ( aElementOf0(W0,xJ)
       => ( ! [W1] :
              ( aElementOf0(W1,xJ)
             => aElementOf0(sdtpldt0(W0,W1),xJ) )
          & ! [W1] :
              ( aElement0(W1)
             => aElementOf0(sdtasdt0(W1,W0),xJ) ) ) )
    & aIdeal0(xJ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).

tff(f_274,negated_conjecture,
    ~ ( aElementOf0(sdtasdt0(xz,xk),xI)
      & aElementOf0(sdtasdt0(xz,xl),xJ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

tff(c_160,plain,
    aElementOf0(xl,xJ),
    inference(cnfTransformation,[status(thm)],[f_262]) ).

tff(c_140,plain,
    aElement0(xz),
    inference(cnfTransformation,[status(thm)],[f_257]) ).

tff(c_3324,plain,
    ! [W1_204,W0_205] :
      ( aElementOf0(sdtasdt0(W1_204,W0_205),xJ)
      | ~ aElement0(W1_204)
      | ~ aElementOf0(W0_205,xJ) ),
    inference(cnfTransformation,[status(thm)],[f_238]) ).

tff(c_162,plain,
    aElementOf0(xk,xI),
    inference(cnfTransformation,[status(thm)],[f_262]) ).

tff(c_1444,plain,
    ! [W1_174,W0_175] :
      ( aElementOf0(sdtasdt0(W1_174,W0_175),xI)
      | ~ aElement0(W1_174)
      | ~ aElementOf0(W0_175,xI) ),
    inference(cnfTransformation,[status(thm)],[f_238]) ).

tff(c_174,plain,
    ( ~ aElementOf0(sdtasdt0(xz,xl),xJ)
    | ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
    inference(cnfTransformation,[status(thm)],[f_274]) ).

tff(c_175,plain,
    ~ aElementOf0(sdtasdt0(xz,xk),xI),
    inference(splitLeft,[status(thm)],[c_174]) ).

tff(c_1450,plain,
    ( ~ aElement0(xz)
    | ~ aElementOf0(xk,xI) ),
    inference(resolution,[status(thm)],[c_1444,c_175]) ).

tff(c_1547,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_162,c_140,c_1450]) ).

tff(c_1548,plain,
    ~ aElementOf0(sdtasdt0(xz,xl),xJ),
    inference(splitRight,[status(thm)],[c_174]) ).

tff(c_3330,plain,
    ( ~ aElement0(xz)
    | ~ aElementOf0(xl,xJ) ),
    inference(resolution,[status(thm)],[c_3324,c_1548]) ).

tff(c_3505,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_160,c_140,c_3330]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : RNG089+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/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 : n006.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 17:54:58 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 6.53/2.60  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.53/2.60  
% 6.53/2.60  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.88/2.63  
% 6.88/2.63  Inference rules
% 6.88/2.63  ----------------------
% 6.88/2.63  #Ref     : 0
% 6.88/2.63  #Sup     : 911
% 6.88/2.63  #Fact    : 0
% 6.88/2.63  #Define  : 0
% 6.88/2.63  #Split   : 1
% 6.88/2.63  #Chain   : 0
% 6.88/2.63  #Close   : 0
% 6.88/2.63  
% 6.88/2.63  Ordering : KBO
% 6.88/2.63  
% 6.88/2.63  Simplification rules
% 6.88/2.63  ----------------------
% 6.88/2.63  #Subsume      : 4
% 6.88/2.63  #Demod        : 562
% 6.88/2.63  #Tautology    : 488
% 6.88/2.63  #SimpNegUnit  : 0
% 6.88/2.63  #BackRed      : 0
% 6.88/2.63  
% 6.88/2.63  #Partial instantiations: 0
% 6.88/2.63  #Strategies tried      : 1
% 6.88/2.63  
% 6.88/2.63  Timing (in seconds)
% 6.88/2.63  ----------------------
% 6.88/2.63  Preprocessing        : 0.66
% 6.88/2.63  Parsing              : 0.33
% 6.88/2.63  CNF conversion       : 0.06
% 6.88/2.63  Main loop            : 0.86
% 6.88/2.63  Inferencing          : 0.31
% 6.88/2.63  Reduction            : 0.28
% 6.88/2.63  Demodulation         : 0.21
% 6.88/2.63  BG Simplification    : 0.05
% 6.88/2.63  Subsumption          : 0.16
% 6.88/2.63  Abstraction          : 0.04
% 6.88/2.63  MUC search           : 0.00
% 6.88/2.63  Cooper               : 0.00
% 6.88/2.63  Total                : 1.56
% 6.88/2.64  Index Insertion      : 0.00
% 6.88/2.64  Index Deletion       : 0.00
% 6.88/2.64  Index Matching       : 0.00
% 6.88/2.64  BG Taut test         : 0.00
%------------------------------------------------------------------------------