| 1811 |
2020/11/02 04:30:00
|
plus_assoc
|
aaaa |
Success |
|
|
| 1810 |
2020/11/02 04:25:02
|
plus_assoc
|
aaaa |
Success |
|
|
| 1809 |
2020/11/02 03:50:19
|
1 + 1 = 2
|
aaaa |
Success |
|
|
| 1808 |
2020/11/02 03:48:23
|
1 + 1 = 2
|
aaaa |
Success |
|
|
| 1807 |
2020/11/02 03:45:31
|
1 + 1 = 2
|
aaaa |
Success |
|
|
| 1806 |
2020/11/02 03:43:06
|
1 + 1 = 2
|
aaaa |
Failure |
|
|
| 1805 |
2020/11/02 03:42:26
|
1 + 1 = 2
|
aaaa |
Failure |
|
|
| 1804 |
2020/11/02 03:31:38
|
1 + 1 = 2
|
sabataro |
Failure |
|
|
| 1803 |
2020/11/02 03:28:20
|
1 + 1 = 2
|
sabataro |
Failure |
|
|
| 1802 |
2020/11/02 03:26:29
|
1 + 1 = 2
|
sabataro |
Success |
|
|
| 1801 |
2020/11/02 03:23:43
|
1 + 1 = 2
|
sabataro |
Success |
|
|
| 1800 |
2020/11/02 03:20:55
|
1 + 1 = 2
|
sabataro |
Success |
|
|
| 1799 |
2020/11/02 03:17:18
|
1 + 1 = 2
|
sabataro |
Success |
|
|
| 1798 |
2020/11/02 03:12:20
|
1 + 1 = 2
|
sabataro |
Success |
|
|
| 1797 |
2020/11/02 03:01:36
|
1 + 1 = 2
|
sabataro |
Failure |
|
|
| 1796 |
2020/10/31 18:45:39
|
plus_assoc
|
xsd |
Success |
|
|
| 1795 |
2020/10/31 18:44:45
|
plus_assoc
|
xsd |
Failure |
|
|
| 1794 |
2020/10/31 14:04:47
|
plus_assoc
|
xsd |
Failure |
|
|
| 1793 |
2020/10/31 14:02:56
|
plus_assoc
|
xsd |
Failure |
|
|
| 1792 |
2020/10/26 00:43:18
|
Perfect Square?
|
fetburner |
Success |
|
|
| 1791 |
2020/10/25 03:15:22
|
If zero were not nat
|
fetburner |
Success |
|
|
| 1790 |
2020/10/25 02:58:23
|
Flat CPO
|
fetburner |
Success |
|
|
| 1789 |
2020/10/21 10:56:27
|
Eat the Candies
|
tanakh |
Success |
|
|
| 1788 |
2020/10/21 06:23:48
|
Perfect Square?
|
tanakh |
Success |
|
|
| 1787 |
2020/10/21 06:12:24
|
Perfect Square?
|
tanakh |
Success |
|
|
| 1786 |
2020/10/21 04:50:18
|
If zero were not nat
|
tanakh |
Success |
|
|
| 1785 |
2020/10/21 04:24:10
|
Flat CPO
|
tanakh |
Success |
|
|
| 1784 |
2020/10/19 08:15:36
|
The set of all finite sequences of bool is countable
|
kkob |
Success |
|
|
| 1783 |
2020/10/19 03:46:08
|
Friends and strangers
|
tanakh |
Success |
|
|
| 1782 |
2020/10/19 03:14:44
|
The set of all finite sequences of bool is countable
|
tanakh |
Success |
|
|
| 1781 |
2020/10/18 05:53:22
|
Fibonacci numbers modulo 2
|
tanakh |
Success |
|
|
| 1780 |
2020/10/17 23:29:32
|
Rotate once
|
tanakh |
Success |
|
|
| 1779 |
2020/10/17 23:27:04
|
Rotate once
|
tanakh |
Success |
|
|
| 1778 |
2020/10/17 21:17:24
|
Sum of n^3
|
tanakh |
Success |
|
|
| 1777 |
2020/10/12 04:06:50
|
forall f: bool -> bool, f^3(x) = f(x)
|
uenoku |
Success |
|
|
| 1776 |
2020/10/12 03:47:20
|
1 + 1 = 2
|
uenoku |
Success |
|
|
| 1775 |
2020/10/12 03:26:20
|
plus_assoc
|
uenoku |
Success |
|
|
| 1774 |
2020/10/12 03:20:57
|
forall l: list nat, l @ [0] <> []
|
uenoku |
Success |
|
|
| 1773 |
2020/10/12 03:20:03
|
forall l: list nat, l @ [0] <> []
|
uenoku |
Failure |
|
|
| 1772 |
2020/10/12 03:19:32
|
forall l: list nat, l @ [0] <> []
|
uenoku |
Failure |
|
|
| 1771 |
2020/10/10 14:40:30
|
Grand Garden
|
yodvhskd |
Success |
|
|
| 1770 |
2020/10/10 01:56:09
|
unique (unique l) = l
|
shift0 |
Success |
|
|
| 1769 |
2020/10/10 01:12:38
|
gcd(n, n+1) = 1
|
shift0 |
Success |
|
|
| 1768 |
2020/10/10 01:11:42
|
gcd(n, n+1) = 1
|
shift0 |
Failure |
|
|
| 1767 |
2020/10/10 01:01:48
|
Multiplication in F_2 is idempotent
|
shift0 |
Success |
|
|
| 1766 |
2020/10/09 23:38:38
|
Definitions of injectivity
|
shift0 |
Success |
|
|
| 1765 |
2020/10/09 22:56:59
|
Cumulative sum of list
|
shift0 |
Success |
|
|
| 1764 |
2020/10/09 21:25:16
|
forall l: list nat, l @ [0] <> []
|
shift0 |
Success |
|
|
| 1763 |
2020/10/09 21:24:28
|
forall l: list nat, l @ [0] <> []
|
shift0 |
Failure |
|
|
| 1762 |
2020/10/09 21:23:36
|
forall l: list nat, l @ [0] <> []
|
shift0 |
Failure |
|
|