Metrics for Data.Colour.CIE.Chromaticity:chromaCoords from colour-2.3.3

start0.0ms (0%)

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

sample921.0ms (43.8%)

Memory

-28.1MiB live, 992.4MiB allocated; 296ms collecting garbage

Samples

445.0ms	8 249×	0	valid
0.0ms	3×	2	valid
0.0ms	4×	1	valid

Precisions

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

ival-sub: 136.0ms (88.6% of total)

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

exact: 6.0ms (3.9% of total)

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

adjust: 2.0ms (1.3% of total)

Bogosity

explain78.0ms (3.7%)

Memory

38.9MiB live, 126.6MiB allocated; 19ms collecting garbage

FPErrors

Click to see full error table

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

47.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-sub: 5.0ms (76.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)

preprocess320.0ms (15.2%)

Memory

-26.1MiB live, 208.6MiB allocated; 97ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	36
1	24	36
2	29	36
3	52	36
4	139	31
5	684	30
6	4184	30
7	7861	30
0	5	5
0	7	5
1	11	5
2	15	5
3	29	5
4	74	5
5	359	5
6	3120	5
7	6967	5
0	8691	5

Stop Event

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

Calls

Call 1

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

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

Symmetry

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

series2.0ms (0.1%)

Memory

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

Counts

5 → 17

Calls

Call 1

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

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

Calls

6 calls:

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

simplify145.0ms (6.9%)

Memory

-2.5MiB live, 148.5MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	55	147
1	120	138
2	319	138
3	947	138
4	4139	138
0	8113	138

Stop Event

1×	iter limit
1×	node limit

Counts

17 → 17

Calls

Call 1

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

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

rewrite57.0ms (2.7%)

Memory

14.7MiB live, 60.1MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	37	11
0	299	11

Stop Event

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

Counts

5 → 20

Calls

Call 1

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

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

eval3.0ms (0.1%)

Memory: 3.4MiB live, 3.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 374 to 91 computations (75.7% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

6 alts after pruning (5 fresh and 1 done)

	Pruned	Kept	Total
New	25	5	30
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	25	6	31

Accuracy

100.0%

Counts

31 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (-.f64 #s(literal 1 binary64) x) y)
▶	72.3%	(-.f64 #s(approx (- 1 x) (neg.f64 x)) y)
▶	67.0%	(-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y)
▶	58.3%	#s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x))
▶	39.8%	#s(approx (- (- 1 x) y) (neg.f64 y))
▶	32.6%	#s(approx (- (- 1 x) y) (neg.f64 x))

Compiler

Compiled 85 to 77 computations (9.4% saved)

series3.0ms (0.1%)

Memory

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

Counts

13 → 19

Calls

Call 1

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

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

Calls

6 calls:

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

simplify139.0ms (6.6%)

Memory

-27.5MiB live, 69.6MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	59	157
1	124	148
2	322	148
3	949	148
4	4130	148
0	8106	148

Stop Event

1×	iter limit
1×	node limit

Counts

19 → 19

Calls

Call 1

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

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

rewrite34.0ms (1.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	61
0	20	61
1	70	61
0	488	61

Stop Event

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

Counts

13 → 31

Calls

Call 1

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

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

eval4.0ms (0.2%)

Memory: 5.3MiB live, 5.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 770 to 114 computations (85.2% saved)

prune4.0ms (0.2%)

Memory

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

Pruning

6 alts after pruning (0 fresh and 6 done)

	Pruned	Kept	Total
New	49	0	49
Fresh	0	0	0
Picked	0	5	5
Done	0	1	1
Total	49	6	55

Accuracy

100.0%

Counts

55 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (-.f64 #s(literal 1 binary64) x) y)
✓	72.3%	(-.f64 #s(approx (- 1 x) (neg.f64 x)) y)
✓	67.0%	(-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y)
✓	58.3%	#s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x))
✓	39.8%	#s(approx (- (- 1 x) y) (neg.f64 y))
✓	32.6%	#s(approx (- (- 1 x) y) (neg.f64 x))

Compiler

Compiled 90 to 58 computations (35.6% saved)

regimes48.0ms (2.3%)

Memory

-29.7MiB live, 16.4MiB allocated; 2ms collecting garbage

Counts

6 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes8.0ms (0.4%)

Memory

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

Counts

5 → 2

Calls

Call 1

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

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
97.8%	2	`(-.f64 #s(literal 1 binary64) x)`
98.5%	3	`(-.f64 (-.f64 #s(literal 1 binary64) x) y)`
97.8%	2	`x`
97.5%	2	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes7.0ms (0.3%)

Memory

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

Counts

4 → 2

Calls

Call 1

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

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
96.5%	2	`(-.f64 (-.f64 #s(literal 1 binary64) x) y)`
92.1%	2	`y`
89.4%	2	`(-.f64 #s(literal 1 binary64) x)`
89.4%	2	`x`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes2.0ms (0.1%)

Memory

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

Counts

3 → 2

Calls

Call 1

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

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

Calls

1 calls:

1.0ms

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

Results

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

Compiler

Compiled 5 to 5 computations (0% saved)

regimes21.0ms (1%)

Memory

-34.0MiB live, 10.2MiB allocated; 5ms collecting garbage

Counts

2 → 2

Calls

Call 1

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

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

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
62.8%	2	`(-.f64 #s(literal 1 binary64) x)`
62.8%	2	`x`
65.0%	2	`y`
69.4%	2	`(-.f64 (-.f64 #s(literal 1 binary64) x) y)`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.2%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch11.0ms (0.5%)

Memory

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

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
10.0ms	-18.348798341922777	-0.020138231345792564

Samples

3.0ms	100×	0	valid
1.0ms	18×	1	valid
1.0ms	10×	2	valid

Compiler

Compiled 128 to 138 computations (-7.8% saved)

Precisions

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

adjust: 1.0ms (46% of total)

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

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	0.9999748689133064	1.0

Compiler

Compiled 8 to 10 computations (-25% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-4104284.583411007	0.6981306876442752

Compiler

Compiled 8 to 10 computations (-25% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-4104284.583411007	0.6981306876442752

Compiler

Compiled 8 to 10 computations (-25% saved)

simplify64.0ms (3.1%)

Memory

-25.9MiB live, 26.3MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	26	105
1	40	105
2	46	105
3	60	105
4	95	105
5	324	105
6	2890	105
7	6481	105

Stop Event

1×	node limit

Calls

Call 1

Inputs
(-.f64 (-.f64 #s(literal 1 binary64) x) y)
(if (<=.f64 x #s(literal -1 binary64)) (-.f64 #s(approx (- 1 x) (neg.f64 x)) y) (-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal 9006972894035655/9007199254740992 binary64)) (-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y) #s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x)))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal -4000000 binary64)) #s(approx (- (- 1 x) y) (neg.f64 y)) #s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x)))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal -4000000 binary64)) #s(approx (- (- 1 x) y) (neg.f64 y)) #s(approx (- (- 1 x) y) (neg.f64 x)))
#s(approx (- (- 1 x) y) (neg.f64 x))

Outputs
(-.f64 (-.f64 #s(literal 1 binary64) x) y)
(if (<=.f64 x #s(literal -1 binary64)) (-.f64 #s(approx (- 1 x) (neg.f64 x)) y) (-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal 9006972894035655/9007199254740992 binary64)) (-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y) #s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x)))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal -4000000 binary64)) #s(approx (- (- 1 x) y) (neg.f64 y)) #s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x)))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal -4000000 binary64)) #s(approx (- (- 1 x) y) (neg.f64 y)) #s(approx (- (- 1 x) y) (neg.f64 x)))
#s(approx (- (- 1 x) y) (neg.f64 x))

derivations200.0ms (9.5%)

Memory

8.4MiB live, 101.3MiB allocated; 4ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 105 to 27 computations (74.3% saved)

preprocess25.0ms (1.2%)

Memory: 27.6MiB live, 27.6MiB allocated; 0ms collecting garbage
Remove: (sort x y)
Compiler: Compiled 240 to 84 computations (65% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample921.0ms (43.8%)

explain78.0ms (3.7%)

preprocess320.0ms (15.2%)

eval0.0ms (0%)

prune0.0ms (0%)

series2.0ms (0.1%)

simplify145.0ms (6.9%)

rewrite57.0ms (2.7%)

eval3.0ms (0.1%)

prune3.0ms (0.1%)

series3.0ms (0.1%)

simplify139.0ms (6.6%)

rewrite34.0ms (1.6%)

eval4.0ms (0.2%)

prune4.0ms (0.2%)

regimes48.0ms (2.3%)

regimes8.0ms (0.4%)

regimes7.0ms (0.3%)

regimes2.0ms (0.1%)

regimes21.0ms (1%)

regimes4.0ms (0.2%)

bsearch11.0ms (0.5%)

bsearch0.0ms (0%)

bsearch0.0ms (0%)

bsearch0.0ms (0%)

simplify64.0ms (3.1%)

derivations200.0ms (9.5%)

preprocess25.0ms (1.2%)

end0.0ms (0%)

Profiling