TSTP Solution File: GEO085+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO085+1 : TPTP v5.0.0. Released v2.4.0.
% 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:04:25 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 6 unt; 0 def)
% Number of atoms : 85 ( 18 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 98 ( 44 ~; 33 |; 17 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 54 ( 1 sgn 29 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X2] :
( open(X2)
<=> ? [X1] : end_point(X1,X2) ),
file('/tmp/tmp1hF2Ey/sel_GEO085+1.p_1',open_defn) ).
fof(7,axiom,
! [X2,X1] :
( end_point(X1,X2)
=> ? [X6] :
( end_point(X6,X2)
& X1 != X6 ) ),
file('/tmp/tmp1hF2Ey/sel_GEO085+1.p_1',c6) ).
fof(9,conjecture,
! [X2] :
( open(X2)
=> ? [X1,X6] :
( X1 != X6
& end_point(X1,X2)
& end_point(X6,X2) ) ),
file('/tmp/tmp1hF2Ey/sel_GEO085+1.p_1',theorem_2_7_1) ).
fof(10,negated_conjecture,
~ ! [X2] :
( open(X2)
=> ? [X1,X6] :
( X1 != X6
& end_point(X1,X2)
& end_point(X6,X2) ) ),
inference(assume_negation,[status(cth)],[9]) ).
fof(45,plain,
! [X2] :
( ( ~ open(X2)
| ? [X1] : end_point(X1,X2) )
& ( ! [X1] : ~ end_point(X1,X2)
| open(X2) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(46,plain,
! [X3] :
( ( ~ open(X3)
| ? [X4] : end_point(X4,X3) )
& ( ! [X5] : ~ end_point(X5,X3)
| open(X3) ) ),
inference(variable_rename,[status(thm)],[45]) ).
fof(47,plain,
! [X3] :
( ( ~ open(X3)
| end_point(esk5_1(X3),X3) )
& ( ! [X5] : ~ end_point(X5,X3)
| open(X3) ) ),
inference(skolemize,[status(esa)],[46]) ).
fof(48,plain,
! [X3,X5] :
( ( ~ end_point(X5,X3)
| open(X3) )
& ( ~ open(X3)
| end_point(esk5_1(X3),X3) ) ),
inference(shift_quantors,[status(thm)],[47]) ).
cnf(49,plain,
( end_point(esk5_1(X1),X1)
| ~ open(X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(51,plain,
! [X2,X1] :
( ~ end_point(X1,X2)
| ? [X6] :
( end_point(X6,X2)
& X1 != X6 ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(52,plain,
! [X7,X8] :
( ~ end_point(X8,X7)
| ? [X9] :
( end_point(X9,X7)
& X8 != X9 ) ),
inference(variable_rename,[status(thm)],[51]) ).
fof(53,plain,
! [X7,X8] :
( ~ end_point(X8,X7)
| ( end_point(esk6_2(X7,X8),X7)
& X8 != esk6_2(X7,X8) ) ),
inference(skolemize,[status(esa)],[52]) ).
fof(54,plain,
! [X7,X8] :
( ( end_point(esk6_2(X7,X8),X7)
| ~ end_point(X8,X7) )
& ( X8 != esk6_2(X7,X8)
| ~ end_point(X8,X7) ) ),
inference(distribute,[status(thm)],[53]) ).
cnf(55,plain,
( ~ end_point(X1,X2)
| X1 != esk6_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[54]) ).
cnf(56,plain,
( end_point(esk6_2(X2,X1),X2)
| ~ end_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[54]) ).
fof(60,negated_conjecture,
? [X2] :
( open(X2)
& ! [X1,X6] :
( X1 = X6
| ~ end_point(X1,X2)
| ~ end_point(X6,X2) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(61,negated_conjecture,
? [X7] :
( open(X7)
& ! [X8,X9] :
( X8 = X9
| ~ end_point(X8,X7)
| ~ end_point(X9,X7) ) ),
inference(variable_rename,[status(thm)],[60]) ).
fof(62,negated_conjecture,
( open(esk7_0)
& ! [X8,X9] :
( X8 = X9
| ~ end_point(X8,esk7_0)
| ~ end_point(X9,esk7_0) ) ),
inference(skolemize,[status(esa)],[61]) ).
fof(63,negated_conjecture,
! [X8,X9] :
( ( X8 = X9
| ~ end_point(X8,esk7_0)
| ~ end_point(X9,esk7_0) )
& open(esk7_0) ),
inference(shift_quantors,[status(thm)],[62]) ).
cnf(64,negated_conjecture,
open(esk7_0),
inference(split_conjunct,[status(thm)],[63]) ).
cnf(65,negated_conjecture,
( X2 = X1
| ~ end_point(X1,esk7_0)
| ~ end_point(X2,esk7_0) ),
inference(split_conjunct,[status(thm)],[63]) ).
cnf(71,negated_conjecture,
( X1 = esk5_1(esk7_0)
| ~ end_point(X1,esk7_0)
| ~ open(esk7_0) ),
inference(spm,[status(thm)],[65,49,theory(equality)]) ).
cnf(72,negated_conjecture,
( X1 = esk5_1(esk7_0)
| ~ end_point(X1,esk7_0)
| $false ),
inference(rw,[status(thm)],[71,64,theory(equality)]) ).
cnf(73,negated_conjecture,
( X1 = esk5_1(esk7_0)
| ~ end_point(X1,esk7_0) ),
inference(cn,[status(thm)],[72,theory(equality)]) ).
cnf(93,negated_conjecture,
( esk6_2(esk7_0,X1) = esk5_1(esk7_0)
| ~ end_point(X1,esk7_0) ),
inference(spm,[status(thm)],[73,56,theory(equality)]) ).
cnf(94,negated_conjecture,
( esk5_1(esk7_0) != X1
| ~ end_point(X1,esk7_0) ),
inference(spm,[status(thm)],[55,93,theory(equality)]) ).
cnf(96,negated_conjecture,
~ end_point(X1,esk7_0),
inference(csr,[status(thm)],[94,73]) ).
cnf(97,negated_conjecture,
~ open(esk7_0),
inference(spm,[status(thm)],[96,49,theory(equality)]) ).
cnf(99,negated_conjecture,
$false,
inference(rw,[status(thm)],[97,64,theory(equality)]) ).
cnf(100,negated_conjecture,
$false,
inference(cn,[status(thm)],[99,theory(equality)]) ).
cnf(101,negated_conjecture,
$false,
100,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO085+1.p
% --creating new selector for [GEO004+0.ax]
% -running prover on /tmp/tmp1hF2Ey/sel_GEO085+1.p_1 with time limit 29
% -prover status Theorem
% Problem GEO085+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO085+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO085+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
%
%------------------------------------------------------------------------------