Metrics for math.sin on complex, real part

analyze0.0ms (0%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 15 to 12 computations (20% saved)

Precisions

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

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

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

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

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

const: 0.0ms (0% of total)

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

sample1.1s (74.8%)

Results

922.0ms

8256×

256

valid

Precisions

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

ival-sin: 257.0ms (37.4% of total)

ival-mult: 142.0ms (20.6% of total)

ival-exp: 122.0ms (17.7% of total)

ival-add: 93.0ms (13.5% of total)

ival-sub: 61.0ms (8.9% of total)

const: 13.0ms (1.9% of total)

Bogosity

preprocess257.0ms (16.8%)

Algorithm

1×	egg-herbie

Rules

989×	`fma-neg`
725×	`fma-define`
264×	`times-frac`
215×	`distribute-lft-neg-in`
170×	`unsub-neg`

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	36	316
1	111	308
2	397	308
3	986	298
4	1988	294
5	3213	294
6	3708	294
7	4185	294
8	4839	294
9	4992	294
10	5009	294
11	5009	294
12	5041	294
13	5070	294
14	5070	294

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 (neg.f64 re))) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) (neg.f64 im))) (exp.f64 (neg.f64 im))))
(neg.f64 (.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 (neg.f64 re))) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))))
(neg.f64 (.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) (neg.f64 im))) (exp.f64 (neg.f64 im)))))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 im)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) re)) (exp.f64 re)))

Outputs
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))
(*.f64 (sin.f64 re) (fma.f64 #s(literal 1/2 binary64) (exp.f64 im) (/.f64 #s(literal 1/2 binary64) (exp.f64 im))))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))
(*.f64 (sin.f64 re) (fma.f64 #s(literal 1/2 binary64) (exp.f64 im) (/.f64 #s(literal 1/2 binary64) (exp.f64 im))))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 (neg.f64 re))) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))
(.f64 #s(literal 1/2 binary64) (.f64 (neg.f64 (sin.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))))
(.f64 (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)) (.f64 (sin.f64 re) #s(literal -1/2 binary64)))
(.f64 (sin.f64 re) (.f64 #s(literal -1/2 binary64) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))))
(*.f64 (sin.f64 re) (fma.f64 (exp.f64 im) #s(literal -1/2 binary64) (/.f64 #s(literal -1/2 binary64) (exp.f64 im))))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) (neg.f64 im))) (exp.f64 (neg.f64 im))))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))
(*.f64 (sin.f64 re) (fma.f64 #s(literal 1/2 binary64) (exp.f64 im) (/.f64 #s(literal 1/2 binary64) (exp.f64 im))))
(neg.f64 (.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 (neg.f64 re))) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))
(*.f64 (sin.f64 re) (fma.f64 #s(literal 1/2 binary64) (exp.f64 im) (/.f64 #s(literal 1/2 binary64) (exp.f64 im))))
(neg.f64 (.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) (neg.f64 im))) (exp.f64 (neg.f64 im)))))
(.f64 #s(literal 1/2 binary64) (.f64 (neg.f64 (sin.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))))
(.f64 (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)) (.f64 (sin.f64 re) #s(literal -1/2 binary64)))
(.f64 (sin.f64 re) (.f64 #s(literal -1/2 binary64) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im))))
(*.f64 (sin.f64 re) (fma.f64 (exp.f64 im) #s(literal -1/2 binary64) (/.f64 #s(literal -1/2 binary64) (exp.f64 im))))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 im)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) re)) (exp.f64 re)))
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 im)) (+.f64 (exp.f64 (neg.f64 re)) (exp.f64 re)))
(.f64 (sin.f64 im) (.f64 #s(literal 1/2 binary64) (+.f64 (exp.f64 (neg.f64 re)) (exp.f64 re))))
(*.f64 (sin.f64 im) (fma.f64 #s(literal 1/2 binary64) (exp.f64 re) (/.f64 #s(literal 1/2 binary64) (exp.f64 re))))

Symmetry

(abs im)

(negabs re)

explain100.0ms (6.5%)

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
1	0	-	-	`(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))`
0	1	(1.4541323768118142e+304 590.3382162669861)	-	`(exp.f64 (-.f64 #s(literal 0 binary64) im))`
0	0	-	-	`#s(literal 1/2 binary64)`
0	0	-	-	`re`
0	0	-	-	`(*.f64 #s(literal 1/2 binary64) (sin.f64 re))`
0	0	-	-	`(-.f64 #s(literal 0 binary64) im)`
0	0	-	-	`im`
0	0	-	-	`#s(literal 0 binary64)`
0	0	-	-	`(sin.f64 re)`
0	0	-	-	`(+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im))`
0	0	-	-	`(exp.f64 im)`

Results

62.0ms

512×

256

valid

Compiler

Compiled 96 to 35 computations (63.5% saved)

Precisions

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

ival-sin: 14.0ms (40.9% of total)

ival-mult: 8.0ms (23.4% of total)

ival-exp: 7.0ms (20.4% of total)

ival-add: 3.0ms (8.8% of total)

ival-sub: 2.0ms (5.8% of total)

const: 1.0ms (2.9% of total)

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
	99.6%	(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

Compiler

Compiled 28 to 22 computations (21.4% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

3×	`*-commutative`
2×	`+-commutative`
1×	`sub-neg`
1×	`sub0-neg`
1×	`neg-mul-1`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	44
1	23	44
2	26	44
3	27	44

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 (.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

Outputs

(*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (-.f64 #s(literal 0 binary64) im)) (exp.f64 im)))

(*.f64 (*.f64 #s(literal 1/2 binary64) (sin.f64 re)) (+.f64 (exp.f64 (neg.f64 im)) (exp.f64 im)))

soundness0.0ms (0%)

Stop Event

1×

fuel

Compiler

Compiled 13 to 10 computations (23.1% saved)

preprocess25.0ms (1.6%)

Remove

(negabs re)

(abs im)

Compiler

Compiled 158 to 122 computations (22.8% saved)

math.sin on complex, real part

analyze0.0ms (0%)

sample1.1s (74.8%)

preprocess257.0ms (16.8%)

explain100.0ms (6.5%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify2.0ms (0.1%)

soundness0.0ms (0%)

preprocess25.0ms (1.6%)

end0.0ms (0%)

Profiling