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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : GEO195+3 : TPTP v5.0.0. Released v4.0.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:51:02 EST 2010

% Result   : Theorem 185.54s
% Output   : CNFRefutation 185.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   37 (  18 unt;   0 def)
%            Number of atoms       :   79 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   67 (  25   ~;  19   |;  16   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   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   :   70 (   6 sgn  45   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(4,axiom,
    ! [X4,X5,X6] :
      ( apart_point_and_line(X4,X5)
     => ( distinct_lines(X5,X6)
        | apart_point_and_line(X4,X6) ) ),
    file('/tmp/tmppHKWp-/sel_GEO195+3.p_4',ceq2) ).

fof(8,axiom,
    ! [X4,X5,X6] :
      ( convergent_lines(X4,X5)
     => ( convergent_lines(X4,X6)
        | convergent_lines(X5,X6) ) ),
    file('/tmp/tmppHKWp-/sel_GEO195+3.p_4',ax6) ).

fof(16,axiom,
    ! [X4] : ~ convergent_lines(X4,X4),
    file('/tmp/tmppHKWp-/sel_GEO195+3.p_4',apart3) ).

fof(21,axiom,
    ! [X4,X5] : ~ convergent_lines(parallel_through_point(X5,X4),X5),
    file('/tmp/tmppHKWp-/sel_GEO195+3.p_4',cp1) ).

fof(23,axiom,
    ! [X4,X5] : ~ apart_point_and_line(X4,parallel_through_point(X5,X4)),
    file('/tmp/tmppHKWp-/sel_GEO195+3.p_4',cp2) ).

fof(26,axiom,
    ! [X4,X5] :
      ( distinct_lines(X4,X5)
     => convergent_lines(X4,X5) ),
    file('/tmp/tmppHKWp-/sel_GEO195+3.p_4',p1) ).

fof(31,conjecture,
    ! [X4,X5,X6] :
      ( ( convergent_lines(X4,X5)
        & convergent_lines(X6,X5)
        & convergent_lines(X4,X6) )
     => ( apart_point_and_line(intersection_point(X4,X5),X6)
       => apart_point_and_line(intersection_point(X5,X4),X6) ) ),
    file('/tmp/tmppHKWp-/sel_GEO195+3.p_4',con) ).

fof(32,negated_conjecture,
    ~ ! [X4,X5,X6] :
        ( ( convergent_lines(X4,X5)
          & convergent_lines(X6,X5)
          & convergent_lines(X4,X6) )
       => ( apart_point_and_line(intersection_point(X4,X5),X6)
         => apart_point_and_line(intersection_point(X5,X4),X6) ) ),
    inference(assume_negation,[status(cth)],[31]) ).

fof(41,plain,
    ! [X4] : ~ convergent_lines(X4,X4),
    inference(fof_simplification,[status(thm)],[16,theory(equality)]) ).

fof(42,plain,
    ! [X4,X5] : ~ convergent_lines(parallel_through_point(X5,X4),X5),
    inference(fof_simplification,[status(thm)],[21,theory(equality)]) ).

fof(43,plain,
    ! [X4,X5] : ~ apart_point_and_line(X4,parallel_through_point(X5,X4)),
    inference(fof_simplification,[status(thm)],[23,theory(equality)]) ).

fof(64,plain,
    ! [X4,X5,X6] :
      ( ~ apart_point_and_line(X4,X5)
      | distinct_lines(X5,X6)
      | apart_point_and_line(X4,X6) ),
    inference(fof_nnf,[status(thm)],[4]) ).

fof(65,plain,
    ! [X7,X8,X9] :
      ( ~ apart_point_and_line(X7,X8)
      | distinct_lines(X8,X9)
      | apart_point_and_line(X7,X9) ),
    inference(variable_rename,[status(thm)],[64]) ).

cnf(66,plain,
    ( apart_point_and_line(X1,X2)
    | distinct_lines(X3,X2)
    | ~ apart_point_and_line(X1,X3) ),
    inference(split_conjunct,[status(thm)],[65]) ).

fof(75,plain,
    ! [X4,X5,X6] :
      ( ~ convergent_lines(X4,X5)
      | convergent_lines(X4,X6)
      | convergent_lines(X5,X6) ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(76,plain,
    ! [X7,X8,X9] :
      ( ~ convergent_lines(X7,X8)
      | convergent_lines(X7,X9)
      | convergent_lines(X8,X9) ),
    inference(variable_rename,[status(thm)],[75]) ).

cnf(77,plain,
    ( convergent_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    inference(split_conjunct,[status(thm)],[76]) ).

fof(97,plain,
    ! [X5] : ~ convergent_lines(X5,X5),
    inference(variable_rename,[status(thm)],[41]) ).

cnf(98,plain,
    ~ convergent_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[97]) ).

fof(111,plain,
    ! [X6,X7] : ~ convergent_lines(parallel_through_point(X7,X6),X7),
    inference(variable_rename,[status(thm)],[42]) ).

cnf(112,plain,
    ~ convergent_lines(parallel_through_point(X1,X2),X1),
    inference(split_conjunct,[status(thm)],[111]) ).

fof(116,plain,
    ! [X6,X7] : ~ apart_point_and_line(X6,parallel_through_point(X7,X6)),
    inference(variable_rename,[status(thm)],[43]) ).

cnf(117,plain,
    ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
    inference(split_conjunct,[status(thm)],[116]) ).

fof(123,plain,
    ! [X4,X5] :
      ( ~ distinct_lines(X4,X5)
      | convergent_lines(X4,X5) ),
    inference(fof_nnf,[status(thm)],[26]) ).

fof(124,plain,
    ! [X6,X7] :
      ( ~ distinct_lines(X6,X7)
      | convergent_lines(X6,X7) ),
    inference(variable_rename,[status(thm)],[123]) ).

cnf(125,plain,
    ( convergent_lines(X1,X2)
    | ~ distinct_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[124]) ).

fof(137,negated_conjecture,
    ? [X4,X5,X6] :
      ( convergent_lines(X4,X5)
      & convergent_lines(X6,X5)
      & convergent_lines(X4,X6)
      & apart_point_and_line(intersection_point(X4,X5),X6)
      & ~ apart_point_and_line(intersection_point(X5,X4),X6) ),
    inference(fof_nnf,[status(thm)],[32]) ).

fof(138,negated_conjecture,
    ? [X7,X8,X9] :
      ( convergent_lines(X7,X8)
      & convergent_lines(X9,X8)
      & convergent_lines(X7,X9)
      & apart_point_and_line(intersection_point(X7,X8),X9)
      & ~ apart_point_and_line(intersection_point(X8,X7),X9) ),
    inference(variable_rename,[status(thm)],[137]) ).

fof(139,negated_conjecture,
    ( convergent_lines(esk1_0,esk2_0)
    & convergent_lines(esk3_0,esk2_0)
    & convergent_lines(esk1_0,esk3_0)
    & apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
    & ~ apart_point_and_line(intersection_point(esk2_0,esk1_0),esk3_0) ),
    inference(skolemize,[status(esa)],[138]) ).

cnf(141,negated_conjecture,
    apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
    inference(split_conjunct,[status(thm)],[139]) ).

cnf(152,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
    | distinct_lines(esk3_0,X1) ),
    inference(spm,[status(thm)],[66,141,theory(equality)]) ).

cnf(284,negated_conjecture,
    distinct_lines(esk3_0,parallel_through_point(X1,intersection_point(esk1_0,esk2_0))),
    inference(spm,[status(thm)],[117,152,theory(equality)]) ).

cnf(850,negated_conjecture,
    convergent_lines(esk3_0,parallel_through_point(X1,intersection_point(esk1_0,esk2_0))),
    inference(spm,[status(thm)],[125,284,theory(equality)]) ).

cnf(866,negated_conjecture,
    ( convergent_lines(parallel_through_point(X1,intersection_point(esk1_0,esk2_0)),X2)
    | convergent_lines(esk3_0,X2) ),
    inference(spm,[status(thm)],[77,850,theory(equality)]) ).

cnf(978,negated_conjecture,
    convergent_lines(esk3_0,X1),
    inference(spm,[status(thm)],[112,866,theory(equality)]) ).

cnf(983,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[98,978,theory(equality)]) ).

cnf(1011,negated_conjecture,
    $false,
    983,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO195+3.p
% --creating new selector for [GEO006+3.ax, GEO006+0.ax, GEO006+1.ax, GEO006+2.ax, GEO006+4.ax, GEO006+5.ax, GEO006+6.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmppHKWp-/sel_GEO195+3.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmppHKWp-/sel_GEO195+3.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [GEO006+3.ax, GEO006+0.ax, GEO006+1.ax, GEO006+2.ax, GEO006+4.ax, GEO006+5.ax, GEO006+6.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmppHKWp-/sel_GEO195+3.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [GEO006+3.ax, GEO006+0.ax, GEO006+1.ax, GEO006+2.ax, GEO006+4.ax, GEO006+5.ax, GEO006+6.ax]
% -running prover on /tmp/tmppHKWp-/sel_GEO195+3.p_4 with time limit 56
% -prover status Theorem
% Problem GEO195+3.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO195+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO195+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
% 
%------------------------------------------------------------------------------