TSTP Solution File: COM016+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : COM016+1 : TPTP v5.0.0. Released v4.0.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 05:47:46 EST 2010
% Result : Theorem 0.38s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 6
% Syntax : Number of formulae : 54 ( 9 unt; 0 def)
% Number of atoms : 296 ( 8 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 413 ( 171 ~; 199 |; 39 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 70 ( 0 sgn 37 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& sdtmndtasgtdt0(X1,xR,xb) ),
file('/tmp/tmpMKXFPY/sel_COM016+1.p_1',m__) ).
fof(2,axiom,
( sdtmndtplgtdt0(xa,xR,xb)
& sdtmndtplgtdt0(xa,xR,xc) ),
file('/tmp/tmpMKXFPY/sel_COM016+1.p_1',m__731_02) ).
fof(8,axiom,
( aElement0(xa)
& aElement0(xb)
& aElement0(xc) ),
file('/tmp/tmpMKXFPY/sel_COM016+1.p_1',m__731) ).
fof(9,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtplgtdt0(X1,X2,X3)
<=> ( aReductOfIn0(X3,X1,X2)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,X2)
& sdtmndtplgtdt0(X4,X2,X3) ) ) ) ),
file('/tmp/tmpMKXFPY/sel_COM016+1.p_1',mTCDef) ).
fof(15,axiom,
aRewritingSystem0(xR),
file('/tmp/tmpMKXFPY/sel_COM016+1.p_1',m__656) ).
fof(19,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtasgtdt0(X1,X2,X3)
<=> ( X1 = X3
| sdtmndtplgtdt0(X1,X2,X3) ) ) ),
file('/tmp/tmpMKXFPY/sel_COM016+1.p_1',mTCRDef) ).
fof(21,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& sdtmndtasgtdt0(X1,xR,xb) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(22,negated_conjecture,
! [X1] :
( ~ aElement0(X1)
| ~ aReductOfIn0(X1,xa,xR)
| ~ sdtmndtasgtdt0(X1,xR,xb) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(23,negated_conjecture,
! [X2] :
( ~ aElement0(X2)
| ~ aReductOfIn0(X2,xa,xR)
| ~ sdtmndtasgtdt0(X2,xR,xb) ),
inference(variable_rename,[status(thm)],[22]) ).
cnf(24,negated_conjecture,
( ~ sdtmndtasgtdt0(X1,xR,xb)
| ~ aReductOfIn0(X1,xa,xR)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(26,plain,
sdtmndtplgtdt0(xa,xR,xb),
inference(split_conjunct,[status(thm)],[2]) ).
cnf(71,plain,
aElement0(xb),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(72,plain,
aElement0(xa),
inference(split_conjunct,[status(thm)],[8]) ).
fof(73,plain,
! [X1,X2,X3] :
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ( ( ~ sdtmndtplgtdt0(X1,X2,X3)
| aReductOfIn0(X3,X1,X2)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,X2)
& sdtmndtplgtdt0(X4,X2,X3) ) )
& ( ( ~ aReductOfIn0(X3,X1,X2)
& ! [X4] :
( ~ aElement0(X4)
| ~ aReductOfIn0(X4,X1,X2)
| ~ sdtmndtplgtdt0(X4,X2,X3) ) )
| sdtmndtplgtdt0(X1,X2,X3) ) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(74,plain,
! [X5,X6,X7] :
( ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7)
| ( ( ~ sdtmndtplgtdt0(X5,X6,X7)
| aReductOfIn0(X7,X5,X6)
| ? [X8] :
( aElement0(X8)
& aReductOfIn0(X8,X5,X6)
& sdtmndtplgtdt0(X8,X6,X7) ) )
& ( ( ~ aReductOfIn0(X7,X5,X6)
& ! [X9] :
( ~ aElement0(X9)
| ~ aReductOfIn0(X9,X5,X6)
| ~ sdtmndtplgtdt0(X9,X6,X7) ) )
| sdtmndtplgtdt0(X5,X6,X7) ) ) ),
inference(variable_rename,[status(thm)],[73]) ).
fof(75,plain,
! [X5,X6,X7] :
( ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7)
| ( ( ~ sdtmndtplgtdt0(X5,X6,X7)
| aReductOfIn0(X7,X5,X6)
| ( aElement0(esk9_3(X5,X6,X7))
& aReductOfIn0(esk9_3(X5,X6,X7),X5,X6)
& sdtmndtplgtdt0(esk9_3(X5,X6,X7),X6,X7) ) )
& ( ( ~ aReductOfIn0(X7,X5,X6)
& ! [X9] :
( ~ aElement0(X9)
| ~ aReductOfIn0(X9,X5,X6)
| ~ sdtmndtplgtdt0(X9,X6,X7) ) )
| sdtmndtplgtdt0(X5,X6,X7) ) ) ),
inference(skolemize,[status(esa)],[74]) ).
fof(76,plain,
! [X5,X6,X7,X9] :
( ( ( ( ( ~ aElement0(X9)
| ~ aReductOfIn0(X9,X5,X6)
| ~ sdtmndtplgtdt0(X9,X6,X7) )
& ~ aReductOfIn0(X7,X5,X6) )
| sdtmndtplgtdt0(X5,X6,X7) )
& ( ~ sdtmndtplgtdt0(X5,X6,X7)
| aReductOfIn0(X7,X5,X6)
| ( aElement0(esk9_3(X5,X6,X7))
& aReductOfIn0(esk9_3(X5,X6,X7),X5,X6)
& sdtmndtplgtdt0(esk9_3(X5,X6,X7),X6,X7) ) ) )
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) ),
inference(shift_quantors,[status(thm)],[75]) ).
fof(77,plain,
! [X5,X6,X7,X9] :
( ( ~ aElement0(X9)
| ~ aReductOfIn0(X9,X5,X6)
| ~ sdtmndtplgtdt0(X9,X6,X7)
| sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( ~ aReductOfIn0(X7,X5,X6)
| sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( aElement0(esk9_3(X5,X6,X7))
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( aReductOfIn0(esk9_3(X5,X6,X7),X5,X6)
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( sdtmndtplgtdt0(esk9_3(X5,X6,X7),X6,X7)
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) ) ),
inference(distribute,[status(thm)],[76]) ).
cnf(78,plain,
( aReductOfIn0(X1,X3,X2)
| sdtmndtplgtdt0(esk9_3(X3,X2,X1),X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(79,plain,
( aReductOfIn0(X1,X3,X2)
| aReductOfIn0(esk9_3(X3,X2,X1),X3,X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(80,plain,
( aReductOfIn0(X1,X3,X2)
| aElement0(esk9_3(X3,X2,X1))
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(111,plain,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[15]) ).
fof(121,plain,
! [X1,X2,X3] :
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ( ( ~ sdtmndtasgtdt0(X1,X2,X3)
| X1 = X3
| sdtmndtplgtdt0(X1,X2,X3) )
& ( ( X1 != X3
& ~ sdtmndtplgtdt0(X1,X2,X3) )
| sdtmndtasgtdt0(X1,X2,X3) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(122,plain,
! [X4,X5,X6] :
( ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6)
| ( ( ~ sdtmndtasgtdt0(X4,X5,X6)
| X4 = X6
| sdtmndtplgtdt0(X4,X5,X6) )
& ( ( X4 != X6
& ~ sdtmndtplgtdt0(X4,X5,X6) )
| sdtmndtasgtdt0(X4,X5,X6) ) ) ),
inference(variable_rename,[status(thm)],[121]) ).
fof(123,plain,
! [X4,X5,X6] :
( ( ~ sdtmndtasgtdt0(X4,X5,X6)
| X4 = X6
| sdtmndtplgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) )
& ( X4 != X6
| sdtmndtasgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) )
& ( ~ sdtmndtplgtdt0(X4,X5,X6)
| sdtmndtasgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[122]) ).
cnf(124,plain,
( sdtmndtasgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(125,plain,
( sdtmndtasgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| X3 != X1 ),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(130,plain,
( sdtmndtasgtdt0(X1,X2,X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(er,[status(thm)],[125,theory(equality)]) ).
cnf(205,negated_conjecture,
( aReductOfIn0(X1,xa,xR)
| ~ sdtmndtasgtdt0(esk9_3(xa,xR,X1),xR,xb)
| ~ aElement0(esk9_3(xa,xR,X1))
| ~ aRewritingSystem0(xR)
| ~ sdtmndtplgtdt0(xa,xR,X1)
| ~ aElement0(xa)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[24,79,theory(equality)]) ).
cnf(208,negated_conjecture,
( aReductOfIn0(X1,xa,xR)
| ~ sdtmndtasgtdt0(esk9_3(xa,xR,X1),xR,xb)
| ~ aElement0(esk9_3(xa,xR,X1))
| $false
| ~ sdtmndtplgtdt0(xa,xR,X1)
| ~ aElement0(xa)
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[205,111,theory(equality)]) ).
cnf(209,negated_conjecture,
( aReductOfIn0(X1,xa,xR)
| ~ sdtmndtasgtdt0(esk9_3(xa,xR,X1),xR,xb)
| ~ aElement0(esk9_3(xa,xR,X1))
| $false
| ~ sdtmndtplgtdt0(xa,xR,X1)
| $false
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[208,72,theory(equality)]) ).
cnf(210,negated_conjecture,
( aReductOfIn0(X1,xa,xR)
| ~ sdtmndtasgtdt0(esk9_3(xa,xR,X1),xR,xb)
| ~ aElement0(esk9_3(xa,xR,X1))
| ~ sdtmndtplgtdt0(xa,xR,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[209,theory(equality)]) ).
cnf(217,plain,
( sdtmndtasgtdt0(esk9_3(X1,X2,X3),X2,X3)
| aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(esk9_3(X1,X2,X3))
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[124,78,theory(equality)]) ).
cnf(2063,plain,
( sdtmndtasgtdt0(esk9_3(X1,X2,X3),X2,X3)
| aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[217,80]) ).
cnf(2066,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ aElement0(esk9_3(xa,xR,xb))
| ~ aElement0(xb)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xa) ),
inference(spm,[status(thm)],[210,2063,theory(equality)]) ).
cnf(2082,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| $false
| ~ aElement0(esk9_3(xa,xR,xb))
| ~ aElement0(xb)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xa) ),
inference(rw,[status(thm)],[2066,26,theory(equality)]) ).
cnf(2083,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| $false
| ~ aElement0(esk9_3(xa,xR,xb))
| $false
| ~ aRewritingSystem0(xR)
| ~ aElement0(xa) ),
inference(rw,[status(thm)],[2082,71,theory(equality)]) ).
cnf(2084,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| $false
| ~ aElement0(esk9_3(xa,xR,xb))
| $false
| $false
| ~ aElement0(xa) ),
inference(rw,[status(thm)],[2083,111,theory(equality)]) ).
cnf(2085,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| $false
| ~ aElement0(esk9_3(xa,xR,xb))
| $false
| $false
| $false ),
inference(rw,[status(thm)],[2084,72,theory(equality)]) ).
cnf(2086,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| ~ aElement0(esk9_3(xa,xR,xb)) ),
inference(cn,[status(thm)],[2085,theory(equality)]) ).
cnf(2112,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| ~ aRewritingSystem0(xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ aElement0(xa)
| ~ aElement0(xb) ),
inference(spm,[status(thm)],[2086,80,theory(equality)]) ).
cnf(2113,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| $false
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ aElement0(xa)
| ~ aElement0(xb) ),
inference(rw,[status(thm)],[2112,111,theory(equality)]) ).
cnf(2114,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| $false
| $false
| ~ aElement0(xa)
| ~ aElement0(xb) ),
inference(rw,[status(thm)],[2113,26,theory(equality)]) ).
cnf(2115,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| $false
| $false
| $false
| ~ aElement0(xb) ),
inference(rw,[status(thm)],[2114,72,theory(equality)]) ).
cnf(2116,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| $false
| $false
| $false
| $false ),
inference(rw,[status(thm)],[2115,71,theory(equality)]) ).
cnf(2117,negated_conjecture,
aReductOfIn0(xb,xa,xR),
inference(cn,[status(thm)],[2116,theory(equality)]) ).
cnf(2118,negated_conjecture,
( ~ sdtmndtasgtdt0(xb,xR,xb)
| ~ aElement0(xb) ),
inference(spm,[status(thm)],[24,2117,theory(equality)]) ).
cnf(2128,negated_conjecture,
( ~ sdtmndtasgtdt0(xb,xR,xb)
| $false ),
inference(rw,[status(thm)],[2118,71,theory(equality)]) ).
cnf(2129,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xb),
inference(cn,[status(thm)],[2128,theory(equality)]) ).
cnf(2157,negated_conjecture,
( ~ aRewritingSystem0(xR)
| ~ aElement0(xb) ),
inference(spm,[status(thm)],[2129,130,theory(equality)]) ).
cnf(2159,negated_conjecture,
( $false
| ~ aElement0(xb) ),
inference(rw,[status(thm)],[2157,111,theory(equality)]) ).
cnf(2160,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[2159,71,theory(equality)]) ).
cnf(2161,negated_conjecture,
$false,
inference(cn,[status(thm)],[2160,theory(equality)]) ).
cnf(2162,negated_conjecture,
$false,
2161,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/COM/COM016+1.p
% --creating new selector for []
% -running prover on /tmp/tmpMKXFPY/sel_COM016+1.p_1 with time limit 29
% -prover status Theorem
% Problem COM016+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/COM/COM016+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/COM/COM016+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
%
%------------------------------------------------------------------------------