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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KRS101+1 : TPTP v8.1.2. Released v3.1.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:45:10 EDT 2023

% Result   : Unsatisfiable 3.31s 1.73s
% Output   : CNFRefutation 3.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   37 (   5 unt;  17 typ;   0 def)
%            Number of atoms       :   58 (  10 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   68 (  30   ~;  27   |;   6   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   18 (  16   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   1 con; 0-1 aty)
%            Number of variables   :   29 (;  26   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rs > rr > xsd_string > xsd_integer > cowlThing > cowlNothing > cd > cc > cUnsatisfiable > #nlpp > i2003_11_14_17_20_36582 > #skF_7 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_3 > #skF_6

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_7',type,
    '#skF_7': $i > $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_148,axiom,
    cUnsatisfiable(i2003_11_14_17_20_36582),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

tff(f_140,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> ( ! [Y] :
            ( rr(X,Y)
           => cd(Y) )
        & ! [Y] :
            ( rr(X,Y)
           => ( ~ ? [Z0,Z1] :
                    ( rs(Y,Z0)
                    & rs(Y,Z1)
                    & ( Z0 != Z1 ) )
              | cc(Y) ) )
        & ? [Y] :
            ( rr(X,Y)
            & ~ ! [Z0,Z1] :
                  ( ( rs(Y,Z0)
                    & rs(Y,Z1) )
                 => ( Z0 = Z1 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

tff(f_146,axiom,
    ! [X] :
      ( cc(X)
     => ~ cd(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

tff(c_66,plain,
    cUnsatisfiable(i2003_11_14_17_20_36582),
    inference(cnfTransformation,[status(thm)],[f_148]) ).

tff(c_76,plain,
    ! [X_73] :
      ( ( '#skF_7'(X_73) != '#skF_6'(X_73) )
      | ~ cUnsatisfiable(X_73) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_80,plain,
    '#skF_7'(i2003_11_14_17_20_36582) != '#skF_6'(i2003_11_14_17_20_36582),
    inference(resolution,[status(thm)],[c_66,c_76]) ).

tff(c_38,plain,
    ! [X_29] :
      ( rr(X_29,'#skF_5'(X_29))
      | ~ cUnsatisfiable(X_29) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_34,plain,
    ! [X_29] :
      ( rs('#skF_5'(X_29),'#skF_7'(X_29))
      | ~ cUnsatisfiable(X_29) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_36,plain,
    ! [X_29] :
      ( rs('#skF_5'(X_29),'#skF_6'(X_29))
      | ~ cUnsatisfiable(X_29) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_95,plain,
    ! [Y_81,Z1_82,Z0_83,X_84] :
      ( cc(Y_81)
      | ( Z1_82 = Z0_83 )
      | ~ rs(Y_81,Z1_82)
      | ~ rs(Y_81,Z0_83)
      | ~ rr(X_84,Y_81)
      | ~ cUnsatisfiable(X_84) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_103,plain,
    ! [X_89,Z0_90,X_91] :
      ( cc('#skF_5'(X_89))
      | ( Z0_90 = '#skF_6'(X_89) )
      | ~ rs('#skF_5'(X_89),Z0_90)
      | ~ rr(X_91,'#skF_5'(X_89))
      | ~ cUnsatisfiable(X_91)
      | ~ cUnsatisfiable(X_89) ),
    inference(resolution,[status(thm)],[c_36,c_95]) ).

tff(c_111,plain,
    ! [X_92,X_93] :
      ( cc('#skF_5'(X_92))
      | ( '#skF_7'(X_92) = '#skF_6'(X_92) )
      | ~ rr(X_93,'#skF_5'(X_92))
      | ~ cUnsatisfiable(X_93)
      | ~ cUnsatisfiable(X_92) ),
    inference(resolution,[status(thm)],[c_34,c_103]) ).

tff(c_116,plain,
    ! [X_94] :
      ( cc('#skF_5'(X_94))
      | ( '#skF_7'(X_94) = '#skF_6'(X_94) )
      | ~ cUnsatisfiable(X_94) ),
    inference(resolution,[status(thm)],[c_38,c_111]) ).

tff(c_82,plain,
    ! [Y_75,X_76] :
      ( cd(Y_75)
      | ~ rr(X_76,Y_75)
      | ~ cUnsatisfiable(X_76) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_87,plain,
    ! [X_77] :
      ( cd('#skF_5'(X_77))
      | ~ cUnsatisfiable(X_77) ),
    inference(resolution,[status(thm)],[c_38,c_82]) ).

tff(c_64,plain,
    ! [X_67] :
      ( ~ cd(X_67)
      | ~ cc(X_67) ),
    inference(cnfTransformation,[status(thm)],[f_146]) ).

tff(c_91,plain,
    ! [X_77] :
      ( ~ cc('#skF_5'(X_77))
      | ~ cUnsatisfiable(X_77) ),
    inference(resolution,[status(thm)],[c_87,c_64]) ).

tff(c_128,plain,
    ! [X_99] :
      ( ( '#skF_7'(X_99) = '#skF_6'(X_99) )
      | ~ cUnsatisfiable(X_99) ),
    inference(resolution,[status(thm)],[c_116,c_91]) ).

tff(c_131,plain,
    '#skF_7'(i2003_11_14_17_20_36582) = '#skF_6'(i2003_11_14_17_20_36582),
    inference(resolution,[status(thm)],[c_66,c_128]) ).

tff(c_135,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_80,c_131]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : KRS101+1 : TPTP v8.1.2. Released v3.1.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.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 20:34:09 EDT 2023
% 0.12/0.35  % CPUTime  : 
% 3.31/1.73  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.39/1.74  
% 3.39/1.74  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.39/1.76  
% 3.39/1.76  Inference rules
% 3.39/1.76  ----------------------
% 3.39/1.76  #Ref     : 0
% 3.39/1.76  #Sup     : 13
% 3.39/1.76  #Fact    : 0
% 3.39/1.76  #Define  : 0
% 3.39/1.76  #Split   : 0
% 3.39/1.76  #Chain   : 0
% 3.39/1.76  #Close   : 0
% 3.39/1.76  
% 3.39/1.76  Ordering : KBO
% 3.39/1.76  
% 3.39/1.76  Simplification rules
% 3.39/1.76  ----------------------
% 3.39/1.76  #Subsume      : 2
% 3.39/1.76  #Demod        : 0
% 3.39/1.76  #Tautology    : 13
% 3.39/1.76  #SimpNegUnit  : 1
% 3.39/1.76  #BackRed      : 0
% 3.39/1.76  
% 3.39/1.76  #Partial instantiations: 0
% 3.39/1.76  #Strategies tried      : 1
% 3.39/1.76  
% 3.39/1.76  Timing (in seconds)
% 3.39/1.76  ----------------------
% 3.39/1.77  Preprocessing        : 0.51
% 3.39/1.77  Parsing              : 0.25
% 3.39/1.77  CNF conversion       : 0.04
% 3.39/1.77  Main loop            : 0.22
% 3.39/1.77  Inferencing          : 0.08
% 3.39/1.77  Reduction            : 0.05
% 3.39/1.77  Demodulation         : 0.04
% 3.39/1.77  BG Simplification    : 0.03
% 3.39/1.77  Subsumption          : 0.05
% 3.39/1.77  Abstraction          : 0.01
% 3.39/1.77  MUC search           : 0.00
% 3.39/1.77  Cooper               : 0.00
% 3.39/1.77  Total                : 0.77
% 3.39/1.77  Index Insertion      : 0.00
% 3.39/1.77  Index Deletion       : 0.00
% 3.39/1.77  Index Matching       : 0.00
% 3.39/1.77  BG Taut test         : 0.00
%------------------------------------------------------------------------------