Datasets:
phanerozoic
/
Why3

Dataset card Data Studio Files
xet
Community
fact
stringlengths
5
124
type
stringclasses
3 values
library
stringclasses
5 values
imports
listlengths
0
177
filename
stringclasses
414 values
symbolic_name
stringlengths
1
57
docstring
stringclasses
1 value
div_3 : forall n:int. 0 <= n -> div n 3 >= 0
lemma
examples
[ "int.Int", "int.ComputerDivision", "int.Int", "int.ComputerDivision", "int.Div2", "DivModHints", "int.Int", "int.ComputerDivision", "TriangularNumbers", "DivModHints", "SumMultiple", "int.Int", "mach.int.Int", "io.StdIO", "ref.Ref" ]
examples/euler001.mlw
div_3
Closed_Formula : forall n:int. 0 <= n -> sum_multiple_3_5_lt (n+1) = closed_formula n
lemma
examples
[ "int.Int", "int.ComputerDivision", "int.Int", "int.ComputerDivision", "int.Div2", "DivModHints", "int.Int", "int.ComputerDivision", "TriangularNumbers", "DivModHints", "SumMultiple", "int.Int", "mach.int.Int", "io.StdIO", "ref.Ref" ]
examples/euler001.mlw
Closed_Formula
tr(n:int) : int
function
examples
[ "int.Int", "int.ComputerDivision", "int.Int", "int.ComputerDivision", "int.Div2", "DivModHints", "int.Int", "int.ComputerDivision", "TriangularNumbers", "DivModHints", "SumMultiple", "int.Int", "mach.int.Int", "io.StdIO", "ref.Ref" ]
examples/euler001.mlw
tr
closed_formula_aux(n:int) : int
function
examples
[ "int.Int", "int.ComputerDivision", "int.Int", "int.ComputerDivision", "int.Div2", "DivModHints", "int.Int", "int.ComputerDivision", "TriangularNumbers", "DivModHints", "SumMultiple", "int.Int", "mach.int.Int", "io.StdIO", "ref.Ref" ]
examples/euler001.mlw
closed_formula_aux
closed_formula(n:int) : int
function
examples
[ "int.Int", "int.ComputerDivision", "int.Int", "int.ComputerDivision", "int.Div2", "DivModHints", "int.Int", "int.ComputerDivision", "TriangularNumbers", "DivModHints", "SumMultiple", "int.Int", "mach.int.Int", "io.StdIO", "ref.Ref" ]
examples/euler001.mlw
closed_formula
p(n:int) = sum_multiple_3_5_lt (n+1) = closed_formula_aux n
predicate
examples
[ "int.Int", "int.ComputerDivision", "int.Int", "int.ComputerDivision", "int.Div2", "DivModHints", "int.Int", "int.ComputerDivision", "TriangularNumbers", "DivModHints", "SumMultiple", "int.Int", "mach.int.Int", "io.StdIO", "ref.Ref" ]
examples/euler001.mlw
p
p = p
predicate
examples
[ "int.Int", "int.ComputerDivision", "int.Int", "int.ComputerDivision", "int.Div2", "DivModHints", "int.Int", "int.ComputerDivision", "TriangularNumbers", "DivModHints", "SumMultiple", "int.Int", "mach.int.Int", "io.StdIO", "ref.Ref" ]
examples/euler001.mlw
p
fib_even0 : fib_even 0 = 0
lemma
examples
[ "int.Int", "int.Fibonacci", "int.ComputerDivision", "int.Int", "int.ComputerDivision", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "FibSumEven", "FibOnlyEven" ]
examples/euler002.mlw
fib_even0
fib_even1 : fib_even 1 = 2
lemma
examples
[ "int.Int", "int.Fibonacci", "int.ComputerDivision", "int.Int", "int.ComputerDivision", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "FibSumEven", "FibOnlyEven" ]
examples/euler002.mlw
fib_even1
fib_evenn : forall n:int [fib_even n].
lemma
examples
[ "int.Int", "int.Fibonacci", "int.ComputerDivision", "int.Int", "int.ComputerDivision", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "FibSumEven", "FibOnlyEven" ]
examples/euler002.mlw
fib_evenn
fib_even(n: int) : int
function
examples
[ "int.Int", "int.Fibonacci", "int.ComputerDivision", "int.Int", "int.ComputerDivision", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "FibSumEven", "FibOnlyEven" ]
examples/euler002.mlw
fib_even
conservation_previously_marked_multiples_on_marked_change : forall marked n.
lemma
examples
[ "of", "int.Int", "number.Divisibility", "number.Prime", "int.EuclideanDivision", "int.Int", "int.EuclideanDivision", "number.Divisibility", "number.Prime", "ArithmeticResults", "int.Int", "number.Divisibility", "number.Prime", "seq.Seq", "int.EuclideanDivision", "ArithmeticResults", "DivisibilityResults", "int.Int", "number.Divisibility", "number.Prime", "seq.Seq", "int.EuclideanDivision", "ArithmeticResults", "DivisibilityResults", "EulerSieveSpec", "mach.int.Int63", "int.Int", "seq.Seq", "mach.int.Int63", "mach.array.ArrayInt63", "int.Abs", "int.EuclideanDivision", "number.Divisibility", "number.Prime", "DivisibilityResults", "EulerSieveSpec" ]
examples/euler_sieve.mlw
conservation_previously_marked_multiples_on_marked_change
valid(f:fenwick) = f.leaves >= 0 /\
predicate
examples
[ "int.Int", "int.ComputerDivision", "ref.Ref", "int.Sum", "array.Array", "the", "compaction" ]
examples/fenwick.mlw
valid
isfib_2_1 : fib 2 = 1
lemma
examples
[ "int.Fibonacci", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "int.Int", "int.Power", "list.List", "list.Mem", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "list.List", "SmallestFibAbove", "int.Int", "int.Int", "int.Fibonacci", "int.ComputerDivision", "Mat22", "int.Int", "int.Fibonacci" ]
examples/fibonacci.mlw
isfib_2_1
isfib_6_8 : fib 6 = 8
lemma
examples
[ "int.Fibonacci", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "int.Int", "int.Power", "list.List", "list.Mem", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "list.List", "SmallestFibAbove", "int.Int", "int.Int", "int.Fibonacci", "int.ComputerDivision", "Mat22", "int.Int", "int.Fibonacci" ]
examples/fibonacci.mlw
isfib_6_8
not_isfib_2_2 : fib 2 <> 2
lemma
examples
[ "int.Fibonacci", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "int.Int", "int.Power", "list.List", "list.Mem", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "list.List", "SmallestFibAbove", "int.Int", "int.Int", "int.Fibonacci", "int.ComputerDivision", "Mat22", "int.Int", "int.Fibonacci" ]
examples/fibonacci.mlw
not_isfib_2_2
pow_pos : forall x. x >= 0 -> power 3 x > 0
lemma
examples
[ "int.Fibonacci", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "int.Int", "int.Power", "list.List", "list.Mem", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "list.List", "SmallestFibAbove", "int.Int", "int.Int", "int.Fibonacci", "int.ComputerDivision", "Mat22", "int.Int", "int.Fibonacci" ]
examples/fibonacci.mlw
pow_pos
fib_12 : fib 12 = 144
lemma
examples
[ "int.Fibonacci", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "int.Int", "int.Power", "list.List", "list.Mem", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "list.List", "SmallestFibAbove", "int.Int", "int.Int", "int.Fibonacci", "int.ComputerDivision", "Mat22", "int.Int", "int.Fibonacci" ]
examples/fibonacci.mlw
fib_12
fib_13 : fib 13 = 233
lemma
examples
[ "int.Fibonacci", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "int.Int", "int.Power", "list.List", "list.Mem", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "list.List", "SmallestFibAbove", "int.Int", "int.Int", "int.Fibonacci", "int.ComputerDivision", "Mat22", "int.Int", "int.Fibonacci" ]
examples/fibonacci.mlw
fib_13
fib_14 : fib 14 = 377
lemma
examples
[ "int.Fibonacci", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "int.Int", "int.Power", "list.List", "list.Mem", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "list.List", "SmallestFibAbove", "int.Int", "int.Int", "int.Fibonacci", "int.ComputerDivision", "Mat22", "int.Int", "int.Fibonacci" ]
examples/fibonacci.mlw
fib_14
fib_square : forall n: int. n >= 0 -> fib n = n*n <-> n=0 \/ n=1 \/ n=12
lemma
examples
[ "int.Fibonacci", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "int.Int", "int.Power", "list.List", "list.Mem", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "list.List", "SmallestFibAbove", "int.Int", "int.Int", "int.Fibonacci", "int.ComputerDivision", "Mat22", "int.Int", "int.Fibonacci" ]
examples/fibonacci.mlw
fib_square
sum_fib(l:list int) : int
function
examples
[ "int.Fibonacci", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "int.Int", "int.Power", "list.List", "list.Mem", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "list.List", "SmallestFibAbove", "int.Int", "int.Int", "int.Fibonacci", "int.ComputerDivision", "Mat22", "int.Int", "int.Fibonacci" ]
examples/fibonacci.mlw
sum_fib
sum_pow(l:list int) : int
function
examples
[ "int.Fibonacci", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "int.Int", "int.Power", "list.List", "list.Mem", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "list.List", "SmallestFibAbove", "int.Int", "int.Int", "int.Fibonacci", "int.ComputerDivision", "Mat22", "int.Int", "int.Fibonacci" ]
examples/fibonacci.mlw
sum_pow
sum(l: list int) : int
function
examples
[ "int.Fibonacci", "int.Fibonacci", "int.Int", "ref.Ref", "int.Fibonacci", "int.Int", "int.Power", "list.List", "list.Mem", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "int.Fibonacci", "int.Int", "int.MinMax", "ref.Ref", "list.List", "SmallestFibAbove", "int.Int", "int.Int", "int.Fibonacci", "int.ComputerDivision", "Mat22", "int.Int", "int.Fibonacci" ]
examples/fibonacci.mlw
sum
inv(t : table) = forall x y : int. t[x] = Some y -> y = fib x
predicate
examples
[ "option.Option", "int.Int", "int.Fibonacci", "ref.Ref", "map.Map" ]
examples/fib_memo.mlw
inv
found(a: array int) = forall p q:int. 1 <= p <= f <= q <= _N -> a[p] <= a[f] <= a[q]
predicate
examples
[ "int.Int", "ref.Ref", "array.Array", "array.ArrayPermut" ]
examples/find.mlw
found
d_m(b:digit 'a) : list 'a
function
examples
[ "int.Int", "list.List", "list.Length", "list.Append" ]
examples/finger_trees.mlw
d_m
t_m(t:t 'a) : list 'a
function
examples
[ "int.Int", "list.List", "list.Length", "list.Append" ]
examples/finger_trees.mlw
t_m
fixpoint(x:t) = mem x a /\ f x = x
predicate
examples
[ "set.Fset", "set.Fset", "set.Fset", "ref.Ref" ]
examples/finite_tarski.mlw
fixpoint
nb_occ_store_outside_up : forall a: map int color, i j k: int, c: color.
lemma
examples
[ "int.Int", "map.Map", "ref.Ref", "array.Array" ]
examples/flag2.mlw
nb_occ_store_outside_up
nb_occ_store_outside_down : forall a: map int color, i j k: int, c: color.
lemma
examples
[ "int.Int", "map.Map", "ref.Ref", "array.Array" ]
examples/flag2.mlw
nb_occ_store_outside_down
nb_occ_store_eq_eq : forall a: map int color, i j k: int, c: color.
lemma
examples
[ "int.Int", "map.Map", "ref.Ref", "array.Array" ]
examples/flag2.mlw
nb_occ_store_eq_eq
braun(t: tree 'a) = match t with
predicate
examples
[ "int.Int", "int.ComputerDivision", "export", "export", "seq.Seq", "int.Int", "BraunTrees" ]
examples/flexible_arrays.mlw
braun
size(t: tree) : int
function
examples
[ "int.Int", "int.MinMax" ]
examples/foveoos11_challenge2.mlw
size
L3 : forall n: int. 0 <= n -> n <= f n && f n <= f (f n)
lemma
examples
[ "export", "Puzzle", "Puzzle", "Step1" ]
examples/f_puzzle.mlw
L3
L4 : forall n: int. 0 <= n -> f n < f (n+1)
lemma
examples
[ "export", "Puzzle", "Puzzle", "Step1" ]
examples/f_puzzle.mlw
L4
L5 : forall n m: int. 0 <= n <= m -> f n <= f m
lemma
examples
[ "export", "Puzzle", "Puzzle", "Step1" ]
examples/f_puzzle.mlw
L5
L6 : forall n: int. 0 <= n -> f n < n+1
lemma
examples
[ "export", "Puzzle", "Puzzle", "Step1" ]
examples/f_puzzle.mlw
L6
p(k: int) = forall n: int. 0 <= n -> k <= f (n+k)
predicate
examples
[ "export", "Puzzle", "Puzzle", "Step1" ]
examples/f_puzzle.mlw
p
p = p, lemma base, lemma induction_step
predicate
examples
[ "export", "Puzzle", "Puzzle", "Step1" ]
examples/f_puzzle.mlw
p
p'(k: int) = forall n m: int. 0 <= n <= m <= k -> f n <= f m
predicate
examples
[ "export", "Puzzle", "Puzzle", "Step1" ]
examples/f_puzzle.mlw
p'
p = p', lemma base, lemma induction_step
predicate
examples
[ "export", "Puzzle", "Puzzle", "Step1" ]
examples/f_puzzle.mlw
p
even1 : forall n: int. 0 <= n -> even n <-> n = 2 * div n 2
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd.mlw
even1
odd1 : forall n: int. 0 <= n -> not (even n) <-> n = 2 * div n 2 + 1
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd.mlw
odd1
div_nonneg : forall n: int. 0 <= n -> 0 <= div n 2
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd.mlw
div_nonneg
gcd_even_even : forall u v: int. 0 <= v -> 0 <= u ->
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd.mlw
gcd_even_even
gcd_even_odd : forall u v: int. 0 <= v -> 0 <= u ->
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd.mlw
gcd_even_odd
gcd_even_odd2 : forall u v: int. 0 <= v -> 0 <= u ->
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd.mlw
gcd_even_odd2
odd_odd_div2 : forall u v: int. 0 <= v -> 0 <= u ->
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd.mlw
odd_odd_div2
gcd_odd_odd2 : forall u v: int. 0 <= v <= u ->
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd.mlw
gcd_odd_odd2
even1 : forall n: int. 0 <= n -> even n <-> n = 2 * div n 2
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd_vc_sp.mlw
even1
odd1 : forall n: int. 0 <= n -> not (even n) <-> n = 2 * div n 2 + 1
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd_vc_sp.mlw
odd1
div_nonneg : forall n: int. 0 <= n -> 0 <= div n 2
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd_vc_sp.mlw
div_nonneg
gcd_even_even : forall u v: int. 0 <= v -> 0 <= u ->
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd_vc_sp.mlw
gcd_even_even
gcd_even_odd : forall u v: int. 0 <= v -> 0 <= u ->
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd_vc_sp.mlw
gcd_even_odd
gcd_even_odd2 : forall u v: int. 0 <= v -> 0 <= u ->
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd_vc_sp.mlw
gcd_even_odd2
odd_odd_div2 : forall u v: int. 0 <= v -> 0 <= u ->
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd_vc_sp.mlw
odd_odd_div2
gcd_odd_odd2 : forall u v: int. 0 <= v <= u ->
lemma
examples
[ "mach.int.Int", "number.Gcd", "mach.int.Int", "ref.Ref", "number.Gcd", "mach.int.Int", "number.Parity", "number.Gcd", "number.Coprime", "mach.int.Int31", "number.Gcd", "mach.int.Int63", "number.Gcd" ]
examples/gcd_vc_sp.mlw
gcd_odd_odd2
size_nonneg : forall t: tree. size t >= 0
lemma
examples
[ "int.Int", "list.List", "list.Mem", "list.Append", "list.Distinct", "array.Array", "list.Length" ]
examples/generate_all_trees.mlw
size_nonneg
size_left : forall t: tree. size t > 0 ->
lemma
examples
[ "int.Int", "list.List", "list.Mem", "list.Append", "list.Distinct", "array.Array", "list.Length" ]
examples/generate_all_trees.mlw
size_left
all_trees_0 : all_trees 0 (Cons Empty Nil)
lemma
examples
[ "int.Int", "list.List", "list.Mem", "list.Append", "list.Distinct", "array.Array", "list.Length" ]
examples/generate_all_trees.mlw
all_trees_0
tree_diff : forall l1 l2: tree. size l1 <> size l2 ->
lemma
examples
[ "int.Int", "list.List", "list.Mem", "list.Append", "list.Distinct", "array.Array", "list.Length" ]
examples/generate_all_trees.mlw
tree_diff
size(t: tree) : int
function
examples
[ "int.Int", "list.List", "list.Mem", "list.Append", "list.Distinct", "array.Array", "list.Length" ]
examples/generate_all_trees.mlw
size
countZero : count zeros = zeros
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
countZero
numOfZero : NumOf.numof (fun i -> nth zeros i) 0 32 = 0
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
numOfZero
countStep : forall b.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
countStep
countSpec : forall b. t'int (count b) = NumOf.numof
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
countSpec
symmetric : forall a b. hammingD a b = hammingD b a
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
symmetric
separation : forall a b. hammingD a b = zeros <-> a = b
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
separation
triangleInequality : forall a b c.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
triangleInequality
asciiProp : forall a b.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
asciiProp
iso : forall b.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
iso
grayIsGray : forall b.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
grayIsGray
nthGray : forall b i.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
nthGray
lastNthGray : forall b.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
lastNthGray
nthBinary : forall b i.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
nthBinary
evenOdd : forall b.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
evenOdd
DM1 : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
DM1
DM2 : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
DM2
DM3 : forall x.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
DM3
DM4 : forall x.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
DM4
DM5 : forall x.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
DM5
DM6 : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
DM6
DM7 : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
DM7
DM8 : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
DM8
DMtest : forall x.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
DMtest
Aa : forall x.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
Aa
Ac : forall x.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
Ac
Ad : forall x.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
Ad
Ae : forall x.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
Ae
Af : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
Af
Aj : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
Aj
An : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
An
Ao : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
Ao
Aq : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
Aq
At : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
At
Au : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
Au
Av : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
Av
IE1 : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
IE1
IE2 : forall x y.
lemma
examples
[ "bv.BV32", "int.Int", "int.NumOf", "bv.BV32", "Utils", "int.Int", "int.NumOf", "bool.Bool", "bv.BV32", "Utils" ]
examples/hackers-delight.mlw
IE2