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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample1.2s (32.7%)

Memory

-8.7MiB live, 902.0MiB allocated; 164ms collecting garbage

Samples

834.0ms

8 256×

valid

Precisions

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

ival-sub: 242.0ms (54.2% of total)

ival-mult: 187.0ms (41.9% of total)

ival-true: 7.0ms (1.6% of total)

exact: 5.0ms (1.1% of total)

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

adjust: 2.0ms (0.4% of total)

Bogosity

explain177.0ms (4.7%)

Memory

-21.9MiB live, 71.4MiB allocated; 7ms 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

128.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.2% of total)

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

preprocess226.0ms (6%)

Memory

0.0MiB live, 137.5MiB allocated; 28ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	31
1	36	29
2	46	29
3	70	29
4	164	26
5	670	25
6	5950	25
0	9	7
0	14	7
1	16	7
2	19	7
3	27	7
4	53	7
5	190	7
6	1431	7
7	4338	7
0	8009	7

Stop Event

1×	saturated
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))

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

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

simplify102.0ms (2.7%)

Memory

3.8MiB live, 93.0MiB allocated; 16ms 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	9	17
0	14	17
1	16	17
2	19	17
3	27	17
4	53	17
5	190	17
6	1431	17
7	4338	17
0	8009	17

Stop Event

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

localize14.0ms (0.4%)

Memory

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

10.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-sub: 2.0ms (54.6% of total)

ival-mult: 2.0ms (54.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

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

simplify155.0ms (4.1%)

Memory

-36.6MiB live, 111.4MiB allocated; 19ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	50	116
1	102	113
2	196	113
3	465	113
4	2040	113
5	5640	113
0	8033	101
1	8411	101
2	10009	101
3	11262	101
4	11506	101
5	11510	101

Stop Event

1×	saturated
1×	node limit

Counts

11 → 7

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 y) x 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 y) x x))
#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)) (*.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 y) x 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 (* x (- 1 y)) #s(hole binary64 (* -1 (* y (+ x (* -1 (/ x y)))))))
#s(approx (* x (- 1 y)) (fma.f64 (neg.f64 y) x x))
#s(approx (- 1 y) #s(hole binary64 (* -1 (* y (- 1 (/ 1 y))))))

rewrite59.0ms (1.6%)

Memory

-1.2MiB live, 100.8MiB allocated; 23ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	12
1	14	12
2	16	12
3	18	12
0	18	12
1	35	12
0	159	12
1	186	12
2	234	12
3	286	12
4	314	12
5	319	12

Stop Event

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

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

eval2.0ms (0%)

Memory: 5.6MiB live, 5.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 201 to 52 computations (74.1% saved)

prune1.0ms (0%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	14	3	17
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	15	3	18

Accuracy

100.0%

Counts

18 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	49.1%	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
▶	100.0%	#s(approx (* x (- 1 y)) (fma.f64 (neg.f64 y) x x))
▶	53.4%	#s(approx (* x (- 1 y)) x)

Compiler

Compiled 26 to 21 computations (19.2% saved)

simplify96.0ms (2.6%)

Memory

-17.6MiB live, 75.0MiB allocated; 8ms 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 y)
cost-diff	0	(fma.f64 (neg.f64 y) x x)
cost-diff	0	#s(approx (* x (- 1 y)) (fma.f64 (neg.f64 y) x x))
cost-diff	0	#s(approx (* x (- 1 y)) x)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	46
0	20	46
1	23	46
2	26	46
3	36	46
4	75	46
5	315	46
6	2768	46
7	6727	46
0	8036	46

Stop Event

1×	saturated
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 y) x x))
(fma.f64 (neg.f64 y) x x)
(neg.f64 y)
y
x
(*.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 y) x x))
(fma.f64 (neg.f64 y) x x)
(neg.f64 y)
y
x
(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
x
#s(approx (- 1 y) (neg.f64 y))
(neg.f64 y)
y

localize47.0ms (1.3%)

Memory

14.0MiB live, 60.7MiB allocated; 3ms 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	32.80287977799724	#s(approx (- 1 y) (neg.f64 y))
accuracy	0.0	(fma.f64 (neg.f64 y) x x)
accuracy	0.0	(neg.f64 y)
accuracy	0.0	#s(approx (* x (- 1 y)) (fma.f64 (neg.f64 y) x x))
accuracy	29.79431752628429	#s(approx (* x (- 1 y)) x)

Samples

40.0ms

256×

valid

Compiler

Compiled 35 to 10 computations (71.4% saved)

Precisions

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

ival-sub: 26.0ms (80.6% of total)

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

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

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

series5.0ms (0.1%)

Memory

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

Counts

6 → 19

Calls

Call 1

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

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

simplify256.0ms (6.9%)

Memory

-16.7MiB live, 127.6MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	67	207
1	139	204
2	256	204
3	553	204
4	2356	204
5	5939	204
0	8430	178
1	8912	178
2	11030	178
3	12761	178
4	13128	178
5	13132	178

Stop Event

1×	saturated
1×	node limit

Counts

19 → 15

Calls

Call 1

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

rewrite912.0ms (24.4%)

Memory

31.8MiB live, 172.1MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	39
1	20	39
2	22	39
3	25	39
0	25	39
1	60	39
0	328	39
1	366	39
2	478	39
3	611	39
4	651	39
5	662	39
6	663	39

Stop Event

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

Counts

6 → 21

Calls

Call 1

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

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

eval45.0ms (1.2%)

Memory: -36.4MiB live, 10.1MiB allocated; 2ms collecting garbage
Compiler: Compiled 475 to 80 computations (83.2% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	26	0	26
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	26	3	29

Accuracy

100.0%

Counts

29 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	49.1%	(*.f64 x #s(approx (- 1 y) (neg.f64 y)))
✓	100.0%	#s(approx (* x (- 1 y)) (fma.f64 (neg.f64 y) x x))
✓	53.4%	#s(approx (* x (- 1 y)) x)

Compiler

Compiled 57 to 35 computations (38.6% saved)

regimes8.0ms (0.2%)

Memory

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

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

regimes38.0ms (1%)

Memory

-24.9MiB live, 20.5MiB 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:

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

Results

Accuracy	Segments	Branch
98.6%	3	`(-.f64 #s(literal 1 binary64) y)`
84.6%	3	`(*.f64 x (-.f64 #s(literal 1 binary64) y))`
58.7%	2	`x`
98.6%	3	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.1%)

Memory

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch58.0ms (1.6%)

Memory

6.5MiB live, 64.9MiB allocated; 3ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
46.0ms	2.4733001151371666e-6	552439017.1671987
10.0ms	-123641.2931285949	-0.10577854844724797

Samples

14.0ms

304×

valid

Compiler

Compiled 293 to 295 computations (-0.7% saved)

Precisions

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

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

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

simplify102.0ms (2.7%)

Memory

-12.8MiB live, 79.4MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	21	46
1	39	46
2	44	46
3	54	46
4	86	46
5	308	46
6	2676	46
7	7688	46

Stop Event

1×	node limit

Calls

Call 1

Inputs

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

derivations184.0ms (4.9%)

Memory

-33.9MiB live, 126.4MiB allocated; 72ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 42 to 18 computations (57.1% saved)

preprocess18.0ms (0.5%)

Memory: 41.6MiB live, 41.6MiB allocated; 0ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 116 to 62 computations (46.6% saved)

end0.0ms (0%)

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

Iter	Nodes	Cost
0	9	12
1	14	12
2	16	12
3	18	12
0	18	12
1	35	12
0	159	12
1	186	12
2	234	12
3	286	12
4	314	12
5	319	12

Iter	Nodes	Cost
0	14	39
1	20	39
2	22	39
3	25	39
0	25	39
1	60	39
0	328	39
1	366	39
2	478	39
3	611	39
4	651	39
5	662	39
6	663	39

Iter	Nodes	Cost
0	9	12
1	14	12
2	16	12
3	18	12
0	18	12
1	35	12
0	159	12
1	186	12
2	234	12
3	286	12
4	314	12
5	319	12

Iter	Nodes	Cost
0	14	39
1	20	39
2	22	39
3	25	39
0	25	39
1	60	39
0	328	39
1	366	39
2	478	39
3	611	39
4	651	39
5	662	39
6	663	39

start0.0ms (0%)

analyze0.0ms (0%)

sample1.2s (32.7%)

explain177.0ms (4.7%)

preprocess226.0ms (6%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify102.0ms (2.7%)

localize14.0ms (0.4%)

series3.0ms (0.1%)

simplify155.0ms (4.1%)

rewrite59.0ms (1.6%)

eval2.0ms (0%)

prune1.0ms (0%)

simplify96.0ms (2.6%)

localize47.0ms (1.3%)

series5.0ms (0.1%)

simplify256.0ms (6.9%)

rewrite912.0ms (24.4%)

eval45.0ms (1.2%)

prune2.0ms (0.1%)

regimes8.0ms (0.2%)

regimes38.0ms (1%)

regimes4.0ms (0.1%)

bsearch58.0ms (1.6%)

simplify102.0ms (2.7%)

derivations184.0ms (4.9%)

preprocess18.0ms (0.5%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	9	12
1	14	12
2	16	12
3	18	12
0	18	12
1	35	12
0	159	12
1	186	12
2	234	12
3	286	12
4	314	12
5	319	12

Iter	Nodes	Cost
0	14	39
1	20	39
2	22	39
3	25	39
0	25	39
1	60	39
0	328	39
1	366	39
2	478	39
3	611	39
4	651	39
5	662	39
6	663	39