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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : COM012+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 : n015.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:35:17 EDT 2023

% Result   : Theorem 3.92s 1.98s
% Output   : CNFRefutation 4.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   44 (  16 unt;  11 typ;   1 def)
%            Number of atoms       :  114 (  21 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :  135 (  54   ~;  66   |;  10   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (   7   >;   9   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-3 aty)
%            Number of variables   :   32 (;  32   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sdtmndtplgtdt0 > sdtmndtasgtdt0 > aReductOfIn0 > iLess0 > aRewritingSystem0 > aElement0 > #nlpp > xz > xy > xx > xR > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

tff(f_114,negated_conjecture,
    ~ ( ( sdtmndtasgtdt0(xx,xR,xy)
        & sdtmndtasgtdt0(xy,xR,xz) )
     => sdtmndtasgtdt0(xx,xR,xz) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

tff(f_108,hypothesis,
    ( aElement0(xx)
    & aRewritingSystem0(xR)
    & aElement0(xy)
    & aElement0(xz) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__349) ).

tff(f_101,definition,
    ! [W0,W1,W2] :
      ( ( aElement0(W0)
        & aRewritingSystem0(W1)
        & aElement0(W2) )
     => ( sdtmndtasgtdt0(W0,W1,W2)
      <=> ( ( W0 = W2 )
          | sdtmndtplgtdt0(W0,W1,W2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCRDef) ).

tff(f_89,axiom,
    ! [W0,W1,W2,W3] :
      ( ( aElement0(W0)
        & aRewritingSystem0(W1)
        & aElement0(W2)
        & aElement0(W3) )
     => ( ( sdtmndtplgtdt0(W0,W1,W2)
          & sdtmndtplgtdt0(W2,W1,W3) )
       => sdtmndtplgtdt0(W0,W1,W3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCTrans) ).

tff(c_38,plain,
    ~ sdtmndtasgtdt0(xx,xR,xz),
    inference(cnfTransformation,[status(thm)],[f_114]) ).

tff(c_34,plain,
    aRewritingSystem0(xR),
    inference(cnfTransformation,[status(thm)],[f_108]) ).

tff(c_36,plain,
    aElement0(xx),
    inference(cnfTransformation,[status(thm)],[f_108]) ).

tff(c_32,plain,
    aElement0(xy),
    inference(cnfTransformation,[status(thm)],[f_108]) ).

tff(c_42,plain,
    sdtmndtasgtdt0(xx,xR,xy),
    inference(cnfTransformation,[status(thm)],[f_114]) ).

tff(c_24,plain,
    ! [W0_22,W1_23,W2_24] :
      ( sdtmndtplgtdt0(W0_22,W1_23,W2_24)
      | ( W2_24 = W0_22 )
      | ~ sdtmndtasgtdt0(W0_22,W1_23,W2_24)
      | ~ aElement0(W2_24)
      | ~ aRewritingSystem0(W1_23)
      | ~ aElement0(W0_22) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_71,plain,
    ! [W0_49,W1_50,W3_51,W2_52] :
      ( sdtmndtplgtdt0(W0_49,W1_50,W3_51)
      | ~ sdtmndtplgtdt0(W2_52,W1_50,W3_51)
      | ~ sdtmndtplgtdt0(W0_49,W1_50,W2_52)
      | ~ aElement0(W3_51)
      | ~ aElement0(W2_52)
      | ~ aRewritingSystem0(W1_50)
      | ~ aElement0(W0_49) ),
    inference(cnfTransformation,[status(thm)],[f_89]) ).

tff(c_109,plain,
    ! [W0_71,W1_72,W2_73,W0_74] :
      ( sdtmndtplgtdt0(W0_71,W1_72,W2_73)
      | ~ sdtmndtplgtdt0(W0_71,W1_72,W0_74)
      | ~ aElement0(W0_71)
      | ( W2_73 = W0_74 )
      | ~ sdtmndtasgtdt0(W0_74,W1_72,W2_73)
      | ~ aElement0(W2_73)
      | ~ aRewritingSystem0(W1_72)
      | ~ aElement0(W0_74) ),
    inference(resolution,[status(thm)],[c_24,c_71]) ).

tff(c_128,plain,
    ! [W0_86,W1_87,W2_88,W2_89] :
      ( sdtmndtplgtdt0(W0_86,W1_87,W2_88)
      | ( W2_89 = W2_88 )
      | ~ sdtmndtasgtdt0(W2_89,W1_87,W2_88)
      | ~ aElement0(W2_88)
      | ( W2_89 = W0_86 )
      | ~ sdtmndtasgtdt0(W0_86,W1_87,W2_89)
      | ~ aElement0(W2_89)
      | ~ aRewritingSystem0(W1_87)
      | ~ aElement0(W0_86) ),
    inference(resolution,[status(thm)],[c_24,c_109]) ).

tff(c_136,plain,
    ! [W0_86] :
      ( sdtmndtplgtdt0(W0_86,xR,xy)
      | ( xy = xx )
      | ~ aElement0(xy)
      | ( xx = W0_86 )
      | ~ sdtmndtasgtdt0(W0_86,xR,xx)
      | ~ aElement0(xx)
      | ~ aRewritingSystem0(xR)
      | ~ aElement0(W0_86) ),
    inference(resolution,[status(thm)],[c_42,c_128]) ).

tff(c_144,plain,
    ! [W0_86] :
      ( sdtmndtplgtdt0(W0_86,xR,xy)
      | ( xy = xx )
      | ( xx = W0_86 )
      | ~ sdtmndtasgtdt0(W0_86,xR,xx)
      | ~ aElement0(W0_86) ),
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_36,c_32,c_136]) ).

tff(c_148,plain,
    xy = xx,
    inference(splitLeft,[status(thm)],[c_144]) ).

tff(c_40,plain,
    sdtmndtasgtdt0(xy,xR,xz),
    inference(cnfTransformation,[status(thm)],[f_114]) ).

tff(c_151,plain,
    sdtmndtasgtdt0(xx,xR,xz),
    inference(demodulation,[status(thm),theory(equality)],[c_148,c_40]) ).

tff(c_154,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_38,c_151]) ).

tff(c_156,plain,
    xy != xx,
    inference(splitRight,[status(thm)],[c_144]) ).

tff(c_30,plain,
    aElement0(xz),
    inference(cnfTransformation,[status(thm)],[f_108]) ).

tff(c_138,plain,
    ! [W0_86] :
      ( sdtmndtplgtdt0(W0_86,xR,xz)
      | ( xz = xy )
      | ~ aElement0(xz)
      | ( xy = W0_86 )
      | ~ sdtmndtasgtdt0(W0_86,xR,xy)
      | ~ aElement0(xy)
      | ~ aRewritingSystem0(xR)
      | ~ aElement0(W0_86) ),
    inference(resolution,[status(thm)],[c_40,c_128]) ).

tff(c_147,plain,
    ! [W0_86] :
      ( sdtmndtplgtdt0(W0_86,xR,xz)
      | ( xz = xy )
      | ( xy = W0_86 )
      | ~ sdtmndtasgtdt0(W0_86,xR,xy)
      | ~ aElement0(W0_86) ),
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_32,c_30,c_138]) ).

tff(c_190,plain,
    xz = xy,
    inference(splitLeft,[status(thm)],[c_147]) ).

tff(c_208,plain,
    ~ sdtmndtasgtdt0(xx,xR,xy),
    inference(demodulation,[status(thm),theory(equality)],[c_190,c_38]) ).

tff(c_213,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_42,c_208]) ).

tff(c_216,plain,
    ! [W0_96] :
      ( sdtmndtplgtdt0(W0_96,xR,xz)
      | ( xy = W0_96 )
      | ~ sdtmndtasgtdt0(W0_96,xR,xy)
      | ~ aElement0(W0_96) ),
    inference(splitRight,[status(thm)],[c_147]) ).

tff(c_26,plain,
    ! [W0_22,W1_23,W2_24] :
      ( ~ sdtmndtplgtdt0(W0_22,W1_23,W2_24)
      | sdtmndtasgtdt0(W0_22,W1_23,W2_24)
      | ~ aElement0(W2_24)
      | ~ aRewritingSystem0(W1_23)
      | ~ aElement0(W0_22) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_227,plain,
    ! [W0_96] :
      ( sdtmndtasgtdt0(W0_96,xR,xz)
      | ~ aElement0(xz)
      | ~ aRewritingSystem0(xR)
      | ( xy = W0_96 )
      | ~ sdtmndtasgtdt0(W0_96,xR,xy)
      | ~ aElement0(W0_96) ),
    inference(resolution,[status(thm)],[c_216,c_26]) ).

tff(c_243,plain,
    ! [W0_97] :
      ( sdtmndtasgtdt0(W0_97,xR,xz)
      | ( xy = W0_97 )
      | ~ sdtmndtasgtdt0(W0_97,xR,xy)
      | ~ aElement0(W0_97) ),
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_30,c_227]) ).

tff(c_248,plain,
    ( ( xy = xx )
    | ~ sdtmndtasgtdt0(xx,xR,xy)
    | ~ aElement0(xx) ),
    inference(resolution,[status(thm)],[c_243,c_38]) ).

tff(c_254,plain,
    xy = xx,
    inference(demodulation,[status(thm),theory(equality)],[c_36,c_42,c_248]) ).

tff(c_256,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_156,c_254]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : COM012+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/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.13/0.36  % Computer : n015.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit : 300
% 0.13/0.36  % WCLimit  : 300
% 0.13/0.36  % DateTime : Thu Aug  3 23:51:14 EDT 2023
% 0.13/0.36  % CPUTime  : 
% 3.92/1.98  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.92/1.99  
% 3.92/1.99  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.20/2.02  
% 4.20/2.02  Inference rules
% 4.20/2.02  ----------------------
% 4.20/2.02  #Ref     : 0
% 4.20/2.02  #Sup     : 41
% 4.20/2.02  #Fact    : 0
% 4.20/2.02  #Define  : 0
% 4.20/2.02  #Split   : 3
% 4.20/2.02  #Chain   : 0
% 4.20/2.02  #Close   : 0
% 4.20/2.02  
% 4.20/2.02  Ordering : KBO
% 4.20/2.02  
% 4.20/2.02  Simplification rules
% 4.20/2.02  ----------------------
% 4.20/2.02  #Subsume      : 5
% 4.20/2.02  #Demod        : 43
% 4.20/2.02  #Tautology    : 5
% 4.20/2.02  #SimpNegUnit  : 2
% 4.20/2.02  #BackRed      : 7
% 4.20/2.02  
% 4.20/2.02  #Partial instantiations: 0
% 4.20/2.02  #Strategies tried      : 1
% 4.20/2.02  
% 4.20/2.02  Timing (in seconds)
% 4.20/2.02  ----------------------
% 4.20/2.02  Preprocessing        : 0.50
% 4.20/2.02  Parsing              : 0.26
% 4.20/2.02  CNF conversion       : 0.03
% 4.20/2.02  Main loop            : 0.38
% 4.20/2.02  Inferencing          : 0.15
% 4.20/2.02  Reduction            : 0.09
% 4.20/2.02  Demodulation         : 0.06
% 4.20/2.02  BG Simplification    : 0.02
% 4.20/2.02  Subsumption          : 0.10
% 4.20/2.02  Abstraction          : 0.02
% 4.20/2.02  MUC search           : 0.00
% 4.20/2.02  Cooper               : 0.00
% 4.20/2.02  Total                : 0.93
% 4.20/2.02  Index Insertion      : 0.00
% 4.20/2.02  Index Deletion       : 0.00
% 4.20/2.02  Index Matching       : 0.00
% 4.20/2.02  BG Taut test         : 0.00
%------------------------------------------------------------------------------