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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KRS095+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 : n021.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:09 EDT 2023

% Result   : Unsatisfiable 3.28s 1.77s
% Output   : CNFRefutation 3.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   25 (   5 unt;  13 typ;   0 def)
%            Number of atoms       :   27 (   8 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   27 (  12   ~;   9   |;   4   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   13 (  12   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   14 (;  12   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rr > xsd_string > xsd_integer > cowlThing > cowlNothing > cd > cc > cUnsatisfiable > #nlpp > i2003_11_14_17_20_14253 > #skF_2 > #skF_4 > #skF_1 > #skF_3

%Foreground sorts:

%Background operators:

%Foreground operators:
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('#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_14253,type,
    i2003_11_14_17_20_14253: $i ).

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

tff(f_121,axiom,
    cUnsatisfiable(i2003_11_14_17_20_14253),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

tff(f_113,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> ( ? [Y0,Y1] :
            ( rr(X,Y0)
            & rr(X,Y1)
            & ( Y0 != Y1 ) )
        & ! [Y0,Y1] :
            ( ( rr(X,Y0)
              & rr(X,Y1) )
           => ( Y0 = Y1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

tff(c_44,plain,
    cUnsatisfiable(i2003_11_14_17_20_14253),
    inference(cnfTransformation,[status(thm)],[f_121]) ).

tff(c_55,plain,
    ! [X_43] :
      ( ( '#skF_4'(X_43) != '#skF_3'(X_43) )
      | ~ cUnsatisfiable(X_43) ),
    inference(cnfTransformation,[status(thm)],[f_113]) ).

tff(c_59,plain,
    '#skF_4'(i2003_11_14_17_20_14253) != '#skF_3'(i2003_11_14_17_20_14253),
    inference(resolution,[status(thm)],[c_44,c_55]) ).

tff(c_34,plain,
    ! [X_23] :
      ( rr(X_23,'#skF_3'(X_23))
      | ~ cUnsatisfiable(X_23) ),
    inference(cnfTransformation,[status(thm)],[f_113]) ).

tff(c_32,plain,
    ! [X_23] :
      ( rr(X_23,'#skF_4'(X_23))
      | ~ cUnsatisfiable(X_23) ),
    inference(cnfTransformation,[status(thm)],[f_113]) ).

tff(c_61,plain,
    ! [Y1_45,Y0_46,X_47] :
      ( ( Y1_45 = Y0_46 )
      | ~ rr(X_47,Y1_45)
      | ~ rr(X_47,Y0_46)
      | ~ cUnsatisfiable(X_47) ),
    inference(cnfTransformation,[status(thm)],[f_113]) ).

tff(c_68,plain,
    ! [Y0_48,X_49] :
      ( ( Y0_48 = '#skF_4'(X_49) )
      | ~ rr(X_49,Y0_48)
      | ~ cUnsatisfiable(X_49) ),
    inference(resolution,[status(thm)],[c_32,c_61]) ).

tff(c_78,plain,
    ! [X_50] :
      ( ( '#skF_4'(X_50) = '#skF_3'(X_50) )
      | ~ cUnsatisfiable(X_50) ),
    inference(resolution,[status(thm)],[c_34,c_68]) ).

tff(c_81,plain,
    '#skF_4'(i2003_11_14_17_20_14253) = '#skF_3'(i2003_11_14_17_20_14253),
    inference(resolution,[status(thm)],[c_44,c_78]) ).

tff(c_85,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_59,c_81]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : KRS095+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/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.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu Aug  3 20:03:21 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 3.28/1.77  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.28/1.77  
% 3.28/1.77  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.53/1.80  
% 3.53/1.80  Inference rules
% 3.53/1.80  ----------------------
% 3.53/1.80  #Ref     : 0
% 3.53/1.80  #Sup     : 7
% 3.53/1.80  #Fact    : 0
% 3.53/1.80  #Define  : 0
% 3.53/1.80  #Split   : 0
% 3.53/1.80  #Chain   : 0
% 3.53/1.80  #Close   : 0
% 3.53/1.80  
% 3.53/1.80  Ordering : KBO
% 3.53/1.80  
% 3.53/1.80  Simplification rules
% 3.53/1.80  ----------------------
% 3.53/1.80  #Subsume      : 0
% 3.53/1.80  #Demod        : 0
% 3.53/1.80  #Tautology    : 11
% 3.53/1.80  #SimpNegUnit  : 1
% 3.53/1.80  #BackRed      : 0
% 3.53/1.80  
% 3.53/1.80  #Partial instantiations: 0
% 3.53/1.80  #Strategies tried      : 1
% 3.53/1.80  
% 3.53/1.80  Timing (in seconds)
% 3.53/1.80  ----------------------
% 3.53/1.80  Preprocessing        : 0.52
% 3.53/1.80  Parsing              : 0.26
% 3.53/1.80  CNF conversion       : 0.04
% 3.53/1.80  Main loop            : 0.17
% 3.53/1.80  Inferencing          : 0.07
% 3.53/1.80  Reduction            : 0.04
% 3.53/1.80  Demodulation         : 0.03
% 3.53/1.80  BG Simplification    : 0.02
% 3.53/1.80  Subsumption          : 0.04
% 3.53/1.80  Abstraction          : 0.01
% 3.53/1.80  MUC search           : 0.00
% 3.53/1.80  Cooper               : 0.00
% 3.53/1.80  Total                : 0.73
% 3.53/1.80  Index Insertion      : 0.00
% 3.53/1.80  Index Deletion       : 0.00
% 3.53/1.80  Index Matching       : 0.00
% 3.53/1.80  BG Taut test         : 0.00
%------------------------------------------------------------------------------