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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KRS105+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/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:11 EDT 2023

% Result   : Unsatisfiable 3.08s 1.72s
% Output   : CNFRefutation 3.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   40 (   4 unt;  15 typ;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   45 (  20   ~;  16   |;   0   &)
%                                         (   3 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (  14   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   28 (;  26   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rr > ra_Px1 > xsd_string > xsd_integer > cowlThing > cowlNothing > cdxcomp > cd > cc > ca_Ax2 > cUnsatisfiable > #nlpp > i2003_11_14_17_20_53634 > #skF_2 > #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(cc,type,
    cc: $i > $o ).

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

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

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

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

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

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

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

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

tff(f_49,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
     => cc(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

tff(f_78,axiom,
    ! [X] :
      ( ca_Ax2(X)
    <=> ! [Y] :
          ( rr(X,Y)
         => cc(Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).

tff(f_57,axiom,
    ! [X] :
      ( cc(X)
     => ! [Y] :
          ( rr(X,Y)
         => cc(Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

tff(f_83,axiom,
    ! [X] :
      ( ca_Ax2(X)
     => cd(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).

tff(f_44,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
     => cdxcomp(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

tff(f_70,axiom,
    ! [X] :
      ( cdxcomp(X)
    <=> ? [Y0] : ra_Px1(X,Y0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).

tff(f_64,axiom,
    ! [X] :
      ( cd(X)
    <=> ~ ? [Y] : ra_Px1(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).

tff(f_85,axiom,
    cUnsatisfiable(i2003_11_14_17_20_53634),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).

tff(c_12,plain,
    ! [X_4] :
      ( cc(X_4)
      | ~ cUnsatisfiable(X_4) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_28,plain,
    ! [X_16] :
      ( rr(X_16,'#skF_3'(X_16))
      | ca_Ax2(X_16) ),
    inference(cnfTransformation,[status(thm)],[f_78]) ).

tff(c_92,plain,
    ! [Y_43,X_44] :
      ( cc(Y_43)
      | ~ rr(X_44,Y_43)
      | ~ cc(X_44) ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_97,plain,
    ! [X_45] :
      ( cc('#skF_3'(X_45))
      | ~ cc(X_45)
      | ca_Ax2(X_45) ),
    inference(resolution,[status(thm)],[c_28,c_92]) ).

tff(c_26,plain,
    ! [X_16] :
      ( ~ cc('#skF_3'(X_16))
      | ca_Ax2(X_16) ),
    inference(cnfTransformation,[status(thm)],[f_78]) ).

tff(c_102,plain,
    ! [X_46] :
      ( ~ cc(X_46)
      | ca_Ax2(X_46) ),
    inference(resolution,[status(thm)],[c_97,c_26]) ).

tff(c_107,plain,
    ! [X_47] :
      ( ca_Ax2(X_47)
      | ~ cUnsatisfiable(X_47) ),
    inference(resolution,[status(thm)],[c_12,c_102]) ).

tff(c_30,plain,
    ! [X_20] :
      ( cd(X_20)
      | ~ ca_Ax2(X_20) ),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

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

tff(c_62,plain,
    ! [X_36] :
      ( ra_Px1(X_36,'#skF_2'(X_36))
      | ~ cdxcomp(X_36) ),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_16,plain,
    ! [X_8,Y_11] :
      ( ~ ra_Px1(X_8,Y_11)
      | ~ cd(X_8) ),
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_72,plain,
    ! [X_38] :
      ( ~ cd(X_38)
      | ~ cdxcomp(X_38) ),
    inference(resolution,[status(thm)],[c_62,c_16]) ).

tff(c_81,plain,
    ! [X_39] :
      ( ~ cd(X_39)
      | ~ cUnsatisfiable(X_39) ),
    inference(resolution,[status(thm)],[c_10,c_72]) ).

tff(c_85,plain,
    ! [X_20] :
      ( ~ cUnsatisfiable(X_20)
      | ~ ca_Ax2(X_20) ),
    inference(resolution,[status(thm)],[c_30,c_81]) ).

tff(c_111,plain,
    ! [X_47] : ~ cUnsatisfiable(X_47),
    inference(resolution,[status(thm)],[c_107,c_85]) ).

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

tff(c_113,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_111,c_32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : KRS105+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.12  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.33  % Computer : n008.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Thu Aug  3 20:11:33 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 3.08/1.72  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.08/1.72  
% 3.08/1.72  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.08/1.75  
% 3.08/1.75  Inference rules
% 3.08/1.75  ----------------------
% 3.08/1.75  #Ref     : 0
% 3.08/1.75  #Sup     : 14
% 3.08/1.75  #Fact    : 0
% 3.08/1.75  #Define  : 0
% 3.08/1.75  #Split   : 0
% 3.08/1.75  #Chain   : 0
% 3.08/1.75  #Close   : 0
% 3.08/1.75  
% 3.08/1.75  Ordering : KBO
% 3.08/1.75  
% 3.08/1.75  Simplification rules
% 3.08/1.75  ----------------------
% 3.08/1.75  #Subsume      : 7
% 3.08/1.75  #Demod        : 0
% 3.08/1.75  #Tautology    : 5
% 3.08/1.75  #SimpNegUnit  : 1
% 3.08/1.75  #BackRed      : 1
% 3.08/1.75  
% 3.08/1.75  #Partial instantiations: 0
% 3.08/1.75  #Strategies tried      : 1
% 3.08/1.75  
% 3.08/1.75  Timing (in seconds)
% 3.08/1.75  ----------------------
% 3.08/1.75  Preprocessing        : 0.45
% 3.08/1.75  Parsing              : 0.25
% 3.08/1.75  CNF conversion       : 0.03
% 3.08/1.75  Main loop            : 0.22
% 3.08/1.75  Inferencing          : 0.11
% 3.08/1.75  Reduction            : 0.05
% 3.08/1.75  Demodulation         : 0.03
% 3.08/1.75  BG Simplification    : 0.02
% 3.08/1.75  Subsumption          : 0.04
% 3.08/1.75  Abstraction          : 0.01
% 3.08/1.75  MUC search           : 0.00
% 3.08/1.75  Cooper               : 0.00
% 3.08/1.75  Total                : 0.72
% 3.08/1.75  Index Insertion      : 0.00
% 3.08/1.75  Index Deletion       : 0.00
% 3.08/1.75  Index Matching       : 0.00
% 3.08/1.75  BG Taut test         : 0.00
%------------------------------------------------------------------------------