TSTP Solution File: GEO209+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO209+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 08:56:30 EST 2010
% Result : Theorem 0.29s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 11 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 85 ( 29 ~; 21 |; 27 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 57 ( 0 sgn 39 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
file('/tmp/tmpDyb7nR/sel_GEO209+3.p_1',ax2) ).
fof(2,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/tmp/tmpDyb7nR/sel_GEO209+3.p_1',p1) ).
fof(6,axiom,
! [X1,X2] :
( parallel_lines(X1,X2)
<=> ~ convergent_lines(X1,X2) ),
file('/tmp/tmpDyb7nR/sel_GEO209+3.p_1',a3) ).
fof(11,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/tmp/tmpDyb7nR/sel_GEO209+3.p_1',apart5) ).
fof(12,conjecture,
! [X4,X5,X6,X7] :
( ( apart_point_and_line(X4,X5)
& incident_point_and_line(X4,X6)
& incident_point_and_line(X4,X7)
& parallel_lines(X6,X5)
& parallel_lines(X7,X5) )
=> equal_lines(X6,X7) ),
file('/tmp/tmpDyb7nR/sel_GEO209+3.p_1',con) ).
fof(13,negated_conjecture,
~ ! [X4,X5,X6,X7] :
( ( apart_point_and_line(X4,X5)
& incident_point_and_line(X4,X6)
& incident_point_and_line(X4,X7)
& parallel_lines(X6,X5)
& parallel_lines(X7,X5) )
=> equal_lines(X6,X7) ),
inference(assume_negation,[status(cth)],[12]) ).
fof(14,plain,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(15,plain,
! [X1,X2] :
( parallel_lines(X1,X2)
<=> ~ convergent_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(19,plain,
! [X1,X2] :
( ( ~ equal_lines(X1,X2)
| ~ distinct_lines(X1,X2) )
& ( distinct_lines(X1,X2)
| equal_lines(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(20,plain,
! [X3,X4] :
( ( ~ equal_lines(X3,X4)
| ~ distinct_lines(X3,X4) )
& ( distinct_lines(X3,X4)
| equal_lines(X3,X4) ) ),
inference(variable_rename,[status(thm)],[19]) ).
cnf(21,plain,
( equal_lines(X1,X2)
| distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[20]) ).
fof(23,plain,
! [X1,X2] :
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(24,plain,
! [X3,X4] :
( ~ distinct_lines(X3,X4)
| convergent_lines(X3,X4) ),
inference(variable_rename,[status(thm)],[23]) ).
cnf(25,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[24]) ).
fof(35,plain,
! [X1,X2] :
( ( ~ parallel_lines(X1,X2)
| ~ convergent_lines(X1,X2) )
& ( convergent_lines(X1,X2)
| parallel_lines(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(36,plain,
! [X3,X4] :
( ( ~ parallel_lines(X3,X4)
| ~ convergent_lines(X3,X4) )
& ( convergent_lines(X3,X4)
| parallel_lines(X3,X4) ) ),
inference(variable_rename,[status(thm)],[35]) ).
cnf(38,plain,
( ~ convergent_lines(X1,X2)
| ~ parallel_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(50,plain,
! [X1,X2,X3] :
( ~ distinct_lines(X1,X2)
| distinct_lines(X1,X3)
| distinct_lines(X2,X3) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(51,plain,
! [X4,X5,X6] :
( ~ distinct_lines(X4,X5)
| distinct_lines(X4,X6)
| distinct_lines(X5,X6) ),
inference(variable_rename,[status(thm)],[50]) ).
cnf(52,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[51]) ).
fof(53,negated_conjecture,
? [X4,X5,X6,X7] :
( apart_point_and_line(X4,X5)
& incident_point_and_line(X4,X6)
& incident_point_and_line(X4,X7)
& parallel_lines(X6,X5)
& parallel_lines(X7,X5)
& ~ equal_lines(X6,X7) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(54,negated_conjecture,
? [X8,X9,X10,X11] :
( apart_point_and_line(X8,X9)
& incident_point_and_line(X8,X10)
& incident_point_and_line(X8,X11)
& parallel_lines(X10,X9)
& parallel_lines(X11,X9)
& ~ equal_lines(X10,X11) ),
inference(variable_rename,[status(thm)],[53]) ).
fof(55,negated_conjecture,
( apart_point_and_line(esk1_0,esk2_0)
& incident_point_and_line(esk1_0,esk3_0)
& incident_point_and_line(esk1_0,esk4_0)
& parallel_lines(esk3_0,esk2_0)
& parallel_lines(esk4_0,esk2_0)
& ~ equal_lines(esk3_0,esk4_0) ),
inference(skolemize,[status(esa)],[54]) ).
cnf(56,negated_conjecture,
~ equal_lines(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(57,negated_conjecture,
parallel_lines(esk4_0,esk2_0),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(58,negated_conjecture,
parallel_lines(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(62,negated_conjecture,
distinct_lines(esk3_0,esk4_0),
inference(spm,[status(thm)],[56,21,theory(equality)]) ).
cnf(69,negated_conjecture,
~ convergent_lines(esk3_0,esk2_0),
inference(spm,[status(thm)],[38,58,theory(equality)]) ).
cnf(70,negated_conjecture,
~ convergent_lines(esk4_0,esk2_0),
inference(spm,[status(thm)],[38,57,theory(equality)]) ).
cnf(76,negated_conjecture,
( distinct_lines(esk4_0,X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[52,62,theory(equality)]) ).
cnf(81,negated_conjecture,
~ distinct_lines(esk3_0,esk2_0),
inference(spm,[status(thm)],[69,25,theory(equality)]) ).
cnf(83,negated_conjecture,
~ distinct_lines(esk4_0,esk2_0),
inference(spm,[status(thm)],[70,25,theory(equality)]) ).
cnf(85,negated_conjecture,
distinct_lines(esk3_0,esk2_0),
inference(spm,[status(thm)],[83,76,theory(equality)]) ).
cnf(88,negated_conjecture,
$false,
inference(sr,[status(thm)],[85,81,theory(equality)]) ).
cnf(89,negated_conjecture,
$false,
88,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO209+3.p
% --creating new selector for [GEO006+4.ax, GEO006+3.ax, GEO006+0.ax, GEO006+1.ax, GEO006+2.ax, GEO006+6.ax, GEO006+5.ax]
% -running prover on /tmp/tmpDyb7nR/sel_GEO209+3.p_1 with time limit 29
% -prover status Theorem
% Problem GEO209+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO209+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO209+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
%
%------------------------------------------------------------------------------