| 1137 |
2019/11/27 01:37:14
|
Identity permutation
|
tzik |
Success |
|
|
| 1136 |
2019/11/26 23:46:59
|
n < m \/ n = m \/ n > m
|
natsugiri |
Success |
|
|
| 1135 |
2019/11/26 23:28:49
|
infinite bool sequence is uncountable
|
mttm |
Success |
|
|
| 1134 |
2019/11/26 22:57:57
|
Constructor is injective
|
natsugiri |
Success |
|
|
| 1133 |
2019/11/26 22:57:25
|
Constructor is injective
|
natsugiri |
Failure |
|
|
| 1132 |
2019/11/26 22:56:44
|
Constructor is injective
|
natsugiri |
Failure |
|
|
| 1131 |
2019/11/26 22:53:50
|
Yoneda embedding for preorder
|
natsugiri |
Success |
|
|
| 1130 |
2019/11/26 05:02:00
|
count l n = count (rev l) n
|
natsugiri |
Success |
|
|
| 1129 |
2019/11/26 03:18:29
|
Three is prime
|
natsugiri |
Success |
|
|
| 1128 |
2019/11/26 03:04:53
|
Relative prime squares
|
yodvhskd |
Success |
|
|
| 1127 |
2019/11/26 02:32:48
|
Boolean-hole principle
|
natsugiri |
Success |
|
|
| 1126 |
2019/11/26 02:28:31
|
De Morgan's laws in Coq
|
natsugiri |
Success |
|
|
| 1125 |
2019/11/26 02:28:03
|
De Morgan's laws in Coq
|
natsugiri |
Rejected |
|
|
| 1124 |
2019/11/26 01:30:34
|
mult_n_O
|
natsugiri |
Success |
|
|
| 1123 |
2019/11/26 01:29:01
|
gcd(n, n+1) = 1
|
natsugiri |
Success |
|
|
| 1122 |
2019/11/26 01:27:19
|
gcd(n, n+1) = 1
|
natsugiri |
Failure |
|
|
| 1121 |
2019/11/26 01:25:16
|
gcd(n, n+1) = 1
|
natsugiri |
Failure |
|
|
| 1120 |
2019/11/26 01:22:41
|
gcd(n, n+1) = 1
|
natsugiri |
Failure |
|
|
| 1119 |
2019/11/26 01:01:15
|
Summand of one
|
natsugiri |
Success |
|
|
| 1118 |
2019/11/26 00:08:57
|
Summand of one
|
saitou |
Success |
|
|
| 1117 |
2019/11/26 00:03:52
|
forall l: list nat, l @ [0] <> []
|
saitou |
Success |
|
|
| 1116 |
2019/11/25 04:46:29
|
unique (unique l) = l
|
tzik |
Success |
|
|
| 1115 |
2019/11/25 04:32:56
|
unique count
|
tzik |
Success |
|
|
| 1114 |
2019/11/25 03:31:31
|
Double
|
tzik |
Success |
|
|
| 1113 |
2019/11/25 03:30:32
|
n * S m = n + n * m
|
natsugiri |
Success |
|
|
| 1112 |
2019/11/25 03:22:50
|
Yoneda embedding for preorder
|
tanakh |
Success |
|
|
| 1111 |
2019/11/25 03:12:16
|
Any natural number is expressible in binary notation
|
tzik |
Success |
|
|
| 1110 |
2019/11/25 03:09:56
|
Boolean-hole principle
|
tanakh |
Success |
|
|
| 1109 |
2019/11/25 03:05:39
|
mult_n_O
|
tanakh |
Success |
|
|
| 1108 |
2019/11/25 03:03:56
|
mult_n_O
|
tanakh |
Success |
|
|
| 1107 |
2019/11/25 03:02:14
|
gcd(n, n+1) = 1
|
tanakh |
Success |
|
|
| 1106 |
2019/11/25 02:48:46
|
Summand of one
|
tanakh |
Success |
|
|
| 1105 |
2019/11/25 02:46:12
|
Boolean-hole principle
|
tzik |
Success |
|
|
| 1104 |
2019/11/25 02:43:36
|
De Morgan's laws in Coq
|
tzik |
Success |
|
|
| 1103 |
2019/11/25 02:20:14
|
mult_n_O
|
tzik |
Success |
|
|
| 1102 |
2019/11/25 02:06:26
|
Three is prime
|
tzik |
Success |
|
|
| 1101 |
2019/11/25 01:56:33
|
forall l: list nat, l @ [0] <> []
|
tanakh |
Success |
|
|
| 1100 |
2019/11/25 00:23:16
|
Relative prime squares
|
kkob |
Success |
|
|
| 1099 |
2019/11/24 23:51:36
|
Yoneda embedding for preorder
|
tzik |
Success |
|
|
| 1098 |
2019/11/24 22:59:09
|
plus_comm
|
lion |
Success |
|
|
| 1097 |
2019/11/24 22:56:17
|
Tree addressing is injective
|
mttm |
Success |
|
|
| 1096 |
2019/11/24 22:50:59
|
plus_comm
|
lion |
Failure |
|
|
| 1095 |
2019/11/24 22:32:09
|
plus_comm
|
lion |
Failure |
|
|
| 1094 |
2019/11/24 22:15:14
|
1 + 1 = 2
|
lion |
Success |
|
|
| 1093 |
2019/11/24 22:14:40
|
1 + 1 = 2
|
lion |
Failure |
|
|
| 1092 |
2019/11/24 21:53:22
|
Tree addressing is injective
|
yamarten |
Success |
|
|
| 1091 |
2019/11/24 21:36:45
|
Relative prime squares
|
kozima |
Success |
|
|
| 1090 |
2019/11/24 21:35:09
|
1 + 1 = 2
|
lion |
Failure |
|
|
| 1089 |
2019/11/24 21:18:11
|
infinite bool sequence is uncountable
|
saitou |
Success |
|
|
| 1088 |
2019/11/24 21:11:02
|
infinite bool sequence is uncountable
|
hirosegolf |
Success |
|
|