
Time bar (total: 1.2s)
| 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 |
Compiled 8 to 8 computations (0% saved)
| 466.0ms | 8 256× | 0 | valid |
ival-log: 139.0ms (48.3% of total)ival-atan2: 79.0ms (27.5% of total)ival-div: 55.0ms (19.1% of total)ival-true: 6.0ms (2.1% of total)exact: 6.0ms (2.1% of total)ival-assert: 3.0ms (1% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | (/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
| 0 | 0 | - | 0 | - | (log.f64 #s(literal 10 binary64)) |
| 0 | 0 | - | 0 | - | re |
| 0 | 0 | - | 0 | - | (atan2.f64 im re) |
| 0 | 0 | - | 0 | - | im |
| 0 | 0 | - | 0 | - | #s(literal 10 binary64) |
| Predicted + | Predicted - | |
|---|---|---|
| + | 0 | 0 |
| - | 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 256 |
| number | freq |
|---|---|
| 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 1 |
| 28.0ms | 512× | 0 | valid |
Compiled 38 to 22 computations (42.1% saved)
ival-log: 6.0ms (39.8% of total)ival-atan2: 4.0ms (26.5% of total)ival-div: 3.0ms (19.9% of total)ival-true: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 14 | 36 |
| 1 | 21 | 36 |
| 0 | 6 | 6 |
| 0 | 9 | 6 |
| 0 | 9 | 6 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
| Outputs |
|---|
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
Compiled 6 to 6 computations (0% saved)
Compiled 0 to 2 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 98.7% | (/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
Compiled 6 to 6 computations (0% saved)
| 1× | egg-herbie |
Found 3 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (log.f64 #s(literal 10 binary64)) | |
| cost-diff | 0 | (atan2.f64 im re) | |
| cost-diff | 0 | (/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 14 |
| 0 | 9 | 14 |
| 0 | 9 | 14 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
(atan2.f64 im re) |
im |
re |
(log.f64 #s(literal 10 binary64)) |
#s(literal 10 binary64) |
| Outputs |
|---|
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
(atan2.f64 im re) |
im |
re |
(log.f64 #s(literal 10 binary64)) |
#s(literal 10 binary64) |
Found 3 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0.0 | (atan2.f64 im re) | |
| accuracy | 0.0 | (log.f64 #s(literal 10 binary64)) | |
| accuracy | 0.8466987793053261 | (/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
| 48.0ms | 256× | 0 | valid |
Compiled 16 to 8 computations (50% saved)
ival-div: 35.0ms (83.9% of total)ival-atan2: 3.0ms (7.2% of total)ival-log: 3.0ms (7.2% of total)ival-true: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Inputs |
|---|
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
(atan2.f64 im re) |
(log.f64 #s(literal 10 binary64)) |
| Outputs |
|---|
(/ (atan2 im re) (log 10)) |
(atan2 im re) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 40.0ms | re | @ | 0 | ((/ (atan2 im re) (log 10)) (atan2 im re) (log 10)) |
| 37.0ms | im | @ | -inf | ((/ (atan2 im re) (log 10)) (atan2 im re) (log 10)) |
| 9.0ms | re | @ | inf | ((/ (atan2 im re) (log 10)) (atan2 im re) (log 10)) |
| 6.0ms | im | @ | inf | ((/ (atan2 im re) (log 10)) (atan2 im re) (log 10)) |
| 6.0ms | re | @ | -inf | ((/ (atan2 im re) (log 10)) (atan2 im re) (log 10)) |
| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 9 |
| 0 | 6 | 9 |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(/ (atan2 im re) (log 10)) |
(atan2 im re) |
| Outputs |
|---|
(/ (atan2 im re) (log 10)) |
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
(atan2 im re) |
(atan2.f64 im re) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 11 |
| 0 | 9 | 11 |
| 1 | 12 | 11 |
| 2 | 23 | 11 |
| 3 | 33 | 11 |
| 4 | 34 | 11 |
| 0 | 34 | 11 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
(atan2.f64 im re) |
(log.f64 #s(literal 10 binary64)) |
| Outputs |
|---|
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
(/.f64 (neg.f64 (atan2.f64 im re)) (log.f64 #s(literal 1/10 binary64))) |
(neg.f64 (/.f64 (atan2.f64 im re) (log.f64 #s(literal 1/10 binary64)))) |
(atan2.f64 im re) |
(neg.f64 (neg.f64 (atan2.f64 im re))) |
(neg.f64 (log.f64 #s(literal 1/10 binary64))) |
(log.f64 #s(literal 10 binary64)) |
Compiled 70 to 23 computations (67.1% saved)
2 alts after pruning (1 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 8 | 1 | 9 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 8 | 2 | 10 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 99.7% | (/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) |
| ✓ | 98.7% | (/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
Compiled 13 to 13 computations (0% saved)
| 1× | egg-herbie |
Found 4 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (log.f64 #s(literal 1/10 binary64)) | |
| cost-diff | 0 | (neg.f64 (log.f64 #s(literal 1/10 binary64))) | |
| cost-diff | 0 | (atan2.f64 im re) | |
| cost-diff | 0 | (/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 7 | 18 |
| 0 | 11 | 18 |
| 1 | 13 | 18 |
| 2 | 15 | 18 |
| 0 | 15 | 18 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) |
(atan2.f64 im re) |
im |
re |
(neg.f64 (log.f64 #s(literal 1/10 binary64))) |
(log.f64 #s(literal 1/10 binary64)) |
#s(literal 1/10 binary64) |
| Outputs |
|---|
(/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) |
(atan2.f64 im re) |
im |
re |
(neg.f64 (log.f64 #s(literal 1/10 binary64))) |
(log.f64 #s(literal 1/10 binary64)) |
#s(literal 1/10 binary64) |
Found 4 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0.0 | (atan2.f64 im re) | |
| accuracy | 0.0 | (neg.f64 (log.f64 #s(literal 1/10 binary64))) | |
| accuracy | 0.8466987793053261 | (/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) | |
| accuracy | 1.0 | (log.f64 #s(literal 1/10 binary64)) |
| 20.0ms | 256× | 0 | valid |
Compiled 20 to 9 computations (55% saved)
ival-log: 3.0ms (24.5% of total)const: 3.0ms (24.5% of total)ival-atan2: 2.0ms (16.3% of total)ival-div: 2.0ms (16.3% of total)ival-neg: 1.0ms (8.2% of total)ival-true: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Inputs |
|---|
(/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) |
(atan2.f64 im re) |
(neg.f64 (log.f64 #s(literal 1/10 binary64))) |
(log.f64 #s(literal 1/10 binary64)) |
| Outputs |
|---|
(* -1 (/ (atan2 im re) (log 1/10))) |
(atan2 im re) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 20.0ms | re | @ | inf | ((/ (atan2 im re) (neg (log 1/10))) (atan2 im re) (neg (log 1/10)) (log 1/10)) |
| 17.0ms | re | @ | 0 | ((/ (atan2 im re) (neg (log 1/10))) (atan2 im re) (neg (log 1/10)) (log 1/10)) |
| 13.0ms | im | @ | -inf | ((/ (atan2 im re) (neg (log 1/10))) (atan2 im re) (neg (log 1/10)) (log 1/10)) |
| 6.0ms | im | @ | inf | ((/ (atan2 im re) (neg (log 1/10))) (atan2 im re) (neg (log 1/10)) (log 1/10)) |
| 6.0ms | re | @ | -inf | ((/ (atan2 im re) (neg (log 1/10))) (atan2 im re) (neg (log 1/10)) (log 1/10)) |
| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 8 | 10 |
| 1 | 12 | 10 |
| 2 | 18 | 10 |
| 3 | 20 | 10 |
| 4 | 21 | 10 |
| 0 | 21 | 10 |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(* -1 (/ (atan2 im re) (log 1/10))) |
(atan2 im re) |
| Outputs |
|---|
(* -1 (/ (atan2 im re) (log 1/10))) |
(/.f64 (neg.f64 (atan2.f64 im re)) (log.f64 #s(literal 1/10 binary64))) |
(atan2 im re) |
(atan2.f64 im re) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 7 | 15 |
| 0 | 11 | 13 |
| 1 | 20 | 13 |
| 2 | 28 | 13 |
| 3 | 33 | 13 |
| 0 | 33 | 13 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) |
(atan2.f64 im re) |
(neg.f64 (log.f64 #s(literal 1/10 binary64))) |
(log.f64 #s(literal 1/10 binary64)) |
| Outputs |
|---|
(/.f64 (neg.f64 (atan2.f64 im re)) (log.f64 #s(literal 1/10 binary64))) |
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
(neg.f64 (/.f64 (atan2.f64 im re) (log.f64 #s(literal 1/10 binary64)))) |
(atan2.f64 im re) |
(neg.f64 (neg.f64 (atan2.f64 im re))) |
(neg.f64 (log.f64 #s(literal 1/10 binary64))) |
(log.f64 #s(literal 10 binary64)) |
(neg.f64 (log.f64 #s(literal 10 binary64))) |
(log.f64 #s(literal 1/10 binary64)) |
Compiled 90 to 27 computations (70% saved)
2 alts after pruning (0 fresh and 2 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 11 | 0 | 11 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 1 | 1 |
| Total | 11 | 2 | 13 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 99.7% | (/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) |
| ✓ | 98.7% | (/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
Compiled 26 to 23 computations (11.5% saved)
| Inputs |
|---|
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
(/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) |
| Outputs |
|---|
(/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) |
4 calls:
| 1.0ms | re |
| 1.0ms | im |
| 1.0ms | (/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
| 1.0ms | (atan2.f64 im re) |
| Accuracy | Segments | Branch |
|---|---|---|
| 99.7% | 1 | re |
| 99.7% | 1 | im |
| 99.7% | 1 | (/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
| 99.7% | 1 | (atan2.f64 im re) |
Compiled 11 to 13 computations (-18.2% saved)
Total 0.0b remaining (0%)
Threshold costs 0b (0%)
| Inputs |
|---|
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
| Outputs |
|---|
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
4 calls:
| 17.0ms | re |
| 1.0ms | im |
| 1.0ms | (/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
| 1.0ms | (atan2.f64 im re) |
| Accuracy | Segments | Branch |
|---|---|---|
| 98.7% | 1 | re |
| 98.7% | 1 | im |
| 98.7% | 1 | (/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
| 98.7% | 1 | (atan2.f64 im re) |
Compiled 11 to 13 computations (-18.2% saved)
| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 10 | 13 |
| 1 | 17 | 13 |
| 2 | 23 | 13 |
| 3 | 27 | 13 |
| 4 | 28 | 13 |
| 1× | saturated |
| Inputs |
|---|
(/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) |
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
| Outputs |
|---|
(/.f64 (atan2.f64 im re) (neg.f64 (log.f64 #s(literal 1/10 binary64)))) |
(/.f64 (atan2.f64 im re) (log.f64 #s(literal 10 binary64))) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 11 |
| 0 | 9 | 11 |
| 1 | 12 | 11 |
| 2 | 23 | 11 |
| 3 | 33 | 11 |
| 4 | 34 | 11 |
| 0 | 34 | 11 |
| 1× | done |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
Compiled 26 to 20 computations (23.1% saved)
Compiled 38 to 32 computations (15.8% saved)
Loading profile data...