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

% Computer : art07.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:47:42 EST 2011

% Result   : Theorem 0.16s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   12 (   8 unt;   0 def)
%            Number of atoms       :   20 (   6 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   16 (   8   ~;   5   |;   2   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    9 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs),
    file('/tmp/tmp35I7Q8/sel_SWB015+2.p_1',testcase_conclusion_fullish_015_Reflective_Tautologies_I) ).

fof(2,axiom,
    ! [X1,X2] :
      ( iext(uri_owl_sameAs,X1,X2)
    <=> X1 = X2 ),
    file('/tmp/tmp35I7Q8/sel_SWB015+2.p_1',owl_eqdis_sameas) ).

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

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

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

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)],[2]) ).

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(10,plain,
    iext(uri_owl_sameAs,X1,X1),
    inference(er,[status(thm)],[8,theory(equality)]) ).

cnf(11,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[5,10,theory(equality)]) ).

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

cnf(13,negated_conjecture,
    $false,
    12,
    [proof] ).

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