Metrics for sqrt sqr

start0.0ms (0%)

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

analyze2.0ms (0%)

Memory

1.7MiB live, 1.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
50%	50%	50%	0%	0%	0%	0%	2
75%	75%	25%	0%	0%	0%	0%	3
87.5%	87.5%	12.5%	0%	0%	0%	0%	4
93.8%	93.7%	6.2%	0%	0%	0%	0%	5
96.9%	96.8%	3.1%	0%	0%	0%	0%	6
98.4%	98.4%	1.6%	0%	0%	0%	0%	7
99.2%	99.2%	0.8%	0%	0%	0%	0%	8
99.6%	99.6%	0.4%	0%	0%	0%	0%	9
99.8%	99.8%	0.2%	0%	0%	0%	0%	10
99.9%	99.9%	0.1%	0%	0%	0%	0%	11
100%	99.9%	0%	0%	0%	0%	0%	12

Compiler

Compiled 14 to 10 computations (28.6% saved)

sample1.9s (56.5%)

Memory

5.3MiB live, 1 507.5MiB allocated; 934ms collecting garbage

Samples

1.1s	4 093×	2	valid
351.0ms	4 163×	0	valid

Precisions

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

ival-div: 267.0ms (29.7% of total)

ival-mult: 245.0ms (27.2% of total)

adjust: 161.0ms (17.9% of total)

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

ival-sub: 99.0ms (11% of total)

ival-true: 6.0ms (0.7% of total)

exact: 6.0ms (0.7% of total)

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

Bogosity

explain266.0ms (7.9%)

Memory

11.0MiB live, 203.3MiB allocated; 25ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
134	-	1	(1.3988211925148462e-158)	`(sqrt.f64 (*.f64 x x))`
0	-	0	-	`(/.f64 #s(literal 1 binary64) x)`
0	-	0	-	`#s(literal 1 binary64)`
0	-	0	-	`(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))`
0	-	0	-	`(/.f64 x x)`
0	-	0	-	`(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))`
0	-	0	-	`(*.f64 x x)`
0	-	0	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`sqrt.f64`	`(sqrt.f64 (*.f64 x x))`	uflow-rescue	72	0
↳	`(*.f64 x x)`	underflow	72
`sqrt.f64`	`(sqrt.f64 (*.f64 x x))`	oflow-rescue	61	0
↳	`(*.f64 x x)`	overflow	61

Confusion

	Predicted +	Predicted -
+	133	6
-	0	117

Precision

1.0

Recall

0.9568345323741008

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	133	0	6
-	0	0	117

Precision?

1.0

Recall?

0.9568345323741008

Freqs

test

number	freq
0	123
1	133

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

103.0ms	250×	2	valid
24.0ms	262×	0	valid

Compiler

Compiled 86 to 28 computations (67.4% saved)

Precisions

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

ival-sub: 48.0ms (47.8% of total)

ival-div: 16.0ms (15.9% of total)

ival-mult: 16.0ms (15.9% of total)

adjust: 12.0ms (11.9% of total)

ival-sqrt: 8.0ms (8% of total)

ival-true: 1.0ms (1% of total)

exact: 1.0ms (1% of total)

ival-assert: 0.0ms (0% of total)

preprocess167.0ms (5%)

Memory

-2.2MiB live, 129.4MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	10	21
1	38	14
2	106	12
3	244	12
4	1253	12
5	5913	12
0	8	12
0	14	8
1	30	6
2	64	6
3	184	6
4	1061	6
5	6955	6
0	8061	6

Stop Event

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

Calls

Call 1

Inputs
(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))

Outputs
(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
(-.f64 #s(literal 1 binary64) (/.f64 (fabs.f64 x) x))

Compiler

Compiled 12 to 8 computations (33.3% 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.3MiB live, 1.3MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	49.5%	(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))

Compiler

Compiled 12 to 8 computations (33.3% saved)

simplify127.0ms (3.8%)

Memory

-17.1MiB live, 87.9MiB allocated; 12ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score
cost-diff	0	(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
cost-diff	2	(sqrt.f64 (*.f64 x x))
cost-diff	2	(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))
cost-diff	2	(/.f64 x x)

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	35
0	14	25
1	30	21
2	64	21
3	184	21
4	1061	21
5	6955	21
0	8061	21

Stop Event

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

Calls

Call 1

Inputs
(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
(/.f64 x x)
x
(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))
(/.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
(sqrt.f64 (*.f64 x x))
(*.f64 x x)

Outputs
(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
(-.f64 #s(literal 1 binary64) (/.f64 (fabs.f64 x) x))
(/.f64 x x)
#s(literal 1 binary64)
x
(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))
(/.f64 (fabs.f64 x) x)
(/.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
(sqrt.f64 (*.f64 x x))
(fabs.f64 x)
(*.f64 x x)

localize50.0ms (1.5%)

Memory

8.1MiB live, 52.4MiB allocated; 5ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.0	(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
accuracy	0.0	(*.f64 x x)
accuracy	0.12890625	(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))
accuracy	30.991726340437552	(sqrt.f64 (*.f64 x x))

Samples

33.0ms	125×	2	valid
9.0ms	131×	0	valid

Compiler

Compiled 37 to 10 computations (73% saved)

Precisions

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

ival-sub: 14.0ms (43.7% of total)

ival-div: 6.0ms (18.7% of total)

ival-mult: 5.0ms (15.6% of total)

adjust: 4.0ms (12.5% of total)

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

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

series2.0ms (0.1%)

Memory

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

Counts

5 → 8

Calls

Call 1

Inputs
(/.f64 x x)
(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))
(sqrt.f64 (*.f64 x x))
(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
(*.f64 x x)

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

Calls

3 calls:

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

Time

Variable

Point

Expression

1.0ms

inf

((/ x x) (* (/ 1 x) (sqrt (* x x))) (sqrt (* x x)) (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (* x x))

1.0ms

-inf

((/ x x) (* (/ 1 x) (sqrt (* x x))) (sqrt (* x x)) (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (* x x))

0.0ms

((/ x x) (* (/ 1 x) (sqrt (* x x))) (sqrt (* x x)) (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (* x x))

simplify164.0ms (4.9%)

Memory

-10.7MiB live, 181.9MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	21	55
1	40	47
2	87	47
3	274	47
4	1618	47
5	7455	47
0	8649	47

Stop Event

1×	iter limit
1×	node limit

Counts

8 → 8

Calls

Call 1

Inputs
#s(approx (/ x x) #s(hole binary64 1))
#s(approx (* (/ 1 x) (sqrt (* x x))) #s(hole binary64 1))
#s(approx (sqrt (* x x)) #s(hole binary64 x))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 0))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (* (/ 1 x) (sqrt (* x x))) #s(hole binary64 -1))
#s(approx (sqrt (* x x)) #s(hole binary64 (* -1 x)))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 2))

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

rewrite49.0ms (1.5%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	30
0	14	15
1	59	7
0	438	7

Stop Event

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

Counts

5 → 18

Calls

Call 1

Inputs
(/.f64 x x)
(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))
(sqrt.f64 (*.f64 x x))
(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
(*.f64 x x)

Outputs
#s(literal 1 binary64)
#s(literal 1 binary64)
x
#s(literal 0 binary64)
(.f64 (.f64 x (sqrt.f64 x)) (sqrt.f64 x))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (neg.f64 x) (neg.f64 x))
(.f64 (sqrt.f64 x) (.f64 (sqrt.f64 x) x))
(*.f64 x x)
(pow.f64 (.f64 (.f64 x x) (*.f64 x x)) #s(literal 1/2 binary64))
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 x (neg.f64 x)))
(neg.f64 (*.f64 (neg.f64 x) x))
(sqrt.f64 (.f64 (.f64 x x) (*.f64 x x)))
(fabs.f64 (*.f64 x x))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))

eval3.0ms (0.1%)

Memory: 4.8MiB live, 4.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 338 to 102 computations (69.8% saved)

prune1.0ms (0%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	23	2	25
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	24	2	26

Accuracy

100.0%

Counts

26 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	52.7%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
▶	50.4%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Compiler

Compiled 28 to 20 computations (28.6% saved)

simplify188.0ms (5.6%)

Memory

-23.5MiB live, 125.1MiB allocated; 19ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
cost-diff	0	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	30
0	12	22
1	29	18
2	66	18
3	191	18
4	1121	18
5	6109	18
0	8216	18

Stop Event

1×	iter limit
1×	node limit
1×	saturated

Calls

Call 1

Inputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(literal 0 binary64)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(literal 2 binary64)

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(literal 0 binary64)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(literal 2 binary64)

localize57.0ms (1.7%)

Memory

5.1MiB live, 52.4MiB allocated; 2ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	30.273437500000004	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
accuracy	31.726562500000004	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Samples

42.0ms	125×	2	valid
8.0ms	131×	0	valid

Compiler

Compiled 28 to 12 computations (57.1% saved)

Precisions

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

ival-div: 5.0ms (24.5% of total)

ival-mult: 5.0ms (24.5% of total)

adjust: 4.0ms (19.6% of total)

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

ival-sub: 2.0ms (9.8% of total)

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

series0.0ms (0%)

Memory

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

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))

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

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	0	((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (- (/ x x) (* (/ 1 x) (sqrt (* x x)))))
0.0ms	x	@	inf	((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (- (/ x x) (* (/ 1 x) (sqrt (* x x)))))
0.0ms	x	@	-inf	((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (- (/ x x) (* (/ 1 x) (sqrt (* x x)))))

Time

Variable

Point

Expression

0.0ms

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (- (/ x x) (* (/ 1 x) (sqrt (* x x)))))

0.0ms

inf

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (- (/ x x) (* (/ 1 x) (sqrt (* x x)))))

0.0ms

-inf

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (- (/ x x) (* (/ 1 x) (sqrt (* x x)))))

simplify107.0ms (3.2%)

Memory

14.0MiB live, 55.1MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	20
1	29	16
2	66	16
3	191	16
4	1121	16
5	6109	16
0	8216	16

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 0))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 2))

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 0))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 2))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))

rewrite101.0ms (3%)

Memory

3.8MiB live, 55.0MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	28
0	12	20
1	58	6
0	438	6

Stop Event

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

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))

eval0.0ms (0%)

Memory: 0.5MiB live, 0.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 28 to 12 computations (57.1% saved)

prune14.0ms (0.4%)

Memory

-41.8MiB live, 5.1MiB allocated; 7ms collecting garbage

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	2	0	2
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	2	2	4

Accuracy

100.0%

Counts

4 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	52.7%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
✓	50.4%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Compiler

Compiled 68 to 39 computations (42.6% saved)

regimes3.0ms (0.1%)

Memory

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

Counts

3 → 2

Calls

Call 1

Inputs

#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))

(-.f64 (/.f64 x x) (*.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (*.f64 x x))))

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Calls

2 calls:

2.0ms	x
1.0ms	(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))

Results

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

Compiler

Compiled 13 to 9 computations (30.8% saved)

regimes2.0ms (0.1%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Calls

2 calls:

1.0ms	x
1.0ms	(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))

Results

Accuracy	Segments	Branch
50.4%	1	`(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))`
50.4%	1	`x`

Compiler

Compiled 13 to 9 computations (30.8% saved)

bsearch20.0ms (0.6%)

Memory

-6.9MiB live, 39.7MiB allocated; 4ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
18.0ms	-8.597089390009203e-307	1.747985352150088e-308

Samples

10.0ms	48×	2	valid
4.0ms	64×	0	valid

Compiler

Compiled 211 to 166 computations (21.3% saved)

Precisions

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

ival-div: 5.0ms (45.8% of total)

adjust: 2.0ms (18.3% of total)

ival-mult: 2.0ms (18.3% of total)

ival-sub: 1.0ms (9.2% of total)

ival-sqrt: 1.0ms (9.2% of total)

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

simplify45.0ms (1.3%)

Memory

7.5MiB live, 54.0MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	15	34
1	32	28
2	68	28
3	217	28
4	1456	28
5	6299	28

Stop Event

1×	node limit

Calls

Call 1

Inputs

(if (<=.f64 x #s(literal -101201126653655/202402253307310618352495346718917307049556649764142118356901358027430339567995346891960383701437124495187077864316811911389808737385793476867013399940738509921517424276566361364466907742093216341239767678472745068562007483424692698618103355649159556340810056512358769552333414615230502532186327508646006263307707741093494784 binary64)) #s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64)) #s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64)))

#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Outputs

(if (<=.f64 x #s(literal -101201126653655/202402253307310618352495346718917307049556649764142118356901358027430339567995346891960383701437124495187077864316811911389808737385793476867013399940738509921517424276566361364466907742093216341239767678472745068562007483424692698618103355649159556340810056512358769552333414615230502532186327508646006263307707741093494784 binary64)) #s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64)) #s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64)))

#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

derivations76.0ms (2.3%)

Memory

-12.9MiB live, 83.4MiB allocated; 9ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 46 to 15 computations (67.4% saved)

preprocess15.0ms (0.4%)

Memory: 41.1MiB live, 41.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 128 to 56 computations (56.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze2.0ms (0%)

sample1.9s (56.5%)

explain266.0ms (7.9%)

preprocess167.0ms (5%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify127.0ms (3.8%)

localize50.0ms (1.5%)

series2.0ms (0.1%)

simplify164.0ms (4.9%)

rewrite49.0ms (1.5%)

eval3.0ms (0.1%)

prune1.0ms (0%)

simplify188.0ms (5.6%)

localize57.0ms (1.7%)

series0.0ms (0%)

simplify107.0ms (3.2%)

rewrite101.0ms (3%)

eval0.0ms (0%)

prune14.0ms (0.4%)

regimes3.0ms (0.1%)

regimes2.0ms (0.1%)

bsearch20.0ms (0.6%)

simplify45.0ms (1.3%)

derivations76.0ms (2.3%)

preprocess15.0ms (0.4%)

end0.0ms (0%)

Profiling