TSTP Solution File: COM023+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : COM023+1 : 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 : Sat Dec 25 05:49:31 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 4
% Syntax : Number of formulae : 53 ( 10 unt; 0 def)
% Number of atoms : 335 ( 0 equ)
% Maximal formula atoms : 44 ( 6 avg)
% Number of connectives : 494 ( 212 ~; 218 |; 60 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-4 aty)
% Number of variables : 83 ( 0 sgn 44 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3)
& sdtmndtasgtdt0(X1,xR,X2)
& sdtmndtasgtdt0(X1,xR,X3) )
=> ? [X4] :
( aElement0(X4)
& sdtmndtasgtdt0(X2,xR,X4)
& sdtmndtasgtdt0(X3,xR,X4) ) ),
file('/tmp/tmpM49qdl/sel_COM023+1.p_1',m__715) ).
fof(5,axiom,
! [X1] :
( aRewritingSystem0(X1)
=> ( isConfluent0(X1)
<=> ! [X2,X3,X4] :
( ( aElement0(X2)
& aElement0(X3)
& aElement0(X4)
& sdtmndtasgtdt0(X2,X1,X3)
& sdtmndtasgtdt0(X2,X1,X4) )
=> ? [X5] :
( aElement0(X5)
& sdtmndtasgtdt0(X3,X1,X5)
& sdtmndtasgtdt0(X4,X1,X5) ) ) ) ),
file('/tmp/tmpM49qdl/sel_COM023+1.p_1',mCRDef) ).
fof(6,conjecture,
isConfluent0(xR),
file('/tmp/tmpM49qdl/sel_COM023+1.p_1',m__) ).
fof(13,axiom,
aRewritingSystem0(xR),
file('/tmp/tmpM49qdl/sel_COM023+1.p_1',m__656) ).
fof(19,negated_conjecture,
~ isConfluent0(xR),
inference(assume_negation,[status(cth)],[6]) ).
fof(20,negated_conjecture,
~ isConfluent0(xR),
inference(fof_simplification,[status(thm)],[19,theory(equality)]) ).
fof(21,plain,
! [X1,X2,X3] :
( ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ sdtmndtasgtdt0(X1,xR,X3)
| ? [X4] :
( aElement0(X4)
& sdtmndtasgtdt0(X2,xR,X4)
& sdtmndtasgtdt0(X3,xR,X4) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(22,plain,
! [X5,X6,X7] :
( ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,xR,X6)
| ~ sdtmndtasgtdt0(X5,xR,X7)
| ? [X8] :
( aElement0(X8)
& sdtmndtasgtdt0(X6,xR,X8)
& sdtmndtasgtdt0(X7,xR,X8) ) ),
inference(variable_rename,[status(thm)],[21]) ).
fof(23,plain,
! [X5,X6,X7] :
( ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,xR,X6)
| ~ sdtmndtasgtdt0(X5,xR,X7)
| ( aElement0(esk1_3(X5,X6,X7))
& sdtmndtasgtdt0(X6,xR,esk1_3(X5,X6,X7))
& sdtmndtasgtdt0(X7,xR,esk1_3(X5,X6,X7)) ) ),
inference(skolemize,[status(esa)],[22]) ).
fof(24,plain,
! [X5,X6,X7] :
( ( aElement0(esk1_3(X5,X6,X7))
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,xR,X6)
| ~ sdtmndtasgtdt0(X5,xR,X7) )
& ( sdtmndtasgtdt0(X6,xR,esk1_3(X5,X6,X7))
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,xR,X6)
| ~ sdtmndtasgtdt0(X5,xR,X7) )
& ( sdtmndtasgtdt0(X7,xR,esk1_3(X5,X6,X7))
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,xR,X6)
| ~ sdtmndtasgtdt0(X5,xR,X7) ) ),
inference(distribute,[status(thm)],[23]) ).
cnf(25,plain,
( sdtmndtasgtdt0(X2,xR,esk1_3(X1,X3,X2))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ sdtmndtasgtdt0(X1,xR,X3)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(26,plain,
( sdtmndtasgtdt0(X3,xR,esk1_3(X1,X3,X2))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ sdtmndtasgtdt0(X1,xR,X3)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(27,plain,
( aElement0(esk1_3(X1,X3,X2))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ sdtmndtasgtdt0(X1,xR,X3)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[24]) ).
fof(50,plain,
! [X1] :
( ~ aRewritingSystem0(X1)
| ( ( ~ isConfluent0(X1)
| ! [X2,X3,X4] :
( ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ sdtmndtasgtdt0(X2,X1,X3)
| ~ sdtmndtasgtdt0(X2,X1,X4)
| ? [X5] :
( aElement0(X5)
& sdtmndtasgtdt0(X3,X1,X5)
& sdtmndtasgtdt0(X4,X1,X5) ) ) )
& ( ? [X2,X3,X4] :
( aElement0(X2)
& aElement0(X3)
& aElement0(X4)
& sdtmndtasgtdt0(X2,X1,X3)
& sdtmndtasgtdt0(X2,X1,X4)
& ! [X5] :
( ~ aElement0(X5)
| ~ sdtmndtasgtdt0(X3,X1,X5)
| ~ sdtmndtasgtdt0(X4,X1,X5) ) )
| isConfluent0(X1) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(51,plain,
! [X6] :
( ~ aRewritingSystem0(X6)
| ( ( ~ isConfluent0(X6)
| ! [X7,X8,X9] :
( ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ? [X10] :
( aElement0(X10)
& sdtmndtasgtdt0(X8,X6,X10)
& sdtmndtasgtdt0(X9,X6,X10) ) ) )
& ( ? [X11,X12,X13] :
( aElement0(X11)
& aElement0(X12)
& aElement0(X13)
& sdtmndtasgtdt0(X11,X6,X12)
& sdtmndtasgtdt0(X11,X6,X13)
& ! [X14] :
( ~ aElement0(X14)
| ~ sdtmndtasgtdt0(X12,X6,X14)
| ~ sdtmndtasgtdt0(X13,X6,X14) ) )
| isConfluent0(X6) ) ) ),
inference(variable_rename,[status(thm)],[50]) ).
fof(52,plain,
! [X6] :
( ~ aRewritingSystem0(X6)
| ( ( ~ isConfluent0(X6)
| ! [X7,X8,X9] :
( ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ( aElement0(esk5_4(X6,X7,X8,X9))
& sdtmndtasgtdt0(X8,X6,esk5_4(X6,X7,X8,X9))
& sdtmndtasgtdt0(X9,X6,esk5_4(X6,X7,X8,X9)) ) ) )
& ( ( aElement0(esk6_1(X6))
& aElement0(esk7_1(X6))
& aElement0(esk8_1(X6))
& sdtmndtasgtdt0(esk6_1(X6),X6,esk7_1(X6))
& sdtmndtasgtdt0(esk6_1(X6),X6,esk8_1(X6))
& ! [X14] :
( ~ aElement0(X14)
| ~ sdtmndtasgtdt0(esk7_1(X6),X6,X14)
| ~ sdtmndtasgtdt0(esk8_1(X6),X6,X14) ) )
| isConfluent0(X6) ) ) ),
inference(skolemize,[status(esa)],[51]) ).
fof(53,plain,
! [X6,X7,X8,X9,X14] :
( ( ( ( ( ~ aElement0(X14)
| ~ sdtmndtasgtdt0(esk7_1(X6),X6,X14)
| ~ sdtmndtasgtdt0(esk8_1(X6),X6,X14) )
& aElement0(esk6_1(X6))
& aElement0(esk7_1(X6))
& aElement0(esk8_1(X6))
& sdtmndtasgtdt0(esk6_1(X6),X6,esk7_1(X6))
& sdtmndtasgtdt0(esk6_1(X6),X6,esk8_1(X6)) )
| isConfluent0(X6) )
& ( ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ( aElement0(esk5_4(X6,X7,X8,X9))
& sdtmndtasgtdt0(X8,X6,esk5_4(X6,X7,X8,X9))
& sdtmndtasgtdt0(X9,X6,esk5_4(X6,X7,X8,X9)) )
| ~ isConfluent0(X6) ) )
| ~ aRewritingSystem0(X6) ),
inference(shift_quantors,[status(thm)],[52]) ).
fof(54,plain,
! [X6,X7,X8,X9,X14] :
( ( ~ aElement0(X14)
| ~ sdtmndtasgtdt0(esk7_1(X6),X6,X14)
| ~ sdtmndtasgtdt0(esk8_1(X6),X6,X14)
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( aElement0(esk6_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( aElement0(esk7_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( aElement0(esk8_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(esk6_1(X6),X6,esk7_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(esk6_1(X6),X6,esk8_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( aElement0(esk5_4(X6,X7,X8,X9))
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ~ isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(X8,X6,esk5_4(X6,X7,X8,X9))
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ~ isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(X9,X6,esk5_4(X6,X7,X8,X9))
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ~ isConfluent0(X6)
| ~ aRewritingSystem0(X6) ) ),
inference(distribute,[status(thm)],[53]) ).
cnf(58,plain,
( isConfluent0(X1)
| sdtmndtasgtdt0(esk6_1(X1),X1,esk8_1(X1))
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[54]) ).
cnf(59,plain,
( isConfluent0(X1)
| sdtmndtasgtdt0(esk6_1(X1),X1,esk7_1(X1))
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[54]) ).
cnf(60,plain,
( isConfluent0(X1)
| aElement0(esk8_1(X1))
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[54]) ).
cnf(61,plain,
( isConfluent0(X1)
| aElement0(esk7_1(X1))
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[54]) ).
cnf(62,plain,
( isConfluent0(X1)
| aElement0(esk6_1(X1))
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[54]) ).
cnf(63,plain,
( isConfluent0(X1)
| ~ aRewritingSystem0(X1)
| ~ sdtmndtasgtdt0(esk8_1(X1),X1,X2)
| ~ sdtmndtasgtdt0(esk7_1(X1),X1,X2)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[54]) ).
cnf(64,negated_conjecture,
~ isConfluent0(xR),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(103,plain,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(138,plain,
( isConfluent0(xR)
| ~ aRewritingSystem0(xR)
| ~ sdtmndtasgtdt0(esk7_1(xR),xR,esk1_3(X1,esk8_1(xR),X2))
| ~ aElement0(esk1_3(X1,esk8_1(xR),X2))
| ~ sdtmndtasgtdt0(X1,xR,esk8_1(xR))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ aElement0(esk8_1(xR))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[63,26,theory(equality)]) ).
cnf(141,plain,
( isConfluent0(xR)
| $false
| ~ sdtmndtasgtdt0(esk7_1(xR),xR,esk1_3(X1,esk8_1(xR),X2))
| ~ aElement0(esk1_3(X1,esk8_1(xR),X2))
| ~ sdtmndtasgtdt0(X1,xR,esk8_1(xR))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ aElement0(esk8_1(xR))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[138,103,theory(equality)]) ).
cnf(142,plain,
( isConfluent0(xR)
| ~ sdtmndtasgtdt0(esk7_1(xR),xR,esk1_3(X1,esk8_1(xR),X2))
| ~ aElement0(esk1_3(X1,esk8_1(xR),X2))
| ~ sdtmndtasgtdt0(X1,xR,esk8_1(xR))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ aElement0(esk8_1(xR))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[141,theory(equality)]) ).
cnf(143,plain,
( ~ sdtmndtasgtdt0(esk7_1(xR),xR,esk1_3(X1,esk8_1(xR),X2))
| ~ aElement0(esk1_3(X1,esk8_1(xR),X2))
| ~ sdtmndtasgtdt0(X1,xR,esk8_1(xR))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ aElement0(esk8_1(xR))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(sr,[status(thm)],[142,64,theory(equality)]) ).
cnf(299,plain,
( ~ sdtmndtasgtdt0(esk7_1(xR),xR,esk1_3(X1,esk8_1(xR),X2))
| ~ sdtmndtasgtdt0(X1,xR,esk8_1(xR))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ aElement0(esk8_1(xR))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[143,27]) ).
cnf(300,plain,
( ~ sdtmndtasgtdt0(X1,xR,esk8_1(xR))
| ~ sdtmndtasgtdt0(X1,xR,esk7_1(xR))
| ~ aElement0(esk8_1(xR))
| ~ aElement0(esk7_1(xR))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[299,25,theory(equality)]) ).
cnf(301,plain,
( isConfluent0(xR)
| ~ sdtmndtasgtdt0(esk6_1(xR),xR,esk7_1(xR))
| ~ aElement0(esk8_1(xR))
| ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR))
| ~ aRewritingSystem0(xR) ),
inference(spm,[status(thm)],[300,58,theory(equality)]) ).
cnf(304,plain,
( isConfluent0(xR)
| ~ sdtmndtasgtdt0(esk6_1(xR),xR,esk7_1(xR))
| ~ aElement0(esk8_1(xR))
| ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR))
| $false ),
inference(rw,[status(thm)],[301,103,theory(equality)]) ).
cnf(305,plain,
( isConfluent0(xR)
| ~ sdtmndtasgtdt0(esk6_1(xR),xR,esk7_1(xR))
| ~ aElement0(esk8_1(xR))
| ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR)) ),
inference(cn,[status(thm)],[304,theory(equality)]) ).
cnf(306,plain,
( ~ sdtmndtasgtdt0(esk6_1(xR),xR,esk7_1(xR))
| ~ aElement0(esk8_1(xR))
| ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR)) ),
inference(sr,[status(thm)],[305,64,theory(equality)]) ).
cnf(316,plain,
( isConfluent0(xR)
| ~ sdtmndtasgtdt0(esk6_1(xR),xR,esk7_1(xR))
| ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR))
| ~ aRewritingSystem0(xR) ),
inference(spm,[status(thm)],[306,60,theory(equality)]) ).
cnf(317,plain,
( isConfluent0(xR)
| ~ sdtmndtasgtdt0(esk6_1(xR),xR,esk7_1(xR))
| ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR))
| $false ),
inference(rw,[status(thm)],[316,103,theory(equality)]) ).
cnf(318,plain,
( isConfluent0(xR)
| ~ sdtmndtasgtdt0(esk6_1(xR),xR,esk7_1(xR))
| ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR)) ),
inference(cn,[status(thm)],[317,theory(equality)]) ).
cnf(319,plain,
( ~ sdtmndtasgtdt0(esk6_1(xR),xR,esk7_1(xR))
| ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR)) ),
inference(sr,[status(thm)],[318,64,theory(equality)]) ).
cnf(320,plain,
( isConfluent0(xR)
| ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR))
| ~ aRewritingSystem0(xR) ),
inference(spm,[status(thm)],[319,59,theory(equality)]) ).
cnf(322,plain,
( isConfluent0(xR)
| ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR))
| $false ),
inference(rw,[status(thm)],[320,103,theory(equality)]) ).
cnf(323,plain,
( isConfluent0(xR)
| ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR)) ),
inference(cn,[status(thm)],[322,theory(equality)]) ).
cnf(324,plain,
( ~ aElement0(esk7_1(xR))
| ~ aElement0(esk6_1(xR)) ),
inference(sr,[status(thm)],[323,64,theory(equality)]) ).
cnf(328,plain,
( isConfluent0(xR)
| ~ aElement0(esk6_1(xR))
| ~ aRewritingSystem0(xR) ),
inference(spm,[status(thm)],[324,61,theory(equality)]) ).
cnf(329,plain,
( isConfluent0(xR)
| ~ aElement0(esk6_1(xR))
| $false ),
inference(rw,[status(thm)],[328,103,theory(equality)]) ).
cnf(330,plain,
( isConfluent0(xR)
| ~ aElement0(esk6_1(xR)) ),
inference(cn,[status(thm)],[329,theory(equality)]) ).
cnf(331,plain,
~ aElement0(esk6_1(xR)),
inference(sr,[status(thm)],[330,64,theory(equality)]) ).
cnf(332,plain,
( isConfluent0(xR)
| ~ aRewritingSystem0(xR) ),
inference(spm,[status(thm)],[331,62,theory(equality)]) ).
cnf(333,plain,
( isConfluent0(xR)
| $false ),
inference(rw,[status(thm)],[332,103,theory(equality)]) ).
cnf(334,plain,
isConfluent0(xR),
inference(cn,[status(thm)],[333,theory(equality)]) ).
cnf(335,plain,
$false,
inference(sr,[status(thm)],[334,64,theory(equality)]) ).
cnf(336,plain,
$false,
335,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/COM/COM023+1.p
% --creating new selector for []
% -running prover on /tmp/tmpM49qdl/sel_COM023+1.p_1 with time limit 29
% -prover status Theorem
% Problem COM023+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/COM/COM023+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/COM/COM023+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
%
%------------------------------------------------------------------------------