Equirectangular approximation to distance on a great circle
Time bar (total: 2.4s)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 99.8% | 0.2% | 0% | 0% | 0% | 0 |
| 100% | 99.8% | 0% | 0.2% | 0% | 0% | 0% | 1 |
Compiled 34 to 16 computations (52.9% saved)
| 16.0ms | 203× | 0 | valid |
| 12.0ms | 57× | 1 | valid |
ival-hypot: 4.0ms (19.6% of total)ival-mult: 4.0ms (19.6% of total)ival-cos: 3.0ms (14.7% of total)ival-div: 2.0ms (9.8% of total)adjust: 2.0ms (9.8% of total)ival-sub: 2.0ms (9.8% of total)ival-add: 1.0ms (4.9% of total)ival-assert: 0.0ms (0% of total)ival-true: 0.0ms (0% of total)exact: 0.0ms (0% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 179 | 0 | - | 0 | - | (sqrt.f64 (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2)))) |
| 68 | 120 | (1.7362238785048344e-180 -4.940531590232191e+205 2.8571397642418315e+127 5.4290405588285114e-30 -1.4925522903176782e+161) | 0 | - | (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))) |
| 0 | 0 | - | 0 | - | (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) |
| 0 | 0 | - | 0 | - | lambda2 |
| 0 | 0 | - | 0 | - | (+.f64 phi1 phi2) |
| 0 | 0 | - | 0 | - | phi2 |
| 0 | 0 | - | 0 | - | (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2))) |
| 0 | 0 | - | 0 | - | (-.f64 lambda1 lambda2) |
| 0 | 0 | - | 0 | - | (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2)) |
| 0 | 0 | - | 0 | - | R |
| 0 | 0 | - | 0 | - | lambda1 |
| 0 | 0 | - | 0 | - | phi1 |
| 0 | 0 | - | 0 | - | (*.f64 R (sqrt.f64 (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2))))) |
| 0 | 0 | - | 0 | - | #s(literal 2 binary64) |
| 0 | 0 | - | 0 | - | (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)) |
| 0 | 0 | - | 0 | - | (-.f64 phi1 phi2) |
| 0 | 0 | - | 0 | - | (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) |
| Operator | Subexpression | Explanation | Count | |
|---|---|---|---|---|
cos.f64 | (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))) | sensitivity | 188 | 0 |
sqrt.f64 | (sqrt.f64 (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2)))) | oflow-rescue | 179 | 0 |
| ↳ | (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2)) | overflow | 111 | |
| ↳ | (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) | overflow | 110 | |
| ↳ | (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2))) | overflow | 179 |
| Predicted + | Predicted - | |
|---|---|---|
| + | 106 | 0 |
| - | 112 | 38 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 106 | 0 | 0 |
| - | 112 | 0 | 38 |
| number | freq |
|---|---|
| 0 | 38 |
| 1 | 69 |
| 2 | 149 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 1 | 0 | 0 |
| - | 0 | 0 | 0 |
| 664.0ms | 2 172× | 1 | valid |
| 102.0ms | 900× | 0 | valid |
Compiled 5 988 to 840 computations (86% saved)
ival-cos: 131.0ms (22.8% of total)ival-mult: 129.0ms (22.5% of total)adjust: 110.0ms (19.1% of total)ival-hypot: 74.0ms (12.9% of total)ival-add: 46.0ms (8% of total)ival-sub: 45.0ms (7.8% of total)ival-div: 34.0ms (5.9% of total)ival-true: 3.0ms (0.5% of total)exact: 2.0ms (0.3% of total)ival-assert: 1.0ms (0.2% of total)| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 149 | 667 |
| 1 | 357 | 661 |
| 2 | 923 | 645 |
| 3 | 4473 | 645 |
| 4 | 7816 | 645 |
| 0 | 17 | 32 |
| 0 | 28 | 32 |
| 1 | 43 | 32 |
| 2 | 88 | 32 |
| 3 | 302 | 32 |
| 4 | 1055 | 32 |
| 5 | 3348 | 32 |
| 6 | 6812 | 32 |
| 0 | 8149 | 16 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
(*.f64 R (sqrt.f64 (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2))))) |
| Outputs |
|---|
(*.f64 R (sqrt.f64 (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2))))) |
(*.f64 (hypot.f64 (-.f64 phi2 phi1) (*.f64 (cos.f64 (/.f64 (+.f64 phi2 phi1) #s(literal 2 binary64))) (-.f64 lambda1 lambda2))) R) |
(negabs R)
(sort lambda1 lambda2)
(sort phi1 phi2)
Compiled 32 to 17 computations (46.9% saved)
Compiled 0 to 5 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| 60.8% | (*.f64 R (sqrt.f64 (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2))))) |
Compiled 64 to 34 computations (46.9% saved)
| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 17 | 32 |
| 1 | 25 | 32 |
| 2 | 33 | 32 |
| 3 | 37 | 32 |
| 4 | 39 | 32 |
| 1× | saturated |
| Inputs |
|---|
(*.f64 R (sqrt.f64 (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2))))) |
| Outputs |
|---|
(*.f64 R (sqrt.f64 (+.f64 (*.f64 (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64)))) (*.f64 (-.f64 lambda1 lambda2) (cos.f64 (/.f64 (+.f64 phi1 phi2) #s(literal 2 binary64))))) (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2))))) |
(*.f64 (sqrt.f64 (+.f64 (*.f64 (-.f64 phi1 phi2) (-.f64 phi1 phi2)) (*.f64 (*.f64 (cos.f64 (/.f64 (+.f64 phi2 phi1) #s(literal 2 binary64))) (-.f64 lambda1 lambda2)) (*.f64 (cos.f64 (/.f64 (+.f64 phi2 phi1) #s(literal 2 binary64))) (-.f64 lambda1 lambda2))))) R) |
| 1× | fuel |
Compiled 32 to 17 computations (46.9% saved)
(sort phi1 phi2)
(sort lambda1 lambda2)
(negabs R)
Compiled 512 to 272 computations (46.9% saved)
Loading profile data...