TSTP Solution File: GEO185+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO185+2 : 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:47:43 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 84 ( 37 ~; 21 |; 21 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 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 : 38 ( 0 sgn 24 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( ( apart_point_and_line(X3,X1)
| apart_point_and_line(X3,X2) )
=> distinct_points(X3,intersection_point(X1,X2)) ) ),
file('/tmp/tmphksAgu/sel_GEO185+2.p_1',con2) ).
fof(12,conjecture,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& ~ distinct_points(X1,intersection_point(X4,X5)) )
=> ( ~ apart_point_and_line(X1,X4)
& ~ apart_point_and_line(X1,X5) ) ),
file('/tmp/tmphksAgu/sel_GEO185+2.p_1',con) ).
fof(13,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& ~ distinct_points(X1,intersection_point(X4,X5)) )
=> ( ~ apart_point_and_line(X1,X4)
& ~ apart_point_and_line(X1,X5) ) ),
inference(assume_negation,[status(cth)],[12]) ).
fof(17,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& ~ distinct_points(X1,intersection_point(X4,X5)) )
=> ( ~ apart_point_and_line(X1,X4)
& ~ apart_point_and_line(X1,X5) ) ),
inference(fof_simplification,[status(thm)],[13,theory(equality)]) ).
fof(18,plain,
! [X1,X2,X3] :
( ~ convergent_lines(X1,X2)
| ( ~ apart_point_and_line(X3,X1)
& ~ apart_point_and_line(X3,X2) )
| distinct_points(X3,intersection_point(X1,X2)) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(19,plain,
! [X4,X5,X6] :
( ~ convergent_lines(X4,X5)
| ( ~ apart_point_and_line(X6,X4)
& ~ apart_point_and_line(X6,X5) )
| distinct_points(X6,intersection_point(X4,X5)) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(20,plain,
! [X4,X5,X6] :
( ( ~ apart_point_and_line(X6,X4)
| distinct_points(X6,intersection_point(X4,X5))
| ~ convergent_lines(X4,X5) )
& ( ~ apart_point_and_line(X6,X5)
| distinct_points(X6,intersection_point(X4,X5))
| ~ convergent_lines(X4,X5) ) ),
inference(distribute,[status(thm)],[19]) ).
cnf(21,plain,
( distinct_points(X3,intersection_point(X1,X2))
| ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(X3,X2) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(22,plain,
( distinct_points(X3,intersection_point(X1,X2))
| ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(X3,X1) ),
inference(split_conjunct,[status(thm)],[20]) ).
fof(50,negated_conjecture,
? [X1,X2,X4,X5] :
( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& ~ distinct_points(X1,intersection_point(X4,X5))
& ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5) ) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(51,negated_conjecture,
? [X6,X7,X8,X9] :
( distinct_points(X6,X7)
& convergent_lines(X8,X9)
& ~ distinct_points(X6,intersection_point(X8,X9))
& ( apart_point_and_line(X6,X8)
| apart_point_and_line(X6,X9) ) ),
inference(variable_rename,[status(thm)],[50]) ).
fof(52,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk4_0)
& ~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))
& ( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(esk1_0,esk4_0) ) ),
inference(skolemize,[status(esa)],[51]) ).
cnf(53,negated_conjecture,
( apart_point_and_line(esk1_0,esk4_0)
| apart_point_and_line(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(54,negated_conjecture,
~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(55,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(63,negated_conjecture,
( ~ apart_point_and_line(esk1_0,esk4_0)
| ~ convergent_lines(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[54,21,theory(equality)]) ).
cnf(65,negated_conjecture,
( ~ apart_point_and_line(esk1_0,esk4_0)
| $false ),
inference(rw,[status(thm)],[63,55,theory(equality)]) ).
cnf(66,negated_conjecture,
~ apart_point_and_line(esk1_0,esk4_0),
inference(cn,[status(thm)],[65,theory(equality)]) ).
cnf(68,negated_conjecture,
( ~ apart_point_and_line(esk1_0,esk3_0)
| ~ convergent_lines(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[54,22,theory(equality)]) ).
cnf(70,negated_conjecture,
( ~ apart_point_and_line(esk1_0,esk3_0)
| $false ),
inference(rw,[status(thm)],[68,55,theory(equality)]) ).
cnf(71,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
inference(cn,[status(thm)],[70,theory(equality)]) ).
cnf(77,negated_conjecture,
apart_point_and_line(esk1_0,esk3_0),
inference(sr,[status(thm)],[53,66,theory(equality)]) ).
cnf(78,negated_conjecture,
$false,
inference(sr,[status(thm)],[77,71,theory(equality)]) ).
cnf(79,negated_conjecture,
$false,
78,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO185+2.p
% --creating new selector for [GEO008+0.ax]
% -running prover on /tmp/tmphksAgu/sel_GEO185+2.p_1 with time limit 29
% -prover status Theorem
% Problem GEO185+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO185+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO185+2.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
%
%------------------------------------------------------------------------------