TSTP Solution File: GEO226+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO226+2 : TPTP v5.0.0. Released v3.3.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 09:03:02 EST 2010
% Result : Theorem 239.76s
% Output : CNFRefutation 239.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 14 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 105 ( 39 ~; 29 |; 28 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn 37 !; 7 ?)
% 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/tmpST76LA/sel_GEO226+2.p_5',con2) ).
fof(7,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/tmp/tmpST76LA/sel_GEO226+2.p_5',apart1) ).
fof(9,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/tmp/tmpST76LA/sel_GEO226+2.p_5',apart3) ).
fof(12,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/tmp/tmpST76LA/sel_GEO226+2.p_5',apart6) ).
fof(13,conjecture,
! [X6,X7] :
( ( line(X6)
& line(X7)
& convergent_lines(X6,X7) )
=> ? [X1] :
( point(X1)
=> ( ~ apart_point_and_line(X1,X6)
& ~ apart_point_and_line(X1,X7) ) ) ),
file('/tmp/tmpST76LA/sel_GEO226+2.p_5',con) ).
fof(14,negated_conjecture,
~ ! [X6,X7] :
( ( line(X6)
& line(X7)
& convergent_lines(X6,X7) )
=> ? [X1] :
( point(X1)
=> ( ~ apart_point_and_line(X1,X6)
& ~ apart_point_and_line(X1,X7) ) ) ),
inference(assume_negation,[status(cth)],[13]) ).
fof(15,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(17,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(18,negated_conjecture,
~ ! [X6,X7] :
( ( line(X6)
& line(X7)
& convergent_lines(X6,X7) )
=> ? [X1] :
( point(X1)
=> ( ~ apart_point_and_line(X1,X6)
& ~ apart_point_and_line(X1,X7) ) ) ),
inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).
fof(19,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(20,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)],[19]) ).
fof(21,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)],[20]) ).
cnf(22,plain,
( distinct_points(X3,intersection_point(X1,X2))
| ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(X3,X2) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,plain,
( distinct_points(X3,intersection_point(X1,X2))
| ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(X3,X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(39,plain,
! [X2] : ~ distinct_points(X2,X2),
inference(variable_rename,[status(thm)],[15]) ).
cnf(40,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[39]) ).
fof(43,plain,
! [X2] : ~ convergent_lines(X2,X2),
inference(variable_rename,[status(thm)],[17]) ).
cnf(44,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[43]) ).
fof(51,plain,
! [X1,X2,X3] :
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| convergent_lines(X2,X3) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(52,plain,
! [X4,X5,X6] :
( ~ convergent_lines(X4,X5)
| convergent_lines(X4,X6)
| convergent_lines(X5,X6) ),
inference(variable_rename,[status(thm)],[51]) ).
cnf(53,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[52]) ).
fof(54,negated_conjecture,
? [X6,X7] :
( line(X6)
& line(X7)
& convergent_lines(X6,X7)
& ! [X1] :
( point(X1)
& ( apart_point_and_line(X1,X6)
| apart_point_and_line(X1,X7) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(55,negated_conjecture,
? [X8,X9] :
( line(X8)
& line(X9)
& convergent_lines(X8,X9)
& ! [X10] :
( point(X10)
& ( apart_point_and_line(X10,X8)
| apart_point_and_line(X10,X9) ) ) ),
inference(variable_rename,[status(thm)],[54]) ).
fof(56,negated_conjecture,
( line(esk1_0)
& line(esk2_0)
& convergent_lines(esk1_0,esk2_0)
& ! [X10] :
( point(X10)
& ( apart_point_and_line(X10,esk1_0)
| apart_point_and_line(X10,esk2_0) ) ) ),
inference(skolemize,[status(esa)],[55]) ).
fof(57,negated_conjecture,
! [X10] :
( point(X10)
& ( apart_point_and_line(X10,esk1_0)
| apart_point_and_line(X10,esk2_0) )
& line(esk1_0)
& line(esk2_0)
& convergent_lines(esk1_0,esk2_0) ),
inference(shift_quantors,[status(thm)],[56]) ).
cnf(58,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(61,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(64,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[53,58,theory(equality)]) ).
cnf(68,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[40,22,theory(equality)]) ).
cnf(69,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[40,23,theory(equality)]) ).
cnf(74,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[44,64,theory(equality)]) ).
cnf(77,negated_conjecture,
( apart_point_and_line(intersection_point(X1,esk1_0),esk2_0)
| ~ convergent_lines(X1,esk1_0) ),
inference(spm,[status(thm)],[68,61,theory(equality)]) ).
cnf(94,negated_conjecture,
~ convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[69,77,theory(equality)]) ).
cnf(95,negated_conjecture,
$false,
inference(rw,[status(thm)],[94,74,theory(equality)]) ).
cnf(96,negated_conjecture,
$false,
inference(cn,[status(thm)],[95,theory(equality)]) ).
cnf(97,negated_conjecture,
$false,
96,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO226+2.p
% --creating new selector for [GEO008+0.ax, GEO006+5.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpST76LA/sel_GEO226+2.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpST76LA/sel_GEO226+2.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [GEO008+0.ax, GEO006+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpST76LA/sel_GEO226+2.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [GEO008+0.ax, GEO006+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpST76LA/sel_GEO226+2.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [GEO008+0.ax, GEO006+5.ax]
% -running prover on /tmp/tmpST76LA/sel_GEO226+2.p_5 with time limit 54
% -prover status Theorem
% Problem GEO226+2.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO226+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO226+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
%
%------------------------------------------------------------------------------