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

% Computer : art05.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 : Fri Feb 25 01:18:52 EST 2011

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ? [X1] :
      ( iext(uri_ex_p,uri_ex_s,X1)
      & iext(uri_ex_q,X1,uri_ex_s) ),
    file('/tmp/tmpKu8SIj/sel_SWB002+3.p_1',testcase_premise_fullish_002_Existential_Blank_Nodes) ).

fof(2,conjecture,
    ? [X2,X3] :
      ( iext(uri_ex_p,X2,X3)
      & iext(uri_ex_q,X3,X2) ),
    file('/tmp/tmpKu8SIj/sel_SWB002+3.p_1',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).

fof(3,negated_conjecture,
    ~ ? [X2,X3] :
        ( iext(uri_ex_p,X2,X3)
        & iext(uri_ex_q,X3,X2) ),
    inference(assume_negation,[status(cth)],[2]) ).

fof(4,plain,
    ? [X2] :
      ( iext(uri_ex_p,uri_ex_s,X2)
      & iext(uri_ex_q,X2,uri_ex_s) ),
    inference(variable_rename,[status(thm)],[1]) ).

fof(5,plain,
    ( iext(uri_ex_p,uri_ex_s,esk1_0)
    & iext(uri_ex_q,esk1_0,uri_ex_s) ),
    inference(skolemize,[status(esa)],[4]) ).

cnf(6,plain,
    iext(uri_ex_q,esk1_0,uri_ex_s),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(7,plain,
    iext(uri_ex_p,uri_ex_s,esk1_0),
    inference(split_conjunct,[status(thm)],[5]) ).

fof(8,negated_conjecture,
    ! [X2,X3] :
      ( ~ iext(uri_ex_p,X2,X3)
      | ~ iext(uri_ex_q,X3,X2) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(9,negated_conjecture,
    ! [X4,X5] :
      ( ~ iext(uri_ex_p,X4,X5)
      | ~ iext(uri_ex_q,X5,X4) ),
    inference(variable_rename,[status(thm)],[8]) ).

cnf(10,negated_conjecture,
    ( ~ iext(uri_ex_q,X1,X2)
    | ~ iext(uri_ex_p,X2,X1) ),
    inference(split_conjunct,[status(thm)],[9]) ).

cnf(11,negated_conjecture,
    ~ iext(uri_ex_q,esk1_0,uri_ex_s),
    inference(spm,[status(thm)],[10,7,theory(equality)]) ).

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

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

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

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