↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : KRS087+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 : n010.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.36s 1.76s
% Output   : CNFRefutation 3.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   47 (  21   ~;  17   |;   5   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 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  :   11 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-3 aty)
%            Number of variables   :   31 (  29   !;   2   ?;   0   :)

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

%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_1',type,
    '#skF_1': ( $i * $i * $i ) > $i ).

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

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

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

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

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

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

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

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

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

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

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

tff(f_159,axiom,
    ! [X,Y] :
      ( rinvR(X,Y)
    <=> rr(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).

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

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

tff(c_46,plain,
    ! [X_39] :
      ( cp1(X_39)
      | ~ cUnsatisfiable(X_39) ),
    inference(cnfTransformation,[status(thm)],[f_142]) ).

tff(c_93,plain,
    ! [X_91] :
      ( rr('#skF_2'(X_91),'#skF_3'(X_91))
      | ~ cUnsatisfiable(X_91) ),
    inference(cnfTransformation,[status(thm)],[f_142]) ).

tff(c_60,plain,
    ! [X_70,Y_71] :
      ( rinvR(X_70,Y_71)
      | ~ rr(Y_71,X_70) ),
    inference(cnfTransformation,[status(thm)],[f_159]) ).

tff(c_97,plain,
    ! [X_91] :
      ( rinvR('#skF_3'(X_91),'#skF_2'(X_91))
      | ~ cUnsatisfiable(X_91) ),
    inference(resolution,[status(thm)],[c_93,c_60]) ).

tff(c_44,plain,
    ! [X_39] :
      ( rr(X_39,'#skF_2'(X_39))
      | ~ cUnsatisfiable(X_39) ),
    inference(cnfTransformation,[status(thm)],[f_142]) ).

tff(c_58,plain,
    ! [Y_71,X_70] :
      ( rr(Y_71,X_70)
      | ~ rinvR(X_70,Y_71) ),
    inference(cnfTransformation,[status(thm)],[f_159]) ).

tff(c_111,plain,
    ! [X_100,Z_101,Y_102] :
      ( rr(X_100,Z_101)
      | ~ rr(Y_102,Z_101)
      | ~ rr(X_100,Y_102) ),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_129,plain,
    ! [X_105,X_106,Y_107] :
      ( rr(X_105,X_106)
      | ~ rr(X_105,Y_107)
      | ~ rinvR(X_106,Y_107) ),
    inference(resolution,[status(thm)],[c_58,c_111]) ).

tff(c_143,plain,
    ! [X_110,X_111] :
      ( rr(X_110,X_111)
      | ~ rinvR(X_111,'#skF_2'(X_110))
      | ~ cUnsatisfiable(X_110) ),
    inference(resolution,[status(thm)],[c_44,c_129]) ).

tff(c_158,plain,
    ! [X_112] :
      ( rr(X_112,'#skF_3'(X_112))
      | ~ cUnsatisfiable(X_112) ),
    inference(resolution,[status(thm)],[c_97,c_143]) ).

tff(c_170,plain,
    ! [X_116] :
      ( rinvR('#skF_3'(X_116),X_116)
      | ~ cUnsatisfiable(X_116) ),
    inference(resolution,[status(thm)],[c_158,c_60]) ).

tff(c_40,plain,
    ! [W_64,X_39] :
      ( ~ cp1(W_64)
      | ~ rinvR('#skF_3'(X_39),W_64)
      | ~ cUnsatisfiable(X_39) ),
    inference(cnfTransformation,[status(thm)],[f_142]) ).

tff(c_180,plain,
    ! [X_117] :
      ( ~ cp1(X_117)
      | ~ cUnsatisfiable(X_117) ),
    inference(resolution,[status(thm)],[c_170,c_40]) ).

tff(c_192,plain,
    ! [X_39] : ~ cUnsatisfiable(X_39),
    inference(resolution,[status(thm)],[c_46,c_180]) ).

tff(c_64,plain,
    cUnsatisfiable(i2003_11_14_17_19_46763),
    inference(cnfTransformation,[status(thm)],[f_168]) ).

tff(c_195,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_192,c_64]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS087+1 : TPTP v9.0.0. Released v3.1.0.
% 0.03/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.13/0.34  % Computer : n010.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Apr  8 02:58:48 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.36/1.76  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.36/1.76  
% 3.36/1.76  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------