Metrics for sqrtexp (problem 3.4.4)

analyze146.0ms (4.7%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
0%	0%	100%	0%	0%	0%	0%	1
0%	0%	100%	0%	0%	0%	0%	2
50%	50%	50%	0%	0%	0%	0%	3
50%	50%	50%	0%	0%	0%	0%	4
50%	50%	50%	0%	0%	0%	0%	5
53.1%	53.1%	46.9%	0%	0%	0%	0%	6
54.7%	54.7%	45.3%	0%	0%	0%	0%	7
55.5%	55.4%	44.5%	0%	0%	0%	0%	8
55.9%	55.8%	44.1%	0%	0%	0%	0%	9
56.1%	56%	43.9%	0%	0%	0%	0%	10
56.2%	56.1%	43.8%	0%	0%	0%	0%	11
56.2%	56.2%	43.8%	0%	0%	0%	0%	12

Compiler

Compiled 14 to 12 computations (14.3% saved)

sample2.7s (88.4%)

Results

1.1s	2757×	body	1024	valid
611.0ms	3789×	body	256	valid
480.0ms	2711×	body	256	unsamplable
408.0ms	1359×	body	512	valid
121.0ms	297×	body	2048	valid
6.0ms	54×	body	256	infinite

Bogosity

preprocess41.0ms (1.3%)

Algorithm

1×	egg-herbie

Rules

1352×	`associate-/l*`
1124×	`associate-r`
1066×	`associate-/r*`
890×	`associate-l`
680×	`fma-def`

Iterations

Useful iterations: 5 (0.0ms)

Iter	Nodes	Cost
0	21	58
1	48	54
2	78	54
3	157	54
4	375	46
5	1504	34

Stop Event

1×	node limit

Calls

Call 1

Inputs
(sqrt.f64 (/.f64 (-.f64 (exp.f64 (*.f64 2 x)) 1) (-.f64 (exp.f64 x) 1)))
(sqrt.f64 (/.f64 (-.f64 (exp.f64 (*.f64 2 (neg.f64 x))) 1) (-.f64 (exp.f64 (neg.f64 x)) 1)))

Outputs
(sqrt.f64 (/.f64 (-.f64 (exp.f64 (*.f64 2 x)) 1) (-.f64 (exp.f64 x) 1)))
(sqrt.f64 (/.f64 (expm1.f64 (*.f64 2 x)) (expm1.f64 x)))
(sqrt.f64 (/.f64 (expm1.f64 (+.f64 x x)) (expm1.f64 x)))
(sqrt.f64 (/.f64 (+.f64 1 (exp.f64 x)) 1))
(sqrt.f64 (+.f64 1 (exp.f64 x)))
(sqrt.f64 (/.f64 (-.f64 (exp.f64 (*.f64 2 (neg.f64 x))) 1) (-.f64 (exp.f64 (neg.f64 x)) 1)))
(sqrt.f64 (/.f64 (expm1.f64 (*.f64 2 (neg.f64 x))) (expm1.f64 (neg.f64 x))))
(sqrt.f64 (/.f64 (expm1.f64 (*.f64 x -2)) (expm1.f64 (neg.f64 x))))
(sqrt.f64 (/.f64 (+.f64 1 (exp.f64 (neg.f64 x))) 1))
(sqrt.f64 (+.f64 1 (exp.f64 (neg.f64 x))))

Compiler

Compiled 14 to 12 computations (14.3% saved)

simplify30.0ms (1%)

Algorithm

1×	egg-herbie

Rules

1382×	`associate-r`
1260×	`associate-/l*`
1064×	`associate-/r*`
1038×	`associate-l`
904×	`fma-def`

Iterations

Useful iterations: 5 (0.0ms)

Iter	Nodes	Cost
0	13	25
1	27	25
2	36	25
3	62	25
4	130	21
5	352	15
6	1351	15

Stop Event

1×	node limit

Counts

1 → 5

Calls

Call 1

Inputs
(sqrt.f64 (/.f64 (-.f64 (exp.f64 (*.f64 2 x)) 1) (-.f64 (exp.f64 x) 1)))

Outputs
(sqrt.f64 (/.f64 (-.f64 (exp.f64 (*.f64 2 x)) 1) (-.f64 (exp.f64 x) 1)))
(sqrt.f64 (/.f64 (expm1.f64 (*.f64 2 x)) (expm1.f64 x)))
(sqrt.f64 (/.f64 (expm1.f64 (+.f64 x x)) (expm1.f64 x)))
(sqrt.f64 (/.f64 (+.f64 1 (exp.f64 x)) 1))
(sqrt.f64 (+.f64 1 (exp.f64 x)))

eval1.0ms (0%)

Compiler: Compiled 41 to 29 computations (29.3% saved)

prune1.0ms (0%)

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	4	1	5
Fresh	1	0	1
Picked	0	0	0
Done	0	0	0
Total	5	1	6

Accurracy

100.0%

Counts

6 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(sqrt.f64 (+.f64 1 (exp.f64 x)))
▶	100.0%	(sqrt.f64 (+.f64 1 (exp.f64 x)))

Compiler

Compiled 12 to 10 computations (16.7% saved)

localize34.0ms (1.1%)

Compiler: Compiled 15 to 9 computations (40% saved)

eval0.0ms (0%)

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

prune1.0ms (0%)

Pruning

1 alts after pruning (0 fresh and 1 done)

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

Accurracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(sqrt.f64 (+.f64 1 (exp.f64 x)))

Compiler

Compiled 24 to 19 computations (20.8% saved)

regimes9.0ms (0.3%)

Accuracy

Total -42.7b remaining (-∞%)

Threshold costs -42.7b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(sqrt.f64 (+.f64 1 (exp.f64 x)))
(sqrt.f64 (/.f64 (-.f64 (exp.f64 (*.f64 2 x)) 1) (-.f64 (exp.f64 x) 1)))

Outputs
(sqrt.f64 (+.f64 1 (exp.f64 x)))

Calls

3 calls:

4.0ms	x
2.0ms	(sqrt.f64 (/.f64 (-.f64 (exp.f64 (*.f64 2 x)) 1) (-.f64 (exp.f64 x) 1)))
2.0ms	(/.f64 (-.f64 (exp.f64 (*.f64 2 x)) 1) (-.f64 (exp.f64 x) 1))

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`(sqrt.f64 (/.f64 (-.f64 (exp.f64 (*.f64 2 x)) 1) (-.f64 (exp.f64 x) 1)))`
100.0%	1	`(/.f64 (-.f64 (exp.f64 (*.f64 2 x)) 1) (-.f64 (exp.f64 x) 1))`

Compiler

Compiled 45 to 36 computations (20% saved)

simplify4.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

2×	`1-exp`
2×	`+-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	15
1	11	15

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(sqrt.f64 (+.f64 1 (exp.f64 x)))

Outputs
(sqrt.f64 (+.f64 1 (exp.f64 x)))

Compiler

Compiled 6 to 5 computations (16.7% saved)

soundness64.0ms (2.1%)

Rules

1382×	`associate-r`
1260×	`associate-/l*`
1064×	`associate-/r*`
1038×	`associate-l`
904×	`fma-def`

Iterations

Useful iterations: 5 (0.0ms)

Iter	Nodes	Cost
0	13	25
1	27	25
2	36	25
3	62	25
4	130	21
5	352	15
6	1351	15

Stop Event

1×	node limit

Compiler

Compiled 85 to 56 computations (34.1% saved)

end0.0ms (0%)

preprocess26.0ms (0.9%)

Compiler: Compiled 38 to 32 computations (15.8% saved)

analyze146.0ms (4.7%)

sample2.7s (88.4%)

preprocess41.0ms (1.3%)

simplify30.0ms (1%)

eval1.0ms (0%)

prune1.0ms (0%)

localize34.0ms (1.1%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes9.0ms (0.3%)

simplify4.0ms (0.1%)

soundness64.0ms (2.1%)

end0.0ms (0%)

preprocess26.0ms (0.9%)

Profiling