5-16-2019, 10:07 a.m.

OTSoft 2.5, release date 1/17/2017

1. Result

A ranking was found that generates the correct outputs.

Stratum	Constraint Name	Abbreviation
Stratum #1	*New Pi	*New Pi
	Ident(+ to -) in RNU	Ident(+ to -) in RNU
	*i u in RNU	*i u in RNU
Stratum #2	Ident(-B to +B)	Ident(-B to +B)
Stratum #3	*i u	*i u
Stratum #4	Ident(+B to -B)	Ident(+B to -B)
Stratum #5	Agree(back) in high	Agree(back) in high

2. Tableaux

/itu RB/:	*New Pi	Ident(+ to -) in RNU	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
☞   iti						*
itu					*!		*
utu				*!

/ipu/:	*New Pi	Ident(+ to -) in RNU	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
☞   ipu					*		*
upu				*!
ipi	*!					*

/pi/:	*New Pi	Ident(+ to -) in RNU	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
☞   pi
pu				*!

/uti/:	*New Pi	Ident(+ to -) in RNU	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
☞   uti							*
iti						*!
utu				*!

/[ i ] - u - u/:	*New Pi	Ident(+ to -) in RNU	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
☞   [ i ] - i - i						**
[ i ] - u - u					*!		*
[ u ] - u - u				*!

/[ i ] - pu/:	*New Pi	Ident(+ to -) in RNU	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
☞   [ i ] - pu					*		*
[ u ] - pu				*!
[ i ] - pi	*!					*

/[ i ] - a - u/:	*New Pi	Ident(+ to -) in RNU	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
☞   [ i ] - a - u
[ i ] - a - i						*!

/[ u ] - i /:	*New Pi	Ident(+ to -) in RNU	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
☞   [ u ] - i							*
[ i ] - i						*!
[ u ] - u				*!

/"[ u ] - { i, u }"/:	*New Pi	Ident(+ to -) in RNU	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
☞   [ u ] - u
[ u ] - i							*!
[ i ] - i						*!

/[ a i i ] - rnu SPECIAL/:	*New Pi	Ident(+ to -) in RNU	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
☞   [ a u u ] - rnu				**
[ a i i ] - rnu			*!		*		*
[ a i u ] - rnu			*!	*	*		*
[ a i i ] - rni		*!				*

3. Status of Proposed Constraints: Necessary or Unnecessary

Constraint	Status
*New Pi	Necessary
Ident(+ to -) in RNU	Necessary
Ident(-B to +B)	Necessary
*i u	Necessary
*i u in RNU	Necessary
Ident(+B to -B)	Necessary
Agree(back) in high	Necessary

4. Ranking Arguments, based on the Fusional Reduction Algorithm

This run sought to obtain the Skeletal Basis, intended to keep each final ranking argument as pithy as possible.

The final rankings obtained are as follows:

*i u in RNU >> Ident(-B to +B)
Ident(-B to +B) >> *i u
*i u >> Ident(+B to -B)
Ident(+B to -B) >> Agree(back) in high
Ident(+ to -) in RNU >> Ident(-B to +B)
*New Pi >> *i u

5. Mini-Tableaux

The following small tableaux may be useful in presenting ranking arguments. They include all winner-rival comparisons in which there is just one winner-preferring constraint and at least one loser-preferring constraint. Constraints not violated by either candidate are omitted.

/itu RB/:	Ident(-B to +B)	Ident(+B to -B)
☞   iti		*
utu	*

/ipu/:	Ident(-B to +B)	*i u	Agree(back) in high
☞   ipu		*	*
upu	*

/uti/:	Ident(-B to +B)	Agree(back) in high
☞   uti		*
utu	*

/uti/:	Ident(+B to -B)	Agree(back) in high
☞   uti		*
iti	*

/[ i ] - u - u/:	Ident(-B to +B)	Ident(+B to -B)
☞   [ i ] - i - i		**
[ u ] - u - u	*

/[ i ] - pu/:	Ident(-B to +B)	*i u	Agree(back) in high
☞   [ i ] - pu		*	*
[ u ] - pu	*

/[ u ] - i /:	Ident(-B to +B)	Agree(back) in high
☞   [ u ] - i		*
[ u ] - u	*

/[ u ] - i /:	Ident(+B to -B)	Agree(back) in high
☞   [ u ] - i		*
[ i ] - i	*