TSTP Solution File: GEO176+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO176+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 08:44:54 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 71 ( 26 ~; 25 |; 13 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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; 4 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 33 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_points(X1,X3)
| apart_point_and_line(X3,X2) ) ),
file('/tmp/tmpl4ZaQV/sel_GEO176+3.p_1',ceq1) ).
fof(8,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/tmp/tmpl4ZaQV/sel_GEO176+3.p_1',ci3) ).
fof(10,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/tmp/tmpl4ZaQV/sel_GEO176+3.p_1',ci4) ).
fof(16,conjecture,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5) ) )
=> distinct_points(X1,intersection_point(X4,X5)) ),
file('/tmp/tmpl4ZaQV/sel_GEO176+3.p_1',con) ).
fof(17,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5) ) )
=> distinct_points(X1,intersection_point(X4,X5)) ),
inference(assume_negation,[status(cth)],[16]) ).
fof(19,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(20,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[10,theory(equality)]) ).
fof(40,plain,
! [X1,X2,X3] :
( ~ apart_point_and_line(X1,X2)
| distinct_points(X1,X3)
| apart_point_and_line(X3,X2) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(41,plain,
! [X4,X5,X6] :
( ~ apart_point_and_line(X4,X5)
| distinct_points(X4,X6)
| apart_point_and_line(X6,X5) ),
inference(variable_rename,[status(thm)],[40]) ).
cnf(42,plain,
( apart_point_and_line(X1,X2)
| distinct_points(X3,X1)
| ~ apart_point_and_line(X3,X2) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(43,plain,
! [X1,X2] :
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(44,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X3) ),
inference(variable_rename,[status(thm)],[43]) ).
cnf(45,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[44]) ).
fof(49,plain,
! [X1,X2] :
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(50,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X4) ),
inference(variable_rename,[status(thm)],[49]) ).
cnf(51,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[50]) ).
fof(65,negated_conjecture,
? [X1,X2,X4,X5] :
( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5) )
& ~ distinct_points(X1,intersection_point(X4,X5)) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(66,negated_conjecture,
? [X6,X7,X8,X9] :
( distinct_points(X6,X7)
& convergent_lines(X8,X9)
& ( apart_point_and_line(X6,X8)
| apart_point_and_line(X6,X9) )
& ~ distinct_points(X6,intersection_point(X8,X9)) ),
inference(variable_rename,[status(thm)],[65]) ).
fof(67,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk4_0)
& ( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(esk1_0,esk4_0) )
& ~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)) ),
inference(skolemize,[status(esa)],[66]) ).
cnf(68,negated_conjecture,
~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(69,negated_conjecture,
( apart_point_and_line(esk1_0,esk4_0)
| apart_point_and_line(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(70,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(73,negated_conjecture,
( apart_point_and_line(X1,esk4_0)
| distinct_points(esk1_0,X1)
| apart_point_and_line(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[42,69,theory(equality)]) ).
cnf(92,negated_conjecture,
( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0) ),
inference(spm,[status(thm)],[68,73,theory(equality)]) ).
cnf(94,negated_conjecture,
( apart_point_and_line(esk1_0,esk3_0)
| ~ convergent_lines(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[51,92,theory(equality)]) ).
cnf(97,negated_conjecture,
( apart_point_and_line(esk1_0,esk3_0)
| $false ),
inference(rw,[status(thm)],[94,70,theory(equality)]) ).
cnf(98,negated_conjecture,
apart_point_and_line(esk1_0,esk3_0),
inference(cn,[status(thm)],[97,theory(equality)]) ).
cnf(103,negated_conjecture,
( apart_point_and_line(X1,esk3_0)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[42,98,theory(equality)]) ).
cnf(110,negated_conjecture,
apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0),
inference(spm,[status(thm)],[68,103,theory(equality)]) ).
cnf(113,negated_conjecture,
~ convergent_lines(esk3_0,esk4_0),
inference(spm,[status(thm)],[45,110,theory(equality)]) ).
cnf(116,negated_conjecture,
$false,
inference(rw,[status(thm)],[113,70,theory(equality)]) ).
cnf(117,negated_conjecture,
$false,
inference(cn,[status(thm)],[116,theory(equality)]) ).
cnf(118,negated_conjecture,
$false,
117,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO176+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]
% -running prover on /tmp/tmpl4ZaQV/sel_GEO176+3.p_1 with time limit 29
% -prover status Theorem
% Problem GEO176+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO176+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO176+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
%
%------------------------------------------------------------------------------