Metrics for sqrt sqr

analyze2.0ms (0.1%)

Memory

2.9MiB live, 2.9MiB allocated

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.4s (68.8%)

Memory

14.9MiB live, 1 605.6MiB allocated

Samples

795.0ms	4 102×	2	valid
252.0ms	4 154×	0	valid

Precisions

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

ival-div: 352.0ms (41.3% of total)

ival-mult: 218.0ms (25.6% of total)

adjust: 94.0ms (11% of total)

ival-sqrt: 92.0ms (10.8% of total)

ival-sub: 81.0ms (9.5% of total)

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

exact: 5.0ms (0.6% of total)

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

Bogosity

preprocess34.0ms (1.6%)

Memory

18.2MiB live, 56.7MiB allocated

Algorithm

1×	egg-herbie

Rules

152×	`lower-fma.f64`
152×	`lower-fma.f32`
120×	`lower-*.f32`
116×	`lower-*.f64`
56×	`lower-+.f64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	10	21
1	39	14
2	111	12
3	220	12
4	313	12
5	364	12
6	375	12
7	376	12
0	8	12
0	14	8
1	28	6
2	51	6
3	79	6
4	102	6
5	134	6
6	157	6
7	183	6
8	202	6
9	209	6
10	216	6
11	231	6
12	311	6
13	331	6
14	336	6
0	336	6

Stop Event

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

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

explain177.0ms (8.4%)

Memory

6.7MiB live, 320.0MiB allocated

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
145	-	4	(3.488470874539282e-156)	`(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))`	oflow-rescue	78	0
↳	`(*.f64 x x)`	overflow	78
`sqrt.f64`	`(sqrt.f64 (*.f64 x x))`	uflow-rescue	63	0
↳	`(*.f64 x x)`	underflow	63

Confusion

	Predicted +	Predicted -
+	141	11
-	0	104

Precision

1.0

Recall

0.9276315789473685

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	141	0	11
-	0	0	104

Precision?

1.0

Recall?

0.9276315789473685

Freqs

test

number	freq
0	115
1	141

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

92.0ms	238×	2	valid
18.0ms	274×	0	valid

Compiler

Compiled 100 to 36 computations (64% saved)

Precisions

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

ival-mult: 23.0ms (42% of total)

ival-div: 15.0ms (27.4% of total)

adjust: 6.0ms (11% of total)

ival-sub: 5.0ms (9.1% of total)

ival-sqrt: 5.0ms (9.1% of total)

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

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

exact: 0.0ms (0% of total)

eval0.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated
Compiler: Compiled 1 to 1 computations (0% saved)

prune1.0ms (0%)

Memory

1.7MiB live, 1.7MiB allocated

Alt Table

Click to see full alt table

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

Compiler

Compiled 13 to 8 computations (38.5% saved)

simplify18.0ms (0.8%)

Memory

-4.2MiB live, 33.7MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
✓	cost-diff	320	(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))
✓	cost-diff	704	(/.f64 x x)
✓	cost-diff	832	(sqrt.f64 (*.f64 x x))

Rules

152×	`lower-fma.f64`
152×	`lower-fma.f32`
120×	`lower-*.f32`
116×	`lower-*.f64`
56×	`lower-+.f64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	35
0	14	25
1	28	21
2	51	21
3	79	21
4	102	21
5	134	21
6	157	21
7	183	21
8	202	21
9	209	21
10	216	21
11	231	21
12	311	21
13	331	21
14	336	21
0	336	21

Stop Event

1×	iter limit
1×	saturated
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)

localize47.0ms (2.2%)

Memory

-14.0MiB live, 83.3MiB allocated

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))
✓	accuracy	100.0%	(*.f64 x x)
✓	accuracy	99.7%	(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))
✓	accuracy	48.3%	(sqrt.f64 (*.f64 x x))

Samples

24.0ms	119×	2	valid
13.0ms	137×	0	valid

Compiler

Compiled 37 to 10 computations (73% saved)

Precisions

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

ival-div: 8.0ms (36.7% of total)

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

adjust: 3.0ms (13.8% of total)

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

ival-sub: 2.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)

series2.0ms (0.1%)

Memory

3.3MiB live, 3.3MiB allocated

Counts

5 → 60

Calls

Call 1

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

Outputs
#<alt x>
#<alt x>
#<alt x>
#<alt x>
#<alt x>
#<alt x>
#<alt x>
#<alt x>
#<alt (* -1 x)>
#<alt (* -1 x)>
#<alt (* -1 x)>
#<alt (* -1 x)>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt 1>
#<alt -1>
#<alt -1>
#<alt -1>
#<alt -1>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 2>
#<alt 2>
#<alt 2>
#<alt 2>
#<alt (pow x 2)>
#<alt (pow x 2)>
#<alt (pow x 2)>
#<alt (pow x 2)>
#<alt (pow x 2)>
#<alt (pow x 2)>
#<alt (pow x 2)>
#<alt (pow x 2)>
#<alt (pow x 2)>
#<alt (pow x 2)>
#<alt (pow x 2)>
#<alt (pow x 2)>

Calls

15 calls:

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

simplify4.0ms (0.2%)

Memory

8.1MiB live, 8.1MiB allocated

Algorithm

1×	egg-herbie

Rules

12×	`lower-+.f64`
12×	`lower-+.f32`
6×	`lower-*.f64`
6×	`lower-fma.f64`
6×	`lower-fma.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	88
1	11	88
2	12	88
3	13	88
4	15	88
5	17	88
6	21	88
7	30	88
8	33	88
0	33	88

Stop Event

1×	iter limit
1×	saturated

Counts

60 → 52

Calls

Call 1

Inputs
x
x
x
x
x
x
x
x
(* -1 x)
(* -1 x)
(* -1 x)
(* -1 x)
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
-1
-1
-1
-1
0
0
0
0
0
0
0
0
2
2
2
2
(pow x 2)
(pow x 2)
(pow x 2)
(pow x 2)
(pow x 2)
(pow x 2)
(pow x 2)
(pow x 2)
(pow x 2)
(pow x 2)
(pow x 2)
(pow x 2)

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

rewrite65.0ms (3.1%)

Memory

6.7MiB live, 80.6MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

206×	`lower-*.f32`
204×	`lower-*.f64`
108×	`lower-/.f32`
106×	`lower-/.f64`
84×	`lower-pow.f64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	30
0	14	15
1	66	7
2	373	7
0	719	7

Stop Event

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

Counts

5 → 51

Calls

Call 1

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

eval29.0ms (1.4%)

Memory: -13.2MiB live, 27.5MiB allocated
Compiler: Compiled 1 085 to 196 computations (81.9% saved)

prune8.0ms (0.4%)

Memory

-14.1MiB live, 24.6MiB allocated

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	101	2	103
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	102	2	104

Accuracy

100.0%

Counts

104 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

simplify16.0ms (0.8%)

Memory

35.5MiB live, 35.5MiB allocated

Algorithm

1×	egg-herbie

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

Rules

152×	`lower-fma.f64`
152×	`lower-fma.f32`
120×	`lower-*.f64`
120×	`lower-*.f32`
56×	`lower-+.f64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	30
0	12	22
1	24	18
2	47	18
3	75	18
4	99	18
5	131	18
6	154	18
7	180	18
8	199	18
9	206	18
10	213	18
11	228	18
12	306	18
13	326	18
14	331	18
0	331	18

Stop Event

1×	iter limit
1×	saturated
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)

localize51.0ms (2.4%)

Memory

-0.9MiB live, 75.7MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	accuracy	55.0%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
✓	accuracy	48.2%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Samples

21.0ms	119×	2	valid
21.0ms	137×	0	valid

Compiler

Compiled 28 to 12 computations (57.1% saved)

Precisions

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

ival-div: 20.0ms (58.1% of total)

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

adjust: 4.0ms (11.6% of total)

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

ival-sub: 2.0ms (5.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

Counts

2 → 24

Calls

Call 1

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

Outputs
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 2>
#<alt 2>
#<alt 2>
#<alt 2>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 2>
#<alt 2>
#<alt 2>
#<alt 2>

Calls

6 calls:

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

simplify17.0ms (0.8%)

Memory

-38.5MiB live, 6.1MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	2	24
0	2	24

Stop Event

1×	saturated
1×	saturated

Counts

24 → 24

Calls

Call 1

Inputs
0
0
0
0
0
0
0
0
2
2
2
2
0
0
0
0
0
0
0
0
2
2
2
2

Outputs
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
2
#s(literal 2 binary64)
2
#s(literal 2 binary64)
2
#s(literal 2 binary64)
2
#s(literal 2 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
2
#s(literal 2 binary64)
2
#s(literal 2 binary64)
2
#s(literal 2 binary64)
2
#s(literal 2 binary64)

rewrite69.0ms (3.3%)

Memory

32.8MiB live, 71.5MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

206×	`lower-*.f64`
206×	`lower-*.f32`
108×	`lower-/.f64`
108×	`lower-/.f32`
84×	`lower-pow.f64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	28
0	12	20
1	61	6
2	369	6
0	716	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))

eval2.0ms (0.1%)

Memory: 6.5MiB live, 6.5MiB allocated
Compiler: Compiled 53 to 3 computations (94.3% saved)

prune4.0ms (0.2%)

Memory

-33.0MiB live, 4.9MiB allocated

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	26	0	26
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	26	2	28

Accuracy

100.0%

Counts

28 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 23 to 14 computations (39.1% saved)

regimes4.0ms (0.2%)

Memory

10.2MiB live, 10.2MiB allocated

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

Compiler

Compiled 15 to 9 computations (40% saved)

regimes3.0ms (0.1%)

Memory

7.5MiB live, 7.5MiB allocated

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

Compiler

Compiled 15 to 9 computations (40% saved)

bsearch27.0ms (1.3%)

Memory

19.0MiB live, 57.0MiB allocated

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
24.0ms	-1.1051056157021955e-306	9.253650309018781e-296

Samples

15.0ms	96×	2	valid
4.0ms	64×	0	valid

Compiler

Compiled 96 to 72 computations (25% saved)

Precisions

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

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

ival-mult: 4.0ms (27.7% of total)

adjust: 2.0ms (13.8% of total)

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

ival-sqrt: 2.0ms (13.8% of total)

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

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

exact: 0.0ms (0% of total)

simplify10.0ms (0.5%)

Memory

-30.7MiB live, 11.9MiB allocated

Algorithm

1×	egg-herbie

Rules

2×	`1-exp_binary64`
2×	`1-exp_binary32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	46
1	17	46

Stop Event

1×

saturated

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

soundness5.0ms (0.2%)

Memory

9.4MiB live, 9.4MiB allocated

Rules

12×	`lower-+.f64`
12×	`lower-+.f32`
6×	`lower-*.f64`
6×	`lower-fma.f64`
6×	`lower-fma.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	88
1	11	88
2	12	88
3	13	88
4	15	88
5	17	88
6	21	88
7	30	88
8	33	88
0	33	88

Stop Event

1×	done
1×	iter limit
1×	saturated

Compiler

Compiled 17 to 12 computations (29.4% saved)

preprocess64.0ms (3%)

Memory: -9.5MiB live, 67.6MiB allocated
Compiler: Compiled 62 to 38 computations (38.7% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

Iter	Nodes	Cost
0	10	21
1	39	14
2	111	12
3	220	12
4	313	12
5	364	12
6	375	12
7	376	12
0	8	12
0	14	8
1	28	6
2	51	6
3	79	6
4	102	6
5	134	6
6	157	6
7	183	6
8	202	6
9	209	6
10	216	6
11	231	6
12	311	6
13	331	6
14	336	6
0	336	6

Iter	Nodes	Cost
0	8	35
0	14	25
1	28	21
2	51	21
3	79	21
4	102	21
5	134	21
6	157	21
7	183	21
8	202	21
9	209	21
10	216	21
11	231	21
12	311	21
13	331	21
14	336	21
0	336	21

Iter	Nodes	Cost
0	12	30
0	12	22
1	24	18
2	47	18
3	75	18
4	99	18
5	131	18
6	154	18
7	180	18
8	199	18
9	206	18
10	213	18
11	228	18
12	306	18
13	326	18
14	331	18
0	331	18

Iter	Nodes	Cost
0	10	21
1	39	14
2	111	12
3	220	12
4	313	12
5	364	12
6	375	12
7	376	12
0	8	12
0	14	8
1	28	6
2	51	6
3	79	6
4	102	6
5	134	6
6	157	6
7	183	6
8	202	6
9	209	6
10	216	6
11	231	6
12	311	6
13	331	6
14	336	6
0	336	6

Iter	Nodes	Cost
0	8	35
0	14	25
1	28	21
2	51	21
3	79	21
4	102	21
5	134	21
6	157	21
7	183	21
8	202	21
9	209	21
10	216	21
11	231	21
12	311	21
13	331	21
14	336	21
0	336	21

Iter	Nodes	Cost
0	12	30
0	12	22
1	24	18
2	47	18
3	75	18
4	99	18
5	131	18
6	154	18
7	180	18
8	199	18
9	206	18
10	213	18
11	228	18
12	306	18
13	326	18
14	331	18
0	331	18

analyze2.0ms (0.1%)

sample1.4s (68.8%)

preprocess34.0ms (1.6%)

explain177.0ms (8.4%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify18.0ms (0.8%)

localize47.0ms (2.2%)

series2.0ms (0.1%)

simplify4.0ms (0.2%)

rewrite65.0ms (3.1%)

eval29.0ms (1.4%)

prune8.0ms (0.4%)

simplify16.0ms (0.8%)

localize51.0ms (2.4%)

series0.0ms (0%)

simplify17.0ms (0.8%)

rewrite69.0ms (3.3%)

eval2.0ms (0.1%)

prune4.0ms (0.2%)

regimes4.0ms (0.2%)

regimes3.0ms (0.1%)

bsearch27.0ms (1.3%)

simplify10.0ms (0.5%)

soundness5.0ms (0.2%)

preprocess64.0ms (3%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	10	21
1	39	14
2	111	12
3	220	12
4	313	12
5	364	12
6	375	12
7	376	12
0	8	12
0	14	8
1	28	6
2	51	6
3	79	6
4	102	6
5	134	6
6	157	6
7	183	6
8	202	6
9	209	6
10	216	6
11	231	6
12	311	6
13	331	6
14	336	6
0	336	6

Iter	Nodes	Cost
0	8	35
0	14	25
1	28	21
2	51	21
3	79	21
4	102	21
5	134	21
6	157	21
7	183	21
8	202	21
9	209	21
10	216	21
11	231	21
12	311	21
13	331	21
14	336	21
0	336	21

Iter	Nodes	Cost
0	12	30
0	12	22
1	24	18
2	47	18
3	75	18
4	99	18
5	131	18
6	154	18
7	180	18
8	199	18
9	206	18
10	213	18
11	228	18
12	306	18
13	326	18
14	331	18
0	331	18