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

View Problem - Process Solution

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

% Result   : Theorem 19.22s 6.81s
% Output   : CNFRefutation 19.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   38 (  12 unt;  16 typ;   0 def)
%            Number of atoms       :   42 (  17 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   34 (  14   ~;  12   |;   5   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   19 (  10   >;   9   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-2 aty)
%            Number of variables   :   13 (;  13   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > doDivides0 > aNaturalNumber0 > sdtsldt0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xn > xm > xl > sz10 > sz00 > #skF_3 > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_373,hypothesis,
    ( aNaturalNumber0(xl)
    & aNaturalNumber0(xm) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1524) ).

tff(f_383,hypothesis,
    aNaturalNumber0(xn),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1553) ).

tff(f_73,axiom,
    ! [W0,W1] :
      ( ( aNaturalNumber0(W0)
        & aNaturalNumber0(W1) )
     => ( sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).

tff(f_400,negated_conjecture,
    ~ ( ( aNaturalNumber0(sdtsldt0(xm,xl))
        & ( xm = sdtasdt0(xl,sdtsldt0(xm,xl)) ) )
     => ( ( sdtasdt0(xn,xm) = sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) )
        | ( sdtasdt0(xn,sdtsldt0(xm,xl)) = sdtsldt0(sdtasdt0(xn,xm),xl) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

tff(f_81,axiom,
    ! [W0,W1,W2] :
      ( ( aNaturalNumber0(W0)
        & aNaturalNumber0(W1)
        & aNaturalNumber0(W2) )
     => ( sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).

tff(c_121,plain,
    aNaturalNumber0(xm),
    inference(cnfTransformation,[status(thm)],[f_373]) ).

tff(c_133,plain,
    aNaturalNumber0(xn),
    inference(cnfTransformation,[status(thm)],[f_383]) ).

tff(c_1722,plain,
    ! [W1_108,W0_109] :
      ( ( sdtasdt0(W1_108,W0_109) = sdtasdt0(W0_109,W1_108) )
      | ~ aNaturalNumber0(W1_108)
      | ~ aNaturalNumber0(W0_109) ),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_2092,plain,
    ! [W0_114] :
      ( ( sdtasdt0(xn,W0_114) = sdtasdt0(W0_114,xn) )
      | ~ aNaturalNumber0(W0_114) ),
    inference(resolution,[status(thm)],[c_133,c_1722]) ).

tff(c_2175,plain,
    sdtasdt0(xn,xm) = sdtasdt0(xm,xn),
    inference(resolution,[status(thm)],[c_121,c_2092]) ).

tff(c_147,plain,
    sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) != sdtasdt0(xn,xm),
    inference(cnfTransformation,[status(thm)],[f_400]) ).

tff(c_2192,plain,
    sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) != sdtasdt0(xm,xn),
    inference(demodulation,[status(thm),theory(equality)],[c_2175,c_147]) ).

tff(c_151,plain,
    aNaturalNumber0(sdtsldt0(xm,xl)),
    inference(cnfTransformation,[status(thm)],[f_400]) ).

tff(c_2174,plain,
    sdtasdt0(sdtsldt0(xm,xl),xn) = sdtasdt0(xn,sdtsldt0(xm,xl)),
    inference(resolution,[status(thm)],[c_151,c_2092]) ).

tff(c_123,plain,
    aNaturalNumber0(xl),
    inference(cnfTransformation,[status(thm)],[f_373]) ).

tff(c_149,plain,
    sdtasdt0(xl,sdtsldt0(xm,xl)) = xm,
    inference(cnfTransformation,[status(thm)],[f_400]) ).

tff(c_32917,plain,
    ! [W0_464,W1_465,W2_466] :
      ( ( sdtasdt0(sdtasdt0(W0_464,W1_465),W2_466) = sdtasdt0(W0_464,sdtasdt0(W1_465,W2_466)) )
      | ~ aNaturalNumber0(W2_466)
      | ~ aNaturalNumber0(W1_465)
      | ~ aNaturalNumber0(W0_464) ),
    inference(cnfTransformation,[status(thm)],[f_81]) ).

tff(c_33163,plain,
    ! [W2_466] :
      ( ( sdtasdt0(xl,sdtasdt0(sdtsldt0(xm,xl),W2_466)) = sdtasdt0(xm,W2_466) )
      | ~ aNaturalNumber0(W2_466)
      | ~ aNaturalNumber0(sdtsldt0(xm,xl))
      | ~ aNaturalNumber0(xl) ),
    inference(superposition,[status(thm),theory(equality)],[c_149,c_32917]) ).

tff(c_33318,plain,
    ! [W2_467] :
      ( ( sdtasdt0(xl,sdtasdt0(sdtsldt0(xm,xl),W2_467)) = sdtasdt0(xm,W2_467) )
      | ~ aNaturalNumber0(W2_467) ),
    inference(demodulation,[status(thm),theory(equality)],[c_123,c_151,c_33163]) ).

tff(c_33349,plain,
    ( ( sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) = sdtasdt0(xm,xn) )
    | ~ aNaturalNumber0(xn) ),
    inference(superposition,[status(thm),theory(equality)],[c_2174,c_33318]) ).

tff(c_33378,plain,
    sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) = sdtasdt0(xm,xn),
    inference(demodulation,[status(thm),theory(equality)],[c_133,c_33349]) ).

tff(c_33380,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_2192,c_33378]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : NUM480+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15  % 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.15/0.37  % Computer : n020.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Aug  3 15:19:07 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 19.22/6.81  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.22/6.82  
% 19.22/6.82  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 19.30/6.84  
% 19.30/6.84  Inference rules
% 19.30/6.84  ----------------------
% 19.30/6.84  #Ref     : 17
% 19.30/6.84  #Sup     : 6977
% 19.30/6.84  #Fact    : 2
% 19.30/6.84  #Define  : 0
% 19.30/6.84  #Split   : 24
% 19.30/6.84  #Chain   : 0
% 19.30/6.84  #Close   : 0
% 19.30/6.84  
% 19.30/6.84  Ordering : KBO
% 19.30/6.84  
% 19.30/6.84  Simplification rules
% 19.30/6.84  ----------------------
% 19.30/6.84  #Subsume      : 259
% 19.30/6.84  #Demod        : 11401
% 19.30/6.84  #Tautology    : 2483
% 19.30/6.84  #SimpNegUnit  : 1242
% 19.30/6.84  #BackRed      : 988
% 19.30/6.84  
% 19.30/6.84  #Partial instantiations: 0
% 19.30/6.84  #Strategies tried      : 1
% 19.30/6.84  
% 19.30/6.84  Timing (in seconds)
% 19.30/6.84  ----------------------
% 19.30/6.85  Preprocessing        : 0.67
% 19.30/6.85  Parsing              : 0.34
% 19.30/6.85  CNF conversion       : 0.05
% 19.30/6.85  Main loop            : 5.08
% 19.30/6.85  Inferencing          : 1.08
% 19.30/6.85  Reduction            : 2.48
% 19.30/6.85  Demodulation         : 1.96
% 19.30/6.85  BG Simplification    : 0.12
% 19.30/6.85  Subsumption          : 1.03
% 19.30/6.85  Abstraction          : 0.13
% 19.30/6.85  MUC search           : 0.00
% 19.30/6.85  Cooper               : 0.00
% 19.30/6.85  Total                : 5.79
% 19.30/6.85  Index Insertion      : 0.00
% 19.30/6.85  Index Deletion       : 0.00
% 19.30/6.85  Index Matching       : 0.00
% 19.30/6.85  BG Taut test         : 0.00
%------------------------------------------------------------------------------