benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU-Pro / 10360 / Two expressions E and F are said to be unifiable if there are substitutions for…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Two expressions E and F are said to be unifiable if there are substitutions for the variables of E and F that make the expressions lexically identical. In the following three expressions, only w, x, y, and z are variables.
I. f(w,w)
II. f(x,1)
III. f(y,g(z))
Which pairs of these expressions is (are) pairs of unifiable expressions?

category

computer science

options

  1. (I, III) and (II, III) only
  2. (II, III) only
  3. (I, II) and (I, III) only
  4. (I, II) only
  5. Only single expressions are unifiable, not pairs
  6. None of the pairs are unifiable
  7. (I, II), (I, III), and (II, III)
  8. All three expressions are unifiable
  9. (I, II) and (II, III) only
  10. (I, III) only

src

ori_mmlu-college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

upstream_id / Original problem ID
10360
task_id
72cbad13-0b31-5631-904e-fc4cbfb9c852
task_key
default--test--10360
task_revision_id
1
config / split
default / test

Official source

initial import