%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : PRO012+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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 : Sun Dec 26 00:38:33 EST 2010
% Result : Theorem 0.55s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 43 ( 6 unt; 0 def)
% Number of atoms : 193 ( 12 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 249 ( 99 ~; 92 |; 53 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 74 ( 0 sgn 36 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X8,X9,X10,X11] :
( ( min_precedes(X8,X9,X11)
& min_precedes(X9,X10,X11) )
=> min_precedes(X8,X10,X11) ),
file('/tmp/tmp0C_F5X/sel_PRO012+2.p_1',sos) ).
fof(26,axiom,
! [X63] :
( occurrence_of(X63,tptp0)
=> ? [X64,X65,X66] :
( occurrence_of(X64,tptp3)
& root_occ(X64,X63)
& occurrence_of(X65,tptp4)
& min_precedes(X64,X65,tptp0)
& ( occurrence_of(X66,tptp2)
| occurrence_of(X66,tptp1) )
& min_precedes(X65,X66,tptp0)
& ! [X67] :
( min_precedes(X64,X67,tptp0)
=> ( X67 = X65
| X67 = X66 ) ) ) ),
file('/tmp/tmp0C_F5X/sel_PRO012+2.p_1',sos_32) ).
fof(46,conjecture,
! [X101] :
( occurrence_of(X101,tptp0)
=> ? [X102,X103] :
( occurrence_of(X102,tptp3)
& root_occ(X102,X101)
& ( occurrence_of(X103,tptp2)
| occurrence_of(X103,tptp1) )
& min_precedes(X102,X103,tptp0) ) ),
file('/tmp/tmp0C_F5X/sel_PRO012+2.p_1',goals) ).
fof(47,negated_conjecture,
~ ! [X101] :
( occurrence_of(X101,tptp0)
=> ? [X102,X103] :
( occurrence_of(X102,tptp3)
& root_occ(X102,X101)
& ( occurrence_of(X103,tptp2)
| occurrence_of(X103,tptp1) )
& min_precedes(X102,X103,tptp0) ) ),
inference(assume_negation,[status(cth)],[46]) ).
fof(68,plain,
! [X8,X9,X10,X11] :
( ~ min_precedes(X8,X9,X11)
| ~ min_precedes(X9,X10,X11)
| min_precedes(X8,X10,X11) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(69,plain,
! [X12,X13,X14,X15] :
( ~ min_precedes(X12,X13,X15)
| ~ min_precedes(X13,X14,X15)
| min_precedes(X12,X14,X15) ),
inference(variable_rename,[status(thm)],[68]) ).
cnf(70,plain,
( min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[69]) ).
fof(146,plain,
! [X63] :
( ~ occurrence_of(X63,tptp0)
| ? [X64,X65,X66] :
( occurrence_of(X64,tptp3)
& root_occ(X64,X63)
& occurrence_of(X65,tptp4)
& min_precedes(X64,X65,tptp0)
& ( occurrence_of(X66,tptp2)
| occurrence_of(X66,tptp1) )
& min_precedes(X65,X66,tptp0)
& ! [X67] :
( ~ min_precedes(X64,X67,tptp0)
| X67 = X65
| X67 = X66 ) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(147,plain,
! [X68] :
( ~ occurrence_of(X68,tptp0)
| ? [X69,X70,X71] :
( occurrence_of(X69,tptp3)
& root_occ(X69,X68)
& occurrence_of(X70,tptp4)
& min_precedes(X69,X70,tptp0)
& ( occurrence_of(X71,tptp2)
| occurrence_of(X71,tptp1) )
& min_precedes(X70,X71,tptp0)
& ! [X72] :
( ~ min_precedes(X69,X72,tptp0)
| X72 = X70
| X72 = X71 ) ) ),
inference(variable_rename,[status(thm)],[146]) ).
fof(148,plain,
! [X68] :
( ~ occurrence_of(X68,tptp0)
| ( occurrence_of(esk6_1(X68),tptp3)
& root_occ(esk6_1(X68),X68)
& occurrence_of(esk7_1(X68),tptp4)
& min_precedes(esk6_1(X68),esk7_1(X68),tptp0)
& ( occurrence_of(esk8_1(X68),tptp2)
| occurrence_of(esk8_1(X68),tptp1) )
& min_precedes(esk7_1(X68),esk8_1(X68),tptp0)
& ! [X72] :
( ~ min_precedes(esk6_1(X68),X72,tptp0)
| X72 = esk7_1(X68)
| X72 = esk8_1(X68) ) ) ),
inference(skolemize,[status(esa)],[147]) ).
fof(149,plain,
! [X68,X72] :
( ( ( ~ min_precedes(esk6_1(X68),X72,tptp0)
| X72 = esk7_1(X68)
| X72 = esk8_1(X68) )
& occurrence_of(esk6_1(X68),tptp3)
& root_occ(esk6_1(X68),X68)
& occurrence_of(esk7_1(X68),tptp4)
& min_precedes(esk6_1(X68),esk7_1(X68),tptp0)
& ( occurrence_of(esk8_1(X68),tptp2)
| occurrence_of(esk8_1(X68),tptp1) )
& min_precedes(esk7_1(X68),esk8_1(X68),tptp0) )
| ~ occurrence_of(X68,tptp0) ),
inference(shift_quantors,[status(thm)],[148]) ).
fof(150,plain,
! [X68,X72] :
( ( ~ min_precedes(esk6_1(X68),X72,tptp0)
| X72 = esk7_1(X68)
| X72 = esk8_1(X68)
| ~ occurrence_of(X68,tptp0) )
& ( occurrence_of(esk6_1(X68),tptp3)
| ~ occurrence_of(X68,tptp0) )
& ( root_occ(esk6_1(X68),X68)
| ~ occurrence_of(X68,tptp0) )
& ( occurrence_of(esk7_1(X68),tptp4)
| ~ occurrence_of(X68,tptp0) )
& ( min_precedes(esk6_1(X68),esk7_1(X68),tptp0)
| ~ occurrence_of(X68,tptp0) )
& ( occurrence_of(esk8_1(X68),tptp2)
| occurrence_of(esk8_1(X68),tptp1)
| ~ occurrence_of(X68,tptp0) )
& ( min_precedes(esk7_1(X68),esk8_1(X68),tptp0)
| ~ occurrence_of(X68,tptp0) ) ),
inference(distribute,[status(thm)],[149]) ).
cnf(151,plain,
( min_precedes(esk7_1(X1),esk8_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[150]) ).
cnf(152,plain,
( occurrence_of(esk8_1(X1),tptp1)
| occurrence_of(esk8_1(X1),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[150]) ).
cnf(153,plain,
( min_precedes(esk6_1(X1),esk7_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[150]) ).
cnf(155,plain,
( root_occ(esk6_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[150]) ).
cnf(156,plain,
( occurrence_of(esk6_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[150]) ).
fof(242,negated_conjecture,
? [X101] :
( occurrence_of(X101,tptp0)
& ! [X102,X103] :
( ~ occurrence_of(X102,tptp3)
| ~ root_occ(X102,X101)
| ( ~ occurrence_of(X103,tptp2)
& ~ occurrence_of(X103,tptp1) )
| ~ min_precedes(X102,X103,tptp0) ) ),
inference(fof_nnf,[status(thm)],[47]) ).
fof(243,negated_conjecture,
? [X104] :
( occurrence_of(X104,tptp0)
& ! [X105,X106] :
( ~ occurrence_of(X105,tptp3)
| ~ root_occ(X105,X104)
| ( ~ occurrence_of(X106,tptp2)
& ~ occurrence_of(X106,tptp1) )
| ~ min_precedes(X105,X106,tptp0) ) ),
inference(variable_rename,[status(thm)],[242]) ).
fof(244,negated_conjecture,
( occurrence_of(esk18_0,tptp0)
& ! [X105,X106] :
( ~ occurrence_of(X105,tptp3)
| ~ root_occ(X105,esk18_0)
| ( ~ occurrence_of(X106,tptp2)
& ~ occurrence_of(X106,tptp1) )
| ~ min_precedes(X105,X106,tptp0) ) ),
inference(skolemize,[status(esa)],[243]) ).
fof(245,negated_conjecture,
! [X105,X106] :
( ( ~ occurrence_of(X105,tptp3)
| ~ root_occ(X105,esk18_0)
| ( ~ occurrence_of(X106,tptp2)
& ~ occurrence_of(X106,tptp1) )
| ~ min_precedes(X105,X106,tptp0) )
& occurrence_of(esk18_0,tptp0) ),
inference(shift_quantors,[status(thm)],[244]) ).
fof(246,negated_conjecture,
! [X105,X106] :
( ( ~ occurrence_of(X106,tptp2)
| ~ occurrence_of(X105,tptp3)
| ~ root_occ(X105,esk18_0)
| ~ min_precedes(X105,X106,tptp0) )
& ( ~ occurrence_of(X106,tptp1)
| ~ occurrence_of(X105,tptp3)
| ~ root_occ(X105,esk18_0)
| ~ min_precedes(X105,X106,tptp0) )
& occurrence_of(esk18_0,tptp0) ),
inference(distribute,[status(thm)],[245]) ).
cnf(247,negated_conjecture,
occurrence_of(esk18_0,tptp0),
inference(split_conjunct,[status(thm)],[246]) ).
cnf(248,negated_conjecture,
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,esk18_0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1) ),
inference(split_conjunct,[status(thm)],[246]) ).
cnf(249,negated_conjecture,
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,esk18_0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2) ),
inference(split_conjunct,[status(thm)],[246]) ).
cnf(320,plain,
( min_precedes(X1,esk8_1(X2),tptp0)
| ~ min_precedes(X1,esk7_1(X2),tptp0)
| ~ occurrence_of(X2,tptp0) ),
inference(spm,[status(thm)],[70,151,theory(equality)]) ).
cnf(1078,negated_conjecture,
( ~ root_occ(X1,esk18_0)
| ~ occurrence_of(esk8_1(X2),tptp2)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp0)
| ~ min_precedes(X1,esk7_1(X2),tptp0) ),
inference(spm,[status(thm)],[249,320,theory(equality)]) ).
cnf(1079,negated_conjecture,
( ~ root_occ(X1,esk18_0)
| ~ occurrence_of(esk8_1(X2),tptp1)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp0)
| ~ min_precedes(X1,esk7_1(X2),tptp0) ),
inference(spm,[status(thm)],[248,320,theory(equality)]) ).
cnf(1112,negated_conjecture,
( ~ root_occ(esk6_1(X1),esk18_0)
| ~ occurrence_of(esk8_1(X1),tptp2)
| ~ occurrence_of(esk6_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[1078,153,theory(equality)]) ).
cnf(1116,negated_conjecture,
( ~ root_occ(esk6_1(X1),esk18_0)
| ~ occurrence_of(esk8_1(X1),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(csr,[status(thm)],[1112,156]) ).
cnf(1117,negated_conjecture,
( ~ occurrence_of(esk8_1(esk18_0),tptp2)
| ~ occurrence_of(esk18_0,tptp0) ),
inference(spm,[status(thm)],[1116,155,theory(equality)]) ).
cnf(1119,negated_conjecture,
( ~ occurrence_of(esk8_1(esk18_0),tptp2)
| $false ),
inference(rw,[status(thm)],[1117,247,theory(equality)]) ).
cnf(1120,negated_conjecture,
~ occurrence_of(esk8_1(esk18_0),tptp2),
inference(cn,[status(thm)],[1119,theory(equality)]) ).
cnf(3983,negated_conjecture,
( ~ root_occ(esk6_1(X1),esk18_0)
| ~ occurrence_of(esk8_1(X1),tptp1)
| ~ occurrence_of(esk6_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(spm,[status(thm)],[1079,153,theory(equality)]) ).
cnf(3987,negated_conjecture,
( ~ root_occ(esk6_1(X1),esk18_0)
| ~ occurrence_of(esk8_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
inference(csr,[status(thm)],[3983,156]) ).
cnf(3988,negated_conjecture,
( ~ occurrence_of(esk8_1(esk18_0),tptp1)
| ~ occurrence_of(esk18_0,tptp0) ),
inference(spm,[status(thm)],[3987,155,theory(equality)]) ).
cnf(3992,negated_conjecture,
( ~ occurrence_of(esk8_1(esk18_0),tptp1)
| $false ),
inference(rw,[status(thm)],[3988,247,theory(equality)]) ).
cnf(3993,negated_conjecture,
~ occurrence_of(esk8_1(esk18_0),tptp1),
inference(cn,[status(thm)],[3992,theory(equality)]) ).
cnf(4000,negated_conjecture,
( occurrence_of(esk8_1(esk18_0),tptp2)
| ~ occurrence_of(esk18_0,tptp0) ),
inference(spm,[status(thm)],[3993,152,theory(equality)]) ).
cnf(4001,negated_conjecture,
( occurrence_of(esk8_1(esk18_0),tptp2)
| $false ),
inference(rw,[status(thm)],[4000,247,theory(equality)]) ).
cnf(4002,negated_conjecture,
occurrence_of(esk8_1(esk18_0),tptp2),
inference(cn,[status(thm)],[4001,theory(equality)]) ).
cnf(4003,negated_conjecture,
$false,
inference(sr,[status(thm)],[4002,1120,theory(equality)]) ).
cnf(4004,negated_conjecture,
$false,
4003,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/PRO/PRO012+2.p
% --creating new selector for []
% -running prover on /tmp/tmp0C_F5X/sel_PRO012+2.p_1 with time limit 29
% -prover status Theorem
% Problem PRO012+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/PRO/PRO012+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/PRO/PRO012+2.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
%
%------------------------------------------------------------------------------