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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : KRS063+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 : n013.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:05 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ risEuroMPFrom > rhasEuroMP > xsd_string > xsd_integer > cowlThing > cowlNothing > cPerson > cEuropeanCountry > cEuroMP > cEUCountry > #nlpp > iUK > iPT > iNL > iKinnock > iFR > iES > iBE > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(iPT,type,
    iPT: $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_155,axiom,
    ~ cEuroMP(iKinnock),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).

tff(f_162,axiom,
    rhasEuroMP(iUK,iKinnock),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).

tff(f_144,axiom,
    ! [X,Y] :
      ( risEuroMPFrom(X,Y)
    <=> rhasEuroMP(Y,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

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

tff(f_134,axiom,
    ! [X] :
      ( cEuroMP(X)
    <=> ? [Y] :
          ( risEuroMPFrom(X,Y)
          & cowlThing(Y) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

tff(c_68,plain,
    ~ cEuroMP(iKinnock),
    inference(cnfTransformation,[status(thm)],[f_155]) ).

tff(c_76,plain,
    rhasEuroMP(iUK,iKinnock),
    inference(cnfTransformation,[status(thm)],[f_162]) ).

tff(c_105,plain,
    ! [X_51,Y_52] :
      ( risEuroMPFrom(X_51,Y_52)
      | ~ rhasEuroMP(Y_52,X_51) ),
    inference(cnfTransformation,[status(thm)],[f_144]) ).

tff(c_26,plain,
    ! [X_29] : cowlThing(X_29),
    inference(cnfTransformation,[status(thm)],[f_105]) ).

tff(c_48,plain,
    ! [X_32,Y_35] :
      ( cEuroMP(X_32)
      | ~ cowlThing(Y_35)
      | ~ risEuroMPFrom(X_32,Y_35) ),
    inference(cnfTransformation,[status(thm)],[f_134]) ).

tff(c_79,plain,
    ! [X_32,Y_35] :
      ( cEuroMP(X_32)
      | ~ risEuroMPFrom(X_32,Y_35) ),
    inference(demodulation,[status(thm),theory(equality)],[c_26,c_48]) ).

tff(c_114,plain,
    ! [X_53,Y_54] :
      ( cEuroMP(X_53)
      | ~ rhasEuroMP(Y_54,X_53) ),
    inference(resolution,[status(thm)],[c_105,c_79]) ).

tff(c_117,plain,
    cEuroMP(iKinnock),
    inference(resolution,[status(thm)],[c_76,c_114]) ).

tff(c_121,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_68,c_117]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : KRS063+1 : TPTP v8.1.2. Released v3.1.0.
% 0.14/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.15/0.36  % Computer : n013.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 20:03:02 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 3.39/1.87  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.39/1.87  
% 3.39/1.87  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.68/1.90  
% 3.68/1.90  Inference rules
% 3.68/1.90  ----------------------
% 3.68/1.90  #Ref     : 0
% 3.68/1.90  #Sup     : 7
% 3.68/1.90  #Fact    : 0
% 3.68/1.90  #Define  : 0
% 3.68/1.90  #Split   : 0
% 3.68/1.90  #Chain   : 0
% 3.68/1.90  #Close   : 0
% 3.68/1.90  
% 3.68/1.90  Ordering : KBO
% 3.68/1.90  
% 3.68/1.90  Simplification rules
% 3.68/1.90  ----------------------
% 3.68/1.90  #Subsume      : 0
% 3.68/1.90  #Demod        : 3
% 3.68/1.90  #Tautology    : 17
% 3.68/1.90  #SimpNegUnit  : 1
% 3.68/1.90  #BackRed      : 0
% 3.68/1.90  
% 3.68/1.90  #Partial instantiations: 0
% 3.68/1.90  #Strategies tried      : 1
% 3.68/1.90  
% 3.68/1.90  Timing (in seconds)
% 3.68/1.90  ----------------------
% 3.68/1.90  Preprocessing        : 0.52
% 3.68/1.90  Parsing              : 0.28
% 3.68/1.90  CNF conversion       : 0.04
% 3.68/1.90  Main loop            : 0.22
% 3.68/1.90  Inferencing          : 0.08
% 3.68/1.90  Reduction            : 0.06
% 3.68/1.90  Demodulation         : 0.05
% 3.68/1.90  BG Simplification    : 0.02
% 3.68/1.90  Subsumption          : 0.04
% 3.68/1.90  Abstraction          : 0.01
% 3.68/1.90  MUC search           : 0.00
% 3.68/1.90  Cooper               : 0.00
% 3.68/1.90  Total                : 0.79
% 3.68/1.90  Index Insertion      : 0.00
% 3.68/1.91  Index Deletion       : 0.00
% 3.68/1.91  Index Matching       : 0.00
% 3.68/1.91  BG Taut test         : 0.00
%------------------------------------------------------------------------------