Metrics for sqrt D (should all be same)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 8 to 7 computations (12.5% saved)

sample728.0ms (56.4%)

Memory

30.0MiB live, 728.3MiB allocated; 123ms collecting garbage

Samples

550.0ms

8 256×

valid

Precisions

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

ival-pow2: 151.0ms (41.2% of total)

ival-sqrt: 109.0ms (29.8% of total)

ival-mult!: 105.0ms (28.7% of total)

adjust: 1.0ms (0.3% of total)

Bogosity

explain62.0ms (4.8%)

Memory

-18.4MiB live, 126.8MiB allocated; 14ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
124	-	5	(4.974546383886052e-157)	`(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))`
0	-	0	-	`(pow.f64 x #s(literal 2 binary64))`
0	-	0	-	`#s(literal 2 binary64)`
0	-	0	-	`(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))`
0	-	0	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`sqrt.f64`	`(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))`	uflow-rescue	62	0
↳	`(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))`	underflow	62
↳	`(pow.f64 x #s(literal 2 binary64))`	underflow	62
`sqrt.f64`	`(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))`	oflow-rescue	57	0
↳	`(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))`	overflow	58
↳	`(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))`	overflow	1
↳	`(pow.f64 x #s(literal 2 binary64))`	overflow	58

Confusion

	Predicted +	Predicted -
+	119	5
-	0	132

Precision

1.0

Recall

0.9596774193548387

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	119	0	5
-	0	0	132

Precision?

1.0

Recall?

0.9596774193548387

Freqs

test

number	freq
0	137
1	119

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Samples

23.0ms

512×

valid

Compiler

Compiled 42 to 19 computations (54.8% saved)

Precisions

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

ival-pow2: 7.0ms (55.9% of total)

ival-sqrt: 3.0ms (24% of total)

ival-mult!: 2.0ms (16% of total)

adjust: 0.0ms (0% of total)

preprocess244.0ms (18.9%)

Memory

-9.6MiB live, 223.3MiB allocated; 26ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	20
1	18	19
2	55	19
3	167	19
4	408	19
5	1304	19
6	5101	19
0	5	6
0	8	6
1	13	6
2	34	6
3	106	6
4	358	6
5	1096	6
6	4530	6
0	8083	3

Stop Event

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

Calls

Call 1

Inputs
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))

Outputs
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))
(hypot.f64 x x)

Symmetry

(abs x)

Compiler

Compiled 6 to 5 computations (16.7% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	56.0%	(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))

Compiler

Compiled 6 to 5 computations (16.7% saved)

series4.0ms (0.3%)

Memory

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

Counts

5 → 5

Calls

Call 1

Inputs
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))
(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))
#s(literal 2 binary64)
(pow.f64 x #s(literal 2 binary64))
x

Outputs
#s(approx (sqrt (* 2 (pow x 2))) #s(hole binary64 (* x (sqrt 2))))
#s(approx (* 2 (pow x 2)) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (pow x 2) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (sqrt (* 2 (pow x 2))) #s(hole binary64 (* -1 (* x (sqrt 2)))))

Calls

3 calls:

Time	Variable		Point	Expression
2.0ms	x	@	inf	((sqrt (* 2 (pow x 2))) (* 2 (pow x 2)) 2 (pow x 2) x)
1.0ms	x	@	0	((sqrt (* 2 (pow x 2))) (* 2 (pow x 2)) 2 (pow x 2) x)
1.0ms	x	@	-inf	((sqrt (* 2 (pow x 2))) (* 2 (pow x 2)) 2 (pow x 2) x)

rewrite52.0ms (4.1%)

Memory

-7.4MiB live, 92.1MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	61
0	21	60
1	42	54
0	138	49

Stop Event

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

Counts

10 → 46

Calls

Call 1

Inputs
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))
(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))
#s(literal 2 binary64)
(pow.f64 x #s(literal 2 binary64))
x
#s(approx (sqrt (* 2 (pow x 2))) #s(hole binary64 (* x (sqrt 2))))
#s(approx (* 2 (pow x 2)) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (pow x 2) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (sqrt (* 2 (pow x 2))) #s(hole binary64 (* -1 (* x (sqrt 2)))))

Outputs
(.f64 (pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1/4 binary64)) (pow.f64 (.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1/4 binary64)))
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
(*.f64 x (sqrt.f64 #s(literal 2 binary64)))
(pow.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1/2 binary64))
(sqrt.f64 (.f64 (.f64 x x) #s(literal 2 binary64)))
(hypot.f64 (neg.f64 x) (neg.f64 x))
(hypot.f64 (neg.f64 x) (exp.f64 (log.f64 x)))
(hypot.f64 (neg.f64 x) x)
(hypot.f64 (exp.f64 (log.f64 x)) (neg.f64 x))
(hypot.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(hypot.f64 (exp.f64 (log.f64 x)) x)
(hypot.f64 x (neg.f64 x))
(hypot.f64 x (exp.f64 (log.f64 x)))
(hypot.f64 x x)
(exp.f64 (.f64 (log.f64 (.f64 (*.f64 x x) #s(literal 2 binary64))) #s(literal 1/2 binary64)))
(.f64 (.f64 #s(literal 2 binary64) x) x)
(.f64 (.f64 x x) #s(literal 2 binary64))
(.f64 x (.f64 x #s(literal 2 binary64)))
(*.f64 x (+.f64 x x))
(.f64 #s(literal 2 binary64) (.f64 x x))
(/.f64 (-.f64 (.f64 (.f64 x x) (.f64 x x)) (.f64 (.f64 x x) (.f64 x x))) (-.f64 (.f64 x x) (.f64 x x)))
(/.f64 (+.f64 (pow.f64 (.f64 x x) #s(literal 3 binary64)) (pow.f64 (.f64 x x) #s(literal 3 binary64))) (fma.f64 (.f64 x x) (.f64 x x) (-.f64 (.f64 (.f64 x x) (.f64 x x)) (.f64 (.f64 x x) (.f64 x x)))))
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 x x))
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) (*.f64 x x))
(fma.f64 #s(literal 1 binary64) (.f64 x x) (.f64 #s(literal 1 binary64) (*.f64 x x)))
(fma.f64 (.f64 x x) #s(literal 1 binary64) (.f64 (*.f64 x x) #s(literal 1 binary64)))
(fma.f64 x x (*.f64 x x))
(-.f64 (.f64 x x) (.f64 (neg.f64 x) x))
(+.f64 (.f64 #s(literal 1 binary64) (.f64 x x)) (.f64 #s(literal 1 binary64) (.f64 x x)))
(+.f64 (.f64 (.f64 x x) #s(literal 1 binary64)) (.f64 (.f64 x x) #s(literal 1 binary64)))
(+.f64 (.f64 x x) (.f64 x x))
#s(literal 2 binary64)
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(*.f64 x x)
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 x #s(literal 2 binary64))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(+.f64 (cosh.f64 (.f64 (log.f64 x) #s(literal 2 binary64))) (sinh.f64 (.f64 (log.f64 x) #s(literal 2 binary64))))
x
#s(approx (sqrt (* 2 (pow x 2))) (hypot.f64 x x))
#s(approx (* 2 (pow x 2)) (.f64 (.f64 x x) #s(literal 2 binary64)))
#s(approx (pow x 2) (*.f64 x x))
#s(approx x x)
#s(approx (sqrt (* 2 (pow x 2))) (neg.f64 (hypot.f64 x x)))

eval5.0ms (0.4%)

Memory: 10.4MiB live, 10.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 406 to 112 computations (72.4% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	44	3	47
Fresh	0	0	0
Picked	1	0	1
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%	(hypot.f64 x x)
▶	99.4%	(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
▶	56.0%	(sqrt.f64 (*.f64 x (+.f64 x x)))

Compiler

Compiled 13 to 10 computations (23.1% saved)

series3.0ms (0.3%)

Memory

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

Counts

8 → 8

Calls

Call 1

Inputs
(sqrt.f64 (*.f64 x (+.f64 x x)))
(*.f64 x (+.f64 x x))
x
(+.f64 x x)
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
(sqrt.f64 #s(literal 2 binary64))
#s(literal 2 binary64)
(hypot.f64 x x)

Outputs
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* x (sqrt 2))))
#s(approx (* x (+ x x)) #s(hole binary64 (* 2 (pow x 2))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (* (sqrt 2) x) #s(hole binary64 (* x (sqrt 2))))
#s(approx (sqrt (+ (* x x) (* x x))) #s(hole binary64 (* x (sqrt 2))))
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* -1 (* x (sqrt 2)))))
#s(approx (sqrt (+ (* x x) (* x x))) #s(hole binary64 (* -1 (* x (sqrt 2)))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((sqrt (* x (+ x x))) (* x (+ x x)) x (+ x x) (* (sqrt 2) x) (sqrt 2) 2 (sqrt (+ (* x x) (* x x))))
1.0ms	x	@	inf	((sqrt (* x (+ x x))) (* x (+ x x)) x (+ x x) (* (sqrt 2) x) (sqrt 2) 2 (sqrt (+ (* x x) (* x x))))
1.0ms	x	@	0	((sqrt (* x (+ x x))) (* x (+ x x)) x (+ x x) (* (sqrt 2) x) (sqrt 2) 2 (sqrt (+ (* x x) (* x x))))

Time

Variable

Point

Expression

1.0ms

-inf

((sqrt (* x (+ x x))) (* x (+ x x)) x (+ x x) (* (sqrt 2) x) (sqrt 2) 2 (sqrt (+ (* x x) (* x x))))

1.0ms

inf

((sqrt (* x (+ x x))) (* x (+ x x)) x (+ x x) (* (sqrt 2) x) (sqrt 2) 2 (sqrt (+ (* x x) (* x x))))

1.0ms

((sqrt (* x (+ x x))) (* x (+ x x)) x (+ x x) (* (sqrt 2) x) (sqrt 2) 2 (sqrt (+ (* x x) (* x x))))

rewrite65.0ms (5%)

Memory

-22.2MiB live, 72.4MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	30	97
0	35	91
1	82	62
0	437	62

Stop Event

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

Counts

16 → 56

Calls

Call 1

Inputs
(sqrt.f64 (*.f64 x (+.f64 x x)))
(*.f64 x (+.f64 x x))
x
(+.f64 x x)
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
(sqrt.f64 #s(literal 2 binary64))
#s(literal 2 binary64)
(hypot.f64 x x)
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* x (sqrt 2))))
#s(approx (* x (+ x x)) #s(hole binary64 (* 2 (pow x 2))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (* (sqrt 2) x) #s(hole binary64 (* x (sqrt 2))))
#s(approx (sqrt (+ (* x x) (* x x))) #s(hole binary64 (* x (sqrt 2))))
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* -1 (* x (sqrt 2)))))
#s(approx (sqrt (+ (* x x) (* x x))) #s(hole binary64 (* -1 (* x (sqrt 2)))))

Outputs
(*.f64 (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64)) (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64)))
(.f64 (pow.f64 (.f64 x x) #s(literal 1/2 binary64)) (sqrt.f64 #s(literal 2 binary64)))
(*.f64 (sqrt.f64 x) (sqrt.f64 #s(literal 2 binary64)))
(*.f64 (fabs.f64 x) (sqrt.f64 #s(literal 2 binary64)))
(.f64 (sqrt.f64 #s(literal 2 binary64)) (pow.f64 (.f64 x x) #s(literal 1/2 binary64)))
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (sqrt.f64 x))
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (fabs.f64 x))
(pow.f64 #s(literal 2 binary64) #s(literal 1/2 binary64))
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (sqrt.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (sqrt.f64 #s(literal 0 binary64)) (sqrt.f64 #s(literal 0 binary64)))
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 6 binary64)))) (sqrt.f64 (+.f64 #s(literal 0 binary64) (pow.f64 x #s(literal 4 binary64)))))
(sqrt.f64 #s(literal 2 binary64))
(hypot.f64 x x)
(exp.f64 (*.f64 (log.f64 #s(literal 2 binary64)) #s(literal 1/2 binary64)))
#s(literal 2 binary64)
x
#s(literal 2 binary64)
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
(*.f64 x (sqrt.f64 #s(literal 2 binary64)))
(*.f64 (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64)) (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64)))
(.f64 (pow.f64 (.f64 x x) #s(literal 1/2 binary64)) (sqrt.f64 #s(literal 2 binary64)))
(*.f64 (sqrt.f64 x) (sqrt.f64 #s(literal 2 binary64)))
(*.f64 (fabs.f64 x) (sqrt.f64 #s(literal 2 binary64)))
(.f64 (sqrt.f64 #s(literal 2 binary64)) (pow.f64 (.f64 x x) #s(literal 1/2 binary64)))
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (sqrt.f64 x))
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (fabs.f64 x))
(pow.f64 #s(literal 2 binary64) #s(literal 1/2 binary64))
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (sqrt.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (sqrt.f64 #s(literal 0 binary64)) (sqrt.f64 #s(literal 0 binary64)))
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 6 binary64)))) (sqrt.f64 (+.f64 #s(literal 0 binary64) (pow.f64 x #s(literal 4 binary64)))))
(sqrt.f64 #s(literal 2 binary64))
(hypot.f64 x x)
(exp.f64 (*.f64 (log.f64 #s(literal 2 binary64)) #s(literal 1/2 binary64)))
#s(literal 2 binary64)
(*.f64 (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64)) (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64)))
(.f64 (pow.f64 (.f64 x x) #s(literal 1/2 binary64)) (sqrt.f64 #s(literal 2 binary64)))
(*.f64 (sqrt.f64 x) (sqrt.f64 #s(literal 2 binary64)))
(*.f64 (fabs.f64 x) (sqrt.f64 #s(literal 2 binary64)))
(.f64 (sqrt.f64 #s(literal 2 binary64)) (pow.f64 (.f64 x x) #s(literal 1/2 binary64)))
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (sqrt.f64 x))
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (fabs.f64 x))
(pow.f64 #s(literal 2 binary64) #s(literal 1/2 binary64))
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (sqrt.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (sqrt.f64 #s(literal 0 binary64)) (sqrt.f64 #s(literal 0 binary64)))
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 6 binary64)))) (sqrt.f64 (+.f64 #s(literal 0 binary64) (pow.f64 x #s(literal 4 binary64)))))
(sqrt.f64 #s(literal 2 binary64))
(hypot.f64 x x)
(exp.f64 (*.f64 (log.f64 #s(literal 2 binary64)) #s(literal 1/2 binary64)))
#s(approx (sqrt (* x (+ x x))) (*.f64 (sqrt.f64 #s(literal 2 binary64)) x))
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(approx x x)
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(approx (* (sqrt 2) x) (*.f64 (sqrt.f64 #s(literal 2 binary64)) x))
#s(approx (sqrt (* x (+ x x))) (*.f64 (sqrt.f64 #s(literal 2 binary64)) x))
#s(approx (sqrt (* x (+ x x))) (*.f64 (neg.f64 x) (sqrt.f64 #s(literal 2 binary64))))
#s(approx (sqrt (* x (+ x x))) (*.f64 (neg.f64 x) (sqrt.f64 #s(literal 2 binary64))))

eval3.0ms (0.2%)

Memory: 10.0MiB live, 10.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 204 to 71 computations (65.2% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	32	1	33
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	32	4	36

Accuracy

100.0%

Counts

36 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(hypot.f64 x x)
✓	99.4%	(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
✓	56.0%	(sqrt.f64 (*.f64 x (+.f64 x x)))
▶	5.4%	(sqrt.f64 #s(approx (* x (+ x x)) #s(literal 2 binary64)))

Compiler

Compiled 21 to 16 computations (23.8% saved)

series2.0ms (0.1%)

Memory

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

Counts

3 → 3

Calls

Call 1

Inputs
(sqrt.f64 #s(approx (* x (+ x x)) #s(literal 2 binary64)))
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(literal 2 binary64)

Outputs
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* x (sqrt 2))))
#s(approx (* x (+ x x)) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* -1 (* x (sqrt 2)))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((sqrt (* x (+ x x))) (* x (+ x x)) 2)
1.0ms	x	@	-inf	((sqrt (* x (+ x x))) (* x (+ x x)) 2)
1.0ms	x	@	0	((sqrt (* x (+ x x))) (* x (+ x x)) 2)

rewrite46.0ms (3.6%)

Memory

8.5MiB live, 62.4MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	16	51
0	17	46
1	51	26
0	235	26

Stop Event

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

Counts

6 → 9

Calls

Call 1

Inputs
(sqrt.f64 #s(approx (* x (+ x x)) #s(literal 2 binary64)))
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* x (sqrt 2))))
#s(approx (* x (+ x x)) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* -1 (* x (sqrt 2)))))

Outputs
(.f64 (pow.f64 #s(approx ( x (+ x x)) #s(literal 2 binary64)) #s(literal 1/4 binary64)) (pow.f64 #s(approx (* x (+ x x)) #s(literal 2 binary64)) #s(literal 1/4 binary64)))
(pow.f64 #s(approx (* x (+ x x)) #s(literal 2 binary64)) #s(literal 1/2 binary64))
(sqrt.f64 #s(approx (* x (+ x x)) #s(literal 2 binary64)))
(exp.f64 (.f64 (log.f64 #s(approx ( x (+ x x)) #s(literal 2 binary64))) #s(literal 1/2 binary64)))
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (sqrt (* x (+ x x))) (*.f64 (sqrt.f64 #s(literal 2 binary64)) x))
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(approx (sqrt (* x (+ x x))) (*.f64 (neg.f64 x) (sqrt.f64 #s(literal 2 binary64))))

eval1.0ms (0.1%)

Memory: 3.5MiB live, 3.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 86 to 21 computations (75.6% saved)

prune7.0ms (0.6%)

Memory

-32.7MiB live, 12.1MiB allocated; 5ms collecting garbage

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	8	0	8
Fresh	0	0	0
Picked	0	1	1
Done	0	3	3
Total	8	4	12

Accuracy

100.0%

Counts

12 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(hypot.f64 x x)
✓	99.4%	(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
✓	56.0%	(sqrt.f64 (*.f64 x (+.f64 x x)))
✓	5.4%	(sqrt.f64 #s(approx (* x (+ x x)) #s(literal 2 binary64)))

Compiler

Compiled 48 to 31 computations (35.4% saved)

regimes8.0ms (0.6%)

Memory

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

Counts

5 → 1

Calls

Call 1

Inputs
(sqrt.f64 #s(approx (* x (+ x x)) #s(literal 2 binary64)))
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
(sqrt.f64 (*.f64 x (+.f64 x x)))
(hypot.f64 x x)
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))

Outputs
(hypot.f64 x x)

Calls

4 calls:

2.0ms	x
2.0ms	(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))
2.0ms	(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))
2.0ms	(pow.f64 x #s(literal 2 binary64))

Results

Accuracy	Segments	Branch
100.0%	1	`(pow.f64 x #s(literal 2 binary64))`
100.0%	1	`(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))`
100.0%	1	`(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))`
100.0%	1	`x`

Compiler

Compiled 15 to 13 computations (13.3% saved)

regimes24.0ms (1.8%)

Memory

-23.1MiB live, 19.6MiB allocated; 12ms collecting garbage

Counts

3 → 1

Calls

Call 1

Inputs
(sqrt.f64 #s(approx (* x (+ x x)) #s(literal 2 binary64)))
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
(sqrt.f64 (*.f64 x (+.f64 x x)))

Outputs
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)

Calls

4 calls:

19.0ms	(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))
2.0ms	x
1.0ms	(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))
1.0ms	(pow.f64 x #s(literal 2 binary64))

Results

Accuracy	Segments	Branch
99.4%	1	`(pow.f64 x #s(literal 2 binary64))`
99.4%	1	`(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))`
99.4%	1	`(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))`
99.4%	1	`x`

Compiler

Compiled 15 to 13 computations (13.3% saved)

regimes4.0ms (0.3%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
(sqrt.f64 #s(approx (* x (+ x x)) #s(literal 2 binary64)))

Outputs
(sqrt.f64 #s(approx (* x (+ x x)) #s(literal 2 binary64)))

Calls

4 calls:

1.0ms	x
1.0ms	(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))
1.0ms	(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))
1.0ms	(pow.f64 x #s(literal 2 binary64))

Results

Accuracy	Segments	Branch
5.4%	1	`(pow.f64 x #s(literal 2 binary64))`
5.4%	1	`(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))`
5.4%	1	`(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))`
5.4%	1	`x`

Compiler

Compiled 15 to 13 computations (13.3% saved)

derivations6.0ms (0.5%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 15 to 9 computations (40% saved)

preprocess22.0ms (1.7%)

Memory: -14.7MiB live, 28.5MiB allocated; 9ms collecting garbage
Remove: (abs x)
Compiler: Compiled 72 to 52 computations (27.8% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample728.0ms (56.4%)

explain62.0ms (4.8%)

preprocess244.0ms (18.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.3%)

rewrite52.0ms (4.1%)

eval5.0ms (0.4%)

prune2.0ms (0.2%)

series3.0ms (0.3%)

rewrite65.0ms (5%)

eval3.0ms (0.2%)

prune2.0ms (0.2%)

series2.0ms (0.1%)

rewrite46.0ms (3.6%)

eval1.0ms (0.1%)

prune7.0ms (0.6%)

regimes8.0ms (0.6%)

regimes24.0ms (1.8%)

regimes4.0ms (0.3%)

derivations6.0ms (0.5%)

preprocess22.0ms (1.7%)

end0.0ms (0%)

Profiling