%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : MSC019+1 : TPTP v5.0.0. Released v4.0.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 21:10:32 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(174,axiom,
    ! [X1,X2,X3] :
      ( ( s_contains(X1,X2)
        & s_contains(X2,X3) )
     => s_contains(X1,X3) ),
    file('/tmp/tmpJ5UpzH/sel_MSC019+1.p_1',axiom1) ).

fof(179,axiom,
    s_contains(s_g013,s_MX),
    file('/tmp/tmpJ5UpzH/sel_MSC019+1.p_1',kb74) ).

fof(375,axiom,
    s_contains(s_g019,s_g013),
    file('/tmp/tmpJ5UpzH/sel_MSC019+1.p_1',kb18) ).

fof(405,conjecture,
    s_contains(s_g019,s_MX),
    file('/tmp/tmpJ5UpzH/sel_MSC019+1.p_1',mexico_in_america_1) ).

fof(605,negated_conjecture,
    ~ s_contains(s_g019,s_MX),
    inference(assume_negation,[status(cth)],[405]) ).

fof(606,negated_conjecture,
    ~ s_contains(s_g019,s_MX),
    inference(fof_simplification,[status(thm)],[605,theory(equality)]) ).

fof(784,plain,
    ! [X1,X2,X3] :
      ( ~ s_contains(X1,X2)
      | ~ s_contains(X2,X3)
      | s_contains(X1,X3) ),
    inference(fof_nnf,[status(thm)],[174]) ).

fof(785,plain,
    ! [X4,X5,X6] :
      ( ~ s_contains(X4,X5)
      | ~ s_contains(X5,X6)
      | s_contains(X4,X6) ),
    inference(variable_rename,[status(thm)],[784]) ).

cnf(786,plain,
    ( s_contains(X1,X2)
    | ~ s_contains(X3,X2)
    | ~ s_contains(X1,X3) ),
    inference(split_conjunct,[status(thm)],[785]) ).

cnf(791,plain,
    s_contains(s_g013,s_MX),
    inference(split_conjunct,[status(thm)],[179]) ).

cnf(987,plain,
    s_contains(s_g019,s_g013),
    inference(split_conjunct,[status(thm)],[375]) ).

cnf(1017,negated_conjecture,
    ~ s_contains(s_g019,s_MX),
    inference(split_conjunct,[status(thm)],[606]) ).

cnf(1825,plain,
    ( s_contains(X1,s_MX)
    | ~ s_contains(X1,s_g013) ),
    inference(spm,[status(thm)],[786,791,theory(equality)]) ).

cnf(2125,negated_conjecture,
    ~ s_contains(s_g019,s_g013),
    inference(spm,[status(thm)],[1017,1825,theory(equality)]) ).

cnf(2127,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[2125,987,theory(equality)]) ).

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

cnf(2129,negated_conjecture,
    $false,
    2128,
    [proof] ).

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