Metrics for sqrt D (should all be same)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample1.1s (64.5%)

Memory

-4.8MiB live, 1 025.1MiB allocated; 1.0s collecting garbage

Samples

557.0ms

8 256×

valid

Precisions

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

ival-pow2: 208.0ms (61.1% of total)

ival-mult: 61.0ms (17.9% of total)

ival-sqrt: 60.0ms (17.6% of total)

exact: 6.0ms (1.8% of total)

adjust: 3.0ms (0.9% of total)

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

Bogosity

explain86.0ms (5.1%)

Memory

-11.4MiB live, 92.0MiB allocated; 41ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
129	-	3	(-1.0351157896225813e-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	64	0
↳	`(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))`	underflow	64
↳	`(pow.f64 x #s(literal 2 binary64))`	underflow	64
`sqrt.f64`	`(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))))`	oflow-rescue	62	0
↳	`(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))`	overflow	62
↳	`(pow.f64 x #s(literal 2 binary64))`	overflow	62

Confusion

	Predicted +	Predicted -
+	126	3
-	0	127

Precision

1.0

Recall

0.9767441860465116

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	126	0	3
-	0	0	127

Precision?

1.0

Recall?

0.9767441860465116

Freqs

test

number	freq
0	130
1	126

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

28.0ms

512×

valid

Compiler

Compiled 42 to 19 computations (54.8% saved)

Precisions

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

ival-pow2: 6.0ms (44% of total)

ival-mult: 3.0ms (22% of total)

ival-sqrt: 3.0ms (22% 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)

preprocess233.0ms (14%)

Memory

2.9MiB live, 238.1MiB allocated; 16ms 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.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 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
▶	53.8%	(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.2%)

Memory

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

rewrite34.0ms (2%)

Memory

-6.7MiB live, 39.9MiB allocated; 3ms 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.3%)

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

prune2.0ms (0.1%)

Memory

4.2MiB live, 4.2MiB 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.3%	(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
▶	53.8%	(sqrt.f64 (*.f64 x (+.f64 x x)))

Compiler

Compiled 13 to 10 computations (23.1% saved)

series3.0ms (0.2%)

Memory

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

rewrite81.0ms (4.9%)

Memory

-2.0MiB live, 48.9MiB allocated; 10ms 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: 4.7MiB live, 4.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 204 to 71 computations (65.2% saved)

prune10.0ms (0.6%)

Memory

-37.1MiB live, 7.0MiB allocated; 7ms 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.3%	(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
✓	53.8%	(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

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

rewrite38.0ms (2.3%)

Memory

6.2MiB live, 53.1MiB allocated; 3ms 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: 1.7MiB live, 1.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 86 to 21 computations (75.6% saved)

prune2.0ms (0.1%)

Memory

4.1MiB live, 4.1MiB allocated; 0ms 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.3%	(*.f64 (sqrt.f64 #s(literal 2 binary64)) x)
✓	53.8%	(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.5%)

Memory

18.5MiB live, 18.5MiB 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	(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))
2.0ms	(sqrt.f64 (*.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)

regimes7.0ms (0.4%)

Memory

-37.7MiB live, 9.4MiB allocated; 1ms 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:

2.0ms	(pow.f64 x #s(literal 2 binary64))
2.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)))

Results

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

Compiler

Compiled 15 to 13 computations (13.3% saved)

regimes5.0ms (0.3%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
(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:

2.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)

simplify40.0ms (2.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	15
1	15	15
2	27	15
3	74	15
4	223	15
5	1240	15
6	4621	15

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations5.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 15 to 9 computations (40% saved)

preprocess22.0ms (1.3%)

Memory: -29.1MiB live, 22.3MiB allocated; 5ms collecting garbage
Remove: (abs x)
Compiler: Compiled 48 to 32 computations (33.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.1s (64.5%)

explain86.0ms (5.1%)

preprocess233.0ms (14%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.2%)

rewrite34.0ms (2%)

eval5.0ms (0.3%)

prune2.0ms (0.1%)

series3.0ms (0.2%)

rewrite81.0ms (4.9%)

eval3.0ms (0.2%)

prune10.0ms (0.6%)

series2.0ms (0.1%)

rewrite38.0ms (2.3%)

eval1.0ms (0.1%)

prune2.0ms (0.1%)

regimes8.0ms (0.5%)

regimes7.0ms (0.4%)

regimes5.0ms (0.3%)

simplify40.0ms (2.4%)

derivations5.0ms (0.3%)

preprocess22.0ms (1.3%)

end0.0ms (0%)

Profiling