%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : GEO086+1 : TPTP v5.0.0. Released v2.4.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 08:04:30 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(5,axiom,
    ! [X2,X3] :
      ( ( part_of(X3,X2)
        & X3 != X2 )
     => open(X3) ),
    file('/tmp/tmpDi396a/sel_GEO086+1.p_1',c1) ).

fof(9,conjecture,
    ! [X2,X8] :
      ( ( open(X2)
        & part_of(X8,X2) )
     => open(X8) ),
    file('/tmp/tmpDi396a/sel_GEO086+1.p_1',theorem_2_7_2) ).

fof(10,negated_conjecture,
    ~ ! [X2,X8] :
        ( ( open(X2)
          & part_of(X8,X2) )
       => open(X8) ),
    inference(assume_negation,[status(cth)],[9]) ).

fof(42,plain,
    ! [X2,X3] :
      ( ~ part_of(X3,X2)
      | X3 = X2
      | open(X3) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(43,plain,
    ! [X4,X5] :
      ( ~ part_of(X5,X4)
      | X5 = X4
      | open(X5) ),
    inference(variable_rename,[status(thm)],[42]) ).

cnf(44,plain,
    ( open(X1)
    | X1 = X2
    | ~ part_of(X1,X2) ),
    inference(split_conjunct,[status(thm)],[43]) ).

fof(60,negated_conjecture,
    ? [X2,X8] :
      ( open(X2)
      & part_of(X8,X2)
      & ~ open(X8) ),
    inference(fof_nnf,[status(thm)],[10]) ).

fof(61,negated_conjecture,
    ? [X9,X10] :
      ( open(X9)
      & part_of(X10,X9)
      & ~ open(X10) ),
    inference(variable_rename,[status(thm)],[60]) ).

fof(62,negated_conjecture,
    ( open(esk7_0)
    & part_of(esk8_0,esk7_0)
    & ~ open(esk8_0) ),
    inference(skolemize,[status(esa)],[61]) ).

cnf(63,negated_conjecture,
    ~ open(esk8_0),
    inference(split_conjunct,[status(thm)],[62]) ).

cnf(64,negated_conjecture,
    part_of(esk8_0,esk7_0),
    inference(split_conjunct,[status(thm)],[62]) ).

cnf(65,negated_conjecture,
    open(esk7_0),
    inference(split_conjunct,[status(thm)],[62]) ).

cnf(72,negated_conjecture,
    ( esk8_0 = esk7_0
    | open(esk8_0) ),
    inference(spm,[status(thm)],[44,64,theory(equality)]) ).

cnf(73,negated_conjecture,
    esk7_0 = esk8_0,
    inference(sr,[status(thm)],[72,63,theory(equality)]) ).

cnf(91,negated_conjecture,
    open(esk8_0),
    inference(rw,[status(thm)],[65,73,theory(equality)]) ).

cnf(92,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[91,63,theory(equality)]) ).

cnf(93,negated_conjecture,
    $false,
    92,
    [proof] ).

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