TSTP Solution File: GEO245+3 by SInE---0.4

View Problem - Process Solution

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

% Computer : art03.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 09:08:24 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(8,axiom,
    ! [X1,X2] :
      ~ ( left_apart_point(X1,X2)
        | left_apart_point(X1,reverse_line(X2)) ),
    file('/tmp/tmp9ddH7u/sel_GEO245+3.p_1',ax10_basics) ).

fof(18,conjecture,
    ! [X1,X6,X7] :
      ( distinct_points(X1,X6)
     => ( left_apart_point(X7,line_connecting(X1,X6))
       => right_apart_point(X6,line_connecting(X1,X7)) ) ),
    file('/tmp/tmp9ddH7u/sel_GEO245+3.p_1',con) ).

fof(19,negated_conjecture,
    ~ ! [X1,X6,X7] :
        ( distinct_points(X1,X6)
       => ( left_apart_point(X7,line_connecting(X1,X6))
         => right_apart_point(X6,line_connecting(X1,X7)) ) ),
    inference(assume_negation,[status(cth)],[18]) ).

fof(50,plain,
    ! [X1,X2] :
      ( ~ left_apart_point(X1,X2)
      & ~ left_apart_point(X1,reverse_line(X2)) ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(51,plain,
    ! [X3,X4] :
      ( ~ left_apart_point(X3,X4)
      & ~ left_apart_point(X3,reverse_line(X4)) ),
    inference(variable_rename,[status(thm)],[50]) ).

cnf(53,plain,
    ~ left_apart_point(X1,X2),
    inference(split_conjunct,[status(thm)],[51]) ).

fof(84,negated_conjecture,
    ? [X1,X6,X7] :
      ( distinct_points(X1,X6)
      & left_apart_point(X7,line_connecting(X1,X6))
      & ~ right_apart_point(X6,line_connecting(X1,X7)) ),
    inference(fof_nnf,[status(thm)],[19]) ).

fof(85,negated_conjecture,
    ? [X8,X9,X10] :
      ( distinct_points(X8,X9)
      & left_apart_point(X10,line_connecting(X8,X9))
      & ~ right_apart_point(X9,line_connecting(X8,X10)) ),
    inference(variable_rename,[status(thm)],[84]) ).

fof(86,negated_conjecture,
    ( distinct_points(esk1_0,esk2_0)
    & left_apart_point(esk3_0,line_connecting(esk1_0,esk2_0))
    & ~ right_apart_point(esk2_0,line_connecting(esk1_0,esk3_0)) ),
    inference(skolemize,[status(esa)],[85]) ).

cnf(88,negated_conjecture,
    left_apart_point(esk3_0,line_connecting(esk1_0,esk2_0)),
    inference(split_conjunct,[status(thm)],[86]) ).

cnf(90,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[88,53,theory(equality)]) ).

cnf(91,negated_conjecture,
    $false,
    90,
    [proof] ).

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