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

sample885.0ms (35.2%)

Memory

35.5MiB live, 883.3MiB allocated; 193ms collecting garbage

Samples

507.0ms

8 256×

valid

Precisions

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

ival-mult: 143.0ms (43.2% of total)

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

ival-true: 58.0ms (17.5% of total)

exact: 6.0ms (1.8% of total)

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

adjust: 2.0ms (0.6% of total)

Bogosity

explain115.0ms (4.6%)

Memory

-29.8MiB live, 79.7MiB allocated; 39ms 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

87.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult: 71.0ms (95.1% of total)

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

preprocess209.0ms (8.3%)

Memory

-6.0MiB live, 277.0MiB allocated; 33ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Calls

Call 1

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

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

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

Compiler

Compiled 5 to 5 computations (0% saved)

simplify147.0ms (5.8%)

Memory

35.5MiB live, 136.9MiB allocated; 19ms 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

localize17.0ms (0.7%)

Memory

-12.2MiB live, 30.9MiB allocated; 7ms 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

13.0ms

256×

valid

Compiler

Compiled 13 to 7 computations (46.2% saved)

Precisions

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

ival-mult: 5.0ms (74.6% of total)

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

series3.0ms (0.1%)

Memory

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

simplify137.0ms (5.4%)

Memory

-28.0MiB live, 113.6MiB allocated; 34ms 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)))

rewrite63.0ms (2.5%)

Memory

34.5MiB live, 81.4MiB allocated; 3ms 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: 8.5MiB live, 8.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 217 to 57 computations (73.7% saved)

prune6.0ms (0.2%)

Memory

-42.2MiB live, 4.1MiB allocated; 3ms 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)
▶	50.9%	#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
▶	50.9%	#s(approx (- (* x 2) y) (neg.f64 y))

Compiler

Compiled 22 to 19 computations (13.6% saved)

simplify155.0ms (6.1%)

Memory

34.1MiB live, 137.3MiB allocated; 34ms 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

localize43.0ms (1.7%)

Memory

7.0MiB live, 52.3MiB allocated; 5ms 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	31.3958296713389	#s(approx (- (* x 2) y) (*.f64 #s(literal 2 binary64) x))
accuracy	0.0	(neg.f64 y)
accuracy	31.4194469755758	#s(approx (- (* x 2) y) (neg.f64 y))

Samples

37.0ms

256×

valid

Compiler

Compiled 30 to 11 computations (63.3% saved)

Precisions

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

ival-neg: 21.0ms (73.7% of total)

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

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

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

series7.0ms (0.3%)

Memory

-37.9MiB live, 5.7MiB allocated; 9ms 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
5.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))

simplify148.0ms (5.9%)

Memory

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

rewrite20.0ms (0.8%)

Memory

-6.3MiB live, 40.5MiB allocated; 1ms 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: 3.7MiB live, 3.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 196 to 51 computations (74% saved)

prune2.0ms (0.1%)

Memory

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

Compiler

Compiled 22 to 18 computations (18.2% saved)

simplify100.0ms (4%)

Memory

-2.9MiB live, 96.1MiB allocated; 10ms 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

localize54.0ms (2.1%)

Memory

-26.6MiB live, 18.0MiB allocated; 8ms collecting garbage

Localize:

Found 2 expressions of interest:

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

Samples

10.0ms

256×

valid

Compiler

Compiled 11 to 8 computations (27.3% saved)

Precisions

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

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

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

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

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

simplify138.0ms (5.5%)

Memory

7.1MiB live, 107.6MiB allocated; 17ms 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)))

rewrite21.0ms (0.8%)

Memory

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

eval1.0ms (0%)

Memory: 0.9MiB live, 0.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 109 to 30 computations (72.5% saved)

prune2.0ms (0.1%)

Memory

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

Compiler

Compiled 58 to 33 computations (43.1% saved)

regimes8.0ms (0.3%)

Memory

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

Counts

5 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes6.0ms (0.3%)

Memory

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes29.0ms (1.1%)

Memory

-37.6MiB live, 9.0MiB allocated; 3ms 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:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch16.0ms (0.6%)

Memory

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

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
5.0ms	4.871215089346913e+42	1.0733298719752683e+43
9.0ms	-1434897.0645864827	-172.3380623548953

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 (34.6% of total)

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

simplify56.0ms (2.2%)

Memory

-6.3MiB live, 39.0MiB 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 -1020000 binary64)) #s(approx (- (* x 2) y) (+.f64 x x)) (if (<=.f64 x #s(literal 5300000000000000284317028667004119272128512 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 -1020000 binary64)) #s(approx (- (* x 2) y) (+.f64 x x)) (if (<=.f64 x #s(literal 5300000000000000284317028667004119272128512 binary64)) #s(approx (- (* x 2) y) (neg.f64 y)) #s(approx (- (* x 2) y) (+.f64 x x))))
(if (or (<=.f64 x #s(literal -1020000 binary64)) (not (<=.f64 x #s(literal 5300000000000000284317028667004119272128512 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))

derivations76.0ms (3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 39 to 17 computations (56.4% saved)

preprocess45.0ms (1.8%)

Memory: -25.8MiB live, 19.6MiB allocated; 5ms 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%)

sample885.0ms (35.2%)

explain115.0ms (4.6%)

preprocess209.0ms (8.3%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify147.0ms (5.8%)

localize17.0ms (0.7%)

series3.0ms (0.1%)

simplify137.0ms (5.4%)

rewrite63.0ms (2.5%)

eval2.0ms (0.1%)

prune6.0ms (0.2%)

simplify155.0ms (6.1%)

localize43.0ms (1.7%)

series7.0ms (0.3%)

simplify148.0ms (5.9%)

rewrite20.0ms (0.8%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

simplify100.0ms (4%)

localize54.0ms (2.1%)

series2.0ms (0.1%)

simplify138.0ms (5.5%)

rewrite21.0ms (0.8%)

eval1.0ms (0%)

prune2.0ms (0.1%)

regimes8.0ms (0.3%)

regimes6.0ms (0.3%)

regimes29.0ms (1.1%)

bsearch16.0ms (0.6%)

simplify56.0ms (2.2%)

derivations76.0ms (3%)

preprocess45.0ms (1.8%)

end0.0ms (0%)

Profiling