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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample962.0ms (37.3%)

Memory

40.3MiB live, 984.0MiB allocated; 212ms collecting garbage

Samples

499.0ms

8 256×

valid

Precisions

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

ival-div: 120.0ms (46.6% of total)

ival-add: 120.0ms (46.6% of total)

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

exact: 6.0ms (2.3% of total)

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

adjust: 2.0ms (0.8% of total)

Bogosity

explain127.0ms (4.9%)

Memory

-6.9MiB live, 151.3MiB allocated; 16ms 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

101.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-div: 5.0ms (50.4% of total)

ival-add: 3.0ms (30.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)

preprocess286.0ms (11.1%)

Memory

19.5MiB live, 197.2MiB allocated; 66ms 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.6MiB live, 0.6MiB 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)

simplify186.0ms (7.2%)

Memory

-1.1MiB live, 184.2MiB allocated; 44ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(+.f64 x y)
cost-diff	0	(/.f64 (+.f64 x y) #s(literal 2 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	13	11
2	17	11
3	25	11
4	51	11
5	165	11
6	935	11
7	5449	11
0	8357	11

Stop Event

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

Calls

Call 1

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

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

localize17.0ms (0.7%)

Memory

5.7MiB live, 49.8MiB allocated; 7ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(/.f64 (+.f64 x y) #s(literal 2 binary64))
accuracy	0.0	(+.f64 x y)

Samples

13.0ms

256×

valid

Compiler

Compiled 13 to 7 computations (46.2% saved)

Precisions

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

ival-add: 5.0ms (70.5% of total)

ival-div: 2.0ms (28.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)

series3.0ms (0.1%)

Memory

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

Counts

2 → 14

Calls

Call 1

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

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 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 (/ (+ 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	y	@	-inf	((/ (+ x y) 2) (+ x y))
0.0ms	x	@	inf	((/ (+ x y) 2) (+ x y))
0.0ms	x	@	-inf	((/ (+ x y) 2) (+ x y))
0.0ms	y	@	inf	((/ (+ x y) 2) (+ x y))
0.0ms	x	@	0	((/ (+ x y) 2) (+ x y))

simplify116.0ms (4.5%)

Memory

-32.8MiB live, 205.4MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	54	118
1	133	118
2	279	118
3	761	118
4	3187	118
5	7083	118
0	8127	118

Stop Event

1×	iter limit
1×	node limit

Counts

14 → 14

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 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 (/ (+ 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 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 (/ (+ 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))

rewrite97.0ms (3.8%)

Memory

6.8MiB live, 53.6MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

2 → 22

Calls

Call 1

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

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)

eval3.0ms (0.1%)

Memory: 6.6MiB live, 6.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 346 to 94 computations (72.8% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	25	3	28
Fresh	0	0	0
Picked	1	0	1
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
▶	100.0%	#s(approx (/ (+ x y) 2) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
▶	47.9%	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y))
▶	54.4%	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))

Compiler

Compiled 29 to 25 computations (13.8% saved)

simplify241.0ms (9.3%)

Memory

-41.2MiB live, 127.6MiB allocated; 137ms collecting garbage

Localize:

Found 7 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	50
0	17	50
1	26	50
2	32	50
3	52	50
4	95	50
5	241	50
6	1104	50
7	5541	50
0	8259	50

Stop Event

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

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)
#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 y x)
y
x
#s(literal 1/2 binary64)

Outputs
#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)
#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 y x)
y
x
#s(literal 1/2 binary64)

localize31.0ms (1.2%)

Memory

-4.2MiB live, 40.6MiB allocated; 10ms collecting garbage

Localize:

Found 7 expressions of interest:

New	Metric	Score
accuracy	0.0	(+.f64 y x)
accuracy	0.0	(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
accuracy	0.0	#s(approx (/ (+ x y) 2) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
accuracy	0.0	(*.f64 #s(literal 1/2 binary64) y)
accuracy	33.34418036783881	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y))
accuracy	0.0	(*.f64 #s(literal 1/2 binary64) x)
accuracy	29.196038362988357	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))

Samples

18.0ms

256×

valid

Compiler

Compiled 38 to 12 computations (68.4% saved)

Precisions

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

ival-mult: 4.0ms (42.9% of total)

ival-add: 3.0ms (32.2% of total)

ival-div: 2.0ms (21.4% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

series3.0ms (0.1%)

Memory

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

Counts

7 → 23

Calls

Call 1

Inputs
#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))
(*.f64 #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)
#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 (* (+ 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 (/ (+ 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) (/ (+ x y) 2) (* 1/2 y) (/ (+ x y) 2) (* (+ y x) 1/2) (+ y x))
1.0ms	x	@	inf	((/ (+ x y) 2) (* 1/2 x) (/ (+ x y) 2) (* 1/2 y) (/ (+ x y) 2) (* (+ y x) 1/2) (+ y x))
0.0ms	y	@	-inf	((/ (+ x y) 2) (* 1/2 x) (/ (+ x y) 2) (* 1/2 y) (/ (+ x y) 2) (* (+ y x) 1/2) (+ y x))
0.0ms	x	@	0	((/ (+ x y) 2) (* 1/2 x) (/ (+ x y) 2) (* 1/2 y) (/ (+ x y) 2) (* (+ y x) 1/2) (+ y x))
0.0ms	y	@	inf	((/ (+ x y) 2) (* 1/2 x) (/ (+ x y) 2) (* 1/2 y) (/ (+ x y) 2) (* (+ y x) 1/2) (+ y x))

simplify130.0ms (5%)

Memory

-0.9MiB live, 97.1MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	65	205
1	148	205
2	293	205
3	777	205
4	3208	205
5	7112	205
0	8156	205

Stop Event

1×	iter limit
1×	node limit

Counts

23 → 23

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 (* (+ 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 (/ (+ 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 (* (+ 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 (/ (+ 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))

rewrite51.0ms (2%)

Memory

13.8MiB live, 57.9MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

7 → 37

Calls

Call 1

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

eval4.0ms (0.2%)

Memory: 15.5MiB live, 15.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 743 to 140 computations (81.2% saved)

prune6.0ms (0.2%)

Memory

-30.7MiB live, 13.5MiB allocated; 4ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	45	0	45
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	45	3	48

Accuracy

100.0%

Counts

48 → 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)))
✓	47.9%	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) y))
✓	54.4%	#s(approx (/ (+ x y) 2) (*.f64 #s(literal 1/2 binary64) x))

Compiler

Compiled 63 to 41 computations (34.9% saved)

regimes8.0ms (0.3%)

Memory

25.4MiB live, 25.4MiB 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.2%)

Memory

20.0MiB live, 20.0MiB 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
98.6%	2	`(+.f64 x y)`
98.6%	2	`(/.f64 (+.f64 x y) #s(literal 2 binary64))`
84.6%	2	`x`
84.3%	2	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes28.0ms (1.1%)

Memory

-39.0MiB live, 59.3MiB allocated; 14ms 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:

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

Results

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

Compiler

Compiled 10 to 12 computations (-20% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-1.2648342303630795e-251	3.912752994983455e-268

Compiler

Compiled 8 to 10 computations (-25% saved)

simplify44.0ms (1.7%)

Memory

17.6MiB live, 60.0MiB allocated; 6ms 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 -5159126280621731/515912628062173092140956821207535748553561841832149923953086629908861232965551620580485601452790222553392963860602664725471042538576841344971229471155214430574596371092778402508526872730885196340843977449424988675925808879640197010584371971452184059071815020407947264 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 -5159126280621731/515912628062173092140956821207535748553561841832149923953086629908861232965551620580485601452790222553392963860602664725471042538576841344971229471155214430574596371092778402508526872730885196340843977449424988675925808879640197010584371971452184059071815020407947264 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))

derivations215.0ms (8.3%)

Memory

-27.7MiB live, 121.5MiB allocated; 14ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 46 to 19 computations (58.7% saved)

preprocess16.0ms (0.6%)

Memory: 31.4MiB live, 31.4MiB allocated; 0ms 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%)

sample962.0ms (37.3%)

explain127.0ms (4.9%)

preprocess286.0ms (11.1%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify186.0ms (7.2%)

localize17.0ms (0.7%)

series3.0ms (0.1%)

simplify116.0ms (4.5%)

rewrite97.0ms (3.8%)

eval3.0ms (0.1%)

prune1.0ms (0.1%)

simplify241.0ms (9.3%)

localize31.0ms (1.2%)

series3.0ms (0.1%)

simplify130.0ms (5%)

rewrite51.0ms (2%)

eval4.0ms (0.2%)

prune6.0ms (0.2%)

regimes8.0ms (0.3%)

regimes5.0ms (0.2%)

regimes28.0ms (1.1%)

bsearch0.0ms (0%)

simplify44.0ms (1.7%)

derivations215.0ms (8.3%)

preprocess16.0ms (0.6%)

end0.0ms (0%)

Profiling