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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KRS086+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 : n023.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:08 EDT 2023

% Result   : Unsatisfiable 3.70s 1.84s
% Output   : CNFRefutation 3.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   36 (   7 unt;  14 typ;   0 def)
%            Number of atoms       :   47 (   6 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   44 (  19   ~;  15   |;   6   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   17 (  13   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   27 (;  24   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rr > rinvR > rinvF > rf > xsd_string > xsd_integer > cp1 > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_19_42328 > #skF_2 > #skF_1 > #skF_3

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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(cowlNothing,type,
    cowlNothing: $i > $o ).

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

tff(f_169,axiom,
    cUnsatisfiable(i2003_11_14_17_19_42328),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).

tff(f_140,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> ? [Y] :
          ( rf(X,Y)
          & ? [Z] :
              ( rinvF(Y,Z)
              & ? [W] :
                  ( rf(Z,W)
                  & ~ cp1(W) ) )
          & cp1(Y) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

tff(f_155,axiom,
    ! [X,Y] :
      ( rinvF(X,Y)
    <=> rf(Y,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

tff(f_117,axiom,
    ! [X] :
      ( cowlThing(X)
      & ~ cowlNothing(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).

tff(f_150,axiom,
    ! [X] :
      ( cowlThing(X)
     => ! [Y0,Y1] :
          ( ( rf(X,Y0)
            & rf(X,Y1) )
         => ( Y0 = Y1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

tff(c_62,plain,
    cUnsatisfiable(i2003_11_14_17_19_42328),
    inference(cnfTransformation,[status(thm)],[f_169]) ).

tff(c_89,plain,
    ! [X_93] :
      ( rinvF('#skF_1'(X_93),'#skF_2'(X_93))
      | ~ cUnsatisfiable(X_93) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_52,plain,
    ! [Y_71,X_70] :
      ( rf(Y_71,X_70)
      | ~ rinvF(X_70,Y_71) ),
    inference(cnfTransformation,[status(thm)],[f_155]) ).

tff(c_93,plain,
    ! [X_93] :
      ( rf('#skF_2'(X_93),'#skF_1'(X_93))
      | ~ cUnsatisfiable(X_93) ),
    inference(resolution,[status(thm)],[c_89,c_52]) ).

tff(c_44,plain,
    ! [X_39] :
      ( rf('#skF_2'(X_39),'#skF_3'(X_39))
      | ~ cUnsatisfiable(X_39) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_30,plain,
    ! [X_37] : cowlThing(X_37),
    inference(cnfTransformation,[status(thm)],[f_117]) ).

tff(c_50,plain,
    ! [Y1_69,Y0_68,X_65] :
      ( ( Y1_69 = Y0_68 )
      | ~ rf(X_65,Y1_69)
      | ~ rf(X_65,Y0_68)
      | ~ cowlThing(X_65) ),
    inference(cnfTransformation,[status(thm)],[f_150]) ).

tff(c_95,plain,
    ! [Y1_95,Y0_96,X_97] :
      ( ( Y1_95 = Y0_96 )
      | ~ rf(X_97,Y1_95)
      | ~ rf(X_97,Y0_96) ),
    inference(demodulation,[status(thm),theory(equality)],[c_30,c_50]) ).

tff(c_123,plain,
    ! [Y0_103,X_104] :
      ( ( Y0_103 = '#skF_3'(X_104) )
      | ~ rf('#skF_2'(X_104),Y0_103)
      | ~ cUnsatisfiable(X_104) ),
    inference(resolution,[status(thm)],[c_44,c_95]) ).

tff(c_148,plain,
    ! [X_109] :
      ( ( '#skF_1'(X_109) = '#skF_3'(X_109) )
      | ~ cUnsatisfiable(X_109) ),
    inference(resolution,[status(thm)],[c_93,c_123]) ).

tff(c_152,plain,
    '#skF_1'(i2003_11_14_17_19_42328) = '#skF_3'(i2003_11_14_17_19_42328),
    inference(resolution,[status(thm)],[c_62,c_148]) ).

tff(c_40,plain,
    ! [X_39] :
      ( cp1('#skF_1'(X_39))
      | ~ cUnsatisfiable(X_39) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_165,plain,
    ( cp1('#skF_3'(i2003_11_14_17_19_42328))
    | ~ cUnsatisfiable(i2003_11_14_17_19_42328) ),
    inference(superposition,[status(thm),theory(equality)],[c_152,c_40]) ).

tff(c_175,plain,
    cp1('#skF_3'(i2003_11_14_17_19_42328)),
    inference(demodulation,[status(thm),theory(equality)],[c_62,c_165]) ).

tff(c_42,plain,
    ! [X_39] :
      ( ~ cp1('#skF_3'(X_39))
      | ~ cUnsatisfiable(X_39) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_179,plain,
    ~ cUnsatisfiable(i2003_11_14_17_19_42328),
    inference(resolution,[status(thm)],[c_175,c_42]) ).

tff(c_183,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_62,c_179]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : KRS086+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/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.16/0.37  % Computer : n023.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu Aug  3 20:28:37 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 3.70/1.84  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.70/1.85  
% 3.70/1.85  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.70/1.88  
% 3.70/1.88  Inference rules
% 3.70/1.88  ----------------------
% 3.70/1.88  #Ref     : 0
% 3.70/1.88  #Sup     : 25
% 3.70/1.88  #Fact    : 0
% 3.70/1.88  #Define  : 0
% 3.70/1.88  #Split   : 0
% 3.70/1.88  #Chain   : 0
% 3.70/1.88  #Close   : 0
% 3.70/1.88  
% 3.70/1.88  Ordering : KBO
% 3.70/1.88  
% 3.70/1.88  Simplification rules
% 3.70/1.88  ----------------------
% 3.70/1.88  #Subsume      : 2
% 3.70/1.88  #Demod        : 6
% 3.70/1.88  #Tautology    : 21
% 3.70/1.88  #SimpNegUnit  : 0
% 3.70/1.88  #BackRed      : 0
% 3.70/1.88  
% 3.70/1.88  #Partial instantiations: 0
% 3.70/1.88  #Strategies tried      : 1
% 3.70/1.88  
% 3.70/1.88  Timing (in seconds)
% 3.70/1.88  ----------------------
% 3.70/1.88  Preprocessing        : 0.53
% 3.70/1.88  Parsing              : 0.29
% 3.70/1.88  CNF conversion       : 0.04
% 3.70/1.88  Main loop            : 0.25
% 3.70/1.88  Inferencing          : 0.11
% 3.70/1.88  Reduction            : 0.06
% 3.70/1.88  Demodulation         : 0.04
% 3.70/1.88  BG Simplification    : 0.02
% 3.70/1.88  Subsumption          : 0.06
% 3.70/1.88  Abstraction          : 0.01
% 3.70/1.88  MUC search           : 0.00
% 3.70/1.88  Cooper               : 0.00
% 3.70/1.88  Total                : 0.83
% 3.70/1.88  Index Insertion      : 0.00
% 3.70/1.88  Index Deletion       : 0.00
% 3.70/1.88  Index Matching       : 0.00
% 3.70/1.88  BG Taut test         : 0.00
%------------------------------------------------------------------------------