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

View Problem - Process Solution

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

% Result   : Unsatisfiable 2.89s 1.67s
% Output   : CNFRefutation 2.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   23 (   5 unt;  12 typ;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   13 (   7   ~;   3   |;   0   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (  11   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    8 (;   8   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ xsd_string > xsd_integer > cowlThing > cowlNothing > cf > ce3 > cd1 > cd > cc1 > cc > cUnsatisfiable > #nlpp > i2003_11_14_17_20_11330

%Foreground sorts:

%Background operators:

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

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

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

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_11330,type,
    i2003_11_14_17_20_11330: $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_63,axiom,
    ! [X] :
      ( cc1(X)
     => cd1(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

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

tff(f_46,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> cc1(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

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

tff(c_43,plain,
    ! [X_19] :
      ( cd1(X_19)
      | ~ cc1(X_19) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_16,plain,
    ! [X_5] :
      ( ~ cd1(X_5)
      | ~ cc1(X_5) ),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_47,plain,
    ! [X_19] : ~ cc1(X_19),
    inference(resolution,[status(thm)],[c_43,c_16]) ).

tff(c_10,plain,
    ! [X_3] :
      ( cc1(X_3)
      | ~ cUnsatisfiable(X_3) ),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_48,plain,
    ! [X_3] : ~ cUnsatisfiable(X_3),
    inference(negUnitSimplification,[status(thm)],[c_47,c_10]) ).

tff(c_24,plain,
    cUnsatisfiable(i2003_11_14_17_20_11330),
    inference(cnfTransformation,[status(thm)],[f_75]) ).

tff(c_51,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_48,c_24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : KRS094+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/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.36  % Computer : n025.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 20:24:04 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 2.89/1.67  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.89/1.67  
% 2.89/1.67  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.95/1.70  
% 2.95/1.70  Inference rules
% 2.95/1.70  ----------------------
% 2.95/1.70  #Ref     : 0
% 2.95/1.70  #Sup     : 3
% 2.95/1.70  #Fact    : 0
% 2.95/1.70  #Define  : 0
% 2.95/1.70  #Split   : 0
% 2.95/1.70  #Chain   : 0
% 2.95/1.70  #Close   : 0
% 2.95/1.70  
% 2.95/1.70  Ordering : KBO
% 2.95/1.70  
% 2.95/1.70  Simplification rules
% 2.95/1.70  ----------------------
% 2.95/1.70  #Subsume      : 3
% 2.95/1.70  #Demod        : 0
% 2.95/1.70  #Tautology    : 2
% 2.95/1.70  #SimpNegUnit  : 2
% 2.95/1.70  #BackRed      : 2
% 2.95/1.70  
% 2.95/1.70  #Partial instantiations: 0
% 2.95/1.70  #Strategies tried      : 1
% 2.95/1.70  
% 2.95/1.70  Timing (in seconds)
% 2.95/1.70  ----------------------
% 2.95/1.70  Preprocessing        : 0.44
% 2.95/1.70  Parsing              : 0.25
% 2.95/1.70  CNF conversion       : 0.03
% 2.95/1.70  Main loop            : 0.19
% 2.95/1.70  Inferencing          : 0.09
% 2.95/1.70  Reduction            : 0.04
% 2.95/1.70  Demodulation         : 0.03
% 2.95/1.70  BG Simplification    : 0.01
% 2.95/1.70  Subsumption          : 0.04
% 2.95/1.70  Abstraction          : 0.01
% 2.95/1.70  MUC search           : 0.00
% 2.95/1.70  Cooper               : 0.00
% 2.95/1.70  Total                : 0.66
% 2.95/1.70  Index Insertion      : 0.00
% 2.95/1.70  Index Deletion       : 0.00
% 2.95/1.70  Index Matching       : 0.00
% 2.95/1.70  BG Taut test         : 0.00
%------------------------------------------------------------------------------