Metrics for Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, H

start0.0ms (0%)

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

sample932.0ms (33.6%)

Memory

36.8MiB live, 1 011.7MiB allocated; 240ms collecting garbage

Samples

689.0ms

8 256×

valid

Precisions

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

ival-mult: 129.0ms (55.2% of total)

ival-sub: 88.0ms (37.7% of total)

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

exact: 5.0ms (2.1% of total)

adjust: 3.0ms (1.3% of total)

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

Bogosity

explain54.0ms (1.9%)

Memory

-23.1MiB live, 126.2MiB allocated; 22ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(-.f64 #s(literal 1 binary64) y)`
-	-	`(*.f64 x (-.f64 #s(literal 1 binary64) y))`
-	-	`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

22.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-sub: 3.0ms (39.6% of total)

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

preprocess340.0ms (12.3%)

Memory

-0.5MiB live, 242.9MiB allocated; 108ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	34
1	28	34
2	37	34
3	61	34
4	154	31
5	665	30
6	5931	30
0	5	5
0	7	5
1	10	5
2	13	5
3	23	5
4	62	5
5	302	5
6	2755	5
7	6681	5
0	8265	5

Stop Event

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

Calls

Call 1

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

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

Symmetry

(negabs x)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.2MiB live, 0.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 x (-.f64 #s(literal 1 binary64) y))

Compiler

Compiled 5 to 5 computations (0% saved)

simplify153.0ms (5.5%)

Memory

17.7MiB live, 207.1MiB allocated; 20ms collecting garbage

Localize:

Found 2 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	10	11
2	13	11
3	23	11
4	62	11
5	302	11
6	2755	11
7	6681	11
0	8265	11

Stop Event

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

Calls

Call 1

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

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

localize38.0ms (1.4%)

Memory

-32.4MiB live, 63.4MiB allocated; 23ms collecting garbage

Localize:

Found 2 expressions of interest:

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

Samples

17.0ms

256×

valid

Compiler

Compiled 13 to 7 computations (46.2% saved)

Precisions

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

ival-mult: 8.0ms (78.2% of total)

ival-sub: 2.0ms (19.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)

series3.0ms (0.1%)

Memory

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

Counts

2 → 11

Calls

Call 1

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

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

Calls

6 calls:

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

simplify215.0ms (7.8%)

Memory

-7.0MiB live, 179.9MiB allocated; 37ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	36	96
1	82	93
2	176	93
3	445	93
4	2046	93
5	5657	93
0	8050	93

Stop Event

1×	iter limit
1×	node limit

Counts

11 → 11

Calls

Call 1

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

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

rewrite88.0ms (3.2%)

Memory

40.2MiB live, 82.4MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	7	8
1	24	8
0	148	8

Stop Event

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

Counts

2 → 13

Calls

Call 1

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

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

eval25.0ms (0.9%)

Memory: -23.0MiB live, 13.5MiB allocated; 19ms collecting garbage
Compiler: Compiled 207 to 58 computations (72% saved)

prune1.0ms (0%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	16	3	19
Fresh	0	0	0
Picked	1	0	1
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
▶	52.6%	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
▶	100.0%	#s(approx (* x (- 1 y)) (fma.f64 (neg.f64 x) y x))
▶	49.2%	#s(approx (* x (- 1 y)) x)

Compiler

Compiled 26 to 21 computations (19.2% saved)

simplify225.0ms (8.1%)

Memory

-2.3MiB live, 198.2MiB allocated; 55ms collecting garbage

Localize:

Found 7 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	46
0	17	46
1	25	46
2	37	46
3	58	46
4	122	46
5	371	46
6	2935	46
7	7132	46
0	8043	46

Stop Event

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

Calls

Call 1

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

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

localize60.0ms (2.2%)

Memory

-19.8MiB live, 125.3MiB allocated; 25ms collecting garbage

Localize:

Found 7 expressions of interest:

New	Metric	Score
accuracy	0.0	(neg.f64 y)
accuracy	0.0078125	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
accuracy	30.620007748604944	#s(approx (- 1 y) (neg.f64 y))
accuracy	0.0	(fma.f64 (neg.f64 x) y x)
accuracy	0.0	(neg.f64 x)
accuracy	0.0	#s(approx (* x (- 1 y)) (fma.f64 (neg.f64 x) y x))
accuracy	32.52027387039807	#s(approx (* x (- 1 y)) x)

Samples

37.0ms

256×

valid

Compiler

Compiled 35 to 11 computations (68.6% saved)

Precisions

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

ival-sub: 21.0ms (73.5% of total)

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

ival-neg: 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)

series5.0ms (0.2%)

Memory

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

Counts

7 → 20

Calls

Call 1

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

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

Calls

6 calls:

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

simplify252.0ms (9.1%)

Memory

20.2MiB live, 204.2MiB allocated; 46ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	53	178
1	113	175
2	222	175
3	517	175
4	2326	175
5	5907	175
0	8398	175

Stop Event

1×	iter limit
1×	node limit

Counts

20 → 20

Calls

Call 1

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

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

rewrite48.0ms (1.7%)

Memory

-33.4MiB live, 66.1MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	41
0	17	41
1	51	41
0	310	41

Stop Event

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

Counts

7 → 23

Calls

Call 1

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

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

eval6.0ms (0.2%)

Memory: 11.4MiB live, 11.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 461 to 88 computations (80.9% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	29	0	29
Fresh	0	0	0
Picked	0	3	3
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
✓	52.6%	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
✓	100.0%	#s(approx (* x (- 1 y)) (fma.f64 (neg.f64 x) y x))
✓	49.2%	#s(approx (* x (- 1 y)) x)

Compiler

Compiled 57 to 36 computations (36.8% saved)

regimes7.0ms (0.3%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes22.0ms (0.8%)

Memory

-35.0MiB live, 12.9MiB allocated; 3ms collecting garbage

Counts

2 → 3

Calls

Call 1

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

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
97.7%	3	`(-.f64 #s(literal 1 binary64) y)`
81.5%	3	`(*.f64 x (-.f64 #s(literal 1 binary64) y))`
65.6%	5	`x`
97.7%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.2%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch21.0ms (0.8%)

Memory

-9.1MiB live, 37.4MiB allocated; 2ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
7.0ms	0.5535359380056909	2.926899608091187
11.0ms	-9338.666330329856	-1.4235874011479383e-9

Samples

9.0ms

256×

valid

Compiler

Compiled 248 to 250 computations (-0.8% saved)

Precisions

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

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

ival-sub: 1.0ms (29.1% 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)

simplify54.0ms (1.9%)

Memory

8.5MiB live, 53.1MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	42
1	29	42
2	34	42
3	44	42
4	76	42
5	297	42
6	2787	42
7	7718	42

Stop Event

1×	node limit

Calls

Call 1

Inputs

#s(approx (* x (- 1 y)) (fma.f64 (neg.f64 x) y x))

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

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

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

derivations198.0ms (7.1%)

Memory

2.3MiB live, 136.6MiB allocated; 82ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 42 to 19 computations (54.8% saved)

preprocess17.0ms (0.6%)

Memory: 35.6MiB live, 35.6MiB allocated; 0ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 116 to 64 computations (44.8% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample932.0ms (33.6%)

explain54.0ms (1.9%)

preprocess340.0ms (12.3%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify153.0ms (5.5%)

localize38.0ms (1.4%)

series3.0ms (0.1%)

simplify215.0ms (7.8%)

rewrite88.0ms (3.2%)

eval25.0ms (0.9%)

prune1.0ms (0%)

simplify225.0ms (8.1%)

localize60.0ms (2.2%)

series5.0ms (0.2%)

simplify252.0ms (9.1%)

rewrite48.0ms (1.7%)

eval6.0ms (0.2%)

prune2.0ms (0.1%)

regimes7.0ms (0.3%)

regimes22.0ms (0.8%)

regimes4.0ms (0.2%)

bsearch21.0ms (0.8%)

simplify54.0ms (1.9%)

derivations198.0ms (7.1%)

preprocess17.0ms (0.6%)

end0.0ms (0%)

Profiling