TSTP Solution File: GEO087+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO087+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:34 EST 2010
% Result : Theorem 185.69s
% Output : CNFRefutation 185.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 187 ( 0 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 234 ( 88 ~; 83 |; 55 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 90 ( 1 sgn 59 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X2,X3] :
( part_of(X3,X2)
<=> ! [X1] :
( incident_c(X1,X3)
=> incident_c(X1,X2) ) ),
file('/tmp/tmpz1Nxtq/sel_GEO087+1.p_4',part_of_defn) ).
fof(3,axiom,
! [X1,X2] :
( inner_point(X1,X2)
<=> ( incident_c(X1,X2)
& ~ end_point(X1,X2) ) ),
file('/tmp/tmpz1Nxtq/sel_GEO087+1.p_4',inner_point_defn) ).
fof(4,axiom,
! [X2] :
? [X1] : inner_point(X1,X2),
file('/tmp/tmpz1Nxtq/sel_GEO087+1.p_4',c3) ).
fof(8,axiom,
! [X1,X2,X3] :
( meet(X1,X2,X3)
<=> ( incident_c(X1,X2)
& incident_c(X1,X3)
& ! [X5] :
( ( incident_c(X5,X2)
& incident_c(X5,X3) )
=> ( end_point(X5,X2)
& end_point(X5,X3) ) ) ) ),
file('/tmp/tmpz1Nxtq/sel_GEO087+1.p_4',meet_defn) ).
fof(13,conjecture,
! [X3,X4] :
( part_of(X3,X4)
=> ~ ? [X1] : meet(X1,X3,X4) ),
file('/tmp/tmpz1Nxtq/sel_GEO087+1.p_4',corollary_2_9) ).
fof(14,negated_conjecture,
~ ! [X3,X4] :
( part_of(X3,X4)
=> ~ ? [X1] : meet(X1,X3,X4) ),
inference(assume_negation,[status(cth)],[13]) ).
fof(15,plain,
! [X1,X2] :
( inner_point(X1,X2)
<=> ( incident_c(X1,X2)
& ~ end_point(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(29,plain,
! [X2,X3] :
( ( ~ part_of(X3,X2)
| ! [X1] :
( ~ incident_c(X1,X3)
| incident_c(X1,X2) ) )
& ( ? [X1] :
( incident_c(X1,X3)
& ~ incident_c(X1,X2) )
| part_of(X3,X2) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(30,plain,
! [X4,X5] :
( ( ~ part_of(X5,X4)
| ! [X6] :
( ~ incident_c(X6,X5)
| incident_c(X6,X4) ) )
& ( ? [X7] :
( incident_c(X7,X5)
& ~ incident_c(X7,X4) )
| part_of(X5,X4) ) ),
inference(variable_rename,[status(thm)],[29]) ).
fof(31,plain,
! [X4,X5] :
( ( ~ part_of(X5,X4)
| ! [X6] :
( ~ incident_c(X6,X5)
| incident_c(X6,X4) ) )
& ( ( incident_c(esk3_2(X4,X5),X5)
& ~ incident_c(esk3_2(X4,X5),X4) )
| part_of(X5,X4) ) ),
inference(skolemize,[status(esa)],[30]) ).
fof(32,plain,
! [X4,X5,X6] :
( ( ~ incident_c(X6,X5)
| incident_c(X6,X4)
| ~ part_of(X5,X4) )
& ( ( incident_c(esk3_2(X4,X5),X5)
& ~ incident_c(esk3_2(X4,X5),X4) )
| part_of(X5,X4) ) ),
inference(shift_quantors,[status(thm)],[31]) ).
fof(33,plain,
! [X4,X5,X6] :
( ( ~ incident_c(X6,X5)
| incident_c(X6,X4)
| ~ part_of(X5,X4) )
& ( incident_c(esk3_2(X4,X5),X5)
| part_of(X5,X4) )
& ( ~ incident_c(esk3_2(X4,X5),X4)
| part_of(X5,X4) ) ),
inference(distribute,[status(thm)],[32]) ).
cnf(36,plain,
( incident_c(X3,X2)
| ~ part_of(X1,X2)
| ~ incident_c(X3,X1) ),
inference(split_conjunct,[status(thm)],[33]) ).
fof(37,plain,
! [X1,X2] :
( ( ~ inner_point(X1,X2)
| ( incident_c(X1,X2)
& ~ end_point(X1,X2) ) )
& ( ~ incident_c(X1,X2)
| end_point(X1,X2)
| inner_point(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(38,plain,
! [X3,X4] :
( ( ~ inner_point(X3,X4)
| ( incident_c(X3,X4)
& ~ end_point(X3,X4) ) )
& ( ~ incident_c(X3,X4)
| end_point(X3,X4)
| inner_point(X3,X4) ) ),
inference(variable_rename,[status(thm)],[37]) ).
fof(39,plain,
! [X3,X4] :
( ( incident_c(X3,X4)
| ~ inner_point(X3,X4) )
& ( ~ end_point(X3,X4)
| ~ inner_point(X3,X4) )
& ( ~ incident_c(X3,X4)
| end_point(X3,X4)
| inner_point(X3,X4) ) ),
inference(distribute,[status(thm)],[38]) ).
cnf(41,plain,
( ~ inner_point(X1,X2)
| ~ end_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[39]) ).
cnf(42,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[39]) ).
fof(43,plain,
! [X3] :
? [X4] : inner_point(X4,X3),
inference(variable_rename,[status(thm)],[4]) ).
fof(44,plain,
! [X3] : inner_point(esk4_1(X3),X3),
inference(skolemize,[status(esa)],[43]) ).
cnf(45,plain,
inner_point(esk4_1(X1),X1),
inference(split_conjunct,[status(thm)],[44]) ).
fof(68,plain,
! [X1,X2,X3] :
( ( ~ meet(X1,X2,X3)
| ( incident_c(X1,X2)
& incident_c(X1,X3)
& ! [X5] :
( ~ incident_c(X5,X2)
| ~ incident_c(X5,X3)
| ( end_point(X5,X2)
& end_point(X5,X3) ) ) ) )
& ( ~ incident_c(X1,X2)
| ~ incident_c(X1,X3)
| ? [X5] :
( incident_c(X5,X2)
& incident_c(X5,X3)
& ( ~ end_point(X5,X2)
| ~ end_point(X5,X3) ) )
| meet(X1,X2,X3) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(69,plain,
! [X6,X7,X8] :
( ( ~ meet(X6,X7,X8)
| ( incident_c(X6,X7)
& incident_c(X6,X8)
& ! [X9] :
( ~ incident_c(X9,X7)
| ~ incident_c(X9,X8)
| ( end_point(X9,X7)
& end_point(X9,X8) ) ) ) )
& ( ~ incident_c(X6,X7)
| ~ incident_c(X6,X8)
| ? [X10] :
( incident_c(X10,X7)
& incident_c(X10,X8)
& ( ~ end_point(X10,X7)
| ~ end_point(X10,X8) ) )
| meet(X6,X7,X8) ) ),
inference(variable_rename,[status(thm)],[68]) ).
fof(70,plain,
! [X6,X7,X8] :
( ( ~ meet(X6,X7,X8)
| ( incident_c(X6,X7)
& incident_c(X6,X8)
& ! [X9] :
( ~ incident_c(X9,X7)
| ~ incident_c(X9,X8)
| ( end_point(X9,X7)
& end_point(X9,X8) ) ) ) )
& ( ~ incident_c(X6,X7)
| ~ incident_c(X6,X8)
| ( incident_c(esk8_3(X6,X7,X8),X7)
& incident_c(esk8_3(X6,X7,X8),X8)
& ( ~ end_point(esk8_3(X6,X7,X8),X7)
| ~ end_point(esk8_3(X6,X7,X8),X8) ) )
| meet(X6,X7,X8) ) ),
inference(skolemize,[status(esa)],[69]) ).
fof(71,plain,
! [X6,X7,X8,X9] :
( ( ( ( ~ incident_c(X9,X7)
| ~ incident_c(X9,X8)
| ( end_point(X9,X7)
& end_point(X9,X8) ) )
& incident_c(X6,X7)
& incident_c(X6,X8) )
| ~ meet(X6,X7,X8) )
& ( ~ incident_c(X6,X7)
| ~ incident_c(X6,X8)
| ( incident_c(esk8_3(X6,X7,X8),X7)
& incident_c(esk8_3(X6,X7,X8),X8)
& ( ~ end_point(esk8_3(X6,X7,X8),X7)
| ~ end_point(esk8_3(X6,X7,X8),X8) ) )
| meet(X6,X7,X8) ) ),
inference(shift_quantors,[status(thm)],[70]) ).
fof(72,plain,
! [X6,X7,X8,X9] :
( ( end_point(X9,X7)
| ~ incident_c(X9,X7)
| ~ incident_c(X9,X8)
| ~ meet(X6,X7,X8) )
& ( end_point(X9,X8)
| ~ incident_c(X9,X7)
| ~ incident_c(X9,X8)
| ~ meet(X6,X7,X8) )
& ( incident_c(X6,X7)
| ~ meet(X6,X7,X8) )
& ( incident_c(X6,X8)
| ~ meet(X6,X7,X8) )
& ( incident_c(esk8_3(X6,X7,X8),X7)
| ~ incident_c(X6,X7)
| ~ incident_c(X6,X8)
| meet(X6,X7,X8) )
& ( incident_c(esk8_3(X6,X7,X8),X8)
| ~ incident_c(X6,X7)
| ~ incident_c(X6,X8)
| meet(X6,X7,X8) )
& ( ~ end_point(esk8_3(X6,X7,X8),X7)
| ~ end_point(esk8_3(X6,X7,X8),X8)
| ~ incident_c(X6,X7)
| ~ incident_c(X6,X8)
| meet(X6,X7,X8) ) ),
inference(distribute,[status(thm)],[71]) ).
cnf(79,plain,
( end_point(X4,X2)
| ~ meet(X1,X2,X3)
| ~ incident_c(X4,X3)
| ~ incident_c(X4,X2) ),
inference(split_conjunct,[status(thm)],[72]) ).
fof(99,negated_conjecture,
? [X3,X4] :
( part_of(X3,X4)
& ? [X1] : meet(X1,X3,X4) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(100,negated_conjecture,
? [X5,X6] :
( part_of(X5,X6)
& ? [X7] : meet(X7,X5,X6) ),
inference(variable_rename,[status(thm)],[99]) ).
fof(101,negated_conjecture,
( part_of(esk12_0,esk13_0)
& meet(esk14_0,esk12_0,esk13_0) ),
inference(skolemize,[status(esa)],[100]) ).
cnf(102,negated_conjecture,
meet(esk14_0,esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[101]) ).
cnf(103,negated_conjecture,
part_of(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[101]) ).
cnf(106,plain,
incident_c(esk4_1(X1),X1),
inference(spm,[status(thm)],[42,45,theory(equality)]) ).
cnf(107,plain,
~ end_point(esk4_1(X1),X1),
inference(spm,[status(thm)],[41,45,theory(equality)]) ).
cnf(109,negated_conjecture,
( incident_c(X1,esk13_0)
| ~ incident_c(X1,esk12_0) ),
inference(spm,[status(thm)],[36,103,theory(equality)]) ).
cnf(133,negated_conjecture,
( end_point(X1,esk12_0)
| ~ incident_c(X1,esk13_0)
| ~ incident_c(X1,esk12_0) ),
inference(spm,[status(thm)],[79,102,theory(equality)]) ).
cnf(180,negated_conjecture,
( end_point(X1,esk12_0)
| ~ incident_c(X1,esk12_0) ),
inference(csr,[status(thm)],[133,109]) ).
cnf(181,negated_conjecture,
~ incident_c(esk4_1(esk12_0),esk12_0),
inference(spm,[status(thm)],[107,180,theory(equality)]) ).
cnf(186,negated_conjecture,
$false,
inference(rw,[status(thm)],[181,106,theory(equality)]) ).
cnf(187,negated_conjecture,
$false,
inference(cn,[status(thm)],[186,theory(equality)]) ).
cnf(188,negated_conjecture,
$false,
187,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GEO/GEO087+1.p
% --creating new selector for [GEO004+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpz1Nxtq/sel_GEO087+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpz1Nxtq/sel_GEO087+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [GEO004+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpz1Nxtq/sel_GEO087+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [GEO004+0.ax]
% -running prover on /tmp/tmpz1Nxtq/sel_GEO087+1.p_4 with time limit 55
% -prover status Theorem
% Problem GEO087+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GEO/GEO087+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GEO/GEO087+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
%
%------------------------------------------------------------------------------