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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KRS114+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 : n025.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:12 EDT 2023

% Result   : Unsatisfiable 4.20s 1.96s
% Output   : CNFRefutation 4.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   36
% Syntax   : Number of formulae    :   62 (   4 unt;  28 typ;   0 def)
%            Number of atoms       :   81 (   5 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   85 (  38   ~;  31   |;   7   &)
%                                         (   7 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   32 (  27   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :   19 (  17 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   1 con; 0-1 aty)
%            Number of variables   :   46 (;  41   !;   5   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rs > rr > rinvR > ra_Px2 > ra_Px1 > xsd_string > xsd_integer > cqxcomp > cq > cpxcomp > cp > cowlThing > cowlNothing > ca_Vx5 > ca_Ax4 > ca_Ax3 > cUnsatisfiable > #nlpp > i2003_11_14_17_21_262 > #skF_9 > #skF_7 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_8 > #skF_10 > #skF_3 > #skF_6

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_184,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> ( ? [Y] :
            ( rr(X,Y)
            & ca_Ax4(Y) )
        & ? [Y] :
            ( rs(X,Y)
            & ca_Ax3(Y) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

tff(f_245,axiom,
    ! [X,Y] :
      ( rinvR(X,Y)
    <=> rr(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).

tff(f_232,axiom,
    ! [X] :
      ( ca_Ax4(X)
    <=> ( ! [Y0,Y1] :
            ( ( rinvR(X,Y0)
              & rinvR(X,Y1) )
           => ( Y0 = Y1 ) )
        & ? [Y] :
            ( rinvR(X,Y)
            & ca_Vx5(Y) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).

tff(f_240,axiom,
    ! [X] :
      ( ca_Vx5(X)
    <=> ! [Y] :
          ( rs(X,Y)
         => cp(Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).

tff(f_217,axiom,
    ! [X] :
      ( ca_Ax3(X)
    <=> ( cqxcomp(X)
        & cpxcomp(X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).

tff(f_197,axiom,
    ! [X] :
      ( cpxcomp(X)
    <=> ? [Y0] : ra_Px1(X,Y0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

tff(f_191,axiom,
    ! [X] :
      ( cp(X)
    <=> ~ ? [Y] : ra_Px1(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

tff(f_247,axiom,
    cUnsatisfiable(i2003_11_14_17_21_262),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).

tff(c_60,plain,
    ! [X_57] :
      ( ca_Ax4('#skF_1'(X_57))
      | ~ cUnsatisfiable(X_57) ),
    inference(cnfTransformation,[status(thm)],[f_184]) ).

tff(c_62,plain,
    ! [X_57] :
      ( rr(X_57,'#skF_1'(X_57))
      | ~ cUnsatisfiable(X_57) ),
    inference(cnfTransformation,[status(thm)],[f_184]) ).

tff(c_142,plain,
    ! [X_123,Y_124] :
      ( rinvR(X_123,Y_124)
      | ~ rr(Y_124,X_123) ),
    inference(cnfTransformation,[status(thm)],[f_245]) ).

tff(c_149,plain,
    ! [X_57] :
      ( rinvR('#skF_1'(X_57),X_57)
      | ~ cUnsatisfiable(X_57) ),
    inference(resolution,[status(thm)],[c_62,c_142]) ).

tff(c_88,plain,
    ! [X_81] :
      ( rinvR(X_81,'#skF_9'(X_81))
      | ~ ca_Ax4(X_81) ),
    inference(cnfTransformation,[status(thm)],[f_232]) ).

tff(c_223,plain,
    ! [Y1_138,Y0_139,X_140] :
      ( ( Y1_138 = Y0_139 )
      | ~ rinvR(X_140,Y1_138)
      | ~ rinvR(X_140,Y0_139)
      | ~ ca_Ax4(X_140) ),
    inference(cnfTransformation,[status(thm)],[f_232]) ).

tff(c_255,plain,
    ! [Y0_147,X_148] :
      ( ( Y0_147 = '#skF_9'(X_148) )
      | ~ rinvR(X_148,Y0_147)
      | ~ ca_Ax4(X_148) ),
    inference(resolution,[status(thm)],[c_88,c_223]) ).

tff(c_265,plain,
    ! [X_149] :
      ( ( '#skF_9'('#skF_1'(X_149)) = X_149 )
      | ~ ca_Ax4('#skF_1'(X_149))
      | ~ cUnsatisfiable(X_149) ),
    inference(resolution,[status(thm)],[c_149,c_255]) ).

tff(c_270,plain,
    ! [X_150] :
      ( ( '#skF_9'('#skF_1'(X_150)) = X_150 )
      | ~ cUnsatisfiable(X_150) ),
    inference(resolution,[status(thm)],[c_60,c_265]) ).

tff(c_86,plain,
    ! [X_81] :
      ( ca_Vx5('#skF_9'(X_81))
      | ~ ca_Ax4(X_81) ),
    inference(cnfTransformation,[status(thm)],[f_232]) ).

tff(c_288,plain,
    ! [X_151] :
      ( ca_Vx5(X_151)
      | ~ ca_Ax4('#skF_1'(X_151))
      | ~ cUnsatisfiable(X_151) ),
    inference(superposition,[status(thm),theory(equality)],[c_270,c_86]) ).

tff(c_300,plain,
    ! [X_154] :
      ( ca_Vx5(X_154)
      | ~ cUnsatisfiable(X_154) ),
    inference(resolution,[status(thm)],[c_60,c_288]) ).

tff(c_56,plain,
    ! [X_57] :
      ( ca_Ax3('#skF_2'(X_57))
      | ~ cUnsatisfiable(X_57) ),
    inference(cnfTransformation,[status(thm)],[f_184]) ).

tff(c_58,plain,
    ! [X_57] :
      ( rs(X_57,'#skF_2'(X_57))
      | ~ cUnsatisfiable(X_57) ),
    inference(cnfTransformation,[status(thm)],[f_184]) ).

tff(c_214,plain,
    ! [Y_136,X_137] :
      ( cp(Y_136)
      | ~ rs(X_137,Y_136)
      | ~ ca_Vx5(X_137) ),
    inference(cnfTransformation,[status(thm)],[f_240]) ).

tff(c_230,plain,
    ! [X_141] :
      ( cp('#skF_2'(X_141))
      | ~ ca_Vx5(X_141)
      | ~ cUnsatisfiable(X_141) ),
    inference(resolution,[status(thm)],[c_58,c_214]) ).

tff(c_82,plain,
    ! [X_80] :
      ( cpxcomp(X_80)
      | ~ ca_Ax3(X_80) ),
    inference(cnfTransformation,[status(thm)],[f_217]) ).

tff(c_161,plain,
    ! [X_127] :
      ( ra_Px1(X_127,'#skF_4'(X_127))
      | ~ cpxcomp(X_127) ),
    inference(cnfTransformation,[status(thm)],[f_197]) ).

tff(c_64,plain,
    ! [X_64,Y_67] :
      ( ~ ra_Px1(X_64,Y_67)
      | ~ cp(X_64) ),
    inference(cnfTransformation,[status(thm)],[f_191]) ).

tff(c_170,plain,
    ! [X_128] :
      ( ~ cp(X_128)
      | ~ cpxcomp(X_128) ),
    inference(resolution,[status(thm)],[c_161,c_64]) ).

tff(c_178,plain,
    ! [X_80] :
      ( ~ cp(X_80)
      | ~ ca_Ax3(X_80) ),
    inference(resolution,[status(thm)],[c_82,c_170]) ).

tff(c_235,plain,
    ! [X_142] :
      ( ~ ca_Ax3('#skF_2'(X_142))
      | ~ ca_Vx5(X_142)
      | ~ cUnsatisfiable(X_142) ),
    inference(resolution,[status(thm)],[c_230,c_178]) ).

tff(c_239,plain,
    ! [X_57] :
      ( ~ ca_Vx5(X_57)
      | ~ cUnsatisfiable(X_57) ),
    inference(resolution,[status(thm)],[c_56,c_235]) ).

tff(c_304,plain,
    ! [X_154] : ~ cUnsatisfiable(X_154),
    inference(resolution,[status(thm)],[c_300,c_239]) ).

tff(c_108,plain,
    cUnsatisfiable(i2003_11_14_17_21_262),
    inference(cnfTransformation,[status(thm)],[f_247]) ).

tff(c_306,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_304,c_108]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : KRS114+1 : TPTP v8.1.2. Released v3.1.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.15/0.36  % Computer : n025.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 20:16:05 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 4.20/1.96  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/1.97  
% 4.20/1.97  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.23/2.00  
% 4.23/2.00  Inference rules
% 4.23/2.00  ----------------------
% 4.23/2.00  #Ref     : 0
% 4.23/2.00  #Sup     : 39
% 4.23/2.00  #Fact    : 0
% 4.23/2.00  #Define  : 0
% 4.23/2.00  #Split   : 0
% 4.23/2.00  #Chain   : 0
% 4.23/2.00  #Close   : 0
% 4.23/2.00  
% 4.23/2.00  Ordering : KBO
% 4.23/2.00  
% 4.23/2.00  Simplification rules
% 4.23/2.00  ----------------------
% 4.23/2.00  #Subsume      : 16
% 4.23/2.00  #Demod        : 0
% 4.23/2.00  #Tautology    : 38
% 4.23/2.00  #SimpNegUnit  : 1
% 4.23/2.00  #BackRed      : 1
% 4.23/2.00  
% 4.23/2.00  #Partial instantiations: 0
% 4.23/2.00  #Strategies tried      : 1
% 4.23/2.00  
% 4.23/2.00  Timing (in seconds)
% 4.23/2.00  ----------------------
% 4.23/2.00  Preprocessing        : 0.57
% 4.23/2.00  Parsing              : 0.29
% 4.23/2.00  CNF conversion       : 0.04
% 4.23/2.00  Main loop            : 0.27
% 4.23/2.00  Inferencing          : 0.12
% 4.23/2.00  Reduction            : 0.06
% 4.23/2.00  Demodulation         : 0.04
% 4.23/2.00  BG Simplification    : 0.03
% 4.23/2.00  Subsumption          : 0.05
% 4.23/2.00  Abstraction          : 0.02
% 4.23/2.00  MUC search           : 0.00
% 4.23/2.00  Cooper               : 0.00
% 4.23/2.00  Total                : 0.90
% 4.23/2.00  Index Insertion      : 0.00
% 4.23/2.00  Index Deletion       : 0.00
% 4.23/2.00  Index Matching       : 0.00
% 4.23/2.00  BG Taut test         : 0.00
%------------------------------------------------------------------------------