Metrics for Data.Colour.RGB:hslsv from colour-2.3.3, A

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)

sample739.0ms (42.4%)

Memory

6.8MiB live, 997.5MiB allocated; 216ms collecting garbage

Samples

484.0ms

8 256×

valid

Precisions

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

ival-add: 90.0ms (47.5% of total)

ival-div: 85.0ms (44.9% of total)

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

exact: 5.0ms (2.6% of total)

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

adjust: 2.0ms (1.1% of total)

Bogosity

explain50.0ms (2.8%)

Memory

-2.9MiB live, 84.2MiB allocated; 17ms collecting garbage

FPErrors

Click to see full error table

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

19.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-div: 4.0ms (52.8% of total)

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

preprocess256.0ms (14.7%)

Memory

20.8MiB live, 223.8MiB allocated; 48ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	34
1	35	34
2	65	34
3	99	34
4	155	34
5	372	30
6	1603	30
7	5470	30
0	5	5
0	7	5
1	13	5
2	17	5
3	25	5
4	51	5
5	165	5
6	935	5
7	5449	5
0	8357	5

Stop Event

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

Calls

Call 1

Inputs
(/.f64 (+.f64 x y) #s(literal 2 binary64))

Outputs
(/.f64 (+.f64 x y) #s(literal 2 binary64))
(/.f64 (+.f64 y x) #s(literal 2 binary64))

Symmetry

(sort 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

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 (+.f64 x y) #s(literal 2 binary64))

Compiler

Compiled 5 to 5 computations (0% saved)

series3.0ms (0.2%)

Memory

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

Counts

5 → 16

Calls

Call 1

Inputs
(/.f64 (+.f64 x y) #s(literal 2 binary64))
(+.f64 x y)
x
y
#s(literal 2 binary64)

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

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((/ (+ x y) 2) (+ x y) x y 2)
1.0ms	y	@	inf	((/ (+ x y) 2) (+ x y) x y 2)
1.0ms	x	@	-inf	((/ (+ x y) 2) (+ x y) x y 2)
1.0ms	y	@	-inf	((/ (+ x y) 2) (+ x y) x y 2)
0.0ms	x	@	0	((/ (+ x y) 2) (+ x y) x y 2)

simplify142.0ms (8.2%)

Memory

-28.8MiB live, 159.6MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	56	124
1	135	124
2	281	124
3	765	124
4	3181	124
5	7076	124
0	8120	124

Stop Event

1×	iter limit
1×	node limit

Counts

16 → 16

Calls

Call 1

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

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

rewrite40.0ms (2.3%)

Memory

20.6MiB live, 64.9MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	30	11
0	185	11

Stop Event

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

Counts

5 → 25

Calls

Call 1

Inputs
(/.f64 (+.f64 x y) #s(literal 2 binary64))
(+.f64 x y)
x
y
#s(literal 2 binary64)

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

eval3.0ms (0.2%)

Memory: 5.7MiB live, 5.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 375 to 100 computations (73.3% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	30	3	33
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	31	3	34

Accuracy

100.0%

Counts

34 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (/ (+ x y) 2) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
▶	53.5%	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y))
▶	45.9%	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))

Compiler

Compiled 29 to 25 computations (13.8% saved)

series4.0ms (0.2%)

Memory

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

Counts

10 → 25

Calls

Call 1

Inputs
#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))
(*.f64 #s(literal 1/2 binary64) x)
#s(literal 1/2 binary64)
x
#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
y
#s(approx (/ (+ x y) 2) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(+.f64 y x)

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

Calls

6 calls:

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

simplify101.0ms (5.8%)

Memory

-17.6MiB live, 80.3MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	67	211
1	150	211
2	295	211
3	779	211
4	3214	211
5	7102	211
0	8146	211

Stop Event

1×	iter limit
1×	node limit

Counts

25 → 25

Calls

Call 1

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

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

rewrite38.0ms (2.2%)

Memory

3.6MiB live, 48.8MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	46
0	17	46
1	52	46
0	297	46

Stop Event

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

Counts

10 → 40

Calls

Call 1

Inputs
#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))
(*.f64 #s(literal 1/2 binary64) x)
#s(literal 1/2 binary64)
x
#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
y
#s(approx (/ (+ x y) 2) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(+.f64 y x)

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

eval5.0ms (0.3%)

Memory: 11.1MiB live, 11.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 860 to 152 computations (82.3% saved)

prune10.0ms (0.6%)

Memory

-31.5MiB live, 13.8MiB allocated; 6ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	56	0	56
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	56	3	59

Accuracy

100.0%

Counts

59 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (/ (+ x y) 2) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
✓	53.5%	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y))
✓	45.9%	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))

Compiler

Compiled 63 to 41 computations (34.9% saved)

regimes8.0ms (0.4%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))
#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y))
#s(approx (/ (+ x y) 2) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
(/.f64 (+.f64 x y) #s(literal 2 binary64))

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

Calls

4 calls:

2.0ms	y
2.0ms	(/.f64 (+.f64 x y) #s(literal 2 binary64))
2.0ms	x
2.0ms	(+.f64 x y)

Results

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

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes5.0ms (0.3%)

Memory

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

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))
#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y))

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

Calls

4 calls:

1.0ms	(/.f64 (+.f64 x y) #s(literal 2 binary64))
1.0ms	y
1.0ms	(+.f64 x y)
1.0ms	x

Results

Accuracy	Segments	Branch
95.9%	2	`(+.f64 x y)`
95.9%	2	`(/.f64 (+.f64 x y) #s(literal 2 binary64))`
80.3%	2	`x`
82.6%	2	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes20.0ms (1.1%)

Memory

-23.2MiB live, 28.6MiB allocated; 8ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))

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

Calls

4 calls:

16.0ms	y
1.0ms	x
1.0ms	(/.f64 (+.f64 x y) #s(literal 2 binary64))
1.0ms	(+.f64 x y)

Results

Accuracy	Segments	Branch
45.9%	1	`x`
45.9%	1	`y`
45.9%	1	`(+.f64 x y)`
45.9%	1	`(/.f64 (+.f64 x y) #s(literal 2 binary64))`

Compiler

Compiled 10 to 12 computations (-20% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-2.769223956598424e-284	2.0357675356817346e-284

Compiler

Compiled 8 to 10 computations (-25% saved)

simplify42.0ms (2.4%)

Memory

-4.4MiB live, 41.3MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	46
1	24	46
2	28	46
3	37	46
4	75	46
5	424	46
6	3579	46

Stop Event

1×	node limit

Calls

Call 1

Inputs

#s(approx (/ (+ x y) 2) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))

(if (<=.f64 (/.f64 (+.f64 x y) #s(literal 2 binary64)) #s(literal -6696928794914171/334846439745708537796382827831250565800439003657979252326171996365734703476542538279124493379904955664873335286735358382870982901778848138624518049209330462622955242963257218294408581408199098183686068192282702343236935664606211486223923248314908216080349889927704442739388432239144512088662677127168 binary64)) #s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x)) #s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y)))

#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))

Outputs

#s(approx (/ (+ x y) 2) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))

(if (<=.f64 (/.f64 (+.f64 x y) #s(literal 2 binary64)) #s(literal -6696928794914171/334846439745708537796382827831250565800439003657979252326171996365734703476542538279124493379904955664873335286735358382870982901778848138624518049209330462622955242963257218294408581408199098183686068192282702343236935664606211486223923248314908216080349889927704442739388432239144512088662677127168 binary64)) #s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x)) #s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y)))

#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))

derivations222.0ms (12.7%)

Memory

3.0MiB live, 150.4MiB allocated; 150ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 46 to 19 computations (58.7% saved)

preprocess52.0ms (3%)

Memory: -11.0MiB live, 41.0MiB allocated; 29ms collecting garbage
Remove: (sort x y)
Compiler: Compiled 124 to 66 computations (46.8% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample739.0ms (42.4%)

explain50.0ms (2.8%)

preprocess256.0ms (14.7%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.2%)

simplify142.0ms (8.2%)

rewrite40.0ms (2.3%)

eval3.0ms (0.2%)

prune2.0ms (0.1%)

series4.0ms (0.2%)

simplify101.0ms (5.8%)

rewrite38.0ms (2.2%)

eval5.0ms (0.3%)

prune10.0ms (0.6%)

regimes8.0ms (0.4%)

regimes5.0ms (0.3%)

regimes20.0ms (1.1%)

bsearch0.0ms (0%)

simplify42.0ms (2.4%)

derivations222.0ms (12.7%)

preprocess52.0ms (3%)

end0.0ms (0%)

Profiling