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

% Computer : art02.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:19:03 EST 2011

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ? [X1] : iext(uri_ex_p,uri_ex_s,X1),
    file('/tmp/tmp4AtpqJ/sel_SWB003+3.p_1',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).

fof(2,axiom,
    iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
    file('/tmp/tmp4AtpqJ/sel_SWB003+3.p_1',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).

fof(3,negated_conjecture,
    ~ ? [X1] : iext(uri_ex_p,uri_ex_s,X1),
    inference(assume_negation,[status(cth)],[1]) ).

fof(4,negated_conjecture,
    ! [X1] : ~ iext(uri_ex_p,uri_ex_s,X1),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ! [X2] : ~ iext(uri_ex_p,uri_ex_s,X2),
    inference(variable_rename,[status(thm)],[4]) ).

cnf(6,negated_conjecture,
    ~ iext(uri_ex_p,uri_ex_s,X1),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(7,plain,
    iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
    inference(split_conjunct,[status(thm)],[2]) ).

cnf(8,plain,
    $false,
    inference(sr,[status(thm)],[7,6,theory(equality)]) ).

cnf(9,plain,
    $false,
    8,
    [proof] ).

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