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

% Computer : art06.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:24 EST 2011

% Result   : Theorem 0.16s
% Output   : CNFRefutation 0.16s
% 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(1,axiom,
    ! [X1,X2] :
      ( iext(uri_owl_sameAs,X1,X2)
    <=> X1 = X2 ),
    file('/tmp/tmpSdTYj0/sel_SWB006+2.p_1',owl_eqdis_sameas) ).

fof(2,axiom,
    ? [X3] :
      ( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,X3,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,X3,uri_ex_w) ),
    file('/tmp/tmpSdTYj0/sel_SWB006+2.p_1',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).

fof(3,conjecture,
    iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    file('/tmp/tmpSdTYj0/sel_SWB006+2.p_1',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).

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

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

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

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

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

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

fof(10,plain,
    ? [X4] :
      ( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,X4,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,X4,uri_ex_w) ),
    inference(variable_rename,[status(thm)],[2]) ).

fof(11,plain,
    ( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
    & iext(uri_owl_sameAs,esk1_0,literal_plain(dat_str_abc))
    & iext(uri_owl_sameAs,esk1_0,uri_ex_w) ),
    inference(skolemize,[status(esa)],[10]) ).

cnf(12,plain,
    iext(uri_owl_sameAs,esk1_0,uri_ex_w),
    inference(split_conjunct,[status(thm)],[11]) ).

cnf(13,plain,
    iext(uri_owl_sameAs,esk1_0,literal_plain(dat_str_abc)),
    inference(split_conjunct,[status(thm)],[11]) ).

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

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

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

cnf(17,plain,
    esk1_0 = uri_ex_w,
    inference(spm,[status(thm)],[9,12,theory(equality)]) ).

cnf(18,plain,
    uri_ex_u = literal_plain(dat_str_abc),
    inference(spm,[status(thm)],[9,14,theory(equality)]) ).

cnf(21,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_u,esk1_0),
    inference(rw,[status(thm)],[15,17,theory(equality)]) ).

cnf(22,plain,
    iext(uri_owl_sameAs,esk1_0,uri_ex_u),
    inference(rw,[status(thm)],[13,18,theory(equality)]) ).

cnf(26,plain,
    esk1_0 = uri_ex_u,
    inference(spm,[status(thm)],[9,22,theory(equality)]) ).

cnf(30,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[21,26,theory(equality)]),16,theory(equality)]) ).

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

cnf(32,negated_conjecture,
    $false,
    31,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWB/SWB006+2.p
% --creating new selector for []
% -running prover on /tmp/tmpSdTYj0/sel_SWB006+2.p_1 with time limit 29
% -prover status Theorem
% Problem SWB006+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWB/SWB006+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWB/SWB006+2.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
% 
%------------------------------------------------------------------------------