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
75%	25%	0%	4
87.5%	12.5%	0%	5
93.7%	6.2%	0%	6
96.8%	3.1%	0%	7
98.4%	1.6%	0%	8
99.2%	0.8%	0%	9
99.6%	0.4%	0%	10
99.6%	0.2%	0.2%	11
99.6%	0.1%	0.3%	12

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample936.0ms (64.2%)

Results

904.0ms	8205×	body	256	valid
7.0ms	35×	body	1024	valid
2.0ms	16×	body	512	valid
0.0ms	3×	body	256	invalid

preprocess30.0ms (2%)

Algorithm

2×	egg-herbie

Rules

2×	`fma-neg_binary64`
1×	`+-commutative_binary64`
1×	`*-commutative_binary64`
1×	`sub-neg_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	5
1	11	5
2	13	5
0	1	1

Stop Event

1×	saturated
1×	saturated

Calls

Call 1

Inputs
0

Outputs
0

Call 2

Inputs
(-.f64 (*.f64 x 116) 16)

Outputs
(-.f64 (*.f64 x 116) 16)
(fma.f64 x 116 -16)

Compiler

Compiled 7 to 6 computations (14.3% saved)

simplify13.0ms (0.9%)

Algorithm

1×	egg-herbie

Rules

2×	`fma-neg_binary64`
1×	`+-commutative_binary64`
1×	`*-commutative_binary64`
1×	`sub-neg_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	5
1	11	5
2	13	5

Stop Event

1×

saturated

Counts

1 → 2

Calls

Call 1

Inputs
(-.f64 (*.f64 x 116) 16)

Outputs
(-.f64 (*.f64 x 116) 16)
(fma.f64 x 116 -16)

eval1.0ms (0.1%)

Compiler: Compiled 10 to 8 computations (20% saved)

prune2.0ms (0.2%)

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.0b	(-.f64 (*.f64 x 116) 16)
▶	0b	(fma.f64 x 116 -16)

Compiler

Compiled 11 to 9 computations (18.2% saved)

localize10.0ms (0.7%)

Compiler: Compiled 12 to 9 computations (25% saved)

localize7.0ms (0.5%)

Local error

Found 1 expressions with local error:

New	Error	Program
✓	0.0b	(fma.f64 x 116 -16)

Compiler

Compiled 8 to 6 computations (25% saved)

series4.0ms (0.3%)

Counts

1 → 12

Calls

3 calls:

Time	Variable		Point	Expression
2.0ms	x	@	-inf	(fma.f64 x 116 -16)
1.0ms	x	@	inf	(fma.f64 x 116 -16)
1.0ms	x	@	0	(fma.f64 x 116 -16)

rewrite63.0ms (4.3%)

Algorithm

1×	batch-egg-rewrite

Rules

434×	`pow1_binary64`
430×	`add-sqr-sqrt_binary64`
417×	`*-un-lft-identity_binary64`
408×	`add-log-exp_binary64`
408×	`log1p-expm1-u_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	5
1	102	5
2	1073	5

Stop Event

1×	node limit

Counts

1 → 24

Calls

Call 1

Inputs
(fma.f64 x 116 -16)

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

Outputs

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

simplify16.0ms (1.1%)

Algorithm

1×	egg-herbie

Rules

2×	`fma-neg_binary64`
1×	`+-commutative_binary64`
1×	`*-commutative_binary64`
1×	`sub-neg_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	54
1	11	54
2	13	54

Stop Event

1×

saturated

Counts

36 → 28

Calls

Call 1

Inputs
-16
(-.f64 (*.f64 116 x) 16)
(-.f64 (*.f64 116 x) 16)
(-.f64 (*.f64 116 x) 16)
(*.f64 116 x)
(-.f64 (*.f64 116 x) 16)
(-.f64 (*.f64 116 x) 16)
(-.f64 (*.f64 116 x) 16)
(*.f64 116 x)
(-.f64 (*.f64 116 x) 16)
(-.f64 (*.f64 116 x) 16)
(-.f64 (*.f64 116 x) 16)

Outputs
-16
(-.f64 (*.f64 116 x) 16)
(fma.f64 116 x -16)
(-.f64 (*.f64 116 x) 16)
(fma.f64 116 x -16)
(-.f64 (*.f64 116 x) 16)
(fma.f64 116 x -16)
(*.f64 116 x)
(-.f64 (*.f64 116 x) 16)
(fma.f64 116 x -16)
(-.f64 (*.f64 116 x) 16)
(fma.f64 116 x -16)
(-.f64 (*.f64 116 x) 16)
(fma.f64 116 x -16)
(*.f64 116 x)
(-.f64 (*.f64 116 x) 16)
(fma.f64 116 x -16)
(-.f64 (*.f64 116 x) 16)
(fma.f64 116 x -16)
(-.f64 (*.f64 116 x) 16)
(fma.f64 116 x -16)

eval16.0ms (1.1%)

Compiler: Compiled 232 to 194 computations (16.4% saved)

prune9.0ms (0.6%)

Pruning

4 alts after pruning (2 fresh and 2 done)

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

Error

Counts

30 → 4

Alt Table

Click to see full alt table

Status	Error	Program
▶	28.7b	(*.f64 116 x)
	33.9b	-16
✓	0.0b	(-.f64 (*.f64 x 116) 16)
✓	0b	(fma.f64 x 116 -16)

Compiler

Compiled 17 to 14 computations (17.6% saved)

localize6.0ms (0.4%)

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

eval0.0ms (0%)

Compiler: Compiled 1 to 1 computations (0% saved)

prune12.0ms (0.8%)

Pruning

4 alts after pruning (1 fresh and 3 done)

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

Error

Counts

4 → 4

Alt Table

Click to see full alt table

Status	Error	Program
✓	28.7b	(*.f64 116 x)
	33.9b	-16
✓	0.0b	(-.f64 (*.f64 x 116) 16)
✓	0b	(fma.f64 x 116 -16)

Compiler

Compiled 17 to 14 computations (17.6% saved)

eval0.0ms (0%)

Compiler: Compiled 1 to 1 computations (0% saved)

prune3.0ms (0.2%)

Pruning

4 alts after pruning (1 fresh and 3 done)

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

Error

Counts

4 → 4

Alt Table

Click to see full alt table

Status	Error	Program
✓	28.7b	(*.f64 116 x)
	33.9b	-16
✓	0.0b	(-.f64 (*.f64 x 116) 16)
✓	0b	(fma.f64 x 116 -16)

Compiler

Compiled 17 to 14 computations (17.6% saved)

eval0.0ms (0%)

Compiler: Compiled 1 to 1 computations (0% saved)

prune3.0ms (0.2%)

Pruning

4 alts after pruning (1 fresh and 3 done)

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

Error

Counts

4 → 4

Alt Table

Click to see full alt table

Status	Error	Program
✓	28.7b	(*.f64 116 x)
	33.9b	-16
✓	0.0b	(-.f64 (*.f64 x 116) 16)
✓	0b	(fma.f64 x 116 -16)

Compiler

Compiled 17 to 14 computations (17.6% saved)

regimes83.0ms (5.7%)

Counts

4 → 1

Calls

Call 1

Inputs
-16
(*.f64 116 x)
(-.f64 (*.f64 x 116) 16)
(fma.f64 x 116 -16)

Outputs
(fma.f64 x 116 -16)

Calls

5 calls:

49.0ms	(-.f64 (*.f64 x 116) 16)
9.0ms	x
9.0ms	(*.f64 x 116)
8.0ms	(*.f64 x 116)
7.0ms	(-.f64 (*.f64 x 116) 16)

Results

Error	Segments	Branch
0b	1	`x`
0b	1	`(-.f64 (*.f64 x 116) 16)`
0b	1	`(-.f64 (*.f64 x 116) 16)`
0b	1	`(*.f64 x 116)`
0b	1	`(*.f64 x 116)`

Compiler

Compiled 36 to 28 computations (22.2% saved)

regimes29.0ms (2%)

Counts

3 → 1

Calls

Call 1

Inputs
-16
(*.f64 116 x)
(-.f64 (*.f64 x 116) 16)

Outputs
(-.f64 (*.f64 x 116) 16)

Calls

3 calls:

13.0ms	(*.f64 x 116)
7.0ms	x
6.0ms	(-.f64 (*.f64 x 116) 16)

Results

Error	Segments	Branch
0.0b	1	`x`
0.0b	1	`(-.f64 (*.f64 x 116) 16)`
0.0b	1	`(*.f64 x 116)`

Compiler

Compiled 22 to 17 computations (22.7% saved)

regimes22.0ms (1.5%)

Accuracy

Total -61.2b remaining (-9646%)

Threshold costs -61.2b (-9646%)

Counts

2 → 3

Calls

Call 1

Inputs
-16
(*.f64 116 x)

Outputs
(*.f64 116 x)
-16
(*.f64 116 x)

Calls

1 calls:

20.0ms

Results

Error	Segments	Branch
0.6b	3	`x`

Compiler

Compiled 7 to 5 computations (28.6% saved)

bsearch68.0ms (4.7%)

Algorithm

2×	binary-search

Steps

Time	Left	Right
44.0ms	5.297661538558788e-13	144435.38971176354
24.0ms	-121844.2349791302	-3.2803432052842904e-18

Compiler

Compiled 10 to 8 computations (20% saved)

simplify8.0ms (0.5%)

Algorithm

1×	egg-herbie

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	34
1	20	34
2	21	34

Stop Event

1×	fuel
1×	saturated

Calls

Call 1

Inputs
(fma.f64 x 116 -16)
(-.f64 (*.f64 x 116) 16)
(if (<=.f64 x -8373072071064055/68719476736) (.f64 116 x) (if (<=.f64 x 5246549866531291/9903520314283042199192993792) -16 (.f64 116 x)))
-16

Outputs
(fma.f64 x 116 -16)
(-.f64 (*.f64 x 116) 16)
(+.f64 (*.f64 x 116) -16)
(+.f64 -16 (*.f64 x 116))
(if (<=.f64 x -8373072071064055/68719476736) (.f64 116 x) (if (<=.f64 x 5246549866531291/9903520314283042199192993792) -16 (.f64 116 x)))
(if (<=.f64 x -8373072071064055/68719476736) (.f64 x 116) (if (<=.f64 x 5246549866531291/9903520314283042199192993792) -16 (.f64 x 116)))
-16

Compiler

Compiled 29 to 23 computations (20.7% saved)

soundness37.0ms (2.5%)

Algorithm

1×	egg-herbie

Rules

2×	`fma-neg_binary64`
1×	`+-commutative_binary64`
1×	`*-commutative_binary64`
1×	`sub-neg_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	5
1	11	5
2	13	5

Stop Event

1×

saturated

Compiler

Compiled 17 to 14 computations (17.6% saved)

end77.0ms (5.3%)

Compiler: Compiled 26 to 20 computations (23.1% saved)

Details

analyze3.0ms (0.2%)

sample936.0ms (64.2%)

preprocess30.0ms (2%)

simplify13.0ms (0.9%)

eval1.0ms (0.1%)

prune2.0ms (0.2%)

localize10.0ms (0.7%)

localize7.0ms (0.5%)

series4.0ms (0.3%)

rewrite63.0ms (4.3%)

simplify16.0ms (1.1%)

eval16.0ms (1.1%)

prune9.0ms (0.6%)

localize6.0ms (0.4%)

eval0.0ms (0%)

prune12.0ms (0.8%)

eval0.0ms (0%)

prune3.0ms (0.2%)

eval0.0ms (0%)

prune3.0ms (0.2%)

regimes83.0ms (5.7%)

regimes29.0ms (2%)

regimes22.0ms (1.5%)

bsearch68.0ms (4.7%)

simplify8.0ms (0.5%)

soundness37.0ms (2.5%)

end77.0ms (5.3%)

Profiling