Details

analyze5.0ms (0.2%)

Algorithm

1×

Search

True	Other	False	Iter
0%	100%	0%	0
0%	100%	0%	1
0%	100%	0%	2
0%	50%	50%	3
25%	25%	50%	4
37.5%	12.5%	50%	5
43.7%	6.2%	50%	6
46.9%	3.1%	50%	7
48.4%	1.6%	50%	8
49.2%	0.8%	50%	9
49.6%	0.4%	50%	10
49.8%	0.2%	50%	11
49.9%	0.1%	50%	12

Compiler

Compiled 21 to 16 computations (23.8% saved)

sample1.4s (74.8%)

Results

1.4s	8256×	body	256	valid
1.0ms	11×	body	256	invalid

preprocess91.0ms (4.7%)

Algorithm

2×	egg-herbie

Rules

748×	`fma-neg_binary64`
738×	`div-sub_binary64`
598×	`fma-def_binary64`
490×	`associate-/l*_binary64`
423×	`distribute-rgt-in_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	29
1	37	29
2	89	27
3	238	27
4	710	27
5	1695	25
6	2919	25
7	5144	25
8	7402	25
0	1	1

Stop Event

1×	saturated
1×	node limit

Calls

Call 1

Inputs
0

Outputs
0

Call 2

Inputs
(.f64 (.f64 (/.f64 (sqrt.f64 2) 4) (sqrt.f64 (-.f64 1 (.f64 3 (.f64 v v))))) (-.f64 1 (*.f64 v v)))

Outputs
(.f64 (.f64 (/.f64 (sqrt.f64 2) 4) (sqrt.f64 (-.f64 1 (.f64 3 (.f64 v v))))) (-.f64 1 (*.f64 v v)))
(.f64 (/.f64 (sqrt.f64 2) 4) (.f64 (sqrt.f64 (+.f64 1 (.f64 -3 (.f64 v v)))) (-.f64 1 (*.f64 v v))))
(.f64 (/.f64 (sqrt.f64 2) 4) (.f64 (sqrt.f64 (+.f64 1 (.f64 (.f64 v v) -3))) (-.f64 1 (*.f64 v v))))
(.f64 (/.f64 (sqrt.f64 2) 4) (.f64 (sqrt.f64 (fma.f64 (.f64 v v) -3 1)) (-.f64 1 (.f64 v v))))
(.f64 (sqrt.f64 (fma.f64 (.f64 v v) -3 1)) (.f64 (/.f64 (sqrt.f64 2) 4) (-.f64 1 (.f64 v v))))
(.f64 (/.f64 (sqrt.f64 2) 4) (.f64 (sqrt.f64 (fma.f64 v (.f64 v -3) 1)) (-.f64 1 (.f64 v v))))
(.f64 (sqrt.f64 2) (/.f64 (sqrt.f64 (fma.f64 v (.f64 v -3) 1)) (/.f64 -4 (fma.f64 v v -1))))
(.f64 (sqrt.f64 (fma.f64 v (.f64 v -3) 1)) (.f64 (sqrt.f64 2) (.f64 -1/4 (fma.f64 v v -1))))
(.f64 (sqrt.f64 (fma.f64 v (.f64 v -3) 1)) (*.f64 (sqrt.f64 2) (fma.f64 (/.f64 v -4) v 1/4)))

Compiler

Compiled 21 to 16 computations (23.8% saved)

simplify50.0ms (2.6%)

Algorithm

1×	egg-herbie

Rules

748×	`fma-neg_binary64`
738×	`div-sub_binary64`
598×	`fma-def_binary64`
490×	`associate-/l*_binary64`
423×	`distribute-rgt-in_binary64`

Iterations

Useful iterations: 5 (0.0ms)

Iter	Nodes	Cost
0	15	29
1	37	29
2	89	27
3	238	27
4	710	27
5	1695	25
6	2919	25
7	5144	25
8	7402	25

Stop Event

1×	node limit

Counts

1 → 2

Calls

Call 1

Inputs
(.f64 (.f64 (/.f64 (sqrt.f64 2) 4) (sqrt.f64 (-.f64 1 (.f64 3 (.f64 v v))))) (-.f64 1 (*.f64 v v)))

Outputs
(.f64 (.f64 (/.f64 (sqrt.f64 2) 4) (sqrt.f64 (-.f64 1 (.f64 3 (.f64 v v))))) (-.f64 1 (*.f64 v v)))
(.f64 (/.f64 (sqrt.f64 2) 4) (.f64 (sqrt.f64 (+.f64 1 (.f64 -3 (.f64 v v)))) (-.f64 1 (*.f64 v v))))
(.f64 (/.f64 (sqrt.f64 2) 4) (.f64 (sqrt.f64 (+.f64 1 (.f64 (.f64 v v) -3))) (-.f64 1 (*.f64 v v))))
(.f64 (/.f64 (sqrt.f64 2) 4) (.f64 (sqrt.f64 (fma.f64 (.f64 v v) -3 1)) (-.f64 1 (.f64 v v))))
(.f64 (sqrt.f64 (fma.f64 (.f64 v v) -3 1)) (.f64 (/.f64 (sqrt.f64 2) 4) (-.f64 1 (.f64 v v))))
(.f64 (/.f64 (sqrt.f64 2) 4) (.f64 (sqrt.f64 (fma.f64 v (.f64 v -3) 1)) (-.f64 1 (.f64 v v))))
(.f64 (sqrt.f64 2) (/.f64 (sqrt.f64 (fma.f64 v (.f64 v -3) 1)) (/.f64 -4 (fma.f64 v v -1))))
(.f64 (sqrt.f64 (fma.f64 v (.f64 v -3) 1)) (.f64 (sqrt.f64 2) (.f64 -1/4 (fma.f64 v v -1))))
(.f64 (sqrt.f64 (fma.f64 v (.f64 v -3) 1)) (*.f64 (sqrt.f64 2) (fma.f64 (/.f64 v -4) v 1/4)))

eval1.0ms (0.1%)

Compiler: Compiled 37 to 28 computations (24.3% saved)

prune1.0ms (0.1%)

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	1	1	2
Fresh	0	1	1
Picked	0	0	0
Done	0	0	0
Total	1	2	3

Error

Counts

3 → 1

Alt Table

Click to see full alt table

Status	Error	Program
▶	0b	(.f64 (.f64 (/.f64 (sqrt.f64 2) 4) (sqrt.f64 (-.f64 1 (.f64 3 (.f64 v v))))) (-.f64 1 (*.f64 v v)))

Compiler

Compiled 20 to 15 computations (25% saved)

localize114.0ms (6%)

Local error

Found 2 expressions with local error:

New	Error	Program
	0.1b	(.f64 3 (.f64 v v))
✓	0.1b	(.f64 3 (.f64 v v))

Compiler

Compiled 72 to 48 computations (33.3% saved)

series2.0ms (0.1%)

Counts

1 → 12

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	v	@	0	(.f64 3 (.f64 v v))
1.0ms	v	@	inf	(.f64 3 (.f64 v v))
0.0ms	v	@	-inf	(.f64 3 (.f64 v v))

rewrite46.0ms (2.4%)

Algorithm

1×	batch-egg-rewrite

Rules

432×	`pow1_binary64`
419×	`add-sqr-sqrt_binary64`
411×	`*-un-lft-identity_binary64`
400×	`add-log-exp_binary64`
400×	`log1p-expm1-u_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	7
1	102	7
2	1144	7

Stop Event

1×	node limit

Counts

1 → 14

Calls

Call 1

Inputs
(.f64 3 (.f64 v v))

Outputs
((#(struct:change #<rule egg-rr> (2) ((x +.f64 0 (.f64 3 (.f64 v v)))))) (#(struct:change #<rule egg-rr> (2) ((x +.f64 (log.f64 (.f64 (pow.f64 (exp.f64 v) v) (pow.f64 (exp.f64 v) v))) (.f64 v v))))) (#(struct:change #<rule egg-rr> (2) ((x +.f64 (log.f64 (sqrt.f64 (pow.f64 (exp.f64 3) (.f64 v v)))) (log.f64 (sqrt.f64 (pow.f64 (exp.f64 3) (.f64 v v)))))))) (#(struct:change #<rule egg-rr> (2) ((x -.f64 (+.f64 1 (.f64 3 (.f64 v v))) 1)))) (#(struct:change #<rule egg-rr> (2) ((x pow.f64 (.f64 3 (.f64 v v)) 1)))) (#(struct:change #<rule egg-rr> (2) ((x pow.f64 (pow.f64 (.f64 3 (.f64 v v)) 3) 1/3)))) (#(struct:change #<rule egg-rr> (2) ((x pow.f64 (cbrt.f64 (.f64 3 (.f64 v v))) 3)))) (#(struct:change #<rule egg-rr> (2) ((x pow.f64 (.f64 v (sqrt.f64 3)) 2)))) (#(struct:change #<rule egg-rr> (2) ((x sqrt.f64 (.f64 9 (pow.f64 v 4)))))) (#(struct:change #<rule egg-rr> (2) ((x log.f64 (pow.f64 (exp.f64 3) (.f64 v v)))))) (#(struct:change #<rule egg-rr> (2) ((x cbrt.f64 (pow.f64 (.f64 3 (.f64 v v)) 3))))) (#(struct:change #<rule egg-rr> (2) ((x expm1.f64 (log1p.f64 (.f64 3 (.f64 v v))))))) (#(struct:change #<rule egg-rr> (2) ((x exp.f64 (log.f64 (.f64 3 (.f64 v v))))))) (#(struct:change #<rule egg-rr> (2) ((x log1p.f64 (expm1.f64 (.f64 3 (*.f64 v v))))))))

Outputs

((#(struct:change #<rule egg-rr> (2) ((x +.f64 0 (*.f64 3 (*.f64 v v)))))) (#(struct:change #<rule egg-rr> (2) ((x +.f64 (log.f64 (*.f64 (pow.f64 (exp.f64 v) v) (pow.f64 (exp.f64 v) v))) (*.f64 v v))))) (#(struct:change #<rule egg-rr> (2) ((x +.f64 (log.f64 (sqrt.f64 (pow.f64 (exp.f64 3) (*.f64 v v)))) (log.f64 (sqrt.f64 (pow.f64 (exp.f64 3) (*.f64 v v)))))))) (#(struct:change #<rule egg-rr> (2) ((x -.f64 (+.f64 1 (*.f64 3 (*.f64 v v))) 1)))) (#(struct:change #<rule egg-rr> (2) ((x pow.f64 (*.f64 3 (*.f64 v v)) 1)))) (#(struct:change #<rule egg-rr> (2) ((x pow.f64 (pow.f64 (*.f64 3 (*.f64 v v)) 3) 1/3)))) (#(struct:change #<rule egg-rr> (2) ((x pow.f64 (cbrt.f64 (*.f64 3 (*.f64 v v))) 3)))) (#(struct:change #<rule egg-rr> (2) ((x pow.f64 (*.f64 v (sqrt.f64 3)) 2)))) (#(struct:change #<rule egg-rr> (2) ((x sqrt.f64 (*.f64 9 (pow.f64 v 4)))))) (#(struct:change #<rule egg-rr> (2) ((x log.f64 (pow.f64 (exp.f64 3) (*.f64 v v)))))) (#(struct:change #<rule egg-rr> (2) ((x cbrt.f64 (pow.f64 (*.f64 3 (*.f64 v v)) 3))))) (#(struct:change #<rule egg-rr> (2) ((x expm1.f64 (log1p.f64 (*.f64 3 (*.f64 v v))))))) (#(struct:change #<rule egg-rr> (2) ((x exp.f64 (log.f64 (*.f64 3 (*.f64 v v))))))) (#(struct:change #<rule egg-rr> (2) ((x log1p.f64 (expm1.f64 (*.f64 3 (*.f64 v v))))))))

simplify139.0ms (7.2%)

Algorithm

1×	egg-herbie

Rules

1108×	`sqr-pow_binary64`
618×	`cube-prod_binary64`
555×	`fabs-mul_binary64`
536×	`pow-sqr_binary64`
451×	`associate-l_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	84
1	12	84
2	23	84
3	44	84
4	106	84
5	315	84
6	1235	84
7	2116	84
8	2280	84
9	2464	84
10	2672	84
11	2963	84
12	3356	84
13	3834	84
14	4395	84
15	5077	84
16	5912	84
17	6308	84
18	6602	84
19	6880	84
20	6950	84
21	6984	84
22	7925	84

Stop Event

1×	node limit

Counts

26 → 16

Calls

Call 1

Inputs
(*.f64 3 (pow.f64 v 2))
(*.f64 3 (pow.f64 v 2))
(*.f64 3 (pow.f64 v 2))
(*.f64 3 (pow.f64 v 2))
(*.f64 3 (pow.f64 v 2))
(*.f64 3 (pow.f64 v 2))
(*.f64 3 (pow.f64 v 2))
(*.f64 3 (pow.f64 v 2))
(*.f64 3 (pow.f64 v 2))
(*.f64 3 (pow.f64 v 2))
(*.f64 3 (pow.f64 v 2))
(*.f64 3 (pow.f64 v 2))

Outputs
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))
(*.f64 3 (pow.f64 v 2))
(.f64 3 (.f64 v v))

eval7.0ms (0.4%)

Compiler: Compiled 354 to 256 computations (27.7% saved)

prune4.0ms (0.2%)

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	16	0	16
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	16	1	17

Error

Counts

17 → 1

Alt Table

Click to see full alt table

Status	Error	Program
✓	0b	(.f64 (.f64 (/.f64 (sqrt.f64 2) 4) (sqrt.f64 (-.f64 1 (.f64 3 (.f64 v v))))) (-.f64 1 (*.f64 v v)))

Compiler

Compiled 40 to 30 computations (25% saved)

simplify3.0ms (0.2%)

Algorithm

1×	egg-herbie

Rules

6×	`*-commutative_binary64`
5×	`+-commutative_binary64`
5×	`sub-neg_binary64`
3×	`distribute-rgt-neg-in_binary64`
3×	`cancel-sign-sub-inv_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	29
1	31	29
2	45	29
3	51	29
4	54	29

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 (.f64 (/.f64 (sqrt.f64 2) 4) (sqrt.f64 (-.f64 1 (.f64 3 (.f64 v v))))) (-.f64 1 (*.f64 v v)))

Outputs

(*.f64 (*.f64 (/.f64 (sqrt.f64 2) 4) (sqrt.f64 (-.f64 1 (*.f64 3 (*.f64 v v))))) (-.f64 1 (*.f64 v v)))

(*.f64 (*.f64 (/.f64 (sqrt.f64 2) 4) (sqrt.f64 (+.f64 1 (*.f64 -3 (*.f64 v v))))) (-.f64 1 (*.f64 v v)))

(*.f64 (*.f64 (/.f64 (sqrt.f64 2) 4) (sqrt.f64 (+.f64 1 (*.f64 (*.f64 v v) -3)))) (-.f64 1 (*.f64 v v)))

end20.0ms (1%)

Stop Event

1×

done

Compiler

Compiled 40 to 30 computations (25% saved)

Details

analyze5.0ms (0.2%)

sample1.4s (74.8%)

preprocess91.0ms (4.7%)

simplify50.0ms (2.6%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

localize114.0ms (6%)

series2.0ms (0.1%)

rewrite46.0ms (2.4%)

simplify139.0ms (7.2%)

eval7.0ms (0.4%)

prune4.0ms (0.2%)

simplify3.0ms (0.2%)

end20.0ms (1%)

Profiling