| Back: | ⟨a, b, c | aab=a, caa=a⟩ |
|---|
Completion settings:
Axiom: aab=a.
Referenced by [4], [6], [7], [12].
Axiom: caa=a.
Axiom: abb=d.
Overlap of [1] aab=a with [3] abb=d:
Critical pair: ad=ab.
Flip LHS and RHS.
Referenced by [5], [6], [13], [14].
Overlap of [3] abb=d with [4] ab=ad:
Critical pair: adb=d.
Overlap of [2] caa=a with [1] aab=a:
Critical pair: ca=ab.
Reduce RHS:
| [4] | (ab) |
| ⇒ ad |
Referenced by [7], [8], [9], [10], [11], [15].
Overlap of [2] caa=a with [1] aab=a:
Critical pair: caa=aab.
Reduce LHS:
| [6] | (ca)a |
| ⇒ ada |
Reduce RHS:
| [1] | (aab) |
| ⇒ a |
Overlap of [2] caa=a with [5] adb=d:
Critical pair: cad=adb.
Reduce LHS:
| [6] | (ca)d |
| ⇒ add |
Reduce RHS:
| [5] | (adb) |
| ⇒ d |
Referenced by [9], [10], [11].
Overlap of [6] ca=ad with [5] adb=d:
Critical pair: cd=addb.
Reduce RHS:
| [8] | (add)b |
| ⇒ db |
Overlap of [6] ca=ad with [8] add=d:
Critical pair: cd=addd.
Reduce LHS:
| [9] | (cd) |
| ⇒ db |
Reduce RHS:
| [8] | (add)d |
| ⇒ dd |
Defines rule #1.
Referenced by [16].
Overlap of [6] ca=ad with [7] ada=a:
Critical pair: ca=adda.
Reduce LHS:
| [6] | (ca) |
| ⇒ ad |
Reduce RHS:
| [8] | (add)a |
| ⇒ da |
Defines rule #2.
Referenced by [12], [13], [14], [15].
Overlap of [7] ada=a with [1] aab=a:
Critical pair: ada=aab.
Reduce LHS:
| [11] | (ad)a |
| ⇒ daa |
Reduce RHS:
| [1] | (aab) |
| ⇒ a |
Defines rule #7.
Overlap of [3] abb=d with [4] ab=ad:
Critical pair: adb=d.
Reduce LHS:
| [11] | (ad)b |
| [4] | ⇒ d(ab) |
| [11] | ⇒ d(ad) |
| ⇒ dda |
Defines rule #6.
Simplify [4] ab=ad.
Reduce RHS:
| [11] | (ad) |
| ⇒ da |
Defines rule #3.
Simplify [6] ca=ad.
Reduce RHS:
| [11] | (ad) |
| ⇒ da |
Defines rule #5.
Simplify [9] cd=db.
Reduce RHS:
| [10] | (db) |
| ⇒ dd |
Defines rule #4.