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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : RNG050+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 : n027.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:49 EDT 2023

% Result   : Theorem 5.88s 2.42s
% Output   : CNFRefutation 6.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   41 (  11 unt;  18 typ;   0 def)
%            Number of atoms       :   52 (  27 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   46 (  17   ~;  14   |;   9   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   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    :   13 (  13 usr;   3 con; 0-2 aty)
%            Number of variables   :   10 (;  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aVector0 > aScalar0 > aNaturalNumber0 > sdtpldt0 > sdtlbdtrb0 > sdtasdt0 > sdtasasdt0 > #nlpp > szszuzczcdt0 > sziznziztdt0 > smndt0 > aDimensionOf0 > xs > sz0z00 > sz00 > #skF_1 > #skF_2

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_70,axiom,
    aScalar0(sz0z00),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSZeroSc) ).

tff(f_104,axiom,
    ! [W0] :
      ( aScalar0(W0)
     => ( ( sdtpldt0(W0,sz0z00) = W0 )
        & ( sdtpldt0(sz0z00,W0) = W0 )
        & ( sdtasdt0(W0,sz0z00) = sz0z00 )
        & ( sdtasdt0(sz0z00,W0) = sz0z00 )
        & ( sdtpldt0(W0,smndt0(W0)) = sz0z00 )
        & ( sdtpldt0(smndt0(W0),W0) = sz0z00 )
        & ( smndt0(smndt0(W0)) = W0 )
        & ( smndt0(sz0z00) = sz0z00 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mScZero) ).

tff(f_239,axiom,
    ! [W0] :
      ( aScalar0(W0)
     => sdtlseqdt0(sz0z00,sdtasdt0(W0,W0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSqPos) ).

tff(f_335,negated_conjecture,
    ~ ( ( ( aDimensionOf0(xs) != sz00 )
       => sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) )
     => sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

tff(f_322,hypothesis,
    aVector0(xs),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1542) ).

tff(f_310,axiom,
    ! [W0,W1] :
      ( ( aVector0(W0)
        & aVector0(W1) )
     => ( ( ( aDimensionOf0(W0) = aDimensionOf0(W1) )
          & ( aDimensionOf0(W1) = sz00 ) )
       => ( sdtasasdt0(W0,W1) = sz0z00 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSPZ) ).

tff(c_22,plain,
    aScalar0(sz0z00),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_169,plain,
    ! [W0_83] :
      ( ( sdtasdt0(W0_83,sz0z00) = sz0z00 )
      | ~ aScalar0(W0_83) ),
    inference(cnfTransformation,[status(thm)],[f_104]) ).

tff(c_177,plain,
    sdtasdt0(sz0z00,sz0z00) = sz0z00,
    inference(resolution,[status(thm)],[c_22,c_169]) ).

tff(c_239,plain,
    ! [W0_90] :
      ( sdtlseqdt0(sz0z00,sdtasdt0(W0_90,W0_90))
      | ~ aScalar0(W0_90) ),
    inference(cnfTransformation,[status(thm)],[f_239]) ).

tff(c_242,plain,
    ( sdtlseqdt0(sz0z00,sz0z00)
    | ~ aScalar0(sz0z00) ),
    inference(superposition,[status(thm),theory(equality)],[c_177,c_239]) ).

tff(c_244,plain,
    sdtlseqdt0(sz0z00,sz0z00),
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_242]) ).

tff(c_116,plain,
    ~ sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)),
    inference(cnfTransformation,[status(thm)],[f_335]) ).

tff(c_118,plain,
    ( sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs))
    | ( aDimensionOf0(xs) = sz00 ) ),
    inference(cnfTransformation,[status(thm)],[f_335]) ).

tff(c_119,plain,
    aDimensionOf0(xs) = sz00,
    inference(negUnitSimplification,[status(thm)],[c_116,c_118]) ).

tff(c_112,plain,
    aVector0(xs),
    inference(cnfTransformation,[status(thm)],[f_322]) ).

tff(c_3097,plain,
    ! [W0_173,W1_174] :
      ( ( sdtasasdt0(W0_173,W1_174) = sz0z00 )
      | ( aDimensionOf0(W1_174) != sz00 )
      | ( aDimensionOf0(W1_174) != aDimensionOf0(W0_173) )
      | ~ aVector0(W1_174)
      | ~ aVector0(W0_173) ),
    inference(cnfTransformation,[status(thm)],[f_310]) ).

tff(c_3101,plain,
    ! [W0_173] :
      ( ( sdtasasdt0(W0_173,xs) = sz0z00 )
      | ( aDimensionOf0(xs) != sz00 )
      | ( aDimensionOf0(xs) != aDimensionOf0(W0_173) )
      | ~ aVector0(W0_173) ),
    inference(resolution,[status(thm)],[c_112,c_3097]) ).

tff(c_3213,plain,
    ! [W0_176] :
      ( ( sdtasasdt0(W0_176,xs) = sz0z00 )
      | ( aDimensionOf0(W0_176) != sz00 )
      | ~ aVector0(W0_176) ),
    inference(demodulation,[status(thm),theory(equality)],[c_119,c_119,c_3101]) ).

tff(c_3219,plain,
    ( ( sdtasasdt0(xs,xs) = sz0z00 )
    | ( aDimensionOf0(xs) != sz00 ) ),
    inference(resolution,[status(thm)],[c_112,c_3213]) ).

tff(c_3223,plain,
    sdtasasdt0(xs,xs) = sz0z00,
    inference(demodulation,[status(thm),theory(equality)],[c_119,c_3219]) ).

tff(c_3224,plain,
    ~ sdtlseqdt0(sz0z00,sz0z00),
    inference(demodulation,[status(thm),theory(equality)],[c_3223,c_116]) ).

tff(c_3227,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_244,c_3224]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : RNG050+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.13/0.35  % Computer : n027.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 18:23:08 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 5.88/2.42  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.88/2.42  
% 5.88/2.43  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.11/2.45  
% 6.11/2.45  Inference rules
% 6.11/2.45  ----------------------
% 6.11/2.45  #Ref     : 1
% 6.11/2.45  #Sup     : 766
% 6.11/2.45  #Fact    : 2
% 6.11/2.45  #Define  : 0
% 6.11/2.45  #Split   : 3
% 6.11/2.45  #Chain   : 0
% 6.11/2.45  #Close   : 0
% 6.11/2.45  
% 6.11/2.45  Ordering : KBO
% 6.11/2.45  
% 6.11/2.45  Simplification rules
% 6.11/2.45  ----------------------
% 6.11/2.45  #Subsume      : 187
% 6.11/2.45  #Demod        : 526
% 6.11/2.45  #Tautology    : 276
% 6.11/2.45  #SimpNegUnit  : 15
% 6.11/2.45  #BackRed      : 6
% 6.11/2.45  
% 6.11/2.45  #Partial instantiations: 0
% 6.11/2.45  #Strategies tried      : 1
% 6.11/2.45  
% 6.11/2.45  Timing (in seconds)
% 6.11/2.45  ----------------------
% 6.22/2.45  Preprocessing        : 0.65
% 6.22/2.45  Parsing              : 0.32
% 6.22/2.45  CNF conversion       : 0.05
% 6.22/2.45  Main loop            : 0.74
% 6.22/2.45  Inferencing          : 0.25
% 6.22/2.45  Reduction            : 0.20
% 6.22/2.45  Demodulation         : 0.14
% 6.22/2.45  BG Simplification    : 0.05
% 6.22/2.45  Subsumption          : 0.20
% 6.22/2.46  Abstraction          : 0.04
% 6.22/2.46  MUC search           : 0.00
% 6.22/2.46  Cooper               : 0.00
% 6.22/2.46  Total                : 1.43
% 6.22/2.46  Index Insertion      : 0.00
% 6.22/2.46  Index Deletion       : 0.00
% 6.22/2.46  Index Matching       : 0.00
% 6.22/2.46  BG Taut test         : 0.00
%------------------------------------------------------------------------------