TSTP Solution File: GEO112+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO112+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:15:41 EST 2010
% Result : Theorem 4.77s
% Output : CNFRefutation 4.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 123 ( 19 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 155 ( 61 ~; 59 |; 32 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 98 ( 4 sgn 37 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X2,X1,X5,X6] :
( between_c(X2,X1,X5,X6)
<=> ( X1 != X6
& ? [X7] :
( part_of(X7,X2)
& end_point(X1,X7)
& end_point(X6,X7)
& inner_point(X5,X7) ) ) ),
file('/tmp/tmpvRFBsz/sel_GEO112+1.p_1',between_c_defn) ).
fof(14,conjecture,
! [X2,X1,X5,X6] :
( between_c(X2,X1,X5,X6)
=> between_c(X2,X6,X5,X1) ),
file('/tmp/tmpvRFBsz/sel_GEO112+1.p_1',theorem_3_8_2) ).
fof(15,negated_conjecture,
~ ! [X2,X1,X5,X6] :
( between_c(X2,X1,X5,X6)
=> between_c(X2,X6,X5,X1) ),
inference(assume_negation,[status(cth)],[14]) ).
fof(44,plain,
! [X2,X1,X5,X6] :
( ( ~ between_c(X2,X1,X5,X6)
| ( X1 != X6
& ? [X7] :
( part_of(X7,X2)
& end_point(X1,X7)
& end_point(X6,X7)
& inner_point(X5,X7) ) ) )
& ( X1 = X6
| ! [X7] :
( ~ part_of(X7,X2)
| ~ end_point(X1,X7)
| ~ end_point(X6,X7)
| ~ inner_point(X5,X7) )
| between_c(X2,X1,X5,X6) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(45,plain,
! [X8,X9,X10,X11] :
( ( ~ between_c(X8,X9,X10,X11)
| ( X9 != X11
& ? [X12] :
( part_of(X12,X8)
& end_point(X9,X12)
& end_point(X11,X12)
& inner_point(X10,X12) ) ) )
& ( X9 = X11
| ! [X13] :
( ~ part_of(X13,X8)
| ~ end_point(X9,X13)
| ~ end_point(X11,X13)
| ~ inner_point(X10,X13) )
| between_c(X8,X9,X10,X11) ) ),
inference(variable_rename,[status(thm)],[44]) ).
fof(46,plain,
! [X8,X9,X10,X11] :
( ( ~ between_c(X8,X9,X10,X11)
| ( X9 != X11
& part_of(esk4_4(X8,X9,X10,X11),X8)
& end_point(X9,esk4_4(X8,X9,X10,X11))
& end_point(X11,esk4_4(X8,X9,X10,X11))
& inner_point(X10,esk4_4(X8,X9,X10,X11)) ) )
& ( X9 = X11
| ! [X13] :
( ~ part_of(X13,X8)
| ~ end_point(X9,X13)
| ~ end_point(X11,X13)
| ~ inner_point(X10,X13) )
| between_c(X8,X9,X10,X11) ) ),
inference(skolemize,[status(esa)],[45]) ).
fof(47,plain,
! [X8,X9,X10,X11,X13] :
( ( ~ part_of(X13,X8)
| ~ end_point(X9,X13)
| ~ end_point(X11,X13)
| ~ inner_point(X10,X13)
| X9 = X11
| between_c(X8,X9,X10,X11) )
& ( ~ between_c(X8,X9,X10,X11)
| ( X9 != X11
& part_of(esk4_4(X8,X9,X10,X11),X8)
& end_point(X9,esk4_4(X8,X9,X10,X11))
& end_point(X11,esk4_4(X8,X9,X10,X11))
& inner_point(X10,esk4_4(X8,X9,X10,X11)) ) ) ),
inference(shift_quantors,[status(thm)],[46]) ).
fof(48,plain,
! [X8,X9,X10,X11,X13] :
( ( ~ part_of(X13,X8)
| ~ end_point(X9,X13)
| ~ end_point(X11,X13)
| ~ inner_point(X10,X13)
| X9 = X11
| between_c(X8,X9,X10,X11) )
& ( X9 != X11
| ~ between_c(X8,X9,X10,X11) )
& ( part_of(esk4_4(X8,X9,X10,X11),X8)
| ~ between_c(X8,X9,X10,X11) )
& ( end_point(X9,esk4_4(X8,X9,X10,X11))
| ~ between_c(X8,X9,X10,X11) )
& ( end_point(X11,esk4_4(X8,X9,X10,X11))
| ~ between_c(X8,X9,X10,X11) )
& ( inner_point(X10,esk4_4(X8,X9,X10,X11))
| ~ between_c(X8,X9,X10,X11) ) ),
inference(distribute,[status(thm)],[47]) ).
cnf(49,plain,
( inner_point(X3,esk4_4(X1,X2,X3,X4))
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(50,plain,
( end_point(X4,esk4_4(X1,X2,X3,X4))
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(51,plain,
( end_point(X2,esk4_4(X1,X2,X3,X4))
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(52,plain,
( part_of(esk4_4(X1,X2,X3,X4),X1)
| ~ between_c(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(53,plain,
( ~ between_c(X1,X2,X3,X4)
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(54,plain,
( between_c(X1,X2,X3,X4)
| X2 = X4
| ~ inner_point(X3,X5)
| ~ end_point(X4,X5)
| ~ end_point(X2,X5)
| ~ part_of(X5,X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(111,negated_conjecture,
? [X2,X1,X5,X6] :
( between_c(X2,X1,X5,X6)
& ~ between_c(X2,X6,X5,X1) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(112,negated_conjecture,
? [X7,X8,X9,X10] :
( between_c(X7,X8,X9,X10)
& ~ between_c(X7,X10,X9,X8) ),
inference(variable_rename,[status(thm)],[111]) ).
fof(113,negated_conjecture,
( between_c(esk13_0,esk14_0,esk15_0,esk16_0)
& ~ between_c(esk13_0,esk16_0,esk15_0,esk14_0) ),
inference(skolemize,[status(esa)],[112]) ).
cnf(114,negated_conjecture,
~ between_c(esk13_0,esk16_0,esk15_0,esk14_0),
inference(split_conjunct,[status(thm)],[113]) ).
cnf(115,negated_conjecture,
between_c(esk13_0,esk14_0,esk15_0,esk16_0),
inference(split_conjunct,[status(thm)],[113]) ).
cnf(116,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[53,theory(equality)]) ).
cnf(152,plain,
( X1 = X2
| between_c(X3,X1,X4,X2)
| ~ part_of(esk4_4(X5,X6,X4,X7),X3)
| ~ end_point(X2,esk4_4(X5,X6,X4,X7))
| ~ end_point(X1,esk4_4(X5,X6,X4,X7))
| ~ between_c(X5,X6,X4,X7) ),
inference(spm,[status(thm)],[54,49,theory(equality)]) ).
cnf(537,plain,
( X1 = X2
| between_c(X3,X1,X4,X2)
| ~ between_c(X3,X5,X4,X6)
| ~ end_point(X2,esk4_4(X3,X5,X4,X6))
| ~ end_point(X1,esk4_4(X3,X5,X4,X6)) ),
inference(spm,[status(thm)],[152,52,theory(equality)]) ).
cnf(57967,plain,
( X1 = X2
| between_c(X3,X1,X4,X2)
| ~ between_c(X3,X2,X4,X5)
| ~ end_point(X1,esk4_4(X3,X2,X4,X5)) ),
inference(spm,[status(thm)],[537,51,theory(equality)]) ).
cnf(60130,plain,
( X1 = X2
| between_c(X3,X1,X4,X2)
| ~ between_c(X3,X2,X4,X1) ),
inference(spm,[status(thm)],[57967,50,theory(equality)]) ).
cnf(60131,negated_conjecture,
( esk16_0 = esk14_0
| between_c(esk13_0,esk16_0,esk15_0,esk14_0) ),
inference(spm,[status(thm)],[60130,115,theory(equality)]) ).
cnf(60139,negated_conjecture,
esk16_0 = esk14_0,
inference(sr,[status(thm)],[60131,114,theory(equality)]) ).
cnf(60144,negated_conjecture,
between_c(esk13_0,esk14_0,esk15_0,esk14_0),
inference(rw,[status(thm)],[115,60139,theory(equality)]) ).
cnf(60145,negated_conjecture,
$false,
inference(sr,[status(thm)],[60144,116,theory(equality)]) ).
cnf(60146,negated_conjecture,
$false,
60145,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO112+1.p
% --creating new selector for [GEO004+0.ax, GEO004+1.ax]
% -running prover on /tmp/tmpvRFBsz/sel_GEO112+1.p_1 with time limit 29
% -prover status Theorem
% Problem GEO112+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO112+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO112+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
%
%------------------------------------------------------------------------------