TSTP Solution File: COM012+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : COM012+1 : TPTP v5.0.0. Released v4.0.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 05:45:29 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 4
% Syntax : Number of formulae : 51 ( 11 unt; 0 def)
% Number of atoms : 223 ( 44 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 261 ( 89 ~; 147 |; 19 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 39 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3,X4] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3)
& aElement0(X4) )
=> ( ( sdtmndtplgtdt0(X1,X2,X3)
& sdtmndtplgtdt0(X3,X2,X4) )
=> sdtmndtplgtdt0(X1,X2,X4) ) ),
file('/tmp/tmp_V5FPl/sel_COM012+1.p_1',mTCTrans) ).
fof(2,axiom,
( aElement0(xx)
& aRewritingSystem0(xR)
& aElement0(xy)
& aElement0(xz) ),
file('/tmp/tmp_V5FPl/sel_COM012+1.p_1',m__349) ).
fof(5,conjecture,
( ( sdtmndtasgtdt0(xx,xR,xy)
& sdtmndtasgtdt0(xy,xR,xz) )
=> sdtmndtasgtdt0(xx,xR,xz) ),
file('/tmp/tmp_V5FPl/sel_COM012+1.p_1',m__) ).
fof(9,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtasgtdt0(X1,X2,X3)
<=> ( X1 = X3
| sdtmndtplgtdt0(X1,X2,X3) ) ) ),
file('/tmp/tmp_V5FPl/sel_COM012+1.p_1',mTCRDef) ).
fof(11,negated_conjecture,
~ ( ( sdtmndtasgtdt0(xx,xR,xy)
& sdtmndtasgtdt0(xy,xR,xz) )
=> sdtmndtasgtdt0(xx,xR,xz) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(12,plain,
! [X1,X2,X3,X4] :
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ sdtmndtplgtdt0(X3,X2,X4)
| sdtmndtplgtdt0(X1,X2,X4) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(13,plain,
! [X5,X6,X7,X8] :
( ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ sdtmndtplgtdt0(X7,X6,X8)
| sdtmndtplgtdt0(X5,X6,X8) ),
inference(variable_rename,[status(thm)],[12]) ).
cnf(14,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ sdtmndtplgtdt0(X4,X2,X3)
| ~ sdtmndtplgtdt0(X1,X2,X4)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(15,plain,
aElement0(xz),
inference(split_conjunct,[status(thm)],[2]) ).
cnf(16,plain,
aElement0(xy),
inference(split_conjunct,[status(thm)],[2]) ).
cnf(17,plain,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[2]) ).
cnf(18,plain,
aElement0(xx),
inference(split_conjunct,[status(thm)],[2]) ).
fof(32,negated_conjecture,
( sdtmndtasgtdt0(xx,xR,xy)
& sdtmndtasgtdt0(xy,xR,xz)
& ~ sdtmndtasgtdt0(xx,xR,xz) ),
inference(fof_nnf,[status(thm)],[11]) ).
cnf(33,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(34,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(35,negated_conjecture,
sdtmndtasgtdt0(xx,xR,xy),
inference(split_conjunct,[status(thm)],[32]) ).
fof(46,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)],[9]) ).
fof(47,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)],[46]) ).
fof(48,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)],[47]) ).
cnf(49,plain,
( sdtmndtasgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(51,plain,
( sdtmndtplgtdt0(X3,X2,X1)
| X3 = X1
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtasgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(57,negated_conjecture,
( xy = xx
| sdtmndtplgtdt0(xx,xR,xy)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xx)
| ~ aElement0(xy) ),
inference(spm,[status(thm)],[51,35,theory(equality)]) ).
cnf(58,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xy,xR,xz)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xy)
| ~ aElement0(xz) ),
inference(spm,[status(thm)],[51,34,theory(equality)]) ).
cnf(59,negated_conjecture,
( xy = xx
| sdtmndtplgtdt0(xx,xR,xy)
| $false
| ~ aElement0(xx)
| ~ aElement0(xy) ),
inference(rw,[status(thm)],[57,17,theory(equality)]) ).
cnf(60,negated_conjecture,
( xy = xx
| sdtmndtplgtdt0(xx,xR,xy)
| $false
| $false
| ~ aElement0(xy) ),
inference(rw,[status(thm)],[59,18,theory(equality)]) ).
cnf(61,negated_conjecture,
( xy = xx
| sdtmndtplgtdt0(xx,xR,xy)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[60,16,theory(equality)]) ).
cnf(62,negated_conjecture,
( xy = xx
| sdtmndtplgtdt0(xx,xR,xy) ),
inference(cn,[status(thm)],[61,theory(equality)]) ).
cnf(63,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xy,xR,xz)
| $false
| ~ aElement0(xy)
| ~ aElement0(xz) ),
inference(rw,[status(thm)],[58,17,theory(equality)]) ).
cnf(64,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xy,xR,xz)
| $false
| $false
| ~ aElement0(xz) ),
inference(rw,[status(thm)],[63,16,theory(equality)]) ).
cnf(65,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xy,xR,xz)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[64,15,theory(equality)]) ).
cnf(66,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xy,xR,xz) ),
inference(cn,[status(thm)],[65,theory(equality)]) ).
cnf(96,negated_conjecture,
( sdtmndtplgtdt0(X1,xR,xz)
| xz = xy
| ~ sdtmndtplgtdt0(X1,xR,xy)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xy)
| ~ aElement0(xz)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[14,66,theory(equality)]) ).
cnf(108,negated_conjecture,
( sdtmndtplgtdt0(X1,xR,xz)
| xz = xy
| ~ sdtmndtplgtdt0(X1,xR,xy)
| $false
| ~ aElement0(xy)
| ~ aElement0(xz)
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[96,17,theory(equality)]) ).
cnf(109,negated_conjecture,
( sdtmndtplgtdt0(X1,xR,xz)
| xz = xy
| ~ sdtmndtplgtdt0(X1,xR,xy)
| $false
| $false
| ~ aElement0(xz)
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[108,16,theory(equality)]) ).
cnf(110,negated_conjecture,
( sdtmndtplgtdt0(X1,xR,xz)
| xz = xy
| ~ sdtmndtplgtdt0(X1,xR,xy)
| $false
| $false
| $false
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[109,15,theory(equality)]) ).
cnf(111,negated_conjecture,
( sdtmndtplgtdt0(X1,xR,xz)
| xz = xy
| ~ sdtmndtplgtdt0(X1,xR,xy)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[110,theory(equality)]) ).
cnf(152,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xx,xR,xz)
| xx = xy
| ~ aElement0(xx) ),
inference(spm,[status(thm)],[111,62,theory(equality)]) ).
cnf(154,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xx,xR,xz)
| xx = xy
| $false ),
inference(rw,[status(thm)],[152,18,theory(equality)]) ).
cnf(155,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xx,xR,xz)
| xx = xy ),
inference(cn,[status(thm)],[154,theory(equality)]) ).
cnf(156,negated_conjecture,
( sdtmndtasgtdt0(xx,xR,xz)
| xx = xy
| xz = xy
| ~ aRewritingSystem0(xR)
| ~ aElement0(xx)
| ~ aElement0(xz) ),
inference(spm,[status(thm)],[49,155,theory(equality)]) ).
cnf(161,negated_conjecture,
( sdtmndtasgtdt0(xx,xR,xz)
| xx = xy
| xz = xy
| $false
| ~ aElement0(xx)
| ~ aElement0(xz) ),
inference(rw,[status(thm)],[156,17,theory(equality)]) ).
cnf(162,negated_conjecture,
( sdtmndtasgtdt0(xx,xR,xz)
| xx = xy
| xz = xy
| $false
| $false
| ~ aElement0(xz) ),
inference(rw,[status(thm)],[161,18,theory(equality)]) ).
cnf(163,negated_conjecture,
( sdtmndtasgtdt0(xx,xR,xz)
| xx = xy
| xz = xy
| $false
| $false
| $false ),
inference(rw,[status(thm)],[162,15,theory(equality)]) ).
cnf(164,negated_conjecture,
( sdtmndtasgtdt0(xx,xR,xz)
| xx = xy
| xz = xy ),
inference(cn,[status(thm)],[163,theory(equality)]) ).
cnf(165,negated_conjecture,
( xx = xy
| xz = xy ),
inference(sr,[status(thm)],[164,33,theory(equality)]) ).
cnf(184,negated_conjecture,
( xz = xy
| ~ sdtmndtasgtdt0(xy,xR,xz) ),
inference(spm,[status(thm)],[33,165,theory(equality)]) ).
cnf(186,negated_conjecture,
( xz = xy
| $false ),
inference(rw,[status(thm)],[184,34,theory(equality)]) ).
cnf(187,negated_conjecture,
xz = xy,
inference(cn,[status(thm)],[186,theory(equality)]) ).
cnf(191,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[33,187,theory(equality)]),35,theory(equality)]) ).
cnf(192,negated_conjecture,
$false,
inference(cn,[status(thm)],[191,theory(equality)]) ).
cnf(193,negated_conjecture,
$false,
192,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/COM/COM012+1.p
% --creating new selector for []
% -running prover on /tmp/tmp_V5FPl/sel_COM012+1.p_1 with time limit 29
% -prover status Theorem
% Problem COM012+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/COM/COM012+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/COM/COM012+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
%
%------------------------------------------------------------------------------