1030 
2019/11/20 19:09:36

1 + 1 = 2

tanakh 
Success 


1029 
2019/11/20 18:56:43

1 + 1 = 2

a_kawashiro 
Success 


1028 
2019/11/19 02:48:05

n * S m = n + n * m

tzik 
Success 


1027 
2019/11/19 02:33:59

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

tzik 
Success 


1026 
2019/11/18 20:57:49

plus_comm

tzik 
Success 


1025 
2019/11/18 20:55:03

plus_assoc

tzik 
Success 


1024 
2019/11/18 20:53:25

1 + 1 = 2

tzik 
Success 


1023 
2019/11/18 20:52:58

1 + 1 = 2

tzik 
Failure 


1022 
2019/11/18 05:49:58

infinite bool sequence is uncountable

kkob 
Success 


1021 
2019/11/18 05:48:11

Tree addressing is injective

kkob 
Success 


1020 
2019/11/18 05:46:25

Constructor is injective

kkob 
Success 


1019 
2019/11/14 20:34:43

gcd(n, n+1) = 1

blue_jam 
Failure 


1018 
2019/11/14 20:33:02

gcd(n, n+1) = 1

nuip 
Failure 


1017 
2019/11/11 01:23:21

Uniqueness of inequality proofs

yodvhskd 
Success 


1016 
2019/11/10 22:21:39

De Morgan's laws in Coq

yodvhskd 
Success 


1015 
2019/11/10 22:15:03

mult_n_O

yodvhskd 
Success 


1014 
2019/11/10 22:13:42

n * S m = n + n * m

yodvhskd 
Success 


1013 
2019/11/10 22:11:58

Summand of one

yodvhskd 
Success 


1012 
2019/11/10 22:07:56

n < m \/ n = m \/ n > m

yodvhskd 
Success 


1011 
2019/11/10 22:07:01

Definitions of injectivity

yodvhskd 
Success 


1010 
2019/11/10 21:59:54

Any natural number is expressible in binary notation

yodvhskd 
Success 


1009 
2019/11/10 21:48:52

Any natural number is expressible in binary notation

yodvhskd 
Rejected 


1008 
2019/11/10 21:04:29

Multiplication of nonzero value in F_p is injective

yodvhskd 
Success 


1007 
2019/11/10 19:19:56

Grand Garden

yodvhskd 
Success 


1006 
2019/11/10 16:49:26

Identity permutation

yodvhskd 
Success 


1005 
2019/11/10 03:38:44

Equivalent two quicksorts

yodvhskd 
Success 


1004 
2019/11/09 22:00:05

n < m \/ n = m \/ n > m

lo48576 
Success 


1003 
2019/11/09 20:22:48

Three is prime

lo48576 
Success 


1002 
2019/11/09 15:52:44

Booleanhole principle

lo48576 
Success 


1001 
2019/11/09 15:49:14

Booleanhole principle

lo48576 
Success 


1000 
2019/11/09 04:05:18

De Morgan's laws in Coq

lo48576 
Success 


999 
2019/11/09 02:07:44

mult_n_O

lo48576 
Success 


998 
2019/11/09 02:00:36

gcd(n, n+1) = 1

lo48576 
Success 


997 
2019/11/08 03:36:46

Summand of one

lo48576 
Success 


996 
2019/11/08 02:54:03

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

lo48576 
Success 


995 
2019/11/08 02:50:23

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

lo48576 
Failure 


994 
2019/11/07 23:16:42

n * S m = n + n * m

lo48576 
Success 


993 
2019/11/07 21:15:46

Definitions of injectivity

na4zagin3 
Success 


992 
2019/11/07 21:13:42

Definitions of injectivity

nuip 
Failure 


991 
2019/11/07 20:37:25

Multiplication in F_2 is idempotent

na4zagin3 
Success 


990 
2019/11/07 20:37:01

Multiplication in F_2 is idempotent

na4zagin3 
Failure 


989 
2019/11/07 20:09:28

Multiplication in F_2 is idempotent

na4zagin3 
Failure 


988 
2019/11/07 20:05:22

Multiplication in F_2 is idempotent

nuip 
Failure 


987 
2019/11/07 19:46:45

Multiplication in F_2 is idempotent

yodvhskd 
Success 


986 
2019/11/07 19:33:35

Cumulative sum of list

nekodesu 
Failure 


985 
2019/11/07 19:22:49

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

lo48576 
Success 


984 
2019/11/07 17:36:01

plus_comm

lo48576 
Success 


983 
2019/11/07 17:11:20

1 + 1 = 2

lo48576 
Success 


982 
2019/11/07 16:58:51

plus_comm

lo48576 
Success 


981 
2019/11/07 15:33:17

plus_assoc

lo48576 
Success 

