1967 |
2023/04/09 04:50:31
|
1 + 1 = 2
|
kivantium |
Success |
|
|
1966 |
2023/04/09 04:19:52
|
plus_comm
|
kivantium |
Success |
|
|
1965 |
2023/04/09 04:03:17
|
plus_assoc
|
kivantium |
Success |
|
|
1964 |
2023/04/09 04:02:36
|
plus_assoc
|
kivantium |
Failure |
|
|
1963 |
2022/10/20 20:13:13
|
plus_assoc
|
mii |
Success |
|
|
1962 |
2022/10/20 20:12:22
|
plus_assoc
|
mii |
Failure |
|
|
1961 |
2022/09/23 05:39:01
|
n < m \/ n = m \/ n > m
|
jeb |
Success |
|
|
1960 |
2022/09/23 05:18:03
|
n < m \/ n = m \/ n > m
|
jeb |
Failure |
|
|
1959 |
2022/09/23 02:46:52
|
n * S m = n + n * m
|
jeb |
Success |
|
|
1958 |
2022/09/23 02:19:00
|
n * S m = n + n * m
|
jeb |
Failure |
|
|
1957 |
2022/09/23 02:14:02
|
n * S m = n + n * m
|
jeb |
Failure |
|
|
1956 |
2022/09/23 02:01:14
|
n * S m = n + n * m
|
jeb |
Failure |
|
|
1955 |
2022/09/23 01:50:50
|
n * S m = n + n * m
|
jeb |
Failure |
|
|
1954 |
2022/09/23 01:01:30
|
forall f: bool -> bool, f^3(x) = f(x)
|
jeb |
Success |
|
|
1953 |
2022/09/23 00:28:34
|
1 + 1 = 2
|
jeb |
Success |
|
|
1952 |
2022/07/25 01:02:10
|
Product of n consecutive integers is divisible by n!
|
fairy_lettuce |
Success |
|
|
1951 |
2022/07/23 20:45:57
|
n < m \/ n = m \/ n > m
|
fairy_lettuce |
Success |
|
|
1950 |
2022/07/23 18:59:51
|
n * S m = n + n * m
|
fairy_lettuce |
Success |
|
|
1949 |
2022/07/23 18:56:02
|
forall f: bool -> bool, f^3(x) = f(x)
|
fairy_lettuce |
Success |
|
|
1948 |
2022/07/23 17:58:57
|
plus_comm
|
fairy_lettuce |
Success |
|
|
1947 |
2022/07/23 17:57:28
|
1 + 1 = 2
|
fairy_lettuce |
Success |
|
|
1946 |
2022/07/23 17:55:16
|
plus_comm
|
fairy_lettuce |
Success |
|
|
1945 |
2022/07/23 17:49:01
|
plus_assoc
|
fairy_lettuce |
Success |
|
|
1944 |
2022/07/23 17:48:03
|
plus_assoc
|
fairy_lettuce |
Failure |
|
|
1943 |
2022/07/18 21:02:43
|
forall f: bool -> bool, f^3(x) = f(x)
|
platypus |
Success |
|
|
1942 |
2022/06/23 17:54:09
|
mult_n_O
|
toga |
Success |
|
|
1941 |
2022/06/23 13:54:12
|
plus_assoc
|
nikosai |
Failure |
|
|
1940 |
2022/06/23 13:12:05
|
gcd(n, n+1) = 1
|
toga |
Success |
|
|
1939 |
2022/06/22 14:15:44
|
forall l: list nat, l @ [0] <> []
|
toga |
Success |
|
|
1938 |
2022/06/22 14:01:02
|
forall f: bool -> bool, f^3(x) = f(x)
|
toga |
Success |
|
|
1937 |
2022/06/21 14:28:39
|
Summand of one
|
toga |
Success |
|
|
1936 |
2022/06/15 16:06:22
|
n * S m = n + n * m
|
toga |
Success |
|
|
1935 |
2022/06/14 12:26:41
|
plus_comm
|
toga |
Success |
|
|
1934 |
2022/06/13 19:51:17
|
plus_comm
|
toga |
Success |
|
|
1933 |
2022/06/13 18:39:02
|
1 + 1 = 2
|
toga |
Success |
|
|
1932 |
2022/06/11 17:58:25
|
plus_assoc
|
toga |
Success |
|
|
1931 |
2022/04/20 04:08:08
|
count_occ_app
|
minus3theta |
Success |
|
|
1930 |
2022/04/19 06:42:20
|
Flat CPO
|
minus3theta |
Success |
|
|
1929 |
2022/04/19 05:57:43
|
Swap twice
|
minus3theta |
Success |
|
|
1928 |
2022/04/19 05:56:05
|
S preserves comparison
|
minus3theta |
Success |
|
|
1927 |
2022/04/19 05:54:18
|
Sum of n^3
|
minus3theta |
Success |
|
|
1926 |
2022/04/19 05:48:38
|
Boolean-hole principle revisited
|
minus3theta |
Success |
|
|
1925 |
2022/04/19 05:37:35
|
Cumulative sum of list
|
minus3theta |
Success |
|
|
1924 |
2022/04/19 05:02:26
|
Zero test
|
minus3theta |
Success |
|
|
1923 |
2022/04/19 05:00:07
|
eq_sym?
|
minus3theta |
Success |
|
|
1922 |
2022/04/11 17:42:24
|
Zero test
|
minus3theta |
Failure |
|
|
1921 |
2022/04/11 15:49:29
|
Double
|
minus3theta |
Success |
|
|
1920 |
2022/04/11 15:21:22
|
Yoneda embedding for preorder
|
minus3theta |
Success |
|
|
1919 |
2022/04/11 15:20:37
|
Yoneda embedding for preorder
|
minus3theta |
Failure |
|
|
1918 |
2022/04/11 14:25:45
|
unique (unique l) = l
|
minus3theta |
Success |
|
|