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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUM458+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:51:44 EDT 2023

% Result   : Theorem 4.57s 2.18s
% Output   : CNFRefutation 4.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   23 (   9 unt;   9 typ;   1 def)
%            Number of atoms       :   27 (   5 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   22 (   9   ~;   7   |;   3   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (   6   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :    7 (;   6   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > aNaturalNumber0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xm > sz10 > sz00 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_178,negated_conjecture,
    ~ sdtlseqdt0(xm,xm),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

tff(f_176,hypothesis,
    aNaturalNumber0(xm),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__718) ).

tff(f_67,axiom,
    ! [W0] :
      ( aNaturalNumber0(W0)
     => ( ( sdtpldt0(W0,sz00) = W0 )
        & ( W0 = sdtpldt0(sz00,W0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_AddZero) ).

tff(f_31,axiom,
    aNaturalNumber0(sz00),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).

tff(f_162,definition,
    ! [W0,W1] :
      ( ( aNaturalNumber0(W0)
        & aNaturalNumber0(W1) )
     => ( sdtlseqdt0(W0,W1)
      <=> ? [W2] :
            ( aNaturalNumber0(W2)
            & ( sdtpldt0(W0,W2) = W1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefLE) ).

tff(c_66,plain,
    ~ sdtlseqdt0(xm,xm),
    inference(cnfTransformation,[status(thm)],[f_178]) ).

tff(c_64,plain,
    aNaturalNumber0(xm),
    inference(cnfTransformation,[status(thm)],[f_176]) ).

tff(c_161,plain,
    ! [W0_47] :
      ( ( sdtpldt0(W0_47,sz00) = W0_47 )
      | ~ aNaturalNumber0(W0_47) ),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_174,plain,
    sdtpldt0(xm,sz00) = xm,
    inference(resolution,[status(thm)],[c_64,c_161]) ).

tff(c_4,plain,
    aNaturalNumber0(sz00),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_1382,plain,
    ! [W0_81,W2_82] :
      ( sdtlseqdt0(W0_81,sdtpldt0(W0_81,W2_82))
      | ~ aNaturalNumber0(W2_82)
      | ~ aNaturalNumber0(sdtpldt0(W0_81,W2_82))
      | ~ aNaturalNumber0(W0_81) ),
    inference(cnfTransformation,[status(thm)],[f_162]) ).

tff(c_1397,plain,
    ( sdtlseqdt0(xm,xm)
    | ~ aNaturalNumber0(sz00)
    | ~ aNaturalNumber0(sdtpldt0(xm,sz00))
    | ~ aNaturalNumber0(xm) ),
    inference(superposition,[status(thm),theory(equality)],[c_174,c_1382]) ).

tff(c_1419,plain,
    sdtlseqdt0(xm,xm),
    inference(demodulation,[status(thm),theory(equality)],[c_64,c_64,c_174,c_4,c_1397]) ).

tff(c_1421,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_66,c_1419]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM458+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/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.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Thu Aug  3 14:53:38 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 4.57/2.18  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.57/2.18  
% 4.57/2.18  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.94/2.21  
% 4.94/2.21  Inference rules
% 4.94/2.21  ----------------------
% 4.94/2.21  #Ref     : 0
% 4.94/2.21  #Sup     : 316
% 4.94/2.21  #Fact    : 0
% 4.94/2.21  #Define  : 0
% 4.94/2.21  #Split   : 1
% 4.94/2.21  #Chain   : 0
% 4.94/2.21  #Close   : 0
% 4.94/2.21  
% 4.94/2.21  Ordering : KBO
% 4.94/2.21  
% 4.94/2.21  Simplification rules
% 4.94/2.21  ----------------------
% 4.94/2.21  #Subsume      : 13
% 4.94/2.21  #Demod        : 366
% 4.94/2.21  #Tautology    : 186
% 4.94/2.21  #SimpNegUnit  : 18
% 4.94/2.21  #BackRed      : 0
% 4.94/2.21  
% 4.94/2.21  #Partial instantiations: 0
% 4.94/2.21  #Strategies tried      : 1
% 4.94/2.21  
% 4.94/2.21  Timing (in seconds)
% 4.94/2.21  ----------------------
% 4.94/2.21  Preprocessing        : 0.58
% 4.94/2.21  Parsing              : 0.30
% 4.94/2.21  CNF conversion       : 0.04
% 4.94/2.21  Main loop            : 0.50
% 4.94/2.21  Inferencing          : 0.17
% 4.94/2.21  Reduction            : 0.15
% 4.94/2.21  Demodulation         : 0.11
% 4.94/2.21  BG Simplification    : 0.03
% 4.94/2.21  Subsumption          : 0.12
% 4.94/2.21  Abstraction          : 0.03
% 4.94/2.21  MUC search           : 0.00
% 4.94/2.21  Cooper               : 0.00
% 4.94/2.21  Total                : 1.12
% 4.94/2.21  Index Insertion      : 0.00
% 4.94/2.21  Index Deletion       : 0.00
% 4.94/2.21  Index Matching       : 0.00
% 4.94/2.21  BG Taut test         : 0.00
%------------------------------------------------------------------------------