Metrics for Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, C

start0.0ms (0%)

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

analyze1.0ms (0%)

Memory

0.9MiB live, 0.9MiB 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)

sample1.7s (54.2%)

Memory

39.5MiB live, 1 221.7MiB allocated; 222ms collecting garbage

Samples

1.1s

8 256×

valid

Precisions

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

ival-mult: 491.0ms (89% of total)

ival-sub: 49.0ms (8.9% of total)

exact: 7.0ms (1.3% of total)

ival-assert: 3.0ms (0.5% of total)

adjust: 2.0ms (0.4% of total)

Bogosity

explain82.0ms (2.6%)

Memory

17.1MiB live, 105.1MiB allocated; 20ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
-	-	`(*.f64 x #s(literal 2 binary64))`
-	-	`#s(literal 2 binary64)`
-	-	`y`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

20.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult: 4.0ms (54.1% of total)

ival-sub: 3.0ms (40.6% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess522.0ms (16.3%)

Memory

4.0MiB live, 98.6MiB allocated; 33ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	34
1	25	32
2	47	32
3	99	32
4	218	30
5	917	30
6	4737	30
0	9	5
0	14	5
1	16	5
2	19	5
3	24	5
4	44	5
5	121	5
6	574	5
7	4688	5
0	8418	5

Stop Event

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

Calls

Call 1

Inputs
(-.f64 (*.f64 x #s(literal 2 binary64)) y)

Outputs
(-.f64 (*.f64 x #s(literal 2 binary64)) y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

series4.0ms (0.1%)

Memory

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

Counts

5 → 11

Calls

Call 1

Inputs
(-.f64 (*.f64 x #s(literal 2 binary64)) y)
(*.f64 x #s(literal 2 binary64))
x
#s(literal 2 binary64)
y

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

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((- (* x 2) y) (* x 2) x 2 y)
1.0ms	x	@	inf	((- (* x 2) y) (* x 2) x 2 y)
0.0ms	x	@	0	((- (* x 2) y) (* x 2) x 2 y)
0.0ms	y	@	-inf	((- (* x 2) y) (* x 2) x 2 y)
0.0ms	y	@	inf	((- (* x 2) y) (* x 2) x 2 y)

rewrite276.0ms (8.6%)

Memory

-61.0MiB live, 173.2MiB allocated; 126ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	54	146
1	82	146
2	83	146
3	84	146
0	84	132
1	223	131
0	1363	129
1	1561	123
2	2172	122
3	2952	122
4	3249	122
5	3335	122
6	3350	122

Stop Event

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

Counts

16 → 52

Calls

Call 1

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

Outputs
(/.f64 (-.f64 (pow.f64 (neg.f64 y) #s(literal 3 binary64)) (pow.f64 (.f64 #s(literal -2 binary64) x) #s(literal 3 binary64))) (fma.f64 y y (fma.f64 (.f64 x x) #s(literal 4 binary64) (.f64 (neg.f64 y) (.f64 #s(literal -2 binary64) x)))))
(/.f64 (neg.f64 (-.f64 (.f64 y y) (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)))) (neg.f64 (fma.f64 #s(literal -1 binary64) y (*.f64 #s(literal -2 binary64) x))))
(/.f64 (neg.f64 (fma.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)) (pow.f64 (neg.f64 y) #s(literal 3 binary64)))) (neg.f64 (fma.f64 (.f64 #s(literal 2 binary64) x) (-.f64 (.f64 #s(literal 2 binary64) x) (neg.f64 y)) (*.f64 y y))))
(/.f64 (neg.f64 (fma.f64 (.f64 x x) #s(literal 4 binary64) (.f64 (neg.f64 y) y))) (neg.f64 (fma.f64 #s(literal 2 binary64) x y)))
(/.f64 (neg.f64 (-.f64 (.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64))) (pow.f64 y #s(literal 3 binary64)))) (neg.f64 (fma.f64 (.f64 x x) #s(literal 4 binary64) (*.f64 y (fma.f64 #s(literal 2 binary64) x y)))))
(/.f64 (fma.f64 (.f64 x x) #s(literal 4 binary64) (.f64 (neg.f64 y) y)) (-.f64 (*.f64 #s(literal 2 binary64) x) (neg.f64 y)))
(/.f64 (fma.f64 (.f64 x x) #s(literal 4 binary64) (.f64 (neg.f64 y) y)) (fma.f64 #s(literal 2 binary64) x y))
(/.f64 (-.f64 (.f64 y y) (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))) (fma.f64 #s(literal -1 binary64) y (*.f64 #s(literal -2 binary64) x)))
(/.f64 (-.f64 (.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64))) (pow.f64 y #s(literal 3 binary64))) (fma.f64 (.f64 x x) #s(literal 4 binary64) (*.f64 y (fma.f64 #s(literal 2 binary64) x y))))
(/.f64 (fma.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)) (pow.f64 (neg.f64 y) #s(literal 3 binary64))) (fma.f64 (.f64 x x) #s(literal 4 binary64) (-.f64 (.f64 y y) (.f64 (.f64 (neg.f64 y) #s(literal 2 binary64)) x))))
(/.f64 (fma.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)) (pow.f64 (neg.f64 y) #s(literal 3 binary64))) (fma.f64 (.f64 #s(literal 2 binary64) x) (-.f64 (.f64 #s(literal 2 binary64) x) (neg.f64 y)) (*.f64 y y)))
(fma.f64 #s(literal -1 binary64) y (*.f64 #s(literal 2 binary64) x))
(fma.f64 y #s(literal -1 binary64) (*.f64 #s(literal 2 binary64) x))
(fma.f64 #s(literal 2 binary64) x (neg.f64 y))
(fma.f64 x #s(literal 2 binary64) (neg.f64 y))
(-.f64 (/.f64 (.f64 y y) (fma.f64 #s(literal -1 binary64) y (.f64 #s(literal -2 binary64) x))) (/.f64 (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) (fma.f64 #s(literal -1 binary64) y (.f64 #s(literal -2 binary64) x))))
(-.f64 (/.f64 (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) (fma.f64 #s(literal 2 binary64) x y)) (/.f64 (.f64 y y) (fma.f64 #s(literal 2 binary64) x y)))
(-.f64 (/.f64 (.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (.f64 x x) #s(literal 4 binary64) (.f64 y (fma.f64 #s(literal 2 binary64) x y)))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 (.f64 x x) #s(literal 4 binary64) (*.f64 y (fma.f64 #s(literal 2 binary64) x y)))))
(-.f64 (.f64 #s(literal 2 binary64) x) (.f64 (neg.f64 y) #s(literal -1 binary64)))
(-.f64 (*.f64 #s(literal 2 binary64) x) y)
(-.f64 (neg.f64 y) (*.f64 (neg.f64 x) #s(literal 2 binary64)))
(-.f64 (neg.f64 y) (*.f64 #s(literal -2 binary64) x))
(+.f64 (+.f64 (neg.f64 y) x) x)
(+.f64 (/.f64 (pow.f64 (neg.f64 y) #s(literal 3 binary64)) (fma.f64 (.f64 #s(literal 2 binary64) x) (-.f64 (.f64 #s(literal 2 binary64) x) (neg.f64 y)) (.f64 y y))) (/.f64 (.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (.f64 #s(literal 2 binary64) x) (-.f64 (.f64 #s(literal 2 binary64) x) (neg.f64 y)) (*.f64 y y))))
(+.f64 (*.f64 #s(literal 2 binary64) x) (neg.f64 y))
(+.f64 (neg.f64 y) (*.f64 #s(literal 2 binary64) x))
(+.f64 x (-.f64 x y))
(+.f64 x (+.f64 x (neg.f64 y)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(/.f64 (-.f64 (.f64 x x) (.f64 x x)) (-.f64 x x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 x x) (.f64 x x))))
(neg.f64 (*.f64 #s(literal -2 binary64) x))
(fma.f64 #s(literal 1 binary64) x (*.f64 #s(literal 1 binary64) x))
(fma.f64 x #s(literal 1 binary64) (*.f64 x #s(literal 1 binary64)))
(+.f64 (.f64 #s(literal 1 binary64) x) (.f64 #s(literal 1 binary64) x))
(+.f64 (.f64 x #s(literal 1 binary64)) (.f64 x #s(literal 1 binary64)))
(+.f64 x x)
x
#s(literal 2 binary64)
y
#s(approx (- (* x 2) y) (neg.f64 y))
#s(approx (- (* x 2) y) (fma.f64 #s(literal 2 binary64) x (neg.f64 y)))
#s(approx (* x 2) (*.f64 #s(literal 2 binary64) x))
#s(approx x x)
#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
#s(approx (- (* x 2) y) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 y x)) x))
#s(approx (- (* x 2) y) (*.f64 (neg.f64 x) (-.f64 (/.f64 y x) #s(literal 2 binary64))))
#s(approx (- (* x 2) y) (fma.f64 #s(literal 2 binary64) x (neg.f64 y)))
#s(approx y y)
#s(approx (- (* x 2) y) (*.f64 (fma.f64 (/.f64 x y) #s(literal 2 binary64) #s(literal -1 binary64)) y))
#s(approx (- (* x 2) y) (*.f64 (fma.f64 #s(literal -2 binary64) (/.f64 x y) #s(literal 1 binary64)) (neg.f64 y)))

eval5.0ms (0.2%)

Memory: 13.8MiB live, 13.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 622 to 140 computations (77.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	48	3	51
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	49	3	52

Accuracy

100.0%

Counts

52 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 (+.f64 x x) y)
▶	48.2%	#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
▶	52.6%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 22 to 19 computations (13.6% saved)

series44.0ms (1.4%)

Memory

-42.2MiB live, 4.8MiB allocated; 2ms collecting garbage

Counts

9 → 21

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (neg.f64 y))
(neg.f64 y)
y
#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x
(-.f64 (+.f64 x x) y)
(+.f64 x x)

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

Calls

6 calls:

Time	Variable		Point	Expression
42.0ms	y	@	-inf	((- (* x 2) y) (neg y) y (- (* x 2) y) (* 2 x) 2 x (- (+ x x) y) (+ x x))
1.0ms	x	@	-inf	((- (* x 2) y) (neg y) y (- (* x 2) y) (* 2 x) 2 x (- (+ x x) y) (+ x x))
1.0ms	x	@	inf	((- (* x 2) y) (neg y) y (- (* x 2) y) (* 2 x) 2 x (- (+ x x) y) (+ x x))
0.0ms	y	@	inf	((- (* x 2) y) (neg y) y (- (* x 2) y) (* 2 x) 2 x (- (+ x x) y) (+ x x))
0.0ms	x	@	0	((- (* x 2) y) (neg y) y (- (* x 2) y) (* 2 x) 2 x (- (+ x x) y) (+ x x))

rewrite42.0ms (1.3%)

Memory

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

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	71	303
1	119	297
2	121	297
3	124	297
0	124	276
0	286	270
1	345	270
2	433	262
3	502	262
4	521	262
5	525	262

Stop Event

1×	saturated
1×	iter limit
1×	iter limit
1×	unsound
1×	saturated

Counts

30 → 43

Calls

Call 1

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

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

eval3.0ms (0.1%)

Memory: 4.4MiB live, 4.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 349 to 84 computations (75.9% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	32	1	33
Fresh	0	0	0
Picked	1	2	3
Done	0	0	0
Total	33	3	36

Accuracy

100.0%

Counts

36 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) y)
▶	48.2%	#s(approx (- (* x 2) y) (+.f64 x x))
✓	52.6%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 22 to 18 computations (18.2% saved)

series2.0ms (0.1%)

Memory

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

Counts

3 → 10

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (+.f64 x x))
(+.f64 x x)
x

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

Calls

6 calls:

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

rewrite412.0ms (12.8%)

Memory

4.0MiB live, 48.8MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	52	145
1	77	145
2	78	145
3	80	145
0	80	136
0	226	130
1	287	130
2	374	130
3	443	130
4	462	130
5	466	130

Stop Event

1×	saturated
1×	iter limit
1×	iter limit
1×	unsound
1×	saturated

Counts

13 → 17

Calls

Call 1

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

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

eval12.0ms (0.4%)

Memory: -36.6MiB live, 8.9MiB allocated; 12ms collecting garbage
Compiler: Compiled 218 to 56 computations (74.3% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	18	0	18
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	18	3	21

Accuracy

100.0%

Counts

21 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) y)
✓	48.2%	#s(approx (- (* x 2) y) (+.f64 x x))
✓	52.6%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 58 to 33 computations (43.1% saved)

regimes9.0ms (0.3%)

Memory

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

Counts

5 → 1

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (neg.f64 y))
#s(approx (- (* x 2) y) (+.f64 x x))
#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
(-.f64 (+.f64 x x) y)
(-.f64 (*.f64 x #s(literal 2 binary64)) y)

Outputs
(-.f64 (+.f64 x x) y)

Calls

4 calls:

2.0ms	y
2.0ms	(-.f64 (*.f64 x #s(literal 2 binary64)) y)
2.0ms	x
2.0ms	(*.f64 x #s(literal 2 binary64))

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes11.0ms (0.3%)

Memory

-16.6MiB live, 25.4MiB allocated; 9ms collecting garbage

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (neg.f64 y))
#s(approx (- (* x 2) y) (+.f64 x x))
#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))

Outputs
#s(approx (- (* x 2) y) (+.f64 x x))
#s(approx (- (* x 2) y) (neg.f64 y))
#s(approx (- (* x 2) y) (+.f64 x x))

Calls

4 calls:

5.0ms	x
2.0ms	(-.f64 (*.f64 x #s(literal 2 binary64)) y)
2.0ms	y
2.0ms	(*.f64 x #s(literal 2 binary64))

Results

Accuracy	Segments	Branch
76.3%	3	`(*.f64 x #s(literal 2 binary64))`
61.6%	4	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
76.3%	3	`x`
76.0%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes5.0ms (0.1%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (neg.f64 y))

Outputs
#s(approx (- (* x 2) y) (neg.f64 y))

Calls

4 calls:

1.0ms	(-.f64 (*.f64 x #s(literal 2 binary64)) y)
1.0ms	(*.f64 x #s(literal 2 binary64))
1.0ms	x
1.0ms	y

Results

Accuracy	Segments	Branch
52.6%	1	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
52.6%	1	`y`
52.6%	1	`(*.f64 x #s(literal 2 binary64))`
52.6%	1	`x`

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch18.0ms (0.5%)

Memory

8.9MiB live, 55.2MiB allocated; 2ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	done
1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
7.0ms	3.772128258257893e+85	2.1901934258144666e+86
9.0ms	-1.8014338871108655e+53	-2.034001359072369e+52

Samples

8.0ms

192×

valid

Compiler

Compiled 259 to 218 computations (15.8% saved)

Precisions

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

ival-sub: 2.0ms (47.4% of total)

ival-mult: 1.0ms (23.7% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess20.0ms (0.6%)

Memory: -53.3MiB live, 52.8MiB allocated; 10ms collecting garbage
Compiler: Compiled 104 to 42 computations (59.6% saved)

end0.0ms (0%)

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

Iter	Nodes	Cost
0	71	303
1	119	297
2	121	297
3	124	297
0	124	276
0	286	270
1	345	270
2	433	262
3	502	262
4	521	262
5	525	262

Iter	Nodes	Cost
0	52	145
1	77	145
2	78	145
3	80	145
0	80	136
0	226	130
1	287	130
2	374	130
3	443	130
4	462	130
5	466	130

Iter	Nodes	Cost
0	71	303
1	119	297
2	121	297
3	124	297
0	124	276
0	286	270
1	345	270
2	433	262
3	502	262
4	521	262
5	525	262

Iter	Nodes	Cost
0	52	145
1	77	145
2	78	145
3	80	145
0	80	136
0	226	130
1	287	130
2	374	130
3	443	130
4	462	130
5	466	130

start0.0ms (0%)

analyze1.0ms (0%)

sample1.7s (54.2%)

explain82.0ms (2.6%)

preprocess522.0ms (16.3%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.1%)

rewrite276.0ms (8.6%)

eval5.0ms (0.2%)

prune2.0ms (0.1%)

series44.0ms (1.4%)

rewrite42.0ms (1.3%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

series2.0ms (0.1%)

rewrite412.0ms (12.8%)

eval12.0ms (0.4%)

prune2.0ms (0.1%)

regimes9.0ms (0.3%)

regimes11.0ms (0.3%)

regimes5.0ms (0.1%)

bsearch18.0ms (0.5%)

preprocess20.0ms (0.6%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	71	303
1	119	297
2	121	297
3	124	297
0	124	276
0	286	270
1	345	270
2	433	262
3	502	262
4	521	262
5	525	262

Iter	Nodes	Cost
0	52	145
1	77	145
2	78	145
3	80	145
0	80	136
0	226	130
1	287	130
2	374	130
3	443	130
4	462	130
5	466	130