eyeling 1.13.0 → 1.13.2

package/examples/output/takeuchi.n3

@@ -1,3 +1,1005 @@
 @prefix : <https://eyereasoner.github.io/eye/reasoning#> .
 
-(8 4 2) :takeuchi 3 .
+(33 13 8) :needTak true .
+(12 8 34) :needTak true .
+(7 34 13) :needTak true .
+(7 34 13) :tak 13 .
+(32 13 8) :needTak true .
+(12 8 33) :needTak true .
+(7 33 13) :needTak true .
+(11 8 34) :needTak true .
+(7 34 12) :needTak true .
+(33 12 8) :needTak true .
+(7 33 13) :tak 13 .
+(7 34 12) :tak 12 .
+(31 13 8) :needTak true .
+(12 8 32) :needTak true .
+(7 32 13) :needTak true .
+(11 8 33) :needTak true .
+(7 33 12) :needTak true .
+(32 12 8) :needTak true .
+(10 8 34) :needTak true .
+(7 34 11) :needTak true .
+(33 11 8) :needTak true .
+(7 32 13) :tak 13 .
+(7 33 12) :tak 12 .
+(7 34 11) :tak 11 .
+(30 13 8) :needTak true .
+(12 8 31) :needTak true .
+(7 31 13) :needTak true .
+(11 8 32) :needTak true .
+(7 32 12) :needTak true .
+(31 12 8) :needTak true .
+(10 8 33) :needTak true .
+(7 33 11) :needTak true .
+(32 11 8) :needTak true .
+(9 8 34) :needTak true .
+(7 34 10) :needTak true .
+(33 10 8) :needTak true .
+(7 31 13) :tak 13 .
+(7 32 12) :tak 12 .
+(7 33 11) :tak 11 .
+(7 34 10) :tak 10 .
+(29 13 8) :needTak true .
+(12 8 30) :needTak true .
+(7 30 13) :needTak true .
+(11 8 31) :needTak true .
+(7 31 12) :needTak true .
+(30 12 8) :needTak true .
+(10 8 32) :needTak true .
+(7 32 11) :needTak true .
+(31 11 8) :needTak true .
+(9 8 33) :needTak true .
+(7 33 10) :needTak true .
+(32 10 8) :needTak true .
+(8 8 34) :needTak true .
+(7 34 9) :needTak true .
+(33 9 8) :needTak true .
+(7 30 13) :tak 13 .
+(7 31 12) :tak 12 .
+(7 32 11) :tak 11 .
+(7 33 10) :tak 10 .
+(8 8 34) :tak 34 .
+(7 34 9) :tak 9 .
+(28 13 8) :needTak true .
+(12 8 29) :needTak true .
+(7 29 13) :needTak true .
+(11 8 30) :needTak true .
+(7 30 12) :needTak true .
+(29 12 8) :needTak true .
+(10 8 31) :needTak true .
+(7 31 11) :needTak true .
+(30 11 8) :needTak true .
+(9 8 32) :needTak true .
+(7 32 10) :needTak true .
+(31 10 8) :needTak true .
+(8 8 33) :needTak true .
+(7 33 9) :needTak true .
+(32 9 8) :needTak true .
+(7 29 13) :tak 13 .
+(7 30 12) :tak 12 .
+(7 31 11) :tak 11 .
+(7 32 10) :tak 10 .
+(8 8 33) :tak 33 .
+(7 33 9) :tak 9 .
+(27 13 8) :needTak true .
+(12 8 28) :needTak true .
+(7 28 13) :needTak true .
+(11 8 29) :needTak true .
+(7 29 12) :needTak true .
+(28 12 8) :needTak true .
+(10 8 30) :needTak true .
+(7 30 11) :needTak true .
+(29 11 8) :needTak true .
+(9 8 31) :needTak true .
+(7 31 10) :needTak true .
+(30 10 8) :needTak true .
+(8 8 32) :needTak true .
+(7 32 9) :needTak true .
+(31 9 8) :needTak true .
+(7 28 13) :tak 13 .
+(7 29 12) :tak 12 .
+(7 30 11) :tak 11 .
+(7 31 10) :tak 10 .
+(8 8 32) :tak 32 .
+(7 32 9) :tak 9 .
+(26 13 8) :needTak true .
+(12 8 27) :needTak true .
+(7 27 13) :needTak true .
+(11 8 28) :needTak true .
+(7 28 12) :needTak true .
+(27 12 8) :needTak true .
+(10 8 29) :needTak true .
+(7 29 11) :needTak true .
+(28 11 8) :needTak true .
+(9 8 30) :needTak true .
+(7 30 10) :needTak true .
+(29 10 8) :needTak true .
+(8 8 31) :needTak true .
+(7 31 9) :needTak true .
+(30 9 8) :needTak true .
+(7 27 13) :tak 13 .
+(7 28 12) :tak 12 .
+(7 29 11) :tak 11 .
+(7 30 10) :tak 10 .
+(8 8 31) :tak 31 .
+(7 31 9) :tak 9 .
+(25 13 8) :needTak true .
+(12 8 26) :needTak true .
+(7 26 13) :needTak true .
+(11 8 27) :needTak true .
+(7 27 12) :needTak true .
+(26 12 8) :needTak true .
+(10 8 28) :needTak true .
+(7 28 11) :needTak true .
+(27 11 8) :needTak true .
+(9 8 29) :needTak true .
+(7 29 10) :needTak true .
+(28 10 8) :needTak true .
+(8 8 30) :needTak true .
+(7 30 9) :needTak true .
+(29 9 8) :needTak true .
+(7 26 13) :tak 13 .
+(7 27 12) :tak 12 .
+(7 28 11) :tak 11 .
+(7 29 10) :tak 10 .
+(8 8 30) :tak 30 .
+(7 30 9) :tak 9 .
+(24 13 8) :needTak true .
+(12 8 25) :needTak true .
+(7 25 13) :needTak true .
+(11 8 26) :needTak true .
+(7 26 12) :needTak true .
+(25 12 8) :needTak true .
+(10 8 27) :needTak true .
+(7 27 11) :needTak true .
+(26 11 8) :needTak true .
+(9 8 28) :needTak true .
+(7 28 10) :needTak true .
+(27 10 8) :needTak true .
+(8 8 29) :needTak true .
+(7 29 9) :needTak true .
+(28 9 8) :needTak true .
+(7 25 13) :tak 13 .
+(7 26 12) :tak 12 .
+(7 27 11) :tak 11 .
+(7 28 10) :tak 10 .
+(8 8 29) :tak 29 .
+(7 29 9) :tak 9 .
+(23 13 8) :needTak true .
+(12 8 24) :needTak true .
+(7 24 13) :needTak true .
+(11 8 25) :needTak true .
+(7 25 12) :needTak true .
+(24 12 8) :needTak true .
+(10 8 26) :needTak true .
+(7 26 11) :needTak true .
+(25 11 8) :needTak true .
+(9 8 27) :needTak true .
+(7 27 10) :needTak true .
+(26 10 8) :needTak true .
+(8 8 28) :needTak true .
+(7 28 9) :needTak true .
+(27 9 8) :needTak true .
+(7 24 13) :tak 13 .
+(7 25 12) :tak 12 .
+(7 26 11) :tak 11 .
+(7 27 10) :tak 10 .
+(8 8 28) :tak 28 .
+(7 28 9) :tak 9 .
+(22 13 8) :needTak true .
+(12 8 23) :needTak true .
+(7 23 13) :needTak true .
+(11 8 24) :needTak true .
+(7 24 12) :needTak true .
+(23 12 8) :needTak true .
+(10 8 25) :needTak true .
+(7 25 11) :needTak true .
+(24 11 8) :needTak true .
+(9 8 26) :needTak true .
+(7 26 10) :needTak true .
+(25 10 8) :needTak true .
+(8 8 27) :needTak true .
+(7 27 9) :needTak true .
+(26 9 8) :needTak true .
+(7 23 13) :tak 13 .
+(7 24 12) :tak 12 .
+(7 25 11) :tak 11 .
+(7 26 10) :tak 10 .
+(8 8 27) :tak 27 .
+(7 27 9) :tak 9 .
+(21 13 8) :needTak true .
+(12 8 22) :needTak true .
+(7 22 13) :needTak true .
+(11 8 23) :needTak true .
+(7 23 12) :needTak true .
+(22 12 8) :needTak true .
+(10 8 24) :needTak true .
+(7 24 11) :needTak true .
+(23 11 8) :needTak true .
+(9 8 25) :needTak true .
+(7 25 10) :needTak true .
+(24 10 8) :needTak true .
+(8 8 26) :needTak true .
+(7 26 9) :needTak true .
+(25 9 8) :needTak true .
+(7 22 13) :tak 13 .
+(7 23 12) :tak 12 .
+(7 24 11) :tak 11 .
+(7 25 10) :tak 10 .
+(8 8 26) :tak 26 .
+(7 26 9) :tak 9 .
+(20 13 8) :needTak true .
+(12 8 21) :needTak true .
+(7 21 13) :needTak true .
+(11 8 22) :needTak true .
+(7 22 12) :needTak true .
+(21 12 8) :needTak true .
+(10 8 23) :needTak true .
+(7 23 11) :needTak true .
+(22 11 8) :needTak true .
+(9 8 24) :needTak true .
+(7 24 10) :needTak true .
+(23 10 8) :needTak true .
+(8 8 25) :needTak true .
+(7 25 9) :needTak true .
+(24 9 8) :needTak true .
+(7 21 13) :tak 13 .
+(7 22 12) :tak 12 .
+(7 23 11) :tak 11 .
+(7 24 10) :tak 10 .
+(8 8 25) :tak 25 .
+(7 25 9) :tak 9 .
+(19 13 8) :needTak true .
+(12 8 20) :needTak true .
+(7 20 13) :needTak true .
+(11 8 21) :needTak true .
+(7 21 12) :needTak true .
+(20 12 8) :needTak true .
+(10 8 22) :needTak true .
+(7 22 11) :needTak true .
+(21 11 8) :needTak true .
+(9 8 23) :needTak true .
+(7 23 10) :needTak true .
+(22 10 8) :needTak true .
+(8 8 24) :needTak true .
+(7 24 9) :needTak true .
+(23 9 8) :needTak true .
+(7 20 13) :tak 13 .
+(7 21 12) :tak 12 .
+(7 22 11) :tak 11 .
+(7 23 10) :tak 10 .
+(8 8 24) :tak 24 .
+(7 24 9) :tak 9 .
+(18 13 8) :needTak true .
+(12 8 19) :needTak true .
+(7 19 13) :needTak true .
+(11 8 20) :needTak true .
+(7 20 12) :needTak true .
+(19 12 8) :needTak true .
+(10 8 21) :needTak true .
+(7 21 11) :needTak true .
+(20 11 8) :needTak true .
+(9 8 22) :needTak true .
+(7 22 10) :needTak true .
+(21 10 8) :needTak true .
+(8 8 23) :needTak true .
+(7 23 9) :needTak true .
+(22 9 8) :needTak true .
+(7 19 13) :tak 13 .
+(7 20 12) :tak 12 .
+(7 21 11) :tak 11 .
+(7 22 10) :tak 10 .
+(8 8 23) :tak 23 .
+(7 23 9) :tak 9 .
+(17 13 8) :needTak true .
+(12 8 18) :needTak true .
+(7 18 13) :needTak true .
+(11 8 19) :needTak true .
+(7 19 12) :needTak true .
+(18 12 8) :needTak true .
+(10 8 20) :needTak true .
+(7 20 11) :needTak true .
+(19 11 8) :needTak true .
+(9 8 21) :needTak true .
+(7 21 10) :needTak true .
+(20 10 8) :needTak true .
+(8 8 22) :needTak true .
+(7 22 9) :needTak true .
+(21 9 8) :needTak true .
+(7 18 13) :tak 13 .
+(7 19 12) :tak 12 .
+(7 20 11) :tak 11 .
+(7 21 10) :tak 10 .
+(8 8 22) :tak 22 .
+(7 22 9) :tak 9 .
+(16 13 8) :needTak true .
+(12 8 17) :needTak true .
+(7 17 13) :needTak true .
+(11 8 18) :needTak true .
+(7 18 12) :needTak true .
+(17 12 8) :needTak true .
+(10 8 19) :needTak true .
+(7 19 11) :needTak true .
+(18 11 8) :needTak true .
+(9 8 20) :needTak true .
+(7 20 10) :needTak true .
+(19 10 8) :needTak true .
+(8 8 21) :needTak true .
+(7 21 9) :needTak true .
+(20 9 8) :needTak true .
+(7 17 13) :tak 13 .
+(7 18 12) :tak 12 .
+(7 19 11) :tak 11 .
+(7 20 10) :tak 10 .
+(8 8 21) :tak 21 .
+(7 21 9) :tak 9 .
+(15 13 8) :needTak true .
+(12 8 16) :needTak true .
+(7 16 13) :needTak true .
+(11 8 17) :needTak true .
+(7 17 12) :needTak true .
+(16 12 8) :needTak true .
+(10 8 18) :needTak true .
+(7 18 11) :needTak true .
+(17 11 8) :needTak true .
+(9 8 19) :needTak true .
+(7 19 10) :needTak true .
+(18 10 8) :needTak true .
+(8 8 20) :needTak true .
+(7 20 9) :needTak true .
+(19 9 8) :needTak true .
+(7 16 13) :tak 13 .
+(7 17 12) :tak 12 .
+(7 18 11) :tak 11 .
+(7 19 10) :tak 10 .
+(8 8 20) :tak 20 .
+(7 20 9) :tak 9 .
+(14 13 8) :needTak true .
+(12 8 15) :needTak true .
+(7 15 13) :needTak true .
+(11 8 16) :needTak true .
+(7 16 12) :needTak true .
+(15 12 8) :needTak true .
+(10 8 17) :needTak true .
+(7 17 11) :needTak true .
+(16 11 8) :needTak true .
+(9 8 18) :needTak true .
+(7 18 10) :needTak true .
+(17 10 8) :needTak true .
+(8 8 19) :needTak true .
+(7 19 9) :needTak true .
+(18 9 8) :needTak true .
+(7 15 13) :tak 13 .
+(7 16 12) :tak 12 .
+(7 17 11) :tak 11 .
+(7 18 10) :tak 10 .
+(8 8 19) :tak 19 .
+(7 19 9) :tak 9 .
+(13 13 8) :needTak true .
+(12 8 14) :needTak true .
+(7 14 13) :needTak true .
+(11 8 15) :needTak true .
+(7 15 12) :needTak true .
+(14 12 8) :needTak true .
+(10 8 16) :needTak true .
+(7 16 11) :needTak true .
+(15 11 8) :needTak true .
+(9 8 17) :needTak true .
+(7 17 10) :needTak true .
+(16 10 8) :needTak true .
+(8 8 18) :needTak true .
+(7 18 9) :needTak true .
+(17 9 8) :needTak true .
+(13 13 8) :tak 8 .
+(7 14 13) :tak 13 .
+(7 15 12) :tak 12 .
+(7 16 11) :tak 11 .
+(7 17 10) :tak 10 .
+(8 8 18) :tak 18 .
+(7 18 9) :tak 9 .
+(11 8 14) :needTak true .
+(7 14 12) :needTak true .
+(13 12 8) :needTak true .
+(10 8 15) :needTak true .
+(7 15 11) :needTak true .
+(14 11 8) :needTak true .
+(9 8 16) :needTak true .
+(7 16 10) :needTak true .
+(15 10 8) :needTak true .
+(8 8 17) :needTak true .
+(7 17 9) :needTak true .
+(16 9 8) :needTak true .
+(7 14 12) :tak 12 .
+(7 15 11) :tak 11 .
+(7 16 10) :tak 10 .
+(8 8 17) :tak 17 .
+(7 17 9) :tak 9 .
+(10 8 14) :needTak true .
+(7 14 11) :needTak true .
+(13 11 8) :needTak true .
+(12 12 8) :needTak true .
+(11 8 13) :needTak true .
+(7 13 12) :needTak true .
+(9 8 15) :needTak true .
+(7 15 10) :needTak true .
+(14 10 8) :needTak true .
+(8 8 16) :needTak true .
+(7 16 9) :needTak true .
+(15 9 8) :needTak true .
+(7 14 11) :tak 11 .
+(12 12 8) :tak 8 .
+(7 13 12) :tak 12 .
+(7 15 10) :tak 10 .
+(8 8 16) :tak 16 .
+(7 16 9) :tak 9 .
+(9 8 14) :needTak true .
+(7 14 10) :needTak true .
+(13 10 8) :needTak true .
+(12 11 8) :needTak true .
+(10 8 13) :needTak true .
+(7 13 11) :needTak true .
+(8 8 15) :needTak true .
+(7 15 9) :needTak true .
+(14 9 8) :needTak true .
+(7 14 10) :tak 10 .
+(7 13 11) :tak 11 .
+(8 8 15) :tak 15 .
+(7 15 9) :tak 9 .
+(8 8 14) :needTak true .
+(7 14 9) :needTak true .
+(13 9 8) :needTak true .
+(12 10 8) :needTak true .
+(9 8 13) :needTak true .
+(7 13 10) :needTak true .
+(11 11 8) :needTak true .
+(10 8 12) :needTak true .
+(7 12 11) :needTak true .
+(8 8 14) :tak 14 .
+(7 14 9) :tak 9 .
+(7 13 10) :tak 10 .
+(11 11 8) :tak 8 .
+(7 12 11) :tak 11 .
+(12 9 8) :needTak true .
+(8 8 13) :needTak true .
+(7 13 9) :needTak true .
+(11 10 8) :needTak true .
+(9 8 12) :needTak true .
+(7 12 10) :needTak true .
+(8 8 13) :tak 13 .
+(7 13 9) :tak 9 .
+(7 12 10) :tak 10 .
+(11 9 8) :needTak true .
+(8 8 12) :needTak true .
+(7 12 9) :needTak true .
+(10 10 8) :needTak true .
+(9 8 11) :needTak true .
+(7 11 10) :needTak true .
+(8 8 12) :tak 12 .
+(7 12 9) :tak 9 .
+(10 10 8) :tak 8 .
+(7 11 10) :tak 10 .
+(10 9 8) :needTak true .
+(8 8 11) :needTak true .
+(7 11 9) :needTak true .
+(8 8 11) :tak 11 .
+(7 11 9) :tak 9 .
+(9 9 8) :needTak true .
+(8 8 10) :needTak true .
+(7 10 9) :needTak true .
+(9 9 8) :tak 8 .
+(8 8 10) :tak 10 .
+(7 10 9) :tak 9 .
+(8 10 9) :needTak true .
+(8 10 9) :tak 9 .
+(10 9 8) :tak 9 .
+(9 11 9) :needTak true .
+(11 9 9) :needTak true .
+(10 9 9) :needTak true .
+(8 9 11) :needTak true .
+(8 11 9) :needTak true .
+(9 11 9) :tak 9 .
+(8 9 11) :tak 11 .
+(8 11 9) :tak 9 .
+(11 9 8) :tak 9 .
+(9 9 9) :needTak true .
+(8 9 10) :needTak true .
+(9 9 9) :tak 9 .
+(8 9 10) :tak 10 .
+(9 12 9) :needTak true .
+(12 9 9) :needTak true .
+(9 10 9) :needTak true .
+(8 9 12) :needTak true .
+(8 12 9) :needTak true .
+(9 12 9) :tak 9 .
+(9 10 9) :tak 9 .
+(8 9 12) :tak 12 .
+(8 12 9) :tak 9 .
+(12 9 8) :tak 9 .
+(10 9 9) :tak 9 .
+(9 13 9) :needTak true .
+(13 9 9) :needTak true .
+(11 9 9) :tak 9 .
+(8 9 13) :needTak true .
+(8 13 9) :needTak true .
+(9 13 9) :tak 9 .
+(8 9 13) :tak 13 .
+(8 13 9) :tak 9 .
+(13 9 8) :tak 9 .
+(9 8 11) :tak 9 .
+(12 9 9) :tak 9 .
+(14 9 9) :needTak true .
+(9 14 9) :needTak true .
+(11 10 8) :tak 10 .
+(9 8 12) :tak 9 .
+(13 9 9) :tak 9 .
+(8 9 14) :needTak true .
+(8 14 9) :needTak true .
+(9 14 9) :tak 9 .
+(8 9 14) :tak 14 .
+(8 14 9) :tak 9 .
+(10 9 10) :needTak true .
+(9 10 10) :needTak true .
+(14 9 8) :tak 9 .
+(9 8 13) :tak 9 .
+(14 9 9) :tak 9 .
+(9 9 10) :needTak true .
+(8 10 10) :needTak true .
+(9 10 10) :tak 10 .
+(9 9 10) :tak 10 .
+(8 10 10) :tak 10 .
+(15 9 9) :needTak true .
+(9 15 9) :needTak true .
+(10 10 9) :needTak true .
+(9 8 14) :tak 9 .
+(10 8 12) :tak 10 .
+(8 9 15) :needTak true .
+(8 15 9) :needTak true .
+(9 15 9) :tak 9 .
+(10 10 9) :tak 9 .
+(8 9 15) :tak 15 .
+(8 15 9) :tak 9 .
+(8 10 11) :needTak true .
+(15 9 8) :tak 9 .
+(10 9 10) :tak 9 .
+(15 9 9) :tak 9 .
+(8 10 11) :tak 11 .
+(16 9 9) :needTak true .
+(9 16 9) :needTak true .
+(9 8 15) :tak 9 .
+(12 11 8) :tak 11 .
+(12 10 8) :tak 9 .
+(8 9 16) :needTak true .
+(8 16 9) :needTak true .
+(9 16 9) :tak 9 .
+(8 9 16) :tak 16 .
+(8 16 9) :tak 9 .
+(16 9 8) :tak 9 .
+(13 10 8) :tak 10 .
+(10 8 13) :tak 9 .
+(16 9 9) :tak 9 .
+(17 9 9) :needTak true .
+(9 17 9) :needTak true .
+(11 9 11) :needTak true .
+(9 11 11) :needTak true .
+(9 8 16) :tak 9 .
+(10 8 14) :tak 10 .
+(14 10 8) :tak 9 .
+(8 9 17) :needTak true .
+(8 17 9) :needTak true .
+(10 9 11) :needTak true .
+(8 11 11) :needTak true .
+(10 11 9) :needTak true .
+(9 17 9) :tak 9 .
+(9 11 11) :tak 11 .
+(8 9 17) :tak 17 .
+(8 17 9) :tak 9 .
+(8 11 11) :tak 11 .
+(10 11 9) :tak 9 .
+(17 9 8) :tak 9 .
+(10 8 15) :tak 9 .
+(15 10 8) :tak 10 .
+(11 8 13) :tak 11 .
+(17 9 9) :tak 9 .
+(9 9 11) :needTak true .
+(8 11 10) :needTak true .
+(9 9 11) :tak 11 .
+(8 11 10) :tak 10 .
+(18 9 9) :needTak true .
+(9 18 9) :needTak true .
+(8 11 12) :needTak true .
+(11 10 9) :needTak true .
+(10 8 16) :tak 10 .
+(9 8 17) :tak 9 .
+(16 10 8) :tak 9 .
+(8 9 18) :needTak true .
+(8 18 9) :needTak true .
+(9 18 9) :tak 9 .
+(8 11 12) :tak 12 .
+(8 9 18) :tak 18 .
+(8 18 9) :tak 9 .
+(9 11 10) :needTak true .
+(10 8 17) :tak 9 .
+(17 10 8) :tak 10 .
+(18 9 8) :tak 9 .
+(13 12 8) :tak 12 .
+(18 9 9) :tak 9 .
+(9 11 10) :tak 10 .
+(19 9 9) :needTak true .
+(9 19 9) :needTak true .
+(9 8 18) :tak 9 .
+(11 10 9) :tak 10 .
+(8 9 19) :needTak true .
+(8 19 9) :needTak true .
+(9 19 9) :tak 9 .
+(8 9 19) :tak 19 .
+(8 19 9) :tak 9 .
+(10 8 18) :tak 10 .
+(18 10 8) :tak 9 .
+(19 9 8) :tak 9 .
+(10 9 11) :tak 10 .
+(19 9 9) :tak 9 .
+(20 9 9) :needTak true .
+(9 20 9) :needTak true .
+(9 8 19) :tak 9 .
+(11 9 11) :tak 9 .
+(8 9 20) :needTak true .
+(8 20 9) :needTak true .
+(9 20 9) :tak 9 .
+(8 9 20) :tak 20 .
+(8 20 9) :tak 9 .
+(10 8 19) :tak 9 .
+(19 10 8) :tak 10 .
+(20 9 8) :tak 9 .
+(13 11 8) :tak 9 .
+(20 9 9) :tak 9 .
+(21 9 9) :needTak true .
+(9 21 9) :needTak true .
+(9 10 11) :needTak true .
+(9 8 20) :tak 9 .
+(11 8 14) :tak 9 .
+(8 9 21) :needTak true .
+(8 21 9) :needTak true .
+(9 21 9) :tak 9 .
+(9 10 11) :tak 11 .
+(8 9 21) :tak 21 .
+(8 21 9) :tak 9 .
+(9 12 12) :needTak true .
+(12 9 12) :needTak true .
+(10 8 20) :tak 10 .
+(20 10 8) :tak 9 .
+(21 9 8) :tak 9 .
+(14 11 8) :tak 11 .
+(21 9 9) :tak 9 .
+(11 9 12) :needTak true .
+(8 12 12) :needTak true .
+(11 12 9) :needTak true .
+(9 12 12) :tak 12 .
+(8 12 12) :tak 12 .
+(11 12 9) :tak 9 .
+(22 9 9) :needTak true .
+(9 22 9) :needTak true .
+(9 8 21) :tak 9 .
+(12 8 14) :tak 12 .
+(11 8 15) :tak 11 .
+(15 11 8) :tak 9 .
+(10 9 12) :needTak true .
+(8 12 11) :needTak true .
+(11 11 9) :needTak true .
+(8 9 22) :needTak true .
+(8 22 9) :needTak true .
+(9 22 9) :tak 9 .
+(8 12 11) :tak 11 .
+(11 11 9) :tak 9 .
+(8 9 22) :tak 22 .
+(8 22 9) :tak 9 .
+(8 12 13) :needTak true .
+(10 8 21) :tak 9 .
+(21 10 8) :tak 10 .
+(22 9 8) :tak 9 .
+(11 8 16) :tak 9 .
+(16 11 8) :tak 11 .
+(22 9 9) :tak 9 .
+(9 9 12) :needTak true .
+(8 12 10) :needTak true .
+(8 12 13) :tak 13 .
+(9 9 12) :tak 12 .
+(8 12 10) :tak 10 .
+(23 9 9) :needTak true .
+(9 23 9) :needTak true .
+(12 10 10) :needTak true .
+(9 8 22) :tak 9 .
+(11 8 17) :tak 11 .
+(17 11 8) :tak 9 .
+(14 13 8) :tak 13 .
+(8 9 23) :needTak true .
+(8 23 9) :needTak true .
+(11 10 10) :needTak true .
+(9 10 12) :needTak true .
+(9 12 10) :needTak true .
+(9 23 9) :tak 9 .
+(8 9 23) :tak 23 .
+(8 23 9) :tak 9 .
+(9 10 12) :tak 12 .
+(9 12 10) :tak 10 .
+(10 8 22) :tak 10 .
+(22 10 8) :tak 9 .
+(23 9 8) :tak 9 .
+(11 8 18) :tak 9 .
+(18 11 8) :tak 11 .
+(23 9 9) :tak 9 .
+(10 10 10) :needTak true .
+(10 10 10) :tak 10 .
+(24 9 9) :needTak true .
+(9 24 9) :needTak true .
+(10 11 10) :needTak true .
+(9 8 23) :tak 9 .
+(11 8 19) :tak 11 .
+(19 11 8) :tak 9 .
+(8 9 24) :needTak true .
+(8 24 9) :needTak true .
+(9 24 9) :tak 9 .
+(10 11 10) :tak 10 .
+(8 9 24) :tak 24 .
+(8 24 9) :tak 9 .
+(10 8 23) :tak 9 .
+(23 10 8) :tak 10 .
+(24 9 8) :tak 9 .
+(11 8 20) :tak 9 .
+(20 11 8) :tak 11 .
+(11 10 10) :tak 10 .
+(24 9 9) :tak 9 .
+(25 9 9) :needTak true .
+(9 25 9) :needTak true .
+(10 12 10) :needTak true .
+(9 8 24) :tak 9 .
+(11 8 21) :tak 11 .
+(21 11 8) :tak 9 .
+(8 9 25) :needTak true .
+(8 25 9) :needTak true .
+(9 25 9) :tak 9 .
+(10 12 10) :tak 10 .
+(8 9 25) :tak 25 .
+(8 25 9) :tak 9 .
+(10 8 24) :tak 10 .
+(24 10 8) :tak 9 .
+(25 9 8) :tak 9 .
+(11 8 22) :tak 9 .
+(22 11 8) :tak 11 .
+(12 10 10) :tak 10 .
+(25 9 9) :tak 9 .
+(26 9 9) :needTak true .
+(9 26 9) :needTak true .
+(11 8 23) :tak 11 .
+(23 11 8) :tak 9 .
+(9 8 25) :tak 9 .
+(10 9 12) :tak 10 .
+(8 9 26) :needTak true .
+(8 26 9) :needTak true .
+(9 26 9) :tak 9 .
+(8 9 26) :tak 26 .
+(8 26 9) :tak 9 .
+(11 8 24) :tak 9 .
+(10 8 25) :tak 9 .
+(24 11 8) :tak 11 .
+(25 10 8) :tak 10 .
+(26 9 8) :tak 9 .
+(11 9 12) :tak 9 .
+(26 9 9) :tak 9 .
+(27 9 9) :needTak true .
+(9 27 9) :needTak true .
+(11 8 25) :tak 11 .
+(25 11 8) :tak 9 .
+(9 8 26) :tak 9 .
+(12 9 12) :tak 9 .
+(8 9 27) :needTak true .
+(8 27 9) :needTak true .
+(9 27 9) :tak 9 .
+(8 9 27) :tak 27 .
+(8 27 9) :tak 9 .
+(10 8 26) :tak 10 .
+(26 10 8) :tak 9 .
+(27 9 8) :tak 9 .
+(14 12 8) :tak 9 .
+(27 9 9) :tak 9 .
+(28 9 9) :needTak true .
+(9 28 9) :needTak true .
+(9 11 12) :needTak true .
+(11 8 26) :tak 9 .
+(26 11 8) :tak 11 .
+(9 8 27) :tak 9 .
+(12 8 15) :tak 9 .
+(8 9 28) :needTak true .
+(8 28 9) :needTak true .
+(9 28 9) :tak 9 .
+(9 11 12) :tak 12 .
+(8 9 28) :tak 28 .
+(8 28 9) :tak 9 .
+(13 9 13) :needTak true .
+(10 8 27) :tak 9 .
+(27 10 8) :tak 10 .
+(28 9 8) :tak 9 .
+(15 12 8) :tak 12 .
+(28 9 9) :tak 9 .
+(12 9 13) :needTak true .
+(8 13 13) :needTak true .
+(12 13 9) :needTak true .
+(8 13 13) :tak 13 .
+(12 13 9) :tak 9 .
+(29 9 9) :needTak true .
+(9 29 9) :needTak true .
+(11 8 27) :tak 11 .
+(27 11 8) :tak 9 .
+(9 8 28) :tak 9 .
+(12 8 16) :tak 12 .
+(16 12 8) :tak 9 .
+(11 9 13) :needTak true .
+(8 13 12) :needTak true .
+(12 12 9) :needTak true .
+(8 9 29) :needTak true .
+(8 29 9) :needTak true .
+(9 29 9) :tak 9 .
+(8 13 12) :tak 12 .
+(12 12 9) :tak 9 .
+(8 9 29) :tak 29 .
+(8 29 9) :tak 9 .
+(10 8 28) :tak 10 .
+(28 10 8) :tak 9 .
+(29 9 8) :tak 9 .
+(12 8 17) :tak 9 .
+(17 12 8) :tak 12 .
+(29 9 9) :tak 9 .
+(10 9 13) :needTak true .
+(8 13 11) :needTak true .
+(12 11 9) :needTak true .
+(8 13 11) :tak 11 .
+(30 9 9) :needTak true .
+(9 30 9) :needTak true .
+(11 8 28) :tak 9 .
+(28 11 8) :tak 11 .
+(9 8 29) :tak 9 .
+(12 8 18) :tak 12 .
+(18 12 8) :tak 9 .
+(12 11 9) :tak 11 .
+(9 9 13) :needTak true .
+(8 13 10) :needTak true .
+(12 10 9) :needTak true .
+(8 9 30) :needTak true .
+(8 30 9) :needTak true .
+(9 30 9) :tak 9 .
+(9 9 13) :tak 13 .
+(8 13 10) :tak 10 .
+(8 9 30) :tak 30 .
+(8 30 9) :tak 9 .
+(10 8 29) :tak 9 .
+(29 10 8) :tak 10 .
+(30 9 8) :tak 9 .
+(12 8 19) :tak 9 .
+(19 12 8) :tak 12 .
+(30 9 9) :tak 9 .
+(12 10 9) :tak 10 .
+(31 9 9) :needTak true .
+(9 31 9) :needTak true .
+(13 10 10) :needTak true .
+(11 8 29) :tak 11 .
+(29 11 8) :tak 9 .
+(9 8 30) :tak 9 .
+(12 8 20) :tak 12 .
+(20 12 8) :tak 9 .
+(8 9 31) :needTak true .
+(8 31 9) :needTak true .
+(9 10 13) :needTak true .
+(9 13 10) :needTak true .
+(9 31 9) :tak 9 .
+(8 9 31) :tak 31 .
+(8 31 9) :tak 9 .
+(9 10 13) :tak 13 .
+(9 13 10) :tak 10 .
+(10 13 10) :needTak true .
+(10 8 30) :tak 10 .
+(30 10 8) :tak 9 .
+(31 9 8) :tak 9 .
+(12 8 21) :tak 9 .
+(21 12 8) :tak 12 .
+(31 9 9) :tak 9 .
+(10 13 10) :tak 10 .
+(32 9 9) :needTak true .
+(9 32 9) :needTak true .
+(11 8 30) :tak 9 .
+(30 11 8) :tak 11 .
+(9 8 31) :tak 9 .
+(12 8 22) :tak 12 .
+(22 12 8) :tak 9 .
+(13 10 10) :tak 10 .
+(8 9 32) :needTak true .
+(8 32 9) :needTak true .
+(9 32 9) :tak 9 .
+(8 9 32) :tak 32 .
+(8 32 9) :tak 9 .
+(10 8 31) :tak 9 .
+(31 10 8) :tak 10 .
+(32 9 8) :tak 9 .
+(12 8 23) :tak 9 .
+(23 12 8) :tak 12 .
+(10 9 13) :tak 10 .
+(32 9 9) :tak 9 .
+(33 9 9) :needTak true .
+(9 33 9) :needTak true .
+(10 11 11) :needTak true .
+(11 8 31) :tak 11 .
+(31 11 8) :tak 9 .
+(9 8 32) :tak 9 .
+(12 8 24) :tak 12 .
+(24 12 8) :tak 9 .
+(8 9 33) :needTak true .
+(8 33 9) :needTak true .
+(9 33 9) :tak 9 .
+(10 11 11) :tak 11 .
+(8 9 33) :tak 33 .
+(8 33 9) :tak 9 .
+(10 8 32) :tak 10 .
+(32 10 8) :tak 9 .
+(33 9 8) :tak 9 .
+(12 8 25) :tak 9 .
+(25 12 8) :tak 12 .
+(11 9 13) :tak 11 .
+(33 9 9) :tak 9 .
+(34 9 9) :needTak true .
+(11 8 32) :tak 9 .
+(32 11 8) :tak 11 .
+(9 8 33) :tak 9 .
+(12 8 26) :tak 12 .
+(26 12 8) :tak 9 .
+(12 9 13) :tak 9 .
+(8 9 34) :needTak true .
+(8 34 9) :needTak true .
+(8 9 34) :tak 34 .
+(8 34 9) :tak 9 .
+(9 34 9) :needTak true .
+(10 8 33) :tak 9 .
+(33 10 8) :tak 10 .
+(12 8 27) :tak 9 .
+(27 12 8) :tak 12 .
+(13 9 13) :tak 9 .
+(9 34 9) :tak 9 .
+(11 8 33) :tak 11 .
+(33 11 8) :tak 9 .
+(12 8 28) :tak 12 .
+(28 12 8) :tak 9 .
+(15 13 8) :tak 9 .
+(34 9 9) :tak 9 .
+(9 12 13) :needTak true .
+(9 8 34) :tak 9 .
+(12 8 29) :tak 9 .
+(29 12 8) :tak 12 .
+(9 12 13) :tak 13 .
+(10 8 34) :tak 10 .
+(12 8 30) :tak 12 .
+(30 12 8) :tak 9 .
+(16 13 8) :tak 13 .
+(11 8 34) :tak 9 .
+(12 8 31) :tak 9 .
+(31 12 8) :tak 12 .
+(17 13 8) :tak 9 .
+(12 8 32) :tak 12 .
+(32 12 8) :tak 9 .
+(18 13 8) :tak 13 .
+(12 8 33) :tak 9 .
+(33 12 8) :tak 12 .
+(19 13 8) :tak 9 .
+(12 8 34) :tak 12 .
+(20 13 8) :tak 13 .
+(21 13 8) :tak 9 .
+(22 13 8) :tak 13 .
+(23 13 8) :tak 9 .
+(24 13 8) :tak 13 .
+(25 13 8) :tak 9 .
+(26 13 8) :tak 13 .
+(27 13 8) :tak 9 .
+(28 13 8) :tak 13 .
+(29 13 8) :tak 9 .
+(30 13 8) :tak 13 .
+(31 13 8) :tak 9 .
+(32 13 8) :tak 13 .
+(33 13 8) :tak 9 .
+(34 13 8) :tak 13 .

package/examples/takeuchi.n3

@@ -10,20 +10,73 @@
 @prefix math: <http://www.w3.org/2000/10/swap/math#>.
 @prefix : <https://eyereasoner.github.io/eye/reasoning#>.
 
-{(?X ?Y ?Z) :tak ?Z} <= {
-    ?X math:notGreaterThan ?Y.
+# Forward/tabling style: compute only what’s reachable from :needTak.
+
+# Seed: only the call we want
+(34 13 8) :needTak true .
+
+# If a call is needed and X>Y, mark the three direct subcalls as needed
+{
+  (?X ?Y ?Z) :needTak true.
+  ?X math:greaterThan ?Y.
+  (?X 1) math:difference ?X1.
+  (?Y 1) math:difference ?Y1.
+  (?Z 1) math:difference ?Z1.
+}
+=>
+{
+  (?X1 ?Y ?Z) :needTak true.
+  (?Y1 ?Z ?X) :needTak true.
+  (?Z1 ?X ?Y) :needTak true.
+}.
+
+# Base case: if X<=Y then result is Z
+{
+  (?X ?Y ?Z) :needTak true.
+  ?X math:notGreaterThan ?Y.
+}
+=>
+{
+  (?X ?Y ?Z) :tak ?Z.
 }.
 
-{(?X ?Y ?Z) :tak ?A} <= {
-    ?X math:greaterThan ?Y.     # guard makes this clause disjoint from the base case
-    (?X 1) math:difference ?X1.
-    (?X1 ?Y ?Z) :tak ?A1.
-    (?Y 1) math:difference ?Y1.
-    (?Y1 ?Z ?X) :tak ?A2.
-    (?Z 1) math:difference ?Z1.
-    (?Z1 ?X ?Y) :tak ?A3.
-    (?A1 ?A2 ?A3) :tak ?A.
+# Once the three direct subcalls have results, we also need the “final call” tak(A1,A2,A3)
+{
+  (?X ?Y ?Z) :needTak true.
+  ?X math:greaterThan ?Y.
+
+  (?X 1) math:difference ?X1.
+  (?X1 ?Y ?Z) :tak ?A1.
+
+  (?Y 1) math:difference ?Y1.
+  (?Y1 ?Z ?X) :tak ?A2.
+
+  (?Z 1) math:difference ?Z1.
+  (?Z1 ?X ?Y) :tak ?A3.
+}
+=>
+{
+  (?A1 ?A2 ?A3) :needTak true.
+}.
+
+# Recursive case: if everything is known, tak(X,Y,Z) is tak(A1,A2,A3)
+{
+  (?X ?Y ?Z) :needTak true.
+  ?X math:greaterThan ?Y.
+
+  (?X 1) math:difference ?X1.
+  (?X1 ?Y ?Z) :tak ?A1.
+
+  (?Y 1) math:difference ?Y1.
+  (?Y1 ?Z ?X) :tak ?A2.
+
+  (?Z 1) math:difference ?Z1.
+  (?Z1 ?X ?Y) :tak ?A3.
+
+  (?A1 ?A2 ?A3) :tak ?A.
+}
+=>
+{
+  (?X ?Y ?Z) :tak ?A.
 }.
 
-# test
-{(8 4 2) :tak ?A} => {(8 4 2) :takeuchi ?A}.

package/eyeling.js

@@ -5306,8 +5306,50 @@ function alphaEqGraphTriples(xs, ys) {
 //   - __byHeadPred:   Map<headPredicateId, Rule[]>
 //   - __wildHeadPred: Rule[] (non-IRI head predicate)
 
+// Compound-term fast-key interning.
+// Used to index strict-ground list literals without relying on object identity.
+//
+// This is a major performance win for N3 programs that use compound terms
+// (especially lists) as subjects/objects, e.g. tabling-style encodings.
+const __compoundKeyToTid = new Map();
+// Use a negative id space so we never collide with __tid (which is positive).
+let __nextCompoundTid = -1;
+
+function __internCompoundTid(key) {
+  const hit = __compoundKeyToTid.get(key);
+  if (hit !== undefined) return hit;
+  const id = __nextCompoundTid--;
+  __compoundKeyToTid.set(key, id);
+  return id;
+}
+
 function termFastKey(t) {
+  // Atomic terms that already have a stable id.
   if (t instanceof Iri || t instanceof Blank || t instanceof Literal) return t.__tid;
+
+  // Structural fast key for strict-ground list terms.
+  // We only index when every element has a fast key; otherwise return null.
+  if (t instanceof ListTerm) {
+    const cached = t.__ftid;
+    if (cached !== undefined) return cached;
+
+    const xs = t.elems;
+    const parts = new Array(xs.length);
+    for (let i = 0; i < xs.length; i++) {
+      const k = termFastKey(xs[i]);
+      if (k === null) return null;
+      parts[i] = k;
+    }
+
+    // Use a compact separator; include length to avoid edge-case collisions.
+    const key = 'L' + xs.length + '\u0001' + parts.join('\u0001');
+    const id = __internCompoundTid(key);
+
+    // Cache on the list object itself (lists are immutable in Eyeling).
+    Object.defineProperty(t, '__ftid', { value: id, enumerable: false });
+    return id;
+  }
+
   return null;
 }
 
@@ -6334,6 +6376,26 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
           continue;
         }
 
+        // If this goal is already on the ancestor chain, avoid picking rules
+        // whose premises would immediately re-enter any already-visited goal.
+        // This cheap guard restores completeness for cases like issue #9 while
+        // still preventing trivial non-termination in mutually recursive rule
+        // cycles.
+        if (frame.goalWasVisited && rStd.premise && rStd.premise.length) {
+          let __cycle = false;
+          for (let i = 0; i < rStd.premise.length; i++) {
+            const premKey = __tripleKeyForVisited(applySubstTriple(rStd.premise[i], substMut));
+            if (visitedCounts.has(premKey)) {
+              __cycle = true;
+              break;
+            }
+          }
+          if (__cycle) {
+            undoTo(mark);
+            continue;
+          }
+        }
+
         const newGoals = rStd.premise.concat(frame.restGoals);
 
         const vMark = visitedTrail.length;
@@ -6464,8 +6526,23 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
     }
 
     // 2) Loop check for backward reasoning
+    //
+    // A strict ancestor loop check ("if visited then fail") is fast but
+    // incomplete. It breaks common Horn patterns where a goal appears again in
+    // a sibling branch and can still succeed via a different (non-cyclic) rule.
+    //
+    // Example (issue #9):
+    //   Human <= Woman.
+    //   Animal <= Human.
+    //   label <= Human, Animal.
+    // While proving Animal we need to re-prove Human, even though Human is an
+    // ancestor goal. EYE succeeds; a strict loop check prunes it.
+    //
+    // We therefore *allow* re-entering a visited goal, but when a goal is
+    // already visited we avoid applying backward rules whose premises would
+    // immediately re-enter any visited goal again (a cheap cycle guard).
     const goalKey = __tripleKeyForVisited(goal0);
-    if (visitedCounts.has(goalKey)) continue;
+    const goalWasVisited = visitedCounts.has(goalKey);
 
     // 3) Backward rules (indexed by head predicate) — explored first
     if (goal0.p instanceof Iri) {
@@ -6496,6 +6573,7 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
           curDepth: frame.curDepth,
           goalKey,
           goalPtid: goal0.p.__tid,
+          goalWasVisited,
         });
       }
     } else {

package/lib/engine.js

@@ -840,8 +840,50 @@ function alphaEqGraphTriples(xs, ys) {
 //   - __byHeadPred:   Map<headPredicateId, Rule[]>
 //   - __wildHeadPred: Rule[] (non-IRI head predicate)
 
+// Compound-term fast-key interning.
+// Used to index strict-ground list literals without relying on object identity.
+//
+// This is a major performance win for N3 programs that use compound terms
+// (especially lists) as subjects/objects, e.g. tabling-style encodings.
+const __compoundKeyToTid = new Map();
+// Use a negative id space so we never collide with __tid (which is positive).
+let __nextCompoundTid = -1;
+
+function __internCompoundTid(key) {
+  const hit = __compoundKeyToTid.get(key);
+  if (hit !== undefined) return hit;
+  const id = __nextCompoundTid--;
+  __compoundKeyToTid.set(key, id);
+  return id;
+}
+
 function termFastKey(t) {
+  // Atomic terms that already have a stable id.
   if (t instanceof Iri || t instanceof Blank || t instanceof Literal) return t.__tid;
+
+  // Structural fast key for strict-ground list terms.
+  // We only index when every element has a fast key; otherwise return null.
+  if (t instanceof ListTerm) {
+    const cached = t.__ftid;
+    if (cached !== undefined) return cached;
+
+    const xs = t.elems;
+    const parts = new Array(xs.length);
+    for (let i = 0; i < xs.length; i++) {
+      const k = termFastKey(xs[i]);
+      if (k === null) return null;
+      parts[i] = k;
+    }
+
+    // Use a compact separator; include length to avoid edge-case collisions.
+    const key = 'L' + xs.length + '\u0001' + parts.join('\u0001');
+    const id = __internCompoundTid(key);
+
+    // Cache on the list object itself (lists are immutable in Eyeling).
+    Object.defineProperty(t, '__ftid', { value: id, enumerable: false });
+    return id;
+  }
+
   return null;
 }
 
@@ -1868,6 +1910,26 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
           continue;
         }
 
+        // If this goal is already on the ancestor chain, avoid picking rules
+        // whose premises would immediately re-enter any already-visited goal.
+        // This cheap guard restores completeness for cases like issue #9 while
+        // still preventing trivial non-termination in mutually recursive rule
+        // cycles.
+        if (frame.goalWasVisited && rStd.premise && rStd.premise.length) {
+          let __cycle = false;
+          for (let i = 0; i < rStd.premise.length; i++) {
+            const premKey = __tripleKeyForVisited(applySubstTriple(rStd.premise[i], substMut));
+            if (visitedCounts.has(premKey)) {
+              __cycle = true;
+              break;
+            }
+          }
+          if (__cycle) {
+            undoTo(mark);
+            continue;
+          }
+        }
+
         const newGoals = rStd.premise.concat(frame.restGoals);
 
         const vMark = visitedTrail.length;
@@ -1998,8 +2060,23 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
     }
 
     // 2) Loop check for backward reasoning
+    //
+    // A strict ancestor loop check ("if visited then fail") is fast but
+    // incomplete. It breaks common Horn patterns where a goal appears again in
+    // a sibling branch and can still succeed via a different (non-cyclic) rule.
+    //
+    // Example (issue #9):
+    //   Human <= Woman.
+    //   Animal <= Human.
+    //   label <= Human, Animal.
+    // While proving Animal we need to re-prove Human, even though Human is an
+    // ancestor goal. EYE succeeds; a strict loop check prunes it.
+    //
+    // We therefore *allow* re-entering a visited goal, but when a goal is
+    // already visited we avoid applying backward rules whose premises would
+    // immediately re-enter any visited goal again (a cheap cycle guard).
     const goalKey = __tripleKeyForVisited(goal0);
-    if (visitedCounts.has(goalKey)) continue;
+    const goalWasVisited = visitedCounts.has(goalKey);
 
     // 3) Backward rules (indexed by head predicate) — explored first
     if (goal0.p instanceof Iri) {
@@ -2030,6 +2107,7 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
           curDepth: frame.curDepth,
           goalKey,
           goalPtid: goal0.p.__tid,
+          goalWasVisited,
         });
       }
     } else {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyeling",
-  "version": "1.13.0",
+  "version": "1.13.2",
   "description": "A minimal Notation3 (N3) reasoner in JavaScript.",
   "main": "./index.js",
   "keywords": [

package/test/api.test.js

@@ -984,6 +984,34 @@ ex:a p:trig ex:b.
       /:result\s+:query3\s+\(:path1\s+1\s+:b\)\s*\./,
     ],
   },
+
+  {
+    name: '57 issue #9: backward cycle with extra type guard should still derive label',
+    opt: { proofComments: false },
+    input: `@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
+@prefix ex: <http://example.org/ns#> .
+
+ex:w a ex:Woman .
+
+{
+  ?s a ex:Woman .
+  ?s ex:label ?label .
+} => {
+  ?s rdfs:label ?label .
+} .
+
+{ ?s a ex:Human } <= { ?s a ex:Woman } .
+{ ?s a ex:Animal } <= { ?s a ex:Human } .
+
+{ ?s ex:label "human being" } <= {
+  ?s a ex:Human .
+  ?s a ex:Animal .
+} .
+`,
+    expect: [
+      /(?:ex:w|<http:\/\/example\.org\/ns#w>)\s+(?:rdfs:label|<http:\/\/www\.w3\.org\/2000\/01\/rdf-schema#label>)\s+"human being"\s*\./,
+    ],
+  },
 ];
 
 let passed = 0;