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

% Computer : art09.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 06:20:50 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ( mtvisible(c_tptpgeo_member4_mt)
   => borderson(c_georegion_l4_x36_y50,c_georegion_l4_x37_y50) ),
    file('/tmp/tmpsIKY3O/sel_CSR047+2.p_1',ax1_383) ).

fof(2,axiom,
    ! [X1,X2] :
      ( borderson(X1,X2)
     => borderson(X2,X1) ),
    file('/tmp/tmpsIKY3O/sel_CSR047+2.p_1',ax1_900) ).

fof(6,conjecture,
    ( mtvisible(c_tptpgeo_member4_mt)
   => borderson(c_georegion_l4_x37_y50,c_georegion_l4_x36_y50) ),
    file('/tmp/tmpsIKY3O/sel_CSR047+2.p_1',query97) ).

fof(7,negated_conjecture,
    ~ ( mtvisible(c_tptpgeo_member4_mt)
     => borderson(c_georegion_l4_x37_y50,c_georegion_l4_x36_y50) ),
    inference(assume_negation,[status(cth)],[6]) ).

fof(9,plain,
    ( ~ mtvisible(c_tptpgeo_member4_mt)
    | borderson(c_georegion_l4_x36_y50,c_georegion_l4_x37_y50) ),
    inference(fof_nnf,[status(thm)],[1]) ).

cnf(10,plain,
    ( borderson(c_georegion_l4_x36_y50,c_georegion_l4_x37_y50)
    | ~ mtvisible(c_tptpgeo_member4_mt) ),
    inference(split_conjunct,[status(thm)],[9]) ).

fof(11,plain,
    ! [X1,X2] :
      ( ~ borderson(X1,X2)
      | borderson(X2,X1) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(12,plain,
    ! [X3,X4] :
      ( ~ borderson(X3,X4)
      | borderson(X4,X3) ),
    inference(variable_rename,[status(thm)],[11]) ).

cnf(13,plain,
    ( borderson(X1,X2)
    | ~ borderson(X2,X1) ),
    inference(split_conjunct,[status(thm)],[12]) ).

fof(22,negated_conjecture,
    ( mtvisible(c_tptpgeo_member4_mt)
    & ~ borderson(c_georegion_l4_x37_y50,c_georegion_l4_x36_y50) ),
    inference(fof_nnf,[status(thm)],[7]) ).

cnf(23,negated_conjecture,
    ~ borderson(c_georegion_l4_x37_y50,c_georegion_l4_x36_y50),
    inference(split_conjunct,[status(thm)],[22]) ).

cnf(24,negated_conjecture,
    mtvisible(c_tptpgeo_member4_mt),
    inference(split_conjunct,[status(thm)],[22]) ).

cnf(25,plain,
    ( borderson(c_georegion_l4_x36_y50,c_georegion_l4_x37_y50)
    | $false ),
    inference(rw,[status(thm)],[10,24,theory(equality)]) ).

cnf(26,plain,
    borderson(c_georegion_l4_x36_y50,c_georegion_l4_x37_y50),
    inference(cn,[status(thm)],[25,theory(equality)]) ).

cnf(27,plain,
    borderson(c_georegion_l4_x37_y50,c_georegion_l4_x36_y50),
    inference(spm,[status(thm)],[13,26,theory(equality)]) ).

cnf(28,plain,
    $false,
    inference(sr,[status(thm)],[27,23,theory(equality)]) ).

cnf(29,plain,
    $false,
    28,
    [proof] ).

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