↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : KRS078+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/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 : n023.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:16 PM UTC 2025

% Result   : Unsatisfiable 3.71s 1.85s
% Output   : CNFRefutation 3.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   48 (   5 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :   52 (  23   ~;  18   |;   7   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   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    :    7 (   7 usr;   1 con; 0-3 aty)
%            Number of variables   :   26 (  23   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rs > rr > rinvR > xsd_string > xsd_integer > cq > cp > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_19_13721 > #skF_5 > #skF_1 > #skF_4 > #skF_3 > #skF_2 > #skF_6

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_5',type,
    '#skF_5': $i > $i ).

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_4',type,
    '#skF_4': $i > $i ).

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

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

tff(rs,type,
    rs: ( $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(xsd_string,type,
    xsd_string: $i > $o ).

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

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

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

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

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

tff(f_154,axiom,
    cUnsatisfiable(i2003_11_14_17_19_13721),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

tff(f_147,axiom,
    ! [X] :
      ( cUnsatisfiable(X)
    <=> ( ? [Y] :
            ( rr(X,Y)
            & ? [Z] :
                ( rinvR(Y,Z)
                & ! [W] :
                    ( rs(Z,W)
                   => cp(W) ) )
            & ! [Z0,Z1] :
                ( ( rinvR(Y,Z0)
                  & rinvR(Y,Z1) )
               => ( Z0 = Z1 ) ) )
        & ? [Y] :
            ( rs(X,Y)
            & ~ cq(Y)
            & ~ cp(Y) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

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

tff(c_66,plain,
    cUnsatisfiable(i2003_11_14_17_19_13721),
    inference(cnfTransformation,[status(thm)],[f_154]) ).

tff(c_46,plain,
    ! [X_35] :
      ( rinvR('#skF_4'(X_35),'#skF_5'(X_35))
      | ~ cUnsatisfiable(X_35) ),
    inference(cnfTransformation,[status(thm)],[f_147]) ).

tff(c_48,plain,
    ! [X_35] :
      ( rr(X_35,'#skF_4'(X_35))
      | ~ cUnsatisfiable(X_35) ),
    inference(cnfTransformation,[status(thm)],[f_147]) ).

tff(c_80,plain,
    ! [X_90,Y_91] :
      ( rinvR(X_90,Y_91)
      | ~ rr(Y_91,X_90) ),
    inference(cnfTransformation,[status(thm)],[f_152]) ).

tff(c_87,plain,
    ! [X_35] :
      ( rinvR('#skF_4'(X_35),X_35)
      | ~ cUnsatisfiable(X_35) ),
    inference(resolution,[status(thm)],[c_48,c_80]) ).

tff(c_102,plain,
    ! [Z1_97,Z0_98,X_99] :
      ( ( Z1_97 = Z0_98 )
      | ~ rinvR('#skF_4'(X_99),Z1_97)
      | ~ rinvR('#skF_4'(X_99),Z0_98)
      | ~ cUnsatisfiable(X_99) ),
    inference(cnfTransformation,[status(thm)],[f_147]) ).

tff(c_110,plain,
    ! [Z0_101,X_102] :
      ( ( Z0_101 = X_102 )
      | ~ rinvR('#skF_4'(X_102),Z0_101)
      | ~ cUnsatisfiable(X_102) ),
    inference(resolution,[status(thm)],[c_87,c_102]) ).

tff(c_120,plain,
    ! [X_103] :
      ( ( '#skF_5'(X_103) = X_103 )
      | ~ cUnsatisfiable(X_103) ),
    inference(resolution,[status(thm)],[c_46,c_110]) ).

tff(c_124,plain,
    '#skF_5'(i2003_11_14_17_19_13721) = i2003_11_14_17_19_13721,
    inference(resolution,[status(thm)],[c_66,c_120]) ).

tff(c_40,plain,
    ! [X_35] :
      ( rs(X_35,'#skF_6'(X_35))
      | ~ cUnsatisfiable(X_35) ),
    inference(cnfTransformation,[status(thm)],[f_147]) ).

tff(c_91,plain,
    ! [W_94,X_95] :
      ( cp(W_94)
      | ~ rs('#skF_5'(X_95),W_94)
      | ~ cUnsatisfiable(X_95) ),
    inference(cnfTransformation,[status(thm)],[f_147]) ).

tff(c_97,plain,
    ! [X_96] :
      ( cp('#skF_6'('#skF_5'(X_96)))
      | ~ cUnsatisfiable(X_96)
      | ~ cUnsatisfiable('#skF_5'(X_96)) ),
    inference(resolution,[status(thm)],[c_40,c_91]) ).

tff(c_36,plain,
    ! [X_35] :
      ( ~ cp('#skF_6'(X_35))
      | ~ cUnsatisfiable(X_35) ),
    inference(cnfTransformation,[status(thm)],[f_147]) ).

tff(c_101,plain,
    ! [X_96] :
      ( ~ cUnsatisfiable(X_96)
      | ~ cUnsatisfiable('#skF_5'(X_96)) ),
    inference(resolution,[status(thm)],[c_97,c_36]) ).

tff(c_129,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_19_13721)
    | ~ cUnsatisfiable(i2003_11_14_17_19_13721) ),
    inference(superposition,[status(thm),theory(equality)],[c_124,c_101]) ).

tff(c_140,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_66,c_66,c_129]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : KRS078+1 : TPTP v9.0.0. Released v3.1.0.
% 0.03/0.12  % 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.12/0.33  % Computer : n023.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 : Tue Apr  8 02:58:09 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 3.71/1.85  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.71/1.85  
% 3.71/1.85  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------