Metrics for sqrt E (should all be same)

analyze0.0ms (0%)

Memory

0.3MiB live, 0.3MiB allocated

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 10 to 6 computations (40% saved)

sample530.0ms (31.2%)

Memory

-3.6MiB live, 734.8MiB allocated

Samples

342.0ms

8 256×

valid

Precisions

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

ival-pow2: 95.0ms (48% of total)

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

ival-add: 41.0ms (20.7% of total)

ival-true: 5.0ms (2.5% of total)

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

Bogosity

preprocess16.0ms (1%)

Memory

25.6MiB live, 25.6MiB allocated

Algorithm

2×	egg-herbie

Rules

52×	`unsub-neg`
50×	`associate-r`
30×	`distribute-rgt-neg-out`
26×	`distribute-lft-neg-out`
26×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	20
1	20	19
2	43	19
3	146	19
4	261	19
5	290	19
6	292	19
0	5	6
1	7	6
2	12	6
3	15	6
0	15	3

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(sqrt (+ (pow x 2) (pow x 2)))

Outputs
(sqrt (+ (pow x 2) (pow x 2)))
(sqrt.f64 (*.f64 x (+.f64 x x)))

Call 2

Inputs
(sqrt (+ (pow x 2) (pow x 2)))
(sqrt (+ (pow (neg x) 2) (pow (neg x) 2)))
(neg (sqrt (+ (pow (neg x) 2) (pow (neg x) 2))))

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

Symmetry

(abs x)

explain73.0ms (4.3%)

Memory

-17.2MiB live, 103.4MiB allocated

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
132	-	4	(1.7328238130188112e-162)	`(sqrt.f64 (+.f64 (pow.f64 x #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 (pow.f64 x #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 (pow.f64 x #s(literal 2 binary64)) (pow.f64 x #s(literal 2 binary64))))`	oflow-rescue	73	0
↳	`(+.f64 (pow.f64 x #s(literal 2 binary64)) (pow.f64 x #s(literal 2 binary64)))`	overflow	73
↳	`(pow.f64 x #s(literal 2 binary64))`	overflow	146
`sqrt.f64`	`(sqrt.f64 (+.f64 (pow.f64 x #s(literal 2 binary64)) (pow.f64 x #s(literal 2 binary64))))`	uflow-rescue	55	0
↳	`(+.f64 (pow.f64 x #s(literal 2 binary64)) (pow.f64 x #s(literal 2 binary64)))`	underflow	55
↳	`(pow.f64 x #s(literal 2 binary64))`	underflow	110

Confusion

	Predicted +	Predicted -
+	128	4
-	0	124

Precision

1.0

Recall

0.9696969696969697

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	128	0	4
-	0	0	124

Precision?

1.0

Recall?

0.9696969696969697

Freqs

test

number	freq
0	128
1	128

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 62 to 24 computations (61.3% saved)

Precisions

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

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

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

ival-add: 2.0ms (16.2% of total)

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

exact: 0.0ms (0% of total)

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

eval0.0ms (0%)

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

prune1.0ms (0%)

Memory

1.2MiB live, 1.2MiB allocated

Alt Table

Click to see full alt table

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

Compiler

Compiled 9 to 5 computations (44.4% saved)

simplify3.0ms (0.2%)

Memory

4.6MiB live, 4.6MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(sqrt.f64 (+.f64 (pow.f64 x #s(literal 2 binary64)) (pow.f64 x #s(literal 2 binary64))))
✓	cost-diff	320	(+.f64 (pow.f64 x #s(literal 2 binary64)) (pow.f64 x #s(literal 2 binary64)))
✓	cost-diff	6144	(pow.f64 x #s(literal 2 binary64))

Rules

14×	`-lowering-.f32`
14×	`-lowering-.f64`
4×	`*-commutative`
4×	`+-lowering-+.f64`
4×	`count-2`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	16
1	7	16
2	12	16
3	15	16
0	15	13

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(sqrt (+ (pow x 2) (pow x 2)))
(+ (pow x 2) (pow x 2))
(pow x 2)
x
2

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

localize21.0ms (1.2%)

Memory

-9.8MiB live, 28.1MiB allocated

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(pow.f64 x #s(literal 2 binary64))
✓	accuracy	100.0%	(+.f64 (pow.f64 x #s(literal 2 binary64)) (pow.f64 x #s(literal 2 binary64)))
✓	accuracy	52.6%	(sqrt.f64 (+.f64 (pow.f64 x #s(literal 2 binary64)) (pow.f64 x #s(literal 2 binary64))))

Samples

14.0ms

256×

valid

Compiler

Compiled 22 to 7 computations (68.2% saved)

Precisions

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

ival-pow2: 5.0ms (57.4% of total)

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

ival-add: 1.0ms (11.5% of total)

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

exact: 0.0ms (0% of total)

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

series3.0ms (0.2%)

Memory

3.8MiB live, 3.8MiB allocated

Counts

3 → 36

Calls

Call 1

Inputs
#<alt (pow x 2)>
#<alt (+ (pow x 2) (pow x 2))>
#<alt (sqrt (+ (pow x 2) (pow x 2)))>

Outputs
#<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)>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* x (sqrt 2))>
#<alt (* x (sqrt 2))>
#<alt (* x (sqrt 2))>
#<alt (* x (sqrt 2))>
#<alt (* x (sqrt 2))>
#<alt (* x (sqrt 2))>
#<alt (* x (sqrt 2))>
#<alt (* x (sqrt 2))>
#<alt (* -1 (* x (sqrt 2)))>
#<alt (* -1 (* x (sqrt 2)))>
#<alt (* -1 (* x (sqrt 2)))>
#<alt (* -1 (* x (sqrt 2)))>

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	x	@	0	(sqrt (+ (pow x 2) (pow x 2)))
1.0ms	x	@	inf	(sqrt (+ (pow x 2) (pow x 2)))
0.0ms	x	@	0	(pow x 2)
0.0ms	x	@	inf	(pow x 2)
0.0ms	x	@	0	(+ (pow x 2) (pow x 2))

rewrite38.0ms (2.3%)

Memory

4.4MiB live, 42.0MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

70×	`-lowering-.f32`
70×	`-lowering-.f64`
44×	`accelerator-lowering-fma.f32`
44×	`accelerator-lowering-fma.f64`
34×	`pow-lowering-pow.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	14
1	25	10
0	167	9

Stop Event

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

Counts

3 → 33

Calls

Call 1

Inputs
(pow x 2)
(+ (pow x 2) (pow x 2))
(sqrt (+ (pow x 2) (pow x 2)))

Outputs
(exp.f64 (*.f64 #s(literal 2 binary64) (log.f64 x)))
(pow.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64))
(*.f64 x x)
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(+.f64 (.f64 x x) (.f64 x x))
(-.f64 (/.f64 (.f64 x (.f64 x (.f64 x x))) #s(literal 0 binary64)) (/.f64 (.f64 x (.f64 x (.f64 x x))) #s(literal 0 binary64)))
(fma.f64 x x (*.f64 x x))
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) (*.f64 x x))
(/.f64 (.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal 0 binary64)) (.f64 x (+.f64 x x))) (fma.f64 (.f64 x x) (.f64 x x) #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 #s(literal 1 binary64) (*.f64 x (+.f64 x x)))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal 0 binary64)) (.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal 0 binary64)) (.f64 x (+.f64 x x)))))
(/.f64 (neg.f64 (.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal 0 binary64)) (.f64 x (+.f64 x x)))) (neg.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal 0 binary64))))
(*.f64 x (+.f64 x x))
(.f64 #s(literal 2 binary64) (.f64 x x))
(.f64 (.f64 x x) #s(literal 2 binary64))
(.f64 (.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal 0 binary64)) (.f64 x (+.f64 x x))) (/.f64 #s(literal 1 binary64) (fma.f64 (.f64 x x) (*.f64 x x) #s(literal 0 binary64))))
(*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) #s(literal 0 binary64)))
(.f64 (.f64 #s(literal 2 binary64) x) x)
(exp.f64 (.f64 (log.f64 (.f64 x (+.f64 x x))) #s(literal 1/2 binary64)))
(hypot.f64 x x)
(hypot.f64 x (exp.f64 (log.f64 x)))
(hypot.f64 (exp.f64 (log.f64 x)) x)
(hypot.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(sqrt.f64 (*.f64 x (+.f64 x x)))
(/.f64 (sqrt.f64 (.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal 0 binary64)) (.f64 x (+.f64 x x)))) (sqrt.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal 0 binary64))))
(/.f64 (sqrt.f64 #s(literal 0 binary64)) (sqrt.f64 #s(literal 0 binary64)))
(pow.f64 (*.f64 x (+.f64 x x)) #s(literal 1/2 binary64))
(.f64 (pow.f64 #s(literal 2 binary64) #s(literal 1/2 binary64)) (pow.f64 (.f64 x x) #s(literal 1/2 binary64)))
(.f64 (sqrt.f64 #s(literal 2 binary64)) (sqrt.f64 (.f64 x x)))
(.f64 (pow.f64 (.f64 x (+.f64 x x)) #s(literal 1/4 binary64)) (pow.f64 (*.f64 x (+.f64 x x)) #s(literal 1/4 binary64)))

simplify8.0ms (0.5%)

Memory

13.9MiB live, 13.9MiB allocated

Algorithm

1×	egg-herbie

Rules

38×	`-lowering-.f32`
38×	`-lowering-.f64`
38×	`accelerator-lowering-fma.f32`
38×	`accelerator-lowering-fma.f64`
36×	`+-lowering-+.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	148
1	15	148
2	32	148
3	37	148
4	41	148
5	53	148
6	65	148
7	76	148
8	96	148
9	101	148
0	101	148

Stop Event

1×	iter limit
1×	saturated

Counts

36 → 36

Calls

Call 1

Inputs
(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)
(* 2 (pow x 2))
(* 2 (pow x 2))
(* 2 (pow x 2))
(* 2 (pow x 2))
(* 2 (pow x 2))
(* 2 (pow x 2))
(* 2 (pow x 2))
(* 2 (pow x 2))
(* 2 (pow x 2))
(* 2 (pow x 2))
(* 2 (pow x 2))
(* 2 (pow x 2))
(* x (sqrt 2))
(* x (sqrt 2))
(* x (sqrt 2))
(* x (sqrt 2))
(* x (sqrt 2))
(* x (sqrt 2))
(* x (sqrt 2))
(* x (sqrt 2))
(* -1 (* x (sqrt 2)))
(* -1 (* x (sqrt 2)))
(* -1 (* x (sqrt 2)))
(* -1 (* x (sqrt 2)))

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

eval11.0ms (0.6%)

Memory: -21.5MiB live, 16.4MiB allocated
Compiler: Compiled 790 to 110 computations (86.1% saved)

prune5.0ms (0.3%)

Memory

12.0MiB live, 12.0MiB allocated

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	84	3	87
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	85	3	88

Accuracy

100.0%

Counts

88 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.3%	(fma.f64 x (sqrt.f64 #s(literal 2 binary64)) #s(literal 0 binary64))
▶	100.0%	(hypot.f64 x x)
▶	52.6%	(sqrt.f64 (*.f64 x (+.f64 x x)))

Compiler

Compiled 17 to 11 computations (35.3% saved)

simplify4.0ms (0.2%)

Memory

5.5MiB live, 5.5MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 6 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(sqrt.f64 #s(literal 2 binary64))
✓	cost-diff	0	(fma.f64 x (sqrt.f64 #s(literal 2 binary64)) #s(literal 0 binary64))
✓	cost-diff	5312	(hypot.f64 x x)
✓	cost-diff	0	(+.f64 x x)
✓	cost-diff	0	(*.f64 x (+.f64 x x))
✓	cost-diff	0	(sqrt.f64 (*.f64 x (+.f64 x x)))

Rules

18×	`-lowering-.f32`
18×	`-lowering-.f64`
8×	`*-commutative`
8×	`+-lowering-+.f64`
8×	`+-lowering-+.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	31
1	17	31
2	21	31
0	21	25

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(sqrt (* x (+ x x)))
(* x (+ x x))
x
(+ x x)
(sqrt (+ (* x x) (* x x)))
x
(+ (* x (sqrt 2)) 0)
x
(sqrt 2)
2
0

Outputs
(sqrt (* x (+ x x)))
(sqrt.f64 (*.f64 x (+.f64 x x)))
(* x (+ x x))
(*.f64 x (+.f64 x x))
x
(+ x x)
(+.f64 x x)
(sqrt (+ (* x x) (* x x)))
(sqrt.f64 (*.f64 x (+.f64 x x)))
x
(+ (* x (sqrt 2)) 0)
(fma.f64 x (sqrt.f64 #s(literal 2 binary64)) #s(literal 0 binary64))
x
(sqrt 2)
(sqrt.f64 #s(literal 2 binary64))
2
#s(literal 2 binary64)
0
#s(literal 0 binary64)

localize36.0ms (2.1%)

Memory

6.3MiB live, 48.2MiB allocated

Localize:

Found 6 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(sqrt.f64 #s(literal 2 binary64))
✓	accuracy	99.3%	(fma.f64 x (sqrt.f64 #s(literal 2 binary64)) #s(literal 0 binary64))
✓	accuracy	100.0%	(hypot.f64 x x)
✓	accuracy	100.0%	(+.f64 x x)
✓	accuracy	100.0%	(*.f64 x (+.f64 x x))
✓	accuracy	52.6%	(sqrt.f64 (*.f64 x (+.f64 x x)))

Samples

21.0ms

256×

valid

Compiler

Compiled 31 to 12 computations (61.3% saved)

Precisions

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

ival-hypot: 4.0ms (29.3% of total)

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

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

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

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

exact: 0.0ms (0% of total)

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

series2.0ms (0.1%)

Memory

3.1MiB live, 3.1MiB allocated

Counts

6 → 60

Calls

Call 1

Inputs
#<alt (sqrt (* x (+ x x)))>
#<alt (* x (+ x x))>
#<alt (+ x x)>
#<alt (sqrt (+ (* x x) (* x x)))>
#<alt (+ (* x (sqrt 2)) 0)>
#<alt (sqrt 2)>

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

Calls

15 calls:

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

rewrite54.0ms (3.2%)

Memory

2.0MiB live, 40.0MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

796×	`frac-times`
348×	`times-frac`
292×	`-lowering-.f32`
292×	`-lowering-.f64`
182×	`accelerator-lowering-fma.f32`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	32
1	52	7
2	418	7
0	4043	7

Stop Event

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

Counts

6 → 12

Calls

Call 1

Inputs
(sqrt (* x (+ x x)))
(* x (+ x x))
(+ x x)
(sqrt (+ (* x x) (* x x)))
(+ (* x (sqrt 2)) 0)
(sqrt 2)

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

simplify14.0ms (0.8%)

Memory

-19.8MiB live, 18.4MiB allocated

Algorithm

1×	egg-herbie

Rules

38×	`-lowering-.f32`
38×	`-lowering-.f64`
38×	`accelerator-lowering-fma.f32`
38×	`accelerator-lowering-fma.f64`
36×	`+-lowering-+.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	248
1	17	248
2	32	248
3	36	248
4	40	248
5	52	248
6	64	248
7	75	248
8	95	248
9	100	248
0	100	248

Stop Event

1×	iter limit
1×	saturated

Counts

60 → 60

Calls

Call 1

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

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

eval7.0ms (0.4%)

Memory: 12.7MiB live, 12.7MiB allocated
Compiler: Compiled 437 to 34 computations (92.2% saved)

prune3.0ms (0.2%)

Memory

6.2MiB live, 6.2MiB allocated

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	71	1	72
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	71	4	75

Accuracy

100.0%

Counts

75 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.3%	(fma.f64 x (sqrt.f64 #s(literal 2 binary64)) #s(literal 0 binary64))
✓	100.0%	(hypot.f64 x x)
✓	52.6%	(sqrt.f64 (*.f64 x (+.f64 x x)))
▶	3.6%	#s(literal 0 binary64)

Compiler

Compiled 19 to 13 computations (31.6% saved)

simplify3.0ms (0.2%)

Memory

3.6MiB live, 3.6MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1
0	1	1

Stop Event

1×	saturated
1×	saturated

Calls

Call 1

Inputs
0

Outputs
0
#s(literal 0 binary64)

localize8.0ms (0.5%)

Memory

-28.3MiB live, 10.1MiB allocated

Samples

6.0ms

256×

valid

Compiler

Compiled 3 to 4 computations (-33.3% saved)

Precisions

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

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

exact: 0.0ms (0% of total)

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

series0.0ms (0%)

Memory

0.0MiB live, 0.0MiB allocated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

rewrite7.0ms (0.4%)

Memory

8.3MiB live, 8.3MiB allocated

Algorithm

1×	batch-egg-rewrite

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	0	0

Stop Event

1×	saturated
1×	saturated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

simplify2.0ms (0.1%)

Memory

3.3MiB live, 3.3MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	0	0

Stop Event

1×	saturated
1×	saturated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

eval0.0ms (0%)

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

prune2.0ms (0.1%)

Memory

4.8MiB live, 4.8MiB allocated

Pruning

4 alts after pruning (0 fresh and 4 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	3	3
Total	4	4

Accuracy

100.0%

Counts

4 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.3%	(fma.f64 x (sqrt.f64 #s(literal 2 binary64)) #s(literal 0 binary64))
✓	100.0%	(hypot.f64 x x)
✓	52.6%	(sqrt.f64 (*.f64 x (+.f64 x x)))
✓	3.6%	#s(literal 0 binary64)

Compiler

Compiled 43 to 25 computations (41.9% saved)

regimes9.0ms (0.6%)

Memory

16.6MiB live, 16.6MiB allocated

Counts

5 → 1

Calls

Call 1

Inputs
#s(literal 0 binary64)
(fma.f64 x (sqrt.f64 #s(literal 2 binary64)) #s(literal 0 binary64))
(sqrt.f64 (*.f64 x (+.f64 x x)))
(hypot.f64 x x)
(sqrt.f64 (+.f64 (pow.f64 x #s(literal 2 binary64)) (pow.f64 x #s(literal 2 binary64))))

Outputs
(hypot.f64 x x)

Calls

4 calls:

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

Results

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

Compiler

Compiled 23 to 13 computations (43.5% saved)

regimes13.0ms (0.8%)

Memory

-24.7MiB live, 16.7MiB allocated

Counts

3 → 1

Calls

Call 1

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

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

Calls

4 calls:

5.0ms	(pow.f64 x #s(literal 2 binary64))
2.0ms	x
2.0ms	(sqrt.f64 (+.f64 (pow.f64 x #s(literal 2 binary64)) (pow.f64 x #s(literal 2 binary64))))
2.0ms	(+.f64 (pow.f64 x #s(literal 2 binary64)) (pow.f64 x #s(literal 2 binary64)))

Results

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

Compiler

Compiled 23 to 13 computations (43.5% saved)

regimes5.0ms (0.3%)

Memory

11.0MiB live, 11.0MiB allocated

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(literal 0 binary64)

Outputs
#s(literal 0 binary64)

Calls

4 calls:

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

Results

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

Compiler

Compiled 23 to 13 computations (43.5% saved)

simplify7.0ms (0.4%)

Memory

11.1MiB live, 11.1MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	9

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness726.0ms (42.7%)

Memory

-24.4MiB live, 88.4MiB allocated

Rules

796×	`frac-times`
348×	`times-frac`
292×	`-lowering-.f32`
292×	`-lowering-.f64`
182×	`accelerator-lowering-fma.f32`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	32
1	52	7
2	418	7
0	4043	7
0	8	148
1	15	148
2	32	148
3	37	148
4	41	148
5	53	148
6	65	148
7	76	148
8	96	148
9	101	148
0	101	148
0	5	14
1	25	10
0	167	9

Stop Event

1×	done
1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit
1×	saturated
1×	iter limit
1×	iter limit
1×	node limit

Compiler

Compiled 29 to 19 computations (34.5% saved)

preprocess87.0ms (5.1%)

Memory: 9.1MiB live, 61.7MiB allocated
Remove: (abs x)
Compiler: Compiled 46 to 26 computations (43.5% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

Iter	Nodes	Cost
0	8	148
1	15	148
2	32	148
3	37	148
4	41	148
5	53	148
6	65	148
7	76	148
8	96	148
9	101	148
0	101	148

Iter	Nodes	Cost
0	9	248
1	17	248
2	32	248
3	36	248
4	40	248
5	52	248
6	64	248
7	75	248
8	95	248
9	100	248
0	100	248

Iter	Nodes	Cost
0	8	148
1	15	148
2	32	148
3	37	148
4	41	148
5	53	148
6	65	148
7	76	148
8	96	148
9	101	148
0	101	148

Iter	Nodes	Cost
0	9	248
1	17	248
2	32	248
3	36	248
4	40	248
5	52	248
6	64	248
7	75	248
8	95	248
9	100	248
0	100	248

analyze0.0ms (0%)

sample530.0ms (31.2%)

preprocess16.0ms (1%)

explain73.0ms (4.3%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify3.0ms (0.2%)

localize21.0ms (1.2%)

series3.0ms (0.2%)

rewrite38.0ms (2.3%)

simplify8.0ms (0.5%)

eval11.0ms (0.6%)

prune5.0ms (0.3%)

simplify4.0ms (0.2%)

localize36.0ms (2.1%)

series2.0ms (0.1%)

rewrite54.0ms (3.2%)

simplify14.0ms (0.8%)

eval7.0ms (0.4%)

prune3.0ms (0.2%)

simplify3.0ms (0.2%)

localize8.0ms (0.5%)

series0.0ms (0%)

rewrite7.0ms (0.4%)

simplify2.0ms (0.1%)

eval0.0ms (0%)

prune2.0ms (0.1%)

regimes9.0ms (0.6%)

regimes13.0ms (0.8%)

regimes5.0ms (0.3%)

simplify7.0ms (0.4%)

soundness726.0ms (42.7%)

preprocess87.0ms (5.1%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	8	148
1	15	148
2	32	148
3	37	148
4	41	148
5	53	148
6	65	148
7	76	148
8	96	148
9	101	148
0	101	148

Iter	Nodes	Cost
0	9	248
1	17	248
2	32	248
3	36	248
4	40	248
5	52	248
6	64	248
7	75	248
8	95	248
9	100	248
0	100	248