TSTP Solution File: GEO206+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO206+3 : TPTP v5.0.0. Bugfixed v4.0.1.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:55:42 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 12 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 71 ( 30 ~; 21 |; 12 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 61 ( 1 sgn 43 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
file('/tmp/tmpOyjmqC/sel_GEO206+3.p_1',ax2) ).
fof(2,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/tmp/tmpOyjmqC/sel_GEO206+3.p_1',p1) ).
fof(3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/tmp/tmpOyjmqC/sel_GEO206+3.p_1',ax6) ).
fof(7,axiom,
! [X1,X2] :
( parallel_lines(X1,X2)
<=> ~ convergent_lines(X1,X2) ),
file('/tmp/tmpOyjmqC/sel_GEO206+3.p_1',a3) ).
fof(11,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/tmp/tmpOyjmqC/sel_GEO206+3.p_1',cp1) ).
fof(15,conjecture,
! [X1,X2,X3] :
( ( incident_point_and_line(X1,X2)
& parallel_lines(X2,X3) )
=> equal_lines(X2,parallel_through_point(X3,X1)) ),
file('/tmp/tmpOyjmqC/sel_GEO206+3.p_1',con) ).
fof(16,negated_conjecture,
~ ! [X1,X2,X3] :
( ( incident_point_and_line(X1,X2)
& parallel_lines(X2,X3) )
=> equal_lines(X2,parallel_through_point(X3,X1)) ),
inference(assume_negation,[status(cth)],[15]) ).
fof(17,plain,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(18,plain,
! [X1,X2] :
( parallel_lines(X1,X2)
<=> ~ convergent_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(20,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(24,plain,
! [X1,X2] :
( ( ~ equal_lines(X1,X2)
| ~ distinct_lines(X1,X2) )
& ( distinct_lines(X1,X2)
| equal_lines(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(25,plain,
! [X3,X4] :
( ( ~ equal_lines(X3,X4)
| ~ distinct_lines(X3,X4) )
& ( distinct_lines(X3,X4)
| equal_lines(X3,X4) ) ),
inference(variable_rename,[status(thm)],[24]) ).
cnf(26,plain,
( equal_lines(X1,X2)
| distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[25]) ).
fof(28,plain,
! [X1,X2] :
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(29,plain,
! [X3,X4] :
( ~ distinct_lines(X3,X4)
| convergent_lines(X3,X4) ),
inference(variable_rename,[status(thm)],[28]) ).
cnf(30,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[29]) ).
fof(31,plain,
! [X1,X2,X3] :
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| convergent_lines(X2,X3) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(32,plain,
! [X4,X5,X6] :
( ~ convergent_lines(X4,X5)
| convergent_lines(X4,X6)
| convergent_lines(X5,X6) ),
inference(variable_rename,[status(thm)],[31]) ).
cnf(33,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[32]) ).
fof(43,plain,
! [X1,X2] :
( ( ~ parallel_lines(X1,X2)
| ~ convergent_lines(X1,X2) )
& ( convergent_lines(X1,X2)
| parallel_lines(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(44,plain,
! [X3,X4] :
( ( ~ parallel_lines(X3,X4)
| ~ convergent_lines(X3,X4) )
& ( convergent_lines(X3,X4)
| parallel_lines(X3,X4) ) ),
inference(variable_rename,[status(thm)],[43]) ).
cnf(46,plain,
( ~ convergent_lines(X1,X2)
| ~ parallel_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[44]) ).
fof(57,plain,
! [X3,X4] : ~ convergent_lines(parallel_through_point(X4,X3),X4),
inference(variable_rename,[status(thm)],[20]) ).
cnf(58,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[57]) ).
fof(65,negated_conjecture,
? [X1,X2,X3] :
( incident_point_and_line(X1,X2)
& parallel_lines(X2,X3)
& ~ equal_lines(X2,parallel_through_point(X3,X1)) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(66,negated_conjecture,
? [X4,X5,X6] :
( incident_point_and_line(X4,X5)
& parallel_lines(X5,X6)
& ~ equal_lines(X5,parallel_through_point(X6,X4)) ),
inference(variable_rename,[status(thm)],[65]) ).
fof(67,negated_conjecture,
( incident_point_and_line(esk1_0,esk2_0)
& parallel_lines(esk2_0,esk3_0)
& ~ equal_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)) ),
inference(skolemize,[status(esa)],[66]) ).
cnf(68,negated_conjecture,
~ equal_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(69,negated_conjecture,
parallel_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(71,negated_conjecture,
distinct_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
inference(spm,[status(thm)],[68,26,theory(equality)]) ).
cnf(73,negated_conjecture,
~ convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[46,69,theory(equality)]) ).
cnf(79,negated_conjecture,
convergent_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
inference(spm,[status(thm)],[30,71,theory(equality)]) ).
cnf(82,negated_conjecture,
( convergent_lines(parallel_through_point(esk3_0,esk1_0),X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[33,79,theory(equality)]) ).
cnf(92,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[58,82,theory(equality)]) ).
cnf(96,negated_conjecture,
$false,
inference(sr,[status(thm)],[92,73,theory(equality)]) ).
cnf(97,negated_conjecture,
$false,
96,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO206+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]
% -running prover on /tmp/tmpOyjmqC/sel_GEO206+3.p_1 with time limit 29
% -prover status Theorem
% Problem GEO206+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO206+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO206+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
%
%------------------------------------------------------------------------------