TSTP Solution File: COM012+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : COM012+3 : TPTP v5.0.0. Released v4.0.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 05:45:34 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 12 unt; 0 def)
% Number of atoms : 254 ( 45 equ)
% Maximal formula atoms : 31 ( 6 avg)
% Number of connectives : 291 ( 74 ~; 114 |; 99 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 36 ( 0 sgn 17 !; 10 ?)
% 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/tmpMQXt5t/sel_COM012+3.p_1',mTCTrans) ).
fof(2,axiom,
( aElement0(xx)
& aRewritingSystem0(xR)
& aElement0(xy)
& aElement0(xz) ),
file('/tmp/tmpMQXt5t/sel_COM012+3.p_1',m__349) ).
fof(5,conjecture,
( ( ( xx = xy
| ( ( aReductOfIn0(xy,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xy) ) )
& sdtmndtplgtdt0(xx,xR,xy) ) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( xy = xz
| ( ( aReductOfIn0(xz,xy,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xy,xR)
& sdtmndtplgtdt0(X1,xR,xz) ) )
& sdtmndtplgtdt0(xy,xR,xz) ) )
& sdtmndtasgtdt0(xy,xR,xz) )
=> ( xx = xz
| aReductOfIn0(xz,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xz) )
| sdtmndtplgtdt0(xx,xR,xz)
| sdtmndtasgtdt0(xx,xR,xz) ) ),
file('/tmp/tmpMQXt5t/sel_COM012+3.p_1',m__) ).
fof(11,negated_conjecture,
~ ( ( ( xx = xy
| ( ( aReductOfIn0(xy,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xy) ) )
& sdtmndtplgtdt0(xx,xR,xy) ) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( xy = xz
| ( ( aReductOfIn0(xz,xy,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xy,xR)
& sdtmndtplgtdt0(X1,xR,xz) ) )
& sdtmndtplgtdt0(xy,xR,xz) ) )
& sdtmndtasgtdt0(xy,xR,xz) )
=> ( xx = xz
| aReductOfIn0(xz,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xz) )
| sdtmndtplgtdt0(xx,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,
( ( xx = xy
| ( ( aReductOfIn0(xy,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xy) ) )
& sdtmndtplgtdt0(xx,xR,xy) ) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( xy = xz
| ( ( aReductOfIn0(xz,xy,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xy,xR)
& sdtmndtplgtdt0(X1,xR,xz) ) )
& sdtmndtplgtdt0(xy,xR,xz) ) )
& sdtmndtasgtdt0(xy,xR,xz)
& xx != xz
& ~ aReductOfIn0(xz,xx,xR)
& ! [X1] :
( ~ aElement0(X1)
| ~ aReductOfIn0(X1,xx,xR)
| ~ sdtmndtplgtdt0(X1,xR,xz) )
& ~ sdtmndtplgtdt0(xx,xR,xz)
& ~ sdtmndtasgtdt0(xx,xR,xz) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(33,negated_conjecture,
( ( xx = xy
| ( ( aReductOfIn0(xy,xx,xR)
| ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,xx,xR)
& sdtmndtplgtdt0(X2,xR,xy) ) )
& sdtmndtplgtdt0(xx,xR,xy) ) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( xy = xz
| ( ( aReductOfIn0(xz,xy,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,xy,xR)
& sdtmndtplgtdt0(X3,xR,xz) ) )
& sdtmndtplgtdt0(xy,xR,xz) ) )
& sdtmndtasgtdt0(xy,xR,xz)
& xx != xz
& ~ aReductOfIn0(xz,xx,xR)
& ! [X4] :
( ~ aElement0(X4)
| ~ aReductOfIn0(X4,xx,xR)
| ~ sdtmndtplgtdt0(X4,xR,xz) )
& ~ sdtmndtplgtdt0(xx,xR,xz)
& ~ sdtmndtasgtdt0(xx,xR,xz) ),
inference(variable_rename,[status(thm)],[32]) ).
fof(34,negated_conjecture,
( ( xx = xy
| ( ( aReductOfIn0(xy,xx,xR)
| ( aElement0(esk2_0)
& aReductOfIn0(esk2_0,xx,xR)
& sdtmndtplgtdt0(esk2_0,xR,xy) ) )
& sdtmndtplgtdt0(xx,xR,xy) ) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( xy = xz
| ( ( aReductOfIn0(xz,xy,xR)
| ( aElement0(esk3_0)
& aReductOfIn0(esk3_0,xy,xR)
& sdtmndtplgtdt0(esk3_0,xR,xz) ) )
& sdtmndtplgtdt0(xy,xR,xz) ) )
& sdtmndtasgtdt0(xy,xR,xz)
& xx != xz
& ~ aReductOfIn0(xz,xx,xR)
& ! [X4] :
( ~ aElement0(X4)
| ~ aReductOfIn0(X4,xx,xR)
| ~ sdtmndtplgtdt0(X4,xR,xz) )
& ~ sdtmndtplgtdt0(xx,xR,xz)
& ~ sdtmndtasgtdt0(xx,xR,xz) ),
inference(skolemize,[status(esa)],[33]) ).
fof(35,negated_conjecture,
! [X4] :
( ( ~ aElement0(X4)
| ~ aReductOfIn0(X4,xx,xR)
| ~ sdtmndtplgtdt0(X4,xR,xz) )
& xx != xz
& ~ aReductOfIn0(xz,xx,xR)
& ~ sdtmndtplgtdt0(xx,xR,xz)
& ~ sdtmndtasgtdt0(xx,xR,xz)
& ( xx = xy
| ( ( aReductOfIn0(xy,xx,xR)
| ( aElement0(esk2_0)
& aReductOfIn0(esk2_0,xx,xR)
& sdtmndtplgtdt0(esk2_0,xR,xy) ) )
& sdtmndtplgtdt0(xx,xR,xy) ) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( xy = xz
| ( ( aReductOfIn0(xz,xy,xR)
| ( aElement0(esk3_0)
& aReductOfIn0(esk3_0,xy,xR)
& sdtmndtplgtdt0(esk3_0,xR,xz) ) )
& sdtmndtplgtdt0(xy,xR,xz) ) )
& sdtmndtasgtdt0(xy,xR,xz) ),
inference(shift_quantors,[status(thm)],[34]) ).
fof(36,negated_conjecture,
! [X4] :
( ( ~ aElement0(X4)
| ~ aReductOfIn0(X4,xx,xR)
| ~ sdtmndtplgtdt0(X4,xR,xz) )
& xx != xz
& ~ aReductOfIn0(xz,xx,xR)
& ~ sdtmndtplgtdt0(xx,xR,xz)
& ~ sdtmndtasgtdt0(xx,xR,xz)
& ( aElement0(esk2_0)
| aReductOfIn0(xy,xx,xR)
| xx = xy )
& ( aReductOfIn0(esk2_0,xx,xR)
| aReductOfIn0(xy,xx,xR)
| xx = xy )
& ( sdtmndtplgtdt0(esk2_0,xR,xy)
| aReductOfIn0(xy,xx,xR)
| xx = xy )
& ( sdtmndtplgtdt0(xx,xR,xy)
| xx = xy )
& sdtmndtasgtdt0(xx,xR,xy)
& ( aElement0(esk3_0)
| aReductOfIn0(xz,xy,xR)
| xy = xz )
& ( aReductOfIn0(esk3_0,xy,xR)
| aReductOfIn0(xz,xy,xR)
| xy = xz )
& ( sdtmndtplgtdt0(esk3_0,xR,xz)
| aReductOfIn0(xz,xy,xR)
| xy = xz )
& ( sdtmndtplgtdt0(xy,xR,xz)
| xy = xz )
& sdtmndtasgtdt0(xy,xR,xz) ),
inference(distribute,[status(thm)],[35]) ).
cnf(37,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(38,negated_conjecture,
( xy = xz
| sdtmndtplgtdt0(xy,xR,xz) ),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(42,negated_conjecture,
sdtmndtasgtdt0(xx,xR,xy),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(43,negated_conjecture,
( xx = xy
| sdtmndtplgtdt0(xx,xR,xy) ),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(47,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(48,negated_conjecture,
~ sdtmndtplgtdt0(xx,xR,xz),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(190,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,38,theory(equality)]) ).
cnf(195,negated_conjecture,
( sdtmndtplgtdt0(X1,xR,xz)
| xz = xy
| ~ sdtmndtplgtdt0(X1,xR,xy)
| $false
| ~ aElement0(xy)
| ~ aElement0(xz)
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[190,17,theory(equality)]) ).
cnf(196,negated_conjecture,
( sdtmndtplgtdt0(X1,xR,xz)
| xz = xy
| ~ sdtmndtplgtdt0(X1,xR,xy)
| $false
| $false
| ~ aElement0(xz)
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[195,16,theory(equality)]) ).
cnf(197,negated_conjecture,
( sdtmndtplgtdt0(X1,xR,xz)
| xz = xy
| ~ sdtmndtplgtdt0(X1,xR,xy)
| $false
| $false
| $false
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[196,15,theory(equality)]) ).
cnf(198,negated_conjecture,
( sdtmndtplgtdt0(X1,xR,xz)
| xz = xy
| ~ sdtmndtplgtdt0(X1,xR,xy)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[197,theory(equality)]) ).
cnf(408,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xx,xR,xz)
| xx = xy
| ~ aElement0(xx) ),
inference(spm,[status(thm)],[198,43,theory(equality)]) ).
cnf(412,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xx,xR,xz)
| xx = xy
| $false ),
inference(rw,[status(thm)],[408,18,theory(equality)]) ).
cnf(413,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xx,xR,xz)
| xx = xy ),
inference(cn,[status(thm)],[412,theory(equality)]) ).
cnf(414,negated_conjecture,
( xz = xy
| xx = xy ),
inference(sr,[status(thm)],[413,48,theory(equality)]) ).
cnf(424,negated_conjecture,
( xz = xy
| ~ sdtmndtasgtdt0(xy,xR,xz) ),
inference(spm,[status(thm)],[47,414,theory(equality)]) ).
cnf(427,negated_conjecture,
( xz = xy
| $false ),
inference(rw,[status(thm)],[424,37,theory(equality)]) ).
cnf(428,negated_conjecture,
xz = xy,
inference(cn,[status(thm)],[427,theory(equality)]) ).
cnf(432,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[47,428,theory(equality)]),42,theory(equality)]) ).
cnf(433,negated_conjecture,
$false,
inference(cn,[status(thm)],[432,theory(equality)]) ).
cnf(434,negated_conjecture,
$false,
433,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/COM/COM012+3.p
% --creating new selector for []
% -running prover on /tmp/tmpMQXt5t/sel_COM012+3.p_1 with time limit 29
% -prover status Theorem
% Problem COM012+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/COM/COM012+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/COM/COM012+3.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
%
%------------------------------------------------------------------------------