Details

analyze3.0ms (0.2%)

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
62.5%	6.2%	31.3%	6
65.6%	3.1%	31.3%	7
65.6%	1.6%	32.8%	8
66.4%	0.8%	32.8%	9
66.4%	0.4%	33.2%	10
66.6%	0.2%	33.2%	11
66.6%	0.1%	33.3%	12

Compiler

Compiled 7 to 4 computations (42.9% saved)

sample821.0ms (49.6%)

Results

806.0ms	8256×	body	256	valid
1.0ms	8×	body	256	invalid

preprocess174.0ms (10.5%)

Algorithm

2×	egg-herbie

Rules

1274×	`sqr-pow_binary64`
676×	`cube-prod_binary64`
666×	`pow-sqr_binary64`
560×	`fabs-mul_binary64`
373×	`unpow3_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	7
1	5	4
2	7	4
3	12	4
4	17	4
5	26	4
6	47	4
7	134	4
8	500	4
9	1158	4
10	1245	4
11	1378	4
12	1536	4
13	1769	4
14	2091	4
15	2512	4
16	3012	4
17	3613	4
18	4337	4
19	4660	4
20	4944	4
21	5166	4
22	5344	4
23	5426	4
24	6366	4
25	7340	4
26	7806	4
0	1	1

Stop Event

1×	saturated
1×	node limit

Calls

Call 1

Inputs
0

Outputs
0

Call 2

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

Outputs
(.f64 (.f64 x x) x)
(.f64 x (.f64 x x))
(pow.f64 x 3)

Compiler

Compiled 7 to 4 computations (42.9% saved)

simplify166.0ms (10%)

Algorithm

1×	egg-herbie

Rules

1274×	`sqr-pow_binary64`
676×	`cube-prod_binary64`
666×	`pow-sqr_binary64`
560×	`fabs-mul_binary64`
373×	`unpow3_binary64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	4	7
1	5	4
2	7	4
3	12	4
4	17	4
5	26	4
6	47	4
7	134	4
8	500	4
9	1158	4
10	1245	4
11	1378	4
12	1536	4
13	1769	4
14	2091	4
15	2512	4
16	3012	4
17	3613	4
18	4337	4
19	4660	4
20	4944	4
21	5166	4
22	5344	4
23	5426	4
24	6366	4
25	7340	4
26	7806	4

Stop Event

1×	node limit

Counts

1 → 2

Calls

Call 1

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

Outputs
(.f64 (.f64 x x) x)
(.f64 x (.f64 x x))
(pow.f64 x 3)

eval1.0ms (0%)

Compiler: Compiled 9 to 5 computations (44.4% saved)

prune1.0ms (0.1%)

Pruning

3 alts after pruning (3 fresh and 0 done)

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

Error

Counts

3 → 2

Alt Table

Click to see full alt table

Status	Error	Program
▶	0.1b	(.f64 (.f64 x x) x)
▶	0b	(pow.f64 x 3)

Compiler

Compiled 10 to 6 computations (40% saved)

localize4.0ms (0.2%)

Local error

Found 1 expressions with local error:

New	Error	Program
✓	0.1b	(.f64 (.f64 x x) x)

Compiler

Compiled 10 to 3 computations (70% saved)

series2.0ms (0.1%)

Counts

1 → 12

Calls

3 calls:

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

rewrite63.0ms (3.8%)

Algorithm

1×	batch-egg-rewrite

Rules

339×	`associate-l_binary64`
313×	`pow1_binary64`
302×	`add-sqr-sqrt_binary64`
293×	`*-un-lft-identity_binary64`
293×	`add-log-exp_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	4
1	77	4
2	884	4

Stop Event

1×	node limit

Counts

1 → 28

Calls

Call 1

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

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

Outputs

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

simplify176.0ms (10.6%)

Algorithm

1×	egg-herbie

Rules

1274×	`sqr-pow_binary64`
676×	`cube-prod_binary64`
666×	`pow-sqr_binary64`
558×	`fabs-mul_binary64`
374×	`unpow3_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	48
1	12	48
2	17	48
3	26	48
4	47	48
5	134	48
6	506	48
7	1164	48
8	1251	48
9	1384	48
10	1542	48
11	1776	48
12	2098	48
13	2520	48
14	3021	48
15	3621	48
16	4341	48
17	4664	48
18	4948	48
19	5170	48
20	5350	48
21	5432	48
22	6372	48
23	7346	48
24	7812	48

Stop Event

1×	node limit

Counts

40 → 28

Calls

Call 1

Inputs
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)

Outputs
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)
(pow.f64 x 3)

localize3.0ms (0.2%)

Compiler: Compiled 6 to 4 computations (33.3% saved)

eval7.0ms (0.4%)

Compiler: Compiled 219 to 175 computations (20.1% saved)

prune4.0ms (0.2%)

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	28	0	28
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	28	2	30

Error

Counts

30 → 2

Alt Table

Click to see full alt table

Status	Error	Program
✓	0.1b	(.f64 (.f64 x x) x)
✓	0b	(pow.f64 x 3)

Compiler

Compiled 10 to 6 computations (40% saved)

regimes6.0ms (0.4%)

Accuracy

Total -0.1b remaining (-∞%)

Threshold costs -0.1b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(.f64 (.f64 x x) x)
(pow.f64 x 3)

Outputs
(pow.f64 x 3)

Calls

2 calls:

3.0ms	x
2.0ms	(.f64 (.f64 x x) x)

Results

Error	Segments	Branch
0b	1	`x`
0b	1	`(.f64 (.f64 x x) x)`

Compiler

Compiled 17 to 9 computations (47.1% saved)

simplify3.0ms (0.2%)

Algorithm

1×	egg-herbie

Rules

1×	`*-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	11
1	7	11

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(pow.f64 x 3)
(.f64 (.f64 x x) x)

Outputs
(pow.f64 x 3)
(.f64 (.f64 x x) x)
(.f64 x (.f64 x x))

Compiler

Compiled 10 to 6 computations (40% saved)

soundness202.0ms (12.2%)

Algorithm

1×	egg-herbie

Rules

1274×	`sqr-pow_binary64`
676×	`cube-prod_binary64`
666×	`pow-sqr_binary64`
560×	`fabs-mul_binary64`
373×	`unpow3_binary64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	4	7
1	5	4
2	7	4
3	12	4
4	17	4
5	26	4
6	47	4
7	134	4
8	500	4
9	1158	4
10	1245	4
11	1378	4
12	1536	4
13	1769	4
14	2091	4
15	2512	4
16	3012	4
17	3613	4
18	4337	4
19	4660	4
20	4944	4
21	5166	4
22	5344	4
23	5426	4
24	6366	4
25	7340	4
26	7806	4

Stop Event

1×	node limit

Compiler

Compiled 10 to 6 computations (40% saved)

end18.0ms (1.1%)

Compiler: Compiled 9 to 5 computations (44.4% saved)

Details

analyze3.0ms (0.2%)

sample821.0ms (49.6%)

preprocess174.0ms (10.5%)

simplify166.0ms (10%)

eval1.0ms (0%)

prune1.0ms (0.1%)

localize4.0ms (0.2%)

series2.0ms (0.1%)

rewrite63.0ms (3.8%)

simplify176.0ms (10.6%)

localize3.0ms (0.2%)

eval7.0ms (0.4%)

prune4.0ms (0.2%)

regimes6.0ms (0.4%)

simplify3.0ms (0.2%)

soundness202.0ms (12.2%)

end18.0ms (1.1%)

Profiling