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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : GEO236+3 : TPTP v5.0.0. Released v4.0.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 09:06:35 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(12,axiom,
    ! [X1,X4] :
      ~ ( left_apart_point(X1,X4)
        | left_apart_point(X1,reverse_line(X4)) ),
    file('/tmp/tmp2osXpS/sel_GEO236+3.p_1',ax10_basics) ).

fof(23,conjecture,
    ! [X1,X4,X5] :
      ( ( left_apart_point(X1,X4)
        & right_apart_point(X1,X5) )
     => ( unequally_directed_lines(X4,X5)
        | distinct_lines(X4,X5) ) ),
    file('/tmp/tmp2osXpS/sel_GEO236+3.p_1',con) ).

fof(24,negated_conjecture,
    ~ ! [X1,X4,X5] :
        ( ( left_apart_point(X1,X4)
          & right_apart_point(X1,X5) )
       => ( unequally_directed_lines(X4,X5)
          | distinct_lines(X4,X5) ) ),
    inference(assume_negation,[status(cth)],[23]) ).

fof(65,plain,
    ! [X1,X4] :
      ( ~ left_apart_point(X1,X4)
      & ~ left_apart_point(X1,reverse_line(X4)) ),
    inference(fof_nnf,[status(thm)],[12]) ).

fof(66,plain,
    ! [X5,X6] :
      ( ~ left_apart_point(X5,X6)
      & ~ left_apart_point(X5,reverse_line(X6)) ),
    inference(variable_rename,[status(thm)],[65]) ).

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

fof(104,negated_conjecture,
    ? [X1,X4,X5] :
      ( left_apart_point(X1,X4)
      & right_apart_point(X1,X5)
      & ~ unequally_directed_lines(X4,X5)
      & ~ distinct_lines(X4,X5) ),
    inference(fof_nnf,[status(thm)],[24]) ).

fof(105,negated_conjecture,
    ? [X6,X7,X8] :
      ( left_apart_point(X6,X7)
      & right_apart_point(X6,X8)
      & ~ unequally_directed_lines(X7,X8)
      & ~ distinct_lines(X7,X8) ),
    inference(variable_rename,[status(thm)],[104]) ).

fof(106,negated_conjecture,
    ( left_apart_point(esk1_0,esk2_0)
    & right_apart_point(esk1_0,esk3_0)
    & ~ unequally_directed_lines(esk2_0,esk3_0)
    & ~ distinct_lines(esk2_0,esk3_0) ),
    inference(skolemize,[status(esa)],[105]) ).

cnf(110,negated_conjecture,
    left_apart_point(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[106]) ).

cnf(111,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[110,68,theory(equality)]) ).

cnf(112,negated_conjecture,
    $false,
    111,
    [proof] ).

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