%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : GEO207+1 : TPTP v5.0.0. Released v3.3.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 : Sat Dec 25 08:55:46 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] : ~ convergent_lines(X1,X1),
    file('/tmp/tmpvoib8z/sel_GEO207+1.p_1',apart3) ).

fof(3,conjecture,
    ! [X1] : ~ convergent_lines(X1,X1),
    file('/tmp/tmpvoib8z/sel_GEO207+1.p_1',con) ).

fof(4,negated_conjecture,
    ~ ! [X1] : ~ convergent_lines(X1,X1),
    inference(assume_negation,[status(cth)],[3]) ).

fof(5,plain,
    ! [X1] : ~ convergent_lines(X1,X1),
    inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).

fof(6,negated_conjecture,
    ~ ! [X1] : ~ convergent_lines(X1,X1),
    inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).

fof(7,plain,
    ! [X2] : ~ convergent_lines(X2,X2),
    inference(variable_rename,[status(thm)],[5]) ).

cnf(8,plain,
    ~ convergent_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[7]) ).

fof(12,negated_conjecture,
    ? [X1] : convergent_lines(X1,X1),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(13,negated_conjecture,
    ? [X2] : convergent_lines(X2,X2),
    inference(variable_rename,[status(thm)],[12]) ).

fof(14,negated_conjecture,
    convergent_lines(esk1_0,esk1_0),
    inference(skolemize,[status(esa)],[13]) ).

cnf(15,negated_conjecture,
    convergent_lines(esk1_0,esk1_0),
    inference(split_conjunct,[status(thm)],[14]) ).

cnf(16,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[15,8,theory(equality)]) ).

cnf(17,negated_conjecture,
    $false,
    16,
    [proof] ).

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