Metrics for Asymptote B

analyze3.0ms (0.3%)

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

Compiler

Compiled 13 to 8 computations (38.5% saved)

Precisions

Click to see histograms. Total time spent on operations: 1.0ms

ival-div: 1.0ms (81.1% of total)

ival-sub: 0.0ms (0% of total)

ival-add: 0.0ms (0% of total)

const: 0.0ms (0% of total)

sample711.0ms (78.9%)

Results

510.0ms

8256×

256

valid

Precisions

Click to see histograms. Total time spent on operations: 320.0ms

ival-div: 160.0ms (50% of total)

ival-add: 90.0ms (28.1% of total)

ival-sub: 60.0ms (18.8% of total)

const: 9.0ms (2.8% of total)

Bogosity

preprocess66.0ms (7.3%)

Algorithm

1×	egg-herbie

Rules

246×	`fma-define`
161×	`fma-neg`
48×	`times-frac`
36×	`sub-neg`
29×	`unsub-neg`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	19	188
1	41	164
2	81	160
3	166	160
4	326	160
5	687	160
6	956	160
7	1070	160
8	1074	160

Stop Event

1×

saturated

Calls

Call 1

Inputs
(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))) (/.f64 x (+.f64 x #s(literal 1 binary64))))
(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))) (/.f64 x (+.f64 x #s(literal 1 binary64))))
(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 (neg.f64 x) #s(literal 1 binary64))) (/.f64 (neg.f64 x) (+.f64 (neg.f64 x) #s(literal 1 binary64))))
(neg.f64 (+.f64 (/.f64 #s(literal 1 binary64) (-.f64 (neg.f64 x) #s(literal 1 binary64))) (/.f64 (neg.f64 x) (+.f64 (neg.f64 x) #s(literal 1 binary64)))))

Outputs
(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))) (/.f64 x (+.f64 x #s(literal 1 binary64))))
(+.f64 (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal -1 binary64))) (/.f64 x (+.f64 #s(literal 1 binary64) x)))
(+.f64 (/.f64 x (+.f64 #s(literal 1 binary64) x)) (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal -1 binary64))))
(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))) (/.f64 x (+.f64 x #s(literal 1 binary64))))
(+.f64 (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal -1 binary64))) (/.f64 x (+.f64 #s(literal 1 binary64) x)))
(+.f64 (/.f64 x (+.f64 #s(literal 1 binary64) x)) (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal -1 binary64))))
(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 (neg.f64 x) #s(literal 1 binary64))) (/.f64 (neg.f64 x) (+.f64 (neg.f64 x) #s(literal 1 binary64))))
(+.f64 (/.f64 #s(literal 1 binary64) (+.f64 (neg.f64 x) #s(literal -1 binary64))) (/.f64 (neg.f64 x) (+.f64 #s(literal 1 binary64) (neg.f64 x))))
(-.f64 (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal -1 binary64) x #s(literal -1 binary64))) (/.f64 x (-.f64 #s(literal 1 binary64) x)))
(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 #s(literal -1 binary64) x)) (/.f64 x (+.f64 x #s(literal -1 binary64))))
(neg.f64 (+.f64 (/.f64 #s(literal 1 binary64) (-.f64 (neg.f64 x) #s(literal 1 binary64))) (/.f64 (neg.f64 x) (+.f64 (neg.f64 x) #s(literal 1 binary64)))))
(neg.f64 (+.f64 (/.f64 #s(literal 1 binary64) (+.f64 (neg.f64 x) #s(literal -1 binary64))) (/.f64 (neg.f64 x) (+.f64 #s(literal 1 binary64) (neg.f64 x)))))
(+.f64 (/.f64 #s(literal -1 binary64) (fma.f64 #s(literal -1 binary64) x #s(literal -1 binary64))) (/.f64 x (-.f64 #s(literal 1 binary64) x)))
(+.f64 (/.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) x)) (/.f64 x (-.f64 #s(literal 1 binary64) x)))

explain95.0ms (10.5%)

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`x`
-	-	`(/.f64 x (+.f64 x #s(literal 1 binary64)))`
-	-	`(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))) (/.f64 x (+.f64 x #s(literal 1 binary64))))`
-	-	`#s(literal 1 binary64)`
-	-	`(-.f64 x #s(literal 1 binary64))`
-	-	`(/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64)))`
-	-	`(+.f64 x #s(literal 1 binary64))`

Results

67.0ms

512×

256

valid

Compiler

Compiled 74 to 23 computations (68.9% saved)

Precisions

Click to see histograms. Total time spent on operations: 17.0ms

ival-div: 8.0ms (46.6% of total)

ival-add: 5.0ms (29.2% of total)

ival-sub: 3.0ms (17.5% of total)

const: 1.0ms (5.8% of total)

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
	100.0%	(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))) (/.f64 x (+.f64 x #s(literal 1 binary64))))

Compiler

Compiled 24 to 14 computations (41.7% saved)

simplify2.0ms (0.3%)

Algorithm

1×	egg-herbie

Rules

4×	`+-commutative`
3×	`1-exp`
2×	`unsub-neg`
2×	`sub-neg`
2×	`neg-mul-1`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	40
1	21	40
2	25	40
3	28	40
4	31	40
5	34	40

Stop Event

1×

saturated

Calls

Call 1

Inputs
(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))) (/.f64 x (+.f64 x #s(literal 1 binary64))))

Outputs

(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))) (/.f64 x (+.f64 x #s(literal 1 binary64))))

(+.f64 (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))) (/.f64 x (+.f64 #s(literal 1 binary64) x)))

(+.f64 (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal -1 binary64))) (/.f64 x (+.f64 #s(literal 1 binary64) x)))

soundness0.0ms (0%)

Stop Event

1×

fuel

Compiler

Compiled 12 to 8 computations (33.3% saved)

preprocess23.0ms (2.6%)

Compiler: Compiled 48 to 30 computations (37.5% saved)

Asymptote B

analyze3.0ms (0.3%)

sample711.0ms (78.9%)

preprocess66.0ms (7.3%)

explain95.0ms (10.5%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify2.0ms (0.3%)

soundness0.0ms (0%)

preprocess23.0ms (2.6%)

end0.0ms (0%)

Profiling