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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : RNG059+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 : n007.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:50 EDT 2023

% Result   : Theorem 13.75s 4.73s
% Output   : CNFRefutation 13.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   41
% Syntax   : Number of formulae    :   67 (  17 unt;  33 typ;   0 def)
%            Number of atoms       :   69 (  25 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   61 (  26   ~;  20   |;  12   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   22 (  15   >;   7   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   28 (  28 usr;  18 con; 0-2 aty)
%            Number of variables   :   25 (;  25   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aVector0 > aScalar0 > aNaturalNumber0 > sdtpldt0 > sdtlbdtrb0 > sdtasdt0 > sdtasasdt0 > #nlpp > szszuzczcdt0 > sziznziztdt0 > smndt0 > aDimensionOf0 > xt > xs > xq > xp > xS > xR > xP > xN > xH > xG > xF > xE > xD > xC > xB > xA > sz0z00 > sz00 > #skF_1 > #skF_2

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_383,hypothesis,
    ( aScalar0(xN)
    & ( xN = sdtasdt0(xR,xS) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1949) ).

tff(f_380,hypothesis,
    ( aScalar0(xS)
    & ( xS = sdtasdt0(xF,xD) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1930) ).

tff(f_374,hypothesis,
    ( aScalar0(xR)
    & ( xR = sdtasdt0(xC,xG) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1892) ).

tff(f_118,axiom,
    ! [W0,W1,W2] :
      ( ( aScalar0(W0)
        & aScalar0(W1)
        & aScalar0(W2) )
     => ( ( sdtpldt0(sdtpldt0(W0,W1),W2) = sdtpldt0(W0,sdtpldt0(W1,W2)) )
        & ( sdtpldt0(W0,W1) = sdtpldt0(W1,W0) )
        & ( sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2)) )
        & ( sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mArith) ).

tff(f_353,hypothesis,
    ( aScalar0(xB)
    & ( xB = sdtlbdtrb0(xt,aDimensionOf0(xt)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1766) ).

tff(f_76,axiom,
    ! [W0,W1] :
      ( ( aScalar0(W0)
        & aScalar0(W1) )
     => aScalar0(sdtpldt0(W0,W1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSumSc) ).

tff(f_146,axiom,
    ! [W0,W1] :
      ( ( aScalar0(W0)
        & aScalar0(W1) )
     => ( ( sdtasdt0(W0,smndt0(W1)) = smndt0(sdtasdt0(W0,W1)) )
        & ( sdtasdt0(smndt0(W0),W1) = smndt0(sdtasdt0(W0,W1)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMNeg) ).

tff(f_387,negated_conjecture,
    sdtasdt0(smndt0(xS),xR) != smndt0(xN),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

tff(c_176,plain,
    sdtasdt0(xR,xS) = xN,
    inference(cnfTransformation,[status(thm)],[f_383]) ).

tff(c_174,plain,
    aScalar0(xS),
    inference(cnfTransformation,[status(thm)],[f_380]) ).

tff(c_166,plain,
    aScalar0(xR),
    inference(cnfTransformation,[status(thm)],[f_374]) ).

tff(c_46,plain,
    ! [W1_18,W0_17,W2_19] :
      ( ( sdtasdt0(W1_18,W0_17) = sdtasdt0(W0_17,W1_18) )
      | ~ aScalar0(W2_19)
      | ~ aScalar0(W1_18)
      | ~ aScalar0(W0_17) ),
    inference(cnfTransformation,[status(thm)],[f_118]) ).

tff(c_2394,plain,
    ! [W2_19] : ~ aScalar0(W2_19),
    inference(splitLeft,[status(thm)],[c_46]) ).

tff(c_178,plain,
    aScalar0(xN),
    inference(cnfTransformation,[status(thm)],[f_383]) ).

tff(c_138,plain,
    aScalar0(xB),
    inference(cnfTransformation,[status(thm)],[f_353]) ).

tff(c_50,plain,
    ! [W1_18,W0_17,W2_19] :
      ( ( sdtpldt0(W1_18,W0_17) = sdtpldt0(W0_17,W1_18) )
      | ~ aScalar0(W2_19)
      | ~ aScalar0(W1_18)
      | ~ aScalar0(W0_17) ),
    inference(cnfTransformation,[status(thm)],[f_118]) ).

tff(c_2139,plain,
    ! [W2_19] : ~ aScalar0(W2_19),
    inference(splitLeft,[status(thm)],[c_50]) ).

tff(c_2157,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_2139,c_138]) ).

tff(c_2159,plain,
    ! [W1_125,W0_126] :
      ( ( sdtpldt0(W1_125,W0_126) = sdtpldt0(W0_126,W1_125) )
      | ~ aScalar0(W1_125)
      | ~ aScalar0(W0_126) ),
    inference(splitRight,[status(thm)],[c_50]) ).

tff(c_2211,plain,
    ! [W0_127] :
      ( ( sdtpldt0(xB,W0_127) = sdtpldt0(W0_127,xB) )
      | ~ aScalar0(W0_127) ),
    inference(resolution,[status(thm)],[c_138,c_2159]) ).

tff(c_2281,plain,
    sdtpldt0(xN,xB) = sdtpldt0(xB,xN),
    inference(resolution,[status(thm)],[c_178,c_2211]) ).

tff(c_24,plain,
    ! [W0_11,W1_12] :
      ( aScalar0(sdtpldt0(W0_11,W1_12))
      | ~ aScalar0(W1_12)
      | ~ aScalar0(W0_11) ),
    inference(cnfTransformation,[status(thm)],[f_76]) ).

tff(c_2363,plain,
    ( aScalar0(sdtpldt0(xB,xN))
    | ~ aScalar0(xB)
    | ~ aScalar0(xN) ),
    inference(superposition,[status(thm),theory(equality)],[c_2281,c_24]) ).

tff(c_2369,plain,
    aScalar0(sdtpldt0(xB,xN)),
    inference(demodulation,[status(thm),theory(equality)],[c_178,c_138,c_2363]) ).

tff(c_2414,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_2394,c_2369]) ).

tff(c_2490,plain,
    ! [W1_130,W0_131] :
      ( ( sdtasdt0(W1_130,W0_131) = sdtasdt0(W0_131,W1_130) )
      | ~ aScalar0(W1_130)
      | ~ aScalar0(W0_131) ),
    inference(splitRight,[status(thm)],[c_46]) ).

tff(c_14608,plain,
    ! [W0_196] :
      ( ( sdtasdt0(xR,W0_196) = sdtasdt0(W0_196,xR) )
      | ~ aScalar0(W0_196) ),
    inference(resolution,[status(thm)],[c_166,c_2490]) ).

tff(c_14770,plain,
    sdtasdt0(xS,xR) = sdtasdt0(xR,xS),
    inference(resolution,[status(thm)],[c_174,c_14608]) ).

tff(c_14850,plain,
    sdtasdt0(xS,xR) = xN,
    inference(demodulation,[status(thm),theory(equality)],[c_176,c_14770]) ).

tff(c_2715,plain,
    ! [W0_134,W1_135] :
      ( ( sdtasdt0(smndt0(W0_134),W1_135) = smndt0(sdtasdt0(W0_134,W1_135)) )
      | ~ aScalar0(W1_135)
      | ~ aScalar0(W0_134) ),
    inference(cnfTransformation,[status(thm)],[f_146]) ).

tff(c_184,plain,
    sdtasdt0(smndt0(xS),xR) != smndt0(xN),
    inference(cnfTransformation,[status(thm)],[f_387]) ).

tff(c_2742,plain,
    ( ( smndt0(sdtasdt0(xS,xR)) != smndt0(xN) )
    | ~ aScalar0(xR)
    | ~ aScalar0(xS) ),
    inference(superposition,[status(thm),theory(equality)],[c_2715,c_184]) ).

tff(c_2762,plain,
    smndt0(sdtasdt0(xS,xR)) != smndt0(xN),
    inference(demodulation,[status(thm),theory(equality)],[c_174,c_166,c_2742]) ).

tff(c_14863,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_14850,c_2762]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : RNG059+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.14/0.36  % Computer : n007.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 17:52:23 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 13.75/4.73  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.75/4.73  
% 13.75/4.73  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 13.75/4.76  
% 13.75/4.76  Inference rules
% 13.75/4.76  ----------------------
% 13.75/4.76  #Ref     : 3
% 13.75/4.76  #Sup     : 3352
% 13.75/4.76  #Fact    : 2
% 13.75/4.76  #Define  : 0
% 13.75/4.76  #Split   : 13
% 13.75/4.76  #Chain   : 0
% 13.75/4.76  #Close   : 0
% 13.75/4.76  
% 13.75/4.76  Ordering : KBO
% 13.75/4.76  
% 13.75/4.76  Simplification rules
% 13.75/4.76  ----------------------
% 13.75/4.76  #Subsume      : 124
% 13.75/4.76  #Demod        : 4170
% 13.75/4.76  #Tautology    : 927
% 13.75/4.76  #SimpNegUnit  : 96
% 13.75/4.76  #BackRed      : 72
% 13.75/4.76  
% 13.75/4.76  #Partial instantiations: 0
% 13.75/4.76  #Strategies tried      : 1
% 13.75/4.76  
% 13.75/4.76  Timing (in seconds)
% 13.75/4.76  ----------------------
% 13.75/4.76  Preprocessing        : 0.72
% 13.75/4.76  Parsing              : 0.37
% 13.75/4.76  CNF conversion       : 0.05
% 13.75/4.76  Main loop            : 2.97
% 13.75/4.76  Inferencing          : 0.70
% 13.75/4.76  Reduction            : 1.43
% 13.75/4.76  Demodulation         : 1.19
% 13.75/4.76  BG Simplification    : 0.09
% 13.75/4.76  Subsumption          : 0.60
% 13.75/4.76  Abstraction          : 0.10
% 13.75/4.76  MUC search           : 0.00
% 13.75/4.76  Cooper               : 0.00
% 13.75/4.76  Total                : 3.73
% 13.75/4.76  Index Insertion      : 0.00
% 13.75/4.76  Index Deletion       : 0.00
% 13.75/4.76  Index Matching       : 0.00
% 13.75/4.76  BG Taut test         : 0.00
%------------------------------------------------------------------------------