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

% Computer : art01.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:30:25 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(270,axiom,
    ~ accept_team(christiansufferterrahumanitarianorganization,sufferterragovernment,towna,n6),
    file('/tmp/tmpLT4KJr/sel_AGT002+2.p_1',event_213) ).

fof(379,conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,sufferterragovernment,towna,n6),
    file('/tmp/tmpLT4KJr/sel_AGT002+2.p_1',query_2) ).

fof(380,negated_conjecture,
    ~ ~ accept_team(christiansufferterrahumanitarianorganization,sufferterragovernment,towna,n6),
    inference(assume_negation,[status(cth)],[379]) ).

fof(408,plain,
    ~ accept_team(christiansufferterrahumanitarianorganization,sufferterragovernment,towna,n6),
    inference(fof_simplification,[status(thm)],[270,theory(equality)]) ).

fof(424,negated_conjecture,
    accept_team(christiansufferterrahumanitarianorganization,sufferterragovernment,towna,n6),
    inference(fof_simplification,[status(thm)],[380,theory(equality)]) ).

cnf(700,plain,
    ~ accept_team(christiansufferterrahumanitarianorganization,sufferterragovernment,towna,n6),
    inference(split_conjunct,[status(thm)],[408]) ).

cnf(809,negated_conjecture,
    accept_team(christiansufferterrahumanitarianorganization,sufferterragovernment,towna,n6),
    inference(split_conjunct,[status(thm)],[424]) ).

cnf(813,plain,
    $false,
    inference(rw,[status(thm)],[700,809,theory(equality)]) ).

cnf(814,plain,
    $false,
    inference(cn,[status(thm)],[813,theory(equality)]) ).

cnf(815,plain,
    $false,
    814,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/AGT/AGT002+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/tmpLT4KJr/sel_AGT002+2.p_1 with time limit 29
% -prover status Theorem
% Problem AGT002+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/AGT/AGT002+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/AGT/AGT002+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
% 
%------------------------------------------------------------------------------