Metrics for math.log/1 on complex, imaginary part

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated

analyze1.0ms (0.1%)

Memory

3.8MiB live, 3.8MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
50%	50%	50%	0.1%	0%	0%	0%	2
75%	74.9%	25%	0.1%	0%	0%	0%	3
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	4
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	5
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	6
98.4%	98.3%	1.6%	0.1%	0%	0%	0%	7
99.2%	99.1%	0.8%	0.1%	0%	0%	0%	8
99.6%	99.5%	0.4%	0.1%	0%	0%	0%	9
99.8%	99.7%	0.2%	0.1%	0%	0%	0%	10
99.9%	99.8%	0.1%	0.1%	0%	0%	0%	11
100%	99.9%	0%	0.1%	0%	0%	0%	12

Compiler

Compiled 5 to 5 computations (0% saved)

sample705.0ms (71.7%)

Memory

20.1MiB live, 666.9MiB allocated

Samples

508.0ms

8 256×

valid

Precisions

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

ival-atan2: 140.0ms (94% of total)

ival-true: 6.0ms (4% of total)

ival-assert: 3.0ms (2% of total)

Bogosity

explain126.0ms (12.8%)

Memory

-4.6MiB live, 33.1MiB allocated

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`re`
-	-	`(atan2.f64 im re)`
-	-	`im`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

113.0ms

512×

valid

Compiler

Compiled 17 to 13 computations (23.5% saved)

Precisions

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

ival-atan2: 102.0ms (99% of total)

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

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

preprocess15.0ms (1.5%)

Memory

-22.5MiB live, 16.2MiB allocated

Algorithm

1×	egg-herbie

Rules

24×	`sub-neg`
16×	`+-commutative`
8×	`*-commutative`
8×	`associate--r+`
8×	`--rgt-identity`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	21
1	19	21
2	27	21
3	32	21
4	40	21
5	53	21
6	64	21
0	3	3
0	4	3
0	4	3

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(atan2.f64 im re)

Outputs
(atan2.f64 im re)

Compiler

Compiled 3 to 3 computations (0% saved)

eval0.0ms (0%)

Memory: 0.2MiB live, 0.2MiB allocated
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(atan2.f64 im re)

Compiler

Compiled 3 to 3 computations (0% saved)

simplify3.0ms (0.3%)

Memory

1.2MiB live, 1.2MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(atan2.f64 im re)

Rules

2×	`lower-atan2.f32`
2×	`lift-atan2.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	5
0	4	5
0	4	5

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

Inputs
(atan2.f64 im re)
im
re

Outputs
(atan2.f64 im re)
im
re

localize10.0ms (1%)

Memory

4.2MiB live, 4.2MiB allocated

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
accuracy	0	(atan2.f64 im re)

Samples

7.0ms

256×

valid

Compiler

Compiled 7 to 5 computations (28.6% saved)

Precisions

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

ival-atan2: 2.0ms (89.1% of total)

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

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

series1.0ms (0.1%)

Memory

0.3MiB live, 0.3MiB allocated

Counts

1 → 24

Calls

Call 1

Inputs
#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())

Outputs
#s(alt (atan2 im re) (taylor 0 re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor 0 re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor 0 re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor 0 re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor inf re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor inf re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor inf re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor inf re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor -inf re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor -inf re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor -inf re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor -inf re) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor 0 im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor 0 im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor 0 im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor 0 im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor inf im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor inf im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor inf im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor inf im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor -inf im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor -inf im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor -inf im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())
#s(alt (atan2 im re) (taylor -inf im) (#s(alt (atan2.f64 im re) (patch (atan2.f64 im re) #<representation binary64>) () ())) ())

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	re	@	0	((atan2 im re))
0.0ms	re	@	-inf	((atan2 im re))
0.0ms	im	@	-inf	((atan2 im re))
0.0ms	re	@	inf	((atan2 im re))
0.0ms	im	@	inf	((atan2 im re))

simplify3.0ms (0.3%)

Memory

0.7MiB live, 0.7MiB allocated

Algorithm

1×	egg-herbie

Rules

2×	`lower-atan2.f64`
2×	`lower-atan2.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	72
0	3	72

Stop Event

1×	iter limit
1×	saturated

Counts

24 → 24

Calls

Call 1

Inputs
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)
(atan2 im re)

Outputs
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)
(atan2 im re)
(atan2.f64 im re)

rewrite13.0ms (1.3%)

Memory

5.8MiB live, 5.8MiB allocated

Rules

2×	`lift-atan2.f64`
2×	`lower-atan2.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	3
0	4	3
0	4	3

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

1 → 1

Calls

Call 1

Inputs
(atan2.f64 im re)

Outputs
(atan2.f64 im re)

eval2.0ms (0.2%)

Memory: 2.2MiB live, 2.2MiB allocated
Compiler: Compiled 99 to 4 computations (96% saved)

prune2.0ms (0.2%)

Memory

2.6MiB live, 2.6MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	25	0	25
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	25	1	26

Accuracy

100.0%

Counts

26 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(atan2.f64 im re)

Compiler

Compiled 6 to 6 computations (0% saved)

simplify56.0ms (5.7%)

Memory

-6.1MiB live, 31.8MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	3

Stop Event

1×

saturated

Calls

Call 1

Inputs
(atan2.f64 im re)

Outputs
(atan2.f64 im re)

soundness0.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated

Stop Event

1×

done

Compiler

Compiled 3 to 3 computations (0% saved)

preprocess46.0ms (4.7%)

Memory: -7.7MiB live, 33.8MiB allocated
Compiler: Compiled 12 to 12 computations (0% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

start0.0ms (0%)

analyze1.0ms (0.1%)

sample705.0ms (71.7%)

explain126.0ms (12.8%)

preprocess15.0ms (1.5%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify3.0ms (0.3%)

localize10.0ms (1%)

series1.0ms (0.1%)

simplify3.0ms (0.3%)

rewrite13.0ms (1.3%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

simplify56.0ms (5.7%)

soundness0.0ms (0%)

preprocess46.0ms (4.7%)

end0.0ms (0%)

Profiling