L151cross domain unification

Domain a:
  - a3 feeds a2
  - a4 feeds a2
  - a2 feeds a1
  - a0 feeds a1
  - a0 feeds a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a1?

El dominio A es:
  - a3 alimenta a a2
  - a4 alimenta a a2
  - a2 alimenta a a1
  - a0 alimenta a a1
  - a0 alimenta a a4
El dominio B es:
  - b3 empuja b0
  - b0 empuja b1
  - b2 empuja b1
  - b2 empuja b3
  - b4 empuja b0
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a1?

领域A如下：
  - a3供给a2
  - a4供给a2
  - a2供给a1
  - a0供给a1
  - a0供给a4
领域B如下：
  - b3推动b0
  - b0推动b1
  - b2推动b1
  - b2推动b3
  - b4推动b0
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a1什么？

Domain a:
  - a3 a2 besler
  - a4 a2 besler
  - a2 a1 besler
  - a0 a1 besler
  - a0 a4 besler
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a1 ne?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a1 nini?

Domain a:
  - a3 feeds a2
  - a4 feeds a2
  - a2 feeds a1
  - a0 feeds a1
  - a0 feeds a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a1?

{domain_a: [(feeds a3 a2) (feeds a4 a2) (feeds a2 a1) (feeds a0 a1) (feeds a0 a4)], domain_b: [(pushes b3 b0) (pushes b0 b1) (pushes b2 b1) (pushes b2 b3) (pushes b4 b0)], query: (corresponds_to a1), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a3 ernähren a2
  - a4 ernähren a2
  - a2 ernähren a1
  - a0 ernähren a1
  - a0 ernähren a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a1?

Domain a:
  - a3 хранити a2
  - a4 хранити a2
  - a2 хранити a1
  - a0 хранити a1
  - a0 хранити a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a1 kakav?

Määrittelyjoukko aa:
  - a3 syöttää a2
  - a4 syöttää a2
  - a2 syöttää a1
  - a0 syöttää a1
  - a0 syöttää a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a1?

领域A如下：
  - a3供给a2
  - a4供给a2
  - a2供给a1
  - a0供给a1
  - a0供给a4
领域B如下：
  - b3推动b0
  - b0推动b1
  - b2推动b1
  - b2推动b3
  - b4推动b0
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a1什么？

定義域エー:
  - a3a2食べさせる
  - a4a2食べさせる
  - a2a1食べさせる
  - a0a1食べさせる
  - a0a4食べさせる
domain b:
  - b3b0pushes
  - b0b1pushes
  - b2b1pushes
  - b2b3pushes
  - b4b0pushes
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a1何と?

Domain a:
  - a3 a2 besler
  - a4 a2 besler
  - a2 a1 besler
  - a0 a1 besler
  - a0 a4 besler
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a1 ne?

نِطَاق إِي:
  - أَطْعَمَ a3 a2
  - أَطْعَمَ a4 a2
  - أَطْعَمَ a2 a1
  - أَطْعَمَ a0 a1
  - أَطْعَمَ a0 a4
domain b:
  - pushes b3 b0
  - pushes b0 b1
  - pushes b2 b1
  - pushes b2 b3
  - pushes b4 b0
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a1 مَاذَا؟

Domain a:
  - a3 a2 კვება
  - a4 a2 კვება
  - a2 a1 კვება
  - a0 a1 კვება
  - a0 a4 კვება
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a1 რა?

Domain a:
  - feed a3 a2
  - feed a4 a2
  - feed a2 a1
  - feed a0 a1
  - feed a0 a4
Domain b:
  - pushes b3 b0
  - pushes b0 b1
  - pushes b2 b1
  - pushes b2 b3
  - pushes b4 b0
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a1 unutai?

Domain a:
  - a3 cho ăn a2
  - a4 cho ăn a2
  - a2 cho ăn a1
  - a0 cho ăn a1
  - a0 cho ăn a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a1 gì?

เขตเอ:
  - a3ขุนa2
  - a4ขุนa2
  - a2ขุนa1
  - a0ขุนa1
  - a0ขุนa4
domain b:
  - b3pushesb0
  - b0pushesb1
  - b2pushesb1
  - b2pushesb3
  - b4pushesb0
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a1อะไร?

domain a:
  - a3 a2 ஊட்டு
  - a4 a2 ஊட்டு
  - a2 a1 ஊட்டு
  - a0 a1 ஊட்டு
  - a0 a4 ஊட்டு
domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a1 என்ன?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a1 nini?

Domain a:
  - a3 a2 feed
  - a4 a2 feed
  - a2 a1 feed
  - a0 a1 feed
  - a0 a4 feed
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a1 haʼátʼíísh?

Domain a:
  - a3 a2 feed
  - a4 a2 feed
  - a2 a1 feed
  - a0 a1 feed
  - a0 a4 feed
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a1 what?

Domain a:
  - a3 xam a2
  - a4 xam a2
  - a2 xam a1
  - a0 xam a1
  - a0 xam a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a1 kwèch?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a1 фу?

정의역 에이:
  - a3 a2 먹이다
  - a4 a2 먹이다
  - a2 a1 먹이다
  - a0 a1 먹이다
  - a0 a4 먹이다
domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a1 무엇?

Domain a:
  - a3 a2 elikatu
  - a4 a2 elikatu
  - a2 a1 elikatu
  - a0 a1 elikatu
  - a0 a4 elikatu
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a1 zer?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a1?

Domain a:
  - a3 qaray a2
  - a4 qaray a2
  - a2 qaray a1
  - a0 qaray a1
  - a0 qaray a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a1 what?

Domain a:
  - a3 a2 feed
  - a4 a2 feed
  - a2 a1 feed
  - a0 a1 feed
  - a0 a4 feed
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a1 сыд?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a1 ining-jak?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a1 nanta?

Domain a:
  - a3 a2 feed
  - a4 a2 feed
  - a2 a1 feed
  - a0 a1 feed
  - a0 a4 feed
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a1 híli?

Domain a:
  - a3 a2 feed
  - a4 a2 feed
  - a2 a1 feed
  - a0 a1 feed
  - a0 a4 feed
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 a2 feed
  - a4 a2 feed
  - a2 a1 feed
  - a0 a1 feed
  - a0 a4 feed
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 a2 feed
  - a4 a2 feed
  - a2 a1 feed
  - a0 a1 feed
  - a0 a4 feed
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a1 what?

Domain a:
  - a3 a2 feed
  - a4 a2 feed
  - a2 a1 feed
  - a0 a1 feed
  - a0 a4 feed
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a1 tay?

Domain a :
  - a3 nourrir a2
  - a4 nourrir a2
  - a2 nourrir a1
  - a0 nourrir a1
  - a0 nourrir a4
Domain b :
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a1 ?

Domain a:
  - a3 manĝigi a2
  - a4 manĝigi a2
  - a2 manĝigi a1
  - a0 manĝigi a1
  - a0 manĝigi a4
Fonta aro bit:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a1 kio?

Domain a:
  - a3 etet a2
  - a4 etet a2
  - a2 etet a1
  - a0 etet a1
  - a0 etet a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a1 melyik?

domain a:
  - a3飼料a2
  - a4飼料a2
  - a2飼料a1
  - a0飼料a1
  - a0飼料a4
domain b:
  - b3pushesb0
  - b0pushesb1
  - b2pushesb1
  - b2pushesb3
  - b4pushesb0
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a1乜嘢?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 тамақтандыру a2
  - a4 тамақтандыру a2
  - a2 тамақтандыру a1
  - a0 тамақтандыру a1
  - a0 тамақтандыру a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a1 не?

תְּחוּם איי:
  - a3 האכיל a2
  - a4 האכיל a2
  - a2 האכיל a1
  - a0 האכיל a1
  - a0 האכיל a4
domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a1?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 memberi makan a2
  - a4 memberi makan a2
  - a2 memberi makan a1
  - a0 memberi makan a1
  - a0 memberi makan a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a1 apa?

វិស័យអេ:
  - a3ចិញ្ចឹមa2
  - a4ចិញ្ចឹមa2
  - a2ចិញ្ចឹមa1
  - a0ចិញ្ចឹមa1
  - a0ចិញ្ចឹមa4
domain b:
  - b3pushesb0
  - b0pushesb1
  - b2pushesb1
  - b2pushesb3
  - b4pushesb0
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a1អី?

domain a:
  - a3feeda2
  - a4feeda2
  - a2feeda1
  - a0feeda1
  - a0feeda4
domain b:
  - b3pushesb0
  - b0pushesb1
  - b2pushesb1
  - b2pushesb3
  - b4pushesb0
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a1ຫຍັງ?

domain a:
  - a3 a2 తినిపించు
  - a4 a2 తినిపించు
  - a2 a1 తినిపించు
  - a0 a1 తినిపించు
  - a0 a4 తినిపించు
domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a1 ఏమిటి?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a1?

Domain a:
  - a3 a2 feed
  - a4 a2 feed
  - a2 a1 feed
  - a0 a1 feed
  - a0 a4 feed
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a1 what?

domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 feed a2
  - a4 feed a2
  - a2 feed a1
  - a0 feed a1
  - a0 feed a4
Domain b:
  - b3 pushes b0
  - b0 pushes b1
  - b2 pushes b1
  - b2 pushes b3
  - b4 pushes b0
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a3 a2 feed
  - a4 a2 feed
  - a2 a1 feed
  - a0 a1 feed
  - a0 a4 feed
Domain b:
  - b3 b0 pushes
  - b0 b1 pushes
  - b2 b1 pushes
  - b2 b3 pushes
  - b4 b0 pushes
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a1 вуч?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feeds b1
  - b2 feeds b3
  - b4 feeds b0
  - b2 feeds b4
  - b4 feeds b1
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a1?

El dominio A es:
  - a1 empuja a3
  - a4 empuja a2
  - a0 empuja a4
  - a1 empuja a0
  - a0 empuja a2
El dominio B es:
  - b0 alimenta a b1
  - b2 alimenta a b3
  - b4 alimenta a b0
  - b2 alimenta a b4
  - b4 alimenta a b1
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a1?

领域A如下：
  - a1推动a3
  - a4推动a2
  - a0推动a4
  - a1推动a0
  - a0推动a2
领域B如下：
  - b0供给b1
  - b2供给b3
  - b4供给b0
  - b2供给b4
  - b4供给b1
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a1什么？

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 besler
  - b2 b3 besler
  - b4 b0 besler
  - b2 b4 besler
  - b4 b1 besler
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a1 ne?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a1 nini?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feeds b1
  - b2 feeds b3
  - b4 feeds b0
  - b2 feeds b4
  - b4 feeds b1
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a1?

{domain_a: [(pushes a1 a3) (pushes a4 a2) (pushes a0 a4) (pushes a1 a0) (pushes a0 a2)], domain_b: [(feeds b0 b1) (feeds b2 b3) (feeds b4 b0) (feeds b2 b4) (feeds b4 b1)], query: (corresponds_to a1), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 ernähren b1
  - b2 ernähren b3
  - b4 ernähren b0
  - b2 ernähren b4
  - b4 ernähren b1
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a1?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 хранити b1
  - b2 хранити b3
  - b4 хранити b0
  - b2 хранити b4
  - b4 хранити b1
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a1 kakav?

Määrittelyjoukko aa:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 syöttää b1
  - b2 syöttää b3
  - b4 syöttää b0
  - b2 syöttää b4
  - b4 syöttää b1
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a1?

领域A如下：
  - a1推动a3
  - a4推动a2
  - a0推动a4
  - a1推动a0
  - a0推动a2
领域B如下：
  - b0供给b1
  - b2供给b3
  - b4供给b0
  - b2供给b4
  - b4供给b1
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a1什么？

定義域エー:
  - a1a3pushes
  - a4a2pushes
  - a0a4pushes
  - a1a0pushes
  - a0a2pushes
domain b:
  - b0b1食べさせる
  - b2b3食べさせる
  - b4b0食べさせる
  - b2b4食べさせる
  - b4b1食べさせる
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a1何と?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 besler
  - b2 b3 besler
  - b4 b0 besler
  - b2 b4 besler
  - b4 b1 besler
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a1 ne?

نِطَاق إِي:
  - pushes a1 a3
  - pushes a4 a2
  - pushes a0 a4
  - pushes a1 a0
  - pushes a0 a2
domain b:
  - أَطْعَمَ b0 b1
  - أَطْعَمَ b2 b3
  - أَطْعَمَ b4 b0
  - أَطْعَمَ b2 b4
  - أَطْعَمَ b4 b1
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a1 مَاذَا؟

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 კვება
  - b2 b3 კვება
  - b4 b0 კვება
  - b2 b4 კვება
  - b4 b1 კვება
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a1 რა?

Domain a:
  - pushes a1 a3
  - pushes a4 a2
  - pushes a0 a4
  - pushes a1 a0
  - pushes a0 a2
Domain b:
  - feed b0 b1
  - feed b2 b3
  - feed b4 b0
  - feed b2 b4
  - feed b4 b1
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a1 unutai?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 cho ăn b1
  - b2 cho ăn b3
  - b4 cho ăn b0
  - b2 cho ăn b4
  - b4 cho ăn b1
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a1 gì?

เขตเอ:
  - a1pushesa3
  - a4pushesa2
  - a0pushesa4
  - a1pushesa0
  - a0pushesa2
domain b:
  - b0ขุนb1
  - b2ขุนb3
  - b4ขุนb0
  - b2ขุนb4
  - b4ขุนb1
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a1อะไร?

domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
domain b:
  - b0 b1 ஊட்டு
  - b2 b3 ஊட்டு
  - b4 b0 ஊட்டு
  - b2 b4 ஊட்டு
  - b4 b1 ஊட்டு
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a1 என்ன?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a1 nini?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 feed
  - b2 b3 feed
  - b4 b0 feed
  - b2 b4 feed
  - b4 b1 feed
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a1 haʼátʼíísh?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 feed
  - b2 b3 feed
  - b4 b0 feed
  - b2 b4 feed
  - b4 b1 feed
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 xam b1
  - b2 xam b3
  - b4 xam b0
  - b2 xam b4
  - b4 xam b1
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a1 kwèch?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a1 фу?

정의역 에이:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
domain b:
  - b0 b1 먹이다
  - b2 b3 먹이다
  - b4 b0 먹이다
  - b2 b4 먹이다
  - b4 b1 먹이다
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a1 무엇?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 elikatu
  - b2 b3 elikatu
  - b4 b0 elikatu
  - b2 b4 elikatu
  - b4 b1 elikatu
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a1 zer?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a1?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 qaray b1
  - b2 qaray b3
  - b4 qaray b0
  - b2 qaray b4
  - b4 qaray b1
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a1 what?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 feed
  - b2 b3 feed
  - b4 b0 feed
  - b2 b4 feed
  - b4 b1 feed
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a1 сыд?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a1 ining-jak?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a1 nanta?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 feed
  - b2 b3 feed
  - b4 b0 feed
  - b2 b4 feed
  - b4 b1 feed
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a1 híli?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 feed
  - b2 b3 feed
  - b4 b0 feed
  - b2 b4 feed
  - b4 b1 feed
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 feed
  - b2 b3 feed
  - b4 b0 feed
  - b2 b4 feed
  - b4 b1 feed
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 feed
  - b2 b3 feed
  - b4 b0 feed
  - b2 b4 feed
  - b4 b1 feed
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a1 what?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 feed
  - b2 b3 feed
  - b4 b0 feed
  - b2 b4 feed
  - b4 b1 feed
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a1 tay?

Domain a :
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b :
  - b0 nourrir b1
  - b2 nourrir b3
  - b4 nourrir b0
  - b2 nourrir b4
  - b4 nourrir b1
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a1 ?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Fonta aro bit:
  - b0 manĝigi b1
  - b2 manĝigi b3
  - b4 manĝigi b0
  - b2 manĝigi b4
  - b4 manĝigi b1
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a1 kio?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 etet b1
  - b2 etet b3
  - b4 etet b0
  - b2 etet b4
  - b4 etet b1
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a1 melyik?

domain a:
  - a1pushesa3
  - a4pushesa2
  - a0pushesa4
  - a1pushesa0
  - a0pushesa2
domain b:
  - b0飼料b1
  - b2飼料b3
  - b4飼料b0
  - b2飼料b4
  - b4飼料b1
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a1乜嘢?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 тамақтандыру b1
  - b2 тамақтандыру b3
  - b4 тамақтандыру b0
  - b2 тамақтандыру b4
  - b4 тамақтандыру b1
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a1 не?

תְּחוּם איי:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
domain b:
  - b0 האכיל b1
  - b2 האכיל b3
  - b4 האכיל b0
  - b2 האכיל b4
  - b4 האכיל b1
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a1?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 memberi makan b1
  - b2 memberi makan b3
  - b4 memberi makan b0
  - b2 memberi makan b4
  - b4 memberi makan b1
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a1 apa?

វិស័យអេ:
  - a1pushesa3
  - a4pushesa2
  - a0pushesa4
  - a1pushesa0
  - a0pushesa2
domain b:
  - b0ចិញ្ចឹមb1
  - b2ចិញ្ចឹមb3
  - b4ចិញ្ចឹមb0
  - b2ចិញ្ចឹមb4
  - b4ចិញ្ចឹមb1
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a1អី?

domain a:
  - a1pushesa3
  - a4pushesa2
  - a0pushesa4
  - a1pushesa0
  - a0pushesa2
domain b:
  - b0feedb1
  - b2feedb3
  - b4feedb0
  - b2feedb4
  - b4feedb1
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a1ຫຍັງ?

domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
domain b:
  - b0 b1 తినిపించు
  - b2 b3 తినిపించు
  - b4 b0 తినిపించు
  - b2 b4 తినిపించు
  - b4 b1 తినిపించు
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a1 ఏమిటి?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a1?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 feed
  - b2 b3 feed
  - b4 b0 feed
  - b2 b4 feed
  - b4 b1 feed
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a1 what?

domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 pushes a3
  - a4 pushes a2
  - a0 pushes a4
  - a1 pushes a0
  - a0 pushes a2
Domain b:
  - b0 feed b1
  - b2 feed b3
  - b4 feed b0
  - b2 feed b4
  - b4 feed b1
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a1 a3 pushes
  - a4 a2 pushes
  - a0 a4 pushes
  - a1 a0 pushes
  - a0 a2 pushes
Domain b:
  - b0 b1 feed
  - b2 b3 feed
  - b4 b0 feed
  - b2 b4 feed
  - b4 b1 feed
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a1 вуч?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a3?

El dominio A es:
  - a3 impulsa a0
  - a3 impulsa a2
  - a2 impulsa a0
  - a1 impulsa a0
  - a3 impulsa a1
  - a4 impulsa a0
  - a4 impulsa a1
El dominio B es:
  - b2 fluye hacia b3
  - b4 fluye hacia b3
  - b4 fluye hacia b0
  - b2 fluye hacia b1
  - b0 fluye hacia b1
  - b3 fluye hacia b1
  - b4 fluye hacia b1
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a3?

领域A如下：
  - a3驱动a0
  - a3驱动a2
  - a2驱动a0
  - a1驱动a0
  - a3驱动a1
  - a4驱动a0
  - a4驱动a1
领域B如下：
  - b2流向b3
  - b4流向b3
  - b4流向b0
  - b2流向b1
  - b0流向b1
  - b3流向b1
  - b4流向b1
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a3什么？

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a3 ne?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a3 nini?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a3?

{domain_a: [(drives a3 a0) (drives a3 a2) (drives a2 a0) (drives a1 a0) (drives a3 a1) (drives a4 a0) (drives a4 a1)], domain_b: [(flows_to b2 b3) (flows_to b4 b3) (flows_to b4 b0) (flows_to b2 b1) (flows_to b0 b1) (flows_to b3 b1) (flows_to b4 b1)], query: (corresponds_to a3), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a3?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a3 kakav?

Määrittelyjoukko aa:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a3?

领域A如下：
  - a3驱动a0
  - a3驱动a2
  - a2驱动a0
  - a1驱动a0
  - a3驱动a1
  - a4驱动a0
  - a4驱动a1
领域B如下：
  - b2流向b3
  - b4流向b3
  - b4流向b0
  - b2流向b1
  - b0流向b1
  - b3流向b1
  - b4流向b1
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a3什么？

定義域エー:
  - a3a0drives
  - a3a2drives
  - a2a0drives
  - a1a0drives
  - a3a1drives
  - a4a0drives
  - a4a1drives
domain b:
  - b2b3flows_to
  - b4b3flows_to
  - b4b0flows_to
  - b2b1flows_to
  - b0b1flows_to
  - b3b1flows_to
  - b4b1flows_to
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a3何と?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a3 ne?

نِطَاق إِي:
  - drives a3 a0
  - drives a3 a2
  - drives a2 a0
  - drives a1 a0
  - drives a3 a1
  - drives a4 a0
  - drives a4 a1
domain b:
  - flows_to b2 b3
  - flows_to b4 b3
  - flows_to b4 b0
  - flows_to b2 b1
  - flows_to b0 b1
  - flows_to b3 b1
  - flows_to b4 b1
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a3 مَاذَا؟

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a3 რა?

Domain a:
  - drives a3 a0
  - drives a3 a2
  - drives a2 a0
  - drives a1 a0
  - drives a3 a1
  - drives a4 a0
  - drives a4 a1
Domain b:
  - flows_to b2 b3
  - flows_to b4 b3
  - flows_to b4 b0
  - flows_to b2 b1
  - flows_to b0 b1
  - flows_to b3 b1
  - flows_to b4 b1
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a3 unutai?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a3 gì?

เขตเอ:
  - a3drivesa0
  - a3drivesa2
  - a2drivesa0
  - a1drivesa0
  - a3drivesa1
  - a4drivesa0
  - a4drivesa1
domain b:
  - b2flows_tob3
  - b4flows_tob3
  - b4flows_tob0
  - b2flows_tob1
  - b0flows_tob1
  - b3flows_tob1
  - b4flows_tob1
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a3อะไร?

domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a3 என்ன?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a3 nini?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a3 haʼátʼíísh?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a3 kwèch?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a3 фу?

정의역 에이:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a3 무엇?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a3 zer?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a3?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a3 what?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a3 сыд?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a3 ining-jak?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a3 nanta?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a3 híli?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a3 what?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a3 tay?

Domain a :
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b :
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a3 ?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Fonta aro bit:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a3 kio?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a3 melyik?

domain a:
  - a3drivesa0
  - a3drivesa2
  - a2drivesa0
  - a1drivesa0
  - a3drivesa1
  - a4drivesa0
  - a4drivesa1
domain b:
  - b2flows_tob3
  - b4flows_tob3
  - b4flows_tob0
  - b2flows_tob1
  - b0flows_tob1
  - b3flows_tob1
  - b4flows_tob1
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a3乜嘢?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a3 не?

תְּחוּם איי:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a3?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a3 apa?

វិស័យអេ:
  - a3drivesa0
  - a3drivesa2
  - a2drivesa0
  - a1drivesa0
  - a3drivesa1
  - a4drivesa0
  - a4drivesa1
domain b:
  - b2flows_tob3
  - b4flows_tob3
  - b4flows_tob0
  - b2flows_tob1
  - b0flows_tob1
  - b3flows_tob1
  - b4flows_tob1
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a3អី?

domain a:
  - a3drivesa0
  - a3drivesa2
  - a2drivesa0
  - a1drivesa0
  - a3drivesa1
  - a4drivesa0
  - a4drivesa1
domain b:
  - b2flows_tob3
  - b4flows_tob3
  - b4flows_tob0
  - b2flows_tob1
  - b0flows_tob1
  - b3flows_tob1
  - b4flows_tob1
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a3ຫຍັງ?

domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a3 ఏమిటి?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a3?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a3 what?

domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 drives a0
  - a3 drives a2
  - a2 drives a0
  - a1 drives a0
  - a3 drives a1
  - a4 drives a0
  - a4 drives a1
Domain b:
  - b2 flows_to b3
  - b4 flows_to b3
  - b4 flows_to b0
  - b2 flows_to b1
  - b0 flows_to b1
  - b3 flows_to b1
  - b4 flows_to b1
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a3 what?

Domain a:
  - a3 a0 drives
  - a3 a2 drives
  - a2 a0 drives
  - a1 a0 drives
  - a3 a1 drives
  - a4 a0 drives
  - a4 a1 drives
Domain b:
  - b2 b3 flows_to
  - b4 b3 flows_to
  - b4 b0 flows_to
  - b2 b1 flows_to
  - b0 b1 flows_to
  - b3 b1 flows_to
  - b4 b1 flows_to
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a3 вуч?

Domain a:
  - a4 feeds a3
  - a4 feeds a1
  - a0 feeds a1
  - a1 feeds a0
  - a3 feeds a1
  - a2 feeds a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a2?

El dominio A es:
  - a4 alimenta a a3
  - a4 alimenta a a1
  - a0 alimenta a a1
  - a1 alimenta a a0
  - a3 alimenta a a1
  - a2 alimenta a a1
El dominio B es:
  - b0 fluye hacia b2
  - b1 fluye hacia b2
  - b1 fluye hacia b3
  - b2 fluye hacia b0
  - b3 fluye hacia b2
  - b4 fluye hacia b2
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a2?

领域A如下：
  - a4供给a3
  - a4供给a1
  - a0供给a1
  - a1供给a0
  - a3供给a1
  - a2供给a1
领域B如下：
  - b0流向b2
  - b1流向b2
  - b1流向b3
  - b2流向b0
  - b3流向b2
  - b4流向b2
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a2什么？

Domain a:
  - a4 a3 besler
  - a4 a1 besler
  - a0 a1 besler
  - a1 a0 besler
  - a3 a1 besler
  - a2 a1 besler
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a2 ne?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a2 nini?

Domain a:
  - a4 feeds a3
  - a4 feeds a1
  - a0 feeds a1
  - a1 feeds a0
  - a3 feeds a1
  - a2 feeds a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a2?

{domain_a: [(feeds a4 a3) (feeds a4 a1) (feeds a0 a1) (feeds a1 a0) (feeds a3 a1) (feeds a2 a1)], domain_b: [(flows_to b0 b2) (flows_to b1 b2) (flows_to b1 b3) (flows_to b2 b0) (flows_to b3 b2) (flows_to b4 b2)], query: (corresponds_to a2), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a4 ernähren a3
  - a4 ernähren a1
  - a0 ernähren a1
  - a1 ernähren a0
  - a3 ernähren a1
  - a2 ernähren a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a2?

Domain a:
  - a4 хранити a3
  - a4 хранити a1
  - a0 хранити a1
  - a1 хранити a0
  - a3 хранити a1
  - a2 хранити a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a2 kakav?

Määrittelyjoukko aa:
  - a4 syöttää a3
  - a4 syöttää a1
  - a0 syöttää a1
  - a1 syöttää a0
  - a3 syöttää a1
  - a2 syöttää a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a2?

领域A如下：
  - a4供给a3
  - a4供给a1
  - a0供给a1
  - a1供给a0
  - a3供给a1
  - a2供给a1
领域B如下：
  - b0流向b2
  - b1流向b2
  - b1流向b3
  - b2流向b0
  - b3流向b2
  - b4流向b2
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a2什么？

定義域エー:
  - a4a3食べさせる
  - a4a1食べさせる
  - a0a1食べさせる
  - a1a0食べさせる
  - a3a1食べさせる
  - a2a1食べさせる
domain b:
  - b0b2flows_to
  - b1b2flows_to
  - b1b3flows_to
  - b2b0flows_to
  - b3b2flows_to
  - b4b2flows_to
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a2何と?

Domain a:
  - a4 a3 besler
  - a4 a1 besler
  - a0 a1 besler
  - a1 a0 besler
  - a3 a1 besler
  - a2 a1 besler
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a2 ne?

نِطَاق إِي:
  - أَطْعَمَ a4 a3
  - أَطْعَمَ a4 a1
  - أَطْعَمَ a0 a1
  - أَطْعَمَ a1 a0
  - أَطْعَمَ a3 a1
  - أَطْعَمَ a2 a1
domain b:
  - flows_to b0 b2
  - flows_to b1 b2
  - flows_to b1 b3
  - flows_to b2 b0
  - flows_to b3 b2
  - flows_to b4 b2
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a2 مَاذَا؟

Domain a:
  - a4 a3 კვება
  - a4 a1 კვება
  - a0 a1 კვება
  - a1 a0 კვება
  - a3 a1 კვება
  - a2 a1 კვება
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a2 რა?

Domain a:
  - feed a4 a3
  - feed a4 a1
  - feed a0 a1
  - feed a1 a0
  - feed a3 a1
  - feed a2 a1
Domain b:
  - flows_to b0 b2
  - flows_to b1 b2
  - flows_to b1 b3
  - flows_to b2 b0
  - flows_to b3 b2
  - flows_to b4 b2
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a2 unutai?

Domain a:
  - a4 cho ăn a3
  - a4 cho ăn a1
  - a0 cho ăn a1
  - a1 cho ăn a0
  - a3 cho ăn a1
  - a2 cho ăn a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a2 gì?

เขตเอ:
  - a4ขุนa3
  - a4ขุนa1
  - a0ขุนa1
  - a1ขุนa0
  - a3ขุนa1
  - a2ขุนa1
domain b:
  - b0flows_tob2
  - b1flows_tob2
  - b1flows_tob3
  - b2flows_tob0
  - b3flows_tob2
  - b4flows_tob2
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a2อะไร?

domain a:
  - a4 a3 ஊட்டு
  - a4 a1 ஊட்டு
  - a0 a1 ஊட்டு
  - a1 a0 ஊட்டு
  - a3 a1 ஊட்டு
  - a2 a1 ஊட்டு
domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a2 என்ன?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a2 nini?

Domain a:
  - a4 a3 feed
  - a4 a1 feed
  - a0 a1 feed
  - a1 a0 feed
  - a3 a1 feed
  - a2 a1 feed
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a2 haʼátʼíísh?

Domain a:
  - a4 a3 feed
  - a4 a1 feed
  - a0 a1 feed
  - a1 a0 feed
  - a3 a1 feed
  - a2 a1 feed
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a2 what?

Domain a:
  - a4 xam a3
  - a4 xam a1
  - a0 xam a1
  - a1 xam a0
  - a3 xam a1
  - a2 xam a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a2 kwèch?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a2 фу?

정의역 에이:
  - a4 a3 먹이다
  - a4 a1 먹이다
  - a0 a1 먹이다
  - a1 a0 먹이다
  - a3 a1 먹이다
  - a2 a1 먹이다
domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a2 무엇?

Domain a:
  - a4 a3 elikatu
  - a4 a1 elikatu
  - a0 a1 elikatu
  - a1 a0 elikatu
  - a3 a1 elikatu
  - a2 a1 elikatu
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a2 zer?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a2?

Domain a:
  - a4 qaray a3
  - a4 qaray a1
  - a0 qaray a1
  - a1 qaray a0
  - a3 qaray a1
  - a2 qaray a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a2 what?

Domain a:
  - a4 a3 feed
  - a4 a1 feed
  - a0 a1 feed
  - a1 a0 feed
  - a3 a1 feed
  - a2 a1 feed
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a2 сыд?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a2 ining-jak?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a2 nanta?

Domain a:
  - a4 a3 feed
  - a4 a1 feed
  - a0 a1 feed
  - a1 a0 feed
  - a3 a1 feed
  - a2 a1 feed
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a2 híli?

Domain a:
  - a4 a3 feed
  - a4 a1 feed
  - a0 a1 feed
  - a1 a0 feed
  - a3 a1 feed
  - a2 a1 feed
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 a3 feed
  - a4 a1 feed
  - a0 a1 feed
  - a1 a0 feed
  - a3 a1 feed
  - a2 a1 feed
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 a3 feed
  - a4 a1 feed
  - a0 a1 feed
  - a1 a0 feed
  - a3 a1 feed
  - a2 a1 feed
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a2 what?

Domain a:
  - a4 a3 feed
  - a4 a1 feed
  - a0 a1 feed
  - a1 a0 feed
  - a3 a1 feed
  - a2 a1 feed
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a2 tay?

Domain a :
  - a4 nourrir a3
  - a4 nourrir a1
  - a0 nourrir a1
  - a1 nourrir a0
  - a3 nourrir a1
  - a2 nourrir a1
Domain b :
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a2 ?

Domain a:
  - a4 manĝigi a3
  - a4 manĝigi a1
  - a0 manĝigi a1
  - a1 manĝigi a0
  - a3 manĝigi a1
  - a2 manĝigi a1
Fonta aro bit:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a2 kio?

Domain a:
  - a4 etet a3
  - a4 etet a1
  - a0 etet a1
  - a1 etet a0
  - a3 etet a1
  - a2 etet a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a2 melyik?

domain a:
  - a4飼料a3
  - a4飼料a1
  - a0飼料a1
  - a1飼料a0
  - a3飼料a1
  - a2飼料a1
domain b:
  - b0flows_tob2
  - b1flows_tob2
  - b1flows_tob3
  - b2flows_tob0
  - b3flows_tob2
  - b4flows_tob2
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a2乜嘢?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 тамақтандыру a3
  - a4 тамақтандыру a1
  - a0 тамақтандыру a1
  - a1 тамақтандыру a0
  - a3 тамақтандыру a1
  - a2 тамақтандыру a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a2 не?

תְּחוּם איי:
  - a4 האכיל a3
  - a4 האכיל a1
  - a0 האכיל a1
  - a1 האכיל a0
  - a3 האכיל a1
  - a2 האכיל a1
domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a2?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 memberi makan a3
  - a4 memberi makan a1
  - a0 memberi makan a1
  - a1 memberi makan a0
  - a3 memberi makan a1
  - a2 memberi makan a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a2 apa?

វិស័យអេ:
  - a4ចិញ្ចឹមa3
  - a4ចិញ្ចឹមa1
  - a0ចិញ្ចឹមa1
  - a1ចិញ្ចឹមa0
  - a3ចិញ្ចឹមa1
  - a2ចិញ្ចឹមa1
domain b:
  - b0flows_tob2
  - b1flows_tob2
  - b1flows_tob3
  - b2flows_tob0
  - b3flows_tob2
  - b4flows_tob2
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a2អី?

domain a:
  - a4feeda3
  - a4feeda1
  - a0feeda1
  - a1feeda0
  - a3feeda1
  - a2feeda1
domain b:
  - b0flows_tob2
  - b1flows_tob2
  - b1flows_tob3
  - b2flows_tob0
  - b3flows_tob2
  - b4flows_tob2
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a2ຫຍັງ?

domain a:
  - a4 a3 తినిపించు
  - a4 a1 తినిపించు
  - a0 a1 తినిపించు
  - a1 a0 తినిపించు
  - a3 a1 తినిపించు
  - a2 a1 తినిపించు
domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a2 ఏమిటి?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a2?

Domain a:
  - a4 a3 feed
  - a4 a1 feed
  - a0 a1 feed
  - a1 a0 feed
  - a3 a1 feed
  - a2 a1 feed
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a2 what?

domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 feed a3
  - a4 feed a1
  - a0 feed a1
  - a1 feed a0
  - a3 feed a1
  - a2 feed a1
Domain b:
  - b0 flows_to b2
  - b1 flows_to b2
  - b1 flows_to b3
  - b2 flows_to b0
  - b3 flows_to b2
  - b4 flows_to b2
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 a3 feed
  - a4 a1 feed
  - a0 a1 feed
  - a1 a0 feed
  - a3 a1 feed
  - a2 a1 feed
Domain b:
  - b0 b2 flows_to
  - b1 b2 flows_to
  - b1 b3 flows_to
  - b2 b0 flows_to
  - b3 b2 flows_to
  - b4 b2 flows_to
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a2 вуч?

Domain a:
  - a1 feeds a2
  - a3 feeds a0
  - a0 feeds a4
  - a4 feeds a2
  - a3 feeds a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a2?

El dominio A es:
  - a1 alimenta a a2
  - a3 alimenta a a0
  - a0 alimenta a a4
  - a4 alimenta a a2
  - a3 alimenta a a4
El dominio B es:
  - b1 empuja b2
  - b2 empuja b4
  - b0 empuja b2
  - b0 empuja b1
  - b3 empuja b4
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a2?

领域A如下：
  - a1供给a2
  - a3供给a0
  - a0供给a4
  - a4供给a2
  - a3供给a4
领域B如下：
  - b1推动b2
  - b2推动b4
  - b0推动b2
  - b0推动b1
  - b3推动b4
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a2什么？

Domain a:
  - a1 a2 besler
  - a3 a0 besler
  - a0 a4 besler
  - a4 a2 besler
  - a3 a4 besler
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a2 ne?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a2 nini?

Domain a:
  - a1 feeds a2
  - a3 feeds a0
  - a0 feeds a4
  - a4 feeds a2
  - a3 feeds a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a2?

{domain_a: [(feeds a1 a2) (feeds a3 a0) (feeds a0 a4) (feeds a4 a2) (feeds a3 a4)], domain_b: [(pushes b1 b2) (pushes b2 b4) (pushes b0 b2) (pushes b0 b1) (pushes b3 b4)], query: (corresponds_to a2), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a1 ernähren a2
  - a3 ernähren a0
  - a0 ernähren a4
  - a4 ernähren a2
  - a3 ernähren a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a2?

Domain a:
  - a1 хранити a2
  - a3 хранити a0
  - a0 хранити a4
  - a4 хранити a2
  - a3 хранити a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a2 kakav?

Määrittelyjoukko aa:
  - a1 syöttää a2
  - a3 syöttää a0
  - a0 syöttää a4
  - a4 syöttää a2
  - a3 syöttää a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a2?

领域A如下：
  - a1供给a2
  - a3供给a0
  - a0供给a4
  - a4供给a2
  - a3供给a4
领域B如下：
  - b1推动b2
  - b2推动b4
  - b0推动b2
  - b0推动b1
  - b3推动b4
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a2什么？

定義域エー:
  - a1a2食べさせる
  - a3a0食べさせる
  - a0a4食べさせる
  - a4a2食べさせる
  - a3a4食べさせる
domain b:
  - b1b2pushes
  - b2b4pushes
  - b0b2pushes
  - b0b1pushes
  - b3b4pushes
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a2何と?

Domain a:
  - a1 a2 besler
  - a3 a0 besler
  - a0 a4 besler
  - a4 a2 besler
  - a3 a4 besler
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a2 ne?

نِطَاق إِي:
  - أَطْعَمَ a1 a2
  - أَطْعَمَ a3 a0
  - أَطْعَمَ a0 a4
  - أَطْعَمَ a4 a2
  - أَطْعَمَ a3 a4
domain b:
  - pushes b1 b2
  - pushes b2 b4
  - pushes b0 b2
  - pushes b0 b1
  - pushes b3 b4
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a2 مَاذَا؟

Domain a:
  - a1 a2 კვება
  - a3 a0 კვება
  - a0 a4 კვება
  - a4 a2 კვება
  - a3 a4 კვება
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a2 რა?

Domain a:
  - feed a1 a2
  - feed a3 a0
  - feed a0 a4
  - feed a4 a2
  - feed a3 a4
Domain b:
  - pushes b1 b2
  - pushes b2 b4
  - pushes b0 b2
  - pushes b0 b1
  - pushes b3 b4
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a2 unutai?

Domain a:
  - a1 cho ăn a2
  - a3 cho ăn a0
  - a0 cho ăn a4
  - a4 cho ăn a2
  - a3 cho ăn a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a2 gì?

เขตเอ:
  - a1ขุนa2
  - a3ขุนa0
  - a0ขุนa4
  - a4ขุนa2
  - a3ขุนa4
domain b:
  - b1pushesb2
  - b2pushesb4
  - b0pushesb2
  - b0pushesb1
  - b3pushesb4
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a2อะไร?

domain a:
  - a1 a2 ஊட்டு
  - a3 a0 ஊட்டு
  - a0 a4 ஊட்டு
  - a4 a2 ஊட்டு
  - a3 a4 ஊட்டு
domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a2 என்ன?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a2 nini?

Domain a:
  - a1 a2 feed
  - a3 a0 feed
  - a0 a4 feed
  - a4 a2 feed
  - a3 a4 feed
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a2 haʼátʼíísh?

Domain a:
  - a1 a2 feed
  - a3 a0 feed
  - a0 a4 feed
  - a4 a2 feed
  - a3 a4 feed
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a2 what?

Domain a:
  - a1 xam a2
  - a3 xam a0
  - a0 xam a4
  - a4 xam a2
  - a3 xam a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a2 kwèch?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a2 фу?

정의역 에이:
  - a1 a2 먹이다
  - a3 a0 먹이다
  - a0 a4 먹이다
  - a4 a2 먹이다
  - a3 a4 먹이다
domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a2 무엇?

Domain a:
  - a1 a2 elikatu
  - a3 a0 elikatu
  - a0 a4 elikatu
  - a4 a2 elikatu
  - a3 a4 elikatu
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a2 zer?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a2?

Domain a:
  - a1 qaray a2
  - a3 qaray a0
  - a0 qaray a4
  - a4 qaray a2
  - a3 qaray a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a2 what?

Domain a:
  - a1 a2 feed
  - a3 a0 feed
  - a0 a4 feed
  - a4 a2 feed
  - a3 a4 feed
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a2 сыд?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a2 ining-jak?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a2 nanta?

Domain a:
  - a1 a2 feed
  - a3 a0 feed
  - a0 a4 feed
  - a4 a2 feed
  - a3 a4 feed
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a2 híli?

Domain a:
  - a1 a2 feed
  - a3 a0 feed
  - a0 a4 feed
  - a4 a2 feed
  - a3 a4 feed
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 a2 feed
  - a3 a0 feed
  - a0 a4 feed
  - a4 a2 feed
  - a3 a4 feed
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 a2 feed
  - a3 a0 feed
  - a0 a4 feed
  - a4 a2 feed
  - a3 a4 feed
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a2 what?

Domain a:
  - a1 a2 feed
  - a3 a0 feed
  - a0 a4 feed
  - a4 a2 feed
  - a3 a4 feed
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a2 tay?

Domain a :
  - a1 nourrir a2
  - a3 nourrir a0
  - a0 nourrir a4
  - a4 nourrir a2
  - a3 nourrir a4
Domain b :
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a2 ?

Domain a:
  - a1 manĝigi a2
  - a3 manĝigi a0
  - a0 manĝigi a4
  - a4 manĝigi a2
  - a3 manĝigi a4
Fonta aro bit:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a2 kio?

Domain a:
  - a1 etet a2
  - a3 etet a0
  - a0 etet a4
  - a4 etet a2
  - a3 etet a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a2 melyik?

domain a:
  - a1飼料a2
  - a3飼料a0
  - a0飼料a4
  - a4飼料a2
  - a3飼料a4
domain b:
  - b1pushesb2
  - b2pushesb4
  - b0pushesb2
  - b0pushesb1
  - b3pushesb4
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a2乜嘢?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 тамақтандыру a2
  - a3 тамақтандыру a0
  - a0 тамақтандыру a4
  - a4 тамақтандыру a2
  - a3 тамақтандыру a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a2 не?

תְּחוּם איי:
  - a1 האכיל a2
  - a3 האכיל a0
  - a0 האכיל a4
  - a4 האכיל a2
  - a3 האכיל a4
domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a2?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 memberi makan a2
  - a3 memberi makan a0
  - a0 memberi makan a4
  - a4 memberi makan a2
  - a3 memberi makan a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a2 apa?

វិស័យអេ:
  - a1ចិញ្ចឹមa2
  - a3ចិញ្ចឹមa0
  - a0ចិញ្ចឹមa4
  - a4ចិញ្ចឹមa2
  - a3ចិញ្ចឹមa4
domain b:
  - b1pushesb2
  - b2pushesb4
  - b0pushesb2
  - b0pushesb1
  - b3pushesb4
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a2អី?

domain a:
  - a1feeda2
  - a3feeda0
  - a0feeda4
  - a4feeda2
  - a3feeda4
domain b:
  - b1pushesb2
  - b2pushesb4
  - b0pushesb2
  - b0pushesb1
  - b3pushesb4
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a2ຫຍັງ?

domain a:
  - a1 a2 తినిపించు
  - a3 a0 తినిపించు
  - a0 a4 తినిపించు
  - a4 a2 తినిపించు
  - a3 a4 తినిపించు
domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a2 ఏమిటి?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a2?

Domain a:
  - a1 a2 feed
  - a3 a0 feed
  - a0 a4 feed
  - a4 a2 feed
  - a3 a4 feed
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a2 what?

domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 feed a2
  - a3 feed a0
  - a0 feed a4
  - a4 feed a2
  - a3 feed a4
Domain b:
  - b1 pushes b2
  - b2 pushes b4
  - b0 pushes b2
  - b0 pushes b1
  - b3 pushes b4
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a1 a2 feed
  - a3 a0 feed
  - a0 a4 feed
  - a4 a2 feed
  - a3 a4 feed
Domain b:
  - b1 b2 pushes
  - b2 b4 pushes
  - b0 b2 pushes
  - b0 b1 pushes
  - b3 b4 pushes
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a2 вуч?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a4?

El dominio A es:
  - a3 impulsa a1
  - a0 impulsa a1
  - a2 impulsa a4
  - a3 impulsa a2
  - a0 impulsa a4
  - a4 impulsa a1
  - a2 impulsa a3
El dominio B es:
  - b4 fluye hacia b2
  - b1 fluye hacia b0
  - b0 fluye hacia b2
  - b4 fluye hacia b1
  - b3 fluye hacia b0
  - b1 fluye hacia b4
  - b3 fluye hacia b2
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a4?

领域A如下：
  - a3驱动a1
  - a0驱动a1
  - a2驱动a4
  - a3驱动a2
  - a0驱动a4
  - a4驱动a1
  - a2驱动a3
领域B如下：
  - b4流向b2
  - b1流向b0
  - b0流向b2
  - b4流向b1
  - b3流向b0
  - b1流向b4
  - b3流向b2
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a4什么？

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a4 ne?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a4 nini?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a4?

{domain_a: [(drives a3 a1) (drives a0 a1) (drives a2 a4) (drives a3 a2) (drives a0 a4) (drives a4 a1) (drives a2 a3)], domain_b: [(flows_to b4 b2) (flows_to b1 b0) (flows_to b0 b2) (flows_to b4 b1) (flows_to b3 b0) (flows_to b1 b4) (flows_to b3 b2)], query: (corresponds_to a4), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a4?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a4 kakav?

Määrittelyjoukko aa:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a4?

领域A如下：
  - a3驱动a1
  - a0驱动a1
  - a2驱动a4
  - a3驱动a2
  - a0驱动a4
  - a4驱动a1
  - a2驱动a3
领域B如下：
  - b4流向b2
  - b1流向b0
  - b0流向b2
  - b4流向b1
  - b3流向b0
  - b1流向b4
  - b3流向b2
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a4什么？

定義域エー:
  - a3a1drives
  - a0a1drives
  - a2a4drives
  - a3a2drives
  - a0a4drives
  - a4a1drives
  - a2a3drives
domain b:
  - b4b2flows_to
  - b1b0flows_to
  - b0b2flows_to
  - b4b1flows_to
  - b3b0flows_to
  - b1b4flows_to
  - b3b2flows_to
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a4何と?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a4 ne?

نِطَاق إِي:
  - drives a3 a1
  - drives a0 a1
  - drives a2 a4
  - drives a3 a2
  - drives a0 a4
  - drives a4 a1
  - drives a2 a3
domain b:
  - flows_to b4 b2
  - flows_to b1 b0
  - flows_to b0 b2
  - flows_to b4 b1
  - flows_to b3 b0
  - flows_to b1 b4
  - flows_to b3 b2
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a4 مَاذَا؟

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a4 რა?

Domain a:
  - drives a3 a1
  - drives a0 a1
  - drives a2 a4
  - drives a3 a2
  - drives a0 a4
  - drives a4 a1
  - drives a2 a3
Domain b:
  - flows_to b4 b2
  - flows_to b1 b0
  - flows_to b0 b2
  - flows_to b4 b1
  - flows_to b3 b0
  - flows_to b1 b4
  - flows_to b3 b2
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a4 unutai?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a4 gì?

เขตเอ:
  - a3drivesa1
  - a0drivesa1
  - a2drivesa4
  - a3drivesa2
  - a0drivesa4
  - a4drivesa1
  - a2drivesa3
domain b:
  - b4flows_tob2
  - b1flows_tob0
  - b0flows_tob2
  - b4flows_tob1
  - b3flows_tob0
  - b1flows_tob4
  - b3flows_tob2
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a4อะไร?

domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a4 என்ன?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a4 nini?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a4 haʼátʼíísh?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a4 kwèch?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a4 фу?

정의역 에이:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a4 무엇?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a4 zer?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a4?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a4 what?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a4 сыд?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a4 ining-jak?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a4 nanta?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a4 híli?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a4 what?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a4 tay?

Domain a :
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b :
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a4 ?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Fonta aro bit:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a4 kio?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a4 melyik?

domain a:
  - a3drivesa1
  - a0drivesa1
  - a2drivesa4
  - a3drivesa2
  - a0drivesa4
  - a4drivesa1
  - a2drivesa3
domain b:
  - b4flows_tob2
  - b1flows_tob0
  - b0flows_tob2
  - b4flows_tob1
  - b3flows_tob0
  - b1flows_tob4
  - b3flows_tob2
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a4乜嘢?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a4 не?

תְּחוּם איי:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a4?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a4 apa?

វិស័យអេ:
  - a3drivesa1
  - a0drivesa1
  - a2drivesa4
  - a3drivesa2
  - a0drivesa4
  - a4drivesa1
  - a2drivesa3
domain b:
  - b4flows_tob2
  - b1flows_tob0
  - b0flows_tob2
  - b4flows_tob1
  - b3flows_tob0
  - b1flows_tob4
  - b3flows_tob2
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a4អី?

domain a:
  - a3drivesa1
  - a0drivesa1
  - a2drivesa4
  - a3drivesa2
  - a0drivesa4
  - a4drivesa1
  - a2drivesa3
domain b:
  - b4flows_tob2
  - b1flows_tob0
  - b0flows_tob2
  - b4flows_tob1
  - b3flows_tob0
  - b1flows_tob4
  - b3flows_tob2
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a4ຫຍັງ?

domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a4 ఏమిటి?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a4?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a4 what?

domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 drives a1
  - a0 drives a1
  - a2 drives a4
  - a3 drives a2
  - a0 drives a4
  - a4 drives a1
  - a2 drives a3
Domain b:
  - b4 flows_to b2
  - b1 flows_to b0
  - b0 flows_to b2
  - b4 flows_to b1
  - b3 flows_to b0
  - b1 flows_to b4
  - b3 flows_to b2
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 a1 drives
  - a0 a1 drives
  - a2 a4 drives
  - a3 a2 drives
  - a0 a4 drives
  - a4 a1 drives
  - a2 a3 drives
Domain b:
  - b4 b2 flows_to
  - b1 b0 flows_to
  - b0 b2 flows_to
  - b4 b1 flows_to
  - b3 b0 flows_to
  - b1 b4 flows_to
  - b3 b2 flows_to
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a4 вуч?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feeds b3
  - b0 feeds b2
  - b2 feeds b3
  - b4 feeds b0
  - b4 feeds b1
  - b2 feeds b0
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a0?

El dominio A es:
  - a2 impulsa a0
  - a0 impulsa a2
  - a0 impulsa a4
  - a1 impulsa a3
  - a3 impulsa a4
  - a1 impulsa a2
El dominio B es:
  - b1 alimenta a b3
  - b0 alimenta a b2
  - b2 alimenta a b3
  - b4 alimenta a b0
  - b4 alimenta a b1
  - b2 alimenta a b0
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a0?

领域A如下：
  - a2驱动a0
  - a0驱动a2
  - a0驱动a4
  - a1驱动a3
  - a3驱动a4
  - a1驱动a2
领域B如下：
  - b1供给b3
  - b0供给b2
  - b2供给b3
  - b4供给b0
  - b4供给b1
  - b2供给b0
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a0什么？

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 besler
  - b0 b2 besler
  - b2 b3 besler
  - b4 b0 besler
  - b4 b1 besler
  - b2 b0 besler
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a0 ne?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a0 nini?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feeds b3
  - b0 feeds b2
  - b2 feeds b3
  - b4 feeds b0
  - b4 feeds b1
  - b2 feeds b0
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a0?

{domain_a: [(drives a2 a0) (drives a0 a2) (drives a0 a4) (drives a1 a3) (drives a3 a4) (drives a1 a2)], domain_b: [(feeds b1 b3) (feeds b0 b2) (feeds b2 b3) (feeds b4 b0) (feeds b4 b1) (feeds b2 b0)], query: (corresponds_to a0), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 ernähren b3
  - b0 ernähren b2
  - b2 ernähren b3
  - b4 ernähren b0
  - b4 ernähren b1
  - b2 ernähren b0
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a0?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 хранити b3
  - b0 хранити b2
  - b2 хранити b3
  - b4 хранити b0
  - b4 хранити b1
  - b2 хранити b0
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a0 kakav?

Määrittelyjoukko aa:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 syöttää b3
  - b0 syöttää b2
  - b2 syöttää b3
  - b4 syöttää b0
  - b4 syöttää b1
  - b2 syöttää b0
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a0?

领域A如下：
  - a2驱动a0
  - a0驱动a2
  - a0驱动a4
  - a1驱动a3
  - a3驱动a4
  - a1驱动a2
领域B如下：
  - b1供给b3
  - b0供给b2
  - b2供给b3
  - b4供给b0
  - b4供给b1
  - b2供给b0
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a0什么？

定義域エー:
  - a2a0drives
  - a0a2drives
  - a0a4drives
  - a1a3drives
  - a3a4drives
  - a1a2drives
domain b:
  - b1b3食べさせる
  - b0b2食べさせる
  - b2b3食べさせる
  - b4b0食べさせる
  - b4b1食べさせる
  - b2b0食べさせる
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a0何と?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 besler
  - b0 b2 besler
  - b2 b3 besler
  - b4 b0 besler
  - b4 b1 besler
  - b2 b0 besler
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a0 ne?

نِطَاق إِي:
  - drives a2 a0
  - drives a0 a2
  - drives a0 a4
  - drives a1 a3
  - drives a3 a4
  - drives a1 a2
domain b:
  - أَطْعَمَ b1 b3
  - أَطْعَمَ b0 b2
  - أَطْعَمَ b2 b3
  - أَطْعَمَ b4 b0
  - أَطْعَمَ b4 b1
  - أَطْعَمَ b2 b0
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a0 مَاذَا؟

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 კვება
  - b0 b2 კვება
  - b2 b3 კვება
  - b4 b0 კვება
  - b4 b1 კვება
  - b2 b0 კვება
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a0 რა?

Domain a:
  - drives a2 a0
  - drives a0 a2
  - drives a0 a4
  - drives a1 a3
  - drives a3 a4
  - drives a1 a2
Domain b:
  - feed b1 b3
  - feed b0 b2
  - feed b2 b3
  - feed b4 b0
  - feed b4 b1
  - feed b2 b0
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a0 unutai?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 cho ăn b3
  - b0 cho ăn b2
  - b2 cho ăn b3
  - b4 cho ăn b0
  - b4 cho ăn b1
  - b2 cho ăn b0
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a0 gì?

เขตเอ:
  - a2drivesa0
  - a0drivesa2
  - a0drivesa4
  - a1drivesa3
  - a3drivesa4
  - a1drivesa2
domain b:
  - b1ขุนb3
  - b0ขุนb2
  - b2ขุนb3
  - b4ขุนb0
  - b4ขุนb1
  - b2ขุนb0
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a0อะไร?

domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
domain b:
  - b1 b3 ஊட்டு
  - b0 b2 ஊட்டு
  - b2 b3 ஊட்டு
  - b4 b0 ஊட்டு
  - b4 b1 ஊட்டு
  - b2 b0 ஊட்டு
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a0 என்ன?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a0 nini?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 feed
  - b0 b2 feed
  - b2 b3 feed
  - b4 b0 feed
  - b4 b1 feed
  - b2 b0 feed
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a0 haʼátʼíísh?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 feed
  - b0 b2 feed
  - b2 b3 feed
  - b4 b0 feed
  - b4 b1 feed
  - b2 b0 feed
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 xam b3
  - b0 xam b2
  - b2 xam b3
  - b4 xam b0
  - b4 xam b1
  - b2 xam b0
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a0 kwèch?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a0 фу?

정의역 에이:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
domain b:
  - b1 b3 먹이다
  - b0 b2 먹이다
  - b2 b3 먹이다
  - b4 b0 먹이다
  - b4 b1 먹이다
  - b2 b0 먹이다
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a0 무엇?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 elikatu
  - b0 b2 elikatu
  - b2 b3 elikatu
  - b4 b0 elikatu
  - b4 b1 elikatu
  - b2 b0 elikatu
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a0 zer?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a0?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 qaray b3
  - b0 qaray b2
  - b2 qaray b3
  - b4 qaray b0
  - b4 qaray b1
  - b2 qaray b0
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a0 what?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 feed
  - b0 b2 feed
  - b2 b3 feed
  - b4 b0 feed
  - b4 b1 feed
  - b2 b0 feed
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a0 сыд?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a0 ining-jak?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a0 nanta?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 feed
  - b0 b2 feed
  - b2 b3 feed
  - b4 b0 feed
  - b4 b1 feed
  - b2 b0 feed
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a0 híli?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 feed
  - b0 b2 feed
  - b2 b3 feed
  - b4 b0 feed
  - b4 b1 feed
  - b2 b0 feed
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 feed
  - b0 b2 feed
  - b2 b3 feed
  - b4 b0 feed
  - b4 b1 feed
  - b2 b0 feed
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 feed
  - b0 b2 feed
  - b2 b3 feed
  - b4 b0 feed
  - b4 b1 feed
  - b2 b0 feed
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a0 what?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 feed
  - b0 b2 feed
  - b2 b3 feed
  - b4 b0 feed
  - b4 b1 feed
  - b2 b0 feed
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a0 tay?

Domain a :
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b :
  - b1 nourrir b3
  - b0 nourrir b2
  - b2 nourrir b3
  - b4 nourrir b0
  - b4 nourrir b1
  - b2 nourrir b0
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a0 ?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Fonta aro bit:
  - b1 manĝigi b3
  - b0 manĝigi b2
  - b2 manĝigi b3
  - b4 manĝigi b0
  - b4 manĝigi b1
  - b2 manĝigi b0
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a0 kio?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 etet b3
  - b0 etet b2
  - b2 etet b3
  - b4 etet b0
  - b4 etet b1
  - b2 etet b0
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a0 melyik?

domain a:
  - a2drivesa0
  - a0drivesa2
  - a0drivesa4
  - a1drivesa3
  - a3drivesa4
  - a1drivesa2
domain b:
  - b1飼料b3
  - b0飼料b2
  - b2飼料b3
  - b4飼料b0
  - b4飼料b1
  - b2飼料b0
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a0乜嘢?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 тамақтандыру b3
  - b0 тамақтандыру b2
  - b2 тамақтандыру b3
  - b4 тамақтандыру b0
  - b4 тамақтандыру b1
  - b2 тамақтандыру b0
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a0 не?

תְּחוּם איי:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
domain b:
  - b1 האכיל b3
  - b0 האכיל b2
  - b2 האכיל b3
  - b4 האכיל b0
  - b4 האכיל b1
  - b2 האכיל b0
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a0?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 memberi makan b3
  - b0 memberi makan b2
  - b2 memberi makan b3
  - b4 memberi makan b0
  - b4 memberi makan b1
  - b2 memberi makan b0
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a0 apa?

វិស័យអេ:
  - a2drivesa0
  - a0drivesa2
  - a0drivesa4
  - a1drivesa3
  - a3drivesa4
  - a1drivesa2
domain b:
  - b1ចិញ្ចឹមb3
  - b0ចិញ្ចឹមb2
  - b2ចិញ្ចឹមb3
  - b4ចិញ្ចឹមb0
  - b4ចិញ្ចឹមb1
  - b2ចិញ្ចឹមb0
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a0អី?

domain a:
  - a2drivesa0
  - a0drivesa2
  - a0drivesa4
  - a1drivesa3
  - a3drivesa4
  - a1drivesa2
domain b:
  - b1feedb3
  - b0feedb2
  - b2feedb3
  - b4feedb0
  - b4feedb1
  - b2feedb0
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a0ຫຍັງ?

domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
domain b:
  - b1 b3 తినిపించు
  - b0 b2 తినిపించు
  - b2 b3 తినిపించు
  - b4 b0 తినిపించు
  - b4 b1 తినిపించు
  - b2 b0 తినిపించు
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a0 ఏమిటి?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a0?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 feed
  - b0 b2 feed
  - b2 b3 feed
  - b4 b0 feed
  - b4 b1 feed
  - b2 b0 feed
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a0 what?

domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 drives a0
  - a0 drives a2
  - a0 drives a4
  - a1 drives a3
  - a3 drives a4
  - a1 drives a2
Domain b:
  - b1 feed b3
  - b0 feed b2
  - b2 feed b3
  - b4 feed b0
  - b4 feed b1
  - b2 feed b0
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a0 what?

Domain a:
  - a2 a0 drives
  - a0 a2 drives
  - a0 a4 drives
  - a1 a3 drives
  - a3 a4 drives
  - a1 a2 drives
Domain b:
  - b1 b3 feed
  - b0 b2 feed
  - b2 b3 feed
  - b4 b0 feed
  - b4 b1 feed
  - b2 b0 feed
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a0 вуч?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feeds b1
  - b0 feeds b2
  - b1 feeds b4
  - b1 feeds b0
  - b4 feeds b2
  - b0 feeds b1
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a2?

El dominio A es:
  - a4 fluye hacia a1
  - a1 fluye hacia a3
  - a4 fluye hacia a2
  - a1 fluye hacia a4
  - a0 fluye hacia a1
  - a3 fluye hacia a2
El dominio B es:
  - b3 alimenta a b1
  - b0 alimenta a b2
  - b1 alimenta a b4
  - b1 alimenta a b0
  - b4 alimenta a b2
  - b0 alimenta a b1
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a2?

领域A如下：
  - a4流向a1
  - a1流向a3
  - a4流向a2
  - a1流向a4
  - a0流向a1
  - a3流向a2
领域B如下：
  - b3供给b1
  - b0供给b2
  - b1供给b4
  - b1供给b0
  - b4供给b2
  - b0供给b1
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a2什么？

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 besler
  - b0 b2 besler
  - b1 b4 besler
  - b1 b0 besler
  - b4 b2 besler
  - b0 b1 besler
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a2 ne?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a2 nini?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feeds b1
  - b0 feeds b2
  - b1 feeds b4
  - b1 feeds b0
  - b4 feeds b2
  - b0 feeds b1
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a2?

{domain_a: [(flows_to a4 a1) (flows_to a1 a3) (flows_to a4 a2) (flows_to a1 a4) (flows_to a0 a1) (flows_to a3 a2)], domain_b: [(feeds b3 b1) (feeds b0 b2) (feeds b1 b4) (feeds b1 b0) (feeds b4 b2) (feeds b0 b1)], query: (corresponds_to a2), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 ernähren b1
  - b0 ernähren b2
  - b1 ernähren b4
  - b1 ernähren b0
  - b4 ernähren b2
  - b0 ernähren b1
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a2?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 хранити b1
  - b0 хранити b2
  - b1 хранити b4
  - b1 хранити b0
  - b4 хранити b2
  - b0 хранити b1
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a2 kakav?

Määrittelyjoukko aa:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 syöttää b1
  - b0 syöttää b2
  - b1 syöttää b4
  - b1 syöttää b0
  - b4 syöttää b2
  - b0 syöttää b1
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a2?

领域A如下：
  - a4流向a1
  - a1流向a3
  - a4流向a2
  - a1流向a4
  - a0流向a1
  - a3流向a2
领域B如下：
  - b3供给b1
  - b0供给b2
  - b1供给b4
  - b1供给b0
  - b4供给b2
  - b0供给b1
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a2什么？

定義域エー:
  - a4a1flows_to
  - a1a3flows_to
  - a4a2flows_to
  - a1a4flows_to
  - a0a1flows_to
  - a3a2flows_to
domain b:
  - b3b1食べさせる
  - b0b2食べさせる
  - b1b4食べさせる
  - b1b0食べさせる
  - b4b2食べさせる
  - b0b1食べさせる
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a2何と?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 besler
  - b0 b2 besler
  - b1 b4 besler
  - b1 b0 besler
  - b4 b2 besler
  - b0 b1 besler
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a2 ne?

نِطَاق إِي:
  - flows_to a4 a1
  - flows_to a1 a3
  - flows_to a4 a2
  - flows_to a1 a4
  - flows_to a0 a1
  - flows_to a3 a2
domain b:
  - أَطْعَمَ b3 b1
  - أَطْعَمَ b0 b2
  - أَطْعَمَ b1 b4
  - أَطْعَمَ b1 b0
  - أَطْعَمَ b4 b2
  - أَطْعَمَ b0 b1
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a2 مَاذَا؟

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 კვება
  - b0 b2 კვება
  - b1 b4 კვება
  - b1 b0 კვება
  - b4 b2 კვება
  - b0 b1 კვება
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a2 რა?

Domain a:
  - flows_to a4 a1
  - flows_to a1 a3
  - flows_to a4 a2
  - flows_to a1 a4
  - flows_to a0 a1
  - flows_to a3 a2
Domain b:
  - feed b3 b1
  - feed b0 b2
  - feed b1 b4
  - feed b1 b0
  - feed b4 b2
  - feed b0 b1
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a2 unutai?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 cho ăn b1
  - b0 cho ăn b2
  - b1 cho ăn b4
  - b1 cho ăn b0
  - b4 cho ăn b2
  - b0 cho ăn b1
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a2 gì?

เขตเอ:
  - a4flows_toa1
  - a1flows_toa3
  - a4flows_toa2
  - a1flows_toa4
  - a0flows_toa1
  - a3flows_toa2
domain b:
  - b3ขุนb1
  - b0ขุนb2
  - b1ขุนb4
  - b1ขุนb0
  - b4ขุนb2
  - b0ขุนb1
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a2อะไร?

domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
domain b:
  - b3 b1 ஊட்டு
  - b0 b2 ஊட்டு
  - b1 b4 ஊட்டு
  - b1 b0 ஊட்டு
  - b4 b2 ஊட்டு
  - b0 b1 ஊட்டு
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a2 என்ன?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a2 nini?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 feed
  - b0 b2 feed
  - b1 b4 feed
  - b1 b0 feed
  - b4 b2 feed
  - b0 b1 feed
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a2 haʼátʼíísh?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 feed
  - b0 b2 feed
  - b1 b4 feed
  - b1 b0 feed
  - b4 b2 feed
  - b0 b1 feed
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 xam b1
  - b0 xam b2
  - b1 xam b4
  - b1 xam b0
  - b4 xam b2
  - b0 xam b1
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a2 kwèch?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a2 фу?

정의역 에이:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
domain b:
  - b3 b1 먹이다
  - b0 b2 먹이다
  - b1 b4 먹이다
  - b1 b0 먹이다
  - b4 b2 먹이다
  - b0 b1 먹이다
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a2 무엇?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 elikatu
  - b0 b2 elikatu
  - b1 b4 elikatu
  - b1 b0 elikatu
  - b4 b2 elikatu
  - b0 b1 elikatu
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a2 zer?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a2?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 qaray b1
  - b0 qaray b2
  - b1 qaray b4
  - b1 qaray b0
  - b4 qaray b2
  - b0 qaray b1
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a2 what?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 feed
  - b0 b2 feed
  - b1 b4 feed
  - b1 b0 feed
  - b4 b2 feed
  - b0 b1 feed
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a2 сыд?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a2 ining-jak?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a2 nanta?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 feed
  - b0 b2 feed
  - b1 b4 feed
  - b1 b0 feed
  - b4 b2 feed
  - b0 b1 feed
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a2 híli?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 feed
  - b0 b2 feed
  - b1 b4 feed
  - b1 b0 feed
  - b4 b2 feed
  - b0 b1 feed
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 feed
  - b0 b2 feed
  - b1 b4 feed
  - b1 b0 feed
  - b4 b2 feed
  - b0 b1 feed
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 feed
  - b0 b2 feed
  - b1 b4 feed
  - b1 b0 feed
  - b4 b2 feed
  - b0 b1 feed
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a2 what?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 feed
  - b0 b2 feed
  - b1 b4 feed
  - b1 b0 feed
  - b4 b2 feed
  - b0 b1 feed
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a2 tay?

Domain a :
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b :
  - b3 nourrir b1
  - b0 nourrir b2
  - b1 nourrir b4
  - b1 nourrir b0
  - b4 nourrir b2
  - b0 nourrir b1
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a2 ?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Fonta aro bit:
  - b3 manĝigi b1
  - b0 manĝigi b2
  - b1 manĝigi b4
  - b1 manĝigi b0
  - b4 manĝigi b2
  - b0 manĝigi b1
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a2 kio?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 etet b1
  - b0 etet b2
  - b1 etet b4
  - b1 etet b0
  - b4 etet b2
  - b0 etet b1
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a2 melyik?

domain a:
  - a4flows_toa1
  - a1flows_toa3
  - a4flows_toa2
  - a1flows_toa4
  - a0flows_toa1
  - a3flows_toa2
domain b:
  - b3飼料b1
  - b0飼料b2
  - b1飼料b4
  - b1飼料b0
  - b4飼料b2
  - b0飼料b1
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a2乜嘢?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 тамақтандыру b1
  - b0 тамақтандыру b2
  - b1 тамақтандыру b4
  - b1 тамақтандыру b0
  - b4 тамақтандыру b2
  - b0 тамақтандыру b1
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a2 не?

תְּחוּם איי:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
domain b:
  - b3 האכיל b1
  - b0 האכיל b2
  - b1 האכיל b4
  - b1 האכיל b0
  - b4 האכיל b2
  - b0 האכיל b1
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a2?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 memberi makan b1
  - b0 memberi makan b2
  - b1 memberi makan b4
  - b1 memberi makan b0
  - b4 memberi makan b2
  - b0 memberi makan b1
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a2 apa?

វិស័យអេ:
  - a4flows_toa1
  - a1flows_toa3
  - a4flows_toa2
  - a1flows_toa4
  - a0flows_toa1
  - a3flows_toa2
domain b:
  - b3ចិញ្ចឹមb1
  - b0ចិញ្ចឹមb2
  - b1ចិញ្ចឹមb4
  - b1ចិញ្ចឹមb0
  - b4ចិញ្ចឹមb2
  - b0ចិញ្ចឹមb1
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a2អី?

domain a:
  - a4flows_toa1
  - a1flows_toa3
  - a4flows_toa2
  - a1flows_toa4
  - a0flows_toa1
  - a3flows_toa2
domain b:
  - b3feedb1
  - b0feedb2
  - b1feedb4
  - b1feedb0
  - b4feedb2
  - b0feedb1
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a2ຫຍັງ?

domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
domain b:
  - b3 b1 తినిపించు
  - b0 b2 తినిపించు
  - b1 b4 తినిపించు
  - b1 b0 తినిపించు
  - b4 b2 తినిపించు
  - b0 b1 తినిపించు
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a2 ఏమిటి?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a2?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 feed
  - b0 b2 feed
  - b1 b4 feed
  - b1 b0 feed
  - b4 b2 feed
  - b0 b1 feed
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a2 what?

domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 flows_to a1
  - a1 flows_to a3
  - a4 flows_to a2
  - a1 flows_to a4
  - a0 flows_to a1
  - a3 flows_to a2
Domain b:
  - b3 feed b1
  - b0 feed b2
  - b1 feed b4
  - b1 feed b0
  - b4 feed b2
  - b0 feed b1
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a4 a1 flows_to
  - a1 a3 flows_to
  - a4 a2 flows_to
  - a1 a4 flows_to
  - a0 a1 flows_to
  - a3 a2 flows_to
Domain b:
  - b3 b1 feed
  - b0 b2 feed
  - b1 b4 feed
  - b1 b0 feed
  - b4 b2 feed
  - b0 b1 feed
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a2 вуч?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feeds b0
  - b2 feeds b3
  - b2 feeds b4
  - b1 feeds b3
  - b1 feeds b2
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a1?

El dominio A es:
  - a2 fluye hacia a3
  - a0 fluye hacia a2
  - a1 fluye hacia a4
  - a2 fluye hacia a1
  - a0 fluye hacia a3
El dominio B es:
  - b4 alimenta a b0
  - b2 alimenta a b3
  - b2 alimenta a b4
  - b1 alimenta a b3
  - b1 alimenta a b2
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a1?

领域A如下：
  - a2流向a3
  - a0流向a2
  - a1流向a4
  - a2流向a1
  - a0流向a3
领域B如下：
  - b4供给b0
  - b2供给b3
  - b2供给b4
  - b1供给b3
  - b1供给b2
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a1什么？

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 besler
  - b2 b3 besler
  - b2 b4 besler
  - b1 b3 besler
  - b1 b2 besler
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a1 ne?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a1 nini?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feeds b0
  - b2 feeds b3
  - b2 feeds b4
  - b1 feeds b3
  - b1 feeds b2
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a1?

{domain_a: [(flows_to a2 a3) (flows_to a0 a2) (flows_to a1 a4) (flows_to a2 a1) (flows_to a0 a3)], domain_b: [(feeds b4 b0) (feeds b2 b3) (feeds b2 b4) (feeds b1 b3) (feeds b1 b2)], query: (corresponds_to a1), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 ernähren b0
  - b2 ernähren b3
  - b2 ernähren b4
  - b1 ernähren b3
  - b1 ernähren b2
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a1?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 хранити b0
  - b2 хранити b3
  - b2 хранити b4
  - b1 хранити b3
  - b1 хранити b2
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a1 kakav?

Määrittelyjoukko aa:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 syöttää b0
  - b2 syöttää b3
  - b2 syöttää b4
  - b1 syöttää b3
  - b1 syöttää b2
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a1?

领域A如下：
  - a2流向a3
  - a0流向a2
  - a1流向a4
  - a2流向a1
  - a0流向a3
领域B如下：
  - b4供给b0
  - b2供给b3
  - b2供给b4
  - b1供给b3
  - b1供给b2
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a1什么？

定義域エー:
  - a2a3flows_to
  - a0a2flows_to
  - a1a4flows_to
  - a2a1flows_to
  - a0a3flows_to
domain b:
  - b4b0食べさせる
  - b2b3食べさせる
  - b2b4食べさせる
  - b1b3食べさせる
  - b1b2食べさせる
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a1何と?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 besler
  - b2 b3 besler
  - b2 b4 besler
  - b1 b3 besler
  - b1 b2 besler
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a1 ne?

نِطَاق إِي:
  - flows_to a2 a3
  - flows_to a0 a2
  - flows_to a1 a4
  - flows_to a2 a1
  - flows_to a0 a3
domain b:
  - أَطْعَمَ b4 b0
  - أَطْعَمَ b2 b3
  - أَطْعَمَ b2 b4
  - أَطْعَمَ b1 b3
  - أَطْعَمَ b1 b2
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a1 مَاذَا؟

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 კვება
  - b2 b3 კვება
  - b2 b4 კვება
  - b1 b3 კვება
  - b1 b2 კვება
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a1 რა?

Domain a:
  - flows_to a2 a3
  - flows_to a0 a2
  - flows_to a1 a4
  - flows_to a2 a1
  - flows_to a0 a3
Domain b:
  - feed b4 b0
  - feed b2 b3
  - feed b2 b4
  - feed b1 b3
  - feed b1 b2
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a1 unutai?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 cho ăn b0
  - b2 cho ăn b3
  - b2 cho ăn b4
  - b1 cho ăn b3
  - b1 cho ăn b2
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a1 gì?

เขตเอ:
  - a2flows_toa3
  - a0flows_toa2
  - a1flows_toa4
  - a2flows_toa1
  - a0flows_toa3
domain b:
  - b4ขุนb0
  - b2ขุนb3
  - b2ขุนb4
  - b1ขุนb3
  - b1ขุนb2
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a1อะไร?

domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
domain b:
  - b4 b0 ஊட்டு
  - b2 b3 ஊட்டு
  - b2 b4 ஊட்டு
  - b1 b3 ஊட்டு
  - b1 b2 ஊட்டு
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a1 என்ன?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a1 nini?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 feed
  - b2 b3 feed
  - b2 b4 feed
  - b1 b3 feed
  - b1 b2 feed
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a1 haʼátʼíísh?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 feed
  - b2 b3 feed
  - b2 b4 feed
  - b1 b3 feed
  - b1 b2 feed
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 xam b0
  - b2 xam b3
  - b2 xam b4
  - b1 xam b3
  - b1 xam b2
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a1 kwèch?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a1 фу?

정의역 에이:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
domain b:
  - b4 b0 먹이다
  - b2 b3 먹이다
  - b2 b4 먹이다
  - b1 b3 먹이다
  - b1 b2 먹이다
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a1 무엇?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 elikatu
  - b2 b3 elikatu
  - b2 b4 elikatu
  - b1 b3 elikatu
  - b1 b2 elikatu
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a1 zer?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a1?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 qaray b0
  - b2 qaray b3
  - b2 qaray b4
  - b1 qaray b3
  - b1 qaray b2
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a1 what?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 feed
  - b2 b3 feed
  - b2 b4 feed
  - b1 b3 feed
  - b1 b2 feed
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a1 сыд?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a1 ining-jak?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a1 nanta?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 feed
  - b2 b3 feed
  - b2 b4 feed
  - b1 b3 feed
  - b1 b2 feed
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a1 híli?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 feed
  - b2 b3 feed
  - b2 b4 feed
  - b1 b3 feed
  - b1 b2 feed
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 feed
  - b2 b3 feed
  - b2 b4 feed
  - b1 b3 feed
  - b1 b2 feed
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 feed
  - b2 b3 feed
  - b2 b4 feed
  - b1 b3 feed
  - b1 b2 feed
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a1 what?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 feed
  - b2 b3 feed
  - b2 b4 feed
  - b1 b3 feed
  - b1 b2 feed
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a1 tay?

Domain a :
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b :
  - b4 nourrir b0
  - b2 nourrir b3
  - b2 nourrir b4
  - b1 nourrir b3
  - b1 nourrir b2
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a1 ?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Fonta aro bit:
  - b4 manĝigi b0
  - b2 manĝigi b3
  - b2 manĝigi b4
  - b1 manĝigi b3
  - b1 manĝigi b2
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a1 kio?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 etet b0
  - b2 etet b3
  - b2 etet b4
  - b1 etet b3
  - b1 etet b2
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a1 melyik?

domain a:
  - a2flows_toa3
  - a0flows_toa2
  - a1flows_toa4
  - a2flows_toa1
  - a0flows_toa3
domain b:
  - b4飼料b0
  - b2飼料b3
  - b2飼料b4
  - b1飼料b3
  - b1飼料b2
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a1乜嘢?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 тамақтандыру b0
  - b2 тамақтандыру b3
  - b2 тамақтандыру b4
  - b1 тамақтандыру b3
  - b1 тамақтандыру b2
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a1 не?

תְּחוּם איי:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
domain b:
  - b4 האכיל b0
  - b2 האכיל b3
  - b2 האכיל b4
  - b1 האכיל b3
  - b1 האכיל b2
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a1?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 memberi makan b0
  - b2 memberi makan b3
  - b2 memberi makan b4
  - b1 memberi makan b3
  - b1 memberi makan b2
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a1 apa?

វិស័យអេ:
  - a2flows_toa3
  - a0flows_toa2
  - a1flows_toa4
  - a2flows_toa1
  - a0flows_toa3
domain b:
  - b4ចិញ្ចឹមb0
  - b2ចិញ្ចឹមb3
  - b2ចិញ្ចឹមb4
  - b1ចិញ្ចឹមb3
  - b1ចិញ្ចឹមb2
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a1អី?

domain a:
  - a2flows_toa3
  - a0flows_toa2
  - a1flows_toa4
  - a2flows_toa1
  - a0flows_toa3
domain b:
  - b4feedb0
  - b2feedb3
  - b2feedb4
  - b1feedb3
  - b1feedb2
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a1ຫຍັງ?

domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
domain b:
  - b4 b0 తినిపించు
  - b2 b3 తినిపించు
  - b2 b4 తినిపించు
  - b1 b3 తినిపించు
  - b1 b2 తినిపించు
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a1 ఏమిటి?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a1?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 feed
  - b2 b3 feed
  - b2 b4 feed
  - b1 b3 feed
  - b1 b2 feed
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a1 what?

domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 flows_to a3
  - a0 flows_to a2
  - a1 flows_to a4
  - a2 flows_to a1
  - a0 flows_to a3
Domain b:
  - b4 feed b0
  - b2 feed b3
  - b2 feed b4
  - b1 feed b3
  - b1 feed b2
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 a3 flows_to
  - a0 a2 flows_to
  - a1 a4 flows_to
  - a2 a1 flows_to
  - a0 a3 flows_to
Domain b:
  - b4 b0 feed
  - b2 b3 feed
  - b2 b4 feed
  - b1 b3 feed
  - b1 b2 feed
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a1 вуч?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a2?

El dominio A es:
  - a0 fluye hacia a3
  - a1 fluye hacia a0
  - a3 fluye hacia a2
  - a3 fluye hacia a0
  - a4 fluye hacia a3
El dominio B es:
  - b4 impulsa b1
  - b4 impulsa b3
  - b2 impulsa b4
  - b3 impulsa b4
  - b0 impulsa b3
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a2?

领域A如下：
  - a0流向a3
  - a1流向a0
  - a3流向a2
  - a3流向a0
  - a4流向a3
领域B如下：
  - b4驱动b1
  - b4驱动b3
  - b2驱动b4
  - b3驱动b4
  - b0驱动b3
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a2什么？

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a2 ne?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a2 nini?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a2?

{domain_a: [(flows_to a0 a3) (flows_to a1 a0) (flows_to a3 a2) (flows_to a3 a0) (flows_to a4 a3)], domain_b: [(drives b4 b1) (drives b4 b3) (drives b2 b4) (drives b3 b4) (drives b0 b3)], query: (corresponds_to a2), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a2?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a2 kakav?

Määrittelyjoukko aa:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a2?

领域A如下：
  - a0流向a3
  - a1流向a0
  - a3流向a2
  - a3流向a0
  - a4流向a3
领域B如下：
  - b4驱动b1
  - b4驱动b3
  - b2驱动b4
  - b3驱动b4
  - b0驱动b3
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a2什么？

定義域エー:
  - a0a3flows_to
  - a1a0flows_to
  - a3a2flows_to
  - a3a0flows_to
  - a4a3flows_to
domain b:
  - b4b1drives
  - b4b3drives
  - b2b4drives
  - b3b4drives
  - b0b3drives
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a2何と?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a2 ne?

نِطَاق إِي:
  - flows_to a0 a3
  - flows_to a1 a0
  - flows_to a3 a2
  - flows_to a3 a0
  - flows_to a4 a3
domain b:
  - drives b4 b1
  - drives b4 b3
  - drives b2 b4
  - drives b3 b4
  - drives b0 b3
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a2 مَاذَا؟

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a2 რა?

Domain a:
  - flows_to a0 a3
  - flows_to a1 a0
  - flows_to a3 a2
  - flows_to a3 a0
  - flows_to a4 a3
Domain b:
  - drives b4 b1
  - drives b4 b3
  - drives b2 b4
  - drives b3 b4
  - drives b0 b3
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a2 unutai?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a2 gì?

เขตเอ:
  - a0flows_toa3
  - a1flows_toa0
  - a3flows_toa2
  - a3flows_toa0
  - a4flows_toa3
domain b:
  - b4drivesb1
  - b4drivesb3
  - b2drivesb4
  - b3drivesb4
  - b0drivesb3
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a2อะไร?

domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a2 என்ன?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a2 nini?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a2 haʼátʼíísh?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a2 kwèch?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a2 фу?

정의역 에이:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a2 무엇?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a2 zer?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a2?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a2 what?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a2 сыд?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a2 ining-jak?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a2 nanta?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a2 híli?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a2 what?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a2 tay?

Domain a :
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b :
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a2 ?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Fonta aro bit:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a2 kio?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a2 melyik?

domain a:
  - a0flows_toa3
  - a1flows_toa0
  - a3flows_toa2
  - a3flows_toa0
  - a4flows_toa3
domain b:
  - b4drivesb1
  - b4drivesb3
  - b2drivesb4
  - b3drivesb4
  - b0drivesb3
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a2乜嘢?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a2 не?

תְּחוּם איי:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a2?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a2 apa?

វិស័យអេ:
  - a0flows_toa3
  - a1flows_toa0
  - a3flows_toa2
  - a3flows_toa0
  - a4flows_toa3
domain b:
  - b4drivesb1
  - b4drivesb3
  - b2drivesb4
  - b3drivesb4
  - b0drivesb3
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a2អី?

domain a:
  - a0flows_toa3
  - a1flows_toa0
  - a3flows_toa2
  - a3flows_toa0
  - a4flows_toa3
domain b:
  - b4drivesb1
  - b4drivesb3
  - b2drivesb4
  - b3drivesb4
  - b0drivesb3
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a2ຫຍັງ?

domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a2 ఏమిటి?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a2?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a2 what?

domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 flows_to a3
  - a1 flows_to a0
  - a3 flows_to a2
  - a3 flows_to a0
  - a4 flows_to a3
Domain b:
  - b4 drives b1
  - b4 drives b3
  - b2 drives b4
  - b3 drives b4
  - b0 drives b3
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a2 what?

Domain a:
  - a0 a3 flows_to
  - a1 a0 flows_to
  - a3 a2 flows_to
  - a3 a0 flows_to
  - a4 a3 flows_to
Domain b:
  - b4 b1 drives
  - b4 b3 drives
  - b2 b4 drives
  - b3 b4 drives
  - b0 b3 drives
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a2 вуч?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a4?

El dominio A es:
  - a2 impulsa a4
  - a2 impulsa a3
  - a1 impulsa a0
  - a3 impulsa a0
  - a0 impulsa a3
  - a3 impulsa a2
El dominio B es:
  - b4 empuja b0
  - b2 empuja b3
  - b1 empuja b4
  - b3 empuja b1
  - b4 empuja b1
  - b1 empuja b3
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a4?

领域A如下：
  - a2驱动a4
  - a2驱动a3
  - a1驱动a0
  - a3驱动a0
  - a0驱动a3
  - a3驱动a2
领域B如下：
  - b4推动b0
  - b2推动b3
  - b1推动b4
  - b3推动b1
  - b4推动b1
  - b1推动b3
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a4什么？

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a4 ne?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a4 nini?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a4?

{domain_a: [(drives a2 a4) (drives a2 a3) (drives a1 a0) (drives a3 a0) (drives a0 a3) (drives a3 a2)], domain_b: [(pushes b4 b0) (pushes b2 b3) (pushes b1 b4) (pushes b3 b1) (pushes b4 b1) (pushes b1 b3)], query: (corresponds_to a4), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a4?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a4 kakav?

Määrittelyjoukko aa:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a4?

领域A如下：
  - a2驱动a4
  - a2驱动a3
  - a1驱动a0
  - a3驱动a0
  - a0驱动a3
  - a3驱动a2
领域B如下：
  - b4推动b0
  - b2推动b3
  - b1推动b4
  - b3推动b1
  - b4推动b1
  - b1推动b3
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a4什么？

定義域エー:
  - a2a4drives
  - a2a3drives
  - a1a0drives
  - a3a0drives
  - a0a3drives
  - a3a2drives
domain b:
  - b4b0pushes
  - b2b3pushes
  - b1b4pushes
  - b3b1pushes
  - b4b1pushes
  - b1b3pushes
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a4何と?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a4 ne?

نِطَاق إِي:
  - drives a2 a4
  - drives a2 a3
  - drives a1 a0
  - drives a3 a0
  - drives a0 a3
  - drives a3 a2
domain b:
  - pushes b4 b0
  - pushes b2 b3
  - pushes b1 b4
  - pushes b3 b1
  - pushes b4 b1
  - pushes b1 b3
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a4 مَاذَا؟

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a4 რა?

Domain a:
  - drives a2 a4
  - drives a2 a3
  - drives a1 a0
  - drives a3 a0
  - drives a0 a3
  - drives a3 a2
Domain b:
  - pushes b4 b0
  - pushes b2 b3
  - pushes b1 b4
  - pushes b3 b1
  - pushes b4 b1
  - pushes b1 b3
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a4 unutai?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a4 gì?

เขตเอ:
  - a2drivesa4
  - a2drivesa3
  - a1drivesa0
  - a3drivesa0
  - a0drivesa3
  - a3drivesa2
domain b:
  - b4pushesb0
  - b2pushesb3
  - b1pushesb4
  - b3pushesb1
  - b4pushesb1
  - b1pushesb3
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a4อะไร?

domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a4 என்ன?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a4 nini?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a4 haʼátʼíísh?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a4 kwèch?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a4 фу?

정의역 에이:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a4 무엇?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a4 zer?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a4?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a4 what?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a4 сыд?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a4 ining-jak?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a4 nanta?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a4 híli?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a4 what?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a4 tay?

Domain a :
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b :
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a4 ?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Fonta aro bit:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a4 kio?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a4 melyik?

domain a:
  - a2drivesa4
  - a2drivesa3
  - a1drivesa0
  - a3drivesa0
  - a0drivesa3
  - a3drivesa2
domain b:
  - b4pushesb0
  - b2pushesb3
  - b1pushesb4
  - b3pushesb1
  - b4pushesb1
  - b1pushesb3
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a4乜嘢?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a4 не?

תְּחוּם איי:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a4?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a4 apa?

វិស័យអេ:
  - a2drivesa4
  - a2drivesa3
  - a1drivesa0
  - a3drivesa0
  - a0drivesa3
  - a3drivesa2
domain b:
  - b4pushesb0
  - b2pushesb3
  - b1pushesb4
  - b3pushesb1
  - b4pushesb1
  - b1pushesb3
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a4អី?

domain a:
  - a2drivesa4
  - a2drivesa3
  - a1drivesa0
  - a3drivesa0
  - a0drivesa3
  - a3drivesa2
domain b:
  - b4pushesb0
  - b2pushesb3
  - b1pushesb4
  - b3pushesb1
  - b4pushesb1
  - b1pushesb3
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a4ຫຍັງ?

domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a4 ఏమిటి?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a4?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a4 what?

domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 drives a4
  - a2 drives a3
  - a1 drives a0
  - a3 drives a0
  - a0 drives a3
  - a3 drives a2
Domain b:
  - b4 pushes b0
  - b2 pushes b3
  - b1 pushes b4
  - b3 pushes b1
  - b4 pushes b1
  - b1 pushes b3
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a2 a4 drives
  - a2 a3 drives
  - a1 a0 drives
  - a3 a0 drives
  - a0 a3 drives
  - a3 a2 drives
Domain b:
  - b4 b0 pushes
  - b2 b3 pushes
  - b1 b4 pushes
  - b3 b1 pushes
  - b4 b1 pushes
  - b1 b3 pushes
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a4 вуч?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a4?

El dominio A es:
  - a4 impulsa a1
  - a1 impulsa a4
  - a2 impulsa a0
  - a4 impulsa a0
  - a3 impulsa a1
El dominio B es:
  - b0 fluye hacia b4
  - b1 fluye hacia b2
  - b2 fluye hacia b0
  - b3 fluye hacia b4
  - b0 fluye hacia b2
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a4?

领域A如下：
  - a4驱动a1
  - a1驱动a4
  - a2驱动a0
  - a4驱动a0
  - a3驱动a1
领域B如下：
  - b0流向b4
  - b1流向b2
  - b2流向b0
  - b3流向b4
  - b0流向b2
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a4什么？

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a4 ne?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a4 nini?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a4?

{domain_a: [(drives a4 a1) (drives a1 a4) (drives a2 a0) (drives a4 a0) (drives a3 a1)], domain_b: [(flows_to b0 b4) (flows_to b1 b2) (flows_to b2 b0) (flows_to b3 b4) (flows_to b0 b2)], query: (corresponds_to a4), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a4?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a4 kakav?

Määrittelyjoukko aa:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a4?

领域A如下：
  - a4驱动a1
  - a1驱动a4
  - a2驱动a0
  - a4驱动a0
  - a3驱动a1
领域B如下：
  - b0流向b4
  - b1流向b2
  - b2流向b0
  - b3流向b4
  - b0流向b2
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a4什么？

定義域エー:
  - a4a1drives
  - a1a4drives
  - a2a0drives
  - a4a0drives
  - a3a1drives
domain b:
  - b0b4flows_to
  - b1b2flows_to
  - b2b0flows_to
  - b3b4flows_to
  - b0b2flows_to
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a4何と?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a4 ne?

نِطَاق إِي:
  - drives a4 a1
  - drives a1 a4
  - drives a2 a0
  - drives a4 a0
  - drives a3 a1
domain b:
  - flows_to b0 b4
  - flows_to b1 b2
  - flows_to b2 b0
  - flows_to b3 b4
  - flows_to b0 b2
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a4 مَاذَا؟

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a4 რა?

Domain a:
  - drives a4 a1
  - drives a1 a4
  - drives a2 a0
  - drives a4 a0
  - drives a3 a1
Domain b:
  - flows_to b0 b4
  - flows_to b1 b2
  - flows_to b2 b0
  - flows_to b3 b4
  - flows_to b0 b2
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a4 unutai?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a4 gì?

เขตเอ:
  - a4drivesa1
  - a1drivesa4
  - a2drivesa0
  - a4drivesa0
  - a3drivesa1
domain b:
  - b0flows_tob4
  - b1flows_tob2
  - b2flows_tob0
  - b3flows_tob4
  - b0flows_tob2
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a4อะไร?

domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a4 என்ன?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a4 nini?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a4 haʼátʼíísh?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a4 kwèch?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a4 фу?

정의역 에이:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a4 무엇?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a4 zer?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a4?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a4 what?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a4 сыд?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a4 ining-jak?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a4 nanta?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a4 híli?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a4 what?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a4 tay?

Domain a :
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b :
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a4 ?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Fonta aro bit:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a4 kio?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a4 melyik?

domain a:
  - a4drivesa1
  - a1drivesa4
  - a2drivesa0
  - a4drivesa0
  - a3drivesa1
domain b:
  - b0flows_tob4
  - b1flows_tob2
  - b2flows_tob0
  - b3flows_tob4
  - b0flows_tob2
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a4乜嘢?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a4 не?

תְּחוּם איי:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a4?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a4 apa?

វិស័យអេ:
  - a4drivesa1
  - a1drivesa4
  - a2drivesa0
  - a4drivesa0
  - a3drivesa1
domain b:
  - b0flows_tob4
  - b1flows_tob2
  - b2flows_tob0
  - b3flows_tob4
  - b0flows_tob2
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a4អី?

domain a:
  - a4drivesa1
  - a1drivesa4
  - a2drivesa0
  - a4drivesa0
  - a3drivesa1
domain b:
  - b0flows_tob4
  - b1flows_tob2
  - b2flows_tob0
  - b3flows_tob4
  - b0flows_tob2
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a4ຫຍັງ?

domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a4 ఏమిటి?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a4?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a4 what?

domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 drives a1
  - a1 drives a4
  - a2 drives a0
  - a4 drives a0
  - a3 drives a1
Domain b:
  - b0 flows_to b4
  - b1 flows_to b2
  - b2 flows_to b0
  - b3 flows_to b4
  - b0 flows_to b2
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a4 a1 drives
  - a1 a4 drives
  - a2 a0 drives
  - a4 a0 drives
  - a3 a1 drives
Domain b:
  - b0 b4 flows_to
  - b1 b2 flows_to
  - b2 b0 flows_to
  - b3 b4 flows_to
  - b0 b2 flows_to
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a4 вуч?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a4?

El dominio A es:
  - a3 fluye hacia a0
  - a3 fluye hacia a1
  - a4 fluye hacia a2
  - a4 fluye hacia a1
  - a0 fluye hacia a2
  - a0 fluye hacia a1
  - a1 fluye hacia a2
El dominio B es:
  - b4 empuja b3
  - b4 empuja b0
  - b2 empuja b4
  - b1 empuja b3
  - b3 empuja b0
  - b1 empuja b0
  - b2 empuja b3
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a4?

领域A如下：
  - a3流向a0
  - a3流向a1
  - a4流向a2
  - a4流向a1
  - a0流向a2
  - a0流向a1
  - a1流向a2
领域B如下：
  - b4推动b3
  - b4推动b0
  - b2推动b4
  - b1推动b3
  - b3推动b0
  - b1推动b0
  - b2推动b3
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a4什么？

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a4 ne?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a4 nini?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a4?

{domain_a: [(flows_to a3 a0) (flows_to a3 a1) (flows_to a4 a2) (flows_to a4 a1) (flows_to a0 a2) (flows_to a0 a1) (flows_to a1 a2)], domain_b: [(pushes b4 b3) (pushes b4 b0) (pushes b2 b4) (pushes b1 b3) (pushes b3 b0) (pushes b1 b0) (pushes b2 b3)], query: (corresponds_to a4), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a4?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a4 kakav?

Määrittelyjoukko aa:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a4?

领域A如下：
  - a3流向a0
  - a3流向a1
  - a4流向a2
  - a4流向a1
  - a0流向a2
  - a0流向a1
  - a1流向a2
领域B如下：
  - b4推动b3
  - b4推动b0
  - b2推动b4
  - b1推动b3
  - b3推动b0
  - b1推动b0
  - b2推动b3
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a4什么？

定義域エー:
  - a3a0flows_to
  - a3a1flows_to
  - a4a2flows_to
  - a4a1flows_to
  - a0a2flows_to
  - a0a1flows_to
  - a1a2flows_to
domain b:
  - b4b3pushes
  - b4b0pushes
  - b2b4pushes
  - b1b3pushes
  - b3b0pushes
  - b1b0pushes
  - b2b3pushes
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a4何と?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a4 ne?

نِطَاق إِي:
  - flows_to a3 a0
  - flows_to a3 a1
  - flows_to a4 a2
  - flows_to a4 a1
  - flows_to a0 a2
  - flows_to a0 a1
  - flows_to a1 a2
domain b:
  - pushes b4 b3
  - pushes b4 b0
  - pushes b2 b4
  - pushes b1 b3
  - pushes b3 b0
  - pushes b1 b0
  - pushes b2 b3
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a4 مَاذَا؟

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a4 რა?

Domain a:
  - flows_to a3 a0
  - flows_to a3 a1
  - flows_to a4 a2
  - flows_to a4 a1
  - flows_to a0 a2
  - flows_to a0 a1
  - flows_to a1 a2
Domain b:
  - pushes b4 b3
  - pushes b4 b0
  - pushes b2 b4
  - pushes b1 b3
  - pushes b3 b0
  - pushes b1 b0
  - pushes b2 b3
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a4 unutai?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a4 gì?

เขตเอ:
  - a3flows_toa0
  - a3flows_toa1
  - a4flows_toa2
  - a4flows_toa1
  - a0flows_toa2
  - a0flows_toa1
  - a1flows_toa2
domain b:
  - b4pushesb3
  - b4pushesb0
  - b2pushesb4
  - b1pushesb3
  - b3pushesb0
  - b1pushesb0
  - b2pushesb3
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a4อะไร?

domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a4 என்ன?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a4 nini?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a4 haʼátʼíísh?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a4 kwèch?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a4 фу?

정의역 에이:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a4 무엇?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a4 zer?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a4?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a4 what?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a4 сыд?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a4 ining-jak?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a4 nanta?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a4 híli?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a4 what?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a4 tay?

Domain a :
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b :
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a4 ?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Fonta aro bit:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a4 kio?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a4 melyik?

domain a:
  - a3flows_toa0
  - a3flows_toa1
  - a4flows_toa2
  - a4flows_toa1
  - a0flows_toa2
  - a0flows_toa1
  - a1flows_toa2
domain b:
  - b4pushesb3
  - b4pushesb0
  - b2pushesb4
  - b1pushesb3
  - b3pushesb0
  - b1pushesb0
  - b2pushesb3
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a4乜嘢?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a4 не?

תְּחוּם איי:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a4?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule si dua domains saham satu relational struktur di bawah bijection dari their elements
  - rule si bijection berada si unik satu bahwa maps setiap edge dari onto sebuah edge dari b
Corresponds banding a4 apa?

វិស័យអេ:
  - a3flows_toa0
  - a3flows_toa1
  - a4flows_toa2
  - a4flows_toa1
  - a0flows_toa2
  - a0flows_toa1
  - a1flows_toa2
domain b:
  - b4pushesb3
  - b4pushesb0
  - b2pushesb4
  - b1pushesb3
  - b3pushesb0
  - b1pushesb0
  - b2pushesb3
ក្បួន:
  - ក្បួន:theពីរdomainsបែងមួយrelationalគ្រោងក្រោមbijectionនៃរបស់គេelements
  - ក្បួន:thebijectionត្រូវបានtheពិសេសមួយថាmapsរាល់edgeនៃontoanedgeនៃb
correspondsដល់:a4អី?

domain a:
  - a3flows_toa0
  - a3flows_toa1
  - a4flows_toa2
  - a4flows_toa1
  - a0flows_toa2
  - a0flows_toa1
  - a1flows_toa2
domain b:
  - b4pushesb3
  - b4pushesb0
  - b2pushesb4
  - b1pushesb3
  - b3pushesb0
  - b1pushesb0
  - b2pushesb3
ກະຕິກາ:
  - ກະຕິກາ:ສອງdomainsສ່ວນໜຶ່ງrelationalໂຄງສ້າງໃຕ້bijectionຂອງtheirelements
  - ກະຕິກາ:bijectionຢູ່uniqueໜຶ່ງນັ້ນmapsທຸກedgeຂອງontoanedgeຂອງb
corresponds to:a4ຫຍັງ?

domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
నియమం:
  - నియమం రెండు domains share ఒకటి relational structure under bijection of their elements
  - నియమం bijection ఉండు unique ఒకటి ఆ maps ప్రతి అంచు of onto ఒక అంచు of b
corresponds to a4 ఏమిటి?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule èjì domains share ọ̀kan relational structure lábẹ́ bijection of wọn elements
  - rule bijection wà unique ọ̀kan that maps every edge of onto an edge of b
What corresponds to a4?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Rules:
  - rule the nakih domains share dałaá relational structure under bijection of their elements
  - rule the bijection naiágúóli the unique dałaá that maps every edge of onto an edge of b
Corresponds to a4 what?

domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
rules:
  - rule two domains share ᐊᑕᐅᓯᖅ relational structure under bijection of their elements
  - rule bijection is unique ᐊᑕᐅᓯᖅ that maps every edge of onto an edge of b
corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule tu domains share wan relational structure under bijection of their elements
  - rule bijection is unique wan that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 flows_to a0
  - a3 flows_to a1
  - a4 flows_to a2
  - a4 flows_to a1
  - a0 flows_to a2
  - a0 flows_to a1
  - a1 flows_to a2
Domain b:
  - b4 pushes b3
  - b4 pushes b0
  - b2 pushes b4
  - b1 pushes b3
  - b3 pushes b0
  - b1 pushes b0
  - b2 pushes b3
Rules:
  - rule two domains share náʼėstse relational structure under bijection of their elements
  - rule bijection is unique náʼėstse that maps every edge of onto an edge of b
Corresponds to a4 what?

Domain a:
  - a3 a0 flows_to
  - a3 a1 flows_to
  - a4 a2 flows_to
  - a4 a1 flows_to
  - a0 a2 flows_to
  - a0 a1 flows_to
  - a1 a2 flows_to
Domain b:
  - b4 b3 pushes
  - b4 b0 pushes
  - b2 b4 pushes
  - b1 b3 pushes
  - b3 b0 pushes
  - b1 b0 pushes
  - b2 b3 pushes
Rules:
  - rule кьвед domains share сад relational structure under bijection of their elements
  - rule bijection is unique сад that maps every edge of onto an edge of b
Corresponds to a4 вуч?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a1?

El dominio A es:
  - a2 impulsa a0
  - a2 impulsa a1
  - a4 impulsa a1
  - a4 impulsa a2
  - a3 impulsa a1
  - a1 impulsa a0
El dominio B es:
  - b4 fluye hacia b2
  - b3 fluye hacia b4
  - b1 fluye hacia b2
  - b1 fluye hacia b4
  - b0 fluye hacia b4
  - b3 fluye hacia b1
Las reglas son:
  - la regla: el two domains share one relational structure under a bijection de their elements
  - la regla: el bijection es el unique one that asigna every la arista de a onto an la arista de b
¿Qué se corresponde con: a1?

领域A如下：
  - a2驱动a0
  - a2驱动a1
  - a4驱动a1
  - a4驱动a2
  - a3驱动a1
  - a1驱动a0
领域B如下：
  - b4流向b2
  - b3流向b4
  - b1流向b2
  - b1流向b4
  - b0流向b4
  - b3流向b1
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a1什么？

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a1 ne?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a1 nini?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
The rules are:
  - rule the two domains share one relational structure under a bijection of their elements
  - rule the bijection is the unique one that maps every edge of a onto an edge of b
What is the corresponds to a1?

{domain_a: [(drives a2 a0) (drives a2 a1) (drives a4 a1) (drives a4 a2) (drives a3 a1) (drives a1 a0)], domain_b: [(flows_to b4 b2) (flows_to b3 b4) (flows_to b1 b2) (flows_to b1 b4) (flows_to b0 b4) (flows_to b3 b1)], query: (corresponds_to a1), rules: [(rule (the_two_domains_share_one_relational_structure_under_a_bijection_of_their_elements)) (rule (the_bijection_is_the_unique_one_that_maps_every_edge_of_a_onto_an_edge_of_b))]}

Definitionsbereich A:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Die Regeln sind:
  - Regel der zwei domains Anteil eins relational Struktur unter ein Bijektion aus ihr elements
  - Regel der Bijektion werden der einzigartig eins dass maps jeder Rand aus ein auf ein Rand aus b
Was corresponds zu a1?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Пра̏вило:
  - пра̏вило два̑ domains де̏о јѐдан relational структу́ра под bijekcija od њихов elements
  - пра̏вило bijekcija би̏ти једѝнствен јѐдан да maps сва̏кӣ ру̑б od onto an ру̑б od b
Corresponds to a1 kakav?

Määrittelyjoukko aa:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Säännöt:
  - sääntö kaksi domains osuus yksi relational rakennelma alla bijektio vaille heidän elements
  - sääntö bijektio tulla ainutlaatuinen yksi että maps jokainen reuna vaille päälle mikäli reuna vaille b
Mikä corresponds jotta a1?

领域A如下：
  - a2驱动a0
  - a2驱动a1
  - a4驱动a1
  - a4驱动a2
  - a3驱动a1
  - a1驱动a0
领域B如下：
  - b4流向b2
  - b3流向b4
  - b1流向b2
  - b1流向b4
  - b0流向b4
  - b3流向b1
规则如下：
  - 规则：这twodomainsshareonerelationalstructureunder一bijection的theirelements
  - 规则：这bijection是这uniqueonethat映射到every有边连到的一ontoan有边连到的b
对应给：a1什么？

定義域エー:
  - a2a0drives
  - a2a1drives
  - a4a1drives
  - a4a2drives
  - a3a1drives
  - a1a0drives
domain b:
  - b4b2flows_to
  - b3b4flows_to
  - b1b2flows_to
  - b1b4flows_to
  - b0b4flows_to
  - b3b1flows_to
規則:規則:二domains分担一relational構造...下に全単射の中の彼らのelements; 規則:全単射れる唯一一そのmaps凡ゆる際の中のontoan際の中のb.
correspondsに:a1何と?

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Kurallar:
  - kural: two domains share one relational structure under bir bijection their elements
  - kural: bijection unique one that maps every edge bir onto an edge b
Corresponds: a1 ne?

نِطَاق إِي:
  - drives a2 a0
  - drives a2 a1
  - drives a4 a1
  - drives a4 a2
  - drives a3 a1
  - drives a1 a0
domain b:
  - flows_to b4 b2
  - flows_to b3 b4
  - flows_to b1 b2
  - flows_to b1 b4
  - flows_to b0 b4
  - flows_to b3 b1
قَانُون:
  - قَانُون الـ اِثْنَانِ domains نَصِيب وَاحِد relational هَيْكَل تَحْتَ bijection مِنْ لَهُم elements
  - قَانُون الـ bijection كَانَ الـ فَرِيد وَاحِد أَنْ maps كُلّ edge مِنْ عَلَى an edge مِنْ b
corresponds أَنّ a1 مَاذَا؟

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Წესი:
  - წესი ორი domains წილი ერთი relational სტრუქტურა ქვეშ bijection of მათი elements
  - წესი bijection ყოფნა უნიკალური ერთი რომ maps ყველა კიდე of onto ერთ-ერთი კიდე of b
Corresponds უკლია a1 რა?

Domain a:
  - drives a2 a0
  - drives a2 a1
  - drives a4 a1
  - drives a4 a2
  - drives a3 a1
  - drives a1 a0
Domain b:
  - flows_to b4 b2
  - flows_to b3 b4
  - flows_to b1 b2
  - flows_to b1 b4
  - flows_to b0 b4
  - flows_to b3 b1
Rekureihana:
  - rekureihana te rua domains tiri tahi relational rangaranga raro bijection o tā rāua elements
  - rekureihana te bijection is te ahurei tahi tēnā maps every nekeneke o onto he nekeneke o b
Corresponds ki a1 unutai?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Quy tắc:
  - quy tắc the hai domains phần một relational kết cấu dưới song ánh bằng của họ elements
  - quy tắc the song ánh được the duy nhất một rằng maps mỗi rìa bằng onto an rìa bằng b
Corresponds để a1 gì?

เขตเอ:
  - a2drivesa0
  - a2drivesa1
  - a4drivesa1
  - a4drivesa2
  - a3drivesa1
  - a1drivesa0
domain b:
  - b4flows_tob2
  - b3flows_tob4
  - b1flows_tob2
  - b1flows_tob4
  - b0flows_tob4
  - b3flows_tob1
กฎ:
  - กฎ:สองdomainsส่วนหนึ่งrelationalโครงสร้างใต้bijectionของของเขาelements
  - กฎ:bijectionถูกuniqueหนึ่งว่าmapsทุกขอบของontoหนึ่งขอบของb
correspondsเพื่อ:a1อะไร?

domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
rules:
  - rule இரண்டு domains பங்கு ஒன்று relational structure under bijection கொண்ட their elements
  - rule bijection படு unique ஒன்று எப்படி maps ஒவ்வொரு edge கொண்ட onto ஒரு edge கொண்ட b
corresponds வரை a1 என்ன?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Sheria ni:
  - sheria: two domains share one relational structure under bijection ya their elements
  - sheria: bijection ni unique one that maps every edge ya onto an edge ya b
Corresponds kwa: a1 nini?

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Bee hazʼáanii:
  - bee hazʼáanii naaki domains share łáaʼii relational structure under bijection of their elements
  - bee hazʼáanii bijection átʼé unique łáaʼii éí maps every edge of onto an edge of b
Corresponds to a1 haʼátʼíísh?

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Rules:
  - rule marluk domains share ataaseq relational structure under bijection of their elements
  - rule bijection a unique ataaseq that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule tupela domains share wanpela relational structure ananit bijection bilong their elements
  - rule bijection is unique wanpela that maps every edge bilong onto wanpela edge bilong b
Corresponds long a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Nikanixi:
  - nikanixi nisha domains share kwëti relational structure under bijection of their elements
  - nikanixi bijection is unique kwëti that maps every edge of onto an edge of b
Corresponds to a1 kwèch?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule two domains share one relational structure кӏал bijection of their elements
  - rule bijection хила unique one that maps дерриг йист of onto an йист of b
Corresponds to a1 фу?

정의역 에이:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
규칙: 규칙 둘 domains 몫 하나 relational 구조...아래에서 전단사...의 그들의 elements; 규칙 전단사 is 유일무이하다 하나 그 maps 각 edge...의 onto an edge...의 b.
corresponds...으로 a1 무엇?

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Arau:
  - arau the bi domains akzio bat relational structure under bat bijection of their elements
  - arau the bijection izan the unique bat hura maps every ertz of bat onto bat ertz of b
Corresponds to a1 zer?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule ᏔᎵ domains share ᏌᏊᎢ relational structure ᎭᏫᎾᏗᏢ bijection of their elements
  - rule bijection is unique ᏌᏊᎢ Ꮎ maps every ᎠᏍᏛᎢ of onto an ᎠᏍᏛᎢ of b
What corresponds to a1?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule iskay domains share huk relational structure under bijection of their elements
  - rule bijection tiyay unique huk chay maps tukuy pata of onto an pata of b
Corresponds to a1 what?

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Rules:
  - rule the тӏу domains share зы relational structure чӏэгъ bijection of their elements
  - rule the bijection is the unique зы that maps every edge of onto an edge of b
Corresponds to a1 сыд?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Cai:
  - cai ob domains faib ib relational structure under bijection of their elements
  - cai bijection is unique ib qhov ntawd maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule two domains share ganbu relational structure under bijection of their elements
  - rule bijection is unique ganbu that maps every edge of onto an edge of b
Corresponds to a1 ining-jak?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule toklo domains share chaffa relational structure under bijection of their elements
  - rule bijection is unique chaffa that maps every edge of onto an edge of b
Corresponds to a1 nanta?

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Rules:
  - rule ツ゚ㇷ゚ domains share シネ relational structure under bijection of their elements
  - rule bijection is unique シネ that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule ӈирэӄ domains share ыннен relational structure under bijection of their elements
  - rule bijection is unique ыннен that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule kaʼa domains share hun relational structure under bijection of their elements
  - rule bijection yan unique hun that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule wíʼiną domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every edge of onto an edge of b
Corresponds to a1 híli?

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Rules:
  - rule the núŋpa domains share waŋží relational structure under bijection of their elements
  - rule the bijection is the unique waŋží that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule the mokõi domains share peteĩ relational structure under bijection of their elements
  - rule the bijection is the unique peteĩ that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Rules:
  - rule paya domains share maya relational structure under maya bijection of their elements
  - rule bijection is unique maya that maps every edge of maya onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule two domains share one relational structure under bijection of their elements
  - rule bijection ǀîi unique one tVʻVV-sà kV maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Rules:
  - rule менӈ domains share нин relational structure under bijection of their elements
  - rule bijection is unique нин that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule saliʔ domains share one relational structure under bijection of their elements
  - rule bijection is unique one that maps every ʔili of onto an ʔili of b
Corresponds to a1 what?

Domain a:
  - a2 a0 drives
  - a2 a1 drives
  - a4 a1 drives
  - a4 a2 drives
  - a3 a1 drives
  - a1 a0 drives
Domain b:
  - b4 b2 flows_to
  - b3 b4 flows_to
  - b1 b2 flows_to
  - b1 b4 flows_to
  - b0 b4 flows_to
  - b3 b1 flows_to
Rules:
  - rule kampeipi domains share koli relational structure under bijection of their elements
  - rule bijection is unique koli that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule the two domains share one relational structure under bijection of their elements
  - rule the bijection is the unique one that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule ne ume domains share se relational structure under bijection of their elements
  - rule ne bijection nemi ne unique se that maps every edge of onto an edge of b
Corresponds to a1 tay?

Domain a :
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b :
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Les règles sont:
  - règle le deux domains part un relationnel structure sous un bijection de leur éléments
  - règle le bijection être l'unique un que maps tout bord d'un sur un bord de b
Quoi corresponds pour a1 ?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Fonta aro bit:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Regulo:
  - regulo du domains parto unu relational strukturo sub dissurĵeto de ilia elements
  - regulo dissurĵeto egali unika unu ke maps ĉiu rando de sur se rando de bit
Corresponds al a1 kio?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Szabályok:
  - szabály a kettő domains részesedés egy relációs szerkezet alatt bijekció of their elements
  - szabály a bijekció van a egyedi egy hogy maps minden szél of onto egy szél of b
Corresponds hogy a1 melyik?

domain a:
  - a2drivesa0
  - a2drivesa1
  - a4drivesa1
  - a4drivesa2
  - a3drivesa1
  - a1drivesa0
domain b:
  - b4flows_tob2
  - b3flows_tob4
  - b1flows_tob2
  - b1flows_tob4
  - b0flows_tob4
  - b3flows_tob1
rules:
  - rule:二domains股票一relationalstructureunder一bijection...嘅他們的elements
  - rule:bijection是unique一嘅maps每edge...嘅一ontoanedge...嘅b
corresponds to:a1乜嘢?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Rules:
  - rule 二 domains share 一 relational structure under bijection of their elements
  - rule bijection 有ん unique 一 that maps every edge of onto an edge of b
Corresponds to a1 what?

Domain a:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
Domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
Ереже:
  - ереже екі domains үлес бір relational құрылым астында bijection туралы their elements
  - ереже bijection is бірегей бір that maps әр edge туралы onto an edge туралы b
Corresponds to a1 не?

תְּחוּם איי:
  - a2 drives a0
  - a2 drives a1
  - a4 drives a1
  - a4 drives a2
  - a3 drives a1
  - a1 drives a0
domain b:
  - b4 flows_to b2
  - b3 flows_to b4
  - b1 flows_to b2
  - b1 flows_to b4
  - b0 flows_to b4
  - b3 flows_to b1
מָשַׁל:
  - מָשַׁל ה־ שתיים domains חֵלֶק אַחַת relational מִבְנֶה תַּחַת אַחַת bijection שֶׁל שלהם elements
  - מָשַׁל ה־ bijection הוא ה־ unique אַחַת אֲשֶׁר maps כֹּל שָׂפָה שֶׁל אַחַת על אחד שָׂפָה שֶׁל b
איזה corresponds ל־ a1?