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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : RNG074+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 : 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:52 EDT 2023

% Result   : Theorem 3.41s 1.86s
% Output   : CNFRefutation 3.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   36
% Syntax   : Number of formulae    :   41 (   8 unt;  33 typ;   0 def)
%            Number of atoms       :    8 (   2 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    2 (   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   :    0 (;   0   !;   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_395,hypothesis,
    sdtpldt0(xR,xS) = sdtpldt0(xP,xP),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2679) ).

tff(f_390,hypothesis,
    sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2610) ).

tff(f_389,hypothesis,
    ~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2590) ).

tff(c_198,plain,
    sdtpldt0(xR,xS) = sdtpldt0(xP,xP),
    inference(cnfTransformation,[status(thm)],[f_395]) ).

tff(c_190,plain,
    sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
    inference(cnfTransformation,[status(thm)],[f_390]) ).

tff(c_204,plain,
    sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),
    inference(demodulation,[status(thm),theory(equality)],[c_198,c_190]) ).

tff(c_188,plain,
    ~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
    inference(cnfTransformation,[status(thm)],[f_389]) ).

tff(c_206,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_204,c_198,c_188]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : RNG074+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 : n027.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:20:39 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 3.41/1.86  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.41/1.86  
% 3.41/1.86  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.58/1.88  
% 3.58/1.88  Inference rules
% 3.58/1.88  ----------------------
% 3.58/1.88  #Ref     : 0
% 3.58/1.88  #Sup     : 0
% 3.58/1.88  #Fact    : 0
% 3.58/1.88  #Define  : 0
% 3.58/1.88  #Split   : 0
% 3.58/1.88  #Chain   : 0
% 3.58/1.88  #Close   : 0
% 3.58/1.88  
% 3.58/1.88  Ordering : KBO
% 3.58/1.88  
% 3.58/1.88  Simplification rules
% 3.58/1.88  ----------------------
% 3.58/1.88  #Subsume      : 92
% 3.58/1.88  #Demod        : 7
% 3.58/1.88  #Tautology    : 7
% 3.58/1.88  #SimpNegUnit  : 0
% 3.58/1.88  #BackRed      : 0
% 3.58/1.88  
% 3.58/1.88  #Partial instantiations: 0
% 3.58/1.88  #Strategies tried      : 1
% 3.58/1.88  
% 3.58/1.88  Timing (in seconds)
% 3.58/1.88  ----------------------
% 3.58/1.89  Preprocessing        : 0.69
% 3.58/1.89  Parsing              : 0.36
% 3.58/1.89  CNF conversion       : 0.05
% 3.58/1.89  Main loop            : 0.06
% 3.58/1.89  Inferencing          : 0.00
% 3.58/1.89  Reduction            : 0.03
% 3.58/1.89  Demodulation         : 0.02
% 3.58/1.89  BG Simplification    : 0.04
% 3.58/1.89  Subsumption          : 0.03
% 3.58/1.89  Abstraction          : 0.01
% 3.58/1.89  MUC search           : 0.00
% 3.58/1.89  Cooper               : 0.00
% 3.58/1.89  Total                : 0.80
% 3.58/1.89  Index Insertion      : 0.00
% 3.58/1.89  Index Deletion       : 0.00
% 3.58/1.89  Index Matching       : 0.00
% 3.58/1.89  BG Taut test         : 0.00
%------------------------------------------------------------------------------