TSTP Solution File: GEO226+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO226+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:01:09 EST 2010
% Result : Theorem 185.53s
% Output : CNFRefutation 185.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 73 ( 26 ~; 12 |; 25 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 26 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X3,X4] :
( convergent_lines(X3,X4)
=> ~ apart_point_and_line(intersection_point(X3,X4),X3) ),
file('/tmp/tmpar3NET/sel_GEO226+1.p_4',ci3) ).
fof(11,axiom,
! [X3,X4] :
( convergent_lines(X3,X4)
=> ~ apart_point_and_line(intersection_point(X3,X4),X4) ),
file('/tmp/tmpar3NET/sel_GEO226+1.p_4',ci4) ).
fof(17,conjecture,
! [X8,X9] :
( ( line(X8)
& line(X9)
& convergent_lines(X8,X9) )
=> ? [X3] :
( point(X3)
=> ( ~ apart_point_and_line(X3,X8)
& ~ apart_point_and_line(X3,X9) ) ) ),
file('/tmp/tmpar3NET/sel_GEO226+1.p_4',con) ).
fof(18,negated_conjecture,
~ ! [X8,X9] :
( ( line(X8)
& line(X9)
& convergent_lines(X8,X9) )
=> ? [X3] :
( point(X3)
=> ( ~ apart_point_and_line(X3,X8)
& ~ apart_point_and_line(X3,X9) ) ) ),
inference(assume_negation,[status(cth)],[17]) ).
fof(19,plain,
! [X3,X4] :
( convergent_lines(X3,X4)
=> ~ apart_point_and_line(intersection_point(X3,X4),X3) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(22,plain,
! [X3,X4] :
( convergent_lines(X3,X4)
=> ~ apart_point_and_line(intersection_point(X3,X4),X4) ),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(26,negated_conjecture,
~ ! [X8,X9] :
( ( line(X8)
& line(X9)
& convergent_lines(X8,X9) )
=> ? [X3] :
( point(X3)
=> ( ~ apart_point_and_line(X3,X8)
& ~ apart_point_and_line(X3,X9) ) ) ),
inference(fof_simplification,[status(thm)],[18,theory(equality)]) ).
fof(45,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X3) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(46,plain,
! [X5,X6] :
( ~ convergent_lines(X5,X6)
| ~ apart_point_and_line(intersection_point(X5,X6),X5) ),
inference(variable_rename,[status(thm)],[45]) ).
cnf(47,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[46]) ).
fof(57,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X4) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(58,plain,
! [X5,X6] :
( ~ convergent_lines(X5,X6)
| ~ apart_point_and_line(intersection_point(X5,X6),X6) ),
inference(variable_rename,[status(thm)],[57]) ).
cnf(59,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[58]) ).
fof(72,negated_conjecture,
? [X8,X9] :
( line(X8)
& line(X9)
& convergent_lines(X8,X9)
& ! [X3] :
( point(X3)
& ( apart_point_and_line(X3,X8)
| apart_point_and_line(X3,X9) ) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(73,negated_conjecture,
? [X10,X11] :
( line(X10)
& line(X11)
& convergent_lines(X10,X11)
& ! [X12] :
( point(X12)
& ( apart_point_and_line(X12,X10)
| apart_point_and_line(X12,X11) ) ) ),
inference(variable_rename,[status(thm)],[72]) ).
fof(74,negated_conjecture,
( line(esk1_0)
& line(esk2_0)
& convergent_lines(esk1_0,esk2_0)
& ! [X12] :
( point(X12)
& ( apart_point_and_line(X12,esk1_0)
| apart_point_and_line(X12,esk2_0) ) ) ),
inference(skolemize,[status(esa)],[73]) ).
fof(75,negated_conjecture,
! [X12] :
( point(X12)
& ( apart_point_and_line(X12,esk1_0)
| apart_point_and_line(X12,esk2_0) )
& line(esk1_0)
& line(esk2_0)
& convergent_lines(esk1_0,esk2_0) ),
inference(shift_quantors,[status(thm)],[74]) ).
cnf(76,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(79,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(85,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,X1),esk2_0)
| ~ convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[47,79,theory(equality)]) ).
cnf(92,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[59,85,theory(equality)]) ).
cnf(95,negated_conjecture,
$false,
inference(rw,[status(thm)],[92,76,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+1.p
% --creating new selector for [GEO006+0.ax, GEO006+5.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpar3NET/sel_GEO226+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpar3NET/sel_GEO226+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [GEO006+0.ax, GEO006+5.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpar3NET/sel_GEO226+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [GEO006+0.ax, GEO006+5.ax]
% -running prover on /tmp/tmpar3NET/sel_GEO226+1.p_4 with time limit 55
% -prover status Theorem
% Problem GEO226+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO226+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO226+1.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
%
%------------------------------------------------------------------------------