%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : AGT015+2 : TPTP v5.0.0. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art04.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 : Sat Dec 25 03:33:21 EST 2010

% Result   : Theorem 0.29s
% Output   : CNFRefutation 0.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (  11 unt;   0 def)
%            Number of atoms       :   11 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    8 (   8   ~;   0   |;   0   &)
%                                         (   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-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   12 (   2 sgn   4   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(159,axiom,
    ~ accept_city(muslimcountrybhumanitarianorganization,towna),
    file('/tmp/tmpfAqJeh/sel_AGT015+2.p_1',deduced_366) ).

fof(210,conjecture,
    ? [X5,X6] : ~ accept_city(X5,X6),
    file('/tmp/tmpfAqJeh/sel_AGT015+2.p_1',query_15) ).

fof(211,negated_conjecture,
    ~ ? [X5,X6] : ~ accept_city(X5,X6),
    inference(assume_negation,[status(cth)],[210]) ).

fof(230,plain,
    ~ accept_city(muslimcountrybhumanitarianorganization,towna),
    inference(fof_simplification,[status(thm)],[159,theory(equality)]) ).

fof(236,negated_conjecture,
    ~ ? [X5,X6] : ~ accept_city(X5,X6),
    inference(fof_simplification,[status(thm)],[211,theory(equality)]) ).

cnf(401,plain,
    ~ accept_city(muslimcountrybhumanitarianorganization,towna),
    inference(split_conjunct,[status(thm)],[230]) ).

fof(452,negated_conjecture,
    ! [X5,X6] : accept_city(X5,X6),
    inference(fof_nnf,[status(thm)],[236]) ).

fof(453,negated_conjecture,
    ! [X7,X8] : accept_city(X7,X8),
    inference(variable_rename,[status(thm)],[452]) ).

cnf(454,negated_conjecture,
    accept_city(X1,X2),
    inference(split_conjunct,[status(thm)],[453]) ).

cnf(465,plain,
    $false,
    inference(rw,[status(thm)],[401,454,theory(equality)]),
    [unfolding] ).

cnf(466,plain,
    $false,
    465,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/AGT/AGT015+2.p
% --creating new selector for [NUM005+0.ax, AGT001+0.ax, AGT001+1.ax, AGT001+2.ax, NUM005+1.ax]
% -running prover on /tmp/tmpfAqJeh/sel_AGT015+2.p_1 with time limit 29
% -prover status Theorem
% Problem AGT015+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/AGT/AGT015+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/AGT/AGT015+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
% 
%------------------------------------------------------------------------------