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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KRS067+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 : n029.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:06 EDT 2023

% Result   : Unsatisfiable 2.86s 1.65s
% Output   : CNFRefutation 2.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   26 (   4 unt;   9 typ;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   43 (  19   ~;  18   |;   3   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   14 (;  14   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ xsd_string > xsd_integer > cowlThing > cowlNothing > cc > cb > ca > cUnsatisfiable > #nlpp > i2003_11_14_17_18_1956

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_56,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> ( ( cc(X)
          & cb(X) )
        | ( cb(X)
          & ca(X) )
        | ( cc(X)
          & ca(X) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

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

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

tff(f_72,axiom,
    cUnsatisfiable(i2003_11_14_17_18_1956),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

tff(c_14,plain,
    ! [X_3] :
      ( cb(X_3)
      | ca(X_3)
      | ~ cUnsatisfiable(X_3) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_64,plain,
    ! [X_15] :
      ( ca(X_15)
      | cc(X_15)
      | ~ cUnsatisfiable(X_15) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_36,plain,
    ! [X_5] :
      ( ~ cc(X_5)
      | ~ cb(X_5) ),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_79,plain,
    ! [X_18] :
      ( ~ cb(X_18)
      | ca(X_18)
      | ~ cUnsatisfiable(X_18) ),
    inference(resolution,[status(thm)],[c_64,c_36]) ).

tff(c_84,plain,
    ! [X_19] :
      ( ca(X_19)
      | ~ cUnsatisfiable(X_19) ),
    inference(resolution,[status(thm)],[c_14,c_79]) ).

tff(c_55,plain,
    ! [X_14] :
      ( cb(X_14)
      | cc(X_14)
      | ~ cUnsatisfiable(X_14) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_34,plain,
    ! [X_4] :
      ( ~ cc(X_4)
      | ~ ca(X_4) ),
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_73,plain,
    ! [X_16] :
      ( ~ ca(X_16)
      | cb(X_16)
      | ~ cUnsatisfiable(X_16) ),
    inference(resolution,[status(thm)],[c_55,c_34]) ).

tff(c_32,plain,
    ! [X_4] :
      ( ~ cb(X_4)
      | ~ ca(X_4) ),
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_77,plain,
    ! [X_16] :
      ( ~ ca(X_16)
      | ~ cUnsatisfiable(X_16) ),
    inference(resolution,[status(thm)],[c_73,c_32]) ).

tff(c_88,plain,
    ! [X_19] : ~ cUnsatisfiable(X_19),
    inference(resolution,[status(thm)],[c_84,c_77]) ).

tff(c_38,plain,
    cUnsatisfiable(i2003_11_14_17_18_1956),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_90,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_88,c_38]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : KRS067+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.12/0.34  % Computer : n029.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Thu Aug  3 20:27:52 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 2.86/1.65  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.86/1.65  
% 2.86/1.65  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.86/1.68  
% 2.86/1.68  Inference rules
% 2.86/1.68  ----------------------
% 2.86/1.68  #Ref     : 0
% 2.86/1.68  #Sup     : 9
% 2.86/1.68  #Fact    : 0
% 2.86/1.68  #Define  : 0
% 2.86/1.68  #Split   : 0
% 2.86/1.68  #Chain   : 0
% 2.86/1.68  #Close   : 0
% 2.86/1.68  
% 2.86/1.68  Ordering : KBO
% 2.86/1.68  
% 2.86/1.68  Simplification rules
% 2.86/1.68  ----------------------
% 2.86/1.68  #Subsume      : 15
% 2.86/1.68  #Demod        : 0
% 2.86/1.68  #Tautology    : 4
% 2.86/1.68  #SimpNegUnit  : 1
% 2.86/1.68  #BackRed      : 1
% 2.86/1.68  
% 2.86/1.68  #Partial instantiations: 0
% 2.86/1.68  #Strategies tried      : 1
% 2.86/1.68  
% 2.86/1.68  Timing (in seconds)
% 2.86/1.68  ----------------------
% 2.86/1.68  Preprocessing        : 0.43
% 2.86/1.68  Parsing              : 0.23
% 2.86/1.68  CNF conversion       : 0.03
% 2.86/1.68  Main loop            : 0.22
% 2.86/1.68  Inferencing          : 0.10
% 2.86/1.68  Reduction            : 0.04
% 2.86/1.68  Demodulation         : 0.03
% 2.86/1.68  BG Simplification    : 0.02
% 2.86/1.69  Subsumption          : 0.05
% 2.86/1.69  Abstraction          : 0.01
% 2.86/1.69  MUC search           : 0.00
% 2.86/1.69  Cooper               : 0.00
% 2.86/1.69  Total                : 0.69
% 2.86/1.69  Index Insertion      : 0.00
% 2.86/1.69  Index Deletion       : 0.00
% 2.86/1.69  Index Matching       : 0.00
% 2.86/1.69  BG Taut test         : 0.00
%------------------------------------------------------------------------------