Metrics for Data.Colour.CIE:cieLAB from colour-2.3.3, D

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 7 to 7 computations (0% saved)

sample662.0ms (34.9%)

Memory

32.4MiB live, 555.8MiB allocated; 124ms collecting garbage

Samples

433.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 180.0ms

ival-sub!: 130.0ms (72.1% of total)

ival-div!: 49.0ms (27.2% of total)

adjust: 1.0ms (0.6% of total)

Bogosity

preprocess138.0ms (7.3%)

Memory

-33.8MiB live, 57.7MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	45	30
2	105	30
3	197	30
4	414	30
5	2959	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 x (/.f64 y #s(literal 200 binary64)))

Compiler

Compiled 10 to 10 computations (0% saved)

series3.0ms (0.2%)

Memory

8.2MiB live, 8.2MiB allocated; 0ms collecting garbage

Counts

5 → 10

Calls

Call 1

Inputs
(-.f64 x (/.f64 y #s(literal 200 binary64)))
x
(/.f64 y #s(literal 200 binary64))
y
#s(literal 200 binary64)

Outputs
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1/200 y)))
#s(approx (- x (/ y 200)) #s(hole binary64 (- x (* 1/200 y))))
#s(approx x #s(hole binary64 x))
#s(approx (- x (/ y 200)) #s(hole binary64 (* x (+ 1 (* -1/200 (/ y x))))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* x (- (* 1/200 (/ y x)) 1)))))
#s(approx (- x (/ y 200)) #s(hole binary64 (+ x (* -1/200 y))))
#s(approx (/ y 200) #s(hole binary64 (* 1/200 y)))
#s(approx y #s(hole binary64 y))
#s(approx (- x (/ y 200)) #s(hole binary64 (* y (- (/ x y) 1/200))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* y (+ 1/200 (* -1 (/ x y)))))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	inf	((- x (/ y 200)) x (/ y 200) y 200)
1.0ms	y	@	-inf	((- x (/ y 200)) x (/ y 200) y 200)
1.0ms	x	@	-inf	((- x (/ y 200)) x (/ y 200) y 200)
0.0ms	x	@	inf	((- x (/ y 200)) x (/ y 200) y 200)
0.0ms	y	@	0	((- x (/ y 200)) x (/ y 200) y 200)

rewrite195.0ms (10.3%)

Memory

34.1MiB live, 220.0MiB allocated; 21ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	40	117
0	42	111
1	210	111
2	1562	111
0	8105	99
1	30143	99

Stop Event

1×	saturated
1×	node-limit
1×	iter-limit

Counts

15 → 42

Calls

Call 1

Inputs
(-.f64 x (/.f64 y #s(literal 200 binary64)))
x
(/.f64 y #s(literal 200 binary64))
y
#s(literal 200 binary64)
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1/200 y)))
#s(approx (- x (/ y 200)) #s(hole binary64 (- x (* 1/200 y))))
#s(approx x #s(hole binary64 x))
#s(approx (- x (/ y 200)) #s(hole binary64 (* x (+ 1 (* -1/200 (/ y x))))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* x (- (* 1/200 (/ y x)) 1)))))
#s(approx (- x (/ y 200)) #s(hole binary64 (+ x (* -1/200 y))))
#s(approx (/ y 200) #s(hole binary64 (* 1/200 y)))
#s(approx y #s(hole binary64 y))
#s(approx (- x (/ y 200)) #s(hole binary64 (* y (- (/ x y) 1/200))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* y (+ 1/200 (* -1 (/ x y)))))))

Outputs
(neg.f64 (-.f64 (*.f64 #s(literal 1/200 binary64) y) x))
(fma.f64 (/.f64 y #s(literal 1 binary64)) #s(literal -1/200 binary64) x)
(fma.f64 (neg.f64 y) #s(literal 1/200 binary64) x)
(fma.f64 #s(literal -1 binary64) (*.f64 #s(literal 1/200 binary64) y) x)
(fma.f64 #s(literal 1/200 binary64) (neg.f64 y) x)
(fma.f64 #s(literal -1/200 binary64) (/.f64 y #s(literal 1 binary64)) x)
(fma.f64 #s(literal -1/200 binary64) y x)
(fma.f64 (*.f64 #s(literal 1/200 binary64) y) #s(literal -1 binary64) x)
(fma.f64 y #s(literal -1/200 binary64) x)
(-.f64 (*.f64 #s(literal -1/200 binary64) y) (neg.f64 x))
(-.f64 x (*.f64 #s(literal 1/200 binary64) y))
(+.f64 (*.f64 #s(literal -1/200 binary64) y) x)
(+.f64 x (*.f64 #s(literal -1/200 binary64) y))
x
(*.f64 (/.f64 y #s(literal 1 binary64)) #s(literal 1/200 binary64))
(*.f64 (neg.f64 y) #s(literal -1/200 binary64))
(.f64 #s(literal 1 binary64) (.f64 #s(literal 1/200 binary64) y))
(*.f64 #s(literal 1/200 binary64) (/.f64 y #s(literal 1 binary64)))
(*.f64 #s(literal 1/200 binary64) y)
(*.f64 #s(literal -1/200 binary64) (neg.f64 y))
(.f64 (.f64 #s(literal 1/200 binary64) y) #s(literal 1 binary64))
(*.f64 y #s(literal 1/200 binary64))
(/.f64 (neg.f64 (*.f64 y #s(literal 1 binary64))) #s(literal -200 binary64))
(/.f64 (neg.f64 (neg.f64 (neg.f64 y))) #s(literal -200 binary64))
(/.f64 (*.f64 y #s(literal 1 binary64)) #s(literal 200 binary64))
(/.f64 (*.f64 #s(literal 1 binary64) y) #s(literal 200 binary64))
(/.f64 (neg.f64 (neg.f64 y)) #s(literal 200 binary64))
(/.f64 (neg.f64 y) #s(literal -200 binary64))
(/.f64 y #s(literal 200 binary64))
(neg.f64 (*.f64 #s(literal -1/200 binary64) y))
y
#s(literal 200 binary64)
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
#s(approx (- x (/ y 200)) (fma.f64 #s(literal -1/200 binary64) y x))
#s(approx x x)
#s(approx (- x (/ y 200)) (*.f64 (fma.f64 (/.f64 y x) #s(literal -1/200 binary64) #s(literal 1 binary64)) x))
#s(approx (- x (/ y 200)) (*.f64 (fma.f64 (/.f64 y x) #s(literal -1/200 binary64) #s(literal 1 binary64)) x))
#s(approx (- x (/ y 200)) (fma.f64 #s(literal -1/200 binary64) y x))
#s(approx (/ y 200) (*.f64 #s(literal 1/200 binary64) y))
#s(approx y y)
#s(approx (- x (/ y 200)) (*.f64 (-.f64 (/.f64 x y) #s(literal 1/200 binary64)) y))
#s(approx (- x (/ y 200)) (*.f64 (-.f64 (/.f64 x y) #s(literal 1/200 binary64)) y))

eval3.0ms (0.2%)

Memory: 4.8MiB live, 4.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 112 to 81 computations (27.7% saved)

prune2.0ms (0.1%)

Memory

3.7MiB live, 3.7MiB allocated; 0ms collecting garbage

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	32	3	35
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	32	4	36

Accuracy

100.0%

Counts

36 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.9%	(fma.f64 y #s(literal -1/200 binary64) x)
✓	100.0%	(-.f64 x (/.f64 y #s(literal 200 binary64)))
▶	99.9%	(-.f64 x (*.f64 y #s(literal 1/200 binary64)))
▶	51.7%	#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))

Compiler

Compiled 22 to 22 computations (0% saved)

series5.0ms (0.2%)

Memory

-38.7MiB live, 8.3MiB allocated; 2ms collecting garbage

Counts

9 → 10

Calls

Call 1

Inputs
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
(*.f64 #s(literal -1/200 binary64) y)
#s(literal -1/200 binary64)
y
(-.f64 x (*.f64 y #s(literal 1/200 binary64)))
x
(*.f64 y #s(literal 1/200 binary64))
#s(literal 1/200 binary64)
(fma.f64 y #s(literal -1/200 binary64) x)

Outputs
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1/200 y)))
#s(approx (- x (/ y 200)) #s(hole binary64 (- x (* 1/200 y))))
#s(approx x #s(hole binary64 x))
#s(approx (+ (* y -1/200) x) #s(hole binary64 (+ x (* -1/200 y))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* x (+ 1 (* -1/200 (/ y x))))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* x (- (* 1/200 (/ y x)) 1)))))
#s(approx y #s(hole binary64 y))
#s(approx (* y 1/200) #s(hole binary64 (* 1/200 y)))
#s(approx (- x (/ y 200)) #s(hole binary64 (* y (- (/ x y) 1/200))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* y (+ 1/200 (* -1 (/ x y)))))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((- x (/ y 200)) (* -1/200 y) -1/200 y (- x (* y 1/200)) x (* y 1/200) 1/200 (+ (* y -1/200) x))
1.0ms	x	@	-inf	((- x (/ y 200)) (* -1/200 y) -1/200 y (- x (* y 1/200)) x (* y 1/200) 1/200 (+ (* y -1/200) x))
1.0ms	y	@	-inf	((- x (/ y 200)) (* -1/200 y) -1/200 y (- x (* y 1/200)) x (* y 1/200) 1/200 (+ (* y -1/200) x))
1.0ms	y	@	inf	((- x (/ y 200)) (* -1/200 y) -1/200 y (- x (* y 1/200)) x (* y 1/200) 1/200 (+ (* y -1/200) x))
0.0ms	y	@	0	((- x (/ y 200)) (* -1/200 y) -1/200 y (- x (* y 1/200)) x (* y 1/200) 1/200 (+ (* y -1/200) x))

rewrite212.0ms (11.2%)

Memory

2.5MiB live, 142.3MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	46	133
0	48	117
1	247	117
2	1694	117
0	8334	115
1	31266	115

Stop Event

1×	saturated
1×	node-limit
1×	iter-limit

Counts

19 → 83

Calls

Call 1

Inputs
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
(*.f64 #s(literal -1/200 binary64) y)
#s(literal -1/200 binary64)
y
(-.f64 x (*.f64 y #s(literal 1/200 binary64)))
x
(*.f64 y #s(literal 1/200 binary64))
#s(literal 1/200 binary64)
(fma.f64 y #s(literal -1/200 binary64) x)
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1/200 y)))
#s(approx (- x (/ y 200)) #s(hole binary64 (- x (* 1/200 y))))
#s(approx x #s(hole binary64 x))
#s(approx (+ (* y -1/200) x) #s(hole binary64 (+ x (* -1/200 y))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* x (+ 1 (* -1/200 (/ y x))))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* x (- (* 1/200 (/ y x)) 1)))))
#s(approx y #s(hole binary64 y))
#s(approx (* y 1/200) #s(hole binary64 (* 1/200 y)))
#s(approx (- x (/ y 200)) #s(hole binary64 (* y (- (/ x y) 1/200))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* y (+ 1/200 (* -1 (/ x y)))))))

Outputs
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
(*.f64 (/.f64 (neg.f64 y) #s(literal 1 binary64)) #s(literal 1/200 binary64))
(*.f64 (/.f64 y #s(literal 1 binary64)) #s(literal -1/200 binary64))
(*.f64 (neg.f64 y) #s(literal 1/200 binary64))
(.f64 #s(literal -1 binary64) (.f64 #s(literal 1/200 binary64) y))
(.f64 (.f64 #s(literal -1/200 binary64) y) #s(literal 1 binary64))
(.f64 (.f64 #s(literal 1/200 binary64) y) #s(literal -1 binary64))
(*.f64 #s(literal 1/200 binary64) (neg.f64 y))
(*.f64 #s(literal -1/200 binary64) (/.f64 y #s(literal 1 binary64)))
(*.f64 #s(literal -1/200 binary64) y)
(*.f64 y #s(literal -1/200 binary64))
(/.f64 (neg.f64 (*.f64 (neg.f64 y) #s(literal 1 binary64))) #s(literal -200 binary64))
(/.f64 (neg.f64 (neg.f64 (neg.f64 y))) #s(literal 200 binary64))
(/.f64 (*.f64 (neg.f64 y) #s(literal 1 binary64)) #s(literal 200 binary64))
(/.f64 (*.f64 #s(literal 1 binary64) y) #s(literal -200 binary64))
(/.f64 (neg.f64 (neg.f64 y)) #s(literal -200 binary64))
(/.f64 (neg.f64 y) #s(literal 200 binary64))
(/.f64 y #s(literal -200 binary64))
(neg.f64 (*.f64 #s(literal 1/200 binary64) y))
#s(literal -1/200 binary64)
y
(neg.f64 (-.f64 (neg.f64 x) (*.f64 #s(literal -1/200 binary64) y)))
(neg.f64 (-.f64 (*.f64 #s(literal 1/200 binary64) y) x))
(fma.f64 (/.f64 (neg.f64 y) #s(literal 1 binary64)) #s(literal 1/200 binary64) x)
(fma.f64 (/.f64 y #s(literal 1 binary64)) #s(literal -1/200 binary64) x)
(fma.f64 (neg.f64 y) #s(literal 1/200 binary64) x)
(fma.f64 #s(literal -1 binary64) (*.f64 #s(literal 1/200 binary64) y) x)
(fma.f64 (*.f64 #s(literal -1/200 binary64) y) #s(literal 1 binary64) x)
(fma.f64 (*.f64 #s(literal 1/200 binary64) y) #s(literal -1 binary64) x)
(fma.f64 #s(literal 1/200 binary64) (neg.f64 y) x)
(fma.f64 #s(literal -1/200 binary64) (/.f64 y #s(literal 1 binary64)) x)
(fma.f64 #s(literal -1/200 binary64) y x)
(fma.f64 y #s(literal -1/200 binary64) x)
(-.f64 (*.f64 #s(literal -1/200 binary64) y) (neg.f64 x))
(-.f64 x (*.f64 (neg.f64 (neg.f64 y)) #s(literal 1/200 binary64)))
(-.f64 x (*.f64 #s(literal 1/200 binary64) y))
(+.f64 (*.f64 #s(literal -1/200 binary64) y) x)
(+.f64 x (*.f64 #s(literal -1/200 binary64) y))
x
(*.f64 (/.f64 y #s(literal 1 binary64)) #s(literal 1/200 binary64))
(*.f64 (neg.f64 y) #s(literal -1/200 binary64))
(.f64 #s(literal 1 binary64) (.f64 #s(literal 1/200 binary64) y))
(.f64 (.f64 #s(literal 1/200 binary64) y) #s(literal 1 binary64))
(*.f64 #s(literal 1/200 binary64) (/.f64 y #s(literal 1 binary64)))
(*.f64 #s(literal 1/200 binary64) y)
(*.f64 #s(literal -1/200 binary64) (neg.f64 y))
(*.f64 y #s(literal 1/200 binary64))
(/.f64 (neg.f64 (*.f64 y #s(literal 1 binary64))) #s(literal -200 binary64))
(/.f64 (neg.f64 (neg.f64 (neg.f64 y))) #s(literal -200 binary64))
(/.f64 (*.f64 #s(literal 1 binary64) y) #s(literal 200 binary64))
(/.f64 (*.f64 y #s(literal 1 binary64)) #s(literal 200 binary64))
(/.f64 (neg.f64 (neg.f64 y)) #s(literal 200 binary64))
(/.f64 (neg.f64 y) #s(literal -200 binary64))
(/.f64 y #s(literal 200 binary64))
(neg.f64 (*.f64 #s(literal -1/200 binary64) y))
#s(literal 1/200 binary64)
(neg.f64 (-.f64 (neg.f64 x) (*.f64 #s(literal -1/200 binary64) y)))
(neg.f64 (-.f64 (*.f64 #s(literal 1/200 binary64) y) x))
(fma.f64 (/.f64 (neg.f64 y) #s(literal 1 binary64)) #s(literal 1/200 binary64) x)
(fma.f64 (/.f64 y #s(literal 1 binary64)) #s(literal -1/200 binary64) x)
(fma.f64 (neg.f64 y) #s(literal 1/200 binary64) x)
(fma.f64 #s(literal -1 binary64) (*.f64 #s(literal 1/200 binary64) y) x)
(fma.f64 (*.f64 #s(literal -1/200 binary64) y) #s(literal 1 binary64) x)
(fma.f64 (*.f64 #s(literal 1/200 binary64) y) #s(literal -1 binary64) x)
(fma.f64 #s(literal 1/200 binary64) (neg.f64 y) x)
(fma.f64 #s(literal -1/200 binary64) (/.f64 y #s(literal 1 binary64)) x)
(fma.f64 #s(literal -1/200 binary64) y x)
(fma.f64 y #s(literal -1/200 binary64) x)
(-.f64 (*.f64 #s(literal -1/200 binary64) y) (neg.f64 x))
(-.f64 x (*.f64 (neg.f64 (neg.f64 y)) #s(literal 1/200 binary64)))
(-.f64 x (*.f64 #s(literal 1/200 binary64) y))
(+.f64 (*.f64 #s(literal -1/200 binary64) y) x)
(+.f64 x (*.f64 #s(literal -1/200 binary64) y))
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
#s(approx (- x (/ y 200)) (fma.f64 #s(literal -1/200 binary64) y x))
#s(approx x x)
#s(approx (- x (/ y 200)) (fma.f64 #s(literal -1/200 binary64) y x))
#s(approx (- x (/ y 200)) (*.f64 (fma.f64 (/.f64 y x) #s(literal -1/200 binary64) #s(literal 1 binary64)) x))
#s(approx (- x (/ y 200)) (*.f64 (fma.f64 (/.f64 y x) #s(literal -1/200 binary64) #s(literal 1 binary64)) x))
#s(approx y y)
#s(approx (* y 1/200) (*.f64 #s(literal 1/200 binary64) y))
#s(approx (- x (/ y 200)) (*.f64 (-.f64 (/.f64 x y) #s(literal 1/200 binary64)) y))
#s(approx (- x (/ y 200)) (*.f64 (-.f64 (/.f64 x y) #s(literal 1/200 binary64)) y))

eval5.0ms (0.2%)

Memory: 13.2MiB live, 13.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 184 to 126 computations (31.5% saved)

prune3.0ms (0.1%)

Memory

3.7MiB live, 3.7MiB allocated; 0ms collecting garbage

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	55	1	56
Fresh	0	0	0
Picked	0	3	3
Done	1	0	1
Total	56	4	60

Accuracy

100.0%

Counts

60 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.9%	(fma.f64 y #s(literal -1/200 binary64) x)
✓	99.9%	(-.f64 x (*.f64 y #s(literal 1/200 binary64)))
▶	51.8%	#s(approx (- x (/ y 200)) (/.f64 y #s(literal -200 binary64)))
✓	51.7%	#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))

Compiler

Compiled 25 to 25 computations (0% saved)

series2.0ms (0.1%)

Memory

2.4MiB live, 2.4MiB allocated; 0ms collecting garbage

Counts

4 → 9

Calls

Call 1

Inputs
#s(approx (- x (/ y 200)) (/.f64 y #s(literal -200 binary64)))
(/.f64 y #s(literal -200 binary64))
y
#s(literal -200 binary64)

Outputs
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1/200 y)))
#s(approx (- x (/ y 200)) #s(hole binary64 (- x (* 1/200 y))))
#s(approx (- x (/ y 200)) #s(hole binary64 x))
#s(approx (- x (/ y 200)) #s(hole binary64 (* x (+ 1 (* -1/200 (/ y x))))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* x (- (* 1/200 (/ y x)) 1)))))
#s(approx (- x (/ y 200)) #s(hole binary64 (+ x (* -1/200 y))))
#s(approx y #s(hole binary64 y))
#s(approx (- x (/ y 200)) #s(hole binary64 (* y (- (/ x y) 1/200))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* y (+ 1/200 (* -1 (/ x y)))))))

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	y	@	-inf	((- x (/ y 200)) (/ y -200) y -200)
0.0ms	y	@	inf	((- x (/ y 200)) (/ y -200) y -200)
0.0ms	y	@	0	((- x (/ y 200)) (/ y -200) y -200)
0.0ms	x	@	inf	((- x (/ y 200)) (/ y -200) y -200)
0.0ms	x	@	-inf	((- x (/ y 200)) (/ y -200) y -200)

rewrite224.0ms (11.8%)

Memory

-22.8MiB live, 222.5MiB allocated; 42ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	40	117
0	41	111
1	211	111
2	1599	111
0	8570	98
1	27827	98

Stop Event

1×	saturated
1×	node-limit
1×	iter-limit

Counts

13 → 25

Calls

Call 1

Inputs
#s(approx (- x (/ y 200)) (/.f64 y #s(literal -200 binary64)))
(/.f64 y #s(literal -200 binary64))
y
#s(literal -200 binary64)
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1/200 y)))
#s(approx (- x (/ y 200)) #s(hole binary64 (- x (* 1/200 y))))
#s(approx (- x (/ y 200)) #s(hole binary64 x))
#s(approx (- x (/ y 200)) #s(hole binary64 (* x (+ 1 (* -1/200 (/ y x))))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* x (- (* 1/200 (/ y x)) 1)))))
#s(approx (- x (/ y 200)) #s(hole binary64 (+ x (* -1/200 y))))
#s(approx y #s(hole binary64 y))
#s(approx (- x (/ y 200)) #s(hole binary64 (* y (- (/ x y) 1/200))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* y (+ 1/200 (* -1 (/ x y)))))))

Outputs
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
(*.f64 (neg.f64 y) #s(literal 1/200 binary64))
(.f64 #s(literal 1 binary64) (.f64 #s(literal -1/200 binary64) y))
(*.f64 #s(literal 1/200 binary64) (neg.f64 y))
(*.f64 #s(literal -1/200 binary64) y)
(*.f64 y #s(literal -1/200 binary64))
(/.f64 (neg.f64 (*.f64 y #s(literal 1 binary64))) #s(literal 200 binary64))
(/.f64 (neg.f64 (neg.f64 (neg.f64 y))) #s(literal 200 binary64))
(/.f64 (*.f64 #s(literal 1 binary64) y) #s(literal -200 binary64))
(/.f64 (*.f64 y #s(literal 1 binary64)) #s(literal -200 binary64))
(/.f64 (neg.f64 (neg.f64 y)) #s(literal -200 binary64))
(/.f64 (neg.f64 y) #s(literal 200 binary64))
(/.f64 y #s(literal -200 binary64))
(neg.f64 (*.f64 #s(literal 1/200 binary64) y))
y
#s(literal -200 binary64)
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
#s(approx (- x (/ y 200)) (fma.f64 #s(literal -1/200 binary64) y x))
#s(approx (- x (/ y 200)) x)
#s(approx (- x (/ y 200)) (*.f64 (fma.f64 (/.f64 y x) #s(literal -1/200 binary64) #s(literal 1 binary64)) x))
#s(approx (- x (/ y 200)) (*.f64 (fma.f64 (/.f64 y x) #s(literal -1/200 binary64) #s(literal 1 binary64)) x))
#s(approx (- x (/ y 200)) (fma.f64 #s(literal -1/200 binary64) y x))
#s(approx y y)
#s(approx (- x (/ y 200)) (*.f64 (-.f64 (/.f64 x y) #s(literal 1/200 binary64)) y))
#s(approx (- x (/ y 200)) (*.f64 (-.f64 (/.f64 x y) #s(literal 1/200 binary64)) y))

eval2.0ms (0.1%)

Memory: 6.3MiB live, 6.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 68 to 54 computations (20.6% saved)

prune2.0ms (0.1%)

Memory

2.9MiB live, 2.9MiB allocated; 0ms collecting garbage

Pruning

5 alts after pruning (1 fresh and 4 done)

	Pruned	Kept	Total
New	15	1	16
Fresh	0	0	0
Picked	0	1	1
Done	0	3	3
Total	15	5	20

Accuracy

100.0%

Counts

20 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.9%	(fma.f64 y #s(literal -1/200 binary64) x)
✓	99.9%	(-.f64 x (*.f64 y #s(literal 1/200 binary64)))
✓	51.8%	#s(approx (- x (/ y 200)) (/.f64 y #s(literal -200 binary64)))
✓	51.7%	#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
▶	48.5%	#s(approx (- x (/ y 200)) x)

Compiler

Compiled 31 to 31 computations (0% saved)

series1.0ms (0.1%)

Memory

2.3MiB live, 2.3MiB allocated; 0ms collecting garbage

Counts

2 → 8

Calls

Call 1

Inputs
#s(approx (- x (/ y 200)) x)
x

Outputs
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1/200 y)))
#s(approx (- x (/ y 200)) #s(hole binary64 (- x (* 1/200 y))))
#s(approx x #s(hole binary64 x))
#s(approx (- x (/ y 200)) #s(hole binary64 (* x (+ 1 (* -1/200 (/ y x))))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* x (- (* 1/200 (/ y x)) 1)))))
#s(approx (- x (/ y 200)) #s(hole binary64 (+ x (* -1/200 y))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* y (- (/ x y) 1/200))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* y (+ 1/200 (* -1 (/ x y)))))))

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((- x (/ y 200)) x)
0.0ms	x	@	inf	((- x (/ y 200)) x)
0.0ms	y	@	inf	((- x (/ y 200)) x)
0.0ms	y	@	-inf	((- x (/ y 200)) x)
0.0ms	x	@	0	((- x (/ y 200)) x)

rewrite191.0ms (10.1%)

Memory

5.0MiB live, 250.8MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	37	104
0	37	98
1	203	98
2	1555	98
0	8101	86
1	30141	86

Stop Event

1×	saturated
1×	node-limit
1×	saturated

Counts

10 → 10

Calls

Call 1

Inputs
#s(approx (- x (/ y 200)) x)
x
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1/200 y)))
#s(approx (- x (/ y 200)) #s(hole binary64 (- x (* 1/200 y))))
#s(approx x #s(hole binary64 x))
#s(approx (- x (/ y 200)) #s(hole binary64 (* x (+ 1 (* -1/200 (/ y x))))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* x (- (* 1/200 (/ y x)) 1)))))
#s(approx (- x (/ y 200)) #s(hole binary64 (+ x (* -1/200 y))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* y (- (/ x y) 1/200))))
#s(approx (- x (/ y 200)) #s(hole binary64 (* -1 (* y (+ 1/200 (* -1 (/ x y)))))))

Outputs
#s(approx (- x (/ y 200)) x)
x
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
#s(approx (- x (/ y 200)) (fma.f64 #s(literal -1/200 binary64) y x))
#s(approx x x)
#s(approx (- x (/ y 200)) (*.f64 (fma.f64 (/.f64 y x) #s(literal -1/200 binary64) #s(literal 1 binary64)) x))
#s(approx (- x (/ y 200)) (*.f64 (fma.f64 (/.f64 y x) #s(literal -1/200 binary64) #s(literal 1 binary64)) x))
#s(approx (- x (/ y 200)) (fma.f64 #s(literal -1/200 binary64) y x))
#s(approx (- x (/ y 200)) (*.f64 (-.f64 (/.f64 x y) #s(literal 1/200 binary64)) y))
#s(approx (- x (/ y 200)) (*.f64 (-.f64 (/.f64 x y) #s(literal 1/200 binary64)) y))

eval1.0ms (0%)

Memory: 1.6MiB live, 1.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 26 to 20 computations (23.1% saved)

prune2.0ms (0.1%)

Memory

4.5MiB live, 4.5MiB allocated; 0ms collecting garbage

Pruning

5 alts after pruning (0 fresh and 5 done)

	Pruned	Kept	Total
New	4	0	4
Fresh	0	0	0
Picked	0	1	1
Done	0	4	4
Total	4	5	9

Accuracy

100.0%

Counts

9 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.9%	(fma.f64 y #s(literal -1/200 binary64) x)
✓	99.9%	(-.f64 x (*.f64 y #s(literal 1/200 binary64)))
✓	51.8%	#s(approx (- x (/ y 200)) (/.f64 y #s(literal -200 binary64)))
✓	51.7%	#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
✓	48.5%	#s(approx (- x (/ y 200)) x)

Compiler

Compiled 52 to 50 computations (3.8% saved)

regimes16.0ms (0.8%)

Memory

-10.2MiB live, 31.9MiB allocated; 8ms collecting garbage

Counts

6 → 1

Calls

Call 1

Inputs
#s(approx (- x (/ y 200)) x)
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
#s(approx (- x (/ y 200)) (/.f64 y #s(literal -200 binary64)))
(fma.f64 y #s(literal -1/200 binary64) x)
(-.f64 x (*.f64 y #s(literal 1/200 binary64)))
(-.f64 x (/.f64 y #s(literal 200 binary64)))

Outputs
(-.f64 x (/.f64 y #s(literal 200 binary64)))

Calls

4 calls:

8.0ms	x
2.0ms	(-.f64 x (/.f64 y #s(literal 200 binary64)))
2.0ms	(/.f64 y #s(literal 200 binary64))
2.0ms	y

Results

Accuracy	Segments	Branch
100.0%	1	`(/.f64 y #s(literal 200 binary64))`
100.0%	1	`(-.f64 x (/.f64 y #s(literal 200 binary64)))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes21.0ms (1.1%)

Memory

-8.7MiB live, 29.6MiB allocated; 15ms collecting garbage

Counts

5 → 1

Calls

Call 1

Inputs
#s(approx (- x (/ y 200)) x)
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
#s(approx (- x (/ y 200)) (/.f64 y #s(literal -200 binary64)))
(fma.f64 y #s(literal -1/200 binary64) x)
(-.f64 x (*.f64 y #s(literal 1/200 binary64)))

Outputs
(fma.f64 y #s(literal -1/200 binary64) x)

Calls

4 calls:

2.0ms	x
2.0ms	(-.f64 x (/.f64 y #s(literal 200 binary64)))
2.0ms	(/.f64 y #s(literal 200 binary64))
2.0ms	y

Results

Accuracy	Segments	Branch
99.9%	1	`(/.f64 y #s(literal 200 binary64))`
99.9%	1	`(-.f64 x (/.f64 y #s(literal 200 binary64)))`
99.9%	1	`x`
99.9%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes7.0ms (0.4%)

Memory

28.9MiB live, 28.9MiB allocated; 0ms collecting garbage

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (- x (/ y 200)) x)
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
#s(approx (- x (/ y 200)) (/.f64 y #s(literal -200 binary64)))

Outputs
#s(approx (- x (/ y 200)) (/.f64 y #s(literal -200 binary64)))
#s(approx (- x (/ y 200)) x)
#s(approx (- x (/ y 200)) (/.f64 y #s(literal -200 binary64)))

Calls

4 calls:

2.0ms	x
2.0ms	y
2.0ms	(-.f64 x (/.f64 y #s(literal 200 binary64)))
1.0ms	(/.f64 y #s(literal 200 binary64))

Results

Accuracy	Segments	Branch
79.8%	3	`(/.f64 y #s(literal 200 binary64))`
58.0%	3	`(-.f64 x (/.f64 y #s(literal 200 binary64)))`
73.8%	3	`x`
79.8%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes3.0ms (0.1%)

Memory

11.3MiB live, 11.3MiB allocated; 0ms collecting garbage

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (- x (/ y 200)) x)
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))

Outputs
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))
#s(approx (- x (/ y 200)) x)
#s(approx (- x (/ y 200)) (*.f64 #s(literal -1/200 binary64) y))

Calls

2 calls:

1.0ms	(/.f64 y #s(literal 200 binary64))
1.0ms	y

Results

Accuracy	Segments	Branch
79.7%	3	`(/.f64 y #s(literal 200 binary64))`
79.7%	3	`y`

Compiler

Compiled 4 to 6 computations (-50% saved)

regimes12.0ms (0.6%)

Memory

-27.7MiB live, 18.3MiB allocated; 8ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- x (/ y 200)) x)

Outputs
#s(approx (- x (/ y 200)) x)

Calls

4 calls:

8.0ms	(/.f64 y #s(literal 200 binary64))
1.0ms	x
1.0ms	(-.f64 x (/.f64 y #s(literal 200 binary64)))
1.0ms	y

Results

Accuracy	Segments	Branch
48.5%	1	`(-.f64 x (/.f64 y #s(literal 200 binary64)))`
48.5%	1	`x`
48.5%	1	`(/.f64 y #s(literal 200 binary64))`
48.5%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch18.0ms (1%)

Memory

29.1MiB live, 29.1MiB allocated; 0ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
8.0ms	2765.362990813451	858017372.318526
9.0ms	-8.320166682201512e-80	-1.2937046624963888e-85

Samples

8.0ms

288×

valid

Compiler

Compiled 260 to 298 computations (-14.6% saved)

Precisions

Click to see histograms. Total time spent on operations: 3.0ms

ival-div!: 2.0ms (75.7% of total)

ival-sub!: 1.0ms (37.8% of total)

adjust: 0.0ms (0% of total)

bsearch1.0ms (0.1%)

Memory

1.6MiB live, 1.6MiB allocated; 0ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
1.0ms	2765.362990813451	858017372.318526
1.0ms	-8.320166682201512e-80	-1.2937046624963888e-85

Compiler

Compiled 260 to 298 computations (-14.6% saved)

derivations135.0ms (7.1%)

Memory

-46.8MiB live, 106.6MiB allocated; 29ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 30 to 24 computations (20% saved)

preprocess31.0ms (1.6%)

Memory: 25.9MiB live, 72.0MiB allocated; 4ms collecting garbage
Compiler: Compiled 35 to 29 computations (17.1% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample662.0ms (34.9%)

preprocess138.0ms (7.3%)

series3.0ms (0.2%)

rewrite195.0ms (10.3%)

eval3.0ms (0.2%)

prune2.0ms (0.1%)

series5.0ms (0.2%)

rewrite212.0ms (11.2%)

eval5.0ms (0.2%)

prune3.0ms (0.1%)

series2.0ms (0.1%)

rewrite224.0ms (11.8%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

series1.0ms (0.1%)

rewrite191.0ms (10.1%)

eval1.0ms (0%)

prune2.0ms (0.1%)

regimes16.0ms (0.8%)

regimes21.0ms (1.1%)

regimes7.0ms (0.4%)

regimes3.0ms (0.1%)

regimes12.0ms (0.6%)

bsearch18.0ms (1%)

bsearch1.0ms (0.1%)

derivations135.0ms (7.1%)

preprocess31.0ms (1.6%)

end0.0ms (0%)

Profiling