↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SWB006+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:51:27 AM UTC 2026

% Result   : Theorem 0.09s 0.59s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (  15 unt;   0 def)
%            Number of atoms       :   30 (   8 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   16 (   7   ~;   2   |;   6   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            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   :    8 (   0 sgn   2   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_eqdis_sameas,axiom,
    ! [X,Y] :
      ( iext(uri_owl_sameAs,X,Y)
    <=> X = Y ),
    file('theBenchmark.p',owl_eqdis_sameas) ).

fof(testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,axiom,
    ? [BNODE_x] :
      ( iext(uri_owl_sameAs,BNODE_x,uri_ex_w)
      & iext(uri_owl_sameAs,BNODE_x,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
    file('theBenchmark.p',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).

fof(testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,conjecture,
    iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    file('theBenchmark.p',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).

fof(testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes_neg,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).

cnf(c_4,plain,
    ( B = A
    | ~ iext(uri_owl_sameAs,A,B) ),
    inference(clausify,[status(thm)],[owl_eqdis_sameas]) ).

cnf(c_5,plain,
    ( B != A
    | iext(uri_owl_sameAs,A,B) ),
    inference(clausify,[status(thm)],[owl_eqdis_sameas]) ).

fof(nnf_2,plain,
    ? [BNODE_x] :
      ( iext(uri_owl_sameAs,BNODE_x,uri_ex_w)
      & iext(uri_owl_sameAs,BNODE_x,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
    inference(fof_nnf,[status(thm)],[testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).

fof(sk_testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,plain,
    ( iext(uri_owl_sameAs,sK0,uri_ex_w)
    & iext(uri_owl_sameAs,sK0,literal_plain(dat_str_abc))
    & iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(BNODE_x,sK0)],[nnf_2]) ).

cnf(c_6,plain,
    iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
    inference(split_conjunct,[status(thm)],[sk_testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).

cnf(c_7,plain,
    iext(uri_owl_sameAs,sK0,literal_plain(dat_str_abc)),
    inference(split_conjunct,[status(thm)],[sk_testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).

cnf(c_8,plain,
    iext(uri_owl_sameAs,sK0,uri_ex_w),
    inference(split_conjunct,[status(thm)],[sk_testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).

cnf(c_9,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    inference(clausify,[status(thm)],[testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes_neg]) ).

cnf(c_11,plain,
    literal_plain(dat_str_abc) = uri_ex_u,
    inference(resolve,[status(thm)],[c_4,c_6]) ).

cnf(c_12,plain,
    iext(uri_owl_sameAs,sK0,uri_ex_u),
    inference(paramod,[status(thm)],[c_11,c_7]) ).

cnf(c_18,plain,
    uri_ex_w = sK0,
    inference(resolve,[status(thm)],[c_4,c_8]) ).

cnf(c_13,plain,
    sK0 = uri_ex_w,
    inference(copy,[status(thm)],[c_18]) ).

cnf(c_14,plain,
    iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
    inference(paramod,[status(thm)],[c_13,c_12]) ).

cnf(c_15,negated_conjecture,
    uri_ex_w != uri_ex_u,
    inference(resolve,[status(thm)],[c_5,c_9]) ).

cnf(c_19,plain,
    uri_ex_u != uri_ex_w,
    inference(copy,[status(thm)],[c_15]) ).

cnf(c_16,plain,
    ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
    inference(resolve,[status(thm)],[c_4,c_19]) ).

cnf(c_17,plain,
    $false,
    inference(resolve,[status(thm)],[c_16,c_14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWB006+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.57  % Computer : n008.cluster.edu
% 0.09/0.57  % Model    : x86_64 x86_64
% 0.09/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57  % Memory   : 8046.5625MB
% 0.09/0.57  % OS       : Linux 6.8.0-71-generic
% 0.09/0.57  % CPULimit : 300
% 0.09/0.57  % WCLimit  : 300
% 0.09/0.57  % DateTime : Sat Sep 26 11:40:59 UTC 2026
% 0.09/0.58  % CPUTime  : 
% 0.09/0.58  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.58  % Process 3556611 was started by sandbox on n008,
% 0.09/0.58  % Sat Sep 26 11:40:59 2026
% 0.09/0.58  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.58  
% 0.09/0.58  % From the command line: assign(max_seconds, 300).
% 0.09/0.59  
% 0.09/0.59  % SZS status Theorem for theBenchmark
% 0.09/0.59  
% 0.09/0.59  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.59  % Length of proof is 16.
% 0.09/0.59  % Level of proof is 5.
% 0.09/0.59  % Maximum clause weight is 7.000.
% 0.09/0.59  % Given clauses 7.
% 0.09/0.59  
% 0.09/0.59  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------