%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : PUZ132+1 : TPTP v5.0.0. Released v4.1.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 : Sun Dec 26 00:57:30 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    country(usa),
    file('/tmp/tmpgojVjQ/sel_PUZ132+1.p_1',usa_type) ).

fof(3,axiom,
    ! [X2] :
      ( city(X2)
     => has_crime(X2) ),
    file('/tmp/tmpgojVjQ/sel_PUZ132+1.p_1',crime_axiom) ).

fof(6,conjecture,
    ( beautiful(washington)
    & has_crime(washington) ),
    file('/tmp/tmpgojVjQ/sel_PUZ132+1.p_1',washington_conjecture) ).

fof(7,axiom,
    ! [X2] :
      ( country(X2)
     => beautiful(capital_city(X2)) ),
    file('/tmp/tmpgojVjQ/sel_PUZ132+1.p_1',beautiful_capital_axiom) ).

fof(8,axiom,
    capital_city(usa) = washington,
    file('/tmp/tmpgojVjQ/sel_PUZ132+1.p_1',usa_capital_axiom) ).

fof(9,axiom,
    capital(washington),
    file('/tmp/tmpgojVjQ/sel_PUZ132+1.p_1',washington_type) ).

fof(11,axiom,
    ! [X1] :
      ( capital(X1)
     => city(X1) ),
    file('/tmp/tmpgojVjQ/sel_PUZ132+1.p_1',capital_city_type) ).

fof(12,negated_conjecture,
    ~ ( beautiful(washington)
      & has_crime(washington) ),
    inference(assume_negation,[status(cth)],[6]) ).

cnf(13,plain,
    country(usa),
    inference(split_conjunct,[status(thm)],[1]) ).

fof(17,plain,
    ! [X2] :
      ( ~ city(X2)
      | has_crime(X2) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(18,plain,
    ! [X3] :
      ( ~ city(X3)
      | has_crime(X3) ),
    inference(variable_rename,[status(thm)],[17]) ).

cnf(19,plain,
    ( has_crime(X1)
    | ~ city(X1) ),
    inference(split_conjunct,[status(thm)],[18]) ).

fof(26,negated_conjecture,
    ( ~ beautiful(washington)
    | ~ has_crime(washington) ),
    inference(fof_nnf,[status(thm)],[12]) ).

cnf(27,negated_conjecture,
    ( ~ has_crime(washington)
    | ~ beautiful(washington) ),
    inference(split_conjunct,[status(thm)],[26]) ).

fof(28,plain,
    ! [X2] :
      ( ~ country(X2)
      | beautiful(capital_city(X2)) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(29,plain,
    ! [X3] :
      ( ~ country(X3)
      | beautiful(capital_city(X3)) ),
    inference(variable_rename,[status(thm)],[28]) ).

cnf(30,plain,
    ( beautiful(capital_city(X1))
    | ~ country(X1) ),
    inference(split_conjunct,[status(thm)],[29]) ).

cnf(31,plain,
    capital_city(usa) = washington,
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(32,plain,
    capital(washington),
    inference(split_conjunct,[status(thm)],[9]) ).

fof(36,plain,
    ! [X1] :
      ( ~ capital(X1)
      | city(X1) ),
    inference(fof_nnf,[status(thm)],[11]) ).

fof(37,plain,
    ! [X2] :
      ( ~ capital(X2)
      | city(X2) ),
    inference(variable_rename,[status(thm)],[36]) ).

cnf(38,plain,
    ( city(X1)
    | ~ capital(X1) ),
    inference(split_conjunct,[status(thm)],[37]) ).

cnf(39,plain,
    ( beautiful(washington)
    | ~ country(usa) ),
    inference(spm,[status(thm)],[30,31,theory(equality)]) ).

cnf(40,plain,
    ( beautiful(washington)
    | $false ),
    inference(rw,[status(thm)],[39,13,theory(equality)]) ).

cnf(41,plain,
    beautiful(washington),
    inference(cn,[status(thm)],[40,theory(equality)]) ).

cnf(46,negated_conjecture,
    ( $false
    | ~ has_crime(washington) ),
    inference(rw,[status(thm)],[27,41,theory(equality)]) ).

cnf(47,negated_conjecture,
    ~ has_crime(washington),
    inference(cn,[status(thm)],[46,theory(equality)]) ).

cnf(48,negated_conjecture,
    ~ city(washington),
    inference(spm,[status(thm)],[47,19,theory(equality)]) ).

cnf(49,negated_conjecture,
    ~ capital(washington),
    inference(spm,[status(thm)],[48,38,theory(equality)]) ).

cnf(50,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[49,32,theory(equality)]) ).

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

cnf(52,negated_conjecture,
    $false,
    51,
    [proof] ).

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