Metrics for Asymptote C

analyze3.0ms (0.2%)

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 15 to 8 computations (46.7% saved)

Precisions

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

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

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

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

const: 0.0ms (0% of total)

sample1.1s (81.1%)

Results

318.0ms	1963×	1024	valid
318.0ms	5053×	256	valid
123.0ms	1029×	512	valid
42.0ms	211×	2048	valid

Precisions

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

ival-div: 237.0ms (46.4% of total)

ival-sub: 161.0ms (31.5% of total)

ival-add: 98.0ms (19.2% of total)

const: 15.0ms (2.9% of total)

Bogosity

preprocess116.0ms (8.9%)

Algorithm

1×	egg-herbie

Rules

814×	`fma-neg`
609×	`fma-define`
123×	`distribute-rgt-in`
98×	`times-frac`
93×	`unsub-neg`

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	19	232
1	40	212
2	88	200
3	223	196
4	538	196
5	1241	196
6	2153	196
7	2813	196
8	3049	196
9	3194	196
10	3194	196

Stop Event

1×

saturated

Calls

Call 1

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

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

explain101.0ms (7.8%)

FPErrors

Click to see full error table

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

Results

29.0ms	322×	256	valid
22.0ms	104×	1024	valid
10.0ms	14×	2048	valid
9.0ms	72×	512	valid

Compiler

Compiled 84 to 23 computations (72.6% saved)

Precisions

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

ival-div: 13.0ms (41.7% of total)

ival-sub: 12.0ms (38.4% of total)

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

const: 1.0ms (3.2% 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
	54.1%	(-.f64 (/.f64 x (+.f64 x #s(literal 1 binary64))) (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))))

Compiler

Compiled 28 to 14 computations (50% saved)

simplify8.0ms (0.6%)

Algorithm

1×	egg-herbie

Rules

46×	`unsub-neg`
22×	`neg-mul-1`
9×	`distribute-neg-out`
9×	`*-commutative`
9×	`+-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	49
1	22	49
2	33	49
3	52	49
4	80	49
5	106	49
6	124	49
7	159	49
8	190	49

Stop Event

1×

saturated

Calls

Call 1

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

Outputs

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

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

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

soundness0.0ms (0%)

Stop Event

1×

fuel

Compiler

Compiled 14 to 7 computations (50% saved)

preprocess16.0ms (1.3%)

Compiler: Compiled 56 to 28 computations (50% saved)

Asymptote C

analyze3.0ms (0.2%)

sample1.1s (81.1%)

preprocess116.0ms (8.9%)

explain101.0ms (7.8%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify8.0ms (0.6%)

soundness0.0ms (0%)

preprocess16.0ms (1.3%)

end0.0ms (0%)

Profiling