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

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB 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)

sample3.3s (85.3%)

Memory

-220.8MiB live, 962.8MiB allocated; 3.2s collecting garbage

Samples

394.0ms

8 256×

valid

Precisions

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

ival-sub: 89.0ms (47% of total)

ival-mult: 89.0ms (47% of total)

exact: 7.0ms (3.7% of total)

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

adjust: 2.0ms (1.1% of total)

Bogosity

explain81.0ms (2.1%)

Memory

16.6MiB live, 63.0MiB allocated; 4ms 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

19.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-sub: 3.0ms (42.9% of total)

ival-mult: 3.0ms (42.9% 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)

preprocess184.0ms (4.8%)

Memory

9.0MiB live, 147.2MiB allocated; 23ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	20	32
2	42	32
3	94	32
4	213	30
5	826	30
6	4648	30
0	5	5
0	7	5
1	10	5
2	18	5
3	38	5
4	80	5
5	348	5
6	1889	5
0	8143	5

Stop Event

1×	iter limit
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)
(-.f64 (*.f64 #s(literal 2 binary64) x) y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

0.6MiB live, 0.6MiB 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

4.5MiB live, 4.5MiB 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	y	@	-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)

rewrite62.0ms (1.6%)

Memory

-6.8MiB live, 37.9MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	40	128
0	42	122
1	180	121
0	1320	119

Stop Event

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

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 (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 (pow.f64 (.f64 #s(literal 2 binary64) 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 (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 (pow.f64 x #s(literal 3 binary64)) #s(literal 8 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 (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 (pow.f64 (.f64 #s(literal 2 binary64) 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 (pow.f64 x #s(literal 3 binary64)) #s(literal 8 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 (pow.f64 x #s(literal 3 binary64)) #s(literal 8 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 (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 (pow.f64 (.f64 #s(literal 2 binary64) 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 (.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 #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 (fma.f64 #s(literal -1 binary64) 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 (pow.f64 (.f64 #s(literal 2 binary64) 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.1%)

Memory: 8.2MiB live, 8.2MiB 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)
▶	45.1%	#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
▶	55.8%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 22 to 19 computations (13.6% saved)

series3.0ms (0.1%)

Memory

4.5MiB live, 4.5MiB allocated; 0ms 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
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	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))

rewrite47.0ms (1.2%)

Memory

-7.7MiB live, 48.8MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	57	267
0	59	256
0	219	252

Stop Event

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

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 x y) #s(literal 2 binary64)) #s(literal 1 binary64)) y))
#s(approx (- (* x 2) y) (.f64 (-.f64 (.f64 (/.f64 x y) #s(literal 2 binary64)) #s(literal 1 binary64)) y))
#s(approx (- (* x 2) y) (*.f64 (neg.f64 y) (fma.f64 #s(literal -2 binary64) (/.f64 x y) #s(literal 1 binary64))))
#s(approx (- (* x 2) y) (*.f64 (neg.f64 y) (fma.f64 #s(literal -2 binary64) (/.f64 x y) #s(literal 1 binary64))))

eval7.0ms (0.2%)

Memory: -39.7MiB live, 5.6MiB allocated; 6ms collecting garbage
Compiler: Compiled 349 to 84 computations (75.9% saved)

prune3.0ms (0.1%)

Memory

5.6MiB live, 5.6MiB 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)
▶	45.1%	#s(approx (- (* x 2) y) (+.f64 x x))
✓	55.8%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 22 to 18 computations (18.2% saved)

series2.0ms (0%)

Memory

3.5MiB live, 3.5MiB 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
0.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)

rewrite31.0ms (0.8%)

Memory

-1.1MiB live, 44.9MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	40	127
0	41	122
0	185	120

Stop Event

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

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 #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)
x
#s(approx (- (* x 2) y) (neg.f64 y))
#s(approx (- (* x 2) y) (-.f64 (*.f64 #s(literal 2 binary64) x) y))
#s(approx (+ x x) (*.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 (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 y) #s(literal 2 binary64)) #s(literal 1 binary64)) y))
#s(approx (- (* x 2) y) (*.f64 (neg.f64 y) (fma.f64 #s(literal -2 binary64) (/.f64 x y) #s(literal 1 binary64))))

eval2.0ms (0%)

Memory: 4.2MiB live, 4.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 218 to 56 computations (74.3% saved)

prune2.0ms (0.1%)

Memory

5.5MiB live, 5.5MiB 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)
✓	45.1%	#s(approx (- (* x 2) y) (+.f64 x x))
✓	55.8%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 58 to 33 computations (43.1% saved)

regimes8.0ms (0.2%)

Memory

17.0MiB live, 17.0MiB 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	(*.f64 x #s(literal 2 binary64))
2.0ms	x

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)

regimes6.0ms (0.2%)

Memory

14.0MiB live, 14.0MiB allocated; 0ms 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) (neg.f64 y))
#s(approx (- (* x 2) y) (+.f64 x x))
#s(approx (- (* x 2) y) (neg.f64 y))

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
79.0%	3	`(*.f64 x #s(literal 2 binary64))`
55.8%	1	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
79.0%	3	`x`
79.3%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes9.0ms (0.2%)

Memory

-37.3MiB live, 8.6MiB allocated; 4ms 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

3 calls:

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

Results

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

Compiler

Compiled 5 to 8 computations (-60% saved)

bsearch26.0ms (0.7%)

Memory

-10.7MiB live, 41.2MiB allocated; 12ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
10.0ms	6.746711291848898e+34	8.908382162060518e+42
8.0ms	-3.330618925934617e-50	-4.998754132529196e-52

Samples

8.0ms

256×

valid

Compiler

Compiled 280 to 266 computations (5% saved)

Precisions

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

ival-mult: 2.0ms (59% of total)

ival-sub: 1.0ms (29.5% 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)

simplify49.0ms (1.3%)

Memory

24.9MiB live, 67.8MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	39
1	28	39
2	36	39
3	56	39
4	124	39
5	883	39
6	6387	39

Stop Event

1×	node limit

Calls

Call 1

Inputs

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

(if (<=.f64 y #s(literal -3475305625062387/105312291668557186697918027683670432318895095400549111254310977536 binary64)) #s(approx (- (* x 2) y) (neg.f64 y)) (if (<=.f64 y #s(literal 104999999999999994861860005942919168 binary64)) #s(approx (- (* x 2) y) (+.f64 x x)) #s(approx (- (* x 2) y) (neg.f64 y))))

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

Outputs
(-.f64 (+.f64 x x) y)
(if (<=.f64 y #s(literal -3475305625062387/105312291668557186697918027683670432318895095400549111254310977536 binary64)) #s(approx (- (* x 2) y) (neg.f64 y)) (if (<=.f64 y #s(literal 104999999999999994861860005942919168 binary64)) #s(approx (- (* x 2) y) (+.f64 x x)) #s(approx (- (* x 2) y) (neg.f64 y))))
(if (or (<=.f64 y #s(literal -3475305625062387/105312291668557186697918027683670432318895095400549111254310977536 binary64)) (not (<=.f64 y #s(literal 104999999999999994861860005942919168 binary64)))) #s(approx (- (* x 2) y) (neg.f64 y)) #s(approx (- (* x 2) y) (+.f64 x x)))
#s(approx (- (* x 2) y) (neg.f64 y))

derivations13.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 39 to 17 computations (56.4% saved)

preprocess18.0ms (0.5%)

Memory: -18.1MiB live, 27.2MiB allocated; 6ms collecting garbage
Compiler: Compiled 88 to 44 computations (50% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample3.3s (85.3%)

explain81.0ms (2.1%)

preprocess184.0ms (4.8%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.1%)

rewrite62.0ms (1.6%)

eval5.0ms (0.1%)

prune2.0ms (0.1%)

series3.0ms (0.1%)

rewrite47.0ms (1.2%)

eval7.0ms (0.2%)

prune3.0ms (0.1%)

series2.0ms (0%)

rewrite31.0ms (0.8%)

eval2.0ms (0%)

prune2.0ms (0.1%)

regimes8.0ms (0.2%)

regimes6.0ms (0.2%)

regimes9.0ms (0.2%)

bsearch26.0ms (0.7%)

simplify49.0ms (1.3%)

derivations13.0ms (0.3%)

preprocess18.0ms (0.5%)

end0.0ms (0%)

Profiling