%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SWB006+1 : TPTP v5.2.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art01.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Tue Feb 15 23:40:18 EST 2011

% Result   : Theorem 0.49s
% Output   : CNFRefutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (  16 unt;   0 def)
%            Number of atoms       :   39 (  10 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   25 (  10   ~;   6   |;   8   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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   :   13 (   0 sgn   6   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(12,axiom,
    ! [X1,X2] :
      ( iext(uri_owl_sameAs,X1,X2)
    <=> X1 = X2 ),
    file('/tmp/tmpGFZCn9/sel_SWB006+1.p_1',owl_eqdis_sameas) ).

fof(13,axiom,
    ? [X7] :
      ( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,X7,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,X7,uri_ex_w) ),
    file('/tmp/tmpGFZCn9/sel_SWB006+1.p_1',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).

fof(14,conjecture,
    iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    file('/tmp/tmpGFZCn9/sel_SWB006+1.p_1',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).

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

fof(16,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    inference(fof_simplification,[status(thm)],[15,theory(equality)]) ).

fof(53,plain,
    ! [X1,X2] :
      ( ( ~ iext(uri_owl_sameAs,X1,X2)
        | X1 = X2 )
      & ( X1 != X2
        | iext(uri_owl_sameAs,X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[12]) ).

fof(54,plain,
    ! [X3,X4] :
      ( ( ~ iext(uri_owl_sameAs,X3,X4)
        | X3 = X4 )
      & ( X3 != X4
        | iext(uri_owl_sameAs,X3,X4) ) ),
    inference(variable_rename,[status(thm)],[53]) ).

cnf(55,plain,
    ( iext(uri_owl_sameAs,X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[54]) ).

cnf(56,plain,
    ( X1 = X2
    | ~ iext(uri_owl_sameAs,X1,X2) ),
    inference(split_conjunct,[status(thm)],[54]) ).

fof(57,plain,
    ? [X8] :
      ( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,X8,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,X8,uri_ex_w) ),
    inference(variable_rename,[status(thm)],[13]) ).

fof(58,plain,
    ( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
    & iext(uri_owl_sameAs,esk2_0,literal_plain(dat_str_abc))
    & iext(uri_owl_sameAs,esk2_0,uri_ex_w) ),
    inference(skolemize,[status(esa)],[57]) ).

cnf(59,plain,
    iext(uri_owl_sameAs,esk2_0,uri_ex_w),
    inference(split_conjunct,[status(thm)],[58]) ).

cnf(60,plain,
    iext(uri_owl_sameAs,esk2_0,literal_plain(dat_str_abc)),
    inference(split_conjunct,[status(thm)],[58]) ).

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

cnf(62,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    inference(split_conjunct,[status(thm)],[16]) ).

cnf(73,plain,
    iext(uri_owl_sameAs,X1,X1),
    inference(er,[status(thm)],[55,theory(equality)]) ).

cnf(74,plain,
    esk2_0 = uri_ex_w,
    inference(spm,[status(thm)],[56,59,theory(equality)]) ).

cnf(75,plain,
    uri_ex_u = literal_plain(dat_str_abc),
    inference(spm,[status(thm)],[56,61,theory(equality)]) ).

cnf(86,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_u,esk2_0),
    inference(rw,[status(thm)],[62,74,theory(equality)]) ).

cnf(87,plain,
    iext(uri_owl_sameAs,esk2_0,uri_ex_u),
    inference(rw,[status(thm)],[60,75,theory(equality)]) ).

cnf(89,plain,
    esk2_0 = uri_ex_u,
    inference(spm,[status(thm)],[56,87,theory(equality)]) ).

cnf(95,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[86,89,theory(equality)]),73,theory(equality)]) ).

cnf(96,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[95,theory(equality)]) ).

cnf(97,negated_conjecture,
    $false,
    96,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWB/SWB006+1.p
% --creating new selector for [SWB001+0.ax]
% -running prover on /tmp/tmpGFZCn9/sel_SWB006+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWB006+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWB/SWB006+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWB/SWB006+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
% 
%------------------------------------------------------------------------------