%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : CSR048+2 : TPTP v5.0.0. Released v3.4.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 06:21:34 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(3,axiom,
    genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),
    file('/tmp/tmpcGk2Ln/sel_CSR048+2.p_1',ax1_140) ).

fof(4,axiom,
    ( mtvisible(c_tptpgeo_member1_mt)
   => borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10) ),
    file('/tmp/tmpcGk2Ln/sel_CSR048+2.p_1',ax1_207) ).

fof(7,axiom,
    ! [X4,X5] :
      ( ( mtvisible(X4)
        & genlmt(X4,X5) )
     => mtvisible(X5) ),
    file('/tmp/tmpcGk2Ln/sel_CSR048+2.p_1',ax1_1123) ).

fof(8,conjecture,
    ? [X6] :
      ( mtvisible(c_tptpgeo_spindlecollectormt)
     => borderson(c_georegion_l4_x45_y9,X6) ),
    file('/tmp/tmpcGk2Ln/sel_CSR048+2.p_1',query98) ).

fof(9,negated_conjecture,
    ~ ? [X6] :
        ( mtvisible(c_tptpgeo_spindlecollectormt)
       => borderson(c_georegion_l4_x45_y9,X6) ),
    inference(assume_negation,[status(cth)],[8]) ).

cnf(16,plain,
    genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),
    inference(split_conjunct,[status(thm)],[3]) ).

fof(17,plain,
    ( ~ mtvisible(c_tptpgeo_member1_mt)
    | borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10) ),
    inference(fof_nnf,[status(thm)],[4]) ).

cnf(18,plain,
    ( borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)
    | ~ mtvisible(c_tptpgeo_member1_mt) ),
    inference(split_conjunct,[status(thm)],[17]) ).

fof(23,plain,
    ! [X4,X5] :
      ( ~ mtvisible(X4)
      | ~ genlmt(X4,X5)
      | mtvisible(X5) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(24,plain,
    ! [X6,X7] :
      ( ~ mtvisible(X6)
      | ~ genlmt(X6,X7)
      | mtvisible(X7) ),
    inference(variable_rename,[status(thm)],[23]) ).

cnf(25,plain,
    ( mtvisible(X1)
    | ~ genlmt(X2,X1)
    | ~ mtvisible(X2) ),
    inference(split_conjunct,[status(thm)],[24]) ).

fof(26,negated_conjecture,
    ! [X6] :
      ( mtvisible(c_tptpgeo_spindlecollectormt)
      & ~ borderson(c_georegion_l4_x45_y9,X6) ),
    inference(fof_nnf,[status(thm)],[9]) ).

fof(27,negated_conjecture,
    ! [X7] :
      ( mtvisible(c_tptpgeo_spindlecollectormt)
      & ~ borderson(c_georegion_l4_x45_y9,X7) ),
    inference(variable_rename,[status(thm)],[26]) ).

cnf(28,negated_conjecture,
    ~ borderson(c_georegion_l4_x45_y9,X1),
    inference(split_conjunct,[status(thm)],[27]) ).

cnf(29,negated_conjecture,
    mtvisible(c_tptpgeo_spindlecollectormt),
    inference(split_conjunct,[status(thm)],[27]) ).

cnf(30,plain,
    ~ mtvisible(c_tptpgeo_member1_mt),
    inference(sr,[status(thm)],[18,28,theory(equality)]) ).

cnf(31,plain,
    ( mtvisible(c_tptpgeo_member1_mt)
    | ~ mtvisible(c_tptpgeo_spindlecollectormt) ),
    inference(spm,[status(thm)],[25,16,theory(equality)]) ).

cnf(33,plain,
    ( mtvisible(c_tptpgeo_member1_mt)
    | $false ),
    inference(rw,[status(thm)],[31,29,theory(equality)]) ).

cnf(34,plain,
    mtvisible(c_tptpgeo_member1_mt),
    inference(cn,[status(thm)],[33,theory(equality)]) ).

cnf(35,plain,
    $false,
    inference(sr,[status(thm)],[34,30,theory(equality)]) ).

cnf(36,plain,
    $false,
    35,
    [proof] ).

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