| 1993 |
2024/02/01 01:13:54
|
n < m \/ n = m \/ n > m
|
test1234 |
Success |
|
|
| 1992 |
2024/01/31 21:30:38
|
n * S m = n + n * m
|
test1234 |
Success |
|
|
| 1991 |
2024/01/31 19:57:03
|
forall f: bool -> bool, f^3(x) = f(x)
|
test1234 |
Success |
|
|
| 1990 |
2024/01/31 08:19:38
|
1 + 1 = 2
|
test1234 |
Success |
|
|
| 1989 |
2024/01/31 08:15:20
|
plus_comm
|
test1234 |
Success |
|
|
| 1988 |
2024/01/31 07:25:43
|
plus_assoc
|
test1234 |
Success |
|
|
| 1987 |
2023/09/04 21:27:58
|
unique (unique l) = l
|
aai |
Success |
|
|
| 1986 |
2023/09/04 20:56:41
|
count l n = count (rev l) n
|
aai |
Failure |
|
|
| 1985 |
2023/09/04 12:42:22
|
Multiplication in F_2 is idempotent
|
aai |
Success |
|
|
| 1984 |
2023/09/03 16:01:40
|
n < m \/ n = m \/ n > m
|
aai |
Success |
|
|
| 1983 |
2023/09/03 15:47:47
|
Definitions of injectivity
|
aai |
Success |
|
|
| 1982 |
2023/09/03 15:46:24
|
Definitions of injectivity
|
aai |
Failure |
|
|
| 1981 |
2023/09/03 15:07:57
|
Cumulative sum of list
|
aai |
Success |
|
|
| 1980 |
2023/09/02 21:28:06
|
Three is prime
|
aai |
Success |
|
|
| 1979 |
2023/09/02 18:10:46
|
Boolean-hole principle
|
aai |
Success |
|
|
| 1978 |
2023/09/02 17:53:58
|
De Morgan's laws in Coq
|
aai |
Success |
|
|
| 1977 |
2023/09/02 14:22:35
|
mult_n_O
|
aai |
Success |
|
|
| 1976 |
2023/09/02 14:20:37
|
gcd(n, n+1) = 1
|
aai |
Success |
|
|
| 1975 |
2023/09/02 13:53:48
|
Summand of one
|
aai |
Success |
|
|
| 1974 |
2023/09/02 13:44:03
|
forall l: list nat, l @ [0] <> []
|
aai |
Success |
|
|
| 1973 |
2023/09/02 09:29:49
|
n * S m = n + n * m
|
aai |
Success |
|
|
| 1972 |
2023/09/02 09:08:30
|
forall f: bool -> bool, f^3(x) = f(x)
|
aai |
Success |
|
|
| 1971 |
2023/09/01 22:07:49
|
1 + 1 = 2
|
aai |
Success |
|
|
| 1970 |
2023/09/01 22:02:31
|
plus_comm
|
aai |
Success |
|
|
| 1969 |
2023/09/01 21:39:44
|
plus_assoc
|
aai |
Success |
|
|
| 1968 |
2023/07/17 11:38:37
|
1 + 1 = 2
|
fakeprogrammer |
Success |
|
|
| 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 |
|
|