Metrics for sqrt B (should all be same)

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB 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
0%	0%	100%	0%	0%	0%	0%	1
100%	100%	0%	0%	0%	0%	0%	2

Compiler

Compiled 8 to 7 computations (12.5% saved)

sample571.0ms (55.2%)

Memory

33.5MiB live, 596.9MiB allocated; 81ms collecting garbage

Samples

344.0ms

8 256×

valid

Precisions

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

ival-mult: 113.0ms (63.3% of total)

ival-sqrt: 54.0ms (30.2% of total)

exact: 6.0ms (3.4% of total)

adjust: 3.0ms (1.7% of total)

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

Bogosity

explain59.0ms (5.7%)

Memory

17.9MiB live, 64.5MiB allocated; 4ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
123	-	2	(9.816483101969648e-157)	`(sqrt.f64 (.f64 (.f64 #s(literal 2 binary64) x) x))`
0	-	0	-	`#s(literal 2 binary64)`
0	-	0	-	`(.f64 (.f64 #s(literal 2 binary64) x) x)`
0	-	0	-	`(*.f64 #s(literal 2 binary64) x)`
0	-	0	-	`x`

Explanations

Click to see full explanations table

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

Confusion

	Predicted +	Predicted -
+	121	2
-	0	133

Precision

1.0

Recall

0.983739837398374

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	121	0	2
-	0	0	133

Precision?

1.0

Recall?

0.983739837398374

Freqs

test

number	freq
0	135
1	121

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: 11.0ms

ival-mult: 7.0ms (61.7% of total)

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

preprocess206.0ms (19.9%)

Memory

-34.7MiB live, 110.9MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	21
1	25	19
2	62	19
3	196	19
4	333	19
5	1011	19
6	4908	19
0	5	6
0	8	6
1	15	6
2	28	6
3	90	6
4	232	6
5	818	6
6	4263	6
0	8038	3

Stop Event

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

Calls

Call 1

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

Outputs
(sqrt.f64 (.f64 (.f64 #s(literal 2 binary64) x) x))
(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.5MiB live, 0.5MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

series4.0ms (0.4%)

Memory

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

Counts

5 → 5

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite35.0ms (3.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	61
0	22	60
1	48	60
0	150	51

Stop Event

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

Counts

10 → 58

Calls

Call 1

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

Outputs
(.f64 (pow.f64 (.f64 (.f64 x #s(literal 2 binary64)) x) #s(literal 1/4 binary64)) (pow.f64 (.f64 (*.f64 x #s(literal 2 binary64)) x) #s(literal 1/4 binary64)))
(.f64 (sqrt.f64 (.f64 x x)) (sqrt.f64 #s(literal 2 binary64)))
(.f64 (sqrt.f64 (.f64 x #s(literal 2 binary64))) (sqrt.f64 x))
(.f64 (sqrt.f64 x) (sqrt.f64 (.f64 x #s(literal 2 binary64))))
(.f64 (pow.f64 (.f64 x x) #s(literal 1/2 binary64)) (sqrt.f64 #s(literal 2 binary64)))
(.f64 (sqrt.f64 #s(literal 2 binary64)) (sqrt.f64 (.f64 x x)))
(.f64 (sqrt.f64 #s(literal 2 binary64)) (pow.f64 (.f64 x x) #s(literal 1/2 binary64)))
(pow.f64 (.f64 (.f64 x #s(literal 2 binary64)) x) #s(literal 1/2 binary64))
(sqrt.f64 (.f64 (.f64 x #s(literal 2 binary64)) x))
(hypot.f64 (neg.f64 x) (neg.f64 x))
(hypot.f64 (neg.f64 x) (fabs.f64 x))
(hypot.f64 (neg.f64 x) (exp.f64 (log.f64 x)))
(hypot.f64 (neg.f64 x) x)
(hypot.f64 (fabs.f64 x) (neg.f64 x))
(hypot.f64 (fabs.f64 x) (fabs.f64 x))
(hypot.f64 (fabs.f64 x) (exp.f64 (log.f64 x)))
(hypot.f64 (fabs.f64 x) x)
(hypot.f64 (exp.f64 (log.f64 x)) (neg.f64 x))
(hypot.f64 (exp.f64 (log.f64 x)) (fabs.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 (fabs.f64 x))
(hypot.f64 x (exp.f64 (log.f64 x)))
(hypot.f64 x x)
(exp.f64 (.f64 (log.f64 (.f64 (*.f64 x #s(literal 2 binary64)) x)) #s(literal 1/2 binary64)))
(.f64 (.f64 x x) #s(literal 2 binary64))
(.f64 (.f64 x #s(literal 2 binary64)) x)
(.f64 x (.f64 x #s(literal 2 binary64)))
(.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 (fabs.f64 x) (fabs.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))
(*.f64 x #s(literal 2 binary64))
(*.f64 #s(literal 2 binary64) x)
(/.f64 (-.f64 (.f64 x x) (.f64 x x)) (-.f64 x x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 x x) (.f64 x x))))
(fma.f64 #s(literal 1 binary64) x (*.f64 #s(literal 1 binary64) x))
(fma.f64 x #s(literal 1 binary64) (*.f64 x #s(literal 1 binary64)))
(+.f64 (.f64 #s(literal 1 binary64) x) (.f64 #s(literal 1 binary64) x))
(+.f64 (.f64 x #s(literal 1 binary64)) (.f64 x #s(literal 1 binary64)))
(+.f64 x x)
#s(literal 2 binary64)
x
#s(approx (sqrt (* (* 2 x) x)) (*.f64 (sqrt.f64 #s(literal 2 binary64)) x))
#s(approx (* (* 2 x) x) (.f64 (.f64 x #s(literal 2 binary64)) x))
#s(approx (* 2 x) (*.f64 x #s(literal 2 binary64)))
#s(approx x x)
#s(approx (sqrt (* (* 2 x) x)) (*.f64 (neg.f64 x) (sqrt.f64 #s(literal 2 binary64))))

eval6.0ms (0.6%)

Memory: 7.5MiB live, 7.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 513 to 135 computations (73.7% saved)

prune16.0ms (1.5%)

Memory

-33.1MiB live, 13.3MiB allocated; 3ms collecting garbage

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	58	2	60
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	59	2	61

Accuracy

100.0%

Counts

61 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
	100.0%	(hypot.f64 (neg.f64 x) (neg.f64 x))
▶	99.5%	(.f64 (sqrt.f64 (.f64 x #s(literal 2 binary64))) (sqrt.f64 x))

Compiler

Compiled 12 to 9 computations (25% saved)

series5.0ms (0.4%)

Memory

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

Counts

6 → 8

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite20.0ms (1.9%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	34	99
0	39	82
0	88	82

Stop Event

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

Counts

14 → 23

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 3.0MiB live, 3.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 221 to 61 computations (72.4% saved)

prune4.0ms (0.3%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	25	0	25
Fresh	0	1	1
Picked	0	1	1
Done	0	0	0
Total	25	2	27

Accuracy

100.0%

Counts

27 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(hypot.f64 (neg.f64 x) (neg.f64 x))
✓	99.5%	(.f64 (sqrt.f64 (.f64 x #s(literal 2 binary64))) (sqrt.f64 x))

Compiler

Compiled 12 to 9 computations (25% saved)

series2.0ms (0.2%)

Memory

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

Counts

3 → 4

Calls

Call 1

Inputs
(hypot.f64 (neg.f64 x) (neg.f64 x))
(neg.f64 x)
x

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

Calls

3 calls:

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

rewrite57.0ms (5.5%)

Memory

-11.0MiB live, 36.2MiB allocated; 1ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	17	39
0	18	37
1	54	28
0	413	28

Stop Event

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

Counts

7 → 19

Calls

Call 1

Inputs
(hypot.f64 (neg.f64 x) (neg.f64 x))
(neg.f64 x)
x
#s(approx (sqrt (+ (* (neg x) (neg x)) (* (neg x) (neg x)))) #s(hole binary64 (* x (sqrt 2))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (sqrt (+ (* (neg x) (neg x)) (* (neg x) (neg 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 (sqrt.f64 (neg.f64 x)) (sqrt.f64 (.f64 x #s(literal -2 binary64))))
(.f64 (pow.f64 (neg.f64 x) #s(literal 1/2 binary64)) (pow.f64 (.f64 x #s(literal -2 binary64)) #s(literal 1/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)) (fabs.f64 x))
(pow.f64 #s(literal 2 binary64) #s(literal 1/2 binary64))
(/.f64 (sqrt.f64 #s(literal 0 binary64)) (sqrt.f64 #s(literal 0 binary64)))
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 (neg.f64 x) #s(literal 6 binary64)))) (sqrt.f64 (+.f64 #s(literal 0 binary64) (pow.f64 (neg.f64 x) #s(literal 4 binary64)))))
(sqrt.f64 #s(literal 2 binary64))
(hypot.f64 (neg.f64 x) (neg.f64 x))
(exp.f64 (*.f64 (log.f64 #s(literal 2 binary64)) #s(literal 1/2 binary64)))
(*.f64 #s(literal -1 binary64) x)
(*.f64 x #s(literal -1 binary64))
(neg.f64 x)
x
#s(approx (sqrt (+ (* (neg x) (neg x)) (* (neg x) (neg x)))) (*.f64 (sqrt.f64 #s(literal 2 binary64)) x))
#s(approx (neg x) (neg.f64 x))
#s(approx x x)
#s(approx (sqrt (+ (* (neg x) (neg x)) (* (neg x) (neg x)))) (*.f64 (sqrt.f64 #s(literal 2 binary64)) (neg.f64 x)))

eval2.0ms (0.2%)

Memory: 3.0MiB live, 3.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 182 to 60 computations (67% saved)

prune3.0ms (0.3%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	25	0	25
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	25	2	27

Accuracy

100.0%

Counts

27 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(hypot.f64 (neg.f64 x) (neg.f64 x))
✓	99.5%	(.f64 (sqrt.f64 (.f64 x #s(literal 2 binary64))) (sqrt.f64 x))

Compiler

Compiled 30 to 20 computations (33.3% saved)

regimes5.0ms (0.5%)

Memory

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

Accuracy

Total -28.6b remaining (-365616.6%)

Threshold costs -28.6b (-365616.6%)

Counts

3 → 1

Calls

Call 1

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

Outputs
(hypot.f64 (neg.f64 x) (neg.f64 x))

Calls

3 calls:

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

Results

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

Compiler

Compiled 12 to 10 computations (16.7% saved)

simplify25.0ms (2.4%)

Memory

-32.0MiB live, 16.6MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	5
1	8	5
2	9	5

Stop Event

1×

saturated

Calls

Call 1

Inputs
(hypot.f64 (neg.f64 x) (neg.f64 x))

Outputs
(hypot.f64 (neg.f64 x) (neg.f64 x))

derivations2.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 3 computations (40% saved)

preprocess10.0ms (1%)

Memory: 11.5MiB live, 11.5MiB allocated; 0ms collecting garbage
Remove: (abs x)
Compiler: Compiled 32 to 22 computations (31.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample571.0ms (55.2%)

explain59.0ms (5.7%)

preprocess206.0ms (19.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.4%)

rewrite35.0ms (3.3%)

eval6.0ms (0.6%)

prune16.0ms (1.5%)

series5.0ms (0.4%)

rewrite20.0ms (1.9%)

eval2.0ms (0.2%)

prune4.0ms (0.3%)

series2.0ms (0.2%)

rewrite57.0ms (5.5%)

eval2.0ms (0.2%)

prune3.0ms (0.3%)

regimes5.0ms (0.5%)

simplify25.0ms (2.4%)

derivations2.0ms (0.2%)

preprocess10.0ms (1%)

end0.0ms (0%)

Profiling