TSTP Solution File: GEO226+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO226+3 : TPTP v5.0.0. Released v4.0.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 09:03:14 EST 2010
% Result : Theorem 184.56s
% Output : CNFRefutation 184.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 10 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 105 ( 43 ~; 27 |; 24 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 65 ( 0 sgn 44 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
! [X4,X5,X6] :
( convergent_lines(X4,X5)
=> ( convergent_lines(X4,X6)
| convergent_lines(X5,X6) ) ),
file('/tmp/tmpRDUaG3/sel_GEO226+3.p_4',ax6) ).
fof(11,axiom,
! [X4,X5] :
( convergent_lines(X4,X5)
=> ~ apart_point_and_line(intersection_point(X4,X5),X4) ),
file('/tmp/tmpRDUaG3/sel_GEO226+3.p_4',ci3) ).
fof(14,axiom,
! [X4,X5] :
( convergent_lines(X4,X5)
=> ~ apart_point_and_line(intersection_point(X4,X5),X5) ),
file('/tmp/tmpRDUaG3/sel_GEO226+3.p_4',ci4) ).
fof(17,axiom,
! [X4] : ~ convergent_lines(X4,X4),
file('/tmp/tmpRDUaG3/sel_GEO226+3.p_4',apart3) ).
fof(22,axiom,
! [X4,X5] :
( incident_point_and_line(X4,X5)
<=> ~ apart_point_and_line(X4,X5) ),
file('/tmp/tmpRDUaG3/sel_GEO226+3.p_4',a4) ).
fof(32,conjecture,
! [X1,X2] :
( ( line(X1)
& line(X2)
& convergent_lines(X1,X2) )
=> ? [X4] :
( point(X4)
=> ( incident_point_and_line(X4,X1)
& incident_point_and_line(X4,X2) ) ) ),
file('/tmp/tmpRDUaG3/sel_GEO226+3.p_4',con) ).
fof(33,negated_conjecture,
~ ! [X1,X2] :
( ( line(X1)
& line(X2)
& convergent_lines(X1,X2) )
=> ? [X4] :
( point(X4)
=> ( incident_point_and_line(X4,X1)
& incident_point_and_line(X4,X2) ) ) ),
inference(assume_negation,[status(cth)],[32]) ).
fof(37,plain,
! [X4,X5] :
( convergent_lines(X4,X5)
=> ~ apart_point_and_line(intersection_point(X4,X5),X4) ),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(40,plain,
! [X4,X5] :
( convergent_lines(X4,X5)
=> ~ apart_point_and_line(intersection_point(X4,X5),X5) ),
inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).
fof(43,plain,
! [X4] : ~ convergent_lines(X4,X4),
inference(fof_simplification,[status(thm)],[17,theory(equality)]) ).
fof(44,plain,
! [X4,X5] :
( incident_point_and_line(X4,X5)
<=> ~ apart_point_and_line(X4,X5) ),
inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).
fof(79,plain,
! [X4,X5,X6] :
( ~ convergent_lines(X4,X5)
| convergent_lines(X4,X6)
| convergent_lines(X5,X6) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(80,plain,
! [X7,X8,X9] :
( ~ convergent_lines(X7,X8)
| convergent_lines(X7,X9)
| convergent_lines(X8,X9) ),
inference(variable_rename,[status(thm)],[79]) ).
cnf(81,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[80]) ).
fof(85,plain,
! [X4,X5] :
( ~ convergent_lines(X4,X5)
| ~ apart_point_and_line(intersection_point(X4,X5),X4) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(86,plain,
! [X6,X7] :
( ~ convergent_lines(X6,X7)
| ~ apart_point_and_line(intersection_point(X6,X7),X6) ),
inference(variable_rename,[status(thm)],[85]) ).
cnf(87,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[86]) ).
fof(94,plain,
! [X4,X5] :
( ~ convergent_lines(X4,X5)
| ~ apart_point_and_line(intersection_point(X4,X5),X5) ),
inference(fof_nnf,[status(thm)],[40]) ).
fof(95,plain,
! [X6,X7] :
( ~ convergent_lines(X6,X7)
| ~ apart_point_and_line(intersection_point(X6,X7),X7) ),
inference(variable_rename,[status(thm)],[94]) ).
cnf(96,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[95]) ).
fof(101,plain,
! [X5] : ~ convergent_lines(X5,X5),
inference(variable_rename,[status(thm)],[43]) ).
cnf(102,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[101]) ).
fof(115,plain,
! [X4,X5] :
( ( ~ incident_point_and_line(X4,X5)
| ~ apart_point_and_line(X4,X5) )
& ( apart_point_and_line(X4,X5)
| incident_point_and_line(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[44]) ).
fof(116,plain,
! [X6,X7] :
( ( ~ incident_point_and_line(X6,X7)
| ~ apart_point_and_line(X6,X7) )
& ( apart_point_and_line(X6,X7)
| incident_point_and_line(X6,X7) ) ),
inference(variable_rename,[status(thm)],[115]) ).
cnf(117,plain,
( incident_point_and_line(X1,X2)
| apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[116]) ).
fof(143,negated_conjecture,
? [X1,X2] :
( line(X1)
& line(X2)
& convergent_lines(X1,X2)
& ! [X4] :
( point(X4)
& ( ~ incident_point_and_line(X4,X1)
| ~ incident_point_and_line(X4,X2) ) ) ),
inference(fof_nnf,[status(thm)],[33]) ).
fof(144,negated_conjecture,
? [X5,X6] :
( line(X5)
& line(X6)
& convergent_lines(X5,X6)
& ! [X7] :
( point(X7)
& ( ~ incident_point_and_line(X7,X5)
| ~ incident_point_and_line(X7,X6) ) ) ),
inference(variable_rename,[status(thm)],[143]) ).
fof(145,negated_conjecture,
( line(esk1_0)
& line(esk2_0)
& convergent_lines(esk1_0,esk2_0)
& ! [X7] :
( point(X7)
& ( ~ incident_point_and_line(X7,esk1_0)
| ~ incident_point_and_line(X7,esk2_0) ) ) ),
inference(skolemize,[status(esa)],[144]) ).
fof(146,negated_conjecture,
! [X7] :
( point(X7)
& ( ~ incident_point_and_line(X7,esk1_0)
| ~ incident_point_and_line(X7,esk2_0) )
& line(esk1_0)
& line(esk2_0)
& convergent_lines(esk1_0,esk2_0) ),
inference(shift_quantors,[status(thm)],[145]) ).
cnf(147,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[146]) ).
cnf(150,negated_conjecture,
( ~ incident_point_and_line(X1,esk2_0)
| ~ incident_point_and_line(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[146]) ).
cnf(156,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| ~ incident_point_and_line(X1,esk2_0) ),
inference(spm,[status(thm)],[150,117,theory(equality)]) ).
cnf(157,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[81,147,theory(equality)]) ).
cnf(172,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[102,157,theory(equality)]) ).
cnf(182,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X1,esk2_0) ),
inference(spm,[status(thm)],[156,117,theory(equality)]) ).
cnf(364,negated_conjecture,
( apart_point_and_line(intersection_point(X1,esk1_0),esk2_0)
| ~ convergent_lines(X1,esk1_0) ),
inference(spm,[status(thm)],[96,182,theory(equality)]) ).
cnf(1568,negated_conjecture,
~ convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[87,364,theory(equality)]) ).
cnf(1571,negated_conjecture,
$false,
inference(rw,[status(thm)],[1568,172,theory(equality)]) ).
cnf(1572,negated_conjecture,
$false,
inference(cn,[status(thm)],[1571,theory(equality)]) ).
cnf(1573,negated_conjecture,
$false,
1572,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO226+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/tmpRDUaG3/sel_GEO226+3.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpRDUaG3/sel_GEO226+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/tmpRDUaG3/sel_GEO226+3.p_3 with time limit 74
% -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/tmpRDUaG3/sel_GEO226+3.p_4 with time limit 55
% -prover status Theorem
% Problem GEO226+3.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO226+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO226+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
%
%------------------------------------------------------------------------------