statement stringlengths 1 33.2k | proof stringlengths 0 198k | type stringclasses 14
values | symbolic_name stringlengths 1 92 | library stringclasses 345
values | filename stringlengths 17 103 | imports listlengths 0 0 | deps listlengths 0 64 | docstring stringclasses 1
value | source_url stringclasses 1
value | commit stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|
foo_thm = TRUTH | Theorem | foo_thm | tools.Holmake.tests.cachefetch.subdir | tools/Holmake/tests/cachefetch/subdir/fooScript.sml | [] | [
"TRUTH"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
base_thm = TRUTH | Theorem | base_thm | tools.Holmake.tests.cachekey.depdir | tools/Holmake/tests/cachekey/depdir/baseScript.sml | [] | [
"TRUTH"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
child_thm = base_thm | Theorem | child_thm | tools.Holmake.tests.cachekey.depdir | tools/Holmake/tests/cachekey/depdir/childScript.sml | [] | [
"base_thm"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
sigtest_thm = arithmeticTheory.ADD_0 | Theorem | sigtest_thm | tools.Holmake.tests.cachekey.sigobj_symlink | tools/Holmake/tests/cachekey/sigobj_symlink/sigtestScript.sml | [] | [
"ADD_0"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
p /\ q ==> r | ALL_TAC | prove | x | tools.Holmake.tests.cheatspotting.testdir | tools/Holmake/tests/cheatspotting/testdir/usedCheatScript.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
T ==> (Q ==> Q) | STRIP_TAC THEN ACCEPT_TAC Q_implies_Q | store_thm | TQQ | tools.Holmake.tests.coproduct.testdir | tools/Holmake/tests/coproduct/testdir/secondSimpleScript.sml | [] | [
"Q_implies_Q"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
Q ==> Q | STRIP_TAC | store_thm | Q_implies_Q | tools.Holmake.tests.coproduct.testdir2 | tools/Holmake/tests/coproduct/testdir2/baseScript.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
f x = x | new_definition | f_def | tools.Holmake.tests.depchain2 | tools/Holmake/tests/depchain2/thy1Script.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
g x y <=> y /\ f x | new_definition | g_def | tools.Holmake.tests.depchain2.dir1.dir2 | tools/Holmake/tests/depchain2/dir1/dir2/thy2Script.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
f g x = g (g x) | new_definition | f_def | tools.Holmake.tests.depchain_heap | tools/Holmake/tests/depchain_heap/thy1Script.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
g x = x * 2 | new_definition | g_def | tools.Holmake.tests.depchain_heap.dir2 | tools/Holmake/tests/depchain_heap/dir2/thy2Script.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
A x = x | new_definition | A_def | tools.Holmake.tests.deps_of_depthys | tools/Holmake/tests/deps_of_depthys/AScript.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
p ==> (q ==> (r ==> A p)) | NTAC badLib.something STRIP_TAC >> ASM_REWRITE_TAC[A_def] | store_thm | A_thm | tools.Holmake.tests.deps_of_depthys | tools/Holmake/tests/deps_of_depthys/AScript.sml | [] | [
"A_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
A p /\ q ==> p /\ q | REWRITE_TAC[] THEN
CONV_TAC (LAND_CONV (LAND_CONV (REWRITE_CONV [A_def]))) THEN
REPEAT STRIP_TAC THEN ASM_REWRITE_TAC [] | store_thm | B | tools.Holmake.tests.deps_of_depthys | tools/Holmake/tests/deps_of_depthys/BScript.sml | [] | [
"A_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
!x:bool. x = T \/ x = F | ALL_TAC | store_thm | bad_thm | tools.Holmake.tests.dumpheap.testdir | tools/Holmake/tests/dumpheap/testdir/failingScript.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
bug_def:
bug = nothing to see here
Termination
cheat
QED
val _ = export_theory(); | Definition | bug_def | tools.Holmake.tests.gh1353.testd | tools/Holmake/tests/gh1353/testd/bugScript.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
foo:
foo | Proof
foo [``] | Theorem | foo | tools.Holmake.tests.gh1371 | tools/Holmake/tests/gh1371/bugScript.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
bar:
bar | Proof
bar | Theorem | bar | tools.Holmake.tests.gh1371 | tools/Holmake/tests/gh1371/bugScript.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
bad_unmatched_paren:
T | Proof
(ACCEPT_TAC TRUTH | Theorem | bad_unmatched_paren | tools.Holmake.tests.gh1993.testd | tools/Holmake/tests/gh1993/testd/badScript.sml | [] | [
"TRUTH"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
x:'a = x | REWRITE_TAC[] | store_thm | base | tools.Holmake.tests.hollogs.base | tools/Holmake/tests/hollogs/base/baseScript.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
val foo_def = new_definition("foo_def", “foo x <=> x \/ T”); | new_definition | foo_def | tools.Holmake.tests.holpathdb.proj1 | tools/Holmake/tests/holpathdb/proj1/proj1AScript.sml | [] | [
"foo"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
“!y. foo y” | REWRITE_TAC [foo_def] | store_thm | Athm | tools.Holmake.tests.holpathdb.proj1 | tools/Holmake/tests/holpathdb/proj1/proj1AScript.sml | [] | [
"foo",
"foo_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
“(\f g x. f (g x)) (~) foo = \x. F” | BETA_TAC >> REWRITE_TAC[FUN_EQ_THM, foo_def] | store_thm | Bthm | tools.Holmake.tests.holpathdb.proj1 | tools/Holmake/tests/holpathdb/proj1/proj1BScript.sml | [] | [
"FUN_EQ_THM",
"foo",
"foo_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
val bar_def = new_definition ("bar_def", “bar x y <=> x /\ y”); | new_definition | bar_def | tools.Holmake.tests.holpathdb.proj2 | tools/Holmake/tests/holpathdb/proj2/proj2AScript.sml | [] | [
"bar"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
“!y. bar F y <=> ~foo y” | REWRITE_TAC[bar_def, proj1ATheory.foo_def] | store_thm | thm2A | tools.Holmake.tests.holpathdb.proj2 | tools/Holmake/tests/holpathdb/proj2/proj2AScript.sml | [] | [
"bar",
"bar_def",
"foo",
"foo_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
“~bar m n <=> (m <=> F) \/ (n <=> F)” | REWRITE_TAC[bar_def, DE_MORGAN_THM] | store_thm | thm2B | tools.Holmake.tests.holpathdb.proj2 | tools/Holmake/tests/holpathdb/proj2/proj2BScript.sml | [] | [
"bar",
"bar_def"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
bar x = foo x * 2 | Define | bar_def | tools.Holmake.tests.Iflag.testdir | tools/Holmake/tests/Iflag/testdir/BScript.sml | [] | [
"bar",
"foo"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
foo x = x * 10 + 1 | Define | foo_def | tools.Holmake.tests.Iflag.testdir.includethis | tools/Holmake/tests/Iflag/testdir/includethis/AScript.sml | [] | [
"foo"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
val base_def = new_definition ("base_def", “base x <=> x /\ T”); | new_definition | base_def | tools.Holmake.tests.indepchildren.base | tools/Holmake/tests/indepchildren/base/baseScript.sml | [] | [
"base"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
val dir1_def = new_definition("dir1_def", “dir1 x <=> base x \/ F”); | new_definition | dir1_def | tools.Holmake.tests.indepchildren.dir1 | tools/Holmake/tests/indepchildren/dir1/dir1Script.sml | [] | [
"base"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
val dir2_def = new_definition ("dir2_def", “dir2 x <=> base x /\ T”); | new_definition | dir2_def | tools.Holmake.tests.indepchildren.dir2 | tools/Holmake/tests/indepchildren/dir2/dir2Script.sml | [] | [
"base"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
val foo_def = new_definition("foo_def", “foo x <=> x /\ T”); | new_definition | foo_def | tools.Holmake.tests.noprereqs.dir1 | tools/Holmake/tests/noprereqs/dir1/baseScript.sml | [] | [
"foo"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
val bar_def = new_definition("bar_def", “bar x <=> x \/ T”); | new_definition | bar_def | tools.Holmake.tests.noprereqs.dir3 | tools/Holmake/tests/noprereqs/dir3/derivedScript.sml | [] | [
"bar"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
val baz_def = new_definition("baz_def", “baz x <=> (foo x ==> bar x)”); | new_definition | baz_def | tools.Holmake.tests.noprereqs.dir4 | tools/Holmake/tests/noprereqs/dir4/finalScript.sml | [] | [
"bar",
"baz",
"foo"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
bar:
bar x y = x + 1 | Definition | bar | tools.Holmake.tests.no_sig_docs | tools/Holmake/tests/no_sig_docs/fooScript.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
foo = TRUTH;
Theorem bar = TRUTH;
val _ = export_theory(); | Theorem | foo | tools.Holmake.tests.qfreadTheoremsyntax | tools/Holmake/tests/qfreadTheoremsyntax/qfreadScript.sml | [] | [
"TRUTH",
"bar"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
bar = TRUTH;
val _ = export_theory(); | Theorem | bar | tools.Holmake.tests.qfreadTheoremsyntax | tools/Holmake/tests/qfreadTheoremsyntax/qfreadScript.sml | [] | [
"TRUTH"
] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | ||
“p ∧ p ⇔ ” | REWRITE_TAC[] | store_thm | test | tools.Holmake.tests.time-logging.bad | tools/Holmake/tests/time-logging/bad/testScript.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb | |
“p ∧ p ⇔ p” | REWRITE_TAC[] | store_thm | test | tools.Holmake.tests.time-logging.good | tools/Holmake/tests/time-logging/good/testScript.sml | [] | [] | https://github.com/HOL-Theorem-Prover/HOL | ab6450c497d986a09043c9e930c36841ba93fbdb |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.