TSTP Solution File: GEO171+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO171+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:43:16 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 15 ~; 16 |; 3 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 38 ( 0 sgn 25 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/tmp/tmpRobRUs/sel_GEO171+3.p_1',ax6) ).
fof(3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/tmp/tmpRobRUs/sel_GEO171+3.p_1',ceq3) ).
fof(7,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/tmp/tmpRobRUs/sel_GEO171+3.p_1',apart3) ).
fof(9,conjecture,
! [X1,X2] :
( convergent_lines(X1,X2)
=> distinct_lines(X1,X2) ),
file('/tmp/tmpRobRUs/sel_GEO171+3.p_1',con) ).
fof(10,negated_conjecture,
~ ! [X1,X2] :
( convergent_lines(X1,X2)
=> distinct_lines(X1,X2) ),
inference(assume_negation,[status(cth)],[9]) ).
fof(12,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(16,plain,
! [X1,X2,X3] :
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| convergent_lines(X2,X3) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(17,plain,
! [X4,X5,X6] :
( ~ convergent_lines(X4,X5)
| convergent_lines(X4,X6)
| convergent_lines(X5,X6) ),
inference(variable_rename,[status(thm)],[16]) ).
cnf(18,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[17]) ).
fof(19,plain,
! [X1,X2,X3] :
( ~ convergent_lines(X1,X2)
| distinct_lines(X2,X3)
| convergent_lines(X1,X3) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(20,plain,
! [X4,X5,X6] :
( ~ convergent_lines(X4,X5)
| distinct_lines(X5,X6)
| convergent_lines(X4,X6) ),
inference(variable_rename,[status(thm)],[19]) ).
cnf(21,plain,
( convergent_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[20]) ).
fof(30,plain,
! [X2] : ~ convergent_lines(X2,X2),
inference(variable_rename,[status(thm)],[12]) ).
cnf(31,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[30]) ).
fof(35,negated_conjecture,
? [X1,X2] :
( convergent_lines(X1,X2)
& ~ distinct_lines(X1,X2) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(36,negated_conjecture,
? [X3,X4] :
( convergent_lines(X3,X4)
& ~ distinct_lines(X3,X4) ),
inference(variable_rename,[status(thm)],[35]) ).
fof(37,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& ~ distinct_lines(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[36]) ).
cnf(38,negated_conjecture,
~ distinct_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(39,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(41,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[18,39,theory(equality)]) ).
cnf(48,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[31,41,theory(equality)]) ).
cnf(51,negated_conjecture,
( convergent_lines(esk2_0,X1)
| distinct_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[21,48,theory(equality)]) ).
cnf(53,negated_conjecture,
convergent_lines(esk2_0,esk2_0),
inference(spm,[status(thm)],[38,51,theory(equality)]) ).
cnf(57,negated_conjecture,
$false,
inference(sr,[status(thm)],[53,31,theory(equality)]) ).
cnf(58,negated_conjecture,
$false,
57,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO171+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/tmpRobRUs/sel_GEO171+3.p_1 with time limit 29
% -prover status Theorem
% Problem GEO171+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO171+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO171+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
%
%------------------------------------------------------------------------------