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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample930.0ms (46.1%)

Memory

27.8MiB live, 974.2MiB allocated; 152ms collecting garbage

Samples

652.0ms

8 256×

valid

Precisions

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

ival-mult: 156.0ms (59.7% of total)

ival-add: 90.0ms (34.4% of total)

ival-true: 5.0ms (1.9% of total)

exact: 5.0ms (1.9% of total)

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

adjust: 2.0ms (0.8% of total)

Bogosity

explain137.0ms (6.8%)

Memory

-34.5MiB live, 103.0MiB allocated; 16ms 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)

preprocess201.0ms (10%)

Memory

26.7MiB live, 178.0MiB allocated; 35ms 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.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

series7.0ms (0.4%)

Memory

-35.9MiB live, 8.4MiB allocated; 7ms collecting garbage

Counts

5 → 12

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
#s(approx (* x (+ y 1)) #s(hole binary64 (* x (+ 1 y))))
#s(approx x #s(hole binary64 x))
#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 #s(hole binary64 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
4.0ms	y	@	-inf	((* x (+ y 1)) x (+ y 1) y 1)
1.0ms	x	@	inf	((* x (+ y 1)) x (+ y 1) y 1)
1.0ms	x	@	-inf	((* x (+ y 1)) x (+ y 1) y 1)
1.0ms	y	@	inf	((* x (+ y 1)) x (+ y 1) y 1)
1.0ms	x	@	0	((* x (+ y 1)) x (+ y 1) y 1)

simplify205.0ms (10.2%)

Memory

24.7MiB live, 311.7MiB allocated; 39ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	33	90
1	87	90
2	206	90
3	510	90
4	2377	90
5	6582	90
0	9121	80

Stop Event

1×	iter limit
1×	node limit

Counts

12 → 12

Calls

Call 1

Inputs
#s(approx (* x (+ y 1)) #s(hole binary64 (* x (+ 1 y))))
#s(approx x #s(hole binary64 x))
#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 #s(hole binary64 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 #s(hole binary64 x))
#s(approx 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 #s(hole binary64 y))
#s(approx y y)
#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))

rewrite50.0ms (2.5%)

Memory

2.1MiB live, 93.7MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	31	11
0	212	10

Stop Event

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

Counts

5 → 28

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

eval3.0ms (0.2%)

Memory: 10.3MiB live, 10.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 341 to 93 computations (72.7% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	33	3	36
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	34	3	37

Accuracy

100.0%

Counts

37 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 18 to 15 computations (16.7% saved)

series11.0ms (0.5%)

Memory

-36.4MiB live, 15.5MiB allocated; 9ms collecting garbage

Counts

6 → 19

Calls

Call 1

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

Outputs
#s(approx (* x (+ y 1)) #s(hole binary64 (* x (+ 1 y))))
#s(approx x #s(hole binary64 x))
#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 #s(hole binary64 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
7.0ms	y	@	-inf	((* x (+ y 1)) x (* x (+ y 1)) (+ y 1) y (+ (* y x) x))
1.0ms	x	@	-inf	((* x (+ y 1)) x (* x (+ y 1)) (+ y 1) y (+ (* y x) x))
1.0ms	x	@	inf	((* x (+ y 1)) x (* x (+ y 1)) (+ y 1) y (+ (* y x) x))
1.0ms	x	@	0	((* x (+ y 1)) x (* x (+ y 1)) (+ y 1) y (+ (* y x) x))
1.0ms	y	@	inf	((* x (+ y 1)) x (* x (+ y 1)) (+ y 1) y (+ (* y x) x))

simplify168.0ms (8.4%)

Memory

-5.2MiB live, 253.0MiB allocated; 65ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	46	161
1	105	161
2	223	161
3	542	161
4	2332	161
5	5423	161
0	8032	139

Stop Event

1×	iter limit
1×	node limit

Counts

19 → 19

Calls

Call 1

Inputs
#s(approx (* x (+ y 1)) #s(hole binary64 (* x (+ 1 y))))
#s(approx x #s(hole binary64 x))
#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 #s(hole binary64 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 x #s(hole binary64 x))
#s(approx 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 #s(hole binary64 y))
#s(approx y y)
#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))

rewrite45.0ms (2.2%)

Memory

-4.1MiB live, 90.5MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	25
0	12	24
1	50	24
0	334	24

Stop Event

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

Counts

6 → 28

Calls

Call 1

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

Outputs
#s(approx (* x (+ y 1)) x)
x
(*.f64 #s(approx (+ y 1) y) x)
(*.f64 x #s(approx (+ y 1) y))
#s(approx (+ y 1) y)
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))

eval4.0ms (0.2%)

Memory: 10.2MiB live, 10.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 417 to 89 computations (78.7% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	42	0	42
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	42	3	45

Accuracy

100.0%

Counts

45 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 41 to 27 computations (34.1% saved)

regimes13.0ms (0.6%)

Memory

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

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

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)

regimes5.0ms (0.3%)

Memory

17.5MiB live, 17.5MiB allocated; 0ms 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:

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

Results

Accuracy	Segments	Branch
97.2%	3	`(+.f64 y #s(literal 1 binary64))`
80.6%	3	`(*.f64 x (+.f64 y #s(literal 1 binary64)))`
56.1%	2	`x`
97.2%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.2%)

Memory

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch22.0ms (1.1%)

Memory

4.9MiB live, 51.3MiB allocated; 3ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
10.0ms	0.30186931235572484	4104285.5632072533
10.0ms	-18.348798341922777	-0.13957922443561804

Samples

9.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 (54.3% of total)

ival-add: 1.0ms (27.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)

simplify66.0ms (3.3%)

Memory

-1.4MiB live, 79.2MiB allocated; 28ms 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)

derivations106.0ms (5.2%)

Memory

-9.8MiB live, 87.6MiB allocated; 30ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 34 to 16 computations (52.9% saved)

preprocess32.0ms (1.6%)

Memory: 21.3MiB live, 66.0MiB allocated; 17ms 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%)

sample930.0ms (46.1%)

explain137.0ms (6.8%)

preprocess201.0ms (10%)

eval0.0ms (0%)

prune0.0ms (0%)

series7.0ms (0.4%)

simplify205.0ms (10.2%)

rewrite50.0ms (2.5%)

eval3.0ms (0.2%)

prune2.0ms (0.1%)

series11.0ms (0.5%)

simplify168.0ms (8.4%)

rewrite45.0ms (2.2%)

eval4.0ms (0.2%)

prune3.0ms (0.2%)

regimes13.0ms (0.6%)

regimes5.0ms (0.3%)

regimes4.0ms (0.2%)

bsearch22.0ms (1.1%)

simplify66.0ms (3.3%)

derivations106.0ms (5.2%)

preprocess32.0ms (1.6%)

end0.0ms (0%)

Profiling