Details

analyze34.0ms (2.3%)

Algorithm

1×

Search

True	Other	False	Iter
0%	100%	0%	0
0%	100%	0%	1
0%	100%	0%	2
50%	50%	0%	3
50%	25%	25%	4
62.5%	12.5%	25%	5
68.7%	6.2%	25%	6
71.8%	3.1%	25%	7
73.4%	1.6%	25%	8
74.2%	0.8%	25%	9
74.6%	0.4%	25%	10
74.8%	0.2%	25%	11
74.9%	0.1%	25%	12

Compiler

Compiled 9 to 7 computations (22.2% saved)

sample1.0s (69.1%)

Results

1.0s	8256×	body	256	valid
0.0ms	5×	body	256	invalid

preprocess33.0ms (2.2%)

Algorithm

2×	egg-herbie

Rules

4×	`fma-neg_binary64`
3×	`*-commutative_binary64`
1×	`+-commutative_binary64`
1×	`associate-r_binary64`
1×	`associate-l_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	8
1	16	8
2	22	8
3	23	8
0	1	1

Stop Event

1×	saturated
1×	saturated

Calls

Call 1

Inputs
0

Outputs
0

Call 2

Inputs
(-.f64 (.f64 (.f64 x x) 2) 1)

Outputs
(-.f64 (.f64 (.f64 x x) 2) 1)
(fma.f64 (*.f64 x x) 2 -1)
(fma.f64 x (*.f64 x 2) -1)

Compiler

Compiled 9 to 7 computations (22.2% saved)

simplify12.0ms (0.8%)

Algorithm

1×	egg-herbie

Rules

4×	`fma-neg_binary64`
3×	`*-commutative_binary64`
1×	`+-commutative_binary64`
1×	`associate-r_binary64`
1×	`associate-l_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	8
1	16	8
2	22	8
3	23	8

Stop Event

1×

saturated

Counts

1 → 2

Calls

Call 1

Inputs
(-.f64 (.f64 (.f64 x x) 2) 1)

Outputs
(-.f64 (.f64 (.f64 x x) 2) 1)
(fma.f64 (*.f64 x x) 2 -1)
(fma.f64 x (*.f64 x 2) -1)

eval1.0ms (0.1%)

Compiler: Compiled 14 to 10 computations (28.6% saved)

prune48.0ms (3.2%)

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 x x) 2) 1)

Compiler

Compiled 8 to 6 computations (25% saved)

localize15.0ms (1%)

Local error

Found 1 expressions with local error:

New	Error	Program
✓	0.0b	(.f64 (.f64 x x) 2)

Compiler

Compiled 19 to 10 computations (47.4% saved)

series3.0ms (0.2%)

Counts

1 → 12

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	0	(.f64 (.f64 x x) 2)
1.0ms	x	@	inf	(.f64 (.f64 x x) 2)
1.0ms	x	@	-inf	(.f64 (.f64 x x) 2)

rewrite88.0ms (5.8%)

Algorithm

1×	batch-egg-rewrite

Rules

423×	`pow1_binary64`
409×	`add-sqr-sqrt_binary64`
402×	`*-un-lft-identity_binary64`
390×	`add-log-exp_binary64`
390×	`log1p-expm1-u_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	7
1	101	7
2	1124	7

Stop Event

1×	node limit

Counts

1 → 16

Calls

Call 1

Inputs
(.f64 (.f64 x x) 2)

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

Outputs

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

simplify184.0ms (12.2%)

Algorithm

1×	egg-herbie

Rules

1082×	`sqr-pow_binary64`
617×	`cube-prod_binary64`
558×	`fabs-mul_binary64`
523×	`pow-sqr_binary64`
445×	`associate-l_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	84
1	11	84
2	22	84
3	43	84
4	105	84
5	329	84
6	1259	84
7	2132	84
8	2296	84
9	2480	84
10	2688	84
11	2984	84
12	3379	84
13	3860	84
14	4426	84
15	5118	84
16	5951	84
17	6343	84
18	6631	84
19	6911	84
20	6985	84
21	7019	84
22	7960	84

Stop Event

1×	node limit

Counts

28 → 18

Calls

Call 1

Inputs
(*.f64 2 (pow.f64 x 2))
(*.f64 2 (pow.f64 x 2))
(*.f64 2 (pow.f64 x 2))
(*.f64 2 (pow.f64 x 2))
(*.f64 2 (pow.f64 x 2))
(*.f64 2 (pow.f64 x 2))
(*.f64 2 (pow.f64 x 2))
(*.f64 2 (pow.f64 x 2))
(*.f64 2 (pow.f64 x 2))
(*.f64 2 (pow.f64 x 2))
(*.f64 2 (pow.f64 x 2))
(*.f64 2 (pow.f64 x 2))

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

eval8.0ms (0.5%)

Compiler: Compiled 185 to 127 computations (31.4% saved)

prune7.0ms (0.4%)

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	18	0	18
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	18	1	19

Error

Counts

19 → 1

Alt Table

Click to see full alt table

Status	Error	Program
✓	0b	(-.f64 (.f64 (.f64 x x) 2) 1)

Compiler

Compiled 16 to 12 computations (25% saved)

simplify4.0ms (0.2%)

Algorithm

1×	egg-herbie

Rules

1×	`+-commutative_binary64`
1×	`*-commutative_binary64`
1×	`sub-neg_binary64`
1×	`1-exp_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	10
1	13	10
2	14	10

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(-.f64 (.f64 (.f64 x x) 2) 1)

Outputs
(-.f64 (.f64 (.f64 x x) 2) 1)
(+.f64 (.f64 (.f64 x x) 2) -1)

Compiler

Compiled 8 to 6 computations (25% saved)

soundness0.0ms (0%)

end27.0ms (1.8%)

Compiler: Compiled 8 to 6 computations (25% saved)

Details

analyze34.0ms (2.3%)

sample1.0s (69.1%)

preprocess33.0ms (2.2%)

simplify12.0ms (0.8%)

eval1.0ms (0.1%)

prune48.0ms (3.2%)

localize15.0ms (1%)

series3.0ms (0.2%)

rewrite88.0ms (5.8%)

simplify184.0ms (12.2%)

eval8.0ms (0.5%)

prune7.0ms (0.4%)

simplify4.0ms (0.2%)

soundness0.0ms (0%)

end27.0ms (1.8%)

Profiling