L059general language agent

The legal answers are: yes; no.
In the scene: o0 is a yellow cube; o2 is a red prism; o1 is an orange cone.
What exists: cube and does not yellow?

Las respuestas válidas son: sí; no.
En la escena: o0 es un cubo amarillo; o2 es un prisma rojo; o1 es un cono naranja.
¿Qué existe: cubo y no amarillo?

备选答案如下：是；否。
场景中：o0是一个黄色的立方体；o2是一个红色的棱镜；o1是一个橙色的圆锥。
存在于：立方体和不黄色的什么？

Answer options: evet; hayır.
Sahnede: o0 bir sarı küp; o2 bir kırmızı prizma; o1 bir turuncu koni.
Exists: küp ve sarı değil ne?

Answer options: ndiyo; hapana.
Katika tukio: o0 ni mchemraba manjano; o2 ni prizma nyekundu; o1 ni koni chungwa.
Exists: mchemraba na si manjano nini?

The legal answers are: yes; no.
In the scene: o0 is a yellow cube; o2 is a red prism; o1 is an orange cone.
What exists: block and does not golden?

{answer_options: [yes no], query: (exists cube (not yellow)), scene: [(obj o0 yellow cube) (obj o2 red prism) (obj o1 orange cone)]}

Antwort Alternativen: ja; nein.
In der Szene: o0 ist ein gelber Kubus; o2 ist ein rotes Prisma; o1 ist ein oranger Kegel.
Was exists: Kubus und nicht gelb?

О̏дгово̄р ѝзбор: да; no.
Позорје: o0 би̏ти жу̑т коцка; o2 би̏ти цр̀вен при̏зма; o1 би̏ти на̀ра̄нџаст stožac.
Exists: коцка и не жу̑т kakav?

Vastaus vaihtoehdot: kyllä; ei.
Näyttämö: o0 on keltainen kuutio; o2 on punainen prisma; o1 on oranssi kartio.
Mikä exists: kuutio ja ei keltainen?

备选答案如下：是；否。
场景中：o0是一个黄色的立方体；o2是一个红色的棱镜；o1是一个橙色的圆锥。
存在于：立方体和不黄色的什么？

答え選択:はい; いいえ.
現場:o0黄色い立方体です; o2赤いプリズムです; o1オレンジ色の松毬です.
exists:立方体と黄色い...ではない何と?

Answer options: evet; hayır.
Sahnede: o0 bir sarı küp; o2 bir kırmızı prizma; o1 bir turuncu koni.
Exists: küp ve sarı değil ne?

answer options: نَعَم؛ no.
مَنْظَر: o0 كَعْبَة أَصْفَر؛ o2 مَنْشُور أَحْمَر؛ o1 مَخْرُوط بُرْتُقَالِيّ.
exists: كَعْبَة وَـ لَا أَصْفَر مَاذَا؟

Პასუხი ვარიანტი: დიახ; no.
Scene: o0 ყვითელი კუბი ყოფნა; o2 წითელი პრიზმა ყოფნა; o1 ფორთოხალი გირჩა ყოფნა.
Exists: კუბი და არ ყვითელი რა?

Whakautu kōwhiringa: āe; kāo.
Kāpeka: o0 mataono kōwhai; o2 poro red; o1 koeko orange.
Exists: mataono me kāore kōwhai unutai?

Trả lời lựa chọn: vâng; no.
Giới: o0 là lập phương yellow; o2 là lăng kính đỏ; o1 là nón cam.
Exists: lập phương và không yellow gì?

คำตอบตัวเลือก:ใช่; ไฮ้.
scene:o0ถูกลูกบาศก์เหลือง; o2ถูกปริซึมแดง; o1ถูกกรวยส้ม.
exists:ลูกบาศก์และไม่เหลืองอะไร?

answer options: ஆம்; no.
scene: o0 மஞ்சள் cube; o2 சிவப்பு பட்டகம்; o1 ஆரஞ்சு cone.
exists: cube மற்றும் மஞ்சள் இல்லை என்ன?

Answer options: ndiyo; hapana.
Katika tukio: o0 ni mchemraba manjano; o2 ni prizma nyekundu; o1 ni koni chungwa.
Exists: mchemraba na si manjano nini?

Answer options: aooʼ; no.
Scene: o0 cube łitso átʼé; o2 prism łichííʼ átʼé; o1 cone chʼil łitsxooí átʼé.
Exists: cube dóó dooda łitso haʼátʼíísh?

Answer options: aap; no.
Scene: o0 cube sungaaqeq a; o2 prism aappalajaarpoq a; o1 cone appelsiina a.
Exists: cube aamma sungaaqeq not what?

Answer options: ya; no.
Scene: o0 yelopela cube; o2 ret prism; o1 orange cone.
Exists: cube na not yelopela what?

Answer options: yes; no.
Scene: o0 wisae cube; o2 màxke prism; o1 òlënchikte cone.
Exists: cube not wisae kwèch?

Answer options: yes; no.
Scene: o0 хила yellow cube; o2 хила цӏе prism; o1 хила orange cone.
Exists: cube а yellow ца фу?

대답 선택: 네; 아니요.
장면: o0 노란 정육면체; o2 빨갛다 프리즘; o1 주황색의 솔방울.
exists: 정육면체 안 노란 무엇?

Erantzun aukerongatik: bai; no.
Scene: o0 kubo hori bat dago; o2 prisma gorri bat dago; o1 pinaburu laranja bat dago.
Exists: kubo eta ez hori zer?

Answer options: ᎥᎥ; ᏝᏃ.
Scene: o0 ᏓᎶᏁᎦ cube; o2 ᎩᎦᎨ prism; o1 ᎣᏂᏥ cone.
What exists: cube ᎠᎴ ᏝᏃ ᏓᎶᏁᎦ?

Answer options: arí; mánan.
Scene: o0 tiyay gillu cube; o2 tiyay puka prism; o1 tiyay killmu cone.
Exists: cube ama gillu what?

Answer options: yes; no.
Scene: o0 cube гъожьы; o2 prism плъыжьы; o1 cone orange.
Exists: cube ыкӏи not гъожьы сыд?

Answer options: yes; no.
Scene: o0 daj cube; o2 liab prism; o1 orange cone.
Exists: cube thiab tsis daj what?

Answer options: ngai; woi.
Scene: o0 babedirreen cube; o2 red prism; o1 orange cone.
Exists: cube woi babedirreen ining-jak?

Answer options: i̠i; no.
Scene: o0 lakna cube; o2 homa prism; o1 orange cone.
Exists: cube micha' ki'yo lakna nanta?

Answer options: yes; ソモ.
Scene: o0 yellow cube; o2 フレ prism; o1 orange cone.
Exists: cube カ ソモ yellow what?

Answer options: yes; no.
Scene: o0 yellow cube; o2 чеԓгыԓьын prism; o1 orange cone.
Exists: cube ынкъам not yellow what?

Answer options: yes; no.
Scene: o0 yan yellow cube; o2 yan chak prism; o1 yan china cone.
Exists: cube yéetel ma' yellow what?

Answer options: hą; no.
Scene: o0 yellow cube; o2 red prism; o1 orange cone.
Exists: cube not yellow híli?

Answer options: yes; no.
Scene: o0 cube zí; o2 prism red; o1 cone orange.
Exists: cube na zí not what?

Answer options: heẽ; nahániri.
Scene: o0 cube yellow; o2 prism pytã; o1 cone narã.
Exists: cube nahániri yellow what?

Answer options: jisa; no.
Scene: o0 maya yellow cube; o2 maya chupika prism; o1 maya orange cone.
Exists: cube not yellow what?

Answer options: ʻée; ʻĩĩ.
Scene: o0 ǀîi cube yellow; o2 ǀîi prism red; o1 ǀîi cone orange.
Exists: cube ǂʻá ǁʻàa yellow what?

Answer options: yes; no.
Scene: o0 yellow cube; o2 red prism; o1 orange cone.
Exists: cube not yellow what?

Answer options: yes; no.
Scene: o0 yellow cube; o2 red prism; o1 orange cone.
Exists: cube not yellow what?

Answer options: yes; no.
Scene: o0 yellow cube; o2 red prism; o1 orange cone.
Exists: cube not yellow what?

Answer options: ee; no.
Scene: o0 cube yellow; o2 prism red; o1 cone orange.
Exists: cube not yellow what?

Answer options: yes; inte.
Scene: o0 nemi yellow cube; o2 nemi red prism; o1 nemi orange cone.
Exists: cube inte yellow tay?

Réponse choix : oui ; no.
Dans la scène : o0 est un cube jaune ; o2 est un prisme rouge ; o1 est un cône orange.
Quoi exists : cube et pas jaune ?

Respondo alternativo: jes; no.
Sceno: o0 egali flava kubo; o2 egali ruĝa prismo; o1 egali oranĝa strobilo.
Exists: kubo kaj ne flava kio?

Válasz lehetőségek: igen; no.
Szín: o0 sárga kocka; o2 piros hasáb; o1 narancssárga toboz.
Exists: kocka és nem sárga melyik?

回答選擇:係; no.
scene:o0是一黃cube; o2是一紅prism; o1是一橙色cone.
exists:cube及不黃乜嘢?

Answer options: yes; no.
Scene: o0 有ん 黄色 cube; o2 有ん red prism; o1 有ん orange cone.
Exists: cube とぅ not 黄色 what?

Жауап опцион: иә; жоқ.
Scene: o0 сары куб; o2 қызыл призма; o1 апельсин бүршік.
Exists: куб және емес сары не?

תְּשׁוּבָה אפשרויות: כֵּן; no.
סְצֵנָה: o0 הוּא קובייה צָהֹב אֶחָד; o2 הוּא מִנְסָרָה אָדוֹם אַחַת; o1 הוּא אצטרובל כָּתֹם אֶחָד.
איזה exists: קובייה וְ־ לא צָהֹב?

Answer options: იახ; no.
Scene: o0 yellow cube; o2 red prism; o1 orange cone.
Exists: cube დო not yellow what?

Jawaban pilihan-pilihan: ya; no.
Tempat kejadian: o0 adalah kubus kuning; o2 adalah prisma merah; o1 adalah kerucut jingga.
Exists: kubus dan tidak kuning apa?

ពាក្យឆ្លើយជំរើស:ច៎ា; ទេ.
scene:o0ត្រូវបានគូបលឿង; o2ត្រូវបានព្រីសក្រហម; o1ត្រូវបានកោណពណ៌លឿង.
exists:គូបនឹងមិន...ទេលឿងអី?

ຄຳຕອບທາງເລືອກ:ແມ່ນ; no.
scene:o0ຢູ່ລູກບາດເຫຼືອງ; o2ຢູ່prismແດງ; o1ຢູ່coneສົ້ມ.
exists:ລູກບາດແລະບໍ່ເຫຼືອງຫຍັງ?

answer options: అవును; no.
దృశ్యం: o0 పసుపు cube ఉండు; o2 ఎర్ర పట్టకం ఉండు; o1 నారింజచెట్టు cone ఉండు.
exists: cube మరియు పసుపు కాదు ఏమిటి?

Answer options: bẹ́ẹ̀ ni; rárá.
Scene: o0 wà cube àwo òdodo; o2 wà prism pupa; o1 wà cone bí ọsán.
What exists: cube rárá àwo òdodo?

Answer options: au; no.
Scene: o0 łitsog cube naiágúóli; o2 łichíí prism naiágúóli; o1 orange cone naiágúóli.
Exists: cube dawǫ́’ łitsog what?

answer options: yes; ᐋᒃᑲ.
scene: o0 yellow cube; o2 red prism; o1 orange cone.
exists: cube ᐋᒃᑲ yellow what?

Answer options: yes; no.
Scene: o0 geri cube; o2 red prism; o1 alanya cone.
Exists: cube not geri what?

Answer options: yes; no.
Scene: o0 yellow cube; o2 red prism; o1 orange cone.
Exists: cube not yellow what?

Answer options: yes; no.
Scene: o0 хъипи cube; o2 red prism; o1 orange cone.
Exists: cube хъипи not вуч?

The legal answers are: option_b; option_d; option_c; option_a.
The candidates are: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm and nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd and lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt and nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm and ptsv.
The prerequisites are:
  - nvmt requires lnpm
  - vzgd requires nvmt
  - ptsv requires lnpm
  - vzgd requires lnpm
  - nvmt requires rrnm
Student knows: vndt.
What is the ordering that teaches most?

Las respuestas válidas son: opción B; opción D; opción C; opción A.
Los candidatos son: opción B el orden ptsv, vndt, vzgd, lnpm, rrnm y nvmt; opción Al orden ptsv, vndt, nvmt, rrnm, vzgd y lnpm; opción D el orden vzgd, lnpm, rrnm, ptsv, vndt y nvmt; opción C el orden vndt, vzgd, lnpm, nvmt, rrnm y ptsv.
Los requisitos previos son:
  - nvmt requiere lnpm
  - vzgd requiere nvmt
  - ptsv requiere lnpm
  - vzgd requiere lnpm
  - nvmt requiere rrnm
El estudiante sabe: vndt.
¿Qué el orden that teaches la mayoría?

备选答案如下：选项B；选项D；选项C；选项A。
候选项如下：选项B的顺序是ptsv、vndt、vzgd、lnpm、rrnm和nvmt；选项A的顺序是ptsv、vndt、nvmt、rrnm、vzgd和lnpm；选项D的顺序是vzgd、lnpm、rrnm、ptsv、vndt和nvmt；选项C的顺序是vndt、vzgd、lnpm、nvmt、rrnm和ptsv。
前置条件如下：
  - nvmt需要lnpm
  - vzgd需要nvmt
  - ptsv需要lnpm
  - vzgd需要lnpm
  - nvmt需要rrnm
学生已知：vndt。
的顺序是thatteaches大多数什么？

Answer options: option_b; option_d; option_c; option_a.
Adaylar: option_b ptsv, vndt, vzgd, lnpm, rrnm ve nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd ve lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt ve nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm ve ptsv ordering.
Prerequisites:
  - nvmt lnpm gerektirir
  - vzgd nvmt gerektirir
  - ptsv lnpm gerektirir
  - vzgd lnpm gerektirir
  - nvmt rrnm gerektirir
Student knows: vndt.
Ordering that teaches çoğu ne?

Answer options: option_b; option_d; option_c; option_a.
Wagombea ni: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm na nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd na lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt na nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm na ptsv.
Prerequisites:
  - nvmt inahitaji lnpm
  - vzgd inahitaji nvmt
  - ptsv inahitaji lnpm
  - vzgd inahitaji lnpm
  - nvmt inahitaji rrnm
Student knows: vndt.
Ordering that teaches wengi nini?

The legal answers are: option_b; option_d; option_c; option_a.
The candidates are: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm and nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd and lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt and nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm and ptsv.
The prerequisites are:
  - nvmt requires lnpm
  - vzgd requires nvmt
  - ptsv requires lnpm
  - vzgd requires lnpm
  - nvmt requires rrnm
Student knows: vndt.
What is the ordering that teaches most?

{answer_options: [option_b option_d option_c option_a], candidates: [(ordering option_b [ptsv vndt vzgd lnpm rrnm nvmt]) (ordering option_a [ptsv vndt nvmt rrnm vzgd lnpm]) (ordering option_d [vzgd lnpm rrnm ptsv vndt nvmt]) (ordering option_c [vndt vzgd lnpm nvmt rrnm ptsv])], prerequisites: [(requires nvmt lnpm) (requires vzgd nvmt) (requires ptsv lnpm) (requires vzgd lnpm) (requires nvmt rrnm)], query: ordering_that_teaches_most, student_knows: [vndt]}

Antwort Alternativen: option_b; option_d; option_c; option_a.
Die Kandidaten sind: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm und nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd und lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt und nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm und ptsv.
Voraussetzungen:
  - nvmt brauchen lnpm
  - vzgd brauchen nvmt
  - ptsv brauchen lnpm
  - vzgd brauchen lnpm
  - nvmt brauchen rrnm
Student wissen: vndt.
Was ordering dass teaches die meisten?

О̏дгово̄р ѝзбор: option_b; option_d; option_c; option_a.
Кандѝда̄т: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm и nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd и lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt и nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm и ptsv.
Преду́слов:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Сту̀дент знати: vndt.
Ordering да teaches većina kakav?

Vastaus vaihtoehdot: option_b; option_d; option_c; option_a.
Ehdokkaat: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm ja nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd ja lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt ja nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ja ptsv.
Edellytykset:
  - nvmt vaatia lnpm
  - vzgd vaatia nvmt
  - ptsv vaatia lnpm
  - vzgd vaatia lnpm
  - nvmt vaatia rrnm
Opiskelija tietää: vndt.
Mikä ordering että teaches useimmat?

备选答案如下：选项B；选项D；选项C；选项A。
候选项如下：选项B的顺序是ptsv、vndt、vzgd、lnpm、rrnm和nvmt；选项A的顺序是ptsv、vndt、nvmt、rrnm、vzgd和lnpm；选项D的顺序是vzgd、lnpm、rrnm、ptsv、vndt和nvmt；选项C的顺序是vndt、vzgd、lnpm、nvmt、rrnm和ptsv。
前置条件如下：
  - nvmt需要lnpm
  - vzgd需要nvmt
  - ptsv需要lnpm
  - vzgd需要lnpm
  - nvmt需要rrnm
学生已知：vndt。
的顺序是thatteaches大多数什么？

答え選択:option_b; option_d; option_c; option_a.
候補者:option_bptsv, vndt, vzgd, lnpm, rrnmとnvmtordering; option_aptsv, vndt, nvmt, rrnm, vzgdとlnpmordering; option_dvzgd, lnpm, rrnm, ptsv, vndtとnvmtordering; option_cvndt, vzgd, lnpm, nvmt, rrnmとptsvordering.
前提:
  - nvmtlnpm必要とする
  - vzgdnvmt必要とする
  - ptsvlnpm必要とする
  - vzgdlnpm必要とする
  - nvmtrrnm必要とする
学生知る:vndt.
orderingそのteaches大部分何と?

Answer options: option_b; option_d; option_c; option_a.
Adaylar: option_b ptsv, vndt, vzgd, lnpm, rrnm ve nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd ve lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt ve nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm ve ptsv ordering.
Prerequisites:
  - nvmt lnpm gerektirir
  - vzgd nvmt gerektirir
  - ptsv lnpm gerektirir
  - vzgd lnpm gerektirir
  - nvmt rrnm gerektirir
Student knows: vndt.
Ordering that teaches çoğu ne?

answer options: option_b؛ option_d؛ option_c؛ option_a.
مُرَشَّح: ordering option_b ptsv، vndt، vzgd، lnpm، rrnm وَـ nvmt؛ ordering option_a ptsv، vndt، nvmt، rrnm، vzgd وَـ lnpm؛ ordering option_d vzgd، lnpm، rrnm، ptsv، vndt وَـ nvmt؛ ordering option_c vndt، vzgd، lnpm، nvmt، rrnm وَـ ptsv.
شَرْط:
  - اِقْتَضَى nvmt lnpm
  - اِقْتَضَى vzgd nvmt
  - اِقْتَضَى ptsv lnpm
  - اِقْتَضَى vzgd lnpm
  - اِقْتَضَى nvmt rrnm
طَالِب عَلِمَ: vndt.
ordering أَنْ teaches أَكْثَر مَاذَا؟

Პასუხი ვარიანტი: option_b; option_d; option_c; option_a.
Კანდიდატები: option_b ptsv, vndt, vzgd, lnpm, rrnm და nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd და lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt და nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm და ptsv ordering.
Წინაპირობა:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Მოსწავლე ცოდნა: vndt.
Ordering რომ teaches უმეტესობა რა?

Whakautu kōwhiringa: option_b; option_d; option_c; option_a.
Kaiwhakauru: ordering option_b ptsv, vndt, vzgd, lnpm, rrnm me nvmt; ordering option_a ptsv, vndt, nvmt, rrnm, vzgd me lnpm; ordering option_d vzgd, lnpm, rrnm, ptsv, vndt me nvmt; ordering option_c vndt, vzgd, lnpm, nvmt, rrnm me ptsv.
Prerequisites:
  - require nvmt lnpm
  - require vzgd nvmt
  - require ptsv lnpm
  - require vzgd lnpm
  - require nvmt rrnm
Student knows: vndt.
Ordering tēnā teaches nuinga unutai?

Trả lời lựa chọn: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm và nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd và lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt và nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm và ptsv.
Prerequisites:
  - nvmt yêu cầu lnpm
  - vzgd yêu cầu nvmt
  - ptsv yêu cầu lnpm
  - vzgd yêu cầu lnpm
  - nvmt yêu cầu rrnm
Học sinh biết: vndt.
Ordering rằng teaches hầu hết gì?

คำตอบตัวเลือก:option_b; option_d; option_c; option_a.
ผู้สมัคร:option_borderingptsv, vndt, vzgd, lnpm, rrnmและnvmt; option_aorderingptsv, vndt, nvmt, rrnm, vzgdและlnpm; option_dorderingvzgd, lnpm, rrnm, ptsv, vndtและnvmt; option_corderingvndt, vzgd, lnpm, nvmt, rrnmและptsv.
prerequisites:
  - nvmtrequirelnpm
  - vzgdrequirenvmt
  - ptsvrequirelnpm
  - vzgdrequirelnpm
  - nvmtrequirerrnm
นักเรียนรู้:vndt.
orderingว่าteachesส่วนใหญ่อะไร?

answer options: option_b; option_d; option_c; option_a.
வேட்பாளர்: option_b ptsv, vndt, vzgd, lnpm, rrnm மற்றும் nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd மற்றும் lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt மற்றும் nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm மற்றும் ptsv ordering.
prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
கற்பவன் தெரிந்திரு: vndt.
ordering எப்படி teaches most என்ன?

Answer options: option_b; option_d; option_c; option_a.
Wagombea ni: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm na nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd na lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt na nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm na ptsv.
Prerequisites:
  - nvmt inahitaji lnpm
  - vzgd inahitaji nvmt
  - ptsv inahitaji lnpm
  - vzgd inahitaji lnpm
  - nvmt inahitaji rrnm
Student knows: vndt.
Ordering that teaches wengi nini?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ptsv, vndt, vzgd, lnpm, rrnm dóó nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd dóó lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt dóó nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm dóó ptsv ordering.
Prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Ółtaʼí bił bééhózin: vndt.
Ordering éí teaches most haʼátʼíísh?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ptsv, vndt, vzgd, lnpm, rrnm aamma nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd aamma lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt aamma nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm aamma ptsv ordering.
Prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm na nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd na lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt na nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm na ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most kwèch?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm а nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd а lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt а nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm а ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most фу?

대답 선택: option_b; option_d; option_c; option_a.
후보자: option_b ptsv, vndt, vzgd, lnpm, rrnm nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm ptsv ordering.
prerequisites:
  - nvmt lnpm 요구하다
  - vzgd nvmt 요구하다
  - ptsv lnpm 요구하다
  - vzgd lnpm 요구하다
  - nvmt rrnm 요구하다
학생 알다: vndt.
ordering 그 teaches 가장 무엇?

Erantzun aukerongatik: option_b; option_d; option_c; option_a.
Kandidatu: option_b ptsv, vndt, vzgd, lnpm, rrnm eta nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd eta lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt eta nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm eta ptsv ordering.
Prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Ikasle jakin: vndt.
Ordering hura teaches most zer?

Answer options: option_b; option_d; option_c; option_a.
ᎠᏙᎩᏯᏍᎩ: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm ᎠᎴ nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd ᎠᎴ lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt ᎠᎴ nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ᎠᎴ ptsv.
Prerequisites:
  - nvmt ᎤᏂᎬᎦ lnpm
  - vzgd ᎤᏂᎬᎦ nvmt
  - ptsv ᎤᏂᎬᎦ lnpm
  - vzgd ᎤᏂᎬᎦ lnpm
  - nvmt ᎤᏂᎬᎦ rrnm
ᏗᏕᏠᏆᏍᎩ ᎤᏅᏔ: vndt.
What ordering Ꮎ teaches ᎤᎪᏗᏗ?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Yachakuq riqsiy: vndt.
Ordering chay teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ptsv, vndt, vzgd, lnpm, rrnm ыкӏи nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd ыкӏи lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt ыкӏи nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm ыкӏи ptsv ordering.
Prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Student knows: vndt.
Ordering that teaches most сыд?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm thiab nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd thiab lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt thiab nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm thiab ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering qhov ntawd teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most ining-jak?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm micha' nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd micha' lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt micha' nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm micha' ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most nanta?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ptsv, vndt, vzgd, lnpm, rrnm カ nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd カ lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt カ nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm カ ptsv ordering.
Prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm ынкъам nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd ынкъам lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt ынкъам nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ынкъам ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm yéetel nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd yéetel lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt yéetel nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm yéetel ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most híli?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ptsv, vndt, vzgd, lnpm, rrnm na nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd na lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt na nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm na ptsv ordering.
Prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ptsv, vndt, vzgd, lnpm, rrnm nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm ptsv ordering.
Prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm ǂʻá nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd ǂʻá lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt ǂʻá nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ǂʻá ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering tVʻVV-sà kV teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ptsv, vndt, vzgd, lnpm, rrnm nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm ptsv ordering.
Prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ptsv, vndt, vzgd, lnpm, rrnm nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm ptsv ordering.
Prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most tay?

Réponse choix : option_b ; option_d ; option_c ; option_a.
Les candidats sont : option_b ordering ptsv, vndt, vzgd, lnpm, rrnm et nvmt ; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd et lnpm ; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt et nvmt ; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm et ptsv.
Préalables :
  - nvmt demander lnpm
  - vzgd demander nvmt
  - ptsv demander lnpm
  - vzgd demander lnpm
  - nvmt demander rrnm
Étudiant savoir : vndt.
Quoi ordering que teaches le plus ?

Respondo alternativo: option_b; option_d; option_c; option_a.
Kandidato: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm kaj nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd kaj lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt kaj nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm kaj ptsv.
Prerequisites:
  - nvmt bezoni lnpm
  - vzgd bezoni nvmt
  - ptsv bezoni lnpm
  - vzgd bezoni lnpm
  - nvmt bezoni rrnm
Lernanto scii: vndt.
Ordering ke teaches plej kio?

Válasz lehetőségek: option_b; option_d; option_c; option_a.
Indulók: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm és nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd és lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt és nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm és ptsv.
Előfeltételek:
  - nvmt követel lnpm
  - vzgd követel nvmt
  - ptsv követel lnpm
  - vzgd követel lnpm
  - nvmt követel rrnm
Hallgató tud: vndt.
Ordering hogy teaches legtöbb melyik?

回答選擇:option_b; option_d; option_c; option_a.
候選人:option_borderingptsv, vndt, vzgd, lnpm, rrnm及nvmt; option_aorderingptsv, vndt, nvmt, rrnm, vzgd及lnpm; option_dorderingvzgd, lnpm, rrnm, ptsv, vndt及nvmt; option_corderingvndt, vzgd, lnpm, nvmt, rrnm及ptsv.
prerequisites:
  - nvmtrequirelnpm
  - vzgdrequirenvmt
  - ptsvrequirelnpm
  - vzgdrequirelnpm
  - nvmtrequirerrnm
學生知:vndt.
ordering嘅teaches多數乜嘢?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm とぅ nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd とぅ lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt とぅ nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm とぅ ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most what?

Жауап опцион: option_b; option_d; option_c; option_a.
Үміткер: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm және nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd және lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt және nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm және ptsv.
Алғышарт:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Студент білу: vndt.
Ordering that teaches ең не?

תְּשׁוּבָה אפשרויות: option_b; option_d; option_c; option_a.
מועמדת: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm וְ־ nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd וְ־ lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt וְ־ nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm וְ־ ptsv.
prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
סְטוּדֶנְט יָדַע: vndt.
איזה ordering אֲשֶׁר teaches רוב?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm დო nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd დო lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt დო nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm დო ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most what?

Jawaban pilihan-pilihan: option_b; option_d; option_c; option_a.
Kandidat: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm dan nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd dan lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt dan nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm dan ptsv.
Prasyarat-prasyarat:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Murid tahu: vndt.
Ordering bahwa teaches most apa?

ពាក្យឆ្លើយជំរើស:option_b; option_d; option_c; option_a.
បេក្ខជន:option_borderingptsv, vndt, vzgd, lnpm, rrnmនឹងnvmt; option_aorderingptsv, vndt, nvmt, rrnm, vzgdនឹងlnpm; option_dorderingvzgd, lnpm, rrnm, ptsv, vndtនឹងnvmt; option_corderingvndt, vzgd, lnpm, nvmt, rrnmនឹងptsv.
prerequisites:
  - nvmtrequirelnpm
  - vzgdrequirenvmt
  - ptsvrequirelnpm
  - vzgdrequirelnpm
  - nvmtrequirerrnm
កូនសិស្សចេរ:vndt.
orderingថាteachesជាងគេអី?

ຄຳຕອບທາງເລືອກ:option_b; option_d; option_c; option_a.
ຜູ້ສະໝັກ:option_borderingptsv, vndt, vzgd, lnpm, rrnmແລະnvmt; option_aorderingptsv, vndt, nvmt, rrnm, vzgdແລະlnpm; option_dorderingvzgd, lnpm, rrnm, ptsv, vndtແລະnvmt; option_corderingvndt, vzgd, lnpm, nvmt, rrnmແລະptsv.
prerequisites:
  - nvmtຕ້ອງການlnpm
  - vzgdຕ້ອງການnvmt
  - ptsvຕ້ອງການlnpm
  - vzgdຕ້ອງການlnpm
  - nvmtຕ້ອງການrrnm
ນັກສຶກສາຮູ້:vndt.
orderingນັ້ນteaches...ທີ່ສຸດຫຍັງ?

answer options: option_b; option_d; option_c; option_a.
candidates: option_b ptsv, vndt, vzgd, lnpm, rrnm మరియు nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd మరియు lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt మరియు nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm మరియు ptsv ordering.
prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
student knows: vndt.
ordering ఆ teaches most ఏమిటి?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
What ordering that teaches most?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ptsv, vndt, vzgd, lnpm, rrnm nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm ptsv ordering.
Prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Student knows: vndt.
Ordering that teaches most what?

answer options: option_b; option_d; option_c; option_a.
candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
student knows: vndt.
ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ordering ptsv, vndt, vzgd, lnpm, rrnm nvmt; option_a ordering ptsv, vndt, nvmt, rrnm, vzgd lnpm; option_d ordering vzgd, lnpm, rrnm, ptsv, vndt nvmt; option_c ordering vndt, vzgd, lnpm, nvmt, rrnm ptsv.
Prerequisites:
  - nvmt require lnpm
  - vzgd require nvmt
  - ptsv require lnpm
  - vzgd require lnpm
  - nvmt require rrnm
Student knows: vndt.
Ordering that teaches most what?

Answer options: option_b; option_d; option_c; option_a.
Candidates: option_b ptsv, vndt, vzgd, lnpm, rrnm nvmt ordering; option_a ptsv, vndt, nvmt, rrnm, vzgd lnpm ordering; option_d vzgd, lnpm, rrnm, ptsv, vndt nvmt ordering; option_c vndt, vzgd, lnpm, nvmt, rrnm ptsv ordering.
Prerequisites:
  - nvmt lnpm require
  - vzgd nvmt require
  - ptsv lnpm require
  - vzgd lnpm require
  - nvmt rrnm require
Student knows: vndt.
Ordering that teaches most вуч?

The legal answers are: praised; avoided; followed; watched.
The sentence is:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
What is the verb of erin?

Las respuestas válidas son: elogió; evitó; siguió; observó.
La frase es:
  - erin
  - frank
  - dave
  - alice
  - siguió
  - observó
  - elogió
  - evitó
  - dos veces
¿Qué verb: erin?

备选答案如下：praised；avoided；followed；watched。
句子是：
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
verb的：erin什么？

Answer options: praised; avoided; followed; watched.
Cümle:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb: erin ne?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb ya: erin nini?

The legal answers are: praised; avoided; followed; watched.
The sentence is:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
What is the verb of erin?

{answer_options: [praised avoided followed watched], query: (verb_of erin), sentence: [erin frank dave alice followed watched praised avoided twice]}

Antwort Alternativen: lobte; begrüßte; trug; mied.
Der Satz ist:
  - erin
  - frank
  - dave
  - alice
  - trug
  - mied
  - lobte
  - begrüßte
  - zweimal
Was Verb aus erin?

О̏дгово̄р ѝзбор: praised; avoided; followed; watched.
Речѐница:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Гла̏гол od erin kakav?

Vastaus vaihtoehdot: katsoi; tervehti; kantoi; vältti.
Virke:
  - erin
  - frank
  - dave
  - alice
  - kantoi
  - vältti
  - katsoi
  - tervehti
  - hitaasti
Mikä verbi vaille erin?

备选答案如下：praised；avoided；followed；watched。
句子是：
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
verb的：erin什么？

答え選択:praised; avoided; followed; watched.
文:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
動詞の中の:erin何と?

Answer options: praised; avoided; followed; watched.
Cümle:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb: erin ne?

answer options: praised؛ avoided؛ followed؛ watched.
جُمْلَة:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
فِعْل مِنْ erin مَاذَا؟

Პასუხი ვარიანტი: praised; avoided; followed; watched.
Წინადადება:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Ზმნა of erin რა?

Whakautu kōwhiringa: praised; avoided; followed; watched.
Haurārangi:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Kupumahi o erin unutai?

Trả lời lựa chọn: praised; avoided; followed; watched.
Câu:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Động từ bằng erin gì?

คำตอบตัวเลือก:praised; avoided; followed; watched.
ประโยค:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
คำกริยาของ:erinอะไร?

answer options: praised; avoided; followed; watched.
sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
வினைச்சொல் கொண்ட erin என்ன?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb ya: erin nini?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Áhátʼíinii of erin haʼátʼíísh?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Oqaluut of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb bilong erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin kwèch?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin фу?

대답 선택: praised; avoided; followed; watched.
문장:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
동사...의 erin 무엇?

Erantzun aukerongatik: praised; avoided; followed; watched.
Esaldi:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Aditz of erin zer?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
What verb of erin?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Ruray rimana of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin сыд?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin ining-jak?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin nanta?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin híli?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Parliri of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin tay?

Réponse choix : loua ; évitait ; suivait ; regardait.
La phrase est:
  - erin
  - frank
  - dave
  - alice
  - suivait
  - regardait
  - loua
  - évitait
  - maintenant
Quoi verbe d'erin ?

Respondo alternativo: praised; avoided; followed; watched.
Frazo:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verbo de erin kio?

Válasz lehetőségek: dicsért; elkerült; követett; nézett.
Mondat:
  - erin
  - frank
  - dave
  - alice
  - követett
  - nézett
  - dicsért
  - elkerült
  - kétszer
Ige of erin melyik?

回答選擇:praised; avoided; followed; watched.
句子:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
動詞...嘅:erin乜嘢?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Жауап опцион: praised; avoided; followed; watched.
Сөйлем:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Етістік туралы erin не?

תְּשׁוּבָה אפשרויות: praised; avoided; followed; watched.
מִשְׁפָּט:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
איזה פועל שֶׁל erin?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Jawaban pilihan-pilihan: praised; avoided; followed; watched.
Kalimat:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Kata kerja dari erin apa?

ពាក្យឆ្លើយជំរើស:praised; avoided; followed; watched.
ល្បះ:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
កិរិយាស័ព្ទនៃ:erinអី?

ຄຳຕອບທາງເລືອກ:praised; avoided; followed; watched.
ປະໂຫຍກ:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
ຄຳກຳມະຂອງ:erinຫຍັງ?

answer options: praised; avoided; followed; watched.
వాక్యము:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
క్రియ of erin ఏమిటి?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
What ọ̀rọ̀-ìṣe of erin?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

answer options: praised; avoided; followed; watched.
sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin what?

Answer options: praised; avoided; followed; watched.
Sentence:
  - erin
  - frank
  - dave
  - alice
  - followed
  - watched
  - praised
  - avoided
  - twice
Verb of erin вуч?

The legal answers are:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 requires sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 requires sub2
  - achieved sub3
  - sub1 requires sub0
  - sub4 requires sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 requires sub5
  - achieved sub2
The rules are:
  - rule the top goal needs every subgoal that is part of it
  - rule a subgoal is actionable if and only if it is unachieved and every subgoal it requires is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
What is the next subgoal?

Las respuestas válidas son:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
La descomposición es:
  - sub4 requiere sub1
  - sub4 es parte de mission
  - sub1 es parte de mission
  - sub2 es parte de mission
  - sub0 es parte de mission
  - sub5 es parte de mission
  - sub4 requiere sub2
  - logró: sub3
  - sub1 requiere sub0
  - sub4 requiere sub0
  - sub3 es parte de mission
  - logró: sub5
  - sub2 requiere sub5
  - logró: sub2
Las reglas son:
  - la regla: el top el objetivo necesita every el subobjetivo that es part de it
  - la regla: al subobjetivo es actionable si y sólo si it es unachieved y every el subobjetivo it requiere es logró
  - la regla: exactamente one el subobjetivo es actionable
El objetivo principal es mission.
¿Qué next el subobjetivo?

备选答案如下：
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
分解如下：
  - sub4需要sub1
  - sub4属于mission
  - sub1属于mission
  - sub2属于mission
  - sub0属于mission
  - sub5属于mission
  - sub4需要sub2
  - 达成了：sub3
  - sub1需要sub0
  - sub4需要sub0
  - sub3属于mission
  - 达成了：sub5
  - sub2需要sub5
  - 达成了：sub2
规则如下：规则：这top的目标是需要every的子目标是that是part的it；规则：一的子目标是是actionable当且仅当it是unachieved和every的子目标是it需要是达成了；规则：恰好是one的子目标是是actionable。
顶层目标是mission。
next的子目标是什么？

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 gerektirir
  - sub4 mission part
  - sub1 mission part
  - sub2 mission part
  - sub0 mission part
  - sub5 mission part
  - sub4 sub2 gerektirir
  - achieved: sub3
  - sub1 sub0 gerektirir
  - sub4 sub0 gerektirir
  - sub3 mission part
  - achieved: sub5
  - sub2 sub5 gerektirir
  - achieved: sub2
Kurallar:
  - kural: top hedef gereksinim every subgoal that part it
  - kural: bir subgoal actionable iff it unachieved ve every subgoal it gerektirir achieved
  - kural: exactly one subgoal actionable
Top goal: mission.
Sonraki subgoal ne?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 inahitaji sub1
  - sub4 part ya mission
  - sub1 part ya mission
  - sub2 part ya mission
  - sub0 part ya mission
  - sub5 part ya mission
  - sub4 inahitaji sub2
  - achieved: sub3
  - sub1 inahitaji sub0
  - sub4 inahitaji sub0
  - sub3 part ya mission
  - achieved: sub5
  - sub2 inahitaji sub5
  - achieved: sub2
Sheria ni:
  - sheria: top goal uhitaji every subgoal that ni part ya it
  - sheria: subgoal ni actionable iff it ni unachieved na every subgoal it inahitaji ni achieved
  - sheria: exactly one subgoal ni actionable
Top goal: mission.
Next subgoal nini?

The legal answers are:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 requires sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 requires sub2
  - achieved sub3
  - sub1 requires sub0
  - sub4 requires sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 requires sub5
  - achieved sub2
The rules are:
  - rule the top goal needs every subgoal that is part of it
  - rule a subgoal is actionable if and only if it is unachieved and every subgoal it requires is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
What is the next subgoal?

{answer_options: [sub3 sub4 sub1 sub0 sub5 sub2], decomposition: [(requires sub4 sub1) (part_of sub4 mission) (part_of sub1 mission) (part_of sub2 mission) (part_of sub0 mission) (part_of sub5 mission) (requires sub4 sub2) (achieved sub3) (requires sub1 sub0) (requires sub4 sub0) (part_of sub3 mission) (achieved sub5) (requires sub2 sub5) (achieved sub2)], query: next_subgoal, rules: [(rule (the_top_goal_needs_every_subgoal_that_is_part_of_it)) (rule (a_subgoal_is_actionable_iff_it_is_unachieved_and_every_subgoal_it_requires_is_achieved)) (rule (exactly_one_subgoal_is_actionable))], top_goal: mission}

Antwort Alternativen:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Zersetzung:
  - sub4 brauchen sub1
  - sub4 Teil aus mission
  - sub1 Teil aus mission
  - sub2 Teil aus mission
  - sub0 Teil aus mission
  - sub5 Teil aus mission
  - sub4 brauchen sub2
  - achieved sub3
  - sub1 brauchen sub0
  - sub4 brauchen sub0
  - sub3 Teil aus mission
  - achieved sub5
  - sub2 brauchen sub5
  - achieved sub2
Die Regeln sind:
  - Regel der Oberteil Ziel Notwendigkeit jeder Teilziel dass werden Teil aus er
  - Regel ein Teilziel werden einklagbar gdw. er werden unachieved und jeder Teilziel er brauchen werden achieved
  - Regel genau eins Teilziel werden einklagbar
Oberteil Ziel: mission.
Was nächster Teilziel?

О̏дгово̄р ѝзбор:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Raspad:
  - sub4 require sub1
  - sub4 део m/дио od mission
  - sub1 део m/дио od mission
  - sub2 део m/дио od mission
  - sub0 део m/дио od mission
  - sub5 део m/дио od mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 део m/дио od mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Пра̏вило:
  - пра̏вило врх ци̑љ потреба сва̏кӣ subgoal да би̏ти део m/дио od оно
  - пра̏вило subgoal би̏ти provedivost iff оно би̏ти unachieved и сва̏кӣ subgoal оно require би̏ти achieved
  - пра̏вило тачно јѐдан subgoal би̏ти provedivost
Врх ци̑љ: mission.
Следећи subgoal kakav?

Vastaus vaihtoehdot:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Hajoaminen:
  - sub4 vaatia sub1
  - sub4 osa vaille mission
  - sub1 osa vaille mission
  - sub2 osa vaille mission
  - sub0 osa vaille mission
  - sub5 osa vaille mission
  - sub4 vaatia sub2
  - achieved sub3
  - sub1 vaatia sub0
  - sub4 vaatia sub0
  - sub3 osa vaille mission
  - achieved sub5
  - sub2 vaatia sub5
  - achieved sub2
Säännöt:
  - sääntö huippu päämäärä tarve jokainen subgoal että tulla osa vaille se
  - sääntö subgoal tulla kannekelpoinen joss se tulla unachieved ja jokainen subgoal se vaatia tulla achieved
  - sääntö täsmälleen yksi subgoal tulla kannekelpoinen
Huippu päämäärä: mission.
Mikä seuraava subgoal?

备选答案如下：
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
分解如下：
  - sub4需要sub1
  - sub4属于mission
  - sub1属于mission
  - sub2属于mission
  - sub0属于mission
  - sub5属于mission
  - sub4需要sub2
  - 达成了：sub3
  - sub1需要sub0
  - sub4需要sub0
  - sub3属于mission
  - 达成了：sub5
  - sub2需要sub5
  - 达成了：sub2
规则如下：规则：这top的目标是需要every的子目标是that是part的it；规则：一的子目标是是actionable当且仅当it是unachieved和every的子目标是it需要是达成了；规则：恰好是one的子目标是是actionable。
顶层目标是mission。
next的子目标是什么？

答え選択:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
分解:
  - sub4sub1必要とする
  - sub4mission一部の中の
  - sub1mission一部の中の
  - sub2mission一部の中の
  - sub0mission一部の中の
  - sub5mission一部の中の
  - sub4sub2必要とする
  - achieved:sub3
  - sub1sub0必要とする
  - sub4sub0必要とする
  - sub3mission一部の中の
  - achieved:sub5
  - sub2sub5必要とする
  - achieved:sub2
規則:
  - 規則:頂目標必要凡ゆるsubgoalそのれる一部の中のこれ
  - 規則:subgoalれるactionableiffこれれるunachievedと凡ゆるsubgoalこれ必要とするれるachieved
  - 規則:正確に一subgoalれるactionable
頂目標:mission.
次のsubgoal何と?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 gerektirir
  - sub4 mission part
  - sub1 mission part
  - sub2 mission part
  - sub0 mission part
  - sub5 mission part
  - sub4 sub2 gerektirir
  - achieved: sub3
  - sub1 sub0 gerektirir
  - sub4 sub0 gerektirir
  - sub3 mission part
  - achieved: sub5
  - sub2 sub5 gerektirir
  - achieved: sub2
Kurallar:
  - kural: top hedef gereksinim every subgoal that part it
  - kural: bir subgoal actionable iff it unachieved ve every subgoal it gerektirir achieved
  - kural: exactly one subgoal actionable
Top goal: mission.
Sonraki subgoal ne?

answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
decomposition:
  - اِقْتَضَى sub4 sub1
  - جُزْء مِنْ sub4 mission
  - جُزْء مِنْ sub1 mission
  - جُزْء مِنْ sub2 mission
  - جُزْء مِنْ sub0 mission
  - جُزْء مِنْ sub5 mission
  - اِقْتَضَى sub4 sub2
  - achieved sub3
  - اِقْتَضَى sub1 sub0
  - اِقْتَضَى sub4 sub0
  - جُزْء مِنْ sub3 mission
  - achieved sub5
  - اِقْتَضَى sub2 sub5
  - achieved sub2
قَانُون:
  - قَانُون الـ قِمَّة هَدَف حَاجَة كُلّ subgoal أَنْ كَانَ جُزْء مِنْ هُوَ
  - قَانُون subgoal كَانَ actionable iff هُوَ كَانَ unachieved وَـ كُلّ subgoal هُوَ اِقْتَضَى كَانَ achieved
  - قَانُون بِالضَّبْط وَاحِد subgoal كَانَ actionable
قِمَّة هَدَف: mission.
تَالٍ subgoal مَاذَا؟

Პასუხი ვარიანტი:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Ხრწნა:
  - sub4 sub1 require
  - sub4 mission ნაწილი of
  - sub1 mission ნაწილი of
  - sub2 mission ნაწილი of
  - sub0 mission ნაწილი of
  - sub5 mission ნაწილი of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission ნაწილი of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Წესი:
  - წესი მწვერვალი მიზანი საჭიროება ყველა subgoal რომ ყოფნა ნაწილი of ის
  - წესი subgoal ყოფნა actionable iff ის ყოფნა unachieved და ყველა subgoal ის require ყოფნა achieved
  - წესი ზუსტად ერთი subgoal ყოფნა actionable
Მწვერვალი მიზანი: mission.
Შემდეგი subgoal რა?

Whakautu kōwhiringa:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Wāwāhinga:
  - require sub4 sub1
  - wāhanga o sub4 mission
  - wāhanga o sub1 mission
  - wāhanga o sub2 mission
  - wāhanga o sub0 mission
  - wāhanga o sub5 mission
  - require sub4 sub2
  - achieved sub3
  - require sub1 sub0
  - require sub4 sub0
  - wāhanga o sub3 mission
  - achieved sub5
  - require sub2 sub5
  - achieved sub2
Rekureihana:
  - rekureihana te tihi hemonga matea every subgoal tēnā is wāhanga o it
  - rekureihana subgoal is actionable iff it is unachieved me every subgoal it require is achieved
  - rekureihana pū tahi subgoal is actionable
Tihi hemonga: mission.
Panuku subgoal unutai?

Trả lời lựa chọn:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 yêu cầu sub1
  - sub4 phần bằng mission
  - sub1 phần bằng mission
  - sub2 phần bằng mission
  - sub0 phần bằng mission
  - sub5 phần bằng mission
  - sub4 yêu cầu sub2
  - achieved sub3
  - sub1 yêu cầu sub0
  - sub4 yêu cầu sub0
  - sub3 phần bằng mission
  - achieved sub5
  - sub2 yêu cầu sub5
  - achieved sub2
Quy tắc:
  - quy tắc the đỉnh mục tiêu nhu cầu mỗi subgoal rằng được phần bằng nó
  - quy tắc subgoal được actionable iff nó được unachieved và mỗi subgoal nó yêu cầu được achieved
  - quy tắc đúng rồi một subgoal được actionable
Đỉnh mục tiêu: mission.
Sắp tới subgoal gì?

คำตอบตัวเลือก:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
decomposition:
  - sub4requiresub1
  - sub4ท่อนของmission
  - sub1ท่อนของmission
  - sub2ท่อนของmission
  - sub0ท่อนของmission
  - sub5ท่อนของmission
  - sub4requiresub2
  - achieved:sub3
  - sub1requiresub0
  - sub4requiresub0
  - sub3ท่อนของmission
  - achieved:sub5
  - sub2requiresub5
  - achieved:sub2
กฎ:
  - กฎ:ยอดเป้าหมายต้องการทุกsubgoalว่าถูกท่อนของมัน
  - กฎ:subgoalถูกactionableiffมันถูกunachievedและทุกsubgoalมันrequireถูกachieved
  - กฎ:exactlyหนึ่งsubgoalถูกactionable
ยอดเป้าหมาย:mission.
หน้าsubgoalอะไร?

answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
decomposition:
  - sub4 sub1 require
  - sub4 mission பகுதி கொண்ட
  - sub1 mission பகுதி கொண்ட
  - sub2 mission பகுதி கொண்ட
  - sub0 mission பகுதி கொண்ட
  - sub5 mission பகுதி கொண்ட
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission பகுதி கொண்ட
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
rules:
  - rule top goal தேவை ஒவ்வொரு subgoal எப்படி படு பகுதி கொண்ட it
  - rule subgoal படு actionable iff it படு unachieved மற்றும் ஒவ்வொரு subgoal it require படு achieved
  - rule exactly ஒன்று subgoal படு actionable
top goal: mission.
next subgoal என்ன?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 inahitaji sub1
  - sub4 part ya mission
  - sub1 part ya mission
  - sub2 part ya mission
  - sub0 part ya mission
  - sub5 part ya mission
  - sub4 inahitaji sub2
  - achieved: sub3
  - sub1 inahitaji sub0
  - sub4 inahitaji sub0
  - sub3 part ya mission
  - achieved: sub5
  - sub2 inahitaji sub5
  - achieved: sub2
Sheria ni:
  - sheria: top goal uhitaji every subgoal that ni part ya it
  - sheria: subgoal ni actionable iff it ni unachieved na every subgoal it inahitaji ni achieved
  - sheria: exactly one subgoal ni actionable
Top goal: mission.
Next subgoal nini?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 require
  - sub4 mission part of
  - sub1 mission part of
  - sub2 mission part of
  - sub0 mission part of
  - sub5 mission part of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission part of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Bee hazʼáanii:
  - bee hazʼáanii hakáʼígíí goal needs every subgoal éí átʼé part of it
  - bee hazʼáanii subgoal átʼé actionable iff it átʼé unachieved dóó every subgoal it require átʼé achieved
  - bee hazʼáanii exactly łáaʼii subgoal átʼé actionable
Top goal: mission.
Next subgoal haʼátʼíísh?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 require
  - sub4 mission part of
  - sub1 mission part of
  - sub2 mission part of
  - sub0 mission part of
  - sub5 mission part of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission part of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that a part of una
  - rule subgoal a actionable iff una a unachieved aamma every subgoal una require a achieved
  - rule exactly ataaseq subgoal a actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 hap bilong mission
  - sub1 hap bilong mission
  - sub2 hap bilong mission
  - sub0 hap bilong mission
  - sub5 hap bilong mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 hap bilong mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is hap bilong it
  - rule subgoal is actionable iff it is unachieved na every subgoal it require is achieved
  - rule exactly wanpela subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Nikanixi:
  - nikanixi top goal needs every subgoal that is part of it
  - nikanixi subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - nikanixi exactly kwëti subgoal is actionable
Top goal: mission.
Next subgoal kwèch?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule бухь goal needs дерриг subgoal that хила part of it
  - rule subgoal хила actionable iff it хила unachieved а дерриг subgoal it require хила achieved
  - rule exactly one subgoal хила actionable
Top goal: mission.
Next subgoal фу?

대답 선택:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
decomposition:
  - sub4 sub1 요구하다
  - sub4 mission 부분 ...의
  - sub1 mission 부분 ...의
  - sub2 mission 부분 ...의
  - sub0 mission 부분 ...의
  - sub5 mission 부분 ...의
  - sub4 sub2 요구하다
  - achieved sub3
  - sub1 sub0 요구하다
  - sub4 sub0 요구하다
  - sub3 mission 부분 ...의
  - achieved sub5
  - sub2 sub5 요구하다
  - achieved sub2
규칙:
  - 규칙 꼭대기 목표 필요 각 subgoal 그 is 부분 ...의 이것
  - 규칙 subgoal is actionable iff 이것 is unachieved and 각 subgoal 이것 요구하다 is achieved
  - 규칙 정확하게 하나 subgoal is actionable
꼭대기 목표: mission.
다음의 subgoal 무엇?

Erantzun aukerongatik:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 require
  - sub4 mission lain of
  - sub1 mission lain of
  - sub2 mission lain of
  - sub0 mission lain of
  - sub5 mission lain of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission lain of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Arau:
  - arau the gain helburu behar every subgoal hura izan lain of it
  - arau bat subgoal izan actionable iff it izan unachieved eta every subgoal it require izan achieved
  - arau exactly bat subgoal izan actionable
Gain helburu: mission.
Datorren subgoal zer?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 ᎤᏂᎬᎦ sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 ᎤᏂᎬᎦ sub2
  - achieved sub3
  - sub1 ᎤᏂᎬᎦ sub0
  - sub4 ᎤᏂᎬᎦ sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 ᎤᏂᎬᎦ sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal Ꮎ is part of it
  - rule subgoal is actionable iff it is unachieved ᎠᎴ every subgoal it ᎤᏂᎬᎦ is achieved
  - rule exactly ᏌᏊᎢ subgoal is actionable
Top goal: mission.
What next subgoal?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs tukuy subgoal chay tiyay part of it
  - rule subgoal tiyay actionable iff it tiyay unachieved and tukuy subgoal it require tiyay achieved
  - rule exactly huk subgoal tiyay actionable
Top goal: mission.
Qhipan subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 require
  - sub4 mission ӏыхьэ of
  - sub1 mission ӏыхьэ of
  - sub2 mission ӏыхьэ of
  - sub0 mission ӏыхьэ of
  - sub5 mission ӏыхьэ of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission ӏыхьэ of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Rules:
  - rule the top goal needs every subgoal that is ӏыхьэ of it
  - rule subgoal is actionable iff it is unachieved ыкӏи every subgoal it require is achieved
  - rule exactly зы subgoal is actionable
Top goal: mission.
Next subgoal сыд?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Cai:
  - cai top goal needs every subgoal qhov ntawd is part of nws
  - cai subgoal is actionable iff nws is unachieved thiab every subgoal nws require is achieved
  - cai exactly ib subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly ganbu subgoal is actionable
Top goal: mission.
Next subgoal ining-jak?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved micha' every subgoal it require is achieved
  - rule exactly chaffa subgoal is actionable
Top goal: mission.
Next subgoal nanta?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 require
  - sub4 mission part of
  - sub1 mission part of
  - sub2 mission part of
  - sub0 mission part of
  - sub5 mission part of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission part of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved カ every subgoal it require is achieved
  - rule exactly シネ subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved ынкъам every subgoal it require is achieved
  - rule exactly ыннен subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that yan part of it
  - rule subgoal yan actionable iff it yan unachieved yéetel every subgoal it require yan achieved
  - rule exactly hun subgoal yan actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of ą́wąną
  - rule subgoal is actionable iff ą́wąną is unachieved and every subgoal ą́wąną require is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
Next subgoal híli?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 require
  - sub4 mission part of
  - sub1 mission part of
  - sub2 mission part of
  - sub0 mission part of
  - sub5 mission part of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission part of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Rules:
  - rule the top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved na every subgoal it require is achieved
  - rule exactly waŋží subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 vore of mission
  - sub1 vore of mission
  - sub2 vore of mission
  - sub0 vore of mission
  - sub5 vore of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 vore of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule the top goal needs every subgoal that is vore of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly peteĩ subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 require
  - sub4 mission part of
  - sub1 mission part of
  - sub2 mission part of
  - sub0 mission part of
  - sub5 mission part of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission part of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule maya subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly maya subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal tVʻVV-sà kV ǀîi part of èh
  - rule subgoal ǀîi actionable iff èh ǀîi unachieved ǂʻá every subgoal èh require ǀîi achieved
  - rule exactly one subgoal ǀîi actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 require
  - sub4 mission part of
  - sub1 mission part of
  - sub2 mission part of
  - sub0 mission part of
  - sub5 mission part of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission part of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly нин subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 require
  - sub4 mission part of
  - sub1 mission part of
  - sub2 mission part of
  - sub0 mission part of
  - sub5 mission part of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission part of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of kitu
  - rule subgoal is actionable iff kitu is unachieved and every subgoal kitu require is achieved
  - rule exactly koli subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule the top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule ne top goal needs every subgoal that nemi part of yaja
  - rule subgoal nemi actionable iff yaja nemi unachieved and every subgoal yaja require nemi achieved
  - rule exactly se subgoal nemi actionable
Top goal: mission.
Next subgoal tay?

Réponse choix :
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Décomposition :
  - sub4 demander sub1
  - sub4 partie de mission
  - sub1 partie de mission
  - sub2 partie de mission
  - sub0 partie de mission
  - sub5 partie de mission
  - sub4 demander sub2
  - achieved sub3
  - sub1 demander sub0
  - sub4 demander sub0
  - sub3 partie de mission
  - achieved sub5
  - sub2 demander sub5
  - achieved sub2
Les règles sont:
  - règle le dessus objectif besoin tout subgoal qu'être partie d'il
  - règle un subgoal être recevable ssi il être unachieved et tout subgoal il demander être achieved
  - règle exactement un subgoal être recevable
Dessus objectif : mission.
Quoi prochain subgoal ?

Respondo alternativo:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 bezoni sub1
  - sub4 parto de mission
  - sub1 parto de mission
  - sub2 parto de mission
  - sub0 parto de mission
  - sub5 parto de mission
  - sub4 bezoni sub2
  - achieved sub3
  - sub1 bezoni sub0
  - sub4 bezoni sub0
  - sub3 parto de mission
  - achieved sub5
  - sub2 bezoni sub5
  - achieved sub2
Regulo:
  - regulo supro celo needs ĉiu subgoal ke egali parto de ĝi
  - regulo subgoal egali actionable iff ĝi egali unachieved kaj ĉiu subgoal ĝi bezoni egali achieved
  - regulo ekzakte unu subgoal egali actionable
Supro celo: mission.
Sekva subgoal kio?

Válasz lehetőségek:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 követel sub1
  - sub4 rész of mission
  - sub1 rész of mission
  - sub2 rész of mission
  - sub0 rész of mission
  - sub5 rész of mission
  - sub4 követel sub2
  - achieved sub3
  - sub1 követel sub0
  - sub4 követel sub0
  - sub3 rész of mission
  - achieved sub5
  - sub2 követel sub5
  - achieved sub2
Szabályok:
  - szabály a tető cél szükség minden subgoal hogy van rész of az
  - szabály subgoal van actionable acsa az van unachieved és minden subgoal az követel van achieved
  - szabály pontosan egy subgoal van actionable
Tető cél: mission.
Következő subgoal melyik?

回答選擇:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
分解作用:
  - sub4requiresub1
  - sub4部分...嘅mission
  - sub1部分...嘅mission
  - sub2部分...嘅mission
  - sub0部分...嘅mission
  - sub5部分...嘅mission
  - sub4requiresub2
  - achieved:sub3
  - sub1requiresub0
  - sub4requiresub0
  - sub3部分...嘅mission
  - achieved:sub5
  - sub2requiresub5
  - achieved:sub2
rules:
  - rule:主動入波needs每subgoal嘅是部分...嘅it
  - rule:一subgoal是actionableiffit是unachieved及每subgoalitrequire是achieved
  - rule:exactly一subgoal是actionable
主動入波:mission.
下一個subgoal乜嘢?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that 有ん part of it
  - rule subgoal 有ん actionable iff it 有ん unachieved とぅ every subgoal it require 有ん achieved
  - rule exactly 一 subgoal 有ん actionable
Top goal: mission.
Next subgoal what?

Жауап опцион:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 бөлік туралы mission
  - sub1 бөлік туралы mission
  - sub2 бөлік туралы mission
  - sub0 бөлік туралы mission
  - sub5 бөлік туралы mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 бөлік туралы mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Ереже:
  - ереже top мақсат needs әр subgoal that is бөлік туралы ол
  - ереже subgoal is actionable iff ол is unachieved және әр subgoal ол require is achieved
  - ереже exactly бір subgoal is actionable
Top goal: mission.
Next subgoal не?

תְּשׁוּבָה אפשרויות:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
decomposition:
  - sub4 require sub1
  - sub4 חֵלֶק שֶׁל mission
  - sub1 חֵלֶק שֶׁל mission
  - sub2 חֵלֶק שֶׁל mission
  - sub0 חֵלֶק שֶׁל mission
  - sub5 חֵלֶק שֶׁל mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 חֵלֶק שֶׁל mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
מָשַׁל:
  - מָשַׁל ה־ אַקְטִיבִי מַטָּרָה צריך כֹּל subgoal אֲשֶׁר הוא חֵלֶק שֶׁל זֶה
  - מָשַׁל אַחַת subgoal הוא actionable אםם זֶה הוא unachieved וְ־ כֹּל subgoal זֶה require הוא achieved
  - מָשַׁל בדיוק אַחַת subgoal הוא actionable
אַקְטִיבִי מַטָּרָה: mission.
איזה בָּא subgoal?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved დო every subgoal it require is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
Next subgoal what?

Jawaban pilihan-pilihan:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Dekomposisi:
  - sub4 require sub1
  - sub4 bagian dari mission
  - sub1 bagian dari mission
  - sub2 bagian dari mission
  - sub0 bagian dari mission
  - sub5 bagian dari mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 bagian dari mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule si atas tujuan memerlukan setiap subgoal bahwa berada bagian dari it
  - rule subgoal berada actionable iff it berada unachieved dan setiap subgoal it require berada achieved
  - rule tepat satu subgoal berada actionable
Atas tujuan: mission.
Next subgoal apa?

ពាក្យឆ្លើយជំរើស:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
decomposition:
  - sub4requiresub1
  - sub4ភាគនៃmission
  - sub1ភាគនៃmission
  - sub2ភាគនៃmission
  - sub0ភាគនៃmission
  - sub5ភាគនៃmission
  - sub4requiresub2
  - achieved:sub3
  - sub1requiresub0
  - sub4requiresub0
  - sub3ភាគនៃmission
  - achieved:sub5
  - sub2requiresub5
  - achieved:sub2
ក្បួន:
  - ក្បួន:theកំពូលទិសត្រូវការរាល់subgoalថាត្រូវបានភាគនៃវា
  - ក្បួន:subgoalត្រូវបានactionableiffវាត្រូវបានunachievedនឹងរាល់subgoalវាrequireត្រូវបានachieved
  - ក្បួន:exactlyមួយsubgoalត្រូវបានactionable
កំពូលទិស:mission.
បន្ទាប់subgoalអី?

ຄຳຕອບທາງເລືອກ:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
decomposition:
  - sub4ຕ້ອງການsub1
  - sub4ຂັນຂອງmission
  - sub1ຂັນຂອງmission
  - sub2ຂັນຂອງmission
  - sub0ຂັນຂອງmission
  - sub5ຂັນຂອງmission
  - sub4ຕ້ອງການsub2
  - achieved:sub3
  - sub1ຕ້ອງການsub0
  - sub4ຕ້ອງການsub0
  - sub3ຂັນຂອງmission
  - achieved:sub5
  - sub2ຕ້ອງການsub5
  - achieved:sub2
ກະຕິກາ:
  - ກະຕິກາ:topເປົ້າໝາຍneedsທຸກsubgoalນັ້ນຢູ່ຂັນຂອງມັນ
  - ກະຕິກາ:subgoalຢູ່actionableiffມັນຢູ່unachievedແລະທຸກsubgoalມັນຕ້ອງການຢູ່achieved
  - ກະຕິກາ:exactlyໜຶ່ງsubgoalຢູ່actionable
top goal:mission.
ຕໍ່ໄປsubgoalຫຍັງ?

answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
decomposition:
  - sub4 sub1 require
  - sub4 mission భాగము of
  - sub1 mission భాగము of
  - sub2 mission భాగము of
  - sub0 mission భాగము of
  - sub5 mission భాగము of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission భాగము of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
నియమం:
  - నియమం top లక్ష్యం అవసరము ప్రతి subgoal ఆ ఉండు భాగము of it
  - నియమం subgoal ఉండు actionable iff it ఉండు unachieved మరియు ప్రతి subgoal it require ఉండు achieved
  - నియమం exactly ఒకటి subgoal ఉండు actionable
top goal: mission.
next subgoal ఏమిటి?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that wà part of it
  - rule subgoal wà actionable iff it wà unachieved and every subgoal it require wà achieved
  - rule exactly ọ̀kan subgoal wà actionable
Top goal: mission.
What next subgoal?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 require
  - sub4 mission part of
  - sub1 mission part of
  - sub2 mission part of
  - sub0 mission part of
  - sub5 mission part of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission part of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Rules:
  - rule the top goal needs every subgoal that naiágúóli part of it
  - rule subgoal naiágúóli actionable iff it naiágúóli unachieved and every subgoal it require naiágúóli achieved
  - rule exactly dałaá subgoal naiágúóli actionable
Top goal: mission.
Next subgoal what?

answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly ᐊᑕᐅᓯᖅ subgoal is actionable
top goal: mission.
next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly wan subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 require sub1
  - sub4 part of mission
  - sub1 part of mission
  - sub2 part of mission
  - sub0 part of mission
  - sub5 part of mission
  - sub4 require sub2
  - achieved sub3
  - sub1 require sub0
  - sub4 require sub0
  - sub3 part of mission
  - achieved sub5
  - sub2 require sub5
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly náʼėstse subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub1
  - sub0
  - sub5
  - sub2
Decomposition:
  - sub4 sub1 require
  - sub4 mission part of
  - sub1 mission part of
  - sub2 mission part of
  - sub0 mission part of
  - sub5 mission part of
  - sub4 sub2 require
  - achieved sub3
  - sub1 sub0 require
  - sub4 sub0 require
  - sub3 mission part of
  - achieved sub5
  - sub2 sub5 require
  - achieved sub2
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly сад subgoal is actionable
Top goal: mission.
Next subgoal вуч?

The legal answers are:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 requires sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 requires sub3
  - sub2 requires sub1
  - sub5 requires sub4
  - sub1 requires sub4
  - sub3 requires sub4
  - sub0 part of mission
The rules are:
  - rule the top goal needs every subgoal that is part of it
  - rule a subgoal is actionable if and only if it is unachieved and every subgoal it requires is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
What is the next subgoal?

Las respuestas válidas son:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
La descomposición es:
  - logró: sub1
  - sub5 es parte de mission
  - sub2 es parte de mission
  - sub2 requiere sub0
  - sub1 es parte de mission
  - logró: sub3
  - logró: sub5
  - logró: sub4
  - sub3 es parte de mission
  - sub4 es parte de mission
  - sub2 requiere sub3
  - sub2 requiere sub1
  - sub5 requiere sub4
  - sub1 requiere sub4
  - sub3 requiere sub4
  - sub0 es parte de mission
Las reglas son:
  - la regla: el top el objetivo necesita every el subobjetivo that es part de it
  - la regla: al subobjetivo es actionable si y sólo si it es unachieved y every el subobjetivo it requiere es logró
  - la regla: exactamente one el subobjetivo es actionable
El objetivo principal es mission.
¿Qué next el subobjetivo?

备选答案如下：
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
分解如下：
  - 达成了：sub1
  - sub5属于mission
  - sub2属于mission
  - sub2需要sub0
  - sub1属于mission
  - 达成了：sub3
  - 达成了：sub5
  - 达成了：sub4
  - sub3属于mission
  - sub4属于mission
  - sub2需要sub3
  - sub2需要sub1
  - sub5需要sub4
  - sub1需要sub4
  - sub3需要sub4
  - sub0属于mission
规则如下：规则：这top的目标是需要every的子目标是that是part的it；规则：一的子目标是是actionable当且仅当it是unachieved和every的子目标是it需要是达成了；规则：恰好是one的子目标是是actionable。
顶层目标是mission。
next的子目标是什么？

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved: sub1
  - sub5 mission part
  - sub2 mission part
  - sub2 sub0 gerektirir
  - sub1 mission part
  - achieved: sub3
  - achieved: sub5
  - achieved: sub4
  - sub3 mission part
  - sub4 mission part
  - sub2 sub3 gerektirir
  - sub2 sub1 gerektirir
  - sub5 sub4 gerektirir
  - sub1 sub4 gerektirir
  - sub3 sub4 gerektirir
  - sub0 mission part
Kurallar:
  - kural: top hedef gereksinim every subgoal that part it
  - kural: bir subgoal actionable iff it unachieved ve every subgoal it gerektirir achieved
  - kural: exactly one subgoal actionable
Top goal: mission.
Sonraki subgoal ne?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved: sub1
  - sub5 part ya mission
  - sub2 part ya mission
  - sub2 inahitaji sub0
  - sub1 part ya mission
  - achieved: sub3
  - achieved: sub5
  - achieved: sub4
  - sub3 part ya mission
  - sub4 part ya mission
  - sub2 inahitaji sub3
  - sub2 inahitaji sub1
  - sub5 inahitaji sub4
  - sub1 inahitaji sub4
  - sub3 inahitaji sub4
  - sub0 part ya mission
Sheria ni:
  - sheria: top goal uhitaji every subgoal that ni part ya it
  - sheria: subgoal ni actionable iff it ni unachieved na every subgoal it inahitaji ni achieved
  - sheria: exactly one subgoal ni actionable
Top goal: mission.
Next subgoal nini?

The legal answers are:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 requires sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 requires sub3
  - sub2 requires sub1
  - sub5 requires sub4
  - sub1 requires sub4
  - sub3 requires sub4
  - sub0 part of mission
The rules are:
  - rule the top goal needs every subgoal that is part of it
  - rule a subgoal is actionable if and only if it is unachieved and every subgoal it requires is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
What is the next subgoal?

{answer_options: [sub3 sub4 sub0 sub1 sub5 sub2], decomposition: [(achieved sub1) (part_of sub5 mission) (part_of sub2 mission) (requires sub2 sub0) (part_of sub1 mission) (achieved sub3) (achieved sub5) (achieved sub4) (part_of sub3 mission) (part_of sub4 mission) (requires sub2 sub3) (requires sub2 sub1) (requires sub5 sub4) (requires sub1 sub4) (requires sub3 sub4) (part_of sub0 mission)], query: next_subgoal, rules: [(rule (the_top_goal_needs_every_subgoal_that_is_part_of_it)) (rule (a_subgoal_is_actionable_iff_it_is_unachieved_and_every_subgoal_it_requires_is_achieved)) (rule (exactly_one_subgoal_is_actionable))], top_goal: mission}

Antwort Alternativen:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Zersetzung:
  - achieved sub1
  - sub5 Teil aus mission
  - sub2 Teil aus mission
  - sub2 brauchen sub0
  - sub1 Teil aus mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 Teil aus mission
  - sub4 Teil aus mission
  - sub2 brauchen sub3
  - sub2 brauchen sub1
  - sub5 brauchen sub4
  - sub1 brauchen sub4
  - sub3 brauchen sub4
  - sub0 Teil aus mission
Die Regeln sind:
  - Regel der Oberteil Ziel Notwendigkeit jeder Teilziel dass werden Teil aus er
  - Regel ein Teilziel werden einklagbar gdw. er werden unachieved und jeder Teilziel er brauchen werden achieved
  - Regel genau eins Teilziel werden einklagbar
Oberteil Ziel: mission.
Was nächster Teilziel?

О̏дгово̄р ѝзбор:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Raspad:
  - achieved sub1
  - sub5 део m/дио od mission
  - sub2 део m/дио od mission
  - sub2 require sub0
  - sub1 део m/дио od mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 део m/дио od mission
  - sub4 део m/дио od mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 део m/дио od mission
Пра̏вило:
  - пра̏вило врх ци̑љ потреба сва̏кӣ subgoal да би̏ти део m/дио od оно
  - пра̏вило subgoal би̏ти provedivost iff оно би̏ти unachieved и сва̏кӣ subgoal оно require би̏ти achieved
  - пра̏вило тачно јѐдан subgoal би̏ти provedivost
Врх ци̑љ: mission.
Следећи subgoal kakav?

Vastaus vaihtoehdot:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Hajoaminen:
  - achieved sub1
  - sub5 osa vaille mission
  - sub2 osa vaille mission
  - sub2 vaatia sub0
  - sub1 osa vaille mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 osa vaille mission
  - sub4 osa vaille mission
  - sub2 vaatia sub3
  - sub2 vaatia sub1
  - sub5 vaatia sub4
  - sub1 vaatia sub4
  - sub3 vaatia sub4
  - sub0 osa vaille mission
Säännöt:
  - sääntö huippu päämäärä tarve jokainen subgoal että tulla osa vaille se
  - sääntö subgoal tulla kannekelpoinen joss se tulla unachieved ja jokainen subgoal se vaatia tulla achieved
  - sääntö täsmälleen yksi subgoal tulla kannekelpoinen
Huippu päämäärä: mission.
Mikä seuraava subgoal?

备选答案如下：
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
分解如下：
  - 达成了：sub1
  - sub5属于mission
  - sub2属于mission
  - sub2需要sub0
  - sub1属于mission
  - 达成了：sub3
  - 达成了：sub5
  - 达成了：sub4
  - sub3属于mission
  - sub4属于mission
  - sub2需要sub3
  - sub2需要sub1
  - sub5需要sub4
  - sub1需要sub4
  - sub3需要sub4
  - sub0属于mission
规则如下：规则：这top的目标是需要every的子目标是that是part的it；规则：一的子目标是是actionable当且仅当it是unachieved和every的子目标是it需要是达成了；规则：恰好是one的子目标是是actionable。
顶层目标是mission。
next的子目标是什么？

答え選択:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
分解:
  - achieved:sub1
  - sub5mission一部の中の
  - sub2mission一部の中の
  - sub2sub0必要とする
  - sub1mission一部の中の
  - achieved:sub3
  - achieved:sub5
  - achieved:sub4
  - sub3mission一部の中の
  - sub4mission一部の中の
  - sub2sub3必要とする
  - sub2sub1必要とする
  - sub5sub4必要とする
  - sub1sub4必要とする
  - sub3sub4必要とする
  - sub0mission一部の中の
規則:
  - 規則:頂目標必要凡ゆるsubgoalそのれる一部の中のこれ
  - 規則:subgoalれるactionableiffこれれるunachievedと凡ゆるsubgoalこれ必要とするれるachieved
  - 規則:正確に一subgoalれるactionable
頂目標:mission.
次のsubgoal何と?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved: sub1
  - sub5 mission part
  - sub2 mission part
  - sub2 sub0 gerektirir
  - sub1 mission part
  - achieved: sub3
  - achieved: sub5
  - achieved: sub4
  - sub3 mission part
  - sub4 mission part
  - sub2 sub3 gerektirir
  - sub2 sub1 gerektirir
  - sub5 sub4 gerektirir
  - sub1 sub4 gerektirir
  - sub3 sub4 gerektirir
  - sub0 mission part
Kurallar:
  - kural: top hedef gereksinim every subgoal that part it
  - kural: bir subgoal actionable iff it unachieved ve every subgoal it gerektirir achieved
  - kural: exactly one subgoal actionable
Top goal: mission.
Sonraki subgoal ne?

answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
decomposition:
  - achieved sub1
  - جُزْء مِنْ sub5 mission
  - جُزْء مِنْ sub2 mission
  - اِقْتَضَى sub2 sub0
  - جُزْء مِنْ sub1 mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - جُزْء مِنْ sub3 mission
  - جُزْء مِنْ sub4 mission
  - اِقْتَضَى sub2 sub3
  - اِقْتَضَى sub2 sub1
  - اِقْتَضَى sub5 sub4
  - اِقْتَضَى sub1 sub4
  - اِقْتَضَى sub3 sub4
  - جُزْء مِنْ sub0 mission
قَانُون:
  - قَانُون الـ قِمَّة هَدَف حَاجَة كُلّ subgoal أَنْ كَانَ جُزْء مِنْ هُوَ
  - قَانُون subgoal كَانَ actionable iff هُوَ كَانَ unachieved وَـ كُلّ subgoal هُوَ اِقْتَضَى كَانَ achieved
  - قَانُون بِالضَّبْط وَاحِد subgoal كَانَ actionable
قِمَّة هَدَف: mission.
تَالٍ subgoal مَاذَا؟

Პასუხი ვარიანტი:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Ხრწნა:
  - achieved sub1
  - sub5 mission ნაწილი of
  - sub2 mission ნაწილი of
  - sub2 sub0 require
  - sub1 mission ნაწილი of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission ნაწილი of
  - sub4 mission ნაწილი of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission ნაწილი of
Წესი:
  - წესი მწვერვალი მიზანი საჭიროება ყველა subgoal რომ ყოფნა ნაწილი of ის
  - წესი subgoal ყოფნა actionable iff ის ყოფნა unachieved და ყველა subgoal ის require ყოფნა achieved
  - წესი ზუსტად ერთი subgoal ყოფნა actionable
Მწვერვალი მიზანი: mission.
Შემდეგი subgoal რა?

Whakautu kōwhiringa:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Wāwāhinga:
  - achieved sub1
  - wāhanga o sub5 mission
  - wāhanga o sub2 mission
  - require sub2 sub0
  - wāhanga o sub1 mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - wāhanga o sub3 mission
  - wāhanga o sub4 mission
  - require sub2 sub3
  - require sub2 sub1
  - require sub5 sub4
  - require sub1 sub4
  - require sub3 sub4
  - wāhanga o sub0 mission
Rekureihana:
  - rekureihana te tihi hemonga matea every subgoal tēnā is wāhanga o it
  - rekureihana subgoal is actionable iff it is unachieved me every subgoal it require is achieved
  - rekureihana pū tahi subgoal is actionable
Tihi hemonga: mission.
Panuku subgoal unutai?

Trả lời lựa chọn:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 phần bằng mission
  - sub2 phần bằng mission
  - sub2 yêu cầu sub0
  - sub1 phần bằng mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 phần bằng mission
  - sub4 phần bằng mission
  - sub2 yêu cầu sub3
  - sub2 yêu cầu sub1
  - sub5 yêu cầu sub4
  - sub1 yêu cầu sub4
  - sub3 yêu cầu sub4
  - sub0 phần bằng mission
Quy tắc:
  - quy tắc the đỉnh mục tiêu nhu cầu mỗi subgoal rằng được phần bằng nó
  - quy tắc subgoal được actionable iff nó được unachieved và mỗi subgoal nó yêu cầu được achieved
  - quy tắc đúng rồi một subgoal được actionable
Đỉnh mục tiêu: mission.
Sắp tới subgoal gì?

คำตอบตัวเลือก:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
decomposition:
  - achieved:sub1
  - sub5ท่อนของmission
  - sub2ท่อนของmission
  - sub2requiresub0
  - sub1ท่อนของmission
  - achieved:sub3
  - achieved:sub5
  - achieved:sub4
  - sub3ท่อนของmission
  - sub4ท่อนของmission
  - sub2requiresub3
  - sub2requiresub1
  - sub5requiresub4
  - sub1requiresub4
  - sub3requiresub4
  - sub0ท่อนของmission
กฎ:
  - กฎ:ยอดเป้าหมายต้องการทุกsubgoalว่าถูกท่อนของมัน
  - กฎ:subgoalถูกactionableiffมันถูกunachievedและทุกsubgoalมันrequireถูกachieved
  - กฎ:exactlyหนึ่งsubgoalถูกactionable
ยอดเป้าหมาย:mission.
หน้าsubgoalอะไร?

answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
decomposition:
  - achieved sub1
  - sub5 mission பகுதி கொண்ட
  - sub2 mission பகுதி கொண்ட
  - sub2 sub0 require
  - sub1 mission பகுதி கொண்ட
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission பகுதி கொண்ட
  - sub4 mission பகுதி கொண்ட
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission பகுதி கொண்ட
rules:
  - rule top goal தேவை ஒவ்வொரு subgoal எப்படி படு பகுதி கொண்ட it
  - rule subgoal படு actionable iff it படு unachieved மற்றும் ஒவ்வொரு subgoal it require படு achieved
  - rule exactly ஒன்று subgoal படு actionable
top goal: mission.
next subgoal என்ன?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved: sub1
  - sub5 part ya mission
  - sub2 part ya mission
  - sub2 inahitaji sub0
  - sub1 part ya mission
  - achieved: sub3
  - achieved: sub5
  - achieved: sub4
  - sub3 part ya mission
  - sub4 part ya mission
  - sub2 inahitaji sub3
  - sub2 inahitaji sub1
  - sub5 inahitaji sub4
  - sub1 inahitaji sub4
  - sub3 inahitaji sub4
  - sub0 part ya mission
Sheria ni:
  - sheria: top goal uhitaji every subgoal that ni part ya it
  - sheria: subgoal ni actionable iff it ni unachieved na every subgoal it inahitaji ni achieved
  - sheria: exactly one subgoal ni actionable
Top goal: mission.
Next subgoal nini?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 mission part of
  - sub2 mission part of
  - sub2 sub0 require
  - sub1 mission part of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission part of
  - sub4 mission part of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission part of
Bee hazʼáanii:
  - bee hazʼáanii hakáʼígíí goal needs every subgoal éí átʼé part of it
  - bee hazʼáanii subgoal átʼé actionable iff it átʼé unachieved dóó every subgoal it require átʼé achieved
  - bee hazʼáanii exactly łáaʼii subgoal átʼé actionable
Top goal: mission.
Next subgoal haʼátʼíísh?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 mission part of
  - sub2 mission part of
  - sub2 sub0 require
  - sub1 mission part of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission part of
  - sub4 mission part of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission part of
Rules:
  - rule top goal needs every subgoal that a part of una
  - rule subgoal a actionable iff una a unachieved aamma every subgoal una require a achieved
  - rule exactly ataaseq subgoal a actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 hap bilong mission
  - sub2 hap bilong mission
  - sub2 require sub0
  - sub1 hap bilong mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 hap bilong mission
  - sub4 hap bilong mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 hap bilong mission
Rules:
  - rule top goal needs every subgoal that is hap bilong it
  - rule subgoal is actionable iff it is unachieved na every subgoal it require is achieved
  - rule exactly wanpela subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Nikanixi:
  - nikanixi top goal needs every subgoal that is part of it
  - nikanixi subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - nikanixi exactly kwëti subgoal is actionable
Top goal: mission.
Next subgoal kwèch?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule бухь goal needs дерриг subgoal that хила part of it
  - rule subgoal хила actionable iff it хила unachieved а дерриг subgoal it require хила achieved
  - rule exactly one subgoal хила actionable
Top goal: mission.
Next subgoal фу?

대답 선택:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
decomposition:
  - achieved sub1
  - sub5 mission 부분 ...의
  - sub2 mission 부분 ...의
  - sub2 sub0 요구하다
  - sub1 mission 부분 ...의
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission 부분 ...의
  - sub4 mission 부분 ...의
  - sub2 sub3 요구하다
  - sub2 sub1 요구하다
  - sub5 sub4 요구하다
  - sub1 sub4 요구하다
  - sub3 sub4 요구하다
  - sub0 mission 부분 ...의
규칙:
  - 규칙 꼭대기 목표 필요 각 subgoal 그 is 부분 ...의 이것
  - 규칙 subgoal is actionable iff 이것 is unachieved and 각 subgoal 이것 요구하다 is achieved
  - 규칙 정확하게 하나 subgoal is actionable
꼭대기 목표: mission.
다음의 subgoal 무엇?

Erantzun aukerongatik:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 mission lain of
  - sub2 mission lain of
  - sub2 sub0 require
  - sub1 mission lain of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission lain of
  - sub4 mission lain of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission lain of
Arau:
  - arau the gain helburu behar every subgoal hura izan lain of it
  - arau bat subgoal izan actionable iff it izan unachieved eta every subgoal it require izan achieved
  - arau exactly bat subgoal izan actionable
Gain helburu: mission.
Datorren subgoal zer?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 ᎤᏂᎬᎦ sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 ᎤᏂᎬᎦ sub3
  - sub2 ᎤᏂᎬᎦ sub1
  - sub5 ᎤᏂᎬᎦ sub4
  - sub1 ᎤᏂᎬᎦ sub4
  - sub3 ᎤᏂᎬᎦ sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal Ꮎ is part of it
  - rule subgoal is actionable iff it is unachieved ᎠᎴ every subgoal it ᎤᏂᎬᎦ is achieved
  - rule exactly ᏌᏊᎢ subgoal is actionable
Top goal: mission.
What next subgoal?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs tukuy subgoal chay tiyay part of it
  - rule subgoal tiyay actionable iff it tiyay unachieved and tukuy subgoal it require tiyay achieved
  - rule exactly huk subgoal tiyay actionable
Top goal: mission.
Qhipan subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 mission ӏыхьэ of
  - sub2 mission ӏыхьэ of
  - sub2 sub0 require
  - sub1 mission ӏыхьэ of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission ӏыхьэ of
  - sub4 mission ӏыхьэ of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission ӏыхьэ of
Rules:
  - rule the top goal needs every subgoal that is ӏыхьэ of it
  - rule subgoal is actionable iff it is unachieved ыкӏи every subgoal it require is achieved
  - rule exactly зы subgoal is actionable
Top goal: mission.
Next subgoal сыд?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Cai:
  - cai top goal needs every subgoal qhov ntawd is part of nws
  - cai subgoal is actionable iff nws is unachieved thiab every subgoal nws require is achieved
  - cai exactly ib subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly ganbu subgoal is actionable
Top goal: mission.
Next subgoal ining-jak?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved micha' every subgoal it require is achieved
  - rule exactly chaffa subgoal is actionable
Top goal: mission.
Next subgoal nanta?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 mission part of
  - sub2 mission part of
  - sub2 sub0 require
  - sub1 mission part of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission part of
  - sub4 mission part of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission part of
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved カ every subgoal it require is achieved
  - rule exactly シネ subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved ынкъам every subgoal it require is achieved
  - rule exactly ыннен subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal that yan part of it
  - rule subgoal yan actionable iff it yan unachieved yéetel every subgoal it require yan achieved
  - rule exactly hun subgoal yan actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal that is part of ą́wąną
  - rule subgoal is actionable iff ą́wąną is unachieved and every subgoal ą́wąną require is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
Next subgoal híli?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 mission part of
  - sub2 mission part of
  - sub2 sub0 require
  - sub1 mission part of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission part of
  - sub4 mission part of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission part of
Rules:
  - rule the top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved na every subgoal it require is achieved
  - rule exactly waŋží subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 vore of mission
  - sub2 vore of mission
  - sub2 require sub0
  - sub1 vore of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 vore of mission
  - sub4 vore of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 vore of mission
Rules:
  - rule the top goal needs every subgoal that is vore of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly peteĩ subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 mission part of
  - sub2 mission part of
  - sub2 sub0 require
  - sub1 mission part of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission part of
  - sub4 mission part of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission part of
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule maya subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly maya subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal tVʻVV-sà kV ǀîi part of èh
  - rule subgoal ǀîi actionable iff èh ǀîi unachieved ǂʻá every subgoal èh require ǀîi achieved
  - rule exactly one subgoal ǀîi actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 mission part of
  - sub2 mission part of
  - sub2 sub0 require
  - sub1 mission part of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission part of
  - sub4 mission part of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission part of
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly нин subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 mission part of
  - sub2 mission part of
  - sub2 sub0 require
  - sub1 mission part of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission part of
  - sub4 mission part of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission part of
Rules:
  - rule top goal needs every subgoal that is part of kitu
  - rule subgoal is actionable iff kitu is unachieved and every subgoal kitu require is achieved
  - rule exactly koli subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule the top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule ne top goal needs every subgoal that nemi part of yaja
  - rule subgoal nemi actionable iff yaja nemi unachieved and every subgoal yaja require nemi achieved
  - rule exactly se subgoal nemi actionable
Top goal: mission.
Next subgoal tay?

Réponse choix :
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Décomposition :
  - achieved sub1
  - sub5 partie de mission
  - sub2 partie de mission
  - sub2 demander sub0
  - sub1 partie de mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 partie de mission
  - sub4 partie de mission
  - sub2 demander sub3
  - sub2 demander sub1
  - sub5 demander sub4
  - sub1 demander sub4
  - sub3 demander sub4
  - sub0 partie de mission
Les règles sont:
  - règle le dessus objectif besoin tout subgoal qu'être partie d'il
  - règle un subgoal être recevable ssi il être unachieved et tout subgoal il demander être achieved
  - règle exactement un subgoal être recevable
Dessus objectif : mission.
Quoi prochain subgoal ?

Respondo alternativo:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 parto de mission
  - sub2 parto de mission
  - sub2 bezoni sub0
  - sub1 parto de mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 parto de mission
  - sub4 parto de mission
  - sub2 bezoni sub3
  - sub2 bezoni sub1
  - sub5 bezoni sub4
  - sub1 bezoni sub4
  - sub3 bezoni sub4
  - sub0 parto de mission
Regulo:
  - regulo supro celo needs ĉiu subgoal ke egali parto de ĝi
  - regulo subgoal egali actionable iff ĝi egali unachieved kaj ĉiu subgoal ĝi bezoni egali achieved
  - regulo ekzakte unu subgoal egali actionable
Supro celo: mission.
Sekva subgoal kio?

Válasz lehetőségek:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 rész of mission
  - sub2 rész of mission
  - sub2 követel sub0
  - sub1 rész of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 rész of mission
  - sub4 rész of mission
  - sub2 követel sub3
  - sub2 követel sub1
  - sub5 követel sub4
  - sub1 követel sub4
  - sub3 követel sub4
  - sub0 rész of mission
Szabályok:
  - szabály a tető cél szükség minden subgoal hogy van rész of az
  - szabály subgoal van actionable acsa az van unachieved és minden subgoal az követel van achieved
  - szabály pontosan egy subgoal van actionable
Tető cél: mission.
Következő subgoal melyik?

回答選擇:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
分解作用:
  - achieved:sub1
  - sub5部分...嘅mission
  - sub2部分...嘅mission
  - sub2requiresub0
  - sub1部分...嘅mission
  - achieved:sub3
  - achieved:sub5
  - achieved:sub4
  - sub3部分...嘅mission
  - sub4部分...嘅mission
  - sub2requiresub3
  - sub2requiresub1
  - sub5requiresub4
  - sub1requiresub4
  - sub3requiresub4
  - sub0部分...嘅mission
rules:
  - rule:主動入波needs每subgoal嘅是部分...嘅it
  - rule:一subgoal是actionableiffit是unachieved及每subgoalitrequire是achieved
  - rule:exactly一subgoal是actionable
主動入波:mission.
下一個subgoal乜嘢?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal that 有ん part of it
  - rule subgoal 有ん actionable iff it 有ん unachieved とぅ every subgoal it require 有ん achieved
  - rule exactly 一 subgoal 有ん actionable
Top goal: mission.
Next subgoal what?

Жауап опцион:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 бөлік туралы mission
  - sub2 бөлік туралы mission
  - sub2 require sub0
  - sub1 бөлік туралы mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 бөлік туралы mission
  - sub4 бөлік туралы mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 бөлік туралы mission
Ереже:
  - ереже top мақсат needs әр subgoal that is бөлік туралы ол
  - ереже subgoal is actionable iff ол is unachieved және әр subgoal ол require is achieved
  - ереже exactly бір subgoal is actionable
Top goal: mission.
Next subgoal не?

תְּשׁוּבָה אפשרויות:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
decomposition:
  - achieved sub1
  - sub5 חֵלֶק שֶׁל mission
  - sub2 חֵלֶק שֶׁל mission
  - sub2 require sub0
  - sub1 חֵלֶק שֶׁל mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 חֵלֶק שֶׁל mission
  - sub4 חֵלֶק שֶׁל mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 חֵלֶק שֶׁל mission
מָשַׁל:
  - מָשַׁל ה־ אַקְטִיבִי מַטָּרָה צריך כֹּל subgoal אֲשֶׁר הוא חֵלֶק שֶׁל זֶה
  - מָשַׁל אַחַת subgoal הוא actionable אםם זֶה הוא unachieved וְ־ כֹּל subgoal זֶה require הוא achieved
  - מָשַׁל בדיוק אַחַת subgoal הוא actionable
אַקְטִיבִי מַטָּרָה: mission.
איזה בָּא subgoal?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved დო every subgoal it require is achieved
  - rule exactly one subgoal is actionable
Top goal: mission.
Next subgoal what?

Jawaban pilihan-pilihan:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Dekomposisi:
  - achieved sub1
  - sub5 bagian dari mission
  - sub2 bagian dari mission
  - sub2 require sub0
  - sub1 bagian dari mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 bagian dari mission
  - sub4 bagian dari mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 bagian dari mission
Rules:
  - rule si atas tujuan memerlukan setiap subgoal bahwa berada bagian dari it
  - rule subgoal berada actionable iff it berada unachieved dan setiap subgoal it require berada achieved
  - rule tepat satu subgoal berada actionable
Atas tujuan: mission.
Next subgoal apa?

ពាក្យឆ្លើយជំរើស:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
decomposition:
  - achieved:sub1
  - sub5ភាគនៃmission
  - sub2ភាគនៃmission
  - sub2requiresub0
  - sub1ភាគនៃmission
  - achieved:sub3
  - achieved:sub5
  - achieved:sub4
  - sub3ភាគនៃmission
  - sub4ភាគនៃmission
  - sub2requiresub3
  - sub2requiresub1
  - sub5requiresub4
  - sub1requiresub4
  - sub3requiresub4
  - sub0ភាគនៃmission
ក្បួន:
  - ក្បួន:theកំពូលទិសត្រូវការរាល់subgoalថាត្រូវបានភាគនៃវា
  - ក្បួន:subgoalត្រូវបានactionableiffវាត្រូវបានunachievedនឹងរាល់subgoalវាrequireត្រូវបានachieved
  - ក្បួន:exactlyមួយsubgoalត្រូវបានactionable
កំពូលទិស:mission.
បន្ទាប់subgoalអី?

ຄຳຕອບທາງເລືອກ:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
decomposition:
  - achieved:sub1
  - sub5ຂັນຂອງmission
  - sub2ຂັນຂອງmission
  - sub2ຕ້ອງການsub0
  - sub1ຂັນຂອງmission
  - achieved:sub3
  - achieved:sub5
  - achieved:sub4
  - sub3ຂັນຂອງmission
  - sub4ຂັນຂອງmission
  - sub2ຕ້ອງການsub3
  - sub2ຕ້ອງການsub1
  - sub5ຕ້ອງການsub4
  - sub1ຕ້ອງການsub4
  - sub3ຕ້ອງການsub4
  - sub0ຂັນຂອງmission
ກະຕິກາ:
  - ກະຕິກາ:topເປົ້າໝາຍneedsທຸກsubgoalນັ້ນຢູ່ຂັນຂອງມັນ
  - ກະຕິກາ:subgoalຢູ່actionableiffມັນຢູ່unachievedແລະທຸກsubgoalມັນຕ້ອງການຢູ່achieved
  - ກະຕິກາ:exactlyໜຶ່ງsubgoalຢູ່actionable
top goal:mission.
ຕໍ່ໄປsubgoalຫຍັງ?

answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
decomposition:
  - achieved sub1
  - sub5 mission భాగము of
  - sub2 mission భాగము of
  - sub2 sub0 require
  - sub1 mission భాగము of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission భాగము of
  - sub4 mission భాగము of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission భాగము of
నియమం:
  - నియమం top లక్ష్యం అవసరము ప్రతి subgoal ఆ ఉండు భాగము of it
  - నియమం subgoal ఉండు actionable iff it ఉండు unachieved మరియు ప్రతి subgoal it require ఉండు achieved
  - నియమం exactly ఒకటి subgoal ఉండు actionable
top goal: mission.
next subgoal ఏమిటి?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal that wà part of it
  - rule subgoal wà actionable iff it wà unachieved and every subgoal it require wà achieved
  - rule exactly ọ̀kan subgoal wà actionable
Top goal: mission.
What next subgoal?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 mission part of
  - sub2 mission part of
  - sub2 sub0 require
  - sub1 mission part of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission part of
  - sub4 mission part of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission part of
Rules:
  - rule the top goal needs every subgoal that naiágúóli part of it
  - rule subgoal naiágúóli actionable iff it naiágúóli unachieved and every subgoal it require naiágúóli achieved
  - rule exactly dałaá subgoal naiágúóli actionable
Top goal: mission.
Next subgoal what?

answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly ᐊᑕᐅᓯᖅ subgoal is actionable
top goal: mission.
next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly wan subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 part of mission
  - sub2 part of mission
  - sub2 require sub0
  - sub1 part of mission
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 part of mission
  - sub4 part of mission
  - sub2 require sub3
  - sub2 require sub1
  - sub5 require sub4
  - sub1 require sub4
  - sub3 require sub4
  - sub0 part of mission
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly náʼėstse subgoal is actionable
Top goal: mission.
Next subgoal what?

Answer options:
  - sub3
  - sub4
  - sub0
  - sub1
  - sub5
  - sub2
Decomposition:
  - achieved sub1
  - sub5 mission part of
  - sub2 mission part of
  - sub2 sub0 require
  - sub1 mission part of
  - achieved sub3
  - achieved sub5
  - achieved sub4
  - sub3 mission part of
  - sub4 mission part of
  - sub2 sub3 require
  - sub2 sub1 require
  - sub5 sub4 require
  - sub1 sub4 require
  - sub3 sub4 require
  - sub0 mission part of
Rules:
  - rule top goal needs every subgoal that is part of it
  - rule subgoal is actionable iff it is unachieved and every subgoal it require is achieved
  - rule exactly сад subgoal is actionable
Top goal: mission.
Next subgoal вуч?

The legal answers are: tool0; tool2; tool1; tool3.
The rules are:
  - rule workload lists kind count and cost per query without a tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 and 1
  - tool3 covers kind2
  - tool: tool3, 6 and 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 and 3
  - tool: tool0, 11 and 1
Workload: workload: kind3, 8 and 10; workload: kind1, 7 and 9; workload: kind0, 5 and 8; workload: kind2, 4 and 5.
What is the cheapest tool to build?

Las respuestas válidas son: tool0; tool2; tool1; tool3.
Las reglas son:
  - la regla: la carga de trabajo lists el tipo count y el coste de per query without a herramienta
  - la regla: herramienta lists build el coste de y el coste de per covered query
  - la regla: total el coste de es build el coste de plus la suma over kinds de count por per query el coste de
Las herramientas son:
  - tool1 cubre kind3
  - tool0 cubre kind0
  - tool1 cubre kind0
  - herramienta: tool2, 14 y 1
  - tool3 cubre kind2
  - herramienta: tool3, 6 y 2
  - tool2 cubre kind0
  - tool2 cubre kind2
  - herramienta: tool1, 7 y 3
  - herramienta: tool0, 11 y 1
La carga de trabajo es: la carga de trabajo: kind3, 8 y 10; la carga de trabajo: kind1, 7 y 9; la carga de trabajo: kind0, 5 y 8; la carga de trabajo: kind2, 4 y 5.
¿Qué cheapest herramienta a build?

备选答案如下：tool0；tool2；tool1；tool3。
规则如下：规则：的工作负载是lists的种类是count和的成本是perquerywithout一工具；规则：工具listsbuild的成本是和的成本是percoveredquery；规则：total的成本是是build的成本是plus的总和是overkinds的count乘以perquery的成本是。
工具如下：
  - tool1覆盖kind3
  - tool0覆盖kind0
  - tool1覆盖kind0
  - 工具：tool2、14和1
  - tool3覆盖kind2
  - 工具：tool3、6和2
  - tool2覆盖kind0
  - tool2覆盖kind2
  - 工具：tool1、7和3
  - 工具：tool0、11和1
工作负载如下：的工作负载是：kind3、8和10；的工作负载是：kind1、7和9；的工作负载是：kind0、5和8；的工作负载是：kind2、4和5。
cheapest工具给build什么？

Answer options: tool0; tool2; tool1; tool3.
Kurallar:
  - kural: workload lists kind count ve maliyet per query without bir alet
  - kural: alet lists build maliyet ve maliyet per covered query
  - kural: total maliyet build maliyet plus sum over kinds count times per query maliyet
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - alet: tool2, 14 ve 1
  - tool3 kind2 covers
  - alet: tool3, 6 ve 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - alet: tool1, 7 ve 3
  - alet: tool0, 11 ve 1
Workload: workload: kind3, 8 ve 10; workload: kind1, 7 ve 9; workload: kind0, 5 ve 8; workload: kind2, 4 ve 5.
Cheapest alet build ne?

Answer options: tool0; tool2; tool1; tool3.
Sheria ni:
  - sheria: workload lists kind count na gharimu per query without kifaa
  - sheria: kifaa lists build gharimu na gharimu per covered query
  - sheria: total gharimu ni build gharimu plus sum over kinds ya count times per query gharimu
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - kifaa: tool2, 14 na 1
  - tool3 covers kind2
  - kifaa: tool3, 6 na 2
  - tool2 covers kind0
  - tool2 covers kind2
  - kifaa: tool1, 7 na 3
  - kifaa: tool0, 11 na 1
Workload: workload: kind3, 8 na 10; workload: kind1, 7 na 9; workload: kind0, 5 na 8; workload: kind2, 4 na 5.
Cheapest kifaa kwa build nini?

The legal answers are: tool0; tool2; tool1; tool3.
The rules are:
  - rule workload lists kind count and cost per query without a tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 and 1
  - tool3 covers kind2
  - tool: tool3, 6 and 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 and 3
  - tool: tool0, 11 and 1
Workload: workload: kind3, 8 and 10; workload: kind1, 7 and 9; workload: kind0, 5 and 8; workload: kind2, 4 and 5.
What is the cheapest tool to build?

{answer_options: [tool0 tool2 tool1 tool3], query: cheapest_tool_to_build, rules: [(rule (workload_lists_kind_count_and_cost_per_query_without_a_tool)) (rule (tool_lists_build_cost_and_cost_per_covered_query)) (rule (total_cost_is_build_cost_plus_sum_over_kinds_of_count_times_per_query_cost))], tools: [(covers tool1 kind3) (covers tool0 kind0) (covers tool1 kind0) (tool tool2 14 1) (covers tool3 kind2) (tool tool3 6 2) (covers tool2 kind0) (covers tool2 kind2) (tool tool1 7 3) (tool tool0 11 1)], workload: [(workload kind3 8 10) (workload kind1 7 9) (workload kind0 5 8) (workload kind2 4 5)]}

Antwort Alternativen: tool0; tool2; tool1; tool3.
Die Regeln sind:
  - Regel Arbeitsbelastung lists Art zählen und kosten je Frage ohne ein tool
  - Regel tool lists bauen kosten und kosten je bedeckt Frage
  - Regel Gesamtbetrag kosten werden bauen kosten plus Summe vorbei kinds aus zählen mal je Frage kosten
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 und 1
  - tool3 covers kind2
  - tool: tool3, 6 und 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 und 3
  - tool: tool0, 11 und 1
Arbeitsbelastung: Arbeitsbelastung: kind3, 8 und 10; Arbeitsbelastung: kind1, 7 und 9; Arbeitsbelastung: kind0, 5 und 8; Arbeitsbelastung: kind2, 4 und 5.
Was cheapest tool zu bauen?

О̏дгово̄р ѝзбор: tool0; tool2; tool1; tool3.
Пра̏вило:
  - пра̏вило opseg posla lists prijatan бро̀јати и ко̏штати per у̀пит бѐз а̀ла̄т
  - пра̏вило а̀ла̄т lists гра́дити ко̏штати и ко̏штати per prekriven у̀пит
  - пра̏вило zbroj ко̏штати би̏ти гра́дити ко̏штати plus zbroj над kinds od бро̀јати times per у̀пит ко̏штати
А̀ла̄т:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - а̀ла̄т: tool2, 14 и 1
  - tool3 covers kind2
  - а̀ла̄т: tool3, 6 и 2
  - tool2 covers kind0
  - tool2 covers kind2
  - а̀ла̄т: tool1, 7 и 3
  - а̀ла̄т: tool0, 11 и 1
Opseg posla: opseg posla: kind3, 8 и 10; opseg posla: kind1, 7 и 9; opseg posla: kind0, 5 и 8; opseg posla: kind2, 4 и 5.
Cheapest а̀ла̄т to гра́дити kakav?

Vastaus vaihtoehdot: tool0; tool2; tool1; tool3.
Säännöt:
  - sääntö workload lists laji laskea ja maksaa per kysymys ilman työkalu
  - sääntö työkalu lists rakentaa maksaa ja maksaa per peitetty kysymys
  - sääntö summa maksaa tulla rakentaa maksaa plus summa lopussa kinds vaille laskea kertaa per kysymys maksaa
Työkalut:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - työkalu: tool2, 14 ja 1
  - tool3 covers kind2
  - työkalu: tool3, 6 ja 2
  - tool2 covers kind0
  - tool2 covers kind2
  - työkalu: tool1, 7 ja 3
  - työkalu: tool0, 11 ja 1
Workload: workload: kind3, 8 ja 10; workload: kind1, 7 ja 9; workload: kind0, 5 ja 8; workload: kind2, 4 ja 5.
Mikä cheapest työkalu jotta rakentaa?

备选答案如下：tool0；tool2；tool1；tool3。
规则如下：规则：的工作负载是lists的种类是count和的成本是perquerywithout一工具；规则：工具listsbuild的成本是和的成本是percoveredquery；规则：total的成本是是build的成本是plus的总和是overkinds的count乘以perquery的成本是。
工具如下：
  - tool1覆盖kind3
  - tool0覆盖kind0
  - tool1覆盖kind0
  - 工具：tool2、14和1
  - tool3覆盖kind2
  - 工具：tool3、6和2
  - tool2覆盖kind0
  - tool2覆盖kind2
  - 工具：tool1、7和3
  - 工具：tool0、11和1
工作负载如下：的工作负载是：kind3、8和10；的工作负载是：kind1、7和9；的工作负载是：kind0、5和8；的工作负载是：kind2、4和5。
cheapest工具给build什么？

答え選択:tool0; tool2; tool1; tool3.
規則:規則:workloadlists種類数えると費やす毎質問...なしで道具; 規則:道具lists建てる費やすと費やす毎covered質問; 規則:総計費やすれる建てる費やす足す総額上にkindsの中の数える掛ける毎質問費やす.
道具:
  - tool1kind3covers
  - tool0kind0covers
  - tool1kind0covers
  - 道具:tool2, 14と1
  - tool3kind2covers
  - 道具:tool3, 6と2
  - tool2kind0covers
  - tool2kind2covers
  - 道具:tool1, 7と3
  - 道具:tool0, 11と1
workload:workload:kind3, 8と10; workload:kind1, 7と9; workload:kind0, 5と8; workload:kind2, 4と5.
cheapest道具に建てる何と?

Answer options: tool0; tool2; tool1; tool3.
Kurallar:
  - kural: workload lists kind count ve maliyet per query without bir alet
  - kural: alet lists build maliyet ve maliyet per covered query
  - kural: total maliyet build maliyet plus sum over kinds count times per query maliyet
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - alet: tool2, 14 ve 1
  - tool3 kind2 covers
  - alet: tool3, 6 ve 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - alet: tool1, 7 ve 3
  - alet: tool0, 11 ve 1
Workload: workload: kind3, 8 ve 10; workload: kind1, 7 ve 9; workload: kind0, 5 ve 8; workload: kind2, 4 ve 5.
Cheapest alet build ne?

answer options: tool0؛ tool2؛ tool1؛ tool3.
قَانُون:
  - قَانُون workload lists نوع عَدَّ وَـ cost لِكُلّ اِسْتِعْلام بِدُونِ tool
  - قَانُون tool lists بَنَى cost وَـ cost لِكُلّ مُغَطًّى اِسْتِعْلام
  - قَانُون مَجْمُوع cost كَانَ بَنَى cost زَائِد مَجْمُوع فَوْقَ kinds مِنْ عَدَّ فِي لِكُلّ اِسْتِعْلام cost
tools:
  - covers tool1 kind3
  - covers tool0 kind0
  - covers tool1 kind0
  - tool: tool2، 14 وَـ 1
  - covers tool3 kind2
  - tool: tool3، 6 وَـ 2
  - covers tool2 kind0
  - covers tool2 kind2
  - tool: tool1، 7 وَـ 3
  - tool: tool0، 11 وَـ 1
workload: workload: kind3، 8 وَـ 10؛ workload: kind1، 7 وَـ 9؛ workload: kind0، 5 وَـ 8؛ workload: kind2، 4 وَـ 5.
cheapest tool أَنّ بَنَى مَاذَا؟

Პასუხი ვარიანტი: tool0; tool2; tool1; tool3.
Წესი:
  - წესი workload lists ჯიში დათვლა და ღირს per კითხვა გარეშე ინსტრუმენტი
  - წესი ინსტრუმენტი lists აშენება ღირს და ღირს per covered კითხვა
  - წესი total ღირს ყოფნა აშენება ღირს plus ჯამი over kinds of დათვლა times per კითხვა ღირს
Ინსტრუმენტები:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - ინსტრუმენტი: tool2, 14 და 1
  - tool3 kind2 covers
  - ინსტრუმენტი: tool3, 6 და 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - ინსტრუმენტი: tool1, 7 და 3
  - ინსტრუმენტი: tool0, 11 და 1
Workload: workload: kind3, 8 და 10; workload: kind1, 7 და 9; workload: kind0, 5 და 8; workload: kind2, 4 და 5.
Cheapest ინსტრუმენტი უკლია აშენება რა?

Whakautu kōwhiringa: tool0; tool2; tool1; tool3.
Rekureihana:
  - rekureihana workload lists kano tatau me cost per query kore paraha
  - rekureihana paraha lists hanga cost me cost per covered query
  - rekureihana tapeke cost is hanga cost ngahoro tapeke paiepa kinds o tatau times per query cost
Paraha:
  - covers tool1 kind3
  - covers tool0 kind0
  - covers tool1 kind0
  - paraha: tool2, 14 me 1
  - covers tool3 kind2
  - paraha: tool3, 6 me 2
  - covers tool2 kind0
  - covers tool2 kind2
  - paraha: tool1, 7 me 3
  - paraha: tool0, 11 me 1
Workload: workload: kind3, 8 me 10; workload: kind1, 7 me 9; workload: kind0, 5 me 8; workload: kind2, 4 me 5.
Cheapest paraha ki hanga unutai?

Trả lời lựa chọn: tool0; tool2; tool1; tool3.
Quy tắc:
  - quy tắc workload lists loại đếm và cost mỗi query không có dụng cụ
  - quy tắc dụng cụ lists xây cost và cost mỗi covered query
  - quy tắc tổng cost được xây cost cộng tổng số trên kinds bằng đếm nhân mỗi query cost
Dụng cụ:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - dụng cụ: tool2, 14 và 1
  - tool3 covers kind2
  - dụng cụ: tool3, 6 và 2
  - tool2 covers kind0
  - tool2 covers kind2
  - dụng cụ: tool1, 7 và 3
  - dụng cụ: tool0, 11 và 1
Workload: workload: kind3, 8 và 10; workload: kind1, 7 và 9; workload: kind0, 5 và 8; workload: kind2, 4 và 5.
Cheapest dụng cụ để xây gì?

คำตอบตัวเลือก:tool0; tool2; tool1; tool3.
กฎ:กฎ:workloadlistsชนิดนับและราคาละสอบถามไร้tool; กฎ:toollistsก่อราคาและราคาละcoveredสอบถาม; กฎ:totalราคาถูกก่อราคาบวกsumเปลี่ยนkindsของนับคูณละสอบถามราคา.
tools:
  - tool1coverskind3
  - tool0coverskind0
  - tool1coverskind0
  - tool:tool2, 14และ1
  - tool3coverskind2
  - tool:tool3, 6และ2
  - tool2coverskind0
  - tool2coverskind2
  - tool:tool1, 7และ3
  - tool:tool0, 11และ1
workload:workload:kind3, 8และ10; workload:kind1, 7และ9; workload:kind0, 5และ8; workload:kind2, 4และ5.
cheapesttoolเพื่อก่ออะไร?

answer options: tool0; tool2; tool1; tool3.
rules:
  - rule workload lists kind எண்ணு மற்றும் செலவு per query without tool
  - rule tool lists build செலவு மற்றும் செலவு per covered query
  - rule மொத்தம் செலவு படு build செலவு plus sum over kinds கொண்ட எண்ணு times per query செலவு
tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - tool: tool2, 14 மற்றும் 1
  - tool3 kind2 covers
  - tool: tool3, 6 மற்றும் 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - tool: tool1, 7 மற்றும் 3
  - tool: tool0, 11 மற்றும் 1
workload: workload: kind3, 8 மற்றும் 10; workload: kind1, 7 மற்றும் 9; workload: kind0, 5 மற்றும் 8; workload: kind2, 4 மற்றும் 5.
cheapest tool வரை build என்ன?

Answer options: tool0; tool2; tool1; tool3.
Sheria ni:
  - sheria: workload lists kind count na gharimu per query without kifaa
  - sheria: kifaa lists build gharimu na gharimu per covered query
  - sheria: total gharimu ni build gharimu plus sum over kinds ya count times per query gharimu
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - kifaa: tool2, 14 na 1
  - tool3 covers kind2
  - kifaa: tool3, 6 na 2
  - tool2 covers kind0
  - tool2 covers kind2
  - kifaa: tool1, 7 na 3
  - kifaa: tool0, 11 na 1
Workload: workload: kind3, 8 na 10; workload: kind1, 7 na 9; workload: kind0, 5 na 8; workload: kind2, 4 na 5.
Cheapest kifaa kwa build nini?

Answer options: tool0; tool2; tool1; tool3.
Bee hazʼáanii:
  - bee hazʼáanii workload lists kind ííníshtaʼ dóó bą́ą́h ílį́ per query tʼáágééd bee naʼanishí
  - bee hazʼáanii bee naʼanishí lists build bą́ą́h ílį́ dóó bą́ą́h ílį́ per covered query
  - bee hazʼáanii total bą́ą́h ílį́ átʼé build bą́ą́h ílį́ plus sum over kinds of ííníshtaʼ ahą́ą́h nániilyá per query bą́ą́h ílį́
Bee naʼanishí:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - bee naʼanishí: tool2, 14 dóó 1
  - tool3 kind2 covers
  - bee naʼanishí: tool3, 6 dóó 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - bee naʼanishí: tool1, 7 dóó 3
  - bee naʼanishí: tool0, 11 dóó 1
Workload: workload: kind3, 8 dóó 10; workload: kind1, 7 dóó 9; workload: kind0, 5 dóó 8; workload: kind2, 4 dóó 5.
Cheapest bee naʼanishí to build haʼátʼíísh?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind kisitsivoq aamma cost per query without tool
  - rule tool lists build cost aamma cost per covered query
  - rule total cost a build cost plus sum over kinds of kisitsivoq times per query cost
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - tool: tool2, 14 aamma 1
  - tool3 kind2 covers
  - tool: tool3, 6 aamma 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - tool: tool1, 7 aamma 3
  - tool: tool0, 11 aamma 1
Workload: workload: kind3, 8 aamma 10; workload: kind1, 7 aamma 9; workload: kind0, 5 aamma 8; workload: kind2, 4 aamma 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count na cost per query without tool
  - rule tool lists build cost na cost per covered query
  - rule total cost is build cost plus sum over kinds bilong count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 na 1
  - tool3 covers kind2
  - tool: tool3, 6 na 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 na 3
  - tool: tool0, 11 na 1
Workload: workload: kind3, 8 na 10; workload: kind1, 7 na 9; workload: kind0, 5 na 8; workload: kind2, 4 na 5.
Cheapest tool long build what?

Answer options: tool0; tool2; tool1; tool3.
Nikanixi:
  - nikanixi workload lists kind count and cost per query without tool
  - nikanixi tool lists build cost and cost per covered query
  - nikanixi total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 1
  - tool3 covers kind2
  - tool: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build kwèch?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind лархӏа а cost per query without tool
  - rule tool lists хьал де cost а cost per covered query
  - rule total cost хила хьал де cost plus sum over kinds of лархӏа times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 а 1
  - tool3 covers kind2
  - tool: tool3, 6 а 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 а 3
  - tool: tool0, 11 а 1
Workload: workload: kind3, 8 а 10; workload: kind1, 7 а 9; workload: kind0, 5 а 8; workload: kind2, 4 а 5.
Cheapest tool to хьал де фу?

대답 선택: tool0; tool2; tool1; tool3.
규칙: 규칙 workload lists 종류 세다 and cost per 질문...없이 도구; 규칙 도구 lists 만들다 cost and cost per covered 질문; 규칙 합계 cost is 만들다 cost 더하기 합계 위에 kinds...의 세다 곱하기 per 질문 cost.
도구:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - 도구: tool2, 14 1
  - tool3 kind2 covers
  - 도구: tool3, 6 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - 도구: tool1, 7 3
  - 도구: tool0, 11 1
workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
cheapest 도구...으로 만들다 무엇?

Erantzun aukerongatik: tool0; tool2; tool1; tool3.
Arau:
  - arau workload lists genero count eta kostatu per query gabe bat tool
  - arau tool lists eraiki kostatu eta kostatu per covered query
  - arau total kostatu izan eraiki kostatu gehi sum over kinds of count bider per query kostatu
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - tool: tool2, 14 eta 1
  - tool3 kind2 covers
  - tool: tool3, 6 eta 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - tool: tool1, 7 eta 3
  - tool: tool0, 11 eta 1
Workload: workload: kind3, 8 eta 10; workload: kind1, 7 eta 9; workload: kind0, 5 eta 8; workload: kind2, 4 eta 5.
Cheapest tool to eraiki zer?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind ᏓᏎᎯᎭ ᎠᎴ cost per query without tool
  - rule tool lists ᎠᏁᏍᎨᎭ cost ᎠᎴ cost per covered query
  - rule total cost is ᎠᏁᏍᎨᎭ cost plus sum over kinds of ᏓᏎᎯᎭ times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 ᎠᎴ 1
  - tool3 covers kind2
  - tool: tool3, 6 ᎠᎴ 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 ᎠᎴ 3
  - tool: tool0, 11 ᎠᎴ 1
Workload: workload: kind3, 8 ᎠᎴ 10; workload: kind1, 7 ᎠᎴ 9; workload: kind0, 5 ᎠᎴ 8; workload: kind2, 4 ᎠᎴ 5.
What cheapest tool to ᎠᏁᏍᎨᎭ?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind yupay and cost per query without llamkana
  - rule llamkana lists build cost and cost per covered query
  - rule total cost tiyay build cost plus qullu pata kinds of yupay times per query cost
Llamkana:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - llamkana: tool2, 14 1
  - tool3 covers kind2
  - llamkana: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - llamkana: tool1, 7 3
  - llamkana: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest llamkana to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count ыкӏи cost per query without tool
  - rule tool lists build cost ыкӏи cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - tool: tool2, 14 ыкӏи 1
  - tool3 kind2 covers
  - tool: tool3, 6 ыкӏи 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - tool: tool1, 7 ыкӏи 3
  - tool: tool0, 11 ыкӏи 1
Workload: workload: kind3, 8 ыкӏи 10; workload: kind1, 7 ыкӏи 9; workload: kind0, 5 ыкӏи 8; workload: kind2, 4 ыкӏи 5.
Cheapest tool to build сыд?

Answer options: tool0; tool2; tool1; tool3.
Cai:
  - cai workload lists kind count thiab nqi per query without tool
  - cai tool lists kho nqi thiab nqi per covered query
  - cai total nqi is kho nqi plus sum over kinds of count times per query nqi
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 thiab 1
  - tool3 covers kind2
  - tool: tool3, 6 thiab 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 thiab 3
  - tool: tool0, 11 thiab 1
Workload: workload: kind3, 8 thiab 10; workload: kind1, 7 thiab 9; workload: kind0, 5 thiab 8; workload: kind2, 4 thiab 5.
Cheapest tool to kho what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 1
  - tool3 covers kind2
  - tool: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build ining-jak?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count micha' cost per query without tool
  - rule tool lists build cost micha' cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 micha' 1
  - tool3 covers kind2
  - tool: tool3, 6 micha' 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 micha' 3
  - tool: tool0, 11 micha' 1
Workload: workload: kind3, 8 micha' 10; workload: kind1, 7 micha' 9; workload: kind0, 5 micha' 8; workload: kind2, 4 micha' 5.
Cheapest tool to build nanta?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count カ cost per query without tool
  - rule tool lists build cost カ cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - tool: tool2, 14 カ 1
  - tool3 kind2 covers
  - tool: tool3, 6 カ 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - tool: tool1, 7 カ 3
  - tool: tool0, 11 カ 1
Workload: workload: kind3, 8 カ 10; workload: kind1, 7 カ 9; workload: kind0, 5 カ 8; workload: kind2, 4 カ 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count ынкъам cost per query without tool
  - rule tool lists build cost ынкъам cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 ынкъам 1
  - tool3 covers kind2
  - tool: tool3, 6 ынкъам 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 ынкъам 3
  - tool: tool0, 11 ынкъам 1
Workload: workload: kind3, 8 ынкъам 10; workload: kind1, 7 ынкъам 9; workload: kind0, 5 ынкъам 8; workload: kind2, 4 ынкъам 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count yéetel cost per query without tool
  - rule tool lists build cost yéetel cost per covered query
  - rule total cost yan build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 yéetel 1
  - tool3 covers kind2
  - tool: tool3, 6 yéetel 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 yéetel 3
  - tool: tool0, 11 yéetel 1
Workload: workload: kind3, 8 yéetel 10; workload: kind1, 7 yéetel 9; workload: kind0, 5 yéetel 8; workload: kind2, 4 yéetel 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 1
  - tool3 covers kind2
  - tool: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build híli?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count na cost per query without tool
  - rule tool lists build cost na cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - tool: tool2, 14 na 1
  - tool3 kind2 covers
  - tool: tool3, 6 na 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - tool: tool1, 7 na 3
  - tool: tool0, 11 na 1
Workload: workload: kind3, 8 na 10; workload: kind1, 7 na 9; workload: kind0, 5 na 8; workload: kind2, 4 na 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 1
  - tool3 covers kind2
  - tool: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without maya tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - tool: tool2, 14 1
  - tool3 kind2 covers
  - tool: tool3, 6 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count ǂʻá cost per query without tool
  - rule tool lists build cost ǂʻá cost per covered query
  - rule total cost ǀîi build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 ǂʻá 1
  - tool3 covers kind2
  - tool: tool3, 6 ǂʻá 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 ǂʻá 3
  - tool: tool0, 11 ǂʻá 1
Workload: workload: kind3, 8 ǂʻá 10; workload: kind1, 7 ǂʻá 9; workload: kind0, 5 ǂʻá 8; workload: kind2, 4 ǂʻá 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - tool: tool2, 14 1
  - tool3 kind2 covers
  - tool: tool3, 6 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 1
  - tool3 covers kind2
  - tool: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - tool: tool2, 14 1
  - tool3 kind2 covers
  - tool: tool3, 6 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 1
  - tool3 covers kind2
  - tool: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost nemi build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 1
  - tool3 covers kind2
  - tool: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build tay?

Réponse choix : tool0 ; tool2 ; tool1 ; tool3.
Les règles sont:
  - règle workload lists genre compter et coûter par question sans un outil
  - règle outil lists construire coûter et coûter par couvert question
  - règle total coûter être construire coûter plus somme fini kinds de compter fois par question coûter
Outils :
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - outil: tool2, 14 et 1
  - tool3 covers kind2
  - outil: tool3, 6 et 2
  - tool2 covers kind0
  - tool2 covers kind2
  - outil: tool1, 7 et 3
  - outil: tool0, 11 et 1
Workload : workload : kind3, 8 et 10 ; workload : kind1, 7 et 9 ; workload : kind0, 5 et 8 ; workload : kind2, 4 et 5.
Quoi cheapest outil pour construire ?

Respondo alternativo: tool0; tool2; tool1; tool3.
Regulo:
  - regulo workload lists speco kalkuli kaj kosti graŭ pridemando sen laborilo
  - regulo laborilo lists konstrui kosti kaj kosti graŭ covered pridemando
  - regulo totalo kosti egali konstrui kosti plus sum finita kinds de kalkuli times graŭ pridemando kosti
Laborilo:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - laborilo: tool2, 14 kaj 1
  - tool3 covers kind2
  - laborilo: tool3, 6 kaj 2
  - tool2 covers kind0
  - tool2 covers kind2
  - laborilo: tool1, 7 kaj 3
  - laborilo: tool0, 11 kaj 1
Workload: workload: kind3, 8 kaj 10; workload: kind1, 7 kaj 9; workload: kind0, 5 kaj 8; workload: kind2, 4 kaj 5.
Cheapest laborilo al konstrui kio?

Válasz lehetőségek: tool0; tool2; tool1; tool3.
Szabályok:
  - szabály workload lists fajta számol és kerül per kérdés nélkül szerszám
  - szabály szerszám lists épít kerül és kerül per fedett kérdés
  - szabály végösszeg kerül van épít kerül meg összeg vége kinds of számol times per kérdés kerül
Szerszámok:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - szerszám: tool2, 14 és 1
  - tool3 covers kind2
  - szerszám: tool3, 6 és 2
  - tool2 covers kind0
  - tool2 covers kind2
  - szerszám: tool1, 7 és 3
  - szerszám: tool0, 11 és 1
Workload: workload: kind3, 8 és 10; workload: kind1, 7 és 9; workload: kind0, 5 és 8; workload: kind2, 4 és 5.
Cheapest szerszám hogy épít melyik?

回答選擇:tool0; tool2; tool1; tool3.
rules:rule:workloadlists類count及costperquery冇一架生; rule:架生lists建設cost及costpercoveredquery; rule:totalcost是建設cost加sum結束kinds...嘅counttimesperquerycost.
架生:
  - tool1coverskind3
  - tool0coverskind0
  - tool1coverskind0
  - 架生:tool2, 14及1
  - tool3coverskind2
  - 架生:tool3, 6及2
  - tool2coverskind0
  - tool2coverskind2
  - 架生:tool1, 7及3
  - 架生:tool0, 11及1
workload:workload:kind3, 8及10; workload:kind1, 7及9; workload:kind0, 5及8; workload:kind2, 4及5.
cheapest架生to建設乜嘢?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count とぅ cost per query without tool
  - rule tool lists build cost とぅ cost per covered query
  - rule total cost 有ん build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 とぅ 1
  - tool3 covers kind2
  - tool: tool3, 6 とぅ 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 とぅ 3
  - tool: tool0, 11 とぅ 1
Workload: workload: kind3, 8 とぅ 10; workload: kind1, 7 とぅ 9; workload: kind0, 5 とぅ 8; workload: kind2, 4 とぅ 5.
Cheapest tool to build what?

Жауап опцион: tool0; tool2; tool1; tool3.
Ереже:
  - ереже workload lists ақ көңіл санау және тұру per сұрау without аспап
  - ереже аспап lists салу тұру және тұру per covered сұрау
  - ереже total тұру is салу тұру plus сом over kinds туралы санау times per сұрау тұру
Аспаптар:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - аспап: tool2, 14 және 1
  - tool3 covers kind2
  - аспап: tool3, 6 және 2
  - tool2 covers kind0
  - tool2 covers kind2
  - аспап: tool1, 7 және 3
  - аспап: tool0, 11 және 1
Workload: workload: kind3, 8 және 10; workload: kind1, 7 және 9; workload: kind0, 5 және 8; workload: kind2, 4 және 5.
Cheapest аспап to салу не?

תְּשׁוּבָה אפשרויות: tool0; tool2; tool1; tool3.
מָשַׁל:
  - מָשַׁל workload lists מִין סָפַר וְ־ עָלָה לכל query בְּלִי אַחַת tool
  - מָשַׁל tool lists בָּנָה עָלָה וְ־ עָלָה לכל מכוסה query
  - מָשַׁל total עָלָה הוא בָּנָה עָלָה פלוס סְכוּם עֲבֹר kinds שֶׁל סָפַר times לכל query עָלָה
tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 וְ־ 1
  - tool3 covers kind2
  - tool: tool3, 6 וְ־ 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 וְ־ 3
  - tool: tool0, 11 וְ־ 1
workload: workload: kind3, 8 וְ־ 10; workload: kind1, 7 וְ־ 9; workload: kind0, 5 וְ־ 8; workload: kind2, 4 וְ־ 5.
איזה cheapest tool ל־ בָּנָה?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count დო cost per query without tool
  - rule tool lists build cost დო cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 დო 1
  - tool3 covers kind2
  - tool: tool3, 6 დო 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 დო 3
  - tool: tool0, 11 დო 1
Workload: workload: kind3, 8 დო 10; workload: kind1, 7 დო 9; workload: kind0, 5 დო 8; workload: kind2, 4 დო 5.
Cheapest tool to build what?

Jawaban pilihan-pilihan: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists baik menghitung dan menghabiskan biaya per kueri tanpa tool
  - rule tool lists membangun menghabiskan biaya dan menghabiskan biaya per tertutup kueri
  - rule jumlah menghabiskan biaya berada membangun menghabiskan biaya plus sum ganti kinds dari menghitung kali per kueri menghabiskan biaya
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 dan 1
  - tool3 covers kind2
  - tool: tool3, 6 dan 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 dan 3
  - tool: tool0, 11 dan 1
Workload: workload: kind3, 8 dan 10; workload: kind1, 7 dan 9; workload: kind0, 5 dan 8; workload: kind2, 4 dan 5.
Cheapest tool banding membangun apa?

ពាក្យឆ្លើយជំរើស:tool0; tool2; tool1; tool3.
ក្បួន:
  - ក្បួន:workloadlistsប្រភេទរាប់នឹងមានតម្លៃperqueryគ្មានtool
  - ក្បួន:toollistsសង់មានតម្លៃនឹងមានតម្លៃpercoveredquery
  - ក្បួន:totalមានតម្លៃត្រូវបានសង់មានតម្លៃបូកផលបូកលើkindsនៃរាប់គុណperqueryមានតម្លៃ
tools:
  - tool1coverskind3
  - tool0coverskind0
  - tool1coverskind0
  - tool:tool2, 14នឹង1
  - tool3coverskind2
  - tool:tool3, 6នឹង2
  - tool2coverskind0
  - tool2coverskind2
  - tool:tool1, 7នឹង3
  - tool:tool0, 11នឹង1
workload:workload:kind3, 8នឹង10; workload:kind1, 7នឹង9; workload:kind0, 5នឹង8; workload:kind2, 4នឹង5.
cheapesttoolដល់សង់អី?

ຄຳຕອບທາງເລືອກ:tool0; tool2; tool1; tool3.
ກະຕິກາ:
  - ກະຕິກາ:workloadlistsຊະນິດນັບແລະຄ່າໃຊ້ຈ່າຍperqueryບໍ່ເຄື່ອງມື
  - ກະຕິກາ:ເຄື່ອງມືlistsກໍ່ສ້າງຄ່າໃຊ້ຈ່າຍແລະຄ່າໃຊ້ຈ່າຍpercoveredquery
  - ກະຕິກາ:totalຄ່າໃຊ້ຈ່າຍຢູ່ກໍ່ສ້າງຄ່າໃຊ້ຈ່າຍplussumoverkindsຂອງນັບtimesperqueryຄ່າໃຊ້ຈ່າຍ
ເຄື່ອງມື:
  - tool1coverskind3
  - tool0coverskind0
  - tool1coverskind0
  - ເຄື່ອງມື:tool2, 14ແລະ1
  - tool3coverskind2
  - ເຄື່ອງມື:tool3, 6ແລະ2
  - tool2coverskind0
  - tool2coverskind2
  - ເຄື່ອງມື:tool1, 7ແລະ3
  - ເຄື່ອງມື:tool0, 11ແລະ1
workload:workload:kind3, 8ແລະ10; workload:kind1, 7ແລະ9; workload:kind0, 5ແລະ8; workload:kind2, 4ແລະ5.
cheapestເຄື່ອງມືtoກໍ່ສ້າງຫຍັງ?

answer options: tool0; tool2; tool1; tool3.
నియమం:
  - నియమం workload lists రకము లెక్కించు మరియు cost per query without పనిముట్టు
  - నియమం పనిముట్టు lists build cost మరియు cost per covered query
  - నియమం మొత్తము cost ఉండు build cost plus sum over kinds of లెక్కించు times per query cost
పనిముట్టు:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - పనిముట్టు: tool2, 14 మరియు 1
  - tool3 kind2 covers
  - పనిముట్టు: tool3, 6 మరియు 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - పనిముట్టు: tool1, 7 మరియు 3
  - పనిముట్టు: tool0, 11 మరియు 1
workload: workload: kind3, 8 మరియు 10; workload: kind1, 7 మరియు 9; workload: kind0, 5 మరియు 8; workload: kind2, 4 మరియు 5.
cheapest పనిముట్టు to build ఏమిటి?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost wà build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 1
  - tool3 covers kind2
  - tool: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
What cheapest tool to build?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost naiágúóli build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - tool: tool2, 14 1
  - tool3 kind2 covers
  - tool: tool3, 6 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build what?

answer options: tool0; tool2; tool1; tool3.
rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 1
  - tool3 covers kind2
  - tool: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 3
  - tool: tool0, 11 1
workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without wrokosani
  - rule wrokosani lists build cost and cost per covered query
  - rule total cost is build cost plus sum kaba kinds of count times per query cost
Wrokosani:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - wrokosani: tool2, 14 1
  - tool3 covers kind2
  - wrokosani: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - wrokosani: tool1, 7 3
  - wrokosani: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest wrokosani to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 covers kind3
  - tool0 covers kind0
  - tool1 covers kind0
  - tool: tool2, 14 1
  - tool3 covers kind2
  - tool: tool3, 6 2
  - tool2 covers kind0
  - tool2 covers kind2
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build what?

Answer options: tool0; tool2; tool1; tool3.
Rules:
  - rule workload lists kind count and cost per query without tool
  - rule tool lists build cost and cost per covered query
  - rule total cost is build cost plus sum over kinds of count times per query cost
Tools:
  - tool1 kind3 covers
  - tool0 kind0 covers
  - tool1 kind0 covers
  - tool: tool2, 14 1
  - tool3 kind2 covers
  - tool: tool3, 6 2
  - tool2 kind0 covers
  - tool2 kind2 covers
  - tool: tool1, 7 3
  - tool: tool0, 11 1
Workload: workload: kind3, 8 10; workload: kind1, 7 9; workload: kind0, 5 8; workload: kind2, 4 5.
Cheapest tool to build вуч?

The legal answers are:
  - f
  - e
  - c
  - d
  - b
  - a
The symbols are:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
What is the reversed at 0?

Las respuestas válidas son:
  - f
  - e
  - c
  - d
  - b
  - a
Los símbolos son:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
¿Qué reversed: 0?

备选答案如下：
  - f
  - e
  - c
  - d
  - b
  - a
符号如下：
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversed在：0什么？

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Simgeler:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at: 0 ne?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed katika: 0 nini?

The legal answers are:
  - f
  - e
  - c
  - d
  - b
  - a
The symbols are:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
What is the reversed at 0?

{answer_options: [f e c d b a], query: (reversed_at 0), symbols: [b a f d d f b]}

Antwort Alternativen:
  - f
  - e
  - c
  - d
  - b
  - a
Symbole:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Was reversed an 0?

О̏дгово̄р ѝзбор:
  - f
  - e
  - c
  - d
  - b
  - a
Сѝмбо̄л:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 kakav?

Vastaus vaihtoehdot:
  - f
  - e
  - c
  - d
  - b
  - a
Merkit:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Mikä reversed luona 0?

备选答案如下：
  - f
  - e
  - c
  - d
  - b
  - a
符号如下：
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversed在：0什么？

答え選択:
  - f
  - e
  - c
  - d
  - b
  - a
記号:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversed...で:0何と?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Simgeler:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at: 0 ne?

answer options:
  - f
  - e
  - c
  - d
  - b
  - a
رَمْز:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversed عِنْد 0 مَاذَا؟

Პასუხი ვარიანტი:
  - f
  - e
  - c
  - d
  - b
  - a
Სიმბოლო:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 რა?

Whakautu kōwhiringa:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed i 0 unutai?

Trả lời lựa chọn:
  - f
  - e
  - c
  - d
  - b
  - a
Ký hiệu:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed lúc 0 gì?

คำตอบตัวเลือก:
  - f
  - e
  - c
  - d
  - b
  - a
สัญลักษณ์:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversedที่:0อะไร?

answer options:
  - f
  - e
  - c
  - d
  - b
  - a
சின்னம்:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversed at 0 என்ன?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed katika: 0 nini?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 haʼátʼíísh?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed long 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 kwèch?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 фу?

대답 선택:
  - f
  - e
  - c
  - d
  - b
  - a
상징:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversed at 0 무엇?

Erantzun aukerongatik:
  - f
  - e
  - c
  - d
  - b
  - a
Ikurrongatik:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 zer?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
What reversed at 0?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 сыд?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed jeyou 0 ining-jak?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 nanta?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 híli?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 tay?

Réponse choix :
  - f
  - e
  - c
  - d
  - b
  - a
Symboles :
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Quoi reversed à 0 ?

Respondo alternativo:
  - f
  - e
  - c
  - d
  - b
  - a
Simbolo:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed ĉe 0 kio?

Válasz lehetőségek:
  - f
  - e
  - c
  - d
  - b
  - a
Szimbólumok:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 melyik?

回答選擇:
  - f
  - e
  - c
  - d
  - b
  - a
符號:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversed喺:0乜嘢?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Жауап опцион:
  - f
  - e
  - c
  - d
  - b
  - a
Символ:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 не?

תְּשׁוּבָה אפשרויות:
  - f
  - e
  - c
  - d
  - b
  - a
סֵמֶל:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
איזה reversed אֵצֶל 0?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Jawaban pilihan-pilihan:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 apa?

ពាក្យឆ្លើយជំរើស:
  - f
  - e
  - c
  - d
  - b
  - a
សញ្ញា:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversed at:0អី?

ຄຳຕອບທາງເລືອກ:
  - f
  - e
  - c
  - d
  - b
  - a
ສັນຍະລັກ:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversedທີ່:0ຫຍັງ?

answer options:
  - f
  - e
  - c
  - d
  - b
  - a
symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversed వద్ద 0 ఏమిటి?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
What reversed at 0?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

answer options:
  - f
  - e
  - c
  - d
  - b
  - a
symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 what?

Answer options:
  - f
  - e
  - c
  - d
  - b
  - a
Symbols:
  - b
  - a
  - f
  - d
  - d
  - f
  - b
Reversed at 0 вуч?

The legal answers are: o0; o1; o2; o3.
You are told: ltt says purple; tkl says orange; mlz says blue.
In the scene: o0 is a blue disc at (6, 7); o1 is an orange prism at (6, 1); o2 is a purple sphere at (8, 1); o3 is a red cube at (8, 3).
What is the mlz?

Las respuestas válidas son: o0; o1; o2; o3.
Se sabe lo siguiente: ltt dice morado; tkl dice naranja; mlz dice azul.
En la escena: o0 es un disco azul en (6, 7); o1 es un prisma naranja en (6, 1); o2 es una esfera morada en (8, 1); o3 es un cubo rojo en (8, 3).
¿Qué mlz?

备选答案如下：o0；o1；o2；o3。
词表如下：ltt说紫色的；tkl说橙色的；mlz说蓝色的。
场景中：o0是一个蓝色的圆盘在(6、7)；o1是一个橙色的棱镜在(6、1)；o2是一个紫色的球体在(8、1)；o3是一个红色的立方体在(8、3)。
mlz什么？

Answer options: o0; o1; o2; o3.
Lexicon: ltt mor der; tkl turuncu der; mlz mavi der.
Sahnede: o0 (6, 7) bir mavi disk; o1 (6, 1) bir turuncu prizma; o2 (8, 1) bir mor küre; o3 (8, 3) bir kırmızı küp.
Mlz ne?

Answer options: o0; o1; o2; o3.
Lexicon: ltt anasema zambarau; tkl anasema chungwa; mlz anasema buluu.
Katika tukio: o0 ni duara buluu katika (6, 7); o1 ni prizma chungwa katika (6, 1); o2 ni tufe zambarau katika (8, 1); o3 ni mchemraba mwekundu katika (8, 3).
Mlz nini?

The legal answers are: o0; o1; o2; o3.
You are told: ltt says purple; tkl says orange; mlz says blue.
In the scene: o0 is a blue disc at (6, 7); o1 is an orange prism at (6, 1); o2 is a purple sphere at (8, 1); o3 is a red cube at (8, 3).
What is the mlz?

{answer_options: [o0 o1 o2 o3], lexicon: [(says ltt purple) (says tkl orange) (says mlz blue)], query: (find mlz), scene: [(obj o0 blue disc 6 7) (obj o1 orange prism 6 1) (obj o2 purple sphere 8 1) (obj o3 red cube 8 3)]}

Antwort Alternativen: o0; o1; o2; o3.
Gegeben ist: ltt sagen purpurne; tkl sagen orange; mlz sagen blaue.
In der Szene: o0 ist ein blauer Scheibe an (6, 7); o1 ist ein oranges Prisma an (6, 1); o2 ist eine purpurne Kugel an (8, 1); o3 ist ein roter Kubus an (8, 3).
Was mlz?

О̏дгово̄р ѝзбор: o0; o1; o2; o3.
Lexicon: ltt ре̏ћи пурпуран; tkl ре̏ћи на̀ра̄нџаст; mlz ре̏ћи пла̑в.
Позорје: o0 би̏ти пла̑в диск (6, 7); o1 би̏ти на̀ра̄нџаст при̏зма (6, 1); o2 би̏ти пурпуран сфе́ра (8, 1); o3 би̏ти цр̀вен коцка (8, 3).
Mlz kakav?

Vastaus vaihtoehdot: o0; o1; o2; o3.
Sanasto: ltt sanoa sinipunainen; tkl sanoa oranssi; mlz sanoa sininen.
Näyttämö: o0 on sininen kiekko (6, 7) luona; o1 on oranssi prisma (6, 1) luona; o2 on sinipunainen pallo (8, 1) luona; o3 on punainen kuutio (8, 3) luona.
Mikä mlz?

备选答案如下：o0；o1；o2；o3。
词表如下：ltt说紫色的；tkl说橙色的；mlz说蓝色的。
场景中：o0是一个蓝色的圆盘在(6、7)；o1是一个橙色的棱镜在(6、1)；o2是一个紫色的球体在(8、1)；o3是一个红色的立方体在(8、3)。
mlz什么？

答え選択:o0; o1; o2; o3.
語彙:ltt紫色言う; tklオレンジ色の言う; mlz青い言う.
現場:o0(6, 7)...で青いディスクです; o1(6, 1)...でオレンジ色のプリズムです; o2(8, 1)...で紫色球です; o3(8, 3)...で赤い立方体です.
mlz何と?

Answer options: o0; o1; o2; o3.
Lexicon: ltt mor der; tkl turuncu der; mlz mavi der.
Sahnede: o0 (6, 7) bir mavi disk; o1 (6, 1) bir turuncu prizma; o2 (8, 1) bir mor küre; o3 (8, 3) bir kırmızı küp.
Mlz ne?

answer options: o0؛ o1؛ o2؛ o3.
lexicon: قَالَ ltt أُرْجُوَانِيّ؛ قَالَ tkl بُرْتُقَالِيّ؛ قَالَ mlz أَزْرَق.
مَنْظَر: o0 قُرْص أَزْرَق عِنْد (6، 7)؛ o1 مَنْشُور بُرْتُقَالِيّ عِنْد (6، 1)؛ o2 كُرَة أُرْجُوَانِيّ عِنْد (8، 1)؛ o3 كَعْبَة أَحْمَر عِنْد (8، 3).
mlz مَاذَا؟

Პასუხი ვარიანტი: o0; o1; o2; o3.
Ლექსიკონი: ltt იისფერი თქმა; tkl ფორთოხალი თქმა; mlz ლურჯი თქმა.
Scene: o0 (6, 7) ლურჯი დისკი ყოფნა; o1 (6, 1) ფორთოხალი პრიზმა ყოფნა; o2 (8, 1) იისფერი სფერო ყოფნა; o3 (8, 3) წითელი კუბი ყოფნა.
Mlz რა?

Whakautu kōwhiringa: o0; o1; o2; o3.
Huinga kupu: korokī ltt waiporoporo; korokī tkl orange; korokī mlz kahurangi.
Kāpeka: o0 porotītiti kahurangi i (6, 7); o1 poro orange i (6, 1); o2 poi waiporoporo i (8, 1); o3 mataono red i (8, 3).
Mlz unutai?

Trả lời lựa chọn: o0; o1; o2; o3.
Từ điển: ltt nói đỏ tía; tkl nói cam; mlz nói blue.
Giới: o0 là đĩa blue lúc (6, 7); o1 là lăng kính cam lúc (6, 1); o2 là mặt cầu đỏ tía lúc (8, 1); o3 là lập phương đỏ lúc (8, 3).
Mlz gì?

คำตอบตัวเลือก:o0; o1; o2; o3.
คลังศัพท์:lttกล่าวม่วง; tklกล่าวส้ม; mlzกล่าวน้ำเงิน.
scene:o0ถูกดิสก์น้ำเงินที่(6, 7); o1ถูกปริซึมส้มที่(6, 1); o2ถูกทรงกลมม่วงที่(8, 1); o3ถูกลูกบาศก์แดงที่(8, 3).
mlzอะไร?

answer options: o0; o1; o2; o3.
lexicon: ltt ஊதா சொல்; tkl ஆரஞ்சு சொல்; mlz நீலம் சொல்.
scene: o0 (6, 7) நீலம் disc; o1 (6, 1) ஆரஞ்சு பட்டகம்; o2 (8, 1) ஊதா sphere; o3 (8, 3) சிவப்பு cube.
mlz என்ன?

Answer options: o0; o1; o2; o3.
Lexicon: ltt anasema zambarau; tkl anasema chungwa; mlz anasema buluu.
Katika tukio: o0 ni duara buluu katika (6, 7); o1 ni prizma chungwa katika (6, 1); o2 ni tufe zambarau katika (8, 1); o3 ni mchemraba mwekundu katika (8, 3).
Mlz nini?

Answer options: o0; o1; o2; o3.
Lexicon: ltt tsédídéehgo dootłʼizh say; tkl chʼil łitsxooí say; mlz dootłʼizh say.
Scene: o0 (6, 7) disc dootłʼizh átʼé; o1 (6, 1) prism chʼil łitsxooí átʼé; o2 (8, 1) sphere tsédídéehgo dootłʼizh átʼé; o3 (8, 3) cube łichííʼ átʼé.
Mlz haʼátʼíísh?

Answer options: o0; o1; o2; o3.
Lexicon: ltt purple say; tkl appelsiina say; mlz tungujortoq say.
Scene: o0 (6, 7) disc tungujortoq a; o1 (6, 1) prism appelsiina a; o2 (8, 1) sphere purple a; o3 (8, 3) cube aappalajaarpoq a.
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say hap ret; tkl say orange; mlz say blu.
Scene: o0 blu disc long (6, 7); o1 orange prism long (6, 1); o2 hap ret sphere long (8, 1); o3 ret cube long (8, 3).
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say chàkinkwèmikte; tkl say òlënchikte; mlz say blue.
Scene: o0 blue disc (6, 7); o1 òlënchikte prism (6, 1); o2 chàkinkwèmikte sphere (8, 1); o3 màxke cube (8, 3).
Mlz kwèch?

Answer options: o0; o1; o2; o3.
Lexicon: ltt ала purple; tkl ала orange; mlz ала blue.
Scene: o0 хила blue disc (6, 7); o1 хила orange prism (6, 1); o2 хила purple sphere (8, 1); o3 хила цӏе cube (8, 3).
Mlz фу?

대답 선택: o0; o1; o2; o3.
lexicon: ltt 보라색의 말하다; tkl 주황색의 말하다; mlz 푸르다 말하다.
장면: o0 (6, 7) 푸르다 디스크; o1 (6, 1) 주황색의 프리즘; o2 (8, 1) 보라색의 구체; o3 (8, 3) 빨갛다 정육면체.
mlz 무엇?

Erantzun aukerongatik: o0; o1; o2; o3.
Lexicon: ltt gorrindol esan; tkl laranja esan; mlz urdin esan.
Scene: o0 (6, 7) disc urdin bat dago; o1 (6, 1) prisma laranja bat dago; o2 (8, 1) esfera gorrindol bat dago; o3 (8, 3) kubo gorri bat dago.
Mlz zer?

Answer options: o0; o1; o2; o3.
Lexicon: ltt ᏂᎦᏪᎠ ᏕᎷᎨ; tkl ᏂᎦᏪᎠ ᎣᏂᏥ; mlz ᏂᎦᏪᎠ ᏌᎪᏂᎨᎢ.
Scene: o0 ᏌᎪᏂᎨᎢ disc (6, 7); o1 ᎣᏂᏥ prism (6, 1); o2 ᏕᎷᎨ sphere (8, 1); o3 ᎩᎦᎨ cube (8, 3).
What mlz?

Answer options: o0; o1; o2; o3.
Lexicon: ltt ñiy kulli; tkl ñiy killmu; mlz ñiy anqas.
Scene: o0 tiyay anqas disc (6, 7); o1 tiyay killmu prism (6, 1); o2 tiyay kulli sphere (8, 1); o3 tiyay puka cube (8, 3).
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt purple say; tkl orange say; mlz blue say.
Scene: o0 (6, 7) disc blue; o1 (6, 1) prism orange; o2 (8, 1) sphere purple; o3 (8, 3) cube плъыжьы.
Mlz сыд?

Answer options: o0; o1; o2; o3.
Lexicon: ltt hais purple; tkl hais orange; mlz hais xiav.
Scene: o0 xiav disc (6, 7); o1 orange prism (6, 1); o2 purple sphere (8, 1); o3 liab cube (8, 3).
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say orange; mlz say blue.
Scene: o0 blue disc jeyou (6, 7); o1 orange prism jeyou (6, 1); o2 purple sphere jeyou (8, 1); o3 red cube jeyou (8, 3).
Mlz ining-jak?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say orange; mlz say blue.
Scene: o0 blue disc (6, 7); o1 orange prism (6, 1); o2 purple sphere (8, 1); o3 homa cube (8, 3).
Mlz nanta?

Answer options: o0; o1; o2; o3.
Lexicon: ltt purple イェ; tkl orange イェ; mlz blue イェ.
Scene: o0 (6, 7) blue disc; o1 (6, 1) orange prism; o2 (8, 1) purple sphere; o3 (8, 3) フレ cube.
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say orange; mlz say ныԓиԓиԓӄин.
Scene: o0 ныԓиԓиԓӄин disc (6, 7); o1 orange prism (6, 1); o2 purple sphere (8, 1); o3 чеԓгыԓьын cube (8, 3).
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say china; mlz say blue.
Scene: o0 yan blue disc (6, 7); o1 yan china prism (6, 1); o2 yan purple sphere (8, 1); o3 yan chak cube (8, 3).
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say orange; mlz say blue.
Scene: o0 blue disc (6, 7); o1 orange prism (6, 1); o2 purple sphere (8, 1); o3 red cube (8, 3).
Mlz híli?

Answer options: o0; o1; o2; o3.
Lexicon: ltt šátȟo say; tkl orange say; mlz blue say.
Scene: o0 (6, 7) disc blue; o1 (6, 1) prism orange; o2 (8, 1) sphere šátȟo; o3 (8, 3) cube red.
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say narã; mlz say blue.
Scene: o0 disc blue (6, 7); o1 prism narã (6, 1); o2 sphere purple (8, 1); o3 cube pytã (8, 3).
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt purple say; tkl orange say; mlz larama say.
Scene: o0 (6, 7) maya larama disc; o1 (6, 1) maya orange prism; o2 (8, 1) maya purple sphere; o3 (8, 3) maya chupika cube.
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say orange; mlz say blue.
Scene: o0 ǀîi disc blue (6, 7); o1 ǀîi prism orange (6, 1); o2 ǀîi sphere purple (8, 1); o3 ǀîi cube red (8, 3).
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt purple say; tkl orange say; mlz blue say.
Scene: o0 (6, 7) blue disc; o1 (6, 1) orange prism; o2 (8, 1) purple sphere; o3 (8, 3) red cube.
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say orange; mlz say blue.
Scene: o0 blue disc (6, 7); o1 orange prism (6, 1); o2 purple sphere (8, 1); o3 red cube (8, 3).
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt purple say; tkl orange say; mlz blue say.
Scene: o0 (6, 7) blue disc; o1 (6, 1) orange prism; o2 (8, 1) purple sphere; o3 (8, 3) red cube.
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say orange; mlz say blue.
Scene: o0 disc blue (6, 7); o1 prism orange (6, 1); o2 sphere purple (8, 1); o3 cube red (8, 3).
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say orange; mlz say blue.
Scene: o0 nemi blue disc (6, 7); o1 nemi orange prism (6, 1); o2 nemi purple sphere (8, 1); o3 nemi red cube (8, 3).
Mlz tay?

Réponse choix : o0 ; o1 ; o2 ; o3.
On vous indique : ltt dire violet ; tkl dire orange ; mlz dire bleu.
Dans la scène : o0 est un disque bleu à (6, 7) ; o1 est un prisme orange à (6, 1) ; o2 est une sphère violette à (8, 1) ; o3 est un cube rouge à (8, 3).
Quoi mlz ?

Respondo alternativo: o0; o1; o2; o3.
Lexicon: ltt diri purpura; tkl diri oranĝa; mlz diri blua.
Sceno: o0 egali blua disko ĉe (6, 7); o1 egali oranĝa prismo ĉe (6, 1); o2 egali purpura sfero ĉe (8, 1); o3 egali ruĝa kubo ĉe (8, 3).
Mlz kio?

Válasz lehetőségek: o0; o1; o2; o3.
Szókincs: ltt mond bíbort; tkl mond narancssárgát; mlz mond kéket.
Szín: o0 kék lemez (6, 7); o1 narancssárga hasáb (6, 1); o2 bíbor gömb (8, 1); o3 piros kocka (8, 3).
Mlz melyik?

回答選擇:o0; o1; o2; o3.
lexicon:ltt講紫色; tkl講橙色; mlz講藍色嘅.
scene:o0是一藍色嘅disc喺(6, 7); o1是一橙色prism喺(6, 1); o2是一紫色sphere喺(8, 1); o3是一紅cube喺(8, 3).
mlz乜嘢?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say orange; mlz say blue.
Scene: o0 有ん blue disc (6, 7); o1 有ん orange prism (6, 1); o2 有ん purple sphere (8, 1); o3 有ん red cube (8, 3).
Mlz what?

Жауап опцион: o0; o1; o2; o3.
Lexicon: ltt айту күлгін; tkl айту апельсин; mlz айту көк.
Scene: o0 көк диск (6, 7); o1 апельсин призма (6, 1); o2 күлгін сфера (8, 1); o3 қызыл куб (8, 3).
Mlz не?

תְּשׁוּבָה אפשרויות: o0; o1; o2; o3.
lexicon: ltt say סָגֹל; tkl say כתום; mlz say כָּחוֹל.
סְצֵנָה: o0 הוּא דִּיסְק כָּחוֹל אֶחָד אֵצֶל (6, 7); o1 הוּא מִנְסָרָה כתום אַחַת אֵצֶל (6, 1); o2 הוּא כַּדּוּר סָגֹל אֶחָד אֵצֶל (8, 1); o3 הוּא קובייה אָדוֹם אֶחָד אֵצֶל (8, 3).
איזה mlz?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say orange; mlz say blue.
Scene: o0 blue disc (6, 7); o1 orange prism (6, 1); o2 purple sphere (8, 1); o3 red cube (8, 3).
Mlz what?

Jawaban pilihan-pilihan: o0; o1; o2; o3.
Lexicon: ltt berkata ungu; tkl berkata jingga; mlz berkata biru.
Tempat kejadian: o0 adalah cakram biru (6, 7); o1 adalah prisma jingga (6, 1); o2 adalah bola ungu (8, 1); o3 adalah kubus merah (8, 3).
Mlz apa?

ពាក្យឆ្លើយជំរើស:o0; o1; o2; o3.
lexicon:lttថាពណ៌ស្វាយ; tklថាពណ៌លឿង; mlzថាខៀវ.
scene:o0ត្រូវបានដួងខៀវ(6, 7); o1ត្រូវបានព្រីសពណ៌លឿង(6, 1); o2ត្រូវបានគោលពណ៌ស្វាយ(8, 1); o3ត្រូវបានគូបក្រហម(8, 3).
mlzអី?

ຄຳຕອບທາງເລືອກ:o0; o1; o2; o3.
lexicon:lttເວົ້າpurple; tklເວົ້າສົ້ມ; mlzເວົ້າຟ້າ.
scene:o0ຢູ່ຈັກຟ້າທີ່(6, 7); o1ຢູ່prismສົ້ມທີ່(6, 1); o2ຢູ່ຄະດີpurpleທີ່(8, 1); o3ຢູ່ລູກບາດແດງທີ່(8, 3).
mlzຫຍັງ?

answer options: o0; o1; o2; o3.
lexicon: ltt ఊదా చెప్పు; tkl నారింజచెట్టు చెప్పు; mlz నీలము చెప్పు.
దృశ్యం: o0 (6, 7) వద్ద నీలము disc ఉండు; o1 (6, 1) వద్ద నారింజచెట్టు పట్టకం ఉండు; o2 (8, 1) వద్ద ఊదా గోళము ఉండు; o3 (8, 3) వద్ద ఎర్ర cube ఉండు.
mlz ఏమిటి?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say bí ọsán; mlz say dúdú.
Scene: o0 wà disc dúdú (6, 7); o1 wà prism bí ọsán (6, 1); o2 wà sphere purple (8, 1); o3 wà cube pupa (8, 3).
What mlz?

Answer options: o0; o1; o2; o3.
Lexicon: ltt purple say; tkl orange say; mlz blue say.
Scene: o0 (6, 7) blue disc naiágúóli; o1 (6, 1) orange prism naiágúóli; o2 (8, 1) purple sphere naiágúóli; o3 (8, 3) łichíí cube naiágúóli.
Mlz what?

answer options: o0; o1; o2; o3.
lexicon: ltt say purple; tkl say orange; mlz say blue.
scene: o0 blue disc (6, 7); o1 orange prism (6, 1); o2 purple sphere (8, 1); o3 red cube (8, 3).
mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say alanya; mlz say blaw.
Scene: o0 blaw disc (6, 7); o1 alanya prism (6, 1); o2 purple sphere (8, 1); o3 red cube (8, 3).
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt say purple; tkl say orange; mlz say blue.
Scene: o0 blue disc (6, 7); o1 orange prism (6, 1); o2 purple sphere (8, 1); o3 red cube (8, 3).
Mlz what?

Answer options: o0; o1; o2; o3.
Lexicon: ltt purple say; tkl orange say; mlz blue say.
Scene: o0 (6, 7) blue disc; o1 (6, 1) orange prism; o2 (8, 1) purple sphere; o3 (8, 3) red cube.
Mlz вуч?

The legal answers are: yes; no.
You are shown these examples: bbabb → no; bab → no; abba → no; bab → no.
Is string abaa accepted?

Las respuestas válidas son: sí; no.
Se muestran estos ejemplos: bbabb → no; bab → no; abba → no; bab → no.
¿String: abaa es aceptado?

备选答案如下：是；否。
示例如下：bbabb → 否；bab → 否；abba → 否；bab → 否。
string：abaa是已接受吗？

Answer options: evet; hayır.
Size şu örnekler gösteriliyor: bbabb → hayır; bab → hayır; abba → hayır; bab → hayır.
String: abaa kabul etmek mi?

Answer options: ndiyo; hapana.
Unaonyeshwa mifano hii: bbabb → hapana; bab → hapana; abba → hapana; bab → hapana.
String: abaa ni kukubali je?

The legal answers are: yes; no.
You are shown these examples: bbabb → no; bab → no; abba → no; bab → no.
Is string abaa accepted?

{answer_options: [yes no], examples: [(ex bbabb no) (ex bab no) (ex abba no) (ex bab no)], query: (accept abaa)}

Antwort Alternativen: ja; nein.
Sie sehen diese Beispiele: bbabb → nein; bab → nein; abba → nein; bab → nein.
String abaa ist accepted?

О̏дгово̄р ѝзбор: да; no.
При́мер: bbabb → no; bab → no; abba → no; bab → no.
String abaa би̏ти примати?

Vastaus vaihtoehdot: kyllä; ei.
Esimerkit: bbabb → ei; bab → ei; abba → ei; bab → ei.
String abaa on hyväksytty?

备选答案如下：是；否。
示例如下：bbabb → 否；bab → 否；abba → 否；bab → 否。
string：abaa是已接受吗？

答え選択:はい; いいえ.
例:bbabb → いいえ; bab → いいえ; abba → いいえ; bab → いいえ.
string:abaa受理するです?

Answer options: evet; hayır.
Size şu örnekler gösteriliyor: bbabb → hayır; bab → hayır; abba → hayır; bab → hayır.
String: abaa kabul etmek mi?

answer options: نَعَم؛ no.
مِثَال: bbabb → no؛ bab → no؛ abba → no؛ bab → no.
string abaa قَبِلَ؟

Პასუხი ვარიანტი: დიახ; no.
Მაგალითი: bbabb → no; bab → no; abba → no; bab → no.
String abaa მიღება ყოფნა?

Whakautu kōwhiringa: āe; kāo.
Examples: bbabb → kāo; bab → kāo; abba → kāo; bab → kāo.
String abaa tautoko?

Trả lời lựa chọn: vâng; no.
Ví dụ: bbabb → no; bab → no; abba → no; bab → no.
String abaa là chấp nhận?

คำตอบตัวเลือก:ใช่; ไฮ้.
ตัวอย่าง:bbabb → ไฮ้; bab → ไฮ้; abba → ไฮ้; bab → ไฮ้.
string:abaaถูกรับ?

answer options: ஆம்; no.
எடுத்துக்காட்டு: bbabb → no; bab → no; abba → no; bab → no.
string abaa accepted?

Answer options: ndiyo; hapana.
Unaonyeshwa mifano hii: bbabb → hapana; bab → hapana; abba → hapana; bab → hapana.
String: abaa ni kukubali je?

Answer options: aooʼ; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted átʼé?

Answer options: aap; no.
Assersuut: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted a?

Answer options: ya; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa хила accepted?

대답 선택: 네; 아니요.
보기: bbabb → 아니요; bab → 아니요; abba → 아니요; bab → 아니요.
string abaa 받아들이다?

Erantzun aukerongatik: bai; no.
Adibideongatik: bbabb → no; bab → no; abba → no; bab → no.
String abaa onartu dago?

Answer options: ᎥᎥ; ᏝᏃ.
Examples: bbabb → ᏝᏃ; bab → ᏝᏃ; abba → ᏝᏃ; bab → ᏝᏃ.
String abaa accepted?

Answer options: arí; mánan.
Examples: bbabb → mánan; bab → mánan; abba → mánan; bab → mánan.
String abaa tiyay añikuy?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: ngai; woi.
Examples: bbabb → woi; bab → woi; abba → woi; bab → woi.
String abaa accepted?

Answer options: i̠i; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: yes; ソモ.
Examples: bbabb → ソモ; bab → ソモ; abba → ソモ; bab → ソモ.
String abaa accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa yan accepted?

Answer options: hą; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: heẽ; nahániri.
Examples: bbabb → nahániri; bab → nahániri; abba → nahániri; bab → nahániri.
String abaa accepted?

Answer options: jisa; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: ʻée; ʻĩĩ.
Examples: bbabb → ʻĩĩ; bab → ʻĩĩ; abba → ʻĩĩ; bab → ʻĩĩ.
String abaa ǀîi accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: ee; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: yes; inte.
Examples: bbabb → inte; bab → inte; abba → inte; bab → inte.
String abaa nemi accepted?

Réponse choix : oui ; no.
Voici les exemples : bbabb → no ; bab → no ; abba → no ; bab → no.
String abaa est accepterais ?

Respondo alternativo: jes; no.
Ekzemplo: bbabb → no; bab → no; abba → no; bab → no.
String abaa egali akceptata?

Válasz lehetőségek: igen; no.
Példák: bbabb → no; bab → no; abba → no; bab → no.
String abaa beleegyezik?

回答選擇:係; no.
例子:bbabb → no; bab → no; abba → no; bab → no.
string:abaa是accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa 有ん accepted?

Жауап опцион: иә; жоқ.
Мысал: bbabb → жоқ; bab → жоқ; abba → жоқ; bab → жоқ.
String abaa accepted?

תְּשׁוּבָה אפשרויות: כֵּן; no.
דּוּגְמָה: bbabb → no; bab → no; abba → no; bab → no.
string abaa הוּא קִבֵּל?

Answer options: იახ; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Jawaban pilihan-pilihan: ya; no.
Misal: bbabb → no; bab → no; abba → no; bab → no.
String abaa adalah menerima?

ពាក្យឆ្លើយជំរើស:ច៎ា; ទេ.
ឧទាហរណ៍:bbabb → ទេ; bab → ទេ; abba → ទេ; bab → ទេ.
string:abaaត្រូវបានទទួល?

ຄຳຕອບທາງເລືອກ:ແມ່ນ; no.
ຕົວຢ່າງ:bbabb → no; bab → no; abba → no; bab → no.
string:abaaຢູ່ຕົກລົງ?

answer options: అవును; no.
ఉదాహరణము: bbabb → no; bab → no; abba → no; bab → no.
string abaa అంగీకరించు ఉండు?

Answer options: bẹ́ẹ̀ ni; rárá.
Examples: bbabb → rárá; bab → rárá; abba → rárá; bab → rárá.
String abaa wà accepted?

Answer options: au; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted naiágúóli?

answer options: yes; ᐋᒃᑲ.
examples: bbabb → ᐋᒃᑲ; bab → ᐋᒃᑲ; abba → ᐋᒃᑲ; bab → ᐋᒃᑲ.
string abaa accepted?

Answer options: yes; no.
Eksempre: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

Answer options: yes; no.
Examples: bbabb → no; bab → no; abba → no; bab → no.
String abaa accepted?

The legal answers are: p0; p1; p2; p3.
The candidates are:
  - step p0: 0 and reverse 0
  - step p0: 1 and times 4
  - step p0: 2 and remove 1
  - step p1: 0 and reverse 0
  - step p1: 1 and times 3
  - step p1: 2 and remove 1
  - step p2: 0 and reverse 0
  - step p2: 1 and times 3
  - step p2: 2 and reverse 0
  - step p3: 0 and reverse 0
  - step p3: 1 and times 3
  - step p3: 2 and remove 3
You are shown these examples:
  - input: 0, 0 and 4
  - input: 0, 1 and 8
  - input: 0, 2 and 5
  - input: 0, 3 and 0
  - input: 0, 4 and 2
  - output: 0, 0 and 0
  - output: 0, 1 and 15
  - output: 0, 2 and 24
  - output: 0, 3 and 12
  - input: 1, 0 and 9
  - input: 1, 1 and 8
  - input: 1, 2 and 9
  - input: 1, 3 and 5
  - input: 1, 4 and 3
  - output: 1, 0 and 15
  - output: 1, 1 and 27
  - output: 1, 2 and 24
  - output: 1, 3 and 27
  - input: 2, 0 and 3
  - input: 2, 1 and 8
  - input: 2, 2 and 9
  - input: 2, 3 and 3
  - input: 2, 4 and 0
  - output: 2, 0 and 9
  - output: 2, 1 and 27
  - output: 2, 2 and 24
  - output: 2, 3 and 9
Which is the program fits every example?

Las respuestas válidas son: p0; p1; p2; p3.
Los candidatos son:
  - paso p0: 0 e invertir: 0
  - paso p0: 1 y multiplicar: 4
  - paso p0: 2 y quitar: 1
  - paso p1: 0 e invertir: 0
  - paso p1: 1 y multiplicar: 3
  - paso p1: 2 y quitar: 1
  - paso p2: 0 e invertir: 0
  - paso p2: 1 y multiplicar: 3
  - paso p2: 2 e invertir: 0
  - paso p3: 0 e invertir: 0
  - paso p3: 1 y multiplicar: 3
  - paso p3: 2 y quitar: 3
Se muestran estos ejemplos:
  - la entrada: 0, 0 y 4
  - la entrada: 0, 1 y 8
  - la entrada: 0, 2 y 5
  - la entrada: 0, 3 y 0
  - la entrada: 0, 4 y 2
  - la salida: 0, 0 y 0
  - la salida: 0, 1 y 15
  - la salida: 0, 2 y 24
  - la salida: 0, 3 y 12
  - la entrada: 1, 0 y 9
  - la entrada: 1, 1 y 8
  - la entrada: 1, 2 y 9
  - la entrada: 1, 3 y 5
  - la entrada: 1, 4 y 3
  - la salida: 1, 0 y 15
  - la salida: 1, 1 y 27
  - la salida: 1, 2 y 24
  - la salida: 1, 3 y 27
  - la entrada: 2, 0 y 3
  - la entrada: 2, 1 y 8
  - la entrada: 2, 2 y 9
  - la entrada: 2, 3 y 3
  - la entrada: 2, 4 y 0
  - la salida: 2, 0 y 9
  - la salida: 2, 1 y 27
  - la salida: 2, 2 y 24
  - la salida: 2, 3 y 9
¿Cuál program encaja con every el ejemplo?

备选答案如下：p0；p1；p2；p3。
候选项如下：
  - 第p0：0和反转：0
  - 第p0：1和乘：4
  - 第p0：2和移除：1
  - 第p1：0和反转：0
  - 第p1：1和乘：3
  - 第p1：2和移除：1
  - 第p2：0和反转：0
  - 第p2：1和乘：3
  - 第p2：2和反转：0
  - 第p3：0和反转：0
  - 第p3：1和乘：3
  - 第p3：2和移除：3
示例如下：
  - 的输入是：0、0和4
  - 的输入是：0、1和8
  - 的输入是：0、2和5
  - 的输入是：0、3和0
  - 的输入是：0、4和2
  - 的输出是：0、0和0
  - 的输出是：0、1和15
  - 的输出是：0、2和24
  - 的输出是：0、3和12
  - 的输入是：1、0和9
  - 的输入是：1、1和8
  - 的输入是：1、2和9
  - 的输入是：1、3和5
  - 的输入是：1、4和3
  - 的输出是：1、0和15
  - 的输出是：1、1和27
  - 的输出是：1、2和24
  - 的输出是：1、3和27
  - 的输入是：2、0和3
  - 的输入是：2、1和8
  - 的输入是：2、2和9
  - 的输入是：2、3和3
  - 的输入是：2、4和0
  - 的输出是：2、0和9
  - 的输出是：2、1和27
  - 的输出是：2、2和24
  - 的输出是：2、3和9
program符合every的示例是哪个？

Answer options: p0; p1; p2; p3.
Adaylar:
  - adım p0: 0 ve aksi: 0
  - adım p0: 1 ve çarpı: 4
  - adım p0: 2 ve kaldırmak: 1
  - adım p1: 0 ve aksi: 0
  - adım p1: 1 ve çarpı: 3
  - adım p1: 2 ve kaldırmak: 1
  - adım p2: 0 ve aksi: 0
  - adım p2: 1 ve çarpı: 3
  - adım p2: 2 ve aksi: 0
  - adım p3: 0 ve aksi: 0
  - adım p3: 1 ve çarpı: 3
  - adım p3: 2 ve kaldırmak: 3
Size şu örnekler gösteriliyor:
  - input: 0, 0 ve 4
  - input: 0, 1 ve 8
  - input: 0, 2 ve 5
  - input: 0, 3 ve 0
  - input: 0, 4 ve 2
  - output: 0, 0 ve 0
  - output: 0, 1 ve 15
  - output: 0, 2 ve 24
  - output: 0, 3 ve 12
  - input: 1, 0 ve 9
  - input: 1, 1 ve 8
  - input: 1, 2 ve 9
  - input: 1, 3 ve 5
  - input: 1, 4 ve 3
  - output: 1, 0 ve 15
  - output: 1, 1 ve 27
  - output: 1, 2 ve 24
  - output: 1, 3 ve 27
  - input: 2, 0 ve 3
  - input: 2, 1 ve 8
  - input: 2, 2 ve 9
  - input: 2, 3 ve 3
  - input: 2, 4 ve 0
  - output: 2, 0 ve 9
  - output: 2, 1 ve 27
  - output: 2, 2 ve 24
  - output: 2, 3 ve 9
Program fits every örnek hangi?

Answer options: p0; p1; p2; p3.
Wagombea ni:
  - hatua p0: 0 na reverse: 0
  - hatua p0: 1 na times: 4
  - hatua p0: 2 na ondoa: 1
  - hatua p1: 0 na reverse: 0
  - hatua p1: 1 na times: 3
  - hatua p1: 2 na ondoa: 1
  - hatua p2: 0 na reverse: 0
  - hatua p2: 1 na times: 3
  - hatua p2: 2 na reverse: 0
  - hatua p3: 0 na reverse: 0
  - hatua p3: 1 na times: 3
  - hatua p3: 2 na ondoa: 3
Unaonyeshwa mifano hii:
  - input: 0, 0 na 4
  - input: 0, 1 na 8
  - input: 0, 2 na 5
  - input: 0, 3 na 0
  - input: 0, 4 na 2
  - output: 0, 0 na 0
  - output: 0, 1 na 15
  - output: 0, 2 na 24
  - output: 0, 3 na 12
  - input: 1, 0 na 9
  - input: 1, 1 na 8
  - input: 1, 2 na 9
  - input: 1, 3 na 5
  - input: 1, 4 na 3
  - output: 1, 0 na 15
  - output: 1, 1 na 27
  - output: 1, 2 na 24
  - output: 1, 3 na 27
  - input: 2, 0 na 3
  - input: 2, 1 na 8
  - input: 2, 2 na 9
  - input: 2, 3 na 3
  - input: 2, 4 na 0
  - output: 2, 0 na 9
  - output: 2, 1 na 27
  - output: 2, 2 na 24
  - output: 2, 3 na 9
Program fits every mifano gani?

The legal answers are: p0; p1; p2; p3.
The candidates are:
  - step p0: 0 and reverse 0
  - step p0: 1 and times 4
  - step p0: 2 and remove 1
  - step p1: 0 and reverse 0
  - step p1: 1 and times 3
  - step p1: 2 and remove 1
  - step p2: 0 and reverse 0
  - step p2: 1 and times 3
  - step p2: 2 and reverse 0
  - step p3: 0 and reverse 0
  - step p3: 1 and times 3
  - step p3: 2 and remove 3
You are shown these examples:
  - input: 0, 0 and 4
  - input: 0, 1 and 8
  - input: 0, 2 and 5
  - input: 0, 3 and 0
  - input: 0, 4 and 2
  - output: 0, 0 and 0
  - output: 0, 1 and 15
  - output: 0, 2 and 24
  - output: 0, 3 and 12
  - input: 1, 0 and 9
  - input: 1, 1 and 8
  - input: 1, 2 and 9
  - input: 1, 3 and 5
  - input: 1, 4 and 3
  - output: 1, 0 and 15
  - output: 1, 1 and 27
  - output: 1, 2 and 24
  - output: 1, 3 and 27
  - input: 2, 0 and 3
  - input: 2, 1 and 8
  - input: 2, 2 and 9
  - input: 2, 3 and 3
  - input: 2, 4 and 0
  - output: 2, 0 and 9
  - output: 2, 1 and 27
  - output: 2, 2 and 24
  - output: 2, 3 and 9
Which is the program fits every example?

{answer_options: [p0 p1 p2 p3], candidates: [(step p0 0 (reverse 0)) (step p0 1 (mul 4)) (step p0 2 (drop_first 1)) (step p1 0 (reverse 0)) (step p1 1 (mul 3)) (step p1 2 (drop_first 1)) (step p2 0 (reverse 0)) (step p2 1 (mul 3)) (step p2 2 (reverse 0)) (step p3 0 (reverse 0)) (step p3 1 (mul 3)) (step p3 2 (drop_first 3))], examples: [(input 0 0 4) (input 0 1 8) (input 0 2 5) (input 0 3 0) (input 0 4 2) (output 0 0 0) (output 0 1 15) (output 0 2 24) (output 0 3 12) (input 1 0 9) (input 1 1 8) (input 1 2 9) (input 1 3 5) (input 1 4 3) (output 1 0 15) (output 1 1 27) (output 1 2 24) (output 1 3 27) (input 2 0 3) (input 2 1 8) (input 2 2 9) (input 2 3 3) (input 2 4 0) (output 2 0 9) (output 2 1 27) (output 2 2 24) (output 2 3 9)], query: which_program_fits_every_example}

Antwort Alternativen: p0; p1; p2; p3.
Die Kandidaten sind:
  - Schritt p0: 0 und umgekehrt 0
  - Schritt p0: 1 und mal 4
  - Schritt p0: 2 und entfernen 1
  - Schritt p1: 0 und umgekehrt 0
  - Schritt p1: 1 und mal 3
  - Schritt p1: 2 und entfernen 1
  - Schritt p2: 0 und umgekehrt 0
  - Schritt p2: 1 und mal 3
  - Schritt p2: 2 und umgekehrt 0
  - Schritt p3: 0 und umgekehrt 0
  - Schritt p3: 1 und mal 3
  - Schritt p3: 2 und entfernen 3
Sie sehen diese Beispiele:
  - Eingabe: 0, 0 und 4
  - Eingabe: 0, 1 und 8
  - Eingabe: 0, 2 und 5
  - Eingabe: 0, 3 und 0
  - Eingabe: 0, 4 und 2
  - Output: 0, 0 und 0
  - Output: 0, 1 und 15
  - Output: 0, 2 und 24
  - Output: 0, 3 und 12
  - Eingabe: 1, 0 und 9
  - Eingabe: 1, 1 und 8
  - Eingabe: 1, 2 und 9
  - Eingabe: 1, 3 und 5
  - Eingabe: 1, 4 und 3
  - Output: 1, 0 und 15
  - Output: 1, 1 und 27
  - Output: 1, 2 und 24
  - Output: 1, 3 und 27
  - Eingabe: 2, 0 und 3
  - Eingabe: 2, 1 und 8
  - Eingabe: 2, 2 und 9
  - Eingabe: 2, 3 und 3
  - Eingabe: 2, 4 und 0
  - Output: 2, 0 und 9
  - Output: 2, 1 und 27
  - Output: 2, 2 und 24
  - Output: 2, 3 und 9
Welcher Programm fits jeder Beispiel?

О̏дгово̄р ѝзбор: p0; p1; p2; p3.
Кандѝда̄т:
  - ко̏ра̄к p0: 0 и reverse 0
  - ко̏ра̄к p0: 1 и times 4
  - ко̏ра̄к p0: 2 и remove 1
  - ко̏ра̄к p1: 0 и reverse 0
  - ко̏ра̄к p1: 1 и times 3
  - ко̏ра̄к p1: 2 и remove 1
  - ко̏ра̄к p2: 0 и reverse 0
  - ко̏ра̄к p2: 1 и times 3
  - ко̏ра̄к p2: 2 и reverse 0
  - ко̏ра̄к p3: 0 и reverse 0
  - ко̏ра̄к p3: 1 и times 3
  - ко̏ра̄к p3: 2 и remove 3
При́мер:
  - unos: 0, 0 и 4
  - unos: 0, 1 и 8
  - unos: 0, 2 и 5
  - unos: 0, 3 и 0
  - unos: 0, 4 и 2
  - проѝзвод: 0, 0 и 0
  - проѝзвод: 0, 1 и 15
  - проѝзвод: 0, 2 и 24
  - проѝзвод: 0, 3 и 12
  - unos: 1, 0 и 9
  - unos: 1, 1 и 8
  - unos: 1, 2 и 9
  - unos: 1, 3 и 5
  - unos: 1, 4 и 3
  - проѝзвод: 1, 0 и 15
  - проѝзвод: 1, 1 и 27
  - проѝзвод: 1, 2 и 24
  - проѝзвод: 1, 3 и 27
  - unos: 2, 0 и 3
  - unos: 2, 1 и 8
  - unos: 2, 2 и 9
  - unos: 2, 3 и 3
  - unos: 2, 4 и 0
  - проѝзвод: 2, 0 и 9
  - проѝзвод: 2, 1 и 27
  - проѝзвод: 2, 2 и 24
  - проѝзвод: 2, 3 и 9
Про̀грам fits сва̏кӣ при́мер ко̀јӣ?

Vastaus vaihtoehdot: p0; p1; p2; p3.
Ehdokkaat:
  - askel p0: 0 ja käänteinen 0
  - askel p0: 1 ja kertaa 4
  - askel p0: 2 ja remove 1
  - askel p1: 0 ja käänteinen 0
  - askel p1: 1 ja kertaa 3
  - askel p1: 2 ja remove 1
  - askel p2: 0 ja käänteinen 0
  - askel p2: 1 ja kertaa 3
  - askel p2: 2 ja käänteinen 0
  - askel p3: 0 ja käänteinen 0
  - askel p3: 1 ja kertaa 3
  - askel p3: 2 ja remove 3
Esimerkit:
  - syöte: 0, 0 ja 4
  - syöte: 0, 1 ja 8
  - syöte: 0, 2 ja 5
  - syöte: 0, 3 ja 0
  - syöte: 0, 4 ja 2
  - tuotanto: 0, 0 ja 0
  - tuotanto: 0, 1 ja 15
  - tuotanto: 0, 2 ja 24
  - tuotanto: 0, 3 ja 12
  - syöte: 1, 0 ja 9
  - syöte: 1, 1 ja 8
  - syöte: 1, 2 ja 9
  - syöte: 1, 3 ja 5
  - syöte: 1, 4 ja 3
  - tuotanto: 1, 0 ja 15
  - tuotanto: 1, 1 ja 27
  - tuotanto: 1, 2 ja 24
  - tuotanto: 1, 3 ja 27
  - syöte: 2, 0 ja 3
  - syöte: 2, 1 ja 8
  - syöte: 2, 2 ja 9
  - syöte: 2, 3 ja 3
  - syöte: 2, 4 ja 0
  - tuotanto: 2, 0 ja 9
  - tuotanto: 2, 1 ja 27
  - tuotanto: 2, 2 ja 24
  - tuotanto: 2, 3 ja 9
Mikä ohjelma fits jokainen esimerkki?

备选答案如下：p0；p1；p2；p3。
候选项如下：
  - 第p0：0和反转：0
  - 第p0：1和乘：4
  - 第p0：2和移除：1
  - 第p1：0和反转：0
  - 第p1：1和乘：3
  - 第p1：2和移除：1
  - 第p2：0和反转：0
  - 第p2：1和乘：3
  - 第p2：2和反转：0
  - 第p3：0和反转：0
  - 第p3：1和乘：3
  - 第p3：2和移除：3
示例如下：
  - 的输入是：0、0和4
  - 的输入是：0、1和8
  - 的输入是：0、2和5
  - 的输入是：0、3和0
  - 的输入是：0、4和2
  - 的输出是：0、0和0
  - 的输出是：0、1和15
  - 的输出是：0、2和24
  - 的输出是：0、3和12
  - 的输入是：1、0和9
  - 的输入是：1、1和8
  - 的输入是：1、2和9
  - 的输入是：1、3和5
  - 的输入是：1、4和3
  - 的输出是：1、0和15
  - 的输出是：1、1和27
  - 的输出是：1、2和24
  - 的输出是：1、3和27
  - 的输入是：2、0和3
  - 的输入是：2、1和8
  - 的输入是：2、2和9
  - 的输入是：2、3和3
  - 的输入是：2、4和0
  - 的输出是：2、0和9
  - 的输出是：2、1和27
  - 的输出是：2、2和24
  - 的输出是：2、3和9
program符合every的示例是哪个？

答え選択:p0; p1; p2; p3.
候補者:
  - 足取りp0:0と逆の:0
  - 足取りp0:1と掛ける:4
  - 足取りp0:2とremove:1
  - 足取りp1:0と逆の:0
  - 足取りp1:1と掛ける:3
  - 足取りp1:2とremove:1
  - 足取りp2:0と逆の:0
  - 足取りp2:1と掛ける:3
  - 足取りp2:2と逆の:0
  - 足取りp3:0と逆の:0
  - 足取りp3:1と掛ける:3
  - 足取りp3:2とremove:3
例:
  - 入力:0, 0と4
  - 入力:0, 1と8
  - 入力:0, 2と5
  - 入力:0, 3と0
  - 入力:0, 4と2
  - 出力:0, 0と0
  - 出力:0, 1と15
  - 出力:0, 2と24
  - 出力:0, 3と12
  - 入力:1, 0と9
  - 入力:1, 1と8
  - 入力:1, 2と9
  - 入力:1, 3と5
  - 入力:1, 4と3
  - 出力:1, 0と15
  - 出力:1, 1と27
  - 出力:1, 2と24
  - 出力:1, 3と27
  - 入力:2, 0と3
  - 入力:2, 1と8
  - 入力:2, 2と9
  - 入力:2, 3と3
  - 入力:2, 4と0
  - 出力:2, 0と9
  - 出力:2, 1と27
  - 出力:2, 2と24
  - 出力:2, 3と9
番組fits凡ゆる例どの?

Answer options: p0; p1; p2; p3.
Adaylar:
  - adım p0: 0 ve aksi: 0
  - adım p0: 1 ve çarpı: 4
  - adım p0: 2 ve kaldırmak: 1
  - adım p1: 0 ve aksi: 0
  - adım p1: 1 ve çarpı: 3
  - adım p1: 2 ve kaldırmak: 1
  - adım p2: 0 ve aksi: 0
  - adım p2: 1 ve çarpı: 3
  - adım p2: 2 ve aksi: 0
  - adım p3: 0 ve aksi: 0
  - adım p3: 1 ve çarpı: 3
  - adım p3: 2 ve kaldırmak: 3
Size şu örnekler gösteriliyor:
  - input: 0, 0 ve 4
  - input: 0, 1 ve 8
  - input: 0, 2 ve 5
  - input: 0, 3 ve 0
  - input: 0, 4 ve 2
  - output: 0, 0 ve 0
  - output: 0, 1 ve 15
  - output: 0, 2 ve 24
  - output: 0, 3 ve 12
  - input: 1, 0 ve 9
  - input: 1, 1 ve 8
  - input: 1, 2 ve 9
  - input: 1, 3 ve 5
  - input: 1, 4 ve 3
  - output: 1, 0 ve 15
  - output: 1, 1 ve 27
  - output: 1, 2 ve 24
  - output: 1, 3 ve 27
  - input: 2, 0 ve 3
  - input: 2, 1 ve 8
  - input: 2, 2 ve 9
  - input: 2, 3 ve 3
  - input: 2, 4 ve 0
  - output: 2, 0 ve 9
  - output: 2, 1 ve 27
  - output: 2, 2 ve 24
  - output: 2, 3 ve 9
Program fits every örnek hangi?

answer options: p0؛ p1؛ p2؛ p3.
مُرَشَّح:
  - خُطْوَة p0: 0 وَـ عَكَسَ 0
  - خُطْوَة p0: 1 وَـ فِي 4
  - خُطْوَة p0: 2 وَـ نَقَلَ 1
  - خُطْوَة p1: 0 وَـ عَكَسَ 0
  - خُطْوَة p1: 1 وَـ فِي 3
  - خُطْوَة p1: 2 وَـ نَقَلَ 1
  - خُطْوَة p2: 0 وَـ عَكَسَ 0
  - خُطْوَة p2: 1 وَـ فِي 3
  - خُطْوَة p2: 2 وَـ عَكَسَ 0
  - خُطْوَة p3: 0 وَـ عَكَسَ 0
  - خُطْوَة p3: 1 وَـ فِي 3
  - خُطْوَة p3: 2 وَـ نَقَلَ 3
مِثَال:
  - مُدْخَل: 0، 0 وَـ 4
  - مُدْخَل: 0، 1 وَـ 8
  - مُدْخَل: 0، 2 وَـ 5
  - مُدْخَل: 0، 3 وَـ 0
  - مُدْخَل: 0، 4 وَـ 2
  - مُخرَج: 0، 0 وَـ 0
  - مُخرَج: 0، 1 وَـ 15
  - مُخرَج: 0، 2 وَـ 24
  - مُخرَج: 0، 3 وَـ 12
  - مُدْخَل: 1، 0 وَـ 9
  - مُدْخَل: 1، 1 وَـ 8
  - مُدْخَل: 1، 2 وَـ 9
  - مُدْخَل: 1، 3 وَـ 5
  - مُدْخَل: 1، 4 وَـ 3
  - مُخرَج: 1، 0 وَـ 15
  - مُخرَج: 1، 1 وَـ 27
  - مُخرَج: 1، 2 وَـ 24
  - مُخرَج: 1، 3 وَـ 27
  - مُدْخَل: 2، 0 وَـ 3
  - مُدْخَل: 2، 1 وَـ 8
  - مُدْخَل: 2، 2 وَـ 9
  - مُدْخَل: 2، 3 وَـ 3
  - مُدْخَل: 2، 4 وَـ 0
  - مُخرَج: 2، 0 وَـ 9
  - مُخرَج: 2، 1 وَـ 27
  - مُخرَج: 2، 2 وَـ 24
  - مُخرَج: 2، 3 وَـ 9
بَرْنَامَج fits كُلّ مِثَال أَيّ؟

Პასუხი ვარიანტი: p0; p1; p2; p3.
Კანდიდატები:
  - ნაბიჯი p0: 0 და reverse 0
  - ნაბიჯი p0: 1 და times 4
  - ნაბიჯი p0: 2 და remove 1
  - ნაბიჯი p1: 0 და reverse 0
  - ნაბიჯი p1: 1 და times 3
  - ნაბიჯი p1: 2 და remove 1
  - ნაბიჯი p2: 0 და reverse 0
  - ნაბიჯი p2: 1 და times 3
  - ნაბიჯი p2: 2 და reverse 0
  - ნაბიჯი p3: 0 და reverse 0
  - ნაბიჯი p3: 1 და times 3
  - ნაბიჯი p3: 2 და remove 3
Მაგალითი:
  - input: 0, 0 და 4
  - input: 0, 1 და 8
  - input: 0, 2 და 5
  - input: 0, 3 და 0
  - input: 0, 4 და 2
  - output: 0, 0 და 0
  - output: 0, 1 და 15
  - output: 0, 2 და 24
  - output: 0, 3 და 12
  - input: 1, 0 და 9
  - input: 1, 1 და 8
  - input: 1, 2 და 9
  - input: 1, 3 და 5
  - input: 1, 4 და 3
  - output: 1, 0 და 15
  - output: 1, 1 და 27
  - output: 1, 2 და 24
  - output: 1, 3 და 27
  - input: 2, 0 და 3
  - input: 2, 1 და 8
  - input: 2, 2 და 9
  - input: 2, 3 და 3
  - input: 2, 4 და 0
  - output: 2, 0 და 9
  - output: 2, 1 და 27
  - output: 2, 2 და 24
  - output: 2, 3 და 9
Გადაცემა fits ყველა მაგალითი რომელი?

Whakautu kōwhiringa: p0; p1; p2; p3.
Kaiwhakauru:
  - kaupeka p0: 0 me reverse 0
  - kaupeka p0: 1 me times 4
  - kaupeka p0: 2 me karokaro 1
  - kaupeka p1: 0 me reverse 0
  - kaupeka p1: 1 me times 3
  - kaupeka p1: 2 me karokaro 1
  - kaupeka p2: 0 me reverse 0
  - kaupeka p2: 1 me times 3
  - kaupeka p2: 2 me reverse 0
  - kaupeka p3: 0 me reverse 0
  - kaupeka p3: 1 me times 3
  - kaupeka p3: 2 me karokaro 3
Examples:
  - kōkuhunga: 0, 0 me 4
  - kōkuhunga: 0, 1 me 8
  - kōkuhunga: 0, 2 me 5
  - kōkuhunga: 0, 3 me 0
  - kōkuhunga: 0, 4 me 2
  - huaputa: 0, 0 me 0
  - huaputa: 0, 1 me 15
  - huaputa: 0, 2 me 24
  - huaputa: 0, 3 me 12
  - kōkuhunga: 1, 0 me 9
  - kōkuhunga: 1, 1 me 8
  - kōkuhunga: 1, 2 me 9
  - kōkuhunga: 1, 3 me 5
  - kōkuhunga: 1, 4 me 3
  - huaputa: 1, 0 me 15
  - huaputa: 1, 1 me 27
  - huaputa: 1, 2 me 24
  - huaputa: 1, 3 me 27
  - kōkuhunga: 2, 0 me 3
  - kōkuhunga: 2, 1 me 8
  - kōkuhunga: 2, 2 me 9
  - kōkuhunga: 2, 3 me 3
  - kōkuhunga: 2, 4 me 0
  - huaputa: 2, 0 me 9
  - huaputa: 2, 1 me 27
  - huaputa: 2, 2 me 24
  - huaputa: 2, 3 me 9
Whakaaturanga fits every example tēhea?

Trả lời lựa chọn: p0; p1; p2; p3.
Candidates:
  - bước p0: 0 và ngược 0
  - bước p0: 1 và nhân 4
  - bước p0: 2 và chuyển đi 1
  - bước p1: 0 và ngược 0
  - bước p1: 1 và nhân 3
  - bước p1: 2 và chuyển đi 1
  - bước p2: 0 và ngược 0
  - bước p2: 1 và nhân 3
  - bước p2: 2 và ngược 0
  - bước p3: 0 và ngược 0
  - bước p3: 1 và nhân 3
  - bước p3: 2 và chuyển đi 3
Ví dụ:
  - input: 0, 0 và 4
  - input: 0, 1 và 8
  - input: 0, 2 và 5
  - input: 0, 3 và 0
  - input: 0, 4 và 2
  - đầu ra: 0, 0 và 0
  - đầu ra: 0, 1 và 15
  - đầu ra: 0, 2 và 24
  - đầu ra: 0, 3 và 12
  - input: 1, 0 và 9
  - input: 1, 1 và 8
  - input: 1, 2 và 9
  - input: 1, 3 và 5
  - input: 1, 4 và 3
  - đầu ra: 1, 0 và 15
  - đầu ra: 1, 1 và 27
  - đầu ra: 1, 2 và 24
  - đầu ra: 1, 3 và 27
  - input: 2, 0 và 3
  - input: 2, 1 và 8
  - input: 2, 2 và 9
  - input: 2, 3 và 3
  - input: 2, 4 và 0
  - đầu ra: 2, 0 và 9
  - đầu ra: 2, 1 và 27
  - đầu ra: 2, 2 và 24
  - đầu ra: 2, 3 và 9
Chương trình fits mỗi ví dụ nào?

คำตอบตัวเลือก:p0; p1; p2; p3.
ผู้สมัคร:
  - ก้าวp0:0และreverse:0
  - ก้าวp0:1และคูณ:4
  - ก้าวp0:2และremove:1
  - ก้าวp1:0และreverse:0
  - ก้าวp1:1และคูณ:3
  - ก้าวp1:2และremove:1
  - ก้าวp2:0และreverse:0
  - ก้าวp2:1และคูณ:3
  - ก้าวp2:2และreverse:0
  - ก้าวp3:0และreverse:0
  - ก้าวp3:1และคูณ:3
  - ก้าวp3:2และremove:3
ตัวอย่าง:
  - input:0, 0และ4
  - input:0, 1และ8
  - input:0, 2และ5
  - input:0, 3และ0
  - input:0, 4และ2
  - เอาท์พุต:0, 0และ0
  - เอาท์พุต:0, 1และ15
  - เอาท์พุต:0, 2และ24
  - เอาท์พุต:0, 3และ12
  - input:1, 0และ9
  - input:1, 1และ8
  - input:1, 2และ9
  - input:1, 3และ5
  - input:1, 4และ3
  - เอาท์พุต:1, 0และ15
  - เอาท์พุต:1, 1และ27
  - เอาท์พุต:1, 2และ24
  - เอาท์พุต:1, 3และ27
  - input:2, 0และ3
  - input:2, 1และ8
  - input:2, 2และ9
  - input:2, 3และ3
  - input:2, 4และ0
  - เอาท์พุต:2, 0และ9
  - เอาท์พุต:2, 1และ27
  - เอาท์พุต:2, 2และ24
  - เอาท์พุต:2, 3และ9
รายการfitsทุกตัวอย่างไหน?

answer options: p0; p1; p2; p3.
வேட்பாளர்:
  - step p0: 0 மற்றும் reverse 0
  - step p0: 1 மற்றும் times 4
  - step p0: 2 மற்றும் remove 1
  - step p1: 0 மற்றும் reverse 0
  - step p1: 1 மற்றும் times 3
  - step p1: 2 மற்றும் remove 1
  - step p2: 0 மற்றும் reverse 0
  - step p2: 1 மற்றும் times 3
  - step p2: 2 மற்றும் reverse 0
  - step p3: 0 மற்றும் reverse 0
  - step p3: 1 மற்றும் times 3
  - step p3: 2 மற்றும் remove 3
எடுத்துக்காட்டு:
  - input: 0, 0 மற்றும் 4
  - input: 0, 1 மற்றும் 8
  - input: 0, 2 மற்றும் 5
  - input: 0, 3 மற்றும் 0
  - input: 0, 4 மற்றும் 2
  - output: 0, 0 மற்றும் 0
  - output: 0, 1 மற்றும் 15
  - output: 0, 2 மற்றும் 24
  - output: 0, 3 மற்றும் 12
  - input: 1, 0 மற்றும் 9
  - input: 1, 1 மற்றும் 8
  - input: 1, 2 மற்றும் 9
  - input: 1, 3 மற்றும் 5
  - input: 1, 4 மற்றும் 3
  - output: 1, 0 மற்றும் 15
  - output: 1, 1 மற்றும் 27
  - output: 1, 2 மற்றும் 24
  - output: 1, 3 மற்றும் 27
  - input: 2, 0 மற்றும் 3
  - input: 2, 1 மற்றும் 8
  - input: 2, 2 மற்றும் 9
  - input: 2, 3 மற்றும் 3
  - input: 2, 4 மற்றும் 0
  - output: 2, 0 மற்றும் 9
  - output: 2, 1 மற்றும் 27
  - output: 2, 2 மற்றும் 24
  - output: 2, 3 மற்றும் 9
program fits ஒவ்வொரு எடுத்துக்காட்டு எந்த?

Answer options: p0; p1; p2; p3.
Wagombea ni:
  - hatua p0: 0 na reverse: 0
  - hatua p0: 1 na times: 4
  - hatua p0: 2 na ondoa: 1
  - hatua p1: 0 na reverse: 0
  - hatua p1: 1 na times: 3
  - hatua p1: 2 na ondoa: 1
  - hatua p2: 0 na reverse: 0
  - hatua p2: 1 na times: 3
  - hatua p2: 2 na reverse: 0
  - hatua p3: 0 na reverse: 0
  - hatua p3: 1 na times: 3
  - hatua p3: 2 na ondoa: 3
Unaonyeshwa mifano hii:
  - input: 0, 0 na 4
  - input: 0, 1 na 8
  - input: 0, 2 na 5
  - input: 0, 3 na 0
  - input: 0, 4 na 2
  - output: 0, 0 na 0
  - output: 0, 1 na 15
  - output: 0, 2 na 24
  - output: 0, 3 na 12
  - input: 1, 0 na 9
  - input: 1, 1 na 8
  - input: 1, 2 na 9
  - input: 1, 3 na 5
  - input: 1, 4 na 3
  - output: 1, 0 na 15
  - output: 1, 1 na 27
  - output: 1, 2 na 24
  - output: 1, 3 na 27
  - input: 2, 0 na 3
  - input: 2, 1 na 8
  - input: 2, 2 na 9
  - input: 2, 3 na 3
  - input: 2, 4 na 0
  - output: 2, 0 na 9
  - output: 2, 1 na 27
  - output: 2, 2 na 24
  - output: 2, 3 na 9
Program fits every mifano gani?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 dóó reverse 0
  - step p0: 1 dóó ahą́ą́h nániilyá 4
  - step p0: 2 dóó remove 1
  - step p1: 0 dóó reverse 0
  - step p1: 1 dóó ahą́ą́h nániilyá 3
  - step p1: 2 dóó remove 1
  - step p2: 0 dóó reverse 0
  - step p2: 1 dóó ahą́ą́h nániilyá 3
  - step p2: 2 dóó reverse 0
  - step p3: 0 dóó reverse 0
  - step p3: 1 dóó ahą́ą́h nániilyá 3
  - step p3: 2 dóó remove 3
Examples:
  - input: 0, 0 dóó 4
  - input: 0, 1 dóó 8
  - input: 0, 2 dóó 5
  - input: 0, 3 dóó 0
  - input: 0, 4 dóó 2
  - output: 0, 0 dóó 0
  - output: 0, 1 dóó 15
  - output: 0, 2 dóó 24
  - output: 0, 3 dóó 12
  - input: 1, 0 dóó 9
  - input: 1, 1 dóó 8
  - input: 1, 2 dóó 9
  - input: 1, 3 dóó 5
  - input: 1, 4 dóó 3
  - output: 1, 0 dóó 15
  - output: 1, 1 dóó 27
  - output: 1, 2 dóó 24
  - output: 1, 3 dóó 27
  - input: 2, 0 dóó 3
  - input: 2, 1 dóó 8
  - input: 2, 2 dóó 9
  - input: 2, 3 dóó 3
  - input: 2, 4 dóó 0
  - output: 2, 0 dóó 9
  - output: 2, 1 dóó 27
  - output: 2, 2 dóó 24
  - output: 2, 3 dóó 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 aamma reverse 0
  - step p0: 1 aamma times 4
  - step p0: 2 aamma remove 1
  - step p1: 0 aamma reverse 0
  - step p1: 1 aamma times 3
  - step p1: 2 aamma remove 1
  - step p2: 0 aamma reverse 0
  - step p2: 1 aamma times 3
  - step p2: 2 aamma reverse 0
  - step p3: 0 aamma reverse 0
  - step p3: 1 aamma times 3
  - step p3: 2 aamma remove 3
Assersuut:
  - input: 0, 0 aamma 4
  - input: 0, 1 aamma 8
  - input: 0, 2 aamma 5
  - input: 0, 3 aamma 0
  - input: 0, 4 aamma 2
  - output: 0, 0 aamma 0
  - output: 0, 1 aamma 15
  - output: 0, 2 aamma 24
  - output: 0, 3 aamma 12
  - input: 1, 0 aamma 9
  - input: 1, 1 aamma 8
  - input: 1, 2 aamma 9
  - input: 1, 3 aamma 5
  - input: 1, 4 aamma 3
  - output: 1, 0 aamma 15
  - output: 1, 1 aamma 27
  - output: 1, 2 aamma 24
  - output: 1, 3 aamma 27
  - input: 2, 0 aamma 3
  - input: 2, 1 aamma 8
  - input: 2, 2 aamma 9
  - input: 2, 3 aamma 3
  - input: 2, 4 aamma 0
  - output: 2, 0 aamma 9
  - output: 2, 1 aamma 27
  - output: 2, 2 aamma 24
  - output: 2, 3 aamma 9
Program fits every assersuut what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 na reverse 0
  - step p0: 1 na times 4
  - step p0: 2 na remove 1
  - step p1: 0 na reverse 0
  - step p1: 1 na times 3
  - step p1: 2 na remove 1
  - step p2: 0 na reverse 0
  - step p2: 1 na times 3
  - step p2: 2 na reverse 0
  - step p3: 0 na reverse 0
  - step p3: 1 na times 3
  - step p3: 2 na remove 3
Examples:
  - input: 0, 0 na 4
  - input: 0, 1 na 8
  - input: 0, 2 na 5
  - input: 0, 3 na 0
  - input: 0, 4 na 2
  - output: 0, 0 na 0
  - output: 0, 1 na 15
  - output: 0, 2 na 24
  - output: 0, 3 na 12
  - input: 1, 0 na 9
  - input: 1, 1 na 8
  - input: 1, 2 na 9
  - input: 1, 3 na 5
  - input: 1, 4 na 3
  - output: 1, 0 na 15
  - output: 1, 1 na 27
  - output: 1, 2 na 24
  - output: 1, 3 na 27
  - input: 2, 0 na 3
  - input: 2, 1 na 8
  - input: 2, 2 na 9
  - input: 2, 3 na 3
  - input: 2, 4 na 0
  - output: 2, 0 na 9
  - output: 2, 1 na 27
  - output: 2, 2 na 24
  - output: 2, 3 na 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 а reverse 0
  - step p0: 1 а times 4
  - step p0: 2 а remove 1
  - step p1: 0 а reverse 0
  - step p1: 1 а times 3
  - step p1: 2 а remove 1
  - step p2: 0 а reverse 0
  - step p2: 1 а times 3
  - step p2: 2 а reverse 0
  - step p3: 0 а reverse 0
  - step p3: 1 а times 3
  - step p3: 2 а remove 3
Examples:
  - input: 0, 0 а 4
  - input: 0, 1 а 8
  - input: 0, 2 а 5
  - input: 0, 3 а 0
  - input: 0, 4 а 2
  - output: 0, 0 а 0
  - output: 0, 1 а 15
  - output: 0, 2 а 24
  - output: 0, 3 а 12
  - input: 1, 0 а 9
  - input: 1, 1 а 8
  - input: 1, 2 а 9
  - input: 1, 3 а 5
  - input: 1, 4 а 3
  - output: 1, 0 а 15
  - output: 1, 1 а 27
  - output: 1, 2 а 24
  - output: 1, 3 а 27
  - input: 2, 0 а 3
  - input: 2, 1 а 8
  - input: 2, 2 а 9
  - input: 2, 3 а 3
  - input: 2, 4 а 0
  - output: 2, 0 а 9
  - output: 2, 1 а 27
  - output: 2, 2 а 24
  - output: 2, 3 а 9
Program fits дерриг example what?

대답 선택: p0; p1; p2; p3.
후보자:
  - 걸음 p0: 0 reverse 0
  - 걸음 p0: 1 곱하기 4
  - 걸음 p0: 2 치우다 1
  - 걸음 p1: 0 reverse 0
  - 걸음 p1: 1 곱하기 3
  - 걸음 p1: 2 치우다 1
  - 걸음 p2: 0 reverse 0
  - 걸음 p2: 1 곱하기 3
  - 걸음 p2: 2 reverse 0
  - 걸음 p3: 0 reverse 0
  - 걸음 p3: 1 곱하기 3
  - 걸음 p3: 2 치우다 3
보기:
  - 입력: 0, 0 4
  - 입력: 0, 1 8
  - 입력: 0, 2 5
  - 입력: 0, 3 0
  - 입력: 0, 4 2
  - 출력: 0, 0 0
  - 출력: 0, 1 15
  - 출력: 0, 2 24
  - 출력: 0, 3 12
  - 입력: 1, 0 9
  - 입력: 1, 1 8
  - 입력: 1, 2 9
  - 입력: 1, 3 5
  - 입력: 1, 4 3
  - 출력: 1, 0 15
  - 출력: 1, 1 27
  - 출력: 1, 2 24
  - 출력: 1, 3 27
  - 입력: 2, 0 3
  - 입력: 2, 1 8
  - 입력: 2, 2 9
  - 입력: 2, 3 3
  - 입력: 2, 4 0
  - 출력: 2, 0 9
  - 출력: 2, 1 27
  - 출력: 2, 2 24
  - 출력: 2, 3 9
프로그램 fits 각 보기 어느?

Erantzun aukerongatik: p0; p1; p2; p3.
Kandidatu:
  - urrats p0: 0 eta reverse 0
  - urrats p0: 1 eta bider 4
  - urrats p0: 2 eta kendu 1
  - urrats p1: 0 eta reverse 0
  - urrats p1: 1 eta bider 3
  - urrats p1: 2 eta kendu 1
  - urrats p2: 0 eta reverse 0
  - urrats p2: 1 eta bider 3
  - urrats p2: 2 eta reverse 0
  - urrats p3: 0 eta reverse 0
  - urrats p3: 1 eta bider 3
  - urrats p3: 2 eta kendu 3
Adibideongatik:
  - input: 0, 0 eta 4
  - input: 0, 1 eta 8
  - input: 0, 2 eta 5
  - input: 0, 3 eta 0
  - input: 0, 4 eta 2
  - output: 0, 0 eta 0
  - output: 0, 1 eta 15
  - output: 0, 2 eta 24
  - output: 0, 3 eta 12
  - input: 1, 0 eta 9
  - input: 1, 1 eta 8
  - input: 1, 2 eta 9
  - input: 1, 3 eta 5
  - input: 1, 4 eta 3
  - output: 1, 0 eta 15
  - output: 1, 1 eta 27
  - output: 1, 2 eta 24
  - output: 1, 3 eta 27
  - input: 2, 0 eta 3
  - input: 2, 1 eta 8
  - input: 2, 2 eta 9
  - input: 2, 3 eta 3
  - input: 2, 4 eta 0
  - output: 2, 0 eta 9
  - output: 2, 1 eta 27
  - output: 2, 2 eta 24
  - output: 2, 3 eta 9
Program fits every adibide what?

Answer options: p0; p1; p2; p3.
ᎠᏙᎩᏯᏍᎩ:
  - ᎠᎩᏠᏒᏍᏗᎢ p0: 0 ᎠᎴ reverse 0
  - ᎠᎩᏠᏒᏍᏗᎢ p0: 1 ᎠᎴ times 4
  - ᎠᎩᏠᏒᏍᏗᎢ p0: 2 ᎠᎴ remove 1
  - ᎠᎩᏠᏒᏍᏗᎢ p1: 0 ᎠᎴ reverse 0
  - ᎠᎩᏠᏒᏍᏗᎢ p1: 1 ᎠᎴ times 3
  - ᎠᎩᏠᏒᏍᏗᎢ p1: 2 ᎠᎴ remove 1
  - ᎠᎩᏠᏒᏍᏗᎢ p2: 0 ᎠᎴ reverse 0
  - ᎠᎩᏠᏒᏍᏗᎢ p2: 1 ᎠᎴ times 3
  - ᎠᎩᏠᏒᏍᏗᎢ p2: 2 ᎠᎴ reverse 0
  - ᎠᎩᏠᏒᏍᏗᎢ p3: 0 ᎠᎴ reverse 0
  - ᎠᎩᏠᏒᏍᏗᎢ p3: 1 ᎠᎴ times 3
  - ᎠᎩᏠᏒᏍᏗᎢ p3: 2 ᎠᎴ remove 3
Examples:
  - input: 0, 0 ᎠᎴ 4
  - input: 0, 1 ᎠᎴ 8
  - input: 0, 2 ᎠᎴ 5
  - input: 0, 3 ᎠᎴ 0
  - input: 0, 4 ᎠᎴ 2
  - output: 0, 0 ᎠᎴ 0
  - output: 0, 1 ᎠᎴ 15
  - output: 0, 2 ᎠᎴ 24
  - output: 0, 3 ᎠᎴ 12
  - input: 1, 0 ᎠᎴ 9
  - input: 1, 1 ᎠᎴ 8
  - input: 1, 2 ᎠᎴ 9
  - input: 1, 3 ᎠᎴ 5
  - input: 1, 4 ᎠᎴ 3
  - output: 1, 0 ᎠᎴ 15
  - output: 1, 1 ᎠᎴ 27
  - output: 1, 2 ᎠᎴ 24
  - output: 1, 3 ᎠᎴ 27
  - input: 2, 0 ᎠᎴ 3
  - input: 2, 1 ᎠᎴ 8
  - input: 2, 2 ᎠᎴ 9
  - input: 2, 3 ᎠᎴ 3
  - input: 2, 4 ᎠᎴ 0
  - output: 2, 0 ᎠᎴ 9
  - output: 2, 1 ᎠᎴ 27
  - output: 2, 2 ᎠᎴ 24
  - output: 2, 3 ᎠᎴ 9
What program fits every example?

Answer options: p0; p1; p2; p3.
Candidates:
  - thatki p0: 0 reverse 0
  - thatki p0: 1 times 4
  - thatki p0: 2 hurquy 1
  - thatki p1: 0 reverse 0
  - thatki p1: 1 times 3
  - thatki p1: 2 hurquy 1
  - thatki p2: 0 reverse 0
  - thatki p2: 1 times 3
  - thatki p2: 2 reverse 0
  - thatki p3: 0 reverse 0
  - thatki p3: 1 times 3
  - thatki p3: 2 hurquy 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits tukuy example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 ыкӏи reverse 0
  - step p0: 1 ыкӏи times 4
  - step p0: 2 ыкӏи remove 1
  - step p1: 0 ыкӏи reverse 0
  - step p1: 1 ыкӏи times 3
  - step p1: 2 ыкӏи remove 1
  - step p2: 0 ыкӏи reverse 0
  - step p2: 1 ыкӏи times 3
  - step p2: 2 ыкӏи reverse 0
  - step p3: 0 ыкӏи reverse 0
  - step p3: 1 ыкӏи times 3
  - step p3: 2 ыкӏи remove 3
Examples:
  - input: 0, 0 ыкӏи 4
  - input: 0, 1 ыкӏи 8
  - input: 0, 2 ыкӏи 5
  - input: 0, 3 ыкӏи 0
  - input: 0, 4 ыкӏи 2
  - output: 0, 0 ыкӏи 0
  - output: 0, 1 ыкӏи 15
  - output: 0, 2 ыкӏи 24
  - output: 0, 3 ыкӏи 12
  - input: 1, 0 ыкӏи 9
  - input: 1, 1 ыкӏи 8
  - input: 1, 2 ыкӏи 9
  - input: 1, 3 ыкӏи 5
  - input: 1, 4 ыкӏи 3
  - output: 1, 0 ыкӏи 15
  - output: 1, 1 ыкӏи 27
  - output: 1, 2 ыкӏи 24
  - output: 1, 3 ыкӏи 27
  - input: 2, 0 ыкӏи 3
  - input: 2, 1 ыкӏи 8
  - input: 2, 2 ыкӏи 9
  - input: 2, 3 ыкӏи 3
  - input: 2, 4 ыкӏи 0
  - output: 2, 0 ыкӏи 9
  - output: 2, 1 ыкӏи 27
  - output: 2, 2 ыкӏи 24
  - output: 2, 3 ыкӏи 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 thiab reverse 0
  - step p0: 1 thiab times 4
  - step p0: 2 thiab remove 1
  - step p1: 0 thiab reverse 0
  - step p1: 1 thiab times 3
  - step p1: 2 thiab remove 1
  - step p2: 0 thiab reverse 0
  - step p2: 1 thiab times 3
  - step p2: 2 thiab reverse 0
  - step p3: 0 thiab reverse 0
  - step p3: 1 thiab times 3
  - step p3: 2 thiab remove 3
Examples:
  - input: 0, 0 thiab 4
  - input: 0, 1 thiab 8
  - input: 0, 2 thiab 5
  - input: 0, 3 thiab 0
  - input: 0, 4 thiab 2
  - output: 0, 0 thiab 0
  - output: 0, 1 thiab 15
  - output: 0, 2 thiab 24
  - output: 0, 3 thiab 12
  - input: 1, 0 thiab 9
  - input: 1, 1 thiab 8
  - input: 1, 2 thiab 9
  - input: 1, 3 thiab 5
  - input: 1, 4 thiab 3
  - output: 1, 0 thiab 15
  - output: 1, 1 thiab 27
  - output: 1, 2 thiab 24
  - output: 1, 3 thiab 27
  - input: 2, 0 thiab 3
  - input: 2, 1 thiab 8
  - input: 2, 2 thiab 9
  - input: 2, 3 thiab 3
  - input: 2, 4 thiab 0
  - output: 2, 0 thiab 9
  - output: 2, 1 thiab 27
  - output: 2, 2 thiab 24
  - output: 2, 3 thiab 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 micha' reverse 0
  - step p0: 1 micha' times 4
  - step p0: 2 micha' remove 1
  - step p1: 0 micha' reverse 0
  - step p1: 1 micha' times 3
  - step p1: 2 micha' remove 1
  - step p2: 0 micha' reverse 0
  - step p2: 1 micha' times 3
  - step p2: 2 micha' reverse 0
  - step p3: 0 micha' reverse 0
  - step p3: 1 micha' times 3
  - step p3: 2 micha' remove 3
Examples:
  - input: 0, 0 micha' 4
  - input: 0, 1 micha' 8
  - input: 0, 2 micha' 5
  - input: 0, 3 micha' 0
  - input: 0, 4 micha' 2
  - output: 0, 0 micha' 0
  - output: 0, 1 micha' 15
  - output: 0, 2 micha' 24
  - output: 0, 3 micha' 12
  - input: 1, 0 micha' 9
  - input: 1, 1 micha' 8
  - input: 1, 2 micha' 9
  - input: 1, 3 micha' 5
  - input: 1, 4 micha' 3
  - output: 1, 0 micha' 15
  - output: 1, 1 micha' 27
  - output: 1, 2 micha' 24
  - output: 1, 3 micha' 27
  - input: 2, 0 micha' 3
  - input: 2, 1 micha' 8
  - input: 2, 2 micha' 9
  - input: 2, 3 micha' 3
  - input: 2, 4 micha' 0
  - output: 2, 0 micha' 9
  - output: 2, 1 micha' 27
  - output: 2, 2 micha' 24
  - output: 2, 3 micha' 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 カ reverse 0
  - step p0: 1 カ times 4
  - step p0: 2 カ remove 1
  - step p1: 0 カ reverse 0
  - step p1: 1 カ times 3
  - step p1: 2 カ remove 1
  - step p2: 0 カ reverse 0
  - step p2: 1 カ times 3
  - step p2: 2 カ reverse 0
  - step p3: 0 カ reverse 0
  - step p3: 1 カ times 3
  - step p3: 2 カ remove 3
Examples:
  - input: 0, 0 カ 4
  - input: 0, 1 カ 8
  - input: 0, 2 カ 5
  - input: 0, 3 カ 0
  - input: 0, 4 カ 2
  - output: 0, 0 カ 0
  - output: 0, 1 カ 15
  - output: 0, 2 カ 24
  - output: 0, 3 カ 12
  - input: 1, 0 カ 9
  - input: 1, 1 カ 8
  - input: 1, 2 カ 9
  - input: 1, 3 カ 5
  - input: 1, 4 カ 3
  - output: 1, 0 カ 15
  - output: 1, 1 カ 27
  - output: 1, 2 カ 24
  - output: 1, 3 カ 27
  - input: 2, 0 カ 3
  - input: 2, 1 カ 8
  - input: 2, 2 カ 9
  - input: 2, 3 カ 3
  - input: 2, 4 カ 0
  - output: 2, 0 カ 9
  - output: 2, 1 カ 27
  - output: 2, 2 カ 24
  - output: 2, 3 カ 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 ынкъам reverse 0
  - step p0: 1 ынкъам times 4
  - step p0: 2 ынкъам remove 1
  - step p1: 0 ынкъам reverse 0
  - step p1: 1 ынкъам times 3
  - step p1: 2 ынкъам remove 1
  - step p2: 0 ынкъам reverse 0
  - step p2: 1 ынкъам times 3
  - step p2: 2 ынкъам reverse 0
  - step p3: 0 ынкъам reverse 0
  - step p3: 1 ынкъам times 3
  - step p3: 2 ынкъам remove 3
Examples:
  - input: 0, 0 ынкъам 4
  - input: 0, 1 ынкъам 8
  - input: 0, 2 ынкъам 5
  - input: 0, 3 ынкъам 0
  - input: 0, 4 ынкъам 2
  - output: 0, 0 ынкъам 0
  - output: 0, 1 ынкъам 15
  - output: 0, 2 ынкъам 24
  - output: 0, 3 ынкъам 12
  - input: 1, 0 ынкъам 9
  - input: 1, 1 ынкъам 8
  - input: 1, 2 ынкъам 9
  - input: 1, 3 ынкъам 5
  - input: 1, 4 ынкъам 3
  - output: 1, 0 ынкъам 15
  - output: 1, 1 ынкъам 27
  - output: 1, 2 ынкъам 24
  - output: 1, 3 ынкъам 27
  - input: 2, 0 ынкъам 3
  - input: 2, 1 ынкъам 8
  - input: 2, 2 ынкъам 9
  - input: 2, 3 ынкъам 3
  - input: 2, 4 ынкъам 0
  - output: 2, 0 ынкъам 9
  - output: 2, 1 ынкъам 27
  - output: 2, 2 ынкъам 24
  - output: 2, 3 ынкъам 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 yéetel reverse 0
  - step p0: 1 yéetel times 4
  - step p0: 2 yéetel remove 1
  - step p1: 0 yéetel reverse 0
  - step p1: 1 yéetel times 3
  - step p1: 2 yéetel remove 1
  - step p2: 0 yéetel reverse 0
  - step p2: 1 yéetel times 3
  - step p2: 2 yéetel reverse 0
  - step p3: 0 yéetel reverse 0
  - step p3: 1 yéetel times 3
  - step p3: 2 yéetel remove 3
Examples:
  - input: 0, 0 yéetel 4
  - input: 0, 1 yéetel 8
  - input: 0, 2 yéetel 5
  - input: 0, 3 yéetel 0
  - input: 0, 4 yéetel 2
  - output: 0, 0 yéetel 0
  - output: 0, 1 yéetel 15
  - output: 0, 2 yéetel 24
  - output: 0, 3 yéetel 12
  - input: 1, 0 yéetel 9
  - input: 1, 1 yéetel 8
  - input: 1, 2 yéetel 9
  - input: 1, 3 yéetel 5
  - input: 1, 4 yéetel 3
  - output: 1, 0 yéetel 15
  - output: 1, 1 yéetel 27
  - output: 1, 2 yéetel 24
  - output: 1, 3 yéetel 27
  - input: 2, 0 yéetel 3
  - input: 2, 1 yéetel 8
  - input: 2, 2 yéetel 9
  - input: 2, 3 yéetel 3
  - input: 2, 4 yéetel 0
  - output: 2, 0 yéetel 9
  - output: 2, 1 yéetel 27
  - output: 2, 2 yéetel 24
  - output: 2, 3 yéetel 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 na reverse 0
  - step p0: 1 na times 4
  - step p0: 2 na remove 1
  - step p1: 0 na reverse 0
  - step p1: 1 na times 3
  - step p1: 2 na remove 1
  - step p2: 0 na reverse 0
  - step p2: 1 na times 3
  - step p2: 2 na reverse 0
  - step p3: 0 na reverse 0
  - step p3: 1 na times 3
  - step p3: 2 na remove 3
Examples:
  - input: 0, 0 na 4
  - input: 0, 1 na 8
  - input: 0, 2 na 5
  - input: 0, 3 na 0
  - input: 0, 4 na 2
  - output: 0, 0 na 0
  - output: 0, 1 na 15
  - output: 0, 2 na 24
  - output: 0, 3 na 12
  - input: 1, 0 na 9
  - input: 1, 1 na 8
  - input: 1, 2 na 9
  - input: 1, 3 na 5
  - input: 1, 4 na 3
  - output: 1, 0 na 15
  - output: 1, 1 na 27
  - output: 1, 2 na 24
  - output: 1, 3 na 27
  - input: 2, 0 na 3
  - input: 2, 1 na 8
  - input: 2, 2 na 9
  - input: 2, 3 na 3
  - input: 2, 4 na 0
  - output: 2, 0 na 9
  - output: 2, 1 na 27
  - output: 2, 2 na 24
  - output: 2, 3 na 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 ǂʻá reverse 0
  - step p0: 1 ǂʻá times 4
  - step p0: 2 ǂʻá remove 1
  - step p1: 0 ǂʻá reverse 0
  - step p1: 1 ǂʻá times 3
  - step p1: 2 ǂʻá remove 1
  - step p2: 0 ǂʻá reverse 0
  - step p2: 1 ǂʻá times 3
  - step p2: 2 ǂʻá reverse 0
  - step p3: 0 ǂʻá reverse 0
  - step p3: 1 ǂʻá times 3
  - step p3: 2 ǂʻá remove 3
Examples:
  - input: 0, 0 ǂʻá 4
  - input: 0, 1 ǂʻá 8
  - input: 0, 2 ǂʻá 5
  - input: 0, 3 ǂʻá 0
  - input: 0, 4 ǂʻá 2
  - output: 0, 0 ǂʻá 0
  - output: 0, 1 ǂʻá 15
  - output: 0, 2 ǂʻá 24
  - output: 0, 3 ǂʻá 12
  - input: 1, 0 ǂʻá 9
  - input: 1, 1 ǂʻá 8
  - input: 1, 2 ǂʻá 9
  - input: 1, 3 ǂʻá 5
  - input: 1, 4 ǂʻá 3
  - output: 1, 0 ǂʻá 15
  - output: 1, 1 ǂʻá 27
  - output: 1, 2 ǂʻá 24
  - output: 1, 3 ǂʻá 27
  - input: 2, 0 ǂʻá 3
  - input: 2, 1 ǂʻá 8
  - input: 2, 2 ǂʻá 9
  - input: 2, 3 ǂʻá 3
  - input: 2, 4 ǂʻá 0
  - output: 2, 0 ǂʻá 9
  - output: 2, 1 ǂʻá 27
  - output: 2, 2 ǂʻá 24
  - output: 2, 3 ǂʻá 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

Réponse choix : p0 ; p1 ; p2 ; p3.
Les candidats sont:
  - pas p0: 0 et inverse 0
  - pas p0: 1 et fois 4
  - pas p0: 2 et enlever 1
  - pas p1: 0 et inverse 0
  - pas p1: 1 et fois 3
  - pas p1: 2 et enlever 1
  - pas p2: 0 et inverse 0
  - pas p2: 1 et fois 3
  - pas p2: 2 et inverse 0
  - pas p3: 0 et inverse 0
  - pas p3: 1 et fois 3
  - pas p3: 2 et enlever 3
Voici les exemples:
  - entrée: 0, 0 et 4
  - entrée: 0, 1 et 8
  - entrée: 0, 2 et 5
  - entrée: 0, 3 et 0
  - entrée: 0, 4 et 2
  - produire: 0, 0 et 0
  - produire: 0, 1 et 15
  - produire: 0, 2 et 24
  - produire: 0, 3 et 12
  - entrée: 1, 0 et 9
  - entrée: 1, 1 et 8
  - entrée: 1, 2 et 9
  - entrée: 1, 3 et 5
  - entrée: 1, 4 et 3
  - produire: 1, 0 et 15
  - produire: 1, 1 et 27
  - produire: 1, 2 et 24
  - produire: 1, 3 et 27
  - entrée: 2, 0 et 3
  - entrée: 2, 1 et 8
  - entrée: 2, 2 et 9
  - entrée: 2, 3 et 3
  - entrée: 2, 4 et 0
  - produire: 2, 0 et 9
  - produire: 2, 1 et 27
  - produire: 2, 2 et 24
  - produire: 2, 3 et 9
Quel émission fits tout exemple ?

Respondo alternativo: p0; p1; p2; p3.
Kandidato:
  - paŝado p0: 0 kaj reverse 0
  - paŝado p0: 1 kaj times 4
  - paŝado p0: 2 kaj forigi 1
  - paŝado p1: 0 kaj reverse 0
  - paŝado p1: 1 kaj times 3
  - paŝado p1: 2 kaj forigi 1
  - paŝado p2: 0 kaj reverse 0
  - paŝado p2: 1 kaj times 3
  - paŝado p2: 2 kaj reverse 0
  - paŝado p3: 0 kaj reverse 0
  - paŝado p3: 1 kaj times 3
  - paŝado p3: 2 kaj forigi 3
Ekzemplo:
  - input: 0, 0 kaj 4
  - input: 0, 1 kaj 8
  - input: 0, 2 kaj 5
  - input: 0, 3 kaj 0
  - input: 0, 4 kaj 2
  - eksterdoni: 0, 0 kaj 0
  - eksterdoni: 0, 1 kaj 15
  - eksterdoni: 0, 2 kaj 24
  - eksterdoni: 0, 3 kaj 12
  - input: 1, 0 kaj 9
  - input: 1, 1 kaj 8
  - input: 1, 2 kaj 9
  - input: 1, 3 kaj 5
  - input: 1, 4 kaj 3
  - eksterdoni: 1, 0 kaj 15
  - eksterdoni: 1, 1 kaj 27
  - eksterdoni: 1, 2 kaj 24
  - eksterdoni: 1, 3 kaj 27
  - input: 2, 0 kaj 3
  - input: 2, 1 kaj 8
  - input: 2, 2 kaj 9
  - input: 2, 3 kaj 3
  - input: 2, 4 kaj 0
  - eksterdoni: 2, 0 kaj 9
  - eksterdoni: 2, 1 kaj 27
  - eksterdoni: 2, 2 kaj 24
  - eksterdoni: 2, 3 kaj 9
Programo fits ĉiu ekzemplo kiu?

Válasz lehetőségek: p0; p1; p2; p3.
Indulók:
  - lépés p0: 0 és fordított 0
  - lépés p0: 1 és times 4
  - lépés p0: 2 és eltávolít 1
  - lépés p1: 0 és fordított 0
  - lépés p1: 1 és times 3
  - lépés p1: 2 és eltávolít 1
  - lépés p2: 0 és fordított 0
  - lépés p2: 1 és times 3
  - lépés p2: 2 és fordított 0
  - lépés p3: 0 és fordított 0
  - lépés p3: 1 és times 3
  - lépés p3: 2 és eltávolít 3
Példák:
  - bevitel: 0, 0 és 4
  - bevitel: 0, 1 és 8
  - bevitel: 0, 2 és 5
  - bevitel: 0, 3 és 0
  - bevitel: 0, 4 és 2
  - kimenet: 0, 0 és 0
  - kimenet: 0, 1 és 15
  - kimenet: 0, 2 és 24
  - kimenet: 0, 3 és 12
  - bevitel: 1, 0 és 9
  - bevitel: 1, 1 és 8
  - bevitel: 1, 2 és 9
  - bevitel: 1, 3 és 5
  - bevitel: 1, 4 és 3
  - kimenet: 1, 0 és 15
  - kimenet: 1, 1 és 27
  - kimenet: 1, 2 és 24
  - kimenet: 1, 3 és 27
  - bevitel: 2, 0 és 3
  - bevitel: 2, 1 és 8
  - bevitel: 2, 2 és 9
  - bevitel: 2, 3 és 3
  - bevitel: 2, 4 és 0
  - kimenet: 2, 0 és 9
  - kimenet: 2, 1 és 27
  - kimenet: 2, 2 és 24
  - kimenet: 2, 3 és 9
Műsor fits minden példa melyik?

回答選擇:p0; p1; p2; p3.
候選人:
  - stepp0:0及褪車:0
  - stepp0:1及times:4
  - stepp0:2及remove:1
  - stepp1:0及褪車:0
  - stepp1:1及times:3
  - stepp1:2及remove:1
  - stepp2:0及褪車:0
  - stepp2:1及times:3
  - stepp2:2及褪車:0
  - stepp3:0及褪車:0
  - stepp3:1及times:3
  - stepp3:2及remove:3
例子:
  - 輸入:0, 0及4
  - 輸入:0, 1及8
  - 輸入:0, 2及5
  - 輸入:0, 3及0
  - 輸入:0, 4及2
  - 輸出:0, 0及0
  - 輸出:0, 1及15
  - 輸出:0, 2及24
  - 輸出:0, 3及12
  - 輸入:1, 0及9
  - 輸入:1, 1及8
  - 輸入:1, 2及9
  - 輸入:1, 3及5
  - 輸入:1, 4及3
  - 輸出:1, 0及15
  - 輸出:1, 1及27
  - 輸出:1, 2及24
  - 輸出:1, 3及27
  - 輸入:2, 0及3
  - 輸入:2, 1及8
  - 輸入:2, 2及9
  - 輸入:2, 3及3
  - 輸入:2, 4及0
  - 輸出:2, 0及9
  - 輸出:2, 1及27
  - 輸出:2, 2及24
  - 輸出:2, 3及9
節目fits每例子邊?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 とぅ reverse 0
  - step p0: 1 とぅ times 4
  - step p0: 2 とぅ remove 1
  - step p1: 0 とぅ reverse 0
  - step p1: 1 とぅ times 3
  - step p1: 2 とぅ remove 1
  - step p2: 0 とぅ reverse 0
  - step p2: 1 とぅ times 3
  - step p2: 2 とぅ reverse 0
  - step p3: 0 とぅ reverse 0
  - step p3: 1 とぅ times 3
  - step p3: 2 とぅ remove 3
Examples:
  - input: 0, 0 とぅ 4
  - input: 0, 1 とぅ 8
  - input: 0, 2 とぅ 5
  - input: 0, 3 とぅ 0
  - input: 0, 4 とぅ 2
  - output: 0, 0 とぅ 0
  - output: 0, 1 とぅ 15
  - output: 0, 2 とぅ 24
  - output: 0, 3 とぅ 12
  - input: 1, 0 とぅ 9
  - input: 1, 1 とぅ 8
  - input: 1, 2 とぅ 9
  - input: 1, 3 とぅ 5
  - input: 1, 4 とぅ 3
  - output: 1, 0 とぅ 15
  - output: 1, 1 とぅ 27
  - output: 1, 2 とぅ 24
  - output: 1, 3 とぅ 27
  - input: 2, 0 とぅ 3
  - input: 2, 1 とぅ 8
  - input: 2, 2 とぅ 9
  - input: 2, 3 とぅ 3
  - input: 2, 4 とぅ 0
  - output: 2, 0 とぅ 9
  - output: 2, 1 とぅ 27
  - output: 2, 2 とぅ 24
  - output: 2, 3 とぅ 9
Program fits every example what?

Жауап опцион: p0; p1; p2; p3.
Үміткер:
  - қадам p0: 0 және reverse 0
  - қадам p0: 1 және times 4
  - қадам p0: 2 және аластау 1
  - қадам p1: 0 және reverse 0
  - қадам p1: 1 және times 3
  - қадам p1: 2 және аластау 1
  - қадам p2: 0 және reverse 0
  - қадам p2: 1 және times 3
  - қадам p2: 2 және reverse 0
  - қадам p3: 0 және reverse 0
  - қадам p3: 1 және times 3
  - қадам p3: 2 және аластау 3
Мысал:
  - input: 0, 0 және 4
  - input: 0, 1 және 8
  - input: 0, 2 және 5
  - input: 0, 3 және 0
  - input: 0, 4 және 2
  - output: 0, 0 және 0
  - output: 0, 1 және 15
  - output: 0, 2 және 24
  - output: 0, 3 және 12
  - input: 1, 0 және 9
  - input: 1, 1 және 8
  - input: 1, 2 және 9
  - input: 1, 3 және 5
  - input: 1, 4 және 3
  - output: 1, 0 және 15
  - output: 1, 1 және 27
  - output: 1, 2 және 24
  - output: 1, 3 және 27
  - input: 2, 0 және 3
  - input: 2, 1 және 8
  - input: 2, 2 және 9
  - input: 2, 3 және 3
  - input: 2, 4 және 0
  - output: 2, 0 және 9
  - output: 2, 1 және 27
  - output: 2, 2 және 24
  - output: 2, 3 және 9
Бағдарлама fits әр мысал қайсы?

תְּשׁוּבָה אפשרויות: p0; p1; p2; p3.
מועמדת:
  - צַעַד p0: 0 וְ־ reverse 0
  - צַעַד p0: 1 וְ־ times 4
  - צַעַד p0: 2 וְ־ הסיר 1
  - צַעַד p1: 0 וְ־ reverse 0
  - צַעַד p1: 1 וְ־ times 3
  - צַעַד p1: 2 וְ־ הסיר 1
  - צַעַד p2: 0 וְ־ reverse 0
  - צַעַד p2: 1 וְ־ times 3
  - צַעַד p2: 2 וְ־ reverse 0
  - צַעַד p3: 0 וְ־ reverse 0
  - צַעַד p3: 1 וְ־ times 3
  - צַעַד p3: 2 וְ־ הסיר 3
דּוּגְמָה:
  - קֶלֶט: 0, 0 וְ־ 4
  - קֶלֶט: 0, 1 וְ־ 8
  - קֶלֶט: 0, 2 וְ־ 5
  - קֶלֶט: 0, 3 וְ־ 0
  - קֶלֶט: 0, 4 וְ־ 2
  - פֶּלֶט: 0, 0 וְ־ 0
  - פֶּלֶט: 0, 1 וְ־ 15
  - פֶּלֶט: 0, 2 וְ־ 24
  - פֶּלֶט: 0, 3 וְ־ 12
  - קֶלֶט: 1, 0 וְ־ 9
  - קֶלֶט: 1, 1 וְ־ 8
  - קֶלֶט: 1, 2 וְ־ 9
  - קֶלֶט: 1, 3 וְ־ 5
  - קֶלֶט: 1, 4 וְ־ 3
  - פֶּלֶט: 1, 0 וְ־ 15
  - פֶּלֶט: 1, 1 וְ־ 27
  - פֶּלֶט: 1, 2 וְ־ 24
  - פֶּלֶט: 1, 3 וְ־ 27
  - קֶלֶט: 2, 0 וְ־ 3
  - קֶלֶט: 2, 1 וְ־ 8
  - קֶלֶט: 2, 2 וְ־ 9
  - קֶלֶט: 2, 3 וְ־ 3
  - קֶלֶט: 2, 4 וְ־ 0
  - פֶּלֶט: 2, 0 וְ־ 9
  - פֶּלֶט: 2, 1 וְ־ 27
  - פֶּלֶט: 2, 2 וְ־ 24
  - פֶּלֶט: 2, 3 וְ־ 9
אֵיזֶה תוכנית fits כֹּל דּוּגְמָה?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 დო reverse 0
  - step p0: 1 დო times 4
  - step p0: 2 დო remove 1
  - step p1: 0 დო reverse 0
  - step p1: 1 დო times 3
  - step p1: 2 დო remove 1
  - step p2: 0 დო reverse 0
  - step p2: 1 დო times 3
  - step p2: 2 დო reverse 0
  - step p3: 0 დო reverse 0
  - step p3: 1 დო times 3
  - step p3: 2 დო remove 3
Examples:
  - input: 0, 0 დო 4
  - input: 0, 1 დო 8
  - input: 0, 2 დო 5
  - input: 0, 3 დო 0
  - input: 0, 4 დო 2
  - output: 0, 0 დო 0
  - output: 0, 1 დო 15
  - output: 0, 2 დო 24
  - output: 0, 3 დო 12
  - input: 1, 0 დო 9
  - input: 1, 1 დო 8
  - input: 1, 2 დო 9
  - input: 1, 3 დო 5
  - input: 1, 4 დო 3
  - output: 1, 0 დო 15
  - output: 1, 1 დო 27
  - output: 1, 2 დო 24
  - output: 1, 3 დო 27
  - input: 2, 0 დო 3
  - input: 2, 1 დო 8
  - input: 2, 2 დო 9
  - input: 2, 3 დო 3
  - input: 2, 4 დო 0
  - output: 2, 0 დო 9
  - output: 2, 1 დო 27
  - output: 2, 2 დო 24
  - output: 2, 3 დო 9
Program fits every example what?

Jawaban pilihan-pilihan: p0; p1; p2; p3.
Kandidat:
  - langkah p0: 0 dan reverse 0
  - langkah p0: 1 dan kali 4
  - langkah p0: 2 dan remove 1
  - langkah p1: 0 dan reverse 0
  - langkah p1: 1 dan kali 3
  - langkah p1: 2 dan remove 1
  - langkah p2: 0 dan reverse 0
  - langkah p2: 1 dan kali 3
  - langkah p2: 2 dan reverse 0
  - langkah p3: 0 dan reverse 0
  - langkah p3: 1 dan kali 3
  - langkah p3: 2 dan remove 3
Misal:
  - memasukkan: 0, 0 dan 4
  - memasukkan: 0, 1 dan 8
  - memasukkan: 0, 2 dan 5
  - memasukkan: 0, 3 dan 0
  - memasukkan: 0, 4 dan 2
  - output: 0, 0 dan 0
  - output: 0, 1 dan 15
  - output: 0, 2 dan 24
  - output: 0, 3 dan 12
  - memasukkan: 1, 0 dan 9
  - memasukkan: 1, 1 dan 8
  - memasukkan: 1, 2 dan 9
  - memasukkan: 1, 3 dan 5
  - memasukkan: 1, 4 dan 3
  - output: 1, 0 dan 15
  - output: 1, 1 dan 27
  - output: 1, 2 dan 24
  - output: 1, 3 dan 27
  - memasukkan: 2, 0 dan 3
  - memasukkan: 2, 1 dan 8
  - memasukkan: 2, 2 dan 9
  - memasukkan: 2, 3 dan 3
  - memasukkan: 2, 4 dan 0
  - output: 2, 0 dan 9
  - output: 2, 1 dan 27
  - output: 2, 2 dan 24
  - output: 2, 3 dan 9
Acara fits setiap misal yang?

ពាក្យឆ្លើយជំរើស:p0; p1; p2; p3.
បេក្ខជន:
  - ជំហានp0:0នឹងreverse:0
  - ជំហានp0:1នឹងគុណ:4
  - ជំហានp0:2នឹងយកចេញ:1
  - ជំហានp1:0នឹងreverse:0
  - ជំហានp1:1នឹងគុណ:3
  - ជំហានp1:2នឹងយកចេញ:1
  - ជំហានp2:0នឹងreverse:0
  - ជំហានp2:1នឹងគុណ:3
  - ជំហានp2:2នឹងreverse:0
  - ជំហានp3:0នឹងreverse:0
  - ជំហានp3:1នឹងគុណ:3
  - ជំហានp3:2នឹងយកចេញ:3
ឧទាហរណ៍:
  - input:0, 0នឹង4
  - input:0, 1នឹង8
  - input:0, 2នឹង5
  - input:0, 3នឹង0
  - input:0, 4នឹង2
  - output:0, 0នឹង0
  - output:0, 1នឹង15
  - output:0, 2នឹង24
  - output:0, 3នឹង12
  - input:1, 0នឹង9
  - input:1, 1នឹង8
  - input:1, 2នឹង9
  - input:1, 3នឹង5
  - input:1, 4នឹង3
  - output:1, 0នឹង15
  - output:1, 1នឹង27
  - output:1, 2នឹង24
  - output:1, 3នឹង27
  - input:2, 0នឹង3
  - input:2, 1នឹង8
  - input:2, 2នឹង9
  - input:2, 3នឹង3
  - input:2, 4នឹង0
  - output:2, 0នឹង9
  - output:2, 1នឹង27
  - output:2, 2នឹង24
  - output:2, 3នឹង9
កម្មវិធីfitsរាល់ឧទាហរណ៍ណា?

ຄຳຕອບທາງເລືອກ:p0; p1; p2; p3.
ຜູ້ສະໝັກ:
  - ກ້າວp0:0ແລະreverse:0
  - ກ້າວp0:1ແລະtimes:4
  - ກ້າວp0:2ແລະremove:1
  - ກ້າວp1:0ແລະreverse:0
  - ກ້າວp1:1ແລະtimes:3
  - ກ້າວp1:2ແລະremove:1
  - ກ້າວp2:0ແລະreverse:0
  - ກ້າວp2:1ແລະtimes:3
  - ກ້າວp2:2ແລະreverse:0
  - ກ້າວp3:0ແລະreverse:0
  - ກ້າວp3:1ແລະtimes:3
  - ກ້າວp3:2ແລະremove:3
ຕົວຢ່າງ:
  - input:0, 0ແລະ4
  - input:0, 1ແລະ8
  - input:0, 2ແລະ5
  - input:0, 3ແລະ0
  - input:0, 4ແລະ2
  - output:0, 0ແລະ0
  - output:0, 1ແລະ15
  - output:0, 2ແລະ24
  - output:0, 3ແລະ12
  - input:1, 0ແລະ9
  - input:1, 1ແລະ8
  - input:1, 2ແລະ9
  - input:1, 3ແລະ5
  - input:1, 4ແລະ3
  - output:1, 0ແລະ15
  - output:1, 1ແລະ27
  - output:1, 2ແລະ24
  - output:1, 3ແລະ27
  - input:2, 0ແລະ3
  - input:2, 1ແລະ8
  - input:2, 2ແລະ9
  - input:2, 3ແລະ3
  - input:2, 4ແລະ0
  - output:2, 0ແລະ9
  - output:2, 1ແລະ27
  - output:2, 2ແລະ24
  - output:2, 3ແລະ9
ລາຍການfitsທຸກຕົວຢ່າງໃດ?

answer options: p0; p1; p2; p3.
candidates:
  - step p0: 0 మరియు reverse 0
  - step p0: 1 మరియు times 4
  - step p0: 2 మరియు తీయు 1
  - step p1: 0 మరియు reverse 0
  - step p1: 1 మరియు times 3
  - step p1: 2 మరియు తీయు 1
  - step p2: 0 మరియు reverse 0
  - step p2: 1 మరియు times 3
  - step p2: 2 మరియు reverse 0
  - step p3: 0 మరియు reverse 0
  - step p3: 1 మరియు times 3
  - step p3: 2 మరియు తీయు 3
ఉదాహరణము:
  - input: 0, 0 మరియు 4
  - input: 0, 1 మరియు 8
  - input: 0, 2 మరియు 5
  - input: 0, 3 మరియు 0
  - input: 0, 4 మరియు 2
  - output: 0, 0 మరియు 0
  - output: 0, 1 మరియు 15
  - output: 0, 2 మరియు 24
  - output: 0, 3 మరియు 12
  - input: 1, 0 మరియు 9
  - input: 1, 1 మరియు 8
  - input: 1, 2 మరియు 9
  - input: 1, 3 మరియు 5
  - input: 1, 4 మరియు 3
  - output: 1, 0 మరియు 15
  - output: 1, 1 మరియు 27
  - output: 1, 2 మరియు 24
  - output: 1, 3 మరియు 27
  - input: 2, 0 మరియు 3
  - input: 2, 1 మరియు 8
  - input: 2, 2 మరియు 9
  - input: 2, 3 మరియు 3
  - input: 2, 4 మరియు 0
  - output: 2, 0 మరియు 9
  - output: 2, 1 మరియు 27
  - output: 2, 2 మరియు 24
  - output: 2, 3 మరియు 9
కార్యక్రమం fits ప్రతి ఉదాహరణము ఏ?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
What program fits every example?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

answer options: p0; p1; p2; p3.
candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Eksempre:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every eksempre what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

Answer options: p0; p1; p2; p3.
Candidates:
  - step p0: 0 reverse 0
  - step p0: 1 times 4
  - step p0: 2 remove 1
  - step p1: 0 reverse 0
  - step p1: 1 times 3
  - step p1: 2 remove 1
  - step p2: 0 reverse 0
  - step p2: 1 times 3
  - step p2: 2 reverse 0
  - step p3: 0 reverse 0
  - step p3: 1 times 3
  - step p3: 2 remove 3
Examples:
  - input: 0, 0 4
  - input: 0, 1 8
  - input: 0, 2 5
  - input: 0, 3 0
  - input: 0, 4 2
  - output: 0, 0 0
  - output: 0, 1 15
  - output: 0, 2 24
  - output: 0, 3 12
  - input: 1, 0 9
  - input: 1, 1 8
  - input: 1, 2 9
  - input: 1, 3 5
  - input: 1, 4 3
  - output: 1, 0 15
  - output: 1, 1 27
  - output: 1, 2 24
  - output: 1, 3 27
  - input: 2, 0 3
  - input: 2, 1 8
  - input: 2, 2 9
  - input: 2, 3 3
  - input: 2, 4 0
  - output: 2, 0 9
  - output: 2, 1 27
  - output: 2, 2 24
  - output: 2, 3 9
Program fits every example what?

The legal answers are:
  - b
  - e
  - f
  - d
  - a
  - c
The symbols are a; c; f; f.
What is the reversed at 2?

Las respuestas válidas son:
  - b
  - e
  - f
  - d
  - a
  - c
Los símbolos son: a; c; f; f.
¿Qué reversed: 2?

备选答案如下：
  - b
  - e
  - f
  - d
  - a
  - c
符号如下：a；c；f；f。
reversed在：2什么？

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Simgeler a; c; f; f.
Reversed at: 2 ne?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed katika: 2 nini?

The legal answers are:
  - b
  - e
  - f
  - d
  - a
  - c
The symbols are a; c; f; f.
What is the reversed at 2?

{answer_options: [b e f d a c], query: (reversed_at 2), symbols: [a c f f]}

Antwort Alternativen:
  - b
  - e
  - f
  - d
  - a
  - c
Symbole: a; c; f; f.
Was reversed an 2?

О̏дгово̄р ѝзбор:
  - b
  - e
  - f
  - d
  - a
  - c
Сѝмбо̄л: a; c; f; f.
Reversed at 2 kakav?

Vastaus vaihtoehdot:
  - b
  - e
  - f
  - d
  - a
  - c
Merkit: a; c; f; f.
Mikä reversed luona 2?

备选答案如下：
  - b
  - e
  - f
  - d
  - a
  - c
符号如下：a；c；f；f。
reversed在：2什么？

答え選択:
  - b
  - e
  - f
  - d
  - a
  - c
記号:a; c; f; f.
reversed...で:2何と?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Simgeler a; c; f; f.
Reversed at: 2 ne?

answer options:
  - b
  - e
  - f
  - d
  - a
  - c
رَمْز: a؛ c؛ f؛ f.
reversed عِنْد 2 مَاذَا؟

Პასუხი ვარიანტი:
  - b
  - e
  - f
  - d
  - a
  - c
Სიმბოლო: a; c; f; f.
Reversed at 2 რა?

Whakautu kōwhiringa:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed i 2 unutai?

Trả lời lựa chọn:
  - b
  - e
  - f
  - d
  - a
  - c
Ký hiệu: a; c; f; f.
Reversed lúc 2 gì?

คำตอบตัวเลือก:
  - b
  - e
  - f
  - d
  - a
  - c
สัญลักษณ์:a; c; f; f.
reversedที่:2อะไร?

answer options:
  - b
  - e
  - f
  - d
  - a
  - c
சின்னம்: a; c; f; f.
reversed at 2 என்ன?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed katika: 2 nini?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 haʼátʼíísh?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed long 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 kwèch?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 фу?

대답 선택:
  - b
  - e
  - f
  - d
  - a
  - c
상징: a; c; f; f.
reversed at 2 무엇?

Erantzun aukerongatik:
  - b
  - e
  - f
  - d
  - a
  - c
Ikurrongatik: a; c; f; f.
Reversed at 2 zer?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
What reversed at 2?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 сыд?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed jeyou 2 ining-jak?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 nanta?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 híli?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 tay?

Réponse choix :
  - b
  - e
  - f
  - d
  - a
  - c
Symboles : a ; c ; f ; f.
Quoi reversed à 2 ?

Respondo alternativo:
  - b
  - e
  - f
  - d
  - a
  - c
Simbolo: a; c; f; f.
Reversed ĉe 2 kio?

Válasz lehetőségek:
  - b
  - e
  - f
  - d
  - a
  - c
Szimbólumok: a; c; f; f.
Reversed at 2 melyik?

回答選擇:
  - b
  - e
  - f
  - d
  - a
  - c
符號:a; c; f; f.
reversed喺:2乜嘢?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Жауап опцион:
  - b
  - e
  - f
  - d
  - a
  - c
Символ: a; c; f; f.
Reversed at 2 не?

תְּשׁוּבָה אפשרויות:
  - b
  - e
  - f
  - d
  - a
  - c
סֵמֶל: a; c; f; f.
איזה reversed אֵצֶל 2?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Jawaban pilihan-pilihan:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 apa?

ពាក្យឆ្លើយជំរើស:
  - b
  - e
  - f
  - d
  - a
  - c
សញ្ញា:a; c; f; f.
reversed at:2អី?

ຄຳຕອບທາງເລືອກ:
  - b
  - e
  - f
  - d
  - a
  - c
ສັນຍະລັກ:a; c; f; f.
reversedທີ່:2ຫຍັງ?

answer options:
  - b
  - e
  - f
  - d
  - a
  - c
symbols: a; c; f; f.
reversed వద్ద 2 ఏమిటి?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
What reversed at 2?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

answer options:
  - b
  - e
  - f
  - d
  - a
  - c
symbols: a; c; f; f.
reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 what?

Answer options:
  - b
  - e
  - f
  - d
  - a
  - c
Symbols: a; c; f; f.
Reversed at 2 вуч?

The legal answers are: option_a; option_b; option_c; option_d.
The candidates are: option_d encoding tglm, glkl, ptrv, vkrk and tgln; option_b encoding tglm, ptrv, glkl, tgln and vkrk; option_c encoding glkl, ptrv, tgln, tglm and vkrk; option_a encoding glkl, tglm, vkrk, tgln and ptrv.
Constraints:
  - constrain: vkrk, != and ptrv
  - constrain: vkrk, > and tgln
  - constrain: glkl, < and tgln
  - constrain: glkl, < and tglm
  - constrain: tgln, < and tglm
  - constrain: vkrk, > and tglm
  - constrain: glkl, != and vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution and cost is assignments tried
The variables are:
  - glkl domain 2 and 3
  - vkrk domain 5 and 6
  - tgln domain 1, 3 and 4
  - tglm domain 2, 3, 4 and 5
  - ptrv domain 2 and 3
What is the cheapest encoding?

Las respuestas válidas son: opción A; opción B; opción C; opción D.
Los candidatos son: opción D la codificación tglm, glkl, ptrv, vkrk y tgln; opción B la codificación tglm, ptrv, glkl, tgln y vkrk; opción C la codificación glkl, ptrv, tgln, tglm y vkrk; opción A la codificación glkl, tglm, vkrk, tgln y ptrv.
Las restricciones son:
  - restringe: vkrk, != y ptrv
  - restringe: vkrk, > y tgln
  - restringe: glkl, < y tgln
  - restringe: glkl, < y tglm
  - restringe: tgln, < y tglm
  - restringe: vkrk, > y tglm
  - restringe: glkl, != y vkrk
El procedimiento es:
  - búsqueda: backtracking, values ascending, stop en primero solution y el coste de es assignments tried
Las variables son:
  - glkl el dominio 2 y 3
  - vkrk el dominio 5 y 6
  - tgln el dominio 1, 3 y 4
  - tglm el dominio 2, 3, 4 y 5
  - ptrv el dominio 2 y 3
¿Qué cheapest la codificación?

备选答案如下：选项A；选项B；选项C；选项D。
候选项如下：选项D的编码是tglm、glkl、ptrv、vkrk和tgln；选项B的编码是tglm、ptrv、glkl、tgln和vkrk；选项C的编码是glkl、ptrv、tgln、tglm和vkrk；选项A的编码是glkl、tglm、vkrk、tgln和ptrv。
约束如下：
  - 约束：vkrk、!=和ptrv
  - 约束：vkrk、>和tgln
  - 约束：glkl、<和tgln
  - 约束：glkl、<和tglm
  - 约束：tgln、<和tglm
  - 约束：vkrk、>和tglm
  - 约束：glkl、!=和vkrk
过程是：
  - 搜索：backtracking、values ascending、stop在第一solution和的成本是是assignmentstried
变量如下：
  - glkl的领域是2和3
  - vkrk的领域是5和6
  - tgln的领域是1、3和4
  - tglm的领域是2、3、4和5
  - ptrv的领域是2和3
cheapest的编码是什么？

Answer options: option_a; option_b; option_c; option_d.
Adaylar: option_d tglm, glkl, ptrv, vkrk ve tgln encoding; option_b tglm, ptrv, glkl, tgln ve vkrk encoding; option_c glkl, ptrv, tgln, tglm ve vkrk encoding; option_a glkl, tglm, vkrk, tgln ve ptrv encoding.
Constraints:
  - constrain: vkrk, != ve ptrv
  - constrain: vkrk, > ve tgln
  - constrain: glkl, < ve tgln
  - constrain: glkl, < ve tglm
  - constrain: tgln, < ve tglm
  - constrain: vkrk, > ve tglm
  - constrain: glkl, != ve vkrk
Procedure:
  - arama: backtracking, values ascending, stop at ilk solution ve maliyet assignments tried
Değişkenler:
  - glkl 2 ve 3 domain
  - vkrk 5 ve 6 domain
  - tgln 1, 3 ve 4 domain
  - tglm 2, 3, 4 ve 5 domain
  - ptrv 2 ve 3 domain
Cheapest encoding ne?

Answer options: option_a; option_b; option_c; option_d.
Wagombea ni: option_d encoding tglm, glkl, ptrv, vkrk na tgln; option_b encoding tglm, ptrv, glkl, tgln na vkrk; option_c encoding glkl, ptrv, tgln, tglm na vkrk; option_a encoding glkl, tglm, vkrk, tgln na ptrv.
Constraints:
  - constrain: vkrk, != na ptrv
  - constrain: vkrk, > na tgln
  - constrain: glkl, < na tgln
  - constrain: glkl, < na tglm
  - constrain: tgln, < na tglm
  - constrain: vkrk, > na tglm
  - constrain: glkl, != na vkrk
Procedure:
  - search: backtracking, values ascending, stop katika kwanza solution na gharimu ni assignments tried
Variables:
  - glkl domain 2 na 3
  - vkrk domain 5 na 6
  - tgln domain 1, 3 na 4
  - tglm domain 2, 3, 4 na 5
  - ptrv domain 2 na 3
Cheapest encoding nini?

The legal answers are: option_a; option_b; option_c; option_d.
The candidates are: option_d encoding tglm, glkl, ptrv, vkrk and tgln; option_b encoding tglm, ptrv, glkl, tgln and vkrk; option_c encoding glkl, ptrv, tgln, tglm and vkrk; option_a encoding glkl, tglm, vkrk, tgln and ptrv.
Constraints:
  - constrain: vkrk, != and ptrv
  - constrain: vkrk, > and tgln
  - constrain: glkl, < and tgln
  - constrain: glkl, < and tglm
  - constrain: tgln, < and tglm
  - constrain: vkrk, > and tglm
  - constrain: glkl, != and vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution and cost is assignments tried
The variables are:
  - glkl domain 2 and 3
  - vkrk domain 5 and 6
  - tgln domain 1, 3 and 4
  - tglm domain 2, 3, 4 and 5
  - ptrv domain 2 and 3
What is the cheapest encoding?

{answer_options: [option_a option_b option_c option_d], candidates: [(encoding option_d [tglm glkl ptrv vkrk tgln]) (encoding option_b [tglm ptrv glkl tgln vkrk]) (encoding option_c [glkl ptrv tgln tglm vkrk]) (encoding option_a [glkl tglm vkrk tgln ptrv])], constraints: [(constrain vkrk "!=" ptrv) (constrain vkrk ">" tgln) (constrain glkl "<" tgln) (constrain glkl "<" tglm) (constrain tgln "<" tglm) (constrain vkrk ">" tglm) (constrain glkl "!=" vkrk)], procedure: (search backtracking (values_ascending) (stop_at_first_solution) (cost_is_assignments_tried)), query: cheapest_encoding, variables: [(domain glkl [2 3]) (domain vkrk [5 6]) (domain tgln [1 3 4]) (domain tglm [2 3 4 5]) (domain ptrv [2 3])]}

Antwort Alternativen: option_a; option_b; option_c; option_d.
Die Kandidaten sind: option_d Kodierung tglm, glkl, ptrv, vkrk und tgln; option_b Kodierung tglm, ptrv, glkl, tgln und vkrk; option_c Kodierung glkl, ptrv, tgln, tglm und vkrk; option_a Kodierung glkl, tglm, vkrk, tgln und ptrv.
Einschränkungen:
  - behindern: vkrk, != und ptrv
  - behindern: vkrk, > und tgln
  - behindern: glkl, < und tgln
  - behindern: glkl, < und tglm
  - behindern: tgln, < und tglm
  - behindern: vkrk, > und tglm
  - behindern: glkl, != und vkrk
Verfahren:
  - Suche: backtracking, values ascending, anhalten an erster Lösung und kosten werden assignments tried
Variablen:
  - glkl Definitionsbereich 2 und 3
  - vkrk Definitionsbereich 5 und 6
  - tgln Definitionsbereich 1, 3 und 4
  - tglm Definitionsbereich 2, 3, 4 und 5
  - ptrv Definitionsbereich 2 und 3
Was cheapest Kodierung?

О̏дгово̄р ѝзбор: option_a; option_b; option_c; option_d.
Кандѝда̄т: option_d encoding tglm, glkl, ptrv, vkrk и tgln; option_b encoding tglm, ptrv, glkl, tgln и vkrk; option_c encoding glkl, ptrv, tgln, tglm и vkrk; option_a encoding glkl, tglm, vkrk, tgln и ptrv.
Ograničénje:
  - prisiliti: vkrk, != и ptrv
  - prisiliti: vkrk, > и tgln
  - prisiliti: glkl, < и tgln
  - prisiliti: glkl, < и tglm
  - prisiliti: tgln, < и tglm
  - prisiliti: vkrk, > и tglm
  - prisiliti: glkl, != и vkrk
Процеду́ра:
  - по̏трага: backtracking, values ascending, заустављати се at први реше́ње и ко̏штати би̏ти assignments tried
Променљива:
  - glkl domain 2 и 3
  - vkrk domain 5 и 6
  - tgln domain 1, 3 и 4
  - tglm domain 2, 3, 4 и 5
  - ptrv domain 2 и 3
Cheapest encoding kakav?

Vastaus vaihtoehdot: option_a; option_b; option_c; option_d.
Ehdokkaat: option_d koodaus tglm, glkl, ptrv, vkrk ja tgln; option_b koodaus tglm, ptrv, glkl, tgln ja vkrk; option_c koodaus glkl, ptrv, tgln, tglm ja vkrk; option_a koodaus glkl, tglm, vkrk, tgln ja ptrv.
Rajoitukset:
  - pakottaa: vkrk, != ja ptrv
  - pakottaa: vkrk, > ja tgln
  - pakottaa: glkl, < ja tgln
  - pakottaa: glkl, < ja tglm
  - pakottaa: tgln, < ja tglm
  - pakottaa: vkrk, > ja tglm
  - pakottaa: glkl, != ja vkrk
Toimintatapa:
  - etsintä: backtracking, values nouseva, pysähtyä luona ensimmäinen ratkaisu ja maksaa tulla assignments tried
Muuttujat:
  - glkl määrittelyjoukko 2 ja 3
  - vkrk määrittelyjoukko 5 ja 6
  - tgln määrittelyjoukko 1, 3 ja 4
  - tglm määrittelyjoukko 2, 3, 4 ja 5
  - ptrv määrittelyjoukko 2 ja 3
Mikä cheapest koodaus?

备选答案如下：选项A；选项B；选项C；选项D。
候选项如下：选项D的编码是tglm、glkl、ptrv、vkrk和tgln；选项B的编码是tglm、ptrv、glkl、tgln和vkrk；选项C的编码是glkl、ptrv、tgln、tglm和vkrk；选项A的编码是glkl、tglm、vkrk、tgln和ptrv。
约束如下：
  - 约束：vkrk、!=和ptrv
  - 约束：vkrk、>和tgln
  - 约束：glkl、<和tgln
  - 约束：glkl、<和tglm
  - 约束：tgln、<和tglm
  - 约束：vkrk、>和tglm
  - 约束：glkl、!=和vkrk
过程是：
  - 搜索：backtracking、values ascending、stop在第一solution和的成本是是assignmentstried
变量如下：
  - glkl的领域是2和3
  - vkrk的领域是5和6
  - tgln的领域是1、3和4
  - tglm的领域是2、3、4和5
  - ptrv的领域是2和3
cheapest的编码是什么？

答え選択:option_a; option_b; option_c; option_d.
候補者:option_dtglm, glkl, ptrv, vkrkとtglnエンコーディング; option_btglm, ptrv, glkl, tglnとvkrkエンコーディング; option_cglkl, ptrv, tgln, tglmとvkrkエンコーディング; option_aglkl, tglm, vkrk, tglnとptrvエンコーディング.
束縛:
  - constrain:vkrk, !=とptrv
  - constrain:vkrk, >とtgln
  - constrain:glkl, <とtgln
  - constrain:glkl, <とtglm
  - constrain:tgln, <とtglm
  - constrain:vkrk, >とtglm
  - constrain:glkl, !=とvkrk
手段:
  - 検索:backtracking, values ascending, 止まる...で第一解答と費やすれるassignmentstried
変数:
  - glkl2と3定義域
  - vkrk5と6定義域
  - tgln1, 3と4定義域
  - tglm2, 3, 4と5定義域
  - ptrv2と3定義域
cheapestエンコーディング何と?

Answer options: option_a; option_b; option_c; option_d.
Adaylar: option_d tglm, glkl, ptrv, vkrk ve tgln encoding; option_b tglm, ptrv, glkl, tgln ve vkrk encoding; option_c glkl, ptrv, tgln, tglm ve vkrk encoding; option_a glkl, tglm, vkrk, tgln ve ptrv encoding.
Constraints:
  - constrain: vkrk, != ve ptrv
  - constrain: vkrk, > ve tgln
  - constrain: glkl, < ve tgln
  - constrain: glkl, < ve tglm
  - constrain: tgln, < ve tglm
  - constrain: vkrk, > ve tglm
  - constrain: glkl, != ve vkrk
Procedure:
  - arama: backtracking, values ascending, stop at ilk solution ve maliyet assignments tried
Değişkenler:
  - glkl 2 ve 3 domain
  - vkrk 5 ve 6 domain
  - tgln 1, 3 ve 4 domain
  - tglm 2, 3, 4 ve 5 domain
  - ptrv 2 ve 3 domain
Cheapest encoding ne?

answer options: option_a؛ option_b؛ option_c؛ option_d.
مُرَشَّح: تَرْمِيز option_d tglm، glkl، ptrv، vkrk وَـ tgln؛ تَرْمِيز option_b tglm، ptrv، glkl، tgln وَـ vkrk؛ تَرْمِيز option_c glkl، ptrv، tgln، tglm وَـ vkrk؛ تَرْمِيز option_a glkl، tglm، vkrk، tgln وَـ ptrv.
متطلب:
  - constrain: vkrk، != وَـ ptrv
  - constrain: vkrk، > وَـ tgln
  - constrain: glkl، < وَـ tgln
  - constrain: glkl، < وَـ tglm
  - constrain: tgln، < وَـ tglm
  - constrain: vkrk، > وَـ tglm
  - constrain: glkl، != وَـ vkrk
اِجْرَاء:
  - طَلَب: backtracking، values تَصَاعُدِيّ، وَقَفَ عِنْد أَوَّل حَلّ وَـ cost كَانَ assignments tried
مُتَغَيِّر:
  - نِطَاق glkl 2 وَـ 3
  - نِطَاق vkrk 5 وَـ 6
  - نِطَاق tgln 1، 3 وَـ 4
  - نِطَاق tglm 2، 3، 4 وَـ 5
  - نِطَاق ptrv 2 وَـ 3
cheapest تَرْمِيز مَاذَا؟

Პასუხი ვარიანტი: option_a; option_b; option_c; option_d.
Კანდიდატები: option_d tglm, glkl, ptrv, vkrk და tgln encoding; option_b tglm, ptrv, glkl, tgln და vkrk encoding; option_c glkl, ptrv, tgln, tglm და vkrk encoding; option_a glkl, tglm, vkrk, tgln და ptrv encoding.
Constraints:
  - constrain: vkrk, != და ptrv
  - constrain: vkrk, > და tgln
  - constrain: glkl, < და tgln
  - constrain: glkl, < და tglm
  - constrain: tgln, < და tglm
  - constrain: vkrk, > და tglm
  - constrain: glkl, != და vkrk
Პროცედურა:
  - ძებნა: backtracking, values ascending, დადგომა at პირველი ამოხსნა და ღირს ყოფნა assignments tried
Ცვალებადი:
  - glkl 2 და 3 სამფლობელო
  - vkrk 5 და 6 სამფლობელო
  - tgln 1, 3 და 4 სამფლობელო
  - tglm 2, 3, 4 და 5 სამფლობელო
  - ptrv 2 და 3 სამფლობელო
Cheapest encoding რა?

Whakautu kōwhiringa: option_a; option_b; option_c; option_d.
Kaiwhakauru: encoding option_d tglm, glkl, ptrv, vkrk me tgln; encoding option_b tglm, ptrv, glkl, tgln me vkrk; encoding option_c glkl, ptrv, tgln, tglm me vkrk; encoding option_a glkl, tglm, vkrk, tgln me ptrv.
Constraints:
  - whakatina: vkrk, != me ptrv
  - whakatina: vkrk, > me tgln
  - whakatina: glkl, < me tgln
  - whakatina: glkl, < me tglm
  - whakatina: tgln, < me tglm
  - whakatina: vkrk, > me tglm
  - whakatina: glkl, != me vkrk
Pēheatanga:
  - kimihanga: backtracking, values ascending, komutu i tuatahi whakaotinga me cost is assignments tried
Taurangi:
  - whaitua glkl 2 me 3
  - whaitua vkrk 5 me 6
  - whaitua tgln 1, 3 me 4
  - whaitua tglm 2, 3, 4 me 5
  - whaitua ptrv 2 me 3
Cheapest encoding unutai?

Trả lời lựa chọn: option_a; option_b; option_c; option_d.
Candidates: option_d biên mã tglm, glkl, ptrv, vkrk và tgln; option_b biên mã tglm, ptrv, glkl, tgln và vkrk; option_c biên mã glkl, ptrv, tgln, tglm và vkrk; option_a biên mã glkl, tglm, vkrk, tgln và ptrv.
Constraints:
  - constrain: vkrk, != và ptrv
  - constrain: vkrk, > và tgln
  - constrain: glkl, < và tgln
  - constrain: glkl, < và tglm
  - constrain: tgln, < và tglm
  - constrain: vkrk, > và tglm
  - constrain: glkl, != và vkrk
Phương pháp:
  - tìm: backtracking, values ascending, dừng lại lúc thứ nhất lời giải và cost được assignments tried
Biên sô:
  - glkl đất đai 2 và 3
  - vkrk đất đai 5 và 6
  - tgln đất đai 1, 3 và 4
  - tglm đất đai 2, 3, 4 và 5
  - ptrv đất đai 2 và 3
Cheapest biên mã gì?

คำตอบตัวเลือก:option_a; option_b; option_c; option_d.
ผู้สมัคร:option_dencodingtglm, glkl, ptrv, vkrkและtgln; option_bencodingtglm, ptrv, glkl, tglnและvkrk; option_cencodingglkl, ptrv, tgln, tglmและvkrk; option_aencodingglkl, tglm, vkrk, tglnและptrv.
constraints:
  - constrain:vkrk, !=และptrv
  - constrain:vkrk, >และtgln
  - constrain:glkl, <และtgln
  - constrain:glkl, <และtglm
  - constrain:tgln, <และtglm
  - constrain:vkrk, >และtglm
  - constrain:glkl, !=และvkrk
วิธี:
  - การค้นหา:backtracking, values ascending, หยุดที่ที่หนึ่งผลเฉลยและราคาถูกassignmentstried
ตัวแปร:
  - glklเขต2และ3
  - vkrkเขต5และ6
  - tglnเขต1, 3และ4
  - tglmเขต2, 3, 4และ5
  - ptrvเขต2และ3
cheapest encodingอะไร?

answer options: option_a; option_b; option_c; option_d.
வேட்பாளர்: option_d tglm, glkl, ptrv, vkrk மற்றும் tgln encoding; option_b tglm, ptrv, glkl, tgln மற்றும் vkrk encoding; option_c glkl, ptrv, tgln, tglm மற்றும் vkrk encoding; option_a glkl, tglm, vkrk, tgln மற்றும் ptrv encoding.
constraints:
  - constrain: vkrk, != மற்றும் ptrv
  - constrain: vkrk, > மற்றும் tgln
  - constrain: glkl, < மற்றும் tgln
  - constrain: glkl, < மற்றும் tglm
  - constrain: tgln, < மற்றும் tglm
  - constrain: vkrk, > மற்றும் tglm
  - constrain: glkl, != மற்றும் vkrk
procedure:
  - search: backtracking, values ascending, நில் at முதல் solution மற்றும் செலவு படு assignments tried
variables:
  - glkl 2 மற்றும் 3 domain
  - vkrk 5 மற்றும் 6 domain
  - tgln 1, 3 மற்றும் 4 domain
  - tglm 2, 3, 4 மற்றும் 5 domain
  - ptrv 2 மற்றும் 3 domain
cheapest encoding என்ன?

Answer options: option_a; option_b; option_c; option_d.
Wagombea ni: option_d encoding tglm, glkl, ptrv, vkrk na tgln; option_b encoding tglm, ptrv, glkl, tgln na vkrk; option_c encoding glkl, ptrv, tgln, tglm na vkrk; option_a encoding glkl, tglm, vkrk, tgln na ptrv.
Constraints:
  - constrain: vkrk, != na ptrv
  - constrain: vkrk, > na tgln
  - constrain: glkl, < na tgln
  - constrain: glkl, < na tglm
  - constrain: tgln, < na tglm
  - constrain: vkrk, > na tglm
  - constrain: glkl, != na vkrk
Procedure:
  - search: backtracking, values ascending, stop katika kwanza solution na gharimu ni assignments tried
Variables:
  - glkl domain 2 na 3
  - vkrk domain 5 na 6
  - tgln domain 1, 3 na 4
  - tglm domain 2, 3, 4 na 5
  - ptrv domain 2 na 3
Cheapest encoding nini?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d tglm, glkl, ptrv, vkrk dóó tgln encoding; option_b tglm, ptrv, glkl, tgln dóó vkrk encoding; option_c glkl, ptrv, tgln, tglm dóó vkrk encoding; option_a glkl, tglm, vkrk, tgln dóó ptrv encoding.
Constraints:
  - constrain: vkrk, != dóó ptrv
  - constrain: vkrk, > dóó tgln
  - constrain: glkl, < dóó tgln
  - constrain: glkl, < dóó tglm
  - constrain: tgln, < dóó tglm
  - constrain: vkrk, > dóó tglm
  - constrain: glkl, != dóó vkrk
Procedure:
  - search: backtracking, values ascending, stop at łáaʼii góneʼ solution dóó bą́ą́h ílį́ átʼé assignments tried
Variables:
  - glkl 2 dóó 3 domain
  - vkrk 5 dóó 6 domain
  - tgln 1, 3 dóó 4 domain
  - tglm 2, 3, 4 dóó 5 domain
  - ptrv 2 dóó 3 domain
Cheapest encoding haʼátʼíísh?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d tglm, glkl, ptrv, vkrk aamma tgln encoding; option_b tglm, ptrv, glkl, tgln aamma vkrk encoding; option_c glkl, ptrv, tgln, tglm aamma vkrk encoding; option_a glkl, tglm, vkrk, tgln aamma ptrv encoding.
Constraints:
  - constrain: vkrk, != aamma ptrv
  - constrain: vkrk, > aamma tgln
  - constrain: glkl, < aamma tgln
  - constrain: glkl, < aamma tglm
  - constrain: tgln, < aamma tglm
  - constrain: vkrk, > aamma tglm
  - constrain: glkl, != aamma vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution aamma cost a assignments tried
Variables:
  - glkl 2 aamma 3 domain
  - vkrk 5 aamma 6 domain
  - tgln 1, 3 aamma 4 domain
  - tglm 2, 3, 4 aamma 5 domain
  - ptrv 2 aamma 3 domain
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk na tgln; option_b encoding tglm, ptrv, glkl, tgln na vkrk; option_c encoding glkl, ptrv, tgln, tglm na vkrk; option_a encoding glkl, tglm, vkrk, tgln na ptrv.
Constraints:
  - constrain: vkrk, != na ptrv
  - constrain: vkrk, > na tgln
  - constrain: glkl, < na tgln
  - constrain: glkl, < na tglm
  - constrain: tgln, < na tglm
  - constrain: vkrk, > na tglm
  - constrain: glkl, != na vkrk
Procedure:
  - search: backtracking, values ascending, holim long first solution na cost is assignments tried
Variables:
  - glkl domain 2 na 3
  - vkrk domain 5 na 6
  - tgln domain 1, 3 na 4
  - tglm domain 2, 3, 4 na 5
  - ptrv domain 2 na 3
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution cost is assignments tried
Variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
Cheapest encoding kwèch?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk а tgln; option_b encoding tglm, ptrv, glkl, tgln а vkrk; option_c encoding glkl, ptrv, tgln, tglm а vkrk; option_a encoding glkl, tglm, vkrk, tgln а ptrv.
Constraints:
  - constrain: vkrk, != а ptrv
  - constrain: vkrk, > а tgln
  - constrain: glkl, < а tgln
  - constrain: glkl, < а tglm
  - constrain: tgln, < а tglm
  - constrain: vkrk, > а tglm
  - constrain: glkl, != а vkrk
Procedure:
  - search: backtracking, values ascending, сеца at first solution а cost хила assignments tried
Variables:
  - glkl domain 2 а 3
  - vkrk domain 5 а 6
  - tgln domain 1, 3 а 4
  - tglm domain 2, 3, 4 а 5
  - ptrv domain 2 а 3
Cheapest encoding фу?

대답 선택: option_a; option_b; option_c; option_d.
후보자: option_d tglm, glkl, ptrv, vkrk tgln 인코딩; option_b tglm, ptrv, glkl, tgln vkrk 인코딩; option_c glkl, ptrv, tgln, tglm vkrk 인코딩; option_a glkl, tglm, vkrk, tgln ptrv 인코딩.
constraints:
  - 제한: vkrk, != ptrv
  - 제한: vkrk, > tgln
  - 제한: glkl, < tgln
  - 제한: glkl, < tglm
  - 제한: tgln, < tglm
  - 제한: vkrk, > tglm
  - 제한: glkl, != vkrk
절차:
  - 검색: backtracking, values ascending, 그치다 at 첫째 해답 cost is assignments tried
변수:
  - glkl 2 3 정의역
  - vkrk 5 6 정의역
  - tgln 1, 3 4 정의역
  - tglm 2, 3, 4 5 정의역
  - ptrv 2 3 정의역
cheapest 인코딩 무엇?

Erantzun aukerongatik: option_a; option_b; option_c; option_d.
Kandidatu: option_d tglm, glkl, ptrv, vkrk eta tgln encoding; option_b tglm, ptrv, glkl, tgln eta vkrk encoding; option_c glkl, ptrv, tgln, tglm eta vkrk encoding; option_a glkl, tglm, vkrk, tgln eta ptrv encoding.
Constraints:
  - constrain: vkrk, != eta ptrv
  - constrain: vkrk, > eta tgln
  - constrain: glkl, < eta tgln
  - constrain: glkl, < eta tglm
  - constrain: tgln, < eta tglm
  - constrain: vkrk, > eta tglm
  - constrain: glkl, != eta vkrk
Procedure:
  - bilatu: backtracking, values ascending, geltoki at lehenengo solution eta kostatu izan assignments tried
Variables:
  - glkl 2 eta 3 domain
  - vkrk 5 eta 6 domain
  - tgln 1, 3 eta 4 domain
  - tglm 2, 3, 4 eta 5 domain
  - ptrv 2 eta 3 domain
Cheapest encoding zer?

Answer options: option_a; option_b; option_c; option_d.
ᎠᏙᎩᏯᏍᎩ: option_d encoding tglm, glkl, ptrv, vkrk ᎠᎴ tgln; option_b encoding tglm, ptrv, glkl, tgln ᎠᎴ vkrk; option_c encoding glkl, ptrv, tgln, tglm ᎠᎴ vkrk; option_a encoding glkl, tglm, vkrk, tgln ᎠᎴ ptrv.
Constraints:
  - constrain: vkrk, != ᎠᎴ ptrv
  - constrain: vkrk, > ᎠᎴ tgln
  - constrain: glkl, < ᎠᎴ tgln
  - constrain: glkl, < ᎠᎴ tglm
  - constrain: tgln, < ᎠᎴ tglm
  - constrain: vkrk, > ᎠᎴ tglm
  - constrain: glkl, != ᎠᎴ vkrk
Procedure:
  - search: backtracking, values ascending, stop at ᎢᎬᏱᎢ solution ᎠᎴ cost is assignments tried
Variables:
  - glkl domain 2 ᎠᎴ 3
  - vkrk domain 5 ᎠᎴ 6
  - tgln domain 1, 3 ᎠᎴ 4
  - tglm domain 2, 3, 4 ᎠᎴ 5
  - ptrv domain 2 ᎠᎴ 3
What cheapest encoding?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - maskai: backtracking, values ascending, sayay at hukñiqin paska cost tiyay assignments tried
Variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d tglm, glkl, ptrv, vkrk ыкӏи tgln encoding; option_b tglm, ptrv, glkl, tgln ыкӏи vkrk encoding; option_c glkl, ptrv, tgln, tglm ыкӏи vkrk encoding; option_a glkl, tglm, vkrk, tgln ыкӏи ptrv encoding.
Constraints:
  - constrain: vkrk, != ыкӏи ptrv
  - constrain: vkrk, > ыкӏи tgln
  - constrain: glkl, < ыкӏи tgln
  - constrain: glkl, < ыкӏи tglm
  - constrain: tgln, < ыкӏи tglm
  - constrain: vkrk, > ыкӏи tglm
  - constrain: glkl, != ыкӏи vkrk
Procedure:
  - search: backtracking, values ascending, stop at апэрэ solution ыкӏи cost is assignments tried
Variables:
  - glkl 2 ыкӏи 3 domain
  - vkrk 5 ыкӏи 6 domain
  - tgln 1, 3 ыкӏи 4 domain
  - tglm 2, 3, 4 ыкӏи 5 domain
  - ptrv 2 ыкӏи 3 domain
Cheapest encoding сыд?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk thiab tgln; option_b encoding tglm, ptrv, glkl, tgln thiab vkrk; option_c encoding glkl, ptrv, tgln, tglm thiab vkrk; option_a encoding glkl, tglm, vkrk, tgln thiab ptrv.
Constraints:
  - constrain: vkrk, != thiab ptrv
  - constrain: vkrk, > thiab tgln
  - constrain: glkl, < thiab tgln
  - constrain: glkl, < thiab tglm
  - constrain: tgln, < thiab tglm
  - constrain: vkrk, > thiab tglm
  - constrain: glkl, != thiab vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution thiab nqi is assignments tried
Variables:
  - glkl domain 2 thiab 3
  - vkrk domain 5 thiab 6
  - tgln domain 1, 3 thiab 4
  - tglm domain 2, 3, 4 thiab 5
  - ptrv domain 2 thiab 3
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop jeyou first solution cost is assignments tried
Variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
Cheapest encoding ining-jak?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk micha' tgln; option_b encoding tglm, ptrv, glkl, tgln micha' vkrk; option_c encoding glkl, ptrv, tgln, tglm micha' vkrk; option_a encoding glkl, tglm, vkrk, tgln micha' ptrv.
Constraints:
  - constrain: vkrk, != micha' ptrv
  - constrain: vkrk, > micha' tgln
  - constrain: glkl, < micha' tgln
  - constrain: glkl, < micha' tglm
  - constrain: tgln, < micha' tglm
  - constrain: vkrk, > micha' tglm
  - constrain: glkl, != micha' vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution micha' cost is assignments tried
Variables:
  - glkl domain 2 micha' 3
  - vkrk domain 5 micha' 6
  - tgln domain 1, 3 micha' 4
  - tglm domain 2, 3, 4 micha' 5
  - ptrv domain 2 micha' 3
Cheapest encoding nanta?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d tglm, glkl, ptrv, vkrk カ tgln encoding; option_b tglm, ptrv, glkl, tgln カ vkrk encoding; option_c glkl, ptrv, tgln, tglm カ vkrk encoding; option_a glkl, tglm, vkrk, tgln カ ptrv encoding.
Constraints:
  - constrain: vkrk, != カ ptrv
  - constrain: vkrk, > カ tgln
  - constrain: glkl, < カ tgln
  - constrain: glkl, < カ tglm
  - constrain: tgln, < カ tglm
  - constrain: vkrk, > カ tglm
  - constrain: glkl, != カ vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution カ cost is assignments tried
Variables:
  - glkl 2 カ 3 domain
  - vkrk 5 カ 6 domain
  - tgln 1, 3 カ 4 domain
  - tglm 2, 3, 4 カ 5 domain
  - ptrv 2 カ 3 domain
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk ынкъам tgln; option_b encoding tglm, ptrv, glkl, tgln ынкъам vkrk; option_c encoding glkl, ptrv, tgln, tglm ынкъам vkrk; option_a encoding glkl, tglm, vkrk, tgln ынкъам ptrv.
Constraints:
  - constrain: vkrk, != ынкъам ptrv
  - constrain: vkrk, > ынкъам tgln
  - constrain: glkl, < ынкъам tgln
  - constrain: glkl, < ынкъам tglm
  - constrain: tgln, < ынкъам tglm
  - constrain: vkrk, > ынкъам tglm
  - constrain: glkl, != ынкъам vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution ынкъам cost is assignments tried
Variables:
  - glkl domain 2 ынкъам 3
  - vkrk domain 5 ынкъам 6
  - tgln domain 1, 3 ынкъам 4
  - tglm domain 2, 3, 4 ынкъам 5
  - ptrv domain 2 ынкъам 3
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk yéetel tgln; option_b encoding tglm, ptrv, glkl, tgln yéetel vkrk; option_c encoding glkl, ptrv, tgln, tglm yéetel vkrk; option_a encoding glkl, tglm, vkrk, tgln yéetel ptrv.
Constraints:
  - constrain: vkrk, != yéetel ptrv
  - constrain: vkrk, > yéetel tgln
  - constrain: glkl, < yéetel tgln
  - constrain: glkl, < yéetel tglm
  - constrain: tgln, < yéetel tglm
  - constrain: vkrk, > yéetel tglm
  - constrain: glkl, != yéetel vkrk
Procedure:
  - search: backtracking, values ascending, stop at yáax solution yéetel cost yan assignments tried
Variables:
  - glkl domain 2 yéetel 3
  - vkrk domain 5 yéetel 6
  - tgln domain 1, 3 yéetel 4
  - tglm domain 2, 3, 4 yéetel 5
  - ptrv domain 2 yéetel 3
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution cost is assignments tried
Variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
Cheapest encoding híli?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d tglm, glkl, ptrv, vkrk na tgln encoding; option_b tglm, ptrv, glkl, tgln na vkrk encoding; option_c glkl, ptrv, tgln, tglm na vkrk encoding; option_a glkl, tglm, vkrk, tgln na ptrv encoding.
Constraints:
  - constrain: vkrk, != na ptrv
  - constrain: vkrk, > na tgln
  - constrain: glkl, < na tgln
  - constrain: glkl, < na tglm
  - constrain: tgln, < na tglm
  - constrain: vkrk, > na tglm
  - constrain: glkl, != na vkrk
Procedure:
  - search: backtracking, values ascending, stop at t’oka solution na cost is assignments tried
Variables:
  - glkl 2 na 3 domain
  - vkrk 5 na 6 domain
  - tgln 1, 3 na 4 domain
  - tglm 2, 3, 4 na 5 domain
  - ptrv 2 na 3 domain
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at ypy solution cost is assignments tried
Variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d tglm, glkl, ptrv, vkrk tgln encoding; option_b tglm, ptrv, glkl, tgln vkrk encoding; option_c glkl, ptrv, tgln, tglm vkrk encoding; option_a glkl, tglm, vkrk, tgln ptrv encoding.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution cost is assignments tried
Variables:
  - glkl 2 3 domain
  - vkrk 5 6 domain
  - tgln 1, 3 4 domain
  - tglm 2, 3, 4 5 domain
  - ptrv 2 3 domain
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk ǂʻá tgln; option_b encoding tglm, ptrv, glkl, tgln ǂʻá vkrk; option_c encoding glkl, ptrv, tgln, tglm ǂʻá vkrk; option_a encoding glkl, tglm, vkrk, tgln ǂʻá ptrv.
Constraints:
  - constrain: vkrk, != ǂʻá ptrv
  - constrain: vkrk, > ǂʻá tgln
  - constrain: glkl, < ǂʻá tgln
  - constrain: glkl, < ǂʻá tglm
  - constrain: tgln, < ǂʻá tglm
  - constrain: vkrk, > ǂʻá tglm
  - constrain: glkl, != ǂʻá vkrk
Procedure:
  - ǃxáa: backtracking, values ascending, stop at first solution ǂʻá cost ǀîi assignments tried
Variables:
  - glkl domain 2 ǂʻá 3
  - vkrk domain 5 ǂʻá 6
  - tgln domain 1, 3 ǂʻá 4
  - tglm domain 2, 3, 4 ǂʻá 5
  - ptrv domain 2 ǂʻá 3
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d tglm, glkl, ptrv, vkrk tgln encoding; option_b tglm, ptrv, glkl, tgln vkrk encoding; option_c glkl, ptrv, tgln, tglm vkrk encoding; option_a glkl, tglm, vkrk, tgln ptrv encoding.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution cost is assignments tried
Variables:
  - glkl 2 3 domain
  - vkrk 5 6 domain
  - tgln 1, 3 4 domain
  - tglm 2, 3, 4 5 domain
  - ptrv 2 3 domain
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution cost is assignments tried
Variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d tglm, glkl, ptrv, vkrk tgln encoding; option_b tglm, ptrv, glkl, tgln vkrk encoding; option_c glkl, ptrv, tgln, tglm vkrk encoding; option_a glkl, tglm, vkrk, tgln ptrv encoding.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - tēnux: backtracking, values ascending, stop at first solution cost is assignments tried
Variables:
  - glkl 2 3 domain
  - vkrk 5 6 domain
  - tgln 1, 3 4 domain
  - tglm 2, 3, 4 5 domain
  - ptrv 2 3 domain
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution cost is assignments tried
Variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution cost nemi assignments tried
Variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
Cheapest encoding tay?

Réponse choix : option_a ; option_b ; option_c ; option_d.
Les candidats sont : option_d codage tglm, glkl, ptrv, vkrk et tgln ; option_b codage tglm, ptrv, glkl, tgln et vkrk ; option_c codage glkl, ptrv, tgln, tglm et vkrk ; option_a codage glkl, tglm, vkrk, tgln et ptrv.
Contraintes :
  - astreindre: vkrk, != et ptrv
  - astreindre: vkrk, > et tgln
  - astreindre: glkl, < et tgln
  - astreindre: glkl, < et tglm
  - astreindre: tgln, < et tglm
  - astreindre: vkrk, > et tglm
  - astreindre: glkl, != et vkrk
Procédé :
  - recherche: backtracking, values croissant, arrêt à premier solution et coûter être assignments tried
Variables :
  - glkl domaine 2 et 3
  - vkrk domaine 5 et 6
  - tgln domaine 1, 3 et 4
  - tglm domaine 2, 3, 4 et 5
  - ptrv domaine 2 et 3
Quoi cheapest codage ?

Respondo alternativo: option_a; option_b; option_c; option_d.
Kandidato: option_d kodoprezento tglm, glkl, ptrv, vkrk kaj tgln; option_b kodoprezento tglm, ptrv, glkl, tgln kaj vkrk; option_c kodoprezento glkl, ptrv, tgln, tglm kaj vkrk; option_a kodoprezento glkl, tglm, vkrk, tgln kaj ptrv.
Constraints:
  - constrain: vkrk, != kaj ptrv
  - constrain: vkrk, > kaj tgln
  - constrain: glkl, < kaj tgln
  - constrain: glkl, < kaj tglm
  - constrain: tgln, < kaj tglm
  - constrain: vkrk, > kaj tglm
  - constrain: glkl, != kaj vkrk
Procedo:
  - serĉo: backtracking, values ascendanta, halti ĉe unua solvo kaj kosti egali assignments elprovita
Varia:
  - glkl fonta aro 2 kaj 3
  - vkrk fonta aro 5 kaj 6
  - tgln fonta aro 1, 3 kaj 4
  - tglm fonta aro 2, 3, 4 kaj 5
  - ptrv fonta aro 2 kaj 3
Cheapest kodoprezento kio?

Válasz lehetőségek: option_a; option_b; option_c; option_d.
Indulók: option_d encoding tglm, glkl, ptrv, vkrk és tgln; option_b encoding tglm, ptrv, glkl, tgln és vkrk; option_c encoding glkl, ptrv, tgln, tglm és vkrk; option_a encoding glkl, tglm, vkrk, tgln és ptrv.
Constraints:
  - kényszerít: vkrk, != és ptrv
  - kényszerít: vkrk, > és tgln
  - kényszerít: glkl, < és tgln
  - kényszerít: glkl, < és tglm
  - kényszerít: tgln, < és tglm
  - kényszerít: vkrk, > és tglm
  - kényszerít: glkl, != és vkrk
Eljárás:
  - keresés: backtracking, values ascending, megáll at első megoldás és kerül van assignments tried
Változók:
  - glkl értelmezési tartomány 2 és 3
  - vkrk értelmezési tartomány 5 és 6
  - tgln értelmezési tartomány 1, 3 és 4
  - tglm értelmezési tartomány 2, 3, 4 és 5
  - ptrv értelmezési tartomány 2 és 3
Cheapest encoding melyik?

回答選擇:option_a; option_b; option_c; option_d.
候選人:option_dencodingtglm, glkl, ptrv, vkrk及tgln; option_bencodingtglm, ptrv, glkl, tgln及vkrk; option_cencodingglkl, ptrv, tgln, tglm及vkrk; option_aencodingglkl, tglm, vkrk, tgln及ptrv.
constraints:
  - constrain:vkrk, !=及ptrv
  - constrain:vkrk, >及tgln
  - constrain:glkl, <及tgln
  - constrain:glkl, <及tglm
  - constrain:tgln, <及tglm
  - constrain:vkrk, >及tglm
  - constrain:glkl, !=及vkrk
做法:
  - search:backtracking, values ascending, 停喺第一solution及cost是assignmentstried
variables:
  - glkl域2及3
  - vkrk域5及6
  - tgln域1, 3及4
  - tglm域2, 3, 4及5
  - ptrv域2及3
cheapest encoding乜嘢?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk とぅ tgln; option_b encoding tglm, ptrv, glkl, tgln とぅ vkrk; option_c encoding glkl, ptrv, tgln, tglm とぅ vkrk; option_a encoding glkl, tglm, vkrk, tgln とぅ ptrv.
Constraints:
  - constrain: vkrk, != とぅ ptrv
  - constrain: vkrk, > とぅ tgln
  - constrain: glkl, < とぅ tgln
  - constrain: glkl, < とぅ tglm
  - constrain: tgln, < とぅ tglm
  - constrain: vkrk, > とぅ tglm
  - constrain: glkl, != とぅ vkrk
Procedure:
  - search: backtracking, values ascending, stop at 初 solution とぅ cost 有ん assignments tried
Variables:
  - glkl domain 2 とぅ 3
  - vkrk domain 5 とぅ 6
  - tgln domain 1, 3 とぅ 4
  - tglm domain 2, 3, 4 とぅ 5
  - ptrv domain 2 とぅ 3
Cheapest encoding what?

Жауап опцион: option_a; option_b; option_c; option_d.
Үміткер: option_d encoding tglm, glkl, ptrv, vkrk және tgln; option_b encoding tglm, ptrv, glkl, tgln және vkrk; option_c encoding glkl, ptrv, tgln, tglm және vkrk; option_a encoding glkl, tglm, vkrk, tgln және ptrv.
Constraints:
  - constrain: vkrk, != және ptrv
  - constrain: vkrk, > және tgln
  - constrain: glkl, < және tgln
  - constrain: glkl, < және tglm
  - constrain: tgln, < және tglm
  - constrain: vkrk, > және tglm
  - constrain: glkl, != және vkrk
Procedure:
  - ізденіс: backtracking, values ascending, тоқталу at бірінші шығару және тұру is assignments tried
Айнымалы:
  - glkl домен 2 және 3
  - vkrk домен 5 және 6
  - tgln домен 1, 3 және 4
  - tglm домен 2, 3, 4 және 5
  - ptrv домен 2 және 3
Cheapest encoding не?

תְּשׁוּבָה אפשרויות: option_a; option_b; option_c; option_d.
מועמדת: option_d קִידוּד tglm, glkl, ptrv, vkrk וְ־ tgln; option_b קִידוּד tglm, ptrv, glkl, tgln וְ־ vkrk; option_c קִידוּד glkl, ptrv, tgln, tglm וְ־ vkrk; option_a קִידוּד glkl, tglm, vkrk, tgln וְ־ ptrv.
constraints:
  - constrain: vkrk, != וְ־ ptrv
  - constrain: vkrk, > וְ־ tgln
  - constrain: glkl, < וְ־ tgln
  - constrain: glkl, < וְ־ tglm
  - constrain: tgln, < וְ־ tglm
  - constrain: vkrk, > וְ־ tglm
  - constrain: glkl, != וְ־ vkrk
נוהל:
  - search: backtracking, values ascending, עָצַר אֵצֶל רִאשׁוֹן פִּתְרוֹן וְ־ עָלָה הוא assignments tried
מִשְׁתַּנֶּה:
  - glkl תְּחוּם 2 וְ־ 3
  - vkrk תְּחוּם 5 וְ־ 6
  - tgln תְּחוּם 1, 3 וְ־ 4
  - tglm תְּחוּם 2, 3, 4 וְ־ 5
  - ptrv תְּחוּם 2 וְ־ 3
איזה cheapest קִידוּד?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk დო tgln; option_b encoding tglm, ptrv, glkl, tgln დო vkrk; option_c encoding glkl, ptrv, tgln, tglm დო vkrk; option_a encoding glkl, tglm, vkrk, tgln დო ptrv.
Constraints:
  - constrain: vkrk, != დო ptrv
  - constrain: vkrk, > დო tgln
  - constrain: glkl, < დო tgln
  - constrain: glkl, < დო tglm
  - constrain: tgln, < დო tglm
  - constrain: vkrk, > დო tglm
  - constrain: glkl, != დო vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution დო cost is assignments tried
Variables:
  - glkl domain 2 დო 3
  - vkrk domain 5 დო 6
  - tgln domain 1, 3 დო 4
  - tglm domain 2, 3, 4 დო 5
  - ptrv domain 2 დო 3
Cheapest encoding what?

Jawaban pilihan-pilihan: option_a; option_b; option_c; option_d.
Kandidat: option_d encoding tglm, glkl, ptrv, vkrk dan tgln; option_b encoding tglm, ptrv, glkl, tgln dan vkrk; option_c encoding glkl, ptrv, tgln, tglm dan vkrk; option_a encoding glkl, tglm, vkrk, tgln dan ptrv.
Constraints:
  - constrain: vkrk, != dan ptrv
  - constrain: vkrk, > dan tgln
  - constrain: glkl, < dan tgln
  - constrain: glkl, < dan tglm
  - constrain: tgln, < dan tglm
  - constrain: vkrk, > dan tglm
  - constrain: glkl, != dan vkrk
Procedure:
  - mencari: backtracking, values ascending, berhenti at pertama solusi dan menghabiskan biaya berada assignments tried
Variabel:
  - glkl ranah 2 dan 3
  - vkrk ranah 5 dan 6
  - tgln ranah 1, 3 dan 4
  - tglm ranah 2, 3, 4 dan 5
  - ptrv ranah 2 dan 3
Cheapest encoding apa?

ពាក្យឆ្លើយជំរើស:option_a; option_b; option_c; option_d.
បេក្ខជន:option_dencodingtglm, glkl, ptrv, vkrkនឹងtgln; option_bencodingtglm, ptrv, glkl, tglnនឹងvkrk; option_cencodingglkl, ptrv, tgln, tglmនឹងvkrk; option_aencodingglkl, tglm, vkrk, tglnនឹងptrv.
constraints:
  - constrain:vkrk, !=នឹងptrv
  - constrain:vkrk, >នឹងtgln
  - constrain:glkl, <នឹងtgln
  - constrain:glkl, <នឹងtglm
  - constrain:tgln, <នឹងtglm
  - constrain:vkrk, >នឹងtglm
  - constrain:glkl, !=នឹងvkrk
procedure:
  - រកមើល:backtracking, values ascending, ចតatទីមួយដំណោះស្រាយនឹងមានតម្លៃត្រូវបានassignmentstried
អថេរ:
  - glklវិស័យ2នឹង3
  - vkrkវិស័យ5នឹង6
  - tglnវិស័យ1, 3នឹង4
  - tglmវិស័យ2, 3, 4នឹង5
  - ptrvវិស័យ2នឹង3
cheapest encodingអី?

ຄຳຕອບທາງເລືອກ:option_a; option_b; option_c; option_d.
ຜູ້ສະໝັກ:option_dencodingtglm, glkl, ptrv, vkrkແລະtgln; option_bencodingtglm, ptrv, glkl, tglnແລະvkrk; option_cencodingglkl, ptrv, tgln, tglmແລະvkrk; option_aencodingglkl, tglm, vkrk, tglnແລະptrv.
constraints:
  - constrain:vkrk, !=ແລະptrv
  - constrain:vkrk, >ແລະtgln
  - constrain:glkl, <ແລະtgln
  - constrain:glkl, <ແລະtglm
  - constrain:tgln, <ແລະtglm
  - constrain:vkrk, >ແລະtglm
  - constrain:glkl, !=ແລະvkrk
procedure:
  - ຫາ:backtracking, values ascending, ຢຸດທີ່ທີ່ນຶ່ງນ້ຳຢາລະລາຍແລະຄ່າໃຊ້ຈ່າຍຢູ່assignmentstried
ຕົວແປ:
  - glkldomain2ແລະ3
  - vkrkdomain5ແລະ6
  - tglndomain1, 3ແລະ4
  - tglmdomain2, 3, 4ແລະ5
  - ptrvdomain2ແລະ3
cheapest encodingຫຍັງ?

answer options: option_a; option_b; option_c; option_d.
candidates: option_d tglm, glkl, ptrv, vkrk మరియు tgln encoding; option_b tglm, ptrv, glkl, tgln మరియు vkrk encoding; option_c glkl, ptrv, tgln, tglm మరియు vkrk encoding; option_a glkl, tglm, vkrk, tgln మరియు ptrv encoding.
constraints:
  - constrain: vkrk, != మరియు ptrv
  - constrain: vkrk, > మరియు tgln
  - constrain: glkl, < మరియు tgln
  - constrain: glkl, < మరియు tglm
  - constrain: tgln, < మరియు tglm
  - constrain: vkrk, > మరియు tglm
  - constrain: glkl, != మరియు vkrk
procedure:
  - వెతుకు: backtracking, values ascending, ఆగు వద్ద మొదటి పరిష్కారం మరియు cost ఉండు assignments tried
చరరాశి:
  - glkl 2 మరియు 3 domain
  - vkrk 5 మరియు 6 domain
  - tgln 1, 3 మరియు 4 domain
  - tglm 2, 3, 4 మరియు 5 domain
  - ptrv 2 మరియు 3 domain
cheapest encoding ఏమిటి?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at àkọ́kọ́ solution cost wà assignments tried
Variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
What cheapest encoding?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d tglm, glkl, ptrv, vkrk tgln encoding; option_b tglm, ptrv, glkl, tgln vkrk encoding; option_c glkl, ptrv, tgln, tglm vkrk encoding; option_a glkl, tglm, vkrk, tgln ptrv encoding.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution cost naiágúóli assignments tried
Variables:
  - glkl 2 3 domain
  - vkrk 5 6 domain
  - tgln 1, 3 4 domain
  - tglm 2, 3, 4 5 domain
  - ptrv 2 3 domain
Cheapest encoding what?

answer options: option_a; option_b; option_c; option_d.
candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
procedure:
  - search: backtracking, values ascending, stop at first solution cost is assignments tried
variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Waka:
  - search: backtracking, values ascending, stop at first solution cost is assignments tried
Variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d encoding tglm, glkl, ptrv, vkrk tgln; option_b encoding tglm, ptrv, glkl, tgln vkrk; option_c encoding glkl, ptrv, tgln, tglm vkrk; option_a encoding glkl, tglm, vkrk, tgln ptrv.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution cost is assignments tried
Variables:
  - glkl domain 2 3
  - vkrk domain 5 6
  - tgln domain 1, 3 4
  - tglm domain 2, 3, 4 5
  - ptrv domain 2 3
Cheapest encoding what?

Answer options: option_a; option_b; option_c; option_d.
Candidates: option_d tglm, glkl, ptrv, vkrk tgln encoding; option_b tglm, ptrv, glkl, tgln vkrk encoding; option_c glkl, ptrv, tgln, tglm vkrk encoding; option_a glkl, tglm, vkrk, tgln ptrv encoding.
Constraints:
  - constrain: vkrk, != ptrv
  - constrain: vkrk, > tgln
  - constrain: glkl, < tgln
  - constrain: glkl, < tglm
  - constrain: tgln, < tglm
  - constrain: vkrk, > tglm
  - constrain: glkl, != vkrk
Procedure:
  - search: backtracking, values ascending, stop at first solution cost is assignments tried
Variables:
  - glkl 2 3 domain
  - vkrk 5 6 domain
  - tgln 1, 3 4 domain
  - tglm 2, 3, 4 5 domain
  - ptrv 2 3 domain
Cheapest encoding вуч?

The legal answers are: t3; t2; t0; t1.
Source proof: step s0: vudi and goma; step s1: moso and goma; step s2: voda, nebu and s0; step s3: nevu, kodi and s1 and s2.
Target proof: step t3: boro, bepo and t0; step t0: gepo and dike; step t2: teva, siso and t1 and t3; step t1: doki and dike.
What is the corresponding step s0?

Las respuestas válidas son: t3; t2; t0; t1.
La demostración de origen es: paso s0: vudi y goma; paso s1: moso y goma; paso s2: voda, nebu y s0; paso s3: nevu, kodi y s1 y s2.
La demostración de destino es: paso t3: boro, bepo y t0; paso t0: gepo y dike; paso t2: teva, siso y t1 y t3; paso t1: doki y dike.
¿Qué corresponding paso: s0?

备选答案如下：t3；t2；t0；t1。
源证明如下：第s0：vudi和goma；第s1：moso和goma；第s2：voda、nebu和s0；第s3：nevu、kodi和s1和s2。
目标证明如下：第t3：boro、bepo和t0；第t0：gepo和dike；第t2：teva、siso和t1和t3；第t1：doki和dike。
corresponding第：s0什么？

Answer options: t3; t2; t0; t1.
Source proof: adım s0: vudi ve goma; adım s1: moso ve goma; adım s2: voda, nebu ve s0; adım s3: nevu, kodi ve s1 ve s2.
Target proof: adım t3: boro, bepo ve t0; adım t0: gepo ve dike; adım t2: teva, siso ve t1 ve t3; adım t1: doki ve dike.
Corresponding adım: s0 ne?

Answer options: t3; t2; t0; t1.
Source proof: hatua s0: vudi na goma; hatua s1: moso na goma; hatua s2: voda, nebu na s0; hatua s3: nevu, kodi na s1 na s2.
Target proof: hatua t3: boro, bepo na t0; hatua t0: gepo na dike; hatua t2: teva, siso na t1 na t3; hatua t1: doki na dike.
Corresponding hatua: s0 nini?

The legal answers are: t3; t2; t0; t1.
Source proof: step s0: vudi and goma; step s1: moso and goma; step s2: voda, nebu and s0; step s3: nevu, kodi and s1 and s2.
Target proof: step t3: boro, bepo and t0; step t0: gepo and dike; step t2: teva, siso and t1 and t3; step t1: doki and dike.
What is the corresponding step s0?

{answer_options: [t3 t2 t0 t1], query: (corresponding_step s0), source_proof: [(step s0 vudi goma []) (step s1 moso goma []) (step s2 voda nebu [s0]) (step s3 nevu kodi [s1 s2])], target_proof: [(step t3 boro bepo [t0]) (step t0 gepo dike []) (step t2 teva siso [t1 t3]) (step t1 doki dike [])]}

Antwort Alternativen: t3; t2; t0; t1.
Quelle Beweis: Schritt s0: vudi und goma; Schritt s1: moso und goma; Schritt s2: voda, nebu und s0; Schritt s3: nevu, kodi und s1 und s2.
Zielscheibe Beweis: Schritt t3: boro, bepo und t0; Schritt t0: gepo und dike; Schritt t2: teva, siso und t1 und t3; Schritt t1: doki und dike.
Was korrespondierend Schritt s0?

О̏дгово̄р ѝзбор: t3; t2; t0; t1.
Ѝзвор до̏ка̄з: ко̏ра̄к s0: vudi и goma; ко̏ра̄к s1: moso и goma; ко̏ра̄к s2: voda, nebu и s0; ко̏ра̄к s3: nevu, kodi и s1 и s2.
Ме́та до̏ка̄з: ко̏ра̄к t3: boro, bepo и t0; ко̏ра̄к t0: gepo и dike; ко̏ра̄к t2: teva, siso и t1 и t3; ко̏ра̄к t1: doki и dike.
Corresponding ко̏ра̄к s0 kakav?

Vastaus vaihtoehdot: t3; t2; t0; t1.
Source proof: askel s0: vudi ja goma; askel s1: moso ja goma; askel s2: voda, nebu ja s0; askel s3: nevu, kodi ja s1 ja s2.
Target proof: askel t3: boro, bepo ja t0; askel t0: gepo ja dike; askel t2: teva, siso ja t1 ja t3; askel t1: doki ja dike.
Mikä vastaava askel s0?

备选答案如下：t3；t2；t0；t1。
源证明如下：第s0：vudi和goma；第s1：moso和goma；第s2：voda、nebu和s0；第s3：nevu、kodi和s1和s2。
目标证明如下：第t3：boro、bepo和t0；第t0：gepo和dike；第t2：teva、siso和t1和t3；第t1：doki和dike。
corresponding第：s0什么？

答え選択:t3; t2; t0; t1.
源証拠:足取りs0:vudiとgoma; 足取りs1:mosoとgoma; 足取りs2:voda, nebuとs0; 足取りs3:nevu, kodiとs1とs2.
標的証拠:足取りt3:boro, bepoとt0; 足取りt0:gepoとdike; 足取りt2:teva, sisoとt1とt3; 足取りt1:dokiとdike.
corresponding足取り:s0何と?

Answer options: t3; t2; t0; t1.
Source proof: adım s0: vudi ve goma; adım s1: moso ve goma; adım s2: voda, nebu ve s0; adım s3: nevu, kodi ve s1 ve s2.
Target proof: adım t3: boro, bepo ve t0; adım t0: gepo ve dike; adım t2: teva, siso ve t1 ve t3; adım t1: doki ve dike.
Corresponding adım: s0 ne?

answer options: t3؛ t2؛ t0؛ t1.
مَصْدَر بُرْهَان: خُطْوَة s0: vudi وَـ goma؛ خُطْوَة s1: moso وَـ goma؛ خُطْوَة s2: voda، nebu وَـ s0؛ خُطْوَة s3: nevu، kodi وَـ s1 وَـ s2.
دَرِيئَة بُرْهَان: خُطْوَة t3: boro، bepo وَـ t0؛ خُطْوَة t0: gepo وَـ dike؛ خُطْوَة t2: teva، siso وَـ t1 وَـ t3؛ خُطْوَة t1: doki وَـ dike.
corresponding خُطْوَة s0 مَاذَا؟

Პასუხი ვარიანტი: t3; t2; t0; t1.
Source proof: ნაბიჯი s0: vudi და goma; ნაბიჯი s1: moso და goma; ნაბიჯი s2: voda, nebu და s0; ნაბიჯი s3: nevu, kodi და s1 და s2.
Სამიზნე მტკიცებულება: ნაბიჯი t3: boro, bepo და t0; ნაბიჯი t0: gepo და dike; ნაბიჯი t2: teva, siso და t1 და t3; ნაბიჯი t1: doki და dike.
Corresponding ნაბიჯი s0 რა?

Whakautu kōwhiringa: t3; t2; t0; t1.
Pūhanga hāponotanga: kaupeka s0: vudi me goma; kaupeka s1: moso me goma; kaupeka s2: voda, nebu me s0; kaupeka s3: nevu, kodi me s1 me s2.
Target proof: kaupeka t3: boro, bepo me t0; kaupeka t0: gepo me dike; kaupeka t2: teva, siso me t1 me t3; kaupeka t1: doki me dike.
Corresponding kaupeka s0 unutai?

Trả lời lựa chọn: t3; t2; t0; t1.
Nguồn bằng chứng: bước s0: vudi và goma; bước s1: moso và goma; bước s2: voda, nebu và s0; bước s3: nevu, kodi và s1 và s2.
Bia bằng chứng: bước t3: boro, bepo và t0; bước t0: gepo và dike; bước t2: teva, siso và t1 và t3; bước t1: doki và dike.
Corresponding bước s0 gì?

คำตอบตัวเลือก:t3; t2; t0; t1.
source proof:ก้าวs0:vudiและgoma; ก้าวs1:mosoและgoma; ก้าวs2:voda, nebuและs0; ก้าวs3:nevu, kodiและs1และs2.
เป้าหมายการพิสูจน์:ก้าวt3:boro, bepoและt0; ก้าวt0:gepoและdike; ก้าวt2:teva, sisoและt1และt3; ก้าวt1:dokiและdike.
correspondingก้าว:s0อะไร?

answer options: t3; t2; t0; t1.
source proof: step s0: vudi மற்றும் goma; step s1: moso மற்றும் goma; step s2: voda, nebu மற்றும் s0; step s3: nevu, kodi மற்றும் s1 மற்றும் s2.
target proof: step t3: boro, bepo மற்றும் t0; step t0: gepo மற்றும் dike; step t2: teva, siso மற்றும் t1 மற்றும் t3; step t1: doki மற்றும் dike.
corresponding step s0 என்ன?

Answer options: t3; t2; t0; t1.
Source proof: hatua s0: vudi na goma; hatua s1: moso na goma; hatua s2: voda, nebu na s0; hatua s3: nevu, kodi na s1 na s2.
Target proof: hatua t3: boro, bepo na t0; hatua t0: gepo na dike; hatua t2: teva, siso na t1 na t3; hatua t1: doki na dike.
Corresponding hatua: s0 nini?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi dóó goma; step s1: moso dóó goma; step s2: voda, nebu dóó s0; step s3: nevu, kodi dóó s1 dóó s2.
Target proof: step t3: boro, bepo dóó t0; step t0: gepo dóó dike; step t2: teva, siso dóó t1 dóó t3; step t1: doki dóó dike.
Corresponding step s0 haʼátʼíísh?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi aamma goma; step s1: moso aamma goma; step s2: voda, nebu aamma s0; step s3: nevu, kodi aamma s1 aamma s2.
Target proof: step t3: boro, bepo aamma t0; step t0: gepo aamma dike; step t2: teva, siso aamma t1 aamma t3; step t1: doki aamma dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi na goma; step s1: moso na goma; step s2: voda, nebu na s0; step s3: nevu, kodi na s1 na s2.
Target proof: step t3: boro, bepo na t0; step t0: gepo na dike; step t2: teva, siso na t1 na t3; step t1: doki na dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 kwèch?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi а goma; step s1: moso а goma; step s2: voda, nebu а s0; step s3: nevu, kodi а s1 а s2.
Target proof: step t3: boro, bepo а t0; step t0: gepo а dike; step t2: teva, siso а t1 а t3; step t1: doki а dike.
Corresponding step s0 фу?

대답 선택: t3; t2; t0; t1.
출처 증거: 걸음 s0: vudi goma; 걸음 s1: moso goma; 걸음 s2: voda, nebu s0; 걸음 s3: nevu, kodi s1 s2.
과녁 증거: 걸음 t3: boro, bepo t0; 걸음 t0: gepo dike; 걸음 t2: teva, siso t1 t3; 걸음 t1: doki dike.
corresponding 걸음 s0 무엇?

Erantzun aukerongatik: t3; t2; t0; t1.
Source proof: urrats s0: vudi eta goma; urrats s1: moso eta goma; urrats s2: voda, nebu eta s0; urrats s3: nevu, kodi eta s1 eta s2.
Target proof: urrats t3: boro, bepo eta t0; urrats t0: gepo eta dike; urrats t2: teva, siso eta t1 eta t3; urrats t1: doki eta dike.
Corresponding urrats s0 zer?

Answer options: t3; t2; t0; t1.
Source proof: ᎠᎩᏠᏒᏍᏗᎢ s0: vudi ᎠᎴ goma; ᎠᎩᏠᏒᏍᏗᎢ s1: moso ᎠᎴ goma; ᎠᎩᏠᏒᏍᏗᎢ s2: voda, nebu ᎠᎴ s0; ᎠᎩᏠᏒᏍᏗᎢ s3: nevu, kodi ᎠᎴ s1 ᎠᎴ s2.
Target proof: ᎠᎩᏠᏒᏍᏗᎢ t3: boro, bepo ᎠᎴ t0; ᎠᎩᏠᏒᏍᏗᎢ t0: gepo ᎠᎴ dike; ᎠᎩᏠᏒᏍᏗᎢ t2: teva, siso ᎠᎴ t1 ᎠᎴ t3; ᎠᎩᏠᏒᏍᏗᎢ t1: doki ᎠᎴ dike.
What corresponding ᎠᎩᏠᏒᏍᏗᎢ s0?

Answer options: t3; t2; t0; t1.
Source proof: thatki s0: vudi goma; thatki s1: moso goma; thatki s2: voda, nebu s0; thatki s3: nevu, kodi s1 s2.
Target proof: thatki t3: boro, bepo t0; thatki t0: gepo dike; thatki t2: teva, siso t1 t3; thatki t1: doki dike.
Corresponding thatki s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi ыкӏи goma; step s1: moso ыкӏи goma; step s2: voda, nebu ыкӏи s0; step s3: nevu, kodi ыкӏи s1 ыкӏи s2.
Target proof: step t3: boro, bepo ыкӏи t0; step t0: gepo ыкӏи dike; step t2: teva, siso ыкӏи t1 ыкӏи t3; step t1: doki ыкӏи dike.
Corresponding step s0 сыд?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi thiab goma; step s1: moso thiab goma; step s2: voda, nebu thiab s0; step s3: nevu, kodi thiab s1 thiab s2.
Target proof: step t3: boro, bepo thiab t0; step t0: gepo thiab dike; step t2: teva, siso thiab t1 thiab t3; step t1: doki thiab dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 ining-jak?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi micha' goma; step s1: moso micha' goma; step s2: voda, nebu micha' s0; step s3: nevu, kodi micha' s1 micha' s2.
Target proof: step t3: boro, bepo micha' t0; step t0: gepo micha' dike; step t2: teva, siso micha' t1 micha' t3; step t1: doki micha' dike.
Corresponding step s0 nanta?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi カ goma; step s1: moso カ goma; step s2: voda, nebu カ s0; step s3: nevu, kodi カ s1 カ s2.
Target proof: step t3: boro, bepo カ t0; step t0: gepo カ dike; step t2: teva, siso カ t1 カ t3; step t1: doki カ dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi ынкъам goma; step s1: moso ынкъам goma; step s2: voda, nebu ынкъам s0; step s3: nevu, kodi ынкъам s1 ынкъам s2.
Target proof: step t3: boro, bepo ынкъам t0; step t0: gepo ынкъам dike; step t2: teva, siso ынкъам t1 ынкъам t3; step t1: doki ынкъам dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi yéetel goma; step s1: moso yéetel goma; step s2: voda, nebu yéetel s0; step s3: nevu, kodi yéetel s1 yéetel s2.
Target proof: step t3: boro, bepo yéetel t0; step t0: gepo yéetel dike; step t2: teva, siso yéetel t1 yéetel t3; step t1: doki yéetel dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 híli?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi na goma; step s1: moso na goma; step s2: voda, nebu na s0; step s3: nevu, kodi na s1 na s2.
Target proof: step t3: boro, bepo na t0; step t0: gepo na dike; step t2: teva, siso na t1 na t3; step t1: doki na dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi ǂʻá goma; step s1: moso ǂʻá goma; step s2: voda, nebu ǂʻá s0; step s3: nevu, kodi ǂʻá s1 ǂʻá s2.
Target proof: step t3: boro, bepo ǂʻá t0; step t0: gepo ǂʻá dike; step t2: teva, siso ǂʻá t1 ǂʻá t3; step t1: doki ǂʻá dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 tay?

Réponse choix : t3 ; t2 ; t0 ; t1.
Source proof : pas s0 : vudi et goma ; pas s1 : moso et goma ; pas s2 : voda, nebu et s0 ; pas s3 : nevu, kodi et s1 et s2.
Cible preuve : pas t3 : boro, bepo et t0 ; pas t0 : gepo et dike ; pas t2 : teva, siso et t1 et t3 ; pas t1 : doki et dike.
Quoi correspondant pas s0 ?

Respondo alternativo: t3; t2; t0; t1.
Fonto pruvo: paŝado s0: vudi kaj goma; paŝado s1: moso kaj goma; paŝado s2: voda, nebu kaj s0; paŝado s3: nevu, kodi kaj s1 kaj s2.
Celtabulo pruvo: paŝado t3: boro, bepo kaj t0; paŝado t0: gepo kaj dike; paŝado t2: teva, siso kaj t1 kaj t3; paŝado t1: doki kaj dike.
Respondanta paŝado s0 kio?

Válasz lehetőségek: t3; t2; t0; t1.
Forrás bizonyítás: lépés s0: vudi és goma; lépés s1: moso és goma; lépés s2: voda, nebu és s0; lépés s3: nevu, kodi és s1 és s2.
Céltábla bizonyítás: lépés t3: boro, bepo és t0; lépés t0: gepo és dike; lépés t2: teva, siso és t1 és t3; lépés t1: doki és dike.
Megfelelő lépés s0 melyik?

回答選擇:t3; t2; t0; t1.
source proof:steps0:vudi及goma; steps1:moso及goma; steps2:voda, nebu及s0; steps3:nevu, kodi及s1及s2.
target proof:stept3:boro, bepo及t0; stept0:gepo及dike; stept2:teva, siso及t1及t3; stept1:doki及dike.
corresponding step:s0乜嘢?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi とぅ goma; step s1: moso とぅ goma; step s2: voda, nebu とぅ s0; step s3: nevu, kodi とぅ s1 とぅ s2.
Target proof: step t3: boro, bepo とぅ t0; step t0: gepo とぅ dike; step t2: teva, siso とぅ t1 とぅ t3; step t1: doki とぅ dike.
Corresponding step s0 what?

Жауап опцион: t3; t2; t0; t1.
Қайнар дәлел: қадам s0: vudi және goma; қадам s1: moso және goma; қадам s2: voda, nebu және s0; қадам s3: nevu, kodi және s1 және s2.
Нысана дәлел: қадам t3: boro, bepo және t0; қадам t0: gepo және dike; қадам t2: teva, siso және t1 және t3; қадам t1: doki және dike.
Corresponding қадам s0 не?

תְּשׁוּבָה אפשרויות: t3; t2; t0; t1.
מָקוֹר הוֹכָחָה: צַעַד s0: vudi וְ־ goma; צַעַד s1: moso וְ־ goma; צַעַד s2: voda, nebu וְ־ s0; צַעַד s3: nevu, kodi וְ־ s1 וְ־ s2.
מַטָּרָה הוֹכָחָה: צַעַד t3: boro, bepo וְ־ t0; צַעַד t0: gepo וְ־ dike; צַעַד t2: teva, siso וְ־ t1 וְ־ t3; צַעַד t1: doki וְ־ dike.
איזה corresponding צַעַד s0?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi დო goma; step s1: moso დო goma; step s2: voda, nebu დო s0; step s3: nevu, kodi დო s1 დო s2.
Target proof: step t3: boro, bepo დო t0; step t0: gepo დო dike; step t2: teva, siso დო t1 დო t3; step t1: doki დო dike.
Corresponding step s0 what?

Jawaban pilihan-pilihan: t3; t2; t0; t1.
Source proof: langkah s0: vudi dan goma; langkah s1: moso dan goma; langkah s2: voda, nebu dan s0; langkah s3: nevu, kodi dan s1 dan s2.
Target proof: langkah t3: boro, bepo dan t0; langkah t0: gepo dan dike; langkah t2: teva, siso dan t1 dan t3; langkah t1: doki dan dike.
Corresponding langkah s0 apa?

ពាក្យឆ្លើយជំរើស:t3; t2; t0; t1.
source proof:ជំហានs0:vudiនឹងgoma; ជំហានs1:mosoនឹងgoma; ជំហានs2:voda, nebuនឹងs0; ជំហានs3:nevu, kodiនឹងs1នឹងs2.
ស៊ីបភស្តុតាង:ជំហានt3:boro, bepoនឹងt0; ជំហានt0:gepoនឹងdike; ជំហានt2:teva, sisoនឹងt1នឹងt3; ជំហានt1:dokiនឹងdike.
correspondingជំហាន:s0អី?

ຄຳຕອບທາງເລືອກ:t3; t2; t0; t1.
source proof:ກ້າວs0:vudiແລະgoma; ກ້າວs1:mosoແລະgoma; ກ້າວs2:voda, nebuແລະs0; ກ້າວs3:nevu, kodiແລະs1ແລະs2.
target proof:ກ້າວt3:boro, bepoແລະt0; ກ້າວt0:gepoແລະdike; ກ້າວt2:teva, sisoແລະt1ແລະt3; ກ້າວt1:dokiແລະdike.
correspondingກ້າວ:s0ຫຍັງ?

answer options: t3; t2; t0; t1.
source proof: step s0: vudi మరియు goma; step s1: moso మరియు goma; step s2: voda, nebu మరియు s0; step s3: nevu, kodi మరియు s1 మరియు s2.
target proof: step t3: boro, bepo మరియు t0; step t0: gepo మరియు dike; step t2: teva, siso మరియు t1 మరియు t3; step t1: doki మరియు dike.
corresponding step s0 ఏమిటి?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
What corresponding step s0?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 what?

answer options: t3; t2; t0; t1.
source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 what?

Answer options: t3; t2; t0; t1.
Source proof: step s0: vudi goma; step s1: moso goma; step s2: voda, nebu s0; step s3: nevu, kodi s1 s2.
Target proof: step t3: boro, bepo t0; step t0: gepo dike; step t2: teva, siso t1 t3; step t1: doki dike.
Corresponding step s0 вуч?

The legal answers are: yes; no.
The entities are: vkg; klt; mrg.
What happened before: merge: 1, vkg, klt and vrd; 2 replace part mrg; rename: 3, vrd and gsp; 4 replace part gsp.
The rules are: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Does same entity: at start mrg and at end mrg?

Las respuestas válidas son: sí; no.
Las entidades son: vkg; klt; mrg.
Lo que ocurrió antes: fusiona con: 1, vkg, klt y vrd; 2 sustituye la parte mrg; renombra: 3, vrd y gsp; 4 sustituye la parte gsp.
Las reglas son: rename la regla conserva identity; replaced parts allowed la regla 1; merge la regla creates new identity; split la regla larger fragment keeps identity.
¿Same la entidad: en el inicio: mrg y en end: mrg?

备选答案如下：是；否。
实体如下：vkg；klt；mrg。
历史记录如下：合并为：1、vkg、klt和vrd；2替换的部分是mrg；重命名为：3、vrd和gsp；4替换的部分是gsp。
规则如下：rename的规则是保持identity；replaced parts allowed的规则是1；merge的规则是creates new identity；split的规则是larger fragment keeps identity。
same的实体是：在的起点：mrg和在end：mrg吗？

Answer options: evet; hayır.
Varlıklar: vkg; klt; mrg.
Daha önce olanlar: merge: 1, vkg, klt ve vrd; 2 mrg replace part; rename: 3, vrd ve gsp; 4 gsp replace part.
Kurallar: rename preserves identity kural; replaced parts allowed 1 kural; merge creates new identity kural; split larger fragment keeps identity kural.
Aynı entity: at start: mrg ve at end: mrg mi?

Answer options: ndiyo; hapana.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt na vrd; 2 replace part mrg; rename: 3, vrd na gsp; 4 replace part gsp.
Sheria ni: rename sheria preserves identity; replaced parts allowed sheria 1; merge sheria creates new identity; split sheria larger fragment keeps identity.
Sawa entity: katika start: mrg na katika end: mrg je?

The legal answers are: yes; no.
The entities are: vkg; klt; mrg.
What happened before: merge: 1, vkg, klt and vrd; 2 replace part mrg; rename: 3, vrd and gsp; 4 replace part gsp.
The rules are: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Does same entity: at start mrg and at end mrg?

{answer_options: [yes no], entities: [vkg klt mrg], history: [(merge 1 vkg klt vrd) (replace_part 2 mrg) (rename 3 vrd gsp) (replace_part 4 gsp)], query: (same_entity (at_start mrg) (at_end mrg)), rules: [(rule rename (preserves_identity)) (rule (replaced_parts_allowed) 1) (rule merge (creates_new_identity)) (rule split (larger_fragment_keeps_identity))]}

Antwort Alternativen: ja; nein.
Die Entitäten sind: vkg; klt; mrg.
Geschichte: zusammenlegen: 1, vkg, klt und vrd; 2 ersetzen Teil mrg; umbenennen: 3, vrd und gsp; 4 ersetzen Teil gsp.
Die Regeln sind: rename regieren preserves Identität; replaced parts erlaubt regieren 1; merge regieren creates neu Identität; split regieren larger Fragment keeps Identität.
Selbe Wesen: an Beginn mrg und an Ende mrg?

О̏дгово̄р ѝзбор: да; no.
Ентѝте̄т: vkg; klt; mrg.
Хѝсто̄рија: merge: 1, vkg, klt и vrd; 2 zamijeniti део m/дио mrg; rename: 3, vrd и gsp; 4 zamijeniti део m/дио gsp.
Пра̏вило: rename у̀прављати preserves идентѝте̄т; replaced parts allowed у̀прављати 1; merge у̀прављати creates но̏в идентѝте̄т; split у̀прављати larger фра̀гмент keeps идентѝте̄т.
И̏стӣ ентѝте̄т: at почетак mrg и at крај mrg?

Vastaus vaihtoehdot: kyllä; ei.
Olennot: vkg; klt; mrg.
Historia: yhdistää: 1, vkg, klt ja vrd; 2 korvata osa mrg; nimetä uudelleen: 3, vrd ja gsp; 4 korvata osa gsp.
Säännöt: rename säännellä preserves yhtäläisyys; replaced parts allowed säännellä 1; merge säännellä creates uusi yhtäläisyys; split säännellä larger sirpale keeps yhtäläisyys.
Sama olento: luona alku mrg ja luona pää mrg?

备选答案如下：是；否。
实体如下：vkg；klt；mrg。
历史记录如下：合并为：1、vkg、klt和vrd；2替换的部分是mrg；重命名为：3、vrd和gsp；4替换的部分是gsp。
规则如下：rename的规则是保持identity；replaced parts allowed的规则是1；merge的规则是creates new identity；split的规则是larger fragment keeps identity。
same的实体是：在的起点：mrg和在end：mrg吗？

答え選択:はい; いいえ.
実体:vkg; klt; mrg.
歴史:合わせる:1, vkg, kltとvrd; 2mrg取り換える一部; 改名する:3, vrdとgsp; 4gsp取り換える一部.
規則:renamepreserves同一治める; replacedparts許可された1治める; mergecreates新しい同一治める; splitlarger断片keeps同一治める.
同じ実体:...で開始:mrgと...で終了:mrg?

Answer options: evet; hayır.
Varlıklar: vkg; klt; mrg.
Daha önce olanlar: merge: 1, vkg, klt ve vrd; 2 mrg replace part; rename: 3, vrd ve gsp; 4 gsp replace part.
Kurallar: rename preserves identity kural; replaced parts allowed 1 kural; merge creates new identity kural; split larger fragment keeps identity kural.
Aynı entity: at start: mrg ve at end: mrg mi?

answer options: نَعَم؛ no.
كِيَان: vkg؛ klt؛ mrg.
تَارِيخ: دَمَجَ: 1، vkg، klt وَـ vrd؛ اِسْتَبْدَلَ جُزْء 2 mrg؛ rename: 3، vrd وَـ gsp؛ اِسْتَبْدَلَ جُزْء 4 gsp.
قَانُون: حَكَمَ rename preserves مُطَابَقَة؛ حَكَمَ replaced parts مَسْمُوح 1؛ حَكَمَ merge creates جَدِيد مُطَابَقَة؛ حَكَمَ split larger قِطْعَة keeps مُطَابَقَة.
نَفْسَهُ كِيَان: عِنْد نَجْمَة mrg وَـ عِنْد نِهَايَة mrg؟

Პასუხი ვარიანტი: დიახ; no.
Არსებები: vkg; klt; mrg.
Ისტორია: merge: 1, vkg, klt და vrd; 2 mrg გამოცვლის ნაწილი; rename: 3, vrd და gsp; 4 gsp გამოცვლის ნაწილი.
Წესი: rename preserves იდენტურობა ასწორებს; replaced parts allowed 1 ასწორებს; merge creates ახალი იდენტურობა ასწორებს; split larger fragment keeps იდენტურობა ასწორებს.
Იგივე არსება: at დასაწყისი mrg და at დასასრული mrg?

Whakautu kōwhiringa: āe; kāo.
Hinonga: vkg; klt; mrg.
Hītori: whakahanumi: 1, vkg, klt me vrd; whakakapi wāhanga 2 mrg; rename: 3, vrd me gsp; whakakapi wāhanga 4 gsp.
Rekureihana: rekureihana rename preserves tuakiri; rekureihana replaced parts allowed 1; rekureihana merge creates hōu tuakiri; rekureihana split larger mōrohe keeps tuakiri.
Rite hinonga: i tīmatanga mrg me i hikutau mrg?

Trả lời lựa chọn: vâng; no.
Entities: vkg; klt; mrg.
Lịch sử: kết hợp: 1, vkg, klt và vrd; 2 thay thế phần mrg; rename: 3, vrd và gsp; 4 thay thế phần gsp.
Quy tắc: rename quy tắc preserves cá tính; replaced parts allowed quy tắc 1; merge quy tắc creates mới cá tính; split quy tắc larger fragment keeps cá tính.
Giống nhau entity: lúc bắt đầu mrg và lúc chóp mrg?

คำตอบตัวเลือก:ใช่; ไฮ้.
entities:vkg; klt; mrg.
ประวัติศาสตร์:merge:1, vkg, kltและvrd; 2เปลี่ยนท่อนmrg; rename:3, vrdและgsp; 4เปลี่ยนท่อนgsp.
กฎ:renameกฎpreservesเอกลักษณ์; replaced parts allowedกฎ1; mergeกฎcreatesใหม่เอกลักษณ์; splitกฎlargerfragmentkeepsเอกลักษณ์.
เหมือนentity:ที่เริ่ม:mrgและที่จบ:mrg?

answer options: ஆம்; no.
entities: vkg; klt; mrg.
வரலாறு: இணை: 1, vkg, klt மற்றும் vrd; 2 mrg replace பகுதி; rename: 3, vrd மற்றும் gsp; 4 gsp replace பகுதி.
rules: rename preserves identity rule; replaced parts allowed 1 rule; merge creates புதிய identity rule; split larger fragment keeps identity rule.
same entity: at தொடக்கம் mrg மற்றும் at முடி mrg?

Answer options: ndiyo; hapana.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt na vrd; 2 replace part mrg; rename: 3, vrd na gsp; 4 replace part gsp.
Sheria ni: rename sheria preserves identity; replaced parts allowed sheria 1; merge sheria creates new identity; split sheria larger fragment keeps identity.
Sawa entity: katika start: mrg na katika end: mrg je?

Answer options: aooʼ; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt dóó vrd; 2 mrg replace part; rename: 3, vrd dóó gsp; 4 gsp replace part.
Bee hazʼáanii: rename preserves identity bee hazʼáanii; replaced parts allowed 1 bee hazʼáanii; merge creates ániid identity bee hazʼáanii; split larger fragment keeps identity bee hazʼáanii.
Same entity: at start mrg dóó at end mrg?

Answer options: aap; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt aamma vrd; 2 mrg replace part; rename: 3, vrd aamma gsp; 4 gsp replace part.
Rules: rename preserves identity rule; replaced parts allowed 1 rule; merge creates new identity rule; split larger fragment keeps identity rule.
Same entity: at start mrg aamma at end mrg?

Answer options: ya; no.
Entities: vkg; klt; mrg.
Histori: merge: 1, vkg, klt na vrd; 2 replace hap mrg; rename: 3, vrd na gsp; 4 replace hap gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Same entity: long start mrg na long end mrg?

Answer options: yes; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt vrd; 2 replace part mrg; rename: 3, vrd gsp; 4 replace part gsp.
Nikanixi: rename nikanixi preserves identity; replaced parts allowed nikanixi 1; merge nikanixi creates new identity; split nikanixi larger fragment keeps identity.
Same entity: at start mrg at end mrg?

Answer options: yes; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt а vrd; 2 replace part mrg; rename: 3, vrd а gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates керда identity; split rule larger fragment keeps identity.
Same entity: at start mrg а at end mrg?

대답 선택: 네; 아니요.
실재: vkg; klt; mrg.
역사: 합하다: 1, vkg, klt vrd; 2 mrg 교체하다 부분; 개명하다: 3, vrd gsp; 4 gsp 교체하다 부분.
규칙: rename preserves 동일함 통치하다; replaced parts allowed 1 통치하다; merge creates 새롭다 동일함 통치하다; split larger 조각 keeps 동일함 통치하다.
똑같다 실재: at 처음 mrg at 끝 mrg?

Erantzun aukerongatik: bai; no.
Entities: vkg; klt; mrg.
Historia: merge: 1, vkg, klt eta vrd; 2 mrg replace lain; rename: 3, vrd eta gsp; 4 gsp replace lain.
Arau: rename preserves nortasuna arau; replaced parts allowed 1 arau; merge creates berri nortasuna arau; split larger fragment keeps nortasuna arau.
Bera entity: at start mrg eta at amai mrg?

Answer options: ᎥᎥ; ᏝᏃ.
Entities: vkg; klt; mrg.
ᎧᏃᎮᏍᎩ: merge: 1, vkg, klt ᎠᎴ vrd; 2 replace part mrg; rename: 3, vrd ᎠᎴ gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates ᎢᏤᎢ identity; split rule larger fragment keeps identity.
Same entity: at ᎠᏓᎴᏂᎭ mrg ᎠᎴ at ᎠᎵᏍᏆᏗᎠ mrg?

Answer options: arí; mánan.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt vrd; 2 replace part mrg; rename: 3, vrd gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates musog identity; split rule larger fragment keeps identity.
Same entity: at start mrg at usay mrg?

Answer options: yes; no.
Entities: vkg; klt; mrg.
Тарихъ: merge: 1, vkg, klt ыкӏи vrd; 2 mrg replace ӏыхьэ; rename: 3, vrd ыкӏи gsp; 4 gsp replace ӏыхьэ.
Rules: rename preserves identity rule; replaced parts allowed 1 rule; merge creates new identity rule; split larger fragment keeps identity rule.
Same entity: at start mrg ыкӏи at end mrg?

Answer options: yes; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt thiab vrd; 2 replace part mrg; rename: 3, vrd thiab gsp; 4 replace part gsp.
Cai: rename cai preserves identity; replaced parts allowed cai 1; merge cai creates new identity; split cai larger fragment keeps identity.
Same entity: at start mrg thiab at end mrg?

Answer options: ngai; woi.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt vrd; 2 replace part mrg; rename: 3, vrd gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Same entity: jeyou start mrg jeyou end mrg?

Answer options: i̠i; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt micha' vrd; 2 replace part mrg; rename: 3, vrd micha' gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Same entity: at malichi mrg micha' at end mrg?

Answer options: yes; ソモ.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt カ vrd; 2 mrg replace part; rename: 3, vrd カ gsp; 4 gsp replace part.
Rules: rename preserves identity rule; replaced parts allowed 1 rule; merge creates アシㇼ identity rule; split larger fragment keeps identity rule.
Same entity: at start mrg カ at end mrg?

Answer options: yes; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt ынкъам vrd; 2 replace part mrg; rename: 3, vrd ынкъам gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Same entity: at start mrg ынкъам at end mrg?

Answer options: yes; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt yéetel vrd; 2 replace part mrg; rename: 3, vrd yéetel gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Same entity: at start mrg yéetel at end mrg?

Answer options: hą; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt vrd; 2 replace part mrg; rename: 3, vrd gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Same entity: at start mrg at end mrg?

Answer options: yes; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt na vrd; 2 mrg replace part; rename: 3, vrd na gsp; 4 gsp replace part.
Rules: rename preserves identity rule; replaced parts allowed 1 rule; merge creates new identity rule; split larger fragment keeps identity rule.
Same entity: at start mrg na at end mrg?

Answer options: heẽ; nahániri.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt vrd; 2 replace vore mrg; rename: 3, vrd gsp; 4 replace vore gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Same entity: at start mrg at end mrg?

Answer options: jisa; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt vrd; 2 mrg replace part; rename: 3, vrd gsp; 4 gsp replace part.
Rules: rename preserves identity rule; replaced parts allowed 1 rule; merge creates new identity rule; split larger fragment keeps identity rule.
Same entity: at start mrg at end mrg?

Answer options: ʻée; ʻĩĩ.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt ǂʻá vrd; 2 replace part mrg; rename: 3, vrd ǂʻá gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Same entity: at start mrg ǂʻá at end mrg?

Answer options: yes; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt vrd; 2 mrg replace part; rename: 3, vrd gsp; 4 gsp replace part.
Rules: rename preserves identity rule; replaced parts allowed 1 rule; merge creates чуз identity rule; split larger fragment keeps identity rule.
Same entity: at start mrg at end mrg?

Answer options: yes; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt vrd; 2 replace part mrg; rename: 3, vrd gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Same entity: at start mrg at end mrg?

Answer options: yes; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt vrd; 2 mrg replace part; rename: 3, vrd gsp; 4 gsp replace part.
Rules: rename preserves identity rule; replaced parts allowed 1 rule; merge creates yarma identity rule; split larger fragment keeps identity rule.
Same entity: at start mrg at end mrg?

Answer options: ee; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt vrd; 2 replace part mrg; rename: 3, vrd gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Same entity: at start mrg at end mrg?

Answer options: yes; inte.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt vrd; 2 replace part mrg; rename: 3, vrd gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates new identity; split rule larger fragment keeps identity.
Sēsan entity: at start mrg at end mrg?

Réponse choix : oui ; no.
Les entités sont : vkg ; klt ; mrg.
Histoire : fusionner : 1, vkg, klt et vrd ; 2 remplacer partie mrg ; renommer : 3, vrd et gsp ; 4 remplacer partie gsp.
Les règles sont : rename gouverner preserves identité ; replaced parts permis gouverner 1 ; merge gouverner creates nouveau identité ; split gouverner larger fragment keeps identité.
Même entité : à départ mrg et à fin mrg ?

Respondo alternativo: jes; no.
Ento: vkg; klt; mrg.
Historio: kunfandiĝi: 1, vkg, klt kaj vrd; 2 anstataŭigi parto mrg; renomi: 3, vrd kaj gsp; 4 anstataŭigi parto gsp.
Regulo: rename regi preserves identity; replaced parts allowed regi 1; merge regi creates nova identity; split regi larger fragmento keeps identity.
Sama ento: ĉe eko mrg kaj ĉe fino mrg?

Válasz lehetőségek: igen; no.
Entities: vkg; klt; mrg.
Történelem: egyesít: 1, vkg, klt és vrd; 2 kicserél rész mrg; átnevez: 3, vrd és gsp; 4 kicserél rész gsp.
Szabályok: rename ural preserves azonosság; replaced parts megengedett ural 1; merge ural creates új azonosság; split ural larger töredék keeps azonosság.
Ugyanaz entity: at kezdet mrg és at vég mrg?

回答選擇:係; no.
entities:vkg; klt; mrg.
歷史:merge:1, vkg, klt及vrd; 2replace部分mrg; rename:3, vrd及gsp; 4replace部分gsp.
rules:renamerulepreserves identity; replaced parts allowedrule1; mergerulecreates新identity; splitrulelarger fragment keeps identity.
同一entity:喺開始:mrg及喺end:mrg?

Answer options: yes; no.
Entities: vkg; klt; mrg.
History: merge: 1, vkg, klt とぅ vrd; 2 replace part mrg; rename: 3, vrd とぅ gsp; 4 replace part gsp.
Rules: rename rule preserves identity; replaced parts allowed rule 1; merge rule creates 新ーさん identity; split rule larger fragment keeps identity.
Same entity: at start mrg とぅ at end mrg?

Жауап опцион: иә; жоқ.
Entities: vkg; klt; mrg.
Тарих: merge: 1, vkg, klt және vrd; 2 replace бөлік mrg; rename: 3, vrd және gsp; 4 replace бөлік gsp.
Ереже: rename ереже preserves даралық; replaced parts allowed ереже 1; merge ереже creates жаңа даралық; split ереже larger фрагмент keeps даралық.
Same entity: at бас mrg және at end mrg?