↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SWB006+2 : TPTP v9.0.0. Released v5.2.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 : n021.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 09:15:46 PM UTC 2025

% Result   : Theorem 2.46s 1.56s
% Output   : CNFRefutation 2.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   20 (   6 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :    9 (   5   ~;   1   |;   2   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 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  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :    6 (   5   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ iext > #nlpp > literal_plain > uri_owl_sameAs > uri_ex_w > uri_ex_u > dat_str_abc > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(literal_plain,type,
    literal_plain: $i > $i ).

tff(f_28,axiom,
    ! [X,Y] :
      ( iext(uri_owl_sameAs,X,Y)
    <=> ( X = Y ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_eqdis_sameas) ).

tff(f_36,axiom,
    ? [BNODE_x] :
      ( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,BNODE_x,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,BNODE_x,uri_ex_w) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).

tff(f_30,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).

tff(c_4,plain,
    ! [Y_2] : iext(uri_owl_sameAs,Y_2,Y_2),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_10,plain,
    iext(uri_owl_sameAs,'#skF_1',literal_plain(dat_str_abc)),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_14,plain,
    ! [Y_4,X_5] :
      ( ( Y_4 = X_5 )
      | ~ iext(uri_owl_sameAs,X_5,Y_4) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_28,plain,
    literal_plain(dat_str_abc) = '#skF_1',
    inference(resolution,[status(thm)],[c_10,c_14]) ).

tff(c_12,plain,
    iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_27,plain,
    literal_plain(dat_str_abc) = uri_ex_u,
    inference(resolution,[status(thm)],[c_12,c_14]) ).

tff(c_46,plain,
    uri_ex_u = '#skF_1',
    inference(demodulation,[status(thm),theory(equality)],[c_28,c_27]) ).

tff(c_8,plain,
    iext(uri_owl_sameAs,'#skF_1',uri_ex_w),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_31,plain,
    uri_ex_w = '#skF_1',
    inference(resolution,[status(thm)],[c_8,c_14]) ).

tff(c_6,plain,
    ~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_32,plain,
    ~ iext(uri_owl_sameAs,uri_ex_u,'#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_31,c_6]) ).

tff(c_51,plain,
    ~ iext(uri_owl_sameAs,'#skF_1','#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_46,c_32]) ).

tff(c_54,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWB006+2 : TPTP v9.0.0. Released v5.2.0.
% 0.07/0.13  % 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.14/0.34  % Computer : n021.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Wed Apr  9 00:53:44 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 2.46/1.56  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.46/1.57  
% 2.46/1.57  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------