Exam question 1 · Olympiad: claims, clues and tricky messages ★★★
It is given that one program asserts a statement and a second program asserts its contrary. Which of the following conclusions is necessarily valid?
Mova's choice: option 1 · The right answer: option 2 · wrong ✗ · Who acts: one program, second program · What happens: give, assert, follow, be · To what, where: It, statement, contrary
This is exam question 1 of lesson 32 «Olympiad: claims, clues and tricky messages ★★★» of the AI course of Mova's primary school, asked in stiff, formal language. The page gives the question's syntax tree — a dependency tree in the style of Universal Dependencies — and its pragmatics clause by clause, then the 4 options as the student saw them, each with its tree and pragmatics. Every text is parsed by Mova itself. How the student answered it, with the score of every option and why: the test at school.
The question
Sentence 1: It is given that one program asserts a statement and a second program asserts its contrary.
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | It | it | PRON | Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs | 3 given | nsubj:pass |
| 2 | is | be | AUX | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 3 given | aux:pass |
| 3 | given | give | VERB | Tense=Past VerbForm=Part Voice=Pass | root | root |
| 4 | that | that | SCONJ | _ | 7 asserts | mark |
| 5 | one | one | NUM | NumForm=Word NumType=Card | 6 program | nummod |
| 6 | program | program | NOUN | Number=Sing | 7 asserts | nsubj |
| 7 | asserts | assert | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 3 given | advcl |
| 8 | a | a | DET | Definite=Ind PronType=Art | 9 statement | det |
| 9 | statement | statement | NOUN | Number=Sing | 7 asserts | obj |
| 10 | and | and | CCONJ | _ | 14 asserts | cc |
| 11 | a | a | DET | Definite=Ind PronType=Art | 13 program | det |
| 12 | second | second | ADJ | Degree=Pos NumForm=Word NumType=Ord | 13 program | amod |
| 13 | program | program | NOUN | Number=Sing | 14 asserts | nsubj |
| 14 | asserts | assert | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 7 asserts | conj |
| 15 | its | its | PRON | Case=Gen Gender=Neut Number=Sing Person=3 Poss=Yes PronType=Prs | 16 contrary | nmod:poss |
| 16 | contrary | contrary | ADJ | Degree=Pos | 14 asserts | obj |
| 17 | . | . | PUNCT | _ | 3 given | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | give | present · passive | It | vn give-13.1-1 «NP V NP»: subject=Theme | |||||
| 2 | assert | present | one program | a statement | vn reflexive_appearance-48.1.2 «NP V NP»: agent=Agent statement=Theme | ||||
| 3 | assert | present | a second program | program's contrary | vn reflexive_appearance-48.1.2 «NP V NP»: agent=Agent contrary=Theme |
One row per clause the reader finds. «not said here»: a role filled from the clause above. «roles by»: a VerbNet class and frame when one fits the verb, else the reader's rules on the tree.
Sentence 2: Which of the following conclusions is necessarily valid?
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Which | which | PRON | PronType=Rel | 8 valid | nsubj |
| 2 | of | of | ADP | _ | 5 conclusions | case |
| 3 | the | the | DET | Definite=Def PronType=Art | 5 conclusions | det |
| 4 | following | follow | VERB | VerbForm=Ger | 5 conclusions | amod |
| 5 | conclusions | conclusion | NOUN | Number=Plur | 1 Which | nmod |
| 6 | is | be | AUX | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 8 valid | cop |
| 7 | necessarily | necessarily | ADV | _ | 8 valid | advmod |
| 8 | valid | valid | ADJ | Degree=Pos | root | root |
| 9 | ? | ? | PUNCT | _ | 8 valid | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | follow | gerund | vn occur-48.3-1 «NP V»: agent=Theme | ||||||
| 2 | is | present | necessarily, valid property | tree rules |
The options
Option 1 · ← Mova's choice
Both programs are necessarily incorrect
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Both | both | DET | PronType=Tot | 2 programs | det |
| 2 | programs | program | NOUN | Number=Plur | 5 incorrect | nsubj |
| 3 | are | be | AUX | Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin | 5 incorrect | cop |
| 4 | necessarily | necessarily | ADV | _ | 5 incorrect | advmod |
| 5 | incorrect | incorrect | ADJ | Degree=Pos | root | root |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | is | present | both programs | incorrect, necessarily property | tree rules |
Option 2 · ✓ the right answer
The two programs cannot both be correct
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | The | the | DET | Definite=Def PronType=Art | 3 programs | det |
| 2 | two | two | NUM | NumForm=Word NumType=Card | 3 programs | nummod |
| 3 | programs | program | NOUN | Number=Plur | 8 correct | nsubj |
| 4 | can | can | AUX | VerbForm=Fin | 8 correct | aux |
| 5 | not | not | PART | Polarity=Neg | 8 correct | advmod |
| 6 | both | both | ADV | _ | 8 correct | advmod |
| 7 | be | be | AUX | VerbForm=Inf | 8 correct | cop |
| 8 | correct | correct | ADJ | Degree=Pos | root | root |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | not is | can | the two programs | both, correct property | tree rules |
Option 3
Both programs are necessarily correct
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Both | both | DET | PronType=Tot | 2 programs | det |
| 2 | programs | program | NOUN | Number=Plur | 5 correct | nsubj |
| 3 | are | be | AUX | Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin | 5 correct | cop |
| 4 | necessarily | necessarily | ADV | _ | 5 correct | advmod |
| 5 | correct | correct | ADJ | Degree=Pos | root | root |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | is | present | both programs | correct, necessarily property | tree rules |
Option 4
The program that answered first is correct
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | The | the | DET | Definite=Def PronType=Art | 2 program | det |
| 2 | program | program | NOUN | Number=Sing | 7 correct | nsubj |
| 3 | that | that | PRON | PronType=Rel | 4 answered | nsubj |
| 4 | answered | answer | VERB | Mood=Ind Number=Sing Person=3 Tense=Past VerbForm=Fin | 2 program | acl:relcl |
| 5 | first | first | ADV | NumForm=Word NumType=Ord | 4 answered | advmod |
| 6 | is | be | AUX | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 7 correct | cop |
| 7 | correct | correct | ADJ | Degree=Pos | root | root |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | answer speech: assert | past | the program | first property | vn reciprocate-112-1 «NP V»: agent=Agent | ||||
| 2 | is | present | the program | correct property | tree rules |
Text: the tests of Mova's primary school, written for Mova (world/data/school/), as the course runner gave them to the student. Trees: Mova's own parse — the en model on the CPU, when the site is built — not checked by a teacher; they may be wrong. Frames: Mova's frames reader (prag), each text read on its own. Elamur Cosmic License.
This page in Markdown → https://md.mova.elamur.ai/free/en/corpora/questions/ai/32-olympiad-claims-clues-and-tricky-messages/e1/