Metrics for Asymptote A

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: 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)

sample841.0ms (83%)

Results

352.0ms	5863×	256	valid
217.0ms	1985×	512	valid
83.0ms	408×	1024	valid

Precisions

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

ival-div: 200.0ms (49.1% of total)

ival-sub: 119.0ms (29.2% of total)

ival-add: 76.0ms (18.7% of total)

const: 12.0ms (2.9% of total)

Bogosity

preprocess58.0ms (5.7%)

Algorithm

1×	egg-herbie

Rules

68×	`fma-neg`
26×	`fma-define`
22×	`sub-neg`
20×	`distribute-lft-neg-in`
18×	`cancel-sign-sub-inv`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	19	160
1	38	154
2	77	148
3	150	148
4	296	148
5	388	148
6	419	148
7	421	148

Stop Event

1×

saturated

Calls

Call 1

Inputs
(-.f64 (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))))
(-.f64 (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal 1 binary64))) (/.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 #s(literal 1 binary64) (-.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 #s(literal 1 binary64) (-.f64 (neg.f64 x) #s(literal 1 binary64)))))

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

Symmetry

(abs x)

explain88.0ms (8.7%)

FPErrors

Click to see full error table

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

Results

37.0ms	364×	256	valid
15.0ms	120×	512	valid
5.0ms	28×	1024	valid

Compiler

Compiled 74 to 23 computations (68.9% saved)

Precisions

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

ival-add: 15.0ms (46% of total)

ival-div: 10.0ms (30.7% of total)

ival-sub: 7.0ms (21.5% of total)

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

Compiler

Compiled 24 to 14 computations (41.7% saved)

simplify6.0ms (0.5%)

Algorithm

1×	egg-herbie

Rules

34×	`unsub-neg`
18×	`neg-mul-1`
7×	`sub-neg`
7×	`distribute-neg-out`
7×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	37
1	22	37
2	32	37
3	45	37
4	67	37
5	87	37
6	102	37
7	130	37
8	153	37

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness0.0ms (0%)

Stop Event

1×

fuel

Compiler

Compiled 12 to 7 computations (41.7% saved)

preprocess17.0ms (1.7%)

Remove: (abs x)
Compiler: Compiled 96 to 56 computations (41.7% saved)

Asymptote A

analyze3.0ms (0.3%)

sample841.0ms (83%)

preprocess58.0ms (5.7%)

explain88.0ms (8.7%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify6.0ms (0.5%)

soundness0.0ms (0%)

preprocess17.0ms (1.7%)

end0.0ms (0%)

Profiling