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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KRS092+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 : n008.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.19s 1.75s
% Output   : CNFRefutation 3.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   28 (   4 unt;  15 typ;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   28 (  13   ~;   9   |;   3   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   15 (  14   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   14 (;  13   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rr > xsd_string > xsd_integer > cowlThing > cowlNothing > cf > ce3 > cd1 > cd > cc1 > cc > cUnsatisfiable > #nlpp > i2003_11_14_17_20_04172 > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_56,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> ( ? [Y] :
            ( rr(X,Y)
            & cowlThing(Y) )
        & ! [Y] :
            ( rr(X,Y)
           => ( cd(Y)
              & cc(Y) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

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

tff(f_85,axiom,
    cUnsatisfiable(i2003_11_14_17_20_04172),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).

tff(c_12,plain,
    ! [X_3] :
      ( rr(X_3,'#skF_2'(X_3))
      | ~ cUnsatisfiable(X_3) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_66,plain,
    ! [Y_30,X_31] :
      ( cc(Y_30)
      | ~ rr(X_31,Y_30)
      | ~ cUnsatisfiable(X_31) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_71,plain,
    ! [X_32] :
      ( cc('#skF_2'(X_32))
      | ~ cUnsatisfiable(X_32) ),
    inference(resolution,[status(thm)],[c_12,c_66]) ).

tff(c_55,plain,
    ! [Y_26,X_27] :
      ( cd(Y_26)
      | ~ rr(X_27,Y_26)
      | ~ cUnsatisfiable(X_27) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_60,plain,
    ! [X_28] :
      ( cd('#skF_2'(X_28))
      | ~ cUnsatisfiable(X_28) ),
    inference(resolution,[status(thm)],[c_12,c_55]) ).

tff(c_22,plain,
    ! [X_10] :
      ( ~ cd(X_10)
      | ~ cc(X_10) ),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_64,plain,
    ! [X_28] :
      ( ~ cc('#skF_2'(X_28))
      | ~ cUnsatisfiable(X_28) ),
    inference(resolution,[status(thm)],[c_60,c_22]) ).

tff(c_75,plain,
    ! [X_32] : ~ cUnsatisfiable(X_32),
    inference(resolution,[status(thm)],[c_71,c_64]) ).

tff(c_32,plain,
    cUnsatisfiable(i2003_11_14_17_20_04172),
    inference(cnfTransformation,[status(thm)],[f_85]) ).

tff(c_77,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_75,c_32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13  % Problem  : KRS092+1 : TPTP v8.1.2. Released v3.1.0.
% 0.09/0.14  % 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.35  % Computer : n008.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 20:09:03 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 3.19/1.75  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.19/1.75  
% 3.19/1.75  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.26/1.77  
% 3.26/1.77  Inference rules
% 3.26/1.77  ----------------------
% 3.26/1.77  #Ref     : 0
% 3.26/1.77  #Sup     : 6
% 3.26/1.77  #Fact    : 0
% 3.26/1.77  #Define  : 0
% 3.26/1.77  #Split   : 0
% 3.26/1.77  #Chain   : 0
% 3.26/1.77  #Close   : 0
% 3.26/1.77  
% 3.26/1.77  Ordering : KBO
% 3.26/1.77  
% 3.26/1.77  Simplification rules
% 3.26/1.77  ----------------------
% 3.26/1.77  #Subsume      : 9
% 3.26/1.77  #Demod        : 2
% 3.26/1.77  #Tautology    : 2
% 3.26/1.77  #SimpNegUnit  : 1
% 3.26/1.77  #BackRed      : 1
% 3.26/1.78  
% 3.26/1.78  #Partial instantiations: 0
% 3.26/1.78  #Strategies tried      : 1
% 3.26/1.78  
% 3.26/1.78  Timing (in seconds)
% 3.26/1.78  ----------------------
% 3.26/1.78  Preprocessing        : 0.46
% 3.26/1.78  Parsing              : 0.26
% 3.26/1.78  CNF conversion       : 0.03
% 3.26/1.78  Main loop            : 0.21
% 3.26/1.78  Inferencing          : 0.09
% 3.26/1.78  Reduction            : 0.05
% 3.26/1.78  Demodulation         : 0.03
% 3.26/1.78  BG Simplification    : 0.02
% 3.26/1.78  Subsumption          : 0.04
% 3.26/1.78  Abstraction          : 0.01
% 3.26/1.78  MUC search           : 0.00
% 3.26/1.78  Cooper               : 0.00
% 3.26/1.78  Total                : 0.71
% 3.26/1.78  Index Insertion      : 0.00
% 3.26/1.78  Index Deletion       : 0.00
% 3.26/1.78  Index Matching       : 0.00
% 3.26/1.78  BG Taut test         : 0.00
%------------------------------------------------------------------------------