Metrics for sqrt B (should all be same)

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%	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)

sample802.0ms (62.5%)

Memory

14.6MiB live, 611.6MiB allocated; 666ms collecting garbage

Samples

601.0ms

8 256×

valid

Precisions

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

ival-mult: 392.0ms (85% of total)

ival-sqrt: 57.0ms (12.4% of total)

exact: 6.0ms (1.3% of total)

adjust: 2.0ms (0.4% of total)

ival-assert: 2.0ms (0.4% of total)

Bogosity

explain55.0ms (4.3%)

Memory

25.8MiB live, 72.1MiB allocated; 4ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
136	-	5	(-6.832066115450261e-158)	`(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))`	oflow-rescue	69	0
↳	`(.f64 (.f64 #s(literal 2 binary64) x) x)`	overflow	69
`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

Confusion

	Predicted +	Predicted -
+	131	5
-	0	120

Precision

1.0

Recall

0.9632352941176471

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	131	0	5
-	0	0	120

Precision?

1.0

Recall?

0.9632352941176471

Freqs

test

number	freq
0	125
1	131

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

24.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 (63.6% of total)

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

preprocess229.0ms (17.8%)

Memory

-22.3MiB live, 125.6MiB allocated; 86ms 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.6MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

series4.0ms (0.3%)

Memory

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

rewrite37.0ms (2.9%)

Memory

-17.1MiB live, 28.5MiB allocated; 3ms 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.4%)

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

prune11.0ms (0.8%)

Memory

14.1MiB live, 14.1MiB allocated; 0ms 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.4%	(.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

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

Counts

8 → 11

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)
(hypot.f64 (neg.f64 x) (neg.f64 x))
(neg.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 (+ (* (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 (* (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)))))
#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
3.0ms	x	@	-inf	((* (sqrt (* x 2)) (sqrt x)) (sqrt (* x 2)) (* x 2) x 2 (sqrt x) (sqrt (+ (* (neg x) (neg x)) (* (neg x) (neg x)))) (neg x))
1.0ms	x	@	0	((* (sqrt (* x 2)) (sqrt x)) (sqrt (* x 2)) (* x 2) x 2 (sqrt x) (sqrt (+ (* (neg x) (neg x)) (* (neg x) (neg x)))) (neg x))
1.0ms	x	@	inf	((* (sqrt (* x 2)) (sqrt x)) (sqrt (* x 2)) (* x 2) x 2 (sqrt x) (sqrt (+ (* (neg x) (neg x)) (* (neg x) (neg x)))) (neg x))

Time

Variable

Point

Expression

3.0ms

-inf

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

1.0ms

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

1.0ms

inf

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

rewrite42.0ms (3.2%)

Memory

-20.0MiB live, 28.8MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	45	134
0	51	115
0	129	109

Stop Event

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

Counts

19 → 47

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

eval5.0ms (0.4%)

Memory: 11.7MiB live, 11.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 431 to 102 computations (76.3% saved)

prune19.0ms (1.5%)

Memory

-20.1MiB live, 24.7MiB allocated; 5ms collecting garbage

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	57	0	57
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	57	2	59

Accuracy

100.0%

Counts

59 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 30 to 20 computations (33.3% saved)

regimes5.0ms (0.4%)

Memory

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

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)

regimes4.0ms (0.3%)

Memory

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

Counts

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

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

Calls

3 calls:

1.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
99.4%	1	`(.f64 (.f64 #s(literal 2 binary64) x) x)`
99.4%	1	`(sqrt.f64 (.f64 (.f64 #s(literal 2 binary64) x) x))`
99.4%	1	`x`

Compiler

Compiled 12 to 10 computations (16.7% saved)

regimes3.0ms (0.2%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

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

Calls

3 calls:

1.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
51.5%	1	`(.f64 (.f64 #s(literal 2 binary64) x) x)`
51.5%	1	`(sqrt.f64 (.f64 (.f64 #s(literal 2 binary64) x) x))`
51.5%	1	`x`

Compiler

Compiled 12 to 10 computations (16.7% saved)

simplify38.0ms (3%)

Memory

-20.1MiB live, 24.9MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	18
1	18	18
2	21	18
3	27	18
4	59	18
5	379	18
6	3480	18

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations3.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 18 to 11 computations (38.9% saved)

preprocess15.0ms (1.2%)

Memory: 28.4MiB live, 28.4MiB allocated; 0ms collecting garbage
Remove: (abs x)
Compiler: Compiled 68 to 44 computations (35.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample802.0ms (62.5%)

explain55.0ms (4.3%)

preprocess229.0ms (17.8%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.3%)

rewrite37.0ms (2.9%)

eval6.0ms (0.4%)

prune11.0ms (0.8%)

series5.0ms (0.4%)

rewrite42.0ms (3.2%)

eval5.0ms (0.4%)

prune19.0ms (1.5%)

regimes5.0ms (0.4%)

regimes4.0ms (0.3%)

regimes3.0ms (0.2%)

simplify38.0ms (3%)

derivations3.0ms (0.3%)

preprocess15.0ms (1.2%)

end0.0ms (0%)

Profiling