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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KRS076+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/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 : 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:45:07 EDT 2023

% Result   : Unsatisfiable 3.86s 1.96s
% Output   : CNFRefutation 3.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   51 (   6 unt;  17 typ;   0 def)
%            Number of atoms       :   79 (  10 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   79 (  34   ~;  31   |;   7   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   24 (  16   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :   14 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   51 (;  48   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rs > rinvS > rinvF1 > rinvF > rf1 > rf > xsd_string > xsd_integer > cp > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_19_06193 > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_207,axiom,
    cUnsatisfiable(i2003_11_14_17_19_06193),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).

tff(f_169,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> ( ? [Y] :
            ( rf(X,Y)
            & cp(Y) )
        & ? [Y] :
            ( rf1(X,Y)
            & ~ cp(Y)
            & ! [Z] :
                ( rinvF1(Y,Z)
               => ? [W] :
                    ( rs(Z,W)
                    & cowlThing(W) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

tff(f_193,axiom,
    ! [X,Y] :
      ( rinvF1(X,Y)
    <=> rf1(Y,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

tff(f_215,axiom,
    ! [X,Y] :
      ( rs(X,Y)
     => rf(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).

tff(f_176,axiom,
    ! [X,Y,Z] :
      ( ( rf(X,Y)
        & rf(X,Z) )
     => ( Y = Z ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

tff(f_211,axiom,
    ! [X,Y] :
      ( rs(X,Y)
     => rf1(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).

tff(f_183,axiom,
    ! [X,Y,Z] :
      ( ( rf1(X,Y)
        & rf1(X,Z) )
     => ( Y = Z ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

tff(c_80,plain,
    cUnsatisfiable(i2003_11_14_17_19_06193),
    inference(cnfTransformation,[status(thm)],[f_207]) ).

tff(c_48,plain,
    ! [X_51] :
      ( rf1(X_51,'#skF_3'(X_51))
      | ~ cUnsatisfiable(X_51) ),
    inference(cnfTransformation,[status(thm)],[f_169]) ).

tff(c_72,plain,
    ! [X_88,Y_89] :
      ( rinvF1(X_88,Y_89)
      | ~ rf1(Y_89,X_88) ),
    inference(cnfTransformation,[status(thm)],[f_193]) ).

tff(c_158,plain,
    ! [Z_143,X_144] :
      ( rs(Z_143,'#skF_4'(X_144,Z_143))
      | ~ rinvF1('#skF_3'(X_144),Z_143)
      | ~ cUnsatisfiable(X_144) ),
    inference(cnfTransformation,[status(thm)],[f_169]) ).

tff(c_84,plain,
    ! [X_97,Y_98] :
      ( rf(X_97,Y_98)
      | ~ rs(X_97,Y_98) ),
    inference(cnfTransformation,[status(thm)],[f_215]) ).

tff(c_199,plain,
    ! [Z_155,X_156] :
      ( rf(Z_155,'#skF_4'(X_156,Z_155))
      | ~ rinvF1('#skF_3'(X_156),Z_155)
      | ~ cUnsatisfiable(X_156) ),
    inference(resolution,[status(thm)],[c_158,c_84]) ).

tff(c_204,plain,
    ! [Y_157,X_158] :
      ( rf(Y_157,'#skF_4'(X_158,Y_157))
      | ~ cUnsatisfiable(X_158)
      | ~ rf1(Y_157,'#skF_3'(X_158)) ),
    inference(resolution,[status(thm)],[c_72,c_199]) ).

tff(c_208,plain,
    ! [X_159] :
      ( rf(X_159,'#skF_4'(X_159,X_159))
      | ~ cUnsatisfiable(X_159) ),
    inference(resolution,[status(thm)],[c_48,c_204]) ).

tff(c_52,plain,
    ! [X_51] :
      ( rf(X_51,'#skF_2'(X_51))
      | ~ cUnsatisfiable(X_51) ),
    inference(cnfTransformation,[status(thm)],[f_169]) ).

tff(c_138,plain,
    ! [Z_133,Y_134,X_135] :
      ( ( Z_133 = Y_134 )
      | ~ rf(X_135,Z_133)
      | ~ rf(X_135,Y_134) ),
    inference(cnfTransformation,[status(thm)],[f_176]) ).

tff(c_141,plain,
    ! [Y_134,X_51] :
      ( ( Y_134 = '#skF_2'(X_51) )
      | ~ rf(X_51,Y_134)
      | ~ cUnsatisfiable(X_51) ),
    inference(resolution,[status(thm)],[c_52,c_138]) ).

tff(c_219,plain,
    ! [X_160] :
      ( ( '#skF_4'(X_160,X_160) = '#skF_2'(X_160) )
      | ~ cUnsatisfiable(X_160) ),
    inference(resolution,[status(thm)],[c_208,c_141]) ).

tff(c_222,plain,
    '#skF_2'(i2003_11_14_17_19_06193) = '#skF_4'(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193),
    inference(resolution,[status(thm)],[c_80,c_219]) ).

tff(c_50,plain,
    ! [X_51] :
      ( cp('#skF_2'(X_51))
      | ~ cUnsatisfiable(X_51) ),
    inference(cnfTransformation,[status(thm)],[f_169]) ).

tff(c_238,plain,
    ( cp('#skF_4'(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193))
    | ~ cUnsatisfiable(i2003_11_14_17_19_06193) ),
    inference(superposition,[status(thm),theory(equality)],[c_222,c_50]) ).

tff(c_244,plain,
    cp('#skF_4'(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193)),
    inference(demodulation,[status(thm),theory(equality)],[c_80,c_238]) ).

tff(c_82,plain,
    ! [X_95,Y_96] :
      ( rf1(X_95,Y_96)
      | ~ rs(X_95,Y_96) ),
    inference(cnfTransformation,[status(thm)],[f_211]) ).

tff(c_178,plain,
    ! [Z_148,X_149] :
      ( rf1(Z_148,'#skF_4'(X_149,Z_148))
      | ~ rinvF1('#skF_3'(X_149),Z_148)
      | ~ cUnsatisfiable(X_149) ),
    inference(resolution,[status(thm)],[c_158,c_82]) ).

tff(c_295,plain,
    ! [Y_168,X_169] :
      ( rf1(Y_168,'#skF_4'(X_169,Y_168))
      | ~ cUnsatisfiable(X_169)
      | ~ rf1(Y_168,'#skF_3'(X_169)) ),
    inference(resolution,[status(thm)],[c_72,c_178]) ).

tff(c_299,plain,
    ! [X_170] :
      ( rf1(X_170,'#skF_4'(X_170,X_170))
      | ~ cUnsatisfiable(X_170) ),
    inference(resolution,[status(thm)],[c_48,c_295]) ).

tff(c_130,plain,
    ! [Z_127,Y_128,X_129] :
      ( ( Z_127 = Y_128 )
      | ~ rf1(X_129,Z_127)
      | ~ rf1(X_129,Y_128) ),
    inference(cnfTransformation,[status(thm)],[f_183]) ).

tff(c_133,plain,
    ! [Y_128,X_51] :
      ( ( Y_128 = '#skF_3'(X_51) )
      | ~ rf1(X_51,Y_128)
      | ~ cUnsatisfiable(X_51) ),
    inference(resolution,[status(thm)],[c_48,c_130]) ).

tff(c_307,plain,
    ! [X_171] :
      ( ( '#skF_4'(X_171,X_171) = '#skF_3'(X_171) )
      | ~ cUnsatisfiable(X_171) ),
    inference(resolution,[status(thm)],[c_299,c_133]) ).

tff(c_310,plain,
    '#skF_3'(i2003_11_14_17_19_06193) = '#skF_4'(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193),
    inference(resolution,[status(thm)],[c_80,c_307]) ).

tff(c_46,plain,
    ! [X_51] :
      ( ~ cp('#skF_3'(X_51))
      | ~ cUnsatisfiable(X_51) ),
    inference(cnfTransformation,[status(thm)],[f_169]) ).

tff(c_325,plain,
    ( ~ cp('#skF_4'(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193))
    | ~ cUnsatisfiable(i2003_11_14_17_19_06193) ),
    inference(superposition,[status(thm),theory(equality)],[c_310,c_46]) ).

tff(c_340,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_80,c_244,c_325]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : KRS076+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.15  % 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.14/0.36  % Computer : n020.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 20:06:07 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 3.86/1.96  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.86/1.96  
% 3.86/1.96  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.86/1.99  
% 3.86/1.99  Inference rules
% 3.86/1.99  ----------------------
% 3.86/1.99  #Ref     : 0
% 3.86/1.99  #Sup     : 55
% 3.86/1.99  #Fact    : 0
% 3.86/1.99  #Define  : 0
% 3.86/1.99  #Split   : 0
% 3.86/1.99  #Chain   : 0
% 3.86/1.99  #Close   : 0
% 3.86/1.99  
% 3.86/1.99  Ordering : KBO
% 3.86/1.99  
% 3.86/1.99  Simplification rules
% 3.86/1.99  ----------------------
% 3.86/1.99  #Subsume      : 3
% 3.86/1.99  #Demod        : 19
% 3.86/1.99  #Tautology    : 37
% 3.86/1.99  #SimpNegUnit  : 0
% 3.86/1.99  #BackRed      : 0
% 3.86/1.99  
% 3.86/1.99  #Partial instantiations: 0
% 3.86/1.99  #Strategies tried      : 1
% 3.86/1.99  
% 3.86/1.99  Timing (in seconds)
% 3.86/1.99  ----------------------
% 3.86/1.99  Preprocessing        : 0.54
% 3.86/1.99  Parsing              : 0.29
% 3.86/1.99  CNF conversion       : 0.04
% 3.86/1.99  Main loop            : 0.32
% 3.86/1.99  Inferencing          : 0.14
% 3.86/1.99  Reduction            : 0.07
% 3.86/1.99  Demodulation         : 0.05
% 3.86/1.99  BG Simplification    : 0.03
% 3.86/1.99  Subsumption          : 0.07
% 3.86/1.99  Abstraction          : 0.01
% 3.86/1.99  MUC search           : 0.00
% 3.86/1.99  Cooper               : 0.00
% 3.86/1.99  Total                : 0.91
% 3.86/1.99  Index Insertion      : 0.00
% 3.86/1.99  Index Deletion       : 0.00
% 3.86/1.99  Index Matching       : 0.00
% 3.86/1.99  BG Taut test         : 0.00
%------------------------------------------------------------------------------