579 
2019/09/15 17:22:52

unique (unique l) = l

kozima 
Success 


578 
2019/09/15 17:21:49

count l n = count (rev l) n

pekempey 
Success 


577 
2019/09/15 17:20:27

count l n = count (rev l) n

sorata 
Success 


576 
2019/09/15 17:19:57

count l n = count (rev l) n

pekempey 
Failure 


575 
2019/09/15 17:18:50

count l n = count (rev l) n

sorata 
Failure 


574 
2019/09/15 17:15:29

count l n = count (rev l) n

prime 
Success 


573 
2019/09/15 17:14:44

gcd(n, n+1) = 1

spica314 
Success 


572 
2019/09/15 17:13:56

count l n = count (rev l) n

kkob 
Success 


571 
2019/09/15 17:12:22

count l n = count (rev l) n

kozima 
Success 


570 
2019/09/15 17:06:42

gcd(n, n+1) = 1

sorata 
Success 


569 
2019/09/15 17:06:29

gcd(n, n+1) = 1

kkob 
Success 


568 
2019/09/15 17:06:16

gcd(n, n+1) = 1

pekempey 
Success 


567 
2019/09/15 17:05:53

gcd(n, n+1) = 1

pekempey 
Failure 


566 
2019/09/15 17:05:51

gcd(n, n+1) = 1

prime 
Success 


565 
2019/09/15 17:05:37

gcd(n, n+1) = 1

sorata 
Failure 


564 
2019/09/15 17:04:35

gcd(n, n+1) = 1

pekempey 
Failure 


563 
2019/09/15 17:03:52

gcd(n, n+1) = 1

kozima 
Success 


562 
2019/09/15 16:53:52

Multiplication in F_2 is idempotent

spica314 
Success 


561 
2019/09/15 16:35:29

1 + 1 = 2

asi1024 
Success 


560 
2019/09/14 21:51:35

Equivalent two quicksorts

kozima 
Success 


559 
2019/09/14 20:37:23

Cumulative sum of list

yamarten 
Success 


558 
2019/09/14 20:34:38

Cumulative sum of list

yamarten 
Rejected 


557 
2019/09/14 16:33:21

Grand Garden

drafear 
Success 


556 
2019/09/14 16:33:00

unique count

drafear 
Success 


555 
2019/09/14 16:32:40

unique (unique l) = l

drafear 
Success 


554 
2019/09/14 16:32:20

count l n = count (rev l) n

drafear 
Success 


553 
2019/09/14 16:31:57

gcd(n, n+1) = 1

drafear 
Success 


552 
2019/09/14 02:56:26

Equivalent two quicksorts

kkob 
Success 


551 
2019/09/14 02:54:55

Equivalent two quicksorts

kkob 
Failure 


550 
2019/09/13 22:59:28

forall l: list nat, l @ [0] <> []

minaminao 
Success 


549 
2019/09/13 22:21:16

n * S m = n + n * m

minaminao 
Success 


548 
2019/09/13 22:02:40

forall f: bool > bool, f^3(x) = f(x)

minaminao 
Success 


547 
2019/09/13 21:04:14

Summand of one

minaminao 
Success 


546 
2019/09/13 20:33:59

1 + 1 = 2

minaminao 
Success 


545 
2019/09/13 20:33:01

plus_comm

minaminao 
Success 


544 
2019/09/13 18:00:23

forall l: list nat, l @ [0] <> []

cympfh 
Success 


543 
2019/09/13 17:57:53

forall l: list nat, l @ [0] <> []

cympfh 
Success 


542 
2019/09/12 23:11:18

plus_assoc

minaminao 
Success 


541 
2019/09/12 20:48:27

n * S m = n + n * m

egashira 
Success 


540 
2019/09/12 20:30:48

plus_comm

egashira 
Success 


539 
2019/09/12 20:25:40

plus_assoc

egashira 
Success 


538 
2019/09/12 20:22:52

1 + 1 = 2

egashira 
Success 


537 
2019/09/11 21:30:07

1 + 1 = 2

skwbc 
Success 


536 
2019/09/10 07:43:52

n * S m = n + n * m

Haar 
Success 


535 
2019/09/10 07:36:07

forall f: bool > bool, f^3(x) = f(x)

Haar 
Success 


534 
2019/09/09 18:37:57

Identity permutation

cympfh 
Success 


533 
2019/09/09 17:39:14

l1 <> l2 if l2 is an odd permutation of l1

okaduki 
Success 


532 
2019/09/09 10:21:58

1 + 1 = 2

Haar 
Success 


531 
2019/09/09 10:15:42

plus_comm

Haar 
Success 


530 
2019/09/09 10:09:50

plus_assoc

Haar 
Success 

