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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample808.0ms (36.8%)

Memory

24.4MiB live, 831.9MiB allocated; 131ms collecting garbage

Samples

552.0ms

8 256×

valid

Precisions

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

ival-mult: 175.0ms (71.9% of total)

ival-add: 57.0ms (23.4% of total)

exact: 7.0ms (2.9% of total)

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

adjust: 2.0ms (0.8% of total)

Bogosity

explain84.0ms (3.8%)

Memory

17.6MiB live, 62.7MiB allocated; 8ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(+.f64 y #s(literal 1 binary64))`
-	-	`y`
-	-	`#s(literal 1 binary64)`
-	-	`(*.f64 x (+.f64 y #s(literal 1 binary64)))`
-	-	`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-add: 3.0ms (40.4% of total)

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

preprocess225.0ms (10.2%)

Memory

-16.7MiB live, 223.8MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	51	34
2	152	31
3	290	30
4	994	30
5	3942	30
0	5	5
0	7	5
1	17	5
2	34	5
3	82	5
4	382	5
5	1905	5
0	8551	4

Stop Event

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

Calls

Call 1

Inputs
(*.f64 x (+.f64 y #s(literal 1 binary64)))

Outputs
(*.f64 x (+.f64 y #s(literal 1 binary64)))
(fma.f64 y x x)

Symmetry

(negabs x)

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 x (+.f64 y #s(literal 1 binary64)))

Compiler

Compiled 5 to 5 computations (0% saved)

simplify185.0ms (8.4%)

Memory

-7.4MiB live, 236.5MiB allocated; 42ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(+.f64 y #s(literal 1 binary64))
cost-diff	1	(*.f64 x (+.f64 y #s(literal 1 binary64)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	17	11
2	34	11
3	82	11
4	382	11
5	1905	11
0	8551	10

Stop Event

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

Calls

Call 1

Inputs
(*.f64 x (+.f64 y #s(literal 1 binary64)))
x
(+.f64 y #s(literal 1 binary64))
y
#s(literal 1 binary64)

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

localize13.0ms (0.6%)

Memory

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

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(+.f64 y #s(literal 1 binary64))
accuracy	0.0078125	(*.f64 x (+.f64 y #s(literal 1 binary64)))

Samples

9.0ms

256×

valid

Compiler

Compiled 13 to 7 computations (46.2% saved)

Precisions

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

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

ival-add: 1.0ms (28.2% 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)

series3.0ms (0.1%)

Memory

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

Counts

2 → 10

Calls

Call 1

Inputs
(*.f64 x (+.f64 y #s(literal 1 binary64)))
(+.f64 y #s(literal 1 binary64))

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

Calls

6 calls:

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

simplify163.0ms (7.4%)

Memory

8.0MiB live, 99.2MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	31	84
1	85	84
2	204	84
3	508	84
4	2374	84
5	6580	84
0	9119	74

Stop Event

1×	iter limit
1×	node limit

Counts

10 → 10

Calls

Call 1

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

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

rewrite39.0ms (1.8%)

Memory

-15.4MiB live, 30.5MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	7	8
1	31	8
0	212	7

Stop Event

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

Counts

2 → 25

Calls

Call 1

Inputs
(*.f64 x (+.f64 y #s(literal 1 binary64)))
(+.f64 y #s(literal 1 binary64))

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

eval3.0ms (0.1%)

Memory: 4.7MiB live, 4.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 312 to 88 computations (71.8% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	28	3	31
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	29	3	32

Accuracy

100.0%

Counts

32 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 y x x)
▶	52.8%	(*.f64 x #s(approx (+ y 1) y))
▶	49.2%	#s(approx (* x (+ y 1)) x)

Compiler

Compiled 18 to 15 computations (16.7% saved)

simplify124.0ms (5.6%)

Memory

-4.8MiB live, 92.0MiB allocated; 20ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(fma.f64 y x x)
cost-diff	0	#s(approx (+ y 1) y)
cost-diff	0	(*.f64 x #s(approx (+ y 1) y))
cost-diff	0	#s(approx (* x (+ y 1)) x)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	28
0	12	27
1	24	27
2	41	27
3	103	27
4	522	27
5	2583	27
0	8452	27

Stop Event

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

Calls

Call 1

Inputs
#s(approx (* x (+ y 1)) x)
x
(*.f64 x #s(approx (+ y 1) y))
x
#s(approx (+ y 1) y)
y
(fma.f64 y x x)
y
x

Outputs
#s(approx (* x (+ y 1)) x)
x
(*.f64 x #s(approx (+ y 1) y))
(*.f64 #s(approx (+ y 1) y) x)
x
#s(approx (+ y 1) y)
y
(fma.f64 y x x)
y
x

localize18.0ms (0.8%)

Memory

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

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.0	(fma.f64 y x x)
accuracy	0.0078125	(*.f64 x #s(approx (+ y 1) y))
accuracy	30.50171262765723	#s(approx (+ y 1) y)
accuracy	32.486651681417875	#s(approx (* x (+ y 1)) x)

Samples

13.0ms

256×

valid

Compiler

Compiled 25 to 9 computations (64% saved)

Precisions

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

ival-add: 3.0ms (49.5% of total)

ival-mult: 3.0ms (49.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)

series4.0ms (0.2%)

Memory

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

Counts

4 → 17

Calls

Call 1

Inputs
#s(approx (* x (+ y 1)) x)
(*.f64 x #s(approx (+ y 1) y))
#s(approx (+ y 1) y)
(fma.f64 y x x)

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

Calls

6 calls:

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

simplify187.0ms (8.5%)

Memory

-11.3MiB live, 131.7MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	44	155
1	103	155
2	221	155
3	538	155
4	2321	155
5	5433	155
0	8029	133

Stop Event

1×	iter limit
1×	node limit

Counts

17 → 17

Calls

Call 1

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

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

rewrite44.0ms (2%)

Memory

-28.3MiB live, 61.3MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	23
0	12	22
1	50	22
0	334	22

Stop Event

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

Counts

4 → 26

Calls

Call 1

Inputs
#s(approx (* x (+ y 1)) x)
(*.f64 x #s(approx (+ y 1) y))
#s(approx (+ y 1) y)
(fma.f64 y x x)

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

eval5.0ms (0.2%)

Memory: 16.7MiB live, 16.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 339 to 80 computations (76.4% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	30	0	30
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	30	3	33

Accuracy

100.0%

Counts

33 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 y x x)
✓	52.8%	(*.f64 x #s(approx (+ y 1) y))
✓	49.2%	#s(approx (* x (+ y 1)) x)

Compiler

Compiled 41 to 27 computations (34.1% saved)

regimes7.0ms (0.3%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

Outputs
(fma.f64 y x x)

Calls

4 calls:

2.0ms	x
2.0ms	y
2.0ms	(*.f64 x (+.f64 y #s(literal 1 binary64)))
2.0ms	(+.f64 y #s(literal 1 binary64))

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes8.0ms (0.4%)

Memory

-30.3MiB live, 16.5MiB allocated; 4ms collecting garbage

Counts

2 → 3

Calls

Call 1

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

Outputs
(*.f64 x #s(approx (+ y 1) y))
#s(approx (* x (+ y 1)) x)
(*.f64 x #s(approx (+ y 1) y))

Calls

4 calls:

4.0ms	y
1.0ms	x
1.0ms	(*.f64 x (+.f64 y #s(literal 1 binary64)))
1.0ms	(+.f64 y #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
97.7%	3	`(+.f64 y #s(literal 1 binary64))`
82.7%	3	`(*.f64 x (+.f64 y #s(literal 1 binary64)))`
65.7%	5	`x`
97.7%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.2%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (* x (+ y 1)) x)

Outputs
#s(approx (* x (+ y 1)) x)

Calls

4 calls:

1.0ms	(*.f64 x (+.f64 y #s(literal 1 binary64)))
1.0ms	y
1.0ms	x
1.0ms	(+.f64 y #s(literal 1 binary64))

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch46.0ms (2.1%)

Memory

3.1MiB live, 61.9MiB allocated; 25ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
20.0ms	0.5535359380056909	2.926899608091187
24.0ms	-9338.666330329856	-1.4235874011479383e-9

Samples

35.0ms

256×

valid

Compiler

Compiled 232 to 234 computations (-0.9% saved)

Precisions

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

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

ival-add: 1.0ms (28.4% 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)

simplify85.0ms (3.9%)

Memory

-23.5MiB live, 72.0MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	27	34
2	43	34
3	103	34
4	620	34
5	4263	34

Stop Event

1×	node limit

Calls

Call 1

Inputs

(fma.f64 y x x)

(if (<=.f64 y #s(literal -1 binary64)) (*.f64 x #s(approx (+ y 1) y)) (if (<=.f64 y #s(literal 1 binary64)) #s(approx (* x (+ y 1)) x) (*.f64 x #s(approx (+ y 1) y))))

#s(approx (* x (+ y 1)) x)

Outputs
(fma.f64 y x x)
(if (<=.f64 y #s(literal -1 binary64)) (.f64 x #s(approx (+ y 1) y)) (if (<=.f64 y #s(literal 1 binary64)) #s(approx ( x (+ y 1)) x) (*.f64 x #s(approx (+ y 1) y))))
(if (or (<=.f64 y #s(literal -1 binary64)) (not (<=.f64 y #s(literal 1 binary64)))) (.f64 x #s(approx (+ y 1) y)) #s(approx ( x (+ y 1)) x))
#s(approx (* x (+ y 1)) x)

derivations104.0ms (4.7%)

Memory

-16.9MiB live, 80.3MiB allocated; 5ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 34 to 16 computations (52.9% saved)

preprocess29.0ms (1.3%)

Memory: 15.4MiB live, 61.9MiB allocated; 3ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 96 to 56 computations (41.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample808.0ms (36.8%)

explain84.0ms (3.8%)

preprocess225.0ms (10.2%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify185.0ms (8.4%)

localize13.0ms (0.6%)

series3.0ms (0.1%)

simplify163.0ms (7.4%)

rewrite39.0ms (1.8%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

simplify124.0ms (5.6%)

localize18.0ms (0.8%)

series4.0ms (0.2%)

simplify187.0ms (8.5%)

rewrite44.0ms (2%)

eval5.0ms (0.2%)

prune2.0ms (0.1%)

regimes7.0ms (0.3%)

regimes8.0ms (0.4%)

regimes4.0ms (0.2%)

bsearch46.0ms (2.1%)

simplify85.0ms (3.9%)

derivations104.0ms (4.7%)

preprocess29.0ms (1.3%)

end0.0ms (0%)

Profiling