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

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

sample782.0ms (34.2%)

Memory

11.5MiB live, 963.8MiB allocated; 217ms collecting garbage

Samples

490.0ms

8 256×

valid

Precisions

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

ival-mult: 152.0ms (64.3% of total)

ival-sub: 68.0ms (28.7% of total)

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

exact: 5.0ms (2.1% of total)

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

adjust: 2.0ms (0.8% of total)

Bogosity

explain54.0ms (2.4%)

Memory

17.1MiB live, 108.0MiB allocated; 12ms 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

21.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult: 6.0ms (63.8% of total)

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

Memory

-33.0MiB live, 214.4MiB allocated; 23ms 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)

prune16.0ms (0.7%)

Memory

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

simplify110.0ms (4.8%)

Memory

-11.0MiB live, 123.8MiB allocated; 20ms collecting garbage

Localize:

Found 2 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	10	11
2	18	11
3	38	11
4	80	11
5	348	11
6	1889	11
0	8143	11

Stop Event

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

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

localize31.0ms (1.3%)

Memory

-8.0MiB live, 45.0MiB allocated; 11ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(-.f64 (*.f64 x #s(literal 2 binary64)) y)
accuracy	0.0	(*.f64 x #s(literal 2 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.9% of total)

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

series3.0ms (0.1%)

Memory

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

Counts

2 → 9

Calls

Call 1

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

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 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 2))
1.0ms	x	@	-inf	((- (* x 2) y) (* x 2))
0.0ms	y	@	-inf	((- (* x 2) y) (* x 2))
0.0ms	x	@	0	((- (* x 2) y) (* x 2))
0.0ms	y	@	inf	((- (* x 2) y) (* x 2))

simplify134.0ms (5.9%)

Memory

12.4MiB live, 105.0MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	36	90
1	85	90
2	247	90
3	760	90
4	3388	90
5	7968	90
0	8030	90

Stop Event

1×	iter limit
1×	node limit

Counts

9 → 9

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 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 2) #s(hole binary64 (* 2 x)))
#s(approx (* x 2) (*.f64 #s(literal 2 binary64) 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)))

rewrite46.0ms (2%)

Memory

-8.0MiB live, 36.7MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

2 → 14

Calls

Call 1

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

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)

eval2.0ms (0.1%)

Memory: 3.4MiB live, 3.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 217 to 57 computations (73.7% saved)

prune1.0ms (0%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	15	3	18
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	16	3	19

Accuracy

100.0%

Counts

19 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 22 to 19 computations (13.6% saved)

simplify121.0ms (5.3%)

Memory

2.8MiB live, 63.9MiB allocated; 48ms collecting garbage

Localize:

Found 6 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	35
0	15	35
1	20	35
2	28	35
3	48	35
4	96	35
5	332	35
6	1918	35
0	8180	35

Stop Event

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

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)
x
y

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

localize73.0ms (3.2%)

Memory

-19.4MiB live, 29.2MiB allocated; 3ms collecting garbage

Localize:

Found 6 expressions of interest:

New	Metric	Score
accuracy	0.0	(-.f64 (+.f64 x x) y)
accuracy	0.0	(+.f64 x x)
accuracy	0.0	(*.f64 #s(literal 2 binary64) x)
accuracy	29.177129168929827	#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
accuracy	0.0	(neg.f64 y)
accuracy	34.10941819007109	#s(approx (- (* x 2) y) (neg.f64 y))

Samples

67.0ms

256×

valid

Compiler

Compiled 30 to 11 computations (63.3% saved)

Precisions

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

ival-mult: 3.0ms (36.1% of total)

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

ival-add: 1.0ms (12% of total)

ival-neg: 1.0ms (12% 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

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

Counts

6 → 19

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (neg.f64 y))
(neg.f64 y)
#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
(*.f64 #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 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 (- (+ 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) (- (* x 2) y) (* 2 x) (- (+ x x) y) (+ x x))
1.0ms	x	@	-inf	((- (* x 2) y) (neg y) (- (* x 2) y) (* 2 x) (- (+ x x) y) (+ x x))
0.0ms	y	@	inf	((- (* x 2) y) (neg y) (- (* x 2) y) (* 2 x) (- (+ x x) y) (+ x x))
0.0ms	y	@	-inf	((- (* x 2) y) (neg y) (- (* x 2) y) (* 2 x) (- (+ x x) y) (+ x x))
0.0ms	x	@	0	((- (* x 2) y) (neg y) (- (* x 2) y) (* 2 x) (- (+ x x) y) (+ x x))

simplify114.0ms (5%)

Memory

16.1MiB live, 62.0MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	49	185
1	99	185
2	260	185
3	776	185
4	3406	185
5	7933	185
0	8066	185

Stop Event

1×	iter limit
1×	node limit

Counts

19 → 19

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 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 (- (+ 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 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 (- (+ 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)))

rewrite53.0ms (2.3%)

Memory

-28.7MiB live, 17.5MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	30
0	15	30
0	54	30

Stop Event

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

Counts

6 → 17

Calls

Call 1

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

eval2.0ms (0.1%)

Memory: 2.7MiB live, 2.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 196 to 51 computations (74% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

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

Accuracy

100.0%

Counts

20 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 22 to 18 computations (18.2% saved)

simplify123.0ms (5.4%)

Memory

11.5MiB live, 65.7MiB allocated; 3ms collecting garbage

Localize:

Found 2 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	13
0	8	13
1	12	13
2	21	13
3	40	13
4	86	13
5	319	13
6	1895	13
0	8159	13

Stop Event

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

Calls

Call 1

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

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

localize52.0ms (2.3%)

Memory

-4.6MiB live, 41.0MiB allocated; 3ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(+.f64 x x)
accuracy	29.177129168929827	#s(approx (- (* x 2) y) (+.f64 x x))

Samples

15.0ms

256×

valid

Compiler

Compiled 11 to 8 computations (27.3% saved)

Precisions

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

ival-sub: 7.0ms (71.2% of total)

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

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

series2.0ms (0.1%)

Memory

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

Counts

2 → 9

Calls

Call 1

Inputs
#s(approx (- (* x 2) y) (+.f64 x x))
(+.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 (+ 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 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))
0.0ms	x	@	-inf	((- (* x 2) y) (+ x x))
0.0ms	x	@	0	((- (* x 2) y) (+ x x))
0.0ms	y	@	inf	((- (* x 2) y) (+ x x))
0.0ms	y	@	-inf	((- (* x 2) y) (+ x x))

simplify151.0ms (6.6%)

Memory

-1.3MiB live, 87.8MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	37	90
1	85	90
2	247	90
3	761	90
4	3389	90
5	7931	90
0	8064	90

Stop Event

1×	iter limit
1×	node limit

Counts

9 → 9

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

rewrite16.0ms (0.7%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	12
0	8	12
0	33	12

Stop Event

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

Counts

2 → 6

Calls

Call 1

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

eval19.0ms (0.8%)

Memory: -41.2MiB live, 12.0MiB allocated; 7ms collecting garbage
Compiler: Compiled 109 to 30 computations (72.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	9	0	9
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	9	3	12

Accuracy

100.0%

Counts

12 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 58 to 33 computations (43.1% saved)

regimes9.0ms (0.4%)

Memory

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

regimes7.0ms (0.3%)

Memory

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
79.8%	3	`(*.f64 x #s(literal 2 binary64))`
62.5%	4	`(-.f64 (*.f64 x #s(literal 2 binary64)) y)`
79.8%	3	`x`
76.7%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes6.0ms (0.3%)

Memory

-33.5MiB live, 13.3MiB allocated; 2ms 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:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch16.0ms (0.7%)

Memory

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

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
8.0ms	9.810103105150363e-70	9.362788600445722e-68
7.0ms	-1.989772753603199e+51	-3.0108917526419835e+50

Samples

7.0ms

208×

valid

Compiler

Compiled 229 to 218 computations (4.8% saved)

Precisions

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

ival-sub: 1.0ms (35.9% of total)

ival-mult: 1.0ms (35.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)

simplify49.0ms (2.1%)

Memory

-29.0MiB live, 63.7MiB allocated; 6ms 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 x #s(literal -490000000000000016616684787210935802023343040757760 binary64)) #s(approx (- (* x 2) y) (+.f64 x x)) (if (<=.f64 x #s(literal 5463756259384863/60708402882054033466233184588234965832575213720379360039119137804340758912662765568 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))

Outputs
(-.f64 (+.f64 x x) y)
(if (<=.f64 x #s(literal -490000000000000016616684787210935802023343040757760 binary64)) #s(approx (- (* x 2) y) (+.f64 x x)) (if (<=.f64 x #s(literal 5463756259384863/60708402882054033466233184588234965832575213720379360039119137804340758912662765568 binary64)) #s(approx (- (* x 2) y) (neg.f64 y)) #s(approx (- (* x 2) y) (+.f64 x x))))
(if (or (<=.f64 x #s(literal -490000000000000016616684787210935802023343040757760 binary64)) (not (<=.f64 x #s(literal 5463756259384863/60708402882054033466233184588234965832575213720379360039119137804340758912662765568 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))

derivations78.0ms (3.4%)

Memory

32.4MiB live, 82.6MiB allocated; 8ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 39 to 17 computations (56.4% saved)

preprocess26.0ms (1.1%)

Memory: -24.4MiB live, 22.8MiB allocated; 2ms 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%)

sample782.0ms (34.2%)

explain54.0ms (2.4%)

preprocess184.0ms (8.1%)

eval0.0ms (0%)

prune16.0ms (0.7%)

simplify110.0ms (4.8%)

localize31.0ms (1.3%)

series3.0ms (0.1%)

simplify134.0ms (5.9%)

rewrite46.0ms (2%)

eval2.0ms (0.1%)

prune1.0ms (0%)

simplify121.0ms (5.3%)

localize73.0ms (3.2%)

series3.0ms (0.1%)

simplify114.0ms (5%)

rewrite53.0ms (2.3%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

simplify123.0ms (5.4%)

localize52.0ms (2.3%)

series2.0ms (0.1%)

simplify151.0ms (6.6%)

rewrite16.0ms (0.7%)

eval19.0ms (0.8%)

prune2.0ms (0.1%)

regimes9.0ms (0.4%)

regimes7.0ms (0.3%)

regimes6.0ms (0.3%)

bsearch16.0ms (0.7%)

simplify49.0ms (2.1%)

derivations78.0ms (3.4%)

preprocess26.0ms (1.1%)

end0.0ms (0%)

Profiling