%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : AGT004+2 : TPTP v5.0.0. Bugfixed v3.1.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 : Sat Dec 25 03:30:46 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(13,axiom,
    ~ accept_city(countryamedicalorganization,coastvillage),
    file('/tmp/tmpJ4eVdO/sel_AGT004+2.p_1',deduced_13) ).

fof(139,axiom,
    ! [X1,X2,X3,X4] :
      ( accept_team(X1,X4,X2,X3)
    <=> ( accept_city(X1,X2)
        & accept_leader(X1,X4)
        & accept_number(X1,X3) ) ),
    file('/tmp/tmpJ4eVdO/sel_AGT004+2.p_1',a1_1) ).

fof(350,conjecture,
    ~ accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
    file('/tmp/tmpJ4eVdO/sel_AGT004+2.p_1',query_4) ).

fof(351,negated_conjecture,
    ~ ~ accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
    inference(assume_negation,[status(cth)],[350]) ).

fof(352,plain,
    ~ accept_city(countryamedicalorganization,coastvillage),
    inference(fof_simplification,[status(thm)],[13,theory(equality)]) ).

fof(391,negated_conjecture,
    accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
    inference(fof_simplification,[status(thm)],[351,theory(equality)]) ).

cnf(404,plain,
    ~ accept_city(countryamedicalorganization,coastvillage),
    inference(split_conjunct,[status(thm)],[352]) ).

fof(530,plain,
    ! [X1,X2,X3,X4] :
      ( ( ~ accept_team(X1,X4,X2,X3)
        | ( accept_city(X1,X2)
          & accept_leader(X1,X4)
          & accept_number(X1,X3) ) )
      & ( ~ accept_city(X1,X2)
        | ~ accept_leader(X1,X4)
        | ~ accept_number(X1,X3)
        | accept_team(X1,X4,X2,X3) ) ),
    inference(fof_nnf,[status(thm)],[139]) ).

fof(531,plain,
    ! [X5,X6,X7,X8] :
      ( ( ~ accept_team(X5,X8,X6,X7)
        | ( accept_city(X5,X6)
          & accept_leader(X5,X8)
          & accept_number(X5,X7) ) )
      & ( ~ accept_city(X5,X6)
        | ~ accept_leader(X5,X8)
        | ~ accept_number(X5,X7)
        | accept_team(X5,X8,X6,X7) ) ),
    inference(variable_rename,[status(thm)],[530]) ).

fof(532,plain,
    ! [X5,X6,X7,X8] :
      ( ( accept_city(X5,X6)
        | ~ accept_team(X5,X8,X6,X7) )
      & ( accept_leader(X5,X8)
        | ~ accept_team(X5,X8,X6,X7) )
      & ( accept_number(X5,X7)
        | ~ accept_team(X5,X8,X6,X7) )
      & ( ~ accept_city(X5,X6)
        | ~ accept_leader(X5,X8)
        | ~ accept_number(X5,X7)
        | accept_team(X5,X8,X6,X7) ) ),
    inference(distribute,[status(thm)],[531]) ).

cnf(536,plain,
    ( accept_city(X1,X3)
    | ~ accept_team(X1,X2,X3,X4) ),
    inference(split_conjunct,[status(thm)],[532]) ).

cnf(747,negated_conjecture,
    accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
    inference(split_conjunct,[status(thm)],[391]) ).

cnf(1122,negated_conjecture,
    accept_city(countryamedicalorganization,coastvillage),
    inference(spm,[status(thm)],[536,747,theory(equality)]) ).

cnf(1207,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[1122,404,theory(equality)]) ).

cnf(1208,negated_conjecture,
    $false,
    1207,
    [proof] ).

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