benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU / Resolution theorem proving for showing that a formula of propositional logic is…

Problem

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

question

Resolution theorem proving for showing that a formula of propositional logic is not satisfiable has which of the following properties?
I. It is a sound proof system in the sense that there does not exist a proof of the unsatisfiability of a satisfiable formula of propositional logic.
II. It is a complete proof system in the sense that there is a proof of unsatisfiability for every unsa tisfiable formula of propositional logic.
III. It is a succinct proof system in the sense that whenever an unsatisfiable formula F of propositional logic has a resolution proof, F also has a proof whose length is polynomial in the length of F.

choices

  1. I only
  2. III only
  3. I and II only
  4. I and III only

subject

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

task_id
b6d15e10-088e-5bb9-9b29-15db6d4995ca
task_key
all--test--b6d15e10-088e-5bb9-9b29-15db6d4995ca
task_revision_id
1
config / split
all / test

Official source

initial import