↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : KRS088+1 : TPTP v9.0.0. 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 : n003.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 : Wed Apr  9 07:07:18 PM UTC 2025

% Result   : Unsatisfiable 3.74s 1.90s
% Output   : CNFRefutation 3.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   49 (   5 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   51 (  24   ~;  19   |;   4   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   29 (  27   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rr > rinvR > rinvF > rf > xsd_string > xsd_integer > cp1 > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_19_49673 > #skF_2 > #skF_3 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_166,axiom,
    cUnsatisfiable(i2003_11_14_17_19_49673),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).

tff(f_140,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> ? [Y] :
          ( rf(X,Y)
          & ! [Z] :
              ( rinvF(Y,Z)
             => ? [W] :
                  ( rf(Z,W)
                  & ~ cp1(W) ) )
          & cp1(Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

tff(f_152,axiom,
    ! [X,Y] :
      ( rinvF(X,Y)
    <=> rf(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

tff(f_147,axiom,
    ! [X,Y,Z] :
      ( ( rf(X,Y)
        & rf(X,Z) )
     => ( Y = Z ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

tff(c_62,plain,
    cUnsatisfiable(i2003_11_14_17_19_49673),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_40,plain,
    ! [X_39] :
      ( rf(X_39,'#skF_2'(X_39))
      | ~ cUnsatisfiable(X_39) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_54,plain,
    ! [X_68,Y_69] :
      ( rinvF(X_68,Y_69)
      | ~ rf(Y_69,X_68) ),
    inference(cnfTransformation,[status(thm)],[f_152]) ).

tff(c_116,plain,
    ! [Z_108,X_109] :
      ( rf(Z_108,'#skF_3'(X_109,Z_108))
      | ~ rinvF('#skF_2'(X_109),Z_108)
      | ~ cUnsatisfiable(X_109) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_121,plain,
    ! [Y_110,X_111] :
      ( rf(Y_110,'#skF_3'(X_111,Y_110))
      | ~ cUnsatisfiable(X_111)
      | ~ rf(Y_110,'#skF_2'(X_111)) ),
    inference(resolution,[status(thm)],[c_54,c_116]) ).

tff(c_125,plain,
    ! [X_112] :
      ( rf(X_112,'#skF_3'(X_112,X_112))
      | ~ cUnsatisfiable(X_112) ),
    inference(resolution,[status(thm)],[c_40,c_121]) ).

tff(c_85,plain,
    ! [Z_89,Y_90,X_91] :
      ( ( Z_89 = Y_90 )
      | ~ rf(X_91,Z_89)
      | ~ rf(X_91,Y_90) ),
    inference(cnfTransformation,[status(thm)],[f_147]) ).

tff(c_88,plain,
    ! [Y_90,X_39] :
      ( ( Y_90 = '#skF_2'(X_39) )
      | ~ rf(X_39,Y_90)
      | ~ cUnsatisfiable(X_39) ),
    inference(resolution,[status(thm)],[c_40,c_85]) ).

tff(c_133,plain,
    ! [X_113] :
      ( ( '#skF_3'(X_113,X_113) = '#skF_2'(X_113) )
      | ~ cUnsatisfiable(X_113) ),
    inference(resolution,[status(thm)],[c_125,c_88]) ).

tff(c_136,plain,
    '#skF_2'(i2003_11_14_17_19_49673) = '#skF_3'(i2003_11_14_17_19_49673,i2003_11_14_17_19_49673),
    inference(resolution,[status(thm)],[c_62,c_133]) ).

tff(c_38,plain,
    ! [X_39] :
      ( cp1('#skF_2'(X_39))
      | ~ cUnsatisfiable(X_39) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_153,plain,
    ( cp1('#skF_3'(i2003_11_14_17_19_49673,i2003_11_14_17_19_49673))
    | ~ cUnsatisfiable(i2003_11_14_17_19_49673) ),
    inference(superposition,[status(thm),theory(equality)],[c_136,c_38]) ).

tff(c_167,plain,
    cp1('#skF_3'(i2003_11_14_17_19_49673,i2003_11_14_17_19_49673)),
    inference(demodulation,[status(thm),theory(equality)],[c_62,c_153]) ).

tff(c_103,plain,
    ! [X_100,Z_101] :
      ( ~ cp1('#skF_3'(X_100,Z_101))
      | ~ rinvF('#skF_2'(X_100),Z_101)
      | ~ cUnsatisfiable(X_100) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_110,plain,
    ! [X_105,Y_106] :
      ( ~ cp1('#skF_3'(X_105,Y_106))
      | ~ cUnsatisfiable(X_105)
      | ~ rf(Y_106,'#skF_2'(X_105)) ),
    inference(resolution,[status(thm)],[c_54,c_103]) ).

tff(c_114,plain,
    ! [X_39] :
      ( ~ cp1('#skF_3'(X_39,X_39))
      | ~ cUnsatisfiable(X_39) ),
    inference(resolution,[status(thm)],[c_40,c_110]) ).

tff(c_171,plain,
    ~ cUnsatisfiable(i2003_11_14_17_19_49673),
    inference(resolution,[status(thm)],[c_167,c_114]) ).

tff(c_175,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_62,c_171]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : KRS088+1 : TPTP v9.0.0. Released v3.1.0.
% 0.06/0.13  % 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.34  % Computer : n003.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 : Tue Apr  8 02:58:18 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 3.74/1.90  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.74/1.90  
% 3.74/1.90  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------