Metrics for Data.Random.Distribution.T:$ccdf from random-fu-0.2.6.2

start0.0ms (0%)

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

analyze10.0ms (1%)

Memory

24.0MiB live, 24.0MiB 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
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 9 to 7 computations (22.2% saved)

sample622.0ms (62.8%)

Memory

12.2MiB live, 913.6MiB allocated; 158ms collecting garbage

Samples

366.0ms

8 256×

valid

Precisions

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

ival-div!: 59.0ms (53.6% of total)

ival-add!: 50.0ms (45.4% of total)

adjust: 2.0ms (1.8% of total)

Bogosity

explain46.0ms (4.7%)

Memory

8.7MiB live, 103.0MiB allocated; 6ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(+.f64 y y)`
-	-	`(/.f64 (+.f64 x y) (+.f64 y y))`
-	-	`y`
-	-	`(+.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

18.0ms

512×

valid

Compiler

Compiled 41 to 19 computations (53.7% saved)

Precisions

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

ival-add!: 3.0ms (52.8% of total)

ival-div!: 3.0ms (52.8% of total)

adjust: 0.0ms (0% of total)

preprocess150.0ms (15.1%)

Memory

-25.8MiB live, 164.5MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	48
1	43	46
2	115	46
3	277	42
4	600	42
5	1442	42
6	4892	42
0	5	7
0	8	7
1	14	7
2	24	7
3	41	7
4	73	7
5	172	7
6	1251	7
7	7699	7
0	8015	7

Stop Event

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

Calls

Call 1

Inputs
(/.f64 (+.f64 x y) (+.f64 y y))

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

Compiler

Compiled 7 to 5 computations (28.6% 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.9MiB live, 0.9MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 (+.f64 x y) (+.f64 y y))

Compiler

Compiled 7 to 5 computations (28.6% saved)

series6.0ms (0.6%)

Memory

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

Counts

5 → 15

Calls

Call 1

Inputs
(/.f64 (+.f64 x y) (+.f64 y y))
(+.f64 x y)
x
y
(+.f64 y y)

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

rewrite34.0ms (3.5%)

Memory

10.8MiB live, 57.3MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	54	172
0	55	162
0	243	161

Stop Event

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

Counts

20 → 29

Calls

Call 1

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

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

eval3.0ms (0.3%)

Memory: 7.9MiB live, 7.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 372 to 100 computations (73.1% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

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

Accuracy

100.0%

Counts

34 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(/.f64 (+.f64 x y) (+.f64 y y))
▶	47.7%	(/.f64 #s(approx (+ x y) x) (+.f64 y y))
▶	100.0%	#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)))
▶	53.7%	#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Compiler

Compiled 39 to 27 computations (30.8% saved)

series20.0ms (2%)

Memory

-15.2MiB live, 35.5MiB allocated; 4ms collecting garbage

Counts

10 → 22

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite32.0ms (3.3%)

Memory

3.4MiB live, 50.5MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	67	306
0	71	284
0	293	284

Stop Event

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

Counts

32 → 47

Calls

Call 1

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

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

eval5.0ms (0.5%)

Memory: 11.4MiB live, 11.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 798 to 143 computations (82.1% saved)

prune6.0ms (0.6%)

Memory

-35.8MiB live, 11.1MiB allocated; 2ms collecting garbage

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	51	0	51
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	51	4	55

Accuracy

100.0%

Counts

55 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(/.f64 (+.f64 x y) (+.f64 y y))
✓	47.7%	(/.f64 #s(approx (+ x y) x) (+.f64 y y))
✓	100.0%	#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)))
✓	53.7%	#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Compiler

Compiled 78 to 42 computations (46.2% saved)

regimes5.0ms (0.5%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

Outputs
(/.f64 (+.f64 x y) (+.f64 y y))

Calls

3 calls:

2.0ms	y
2.0ms	x
1.0ms	(/.f64 (+.f64 x y) (+.f64 y y))

Results

Accuracy	Segments	Branch
100.0%	1	`(/.f64 (+.f64 x y) (+.f64 y y))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 9 to 9 computations (0% saved)

regimes5.0ms (0.5%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

Calls

3 calls:

2.0ms	y
1.0ms	x
1.0ms	(/.f64 (+.f64 x y) (+.f64 y y))

Results

Accuracy	Segments	Branch
100.0%	1	`(/.f64 (+.f64 x y) (+.f64 y y))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 9 to 9 computations (0% saved)

regimes5.0ms (0.5%)

Memory

-35.5MiB live, 11.9MiB allocated; 2ms collecting garbage

Counts

2 → 3

Calls

Call 1

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

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

Calls

3 calls:

1.0ms	y
1.0ms	x
1.0ms	(/.f64 (+.f64 x y) (+.f64 y y))

Results

Accuracy	Segments	Branch
97.8%	3	`(/.f64 (+.f64 x y) (+.f64 y y))`
77.7%	3	`x`
77.4%	3	`y`

Compiler

Compiled 9 to 9 computations (0% saved)

regimes3.0ms (0.3%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

3 calls:

1.0ms	(/.f64 (+.f64 x y) (+.f64 y y))
1.0ms	y
1.0ms	x

Results

Accuracy	Segments	Branch
53.7%	1	`y`
53.7%	1	`x`
53.7%	1	`(/.f64 (+.f64 x y) (+.f64 y y))`

Compiler

Compiled 9 to 9 computations (0% saved)

bsearch1.0ms (0.1%)

Memory

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

Algorithm

2×	left-value

Steps

Time	Left	Right
0.0ms	0.5122433397210396	2.1142020649529947
0.0ms	-0.12724709329557132	0.4999962340413716

Compiler

Compiled 10 to 10 computations (0% saved)

derivations3.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 77 to 21 computations (72.7% saved)

preprocess31.0ms (3.2%)

Memory: 16.0MiB live, 66.9MiB allocated; 13ms collecting garbage
Compiler: Compiled 182 to 64 computations (64.8% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze10.0ms (1%)

sample622.0ms (62.8%)

explain46.0ms (4.7%)

preprocess150.0ms (15.1%)

eval0.0ms (0%)

prune0.0ms (0%)

series6.0ms (0.6%)

rewrite34.0ms (3.5%)

eval3.0ms (0.3%)

prune2.0ms (0.2%)

series20.0ms (2%)

rewrite32.0ms (3.3%)

eval5.0ms (0.5%)

prune6.0ms (0.6%)

regimes5.0ms (0.5%)

regimes5.0ms (0.5%)

regimes5.0ms (0.5%)

regimes3.0ms (0.3%)

bsearch1.0ms (0.1%)

derivations3.0ms (0.3%)

preprocess31.0ms (3.2%)

end0.0ms (0%)

Profiling