Exercise logic.propositional.proof.unicode
Description
Prove two propositions equivalent (unicode support)
Test report
| Tests | 282 |
| Errors | 0 |
| Warnings | 0 |
| Time | 1.011489s |
| Rating |  |
Suites
- Exercise logic.propositional.proof.unicode (tests: 282, errors: 0, warnings: 0, 1.011479s)
Tests
Exercise logic.propositional.proof.unicode (tests: 282, errors: 0, warnings: 0, 1.011479s)
Examples (tests: 279, errors: 0, warnings: 0, 1.003958s)
start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters start term is suitable start term is not ready final term is suitable final term is ready parser/pretty-printer equivalences no similar steps self similarity parameters exercise terms defined equivalence implemented similarity implemented