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

analyze0.0ms (0%)

Memory

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

sample894.0ms (41.1%)

Memory

12.9MiB live, 1 058.0MiB allocated; 218ms collecting garbage

Samples

495.0ms

8 256×

valid

Precisions

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

ival-mult: 144.0ms (68.9% of total)

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

ival-true: 6.0ms (2.9% of total)

exact: 5.0ms (2.4% of total)

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

adjust: 2.0ms (1% of total)

Bogosity

explain97.0ms (4.5%)

Memory

-19.3MiB live, 121.2MiB allocated; 8ms 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

45.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.3% of total)

ival-sub: 3.0ms (40.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)

preprocess205.0ms (9.4%)

Memory

41.4MiB live, 173.8MiB allocated; 29ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	29
1	19	27
2	41	27
3	91	27
4	197	25
5	763	25
6	4378	25
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.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)

series7.0ms (0.3%)

Memory

-33.8MiB live, 9.4MiB allocated; 8ms 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
4.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)

simplify179.0ms (8.2%)

Memory

10.2MiB live, 118.4MiB allocated; 39ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	38	96
1	87	96
2	249	96
3	762	96
4	3390	96
5	7920	96
0	8053	96

Stop Event

1×	iter limit
1×	node limit

Counts

11 → 11

Calls

Call 1

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

rewrite51.0ms (2.4%)

Memory

-4.7MiB live, 82.2MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	23	11
0	158	11

Stop Event

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

Counts

5 → 17

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

eval2.0ms (0.1%)

Memory: 7.2MiB live, 7.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 246 to 62 computations (74.8% saved)

prune1.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	20	3	23
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	21	3	24

Accuracy

100.0%

Counts

24 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 22 to 19 computations (13.6% saved)

series3.0ms (0.1%)

Memory

9.4MiB live, 9.4MiB 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))
1.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))

simplify138.0ms (6.4%)

Memory

2.1MiB live, 106.8MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	51	191
1	101	191
2	262	191
3	777	191
4	3418	191
5	7993	191
0	8055	191

Stop Event

1×	iter limit
1×	node limit

Counts

21 → 21

Calls

Call 1

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

rewrite59.0ms (2.7%)

Memory

-8.3MiB live, 37.2MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	33
0	15	33
0	54	33

Stop Event

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

Counts

9 → 20

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) (neg.f64 y))
(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)

eval3.0ms (0.1%)

Memory: 8.6MiB live, 8.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 279 to 63 computations (77.4% saved)

prune27.0ms (1.3%)

Memory

-32.7MiB live, 13.8MiB allocated; 3ms collecting garbage

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	27	1	28
Fresh	0	0	0
Picked	1	2	3
Done	0	0	0
Total	28	3	31

Accuracy

100.0%

Counts

31 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 22 to 18 computations (18.2% saved)

series2.0ms (0.1%)

Memory

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

simplify150.0ms (6.9%)

Memory

0.6MiB live, 183.6MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	38	93
1	86	93
2	248	93
3	766	93
4	3400	93
5	7926	93
0	8059	93

Stop Event

1×	iter limit
1×	node limit

Counts

10 → 10

Calls

Call 1

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

rewrite23.0ms (1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	13
0	8	13
0	33	13

Stop Event

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

Counts

3 → 7

Calls

Call 1

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

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

eval1.0ms (0.1%)

Memory: 1.3MiB live, 1.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 149 to 35 computations (76.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	13	0	13
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	13	3	16

Accuracy

100.0%

Counts

16 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 58 to 33 computations (43.1% saved)

regimes72.0ms (3.3%)

Memory

-44.8MiB live, 18.3MiB allocated; 5ms 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:

65.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
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)

regimes7.0ms (0.3%)

Memory

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

Results

Accuracy	Segments	Branch
75.9%	3	`(*.f64 x #s(literal 2 binary64))`
59.7%	3	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
75.9%	3	`x`
77.9%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes5.0ms (0.2%)

Memory

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch34.0ms (1.6%)

Memory

-6.2MiB live, 37.2MiB allocated; 7ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
8.0ms	13750693789501344.0	544229150496826240.0
23.0ms	-4.056763726886661e-16	-1.2191437367691908e-18

Samples

9.0ms

240×

valid

Compiler

Compiled 263 to 250 computations (4.9% saved)

Precisions

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

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

ival-sub: 1.0ms (29.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)

simplify61.0ms (2.8%)

Memory

-8.7MiB live, 78.4MiB allocated; 18ms 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 -1784852045121347/40564819207303340847894502572032 binary64)) #s(approx (- (* x 2) y) (neg.f64 y)) (if (<=.f64 y #s(literal 105000000000000000 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 -1784852045121347/40564819207303340847894502572032 binary64)) #s(approx (- (* x 2) y) (neg.f64 y)) (if (<=.f64 y #s(literal 105000000000000000 binary64)) #s(approx (- (* x 2) y) (+.f64 x x)) #s(approx (- (* x 2) y) (neg.f64 y))))
(if (or (<=.f64 y #s(literal -1784852045121347/40564819207303340847894502572032 binary64)) (not (<=.f64 y #s(literal 105000000000000000 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))

derivations132.0ms (6.1%)

Memory

-43.5MiB live, 91.1MiB allocated; 84ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 39 to 17 computations (56.4% saved)

preprocess18.0ms (0.8%)

Memory: 1.4MiB live, 48.1MiB allocated; 4ms 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%)

sample894.0ms (41.1%)

explain97.0ms (4.5%)

preprocess205.0ms (9.4%)

eval0.0ms (0%)

prune0.0ms (0%)

series7.0ms (0.3%)

simplify179.0ms (8.2%)

rewrite51.0ms (2.4%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series3.0ms (0.1%)

simplify138.0ms (6.4%)

rewrite59.0ms (2.7%)

eval3.0ms (0.1%)

prune27.0ms (1.3%)

series2.0ms (0.1%)

simplify150.0ms (6.9%)

rewrite23.0ms (1%)

eval1.0ms (0.1%)

prune2.0ms (0.1%)

regimes72.0ms (3.3%)

regimes7.0ms (0.3%)

regimes5.0ms (0.2%)

bsearch34.0ms (1.6%)

simplify61.0ms (2.8%)

derivations132.0ms (6.1%)

preprocess18.0ms (0.8%)

end0.0ms (0%)

Profiling