
Time bar (total: 759.0ms)
| 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 |
| 50% | 50% | 50% | 0% | 0% | 0% | 0% | 2 |
| 75% | 75% | 25% | 0% | 0% | 0% | 0% | 3 |
| 87.5% | 87.5% | 12.5% | 0% | 0% | 0% | 0% | 4 |
| 93.8% | 93.7% | 6.2% | 0% | 0% | 0% | 0% | 5 |
| 96.9% | 96.8% | 3.1% | 0% | 0% | 0% | 0% | 6 |
| 98.4% | 98.4% | 1.6% | 0% | 0% | 0% | 0% | 7 |
| 99.2% | 99.2% | 0.8% | 0% | 0% | 0% | 0% | 8 |
| 99.6% | 99.6% | 0.4% | 0% | 0% | 0% | 0% | 9 |
| 99.8% | 99.8% | 0.2% | 0% | 0% | 0% | 0% | 10 |
| 99.9% | 99.9% | 0.1% | 0% | 0% | 0% | 0% | 11 |
| 100% | 99.9% | 0% | 0% | 0% | 0% | 0% | 12 |
Compiled 7 to 6 computations (14.3% saved)
| 312.0ms | 8 255× | 0 | valid |
| 0.0ms | 1× | 1 | valid |
ival-div!: 79.0ms (58.7% of total)ival-mult!: 53.0ms (39.4% of total)adjust: 2.0ms (1.5% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 4 | 0 | - | 0 | - | (/.f64 #s(literal 1 binary64) (*.f64 x x)) |
| 0 | 0 | - | 0 | - | #s(literal 1 binary64) |
| 0 | 0 | - | 0 | - | (*.f64 x x) |
| 0 | 0 | - | 0 | - | x |
| Operator | Subexpression | Explanation | Count | |
|---|---|---|---|---|
/.f64 | (/.f64 #s(literal 1 binary64) (*.f64 x x)) | n/o | 4 | 0 |
| ↳ | (*.f64 x x) | overflow | 57 |
| Predicted + | Predicted - | |
|---|---|---|
| + | 4 | 0 |
| - | 0 | 252 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 4 | 0 | 0 |
| - | 0 | 0 | 252 |
| number | freq |
|---|---|
| 0 | 252 |
| 1 | 4 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 1 | 0 | 0 |
| - | 0 | 0 | 0 |
| 16.0ms | 512× | 0 | valid |
Compiled 29 to 16 computations (44.8% saved)
ival-mult!: 3.0ms (53.5% of total)ival-div!: 2.0ms (35.6% of total)adjust: 0.0ms (0% of total)Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 8 | 15 |
| 1 | 30 | 15 |
| 2 | 72 | 15 |
| 3 | 114 | 15 |
| 4 | 236 | 15 |
| 5 | 1307 | 15 |
| 6 | 7105 | 15 |
| 1× | node-limit |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 99.0% | (/.f64 #s(literal 1 binary64) (*.f64 x x)) |
(abs x)
Compiled 10 to 8 computations (20% saved)
| Inputs |
|---|
(/.f64 #s(literal 1 binary64) (*.f64 x x)) |
#s(literal 1 binary64) |
(*.f64 x x) |
x |
| Outputs |
|---|
#s(approx (/ 1 (* x x)) #s(hole binary64 (/ 1 (pow x 2)))) |
#s(approx (* x x) #s(hole binary64 (pow x 2))) |
#s(approx x #s(hole binary64 x)) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | x | @ | -inf | ((/ 1 (* x x)) 1 (* x x) x) |
| 1.0ms | x | @ | 0 | ((/ 1 (* x x)) 1 (* x x) x) |
| 1.0ms | x | @ | inf | ((/ 1 (* x x)) 1 (* x x) x) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 12 | 31 |
| 0 | 13 | 25 |
| 1 | 40 | 25 |
| 0 | 143 | 25 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | unsound |
| 1× | iter-limit |
| Inputs |
|---|
(/.f64 #s(literal 1 binary64) (*.f64 x x)) |
#s(literal 1 binary64) |
(*.f64 x x) |
x |
#s(approx (/ 1 (* x x)) #s(hole binary64 (/ 1 (pow x 2)))) |
#s(approx (* x x) #s(hole binary64 (pow x 2))) |
#s(approx x #s(hole binary64 x)) |
| Outputs |
|---|
(*.f64 (pow.f64 (*.f64 x x) #s(literal -1/2 binary64)) (pow.f64 (*.f64 x x) #s(literal -1/2 binary64))) |
(*.f64 (pow.f64 (neg.f64 x) #s(literal -1 binary64)) (pow.f64 (neg.f64 x) #s(literal -1 binary64))) |
(*.f64 (pow.f64 (fabs.f64 x) #s(literal -1 binary64)) (pow.f64 (fabs.f64 x) #s(literal -1 binary64))) |
(*.f64 (pow.f64 x #s(literal -1 binary64)) (pow.f64 x #s(literal -1 binary64))) |
(pow.f64 (*.f64 x x) #s(literal -1 binary64)) |
(pow.f64 x #s(literal -2 binary64)) |
(/.f64 (/.f64 #s(literal 1 binary64) (neg.f64 x)) (neg.f64 x)) |
(/.f64 (/.f64 #s(literal 1 binary64) (fabs.f64 x)) (fabs.f64 x)) |
(/.f64 (neg.f64 (pow.f64 x #s(literal -1 binary64))) (neg.f64 x)) |
(/.f64 (pow.f64 x #s(literal -1 binary64)) x) |
(/.f64 #s(literal -1 binary64) (*.f64 (neg.f64 x) x)) |
(/.f64 #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) (*.f64 x x))) |
(/.f64 #s(literal 1 binary64) (*.f64 x x)) |
(neg.f64 (/.f64 #s(literal -1 binary64) (*.f64 x x))) |
(neg.f64 (/.f64 #s(literal 1 binary64) (*.f64 (neg.f64 x) x))) |
(exp.f64 (-.f64 #s(literal 0 binary64) (*.f64 (log.f64 x) #s(literal 2 binary64)))) |
(exp.f64 (neg.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))) |
(exp.f64 (*.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)) #s(literal -1 binary64))) |
(exp.f64 (*.f64 (log.f64 (*.f64 x x)) #s(literal -1 binary64))) |
(exp.f64 (*.f64 (log.f64 x) #s(literal -2 binary64))) |
#s(literal 1 binary64) |
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x))) |
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x))) |
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x))) |
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x))) |
(*.f64 (neg.f64 x) (neg.f64 x)) |
(*.f64 (fabs.f64 x) (fabs.f64 x)) |
(*.f64 x x) |
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64)) |
(pow.f64 (neg.f64 x) #s(literal 2 binary64)) |
(pow.f64 (fabs.f64 x) #s(literal 2 binary64)) |
(pow.f64 (*.f64 x x) #s(literal 1 binary64)) |
(pow.f64 x #s(literal 2 binary64)) |
(neg.f64 (*.f64 (neg.f64 x) x)) |
(fabs.f64 (*.f64 x x)) |
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64))) |
(+.f64 (cosh.f64 (*.f64 (log.f64 x) #s(literal 2 binary64))) (sinh.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))) |
x |
#s(approx (/ 1 (* x x)) (pow.f64 x #s(literal -2 binary64))) |
#s(approx (* x x) (*.f64 x x)) |
#s(approx x x) |
Compiled 274 to 95 computations (65.3% saved)
1 alts after pruning (1 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 37 | 1 | 38 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 38 | 1 | 39 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (pow.f64 x #s(literal -2 binary64)) |
Compiled 3 to 3 computations (0% saved)
| Inputs |
|---|
(pow.f64 x #s(literal -2 binary64)) |
x |
#s(literal -2 binary64) |
| Outputs |
|---|
#s(approx (pow x -2) #s(hole binary64 (/ 1 (pow x 2)))) |
#s(approx x #s(hole binary64 x)) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 0.0ms | x | @ | 0 | ((pow x -2) x -2) |
| 0.0ms | x | @ | -inf | ((pow x -2) x -2) |
| 0.0ms | x | @ | inf | ((pow x -2) x -2) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 10 | 17 |
| 0 | 10 | 15 |
| 1 | 33 | 15 |
| 0 | 127 | 15 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | unsound |
| 1× | iter-limit |
| Inputs |
|---|
(pow.f64 x #s(literal -2 binary64)) |
x |
#s(literal -2 binary64) |
#s(approx (pow x -2) #s(hole binary64 (/ 1 (pow x 2)))) |
#s(approx x #s(hole binary64 x)) |
| Outputs |
|---|
(*.f64 (pow.f64 (*.f64 x x) #s(literal -1/2 binary64)) (pow.f64 (*.f64 x x) #s(literal -1/2 binary64))) |
(*.f64 (neg.f64 (pow.f64 x #s(literal -1 binary64))) (neg.f64 (pow.f64 x #s(literal -1 binary64)))) |
(*.f64 (fabs.f64 (pow.f64 x #s(literal -1 binary64))) (fabs.f64 (pow.f64 x #s(literal -1 binary64)))) |
(*.f64 (pow.f64 x #s(literal -1 binary64)) (pow.f64 x #s(literal -1 binary64))) |
(pow.f64 (exp.f64 (log.f64 x)) #s(literal -2 binary64)) |
(pow.f64 (pow.f64 x #s(literal -1 binary64)) #s(literal 2 binary64)) |
(pow.f64 (*.f64 x x) #s(literal -1 binary64)) |
(pow.f64 x #s(literal -2 binary64)) |
(/.f64 (pow.f64 x #s(literal -1 binary64)) x) |
(/.f64 #s(literal -1 binary64) (*.f64 (neg.f64 x) x)) |
(/.f64 #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) (*.f64 x x))) |
(/.f64 #s(literal 1 binary64) (neg.f64 (*.f64 (neg.f64 x) x))) |
(/.f64 #s(literal 1 binary64) (*.f64 x x)) |
(/.f64 #s(literal -2 binary64) (*.f64 #s(literal 2 binary64) (*.f64 (neg.f64 x) x))) |
(neg.f64 (/.f64 #s(literal -1 binary64) (*.f64 x x))) |
(neg.f64 (/.f64 #s(literal 1 binary64) (*.f64 (neg.f64 x) x))) |
(exp.f64 (-.f64 #s(literal 0 binary64) (*.f64 (log.f64 x) #s(literal 2 binary64)))) |
(exp.f64 (*.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)) #s(literal -1 binary64))) |
(exp.f64 (*.f64 (log.f64 (*.f64 x x)) #s(literal -1 binary64))) |
(exp.f64 (*.f64 (log.f64 x) #s(literal -2 binary64))) |
(+.f64 (cosh.f64 (*.f64 (log.f64 x) #s(literal -2 binary64))) (sinh.f64 (*.f64 (log.f64 x) #s(literal -2 binary64)))) |
x |
#s(literal -2 binary64) |
#s(approx (pow x -2) (pow.f64 x #s(literal -2 binary64))) |
#s(approx x x) |
Compiled 151 to 55 computations (63.6% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 22 | 0 | 22 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 22 | 1 | 23 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (pow.f64 x #s(literal -2 binary64)) |
Compiled 11 to 9 computations (18.2% saved)
Total -0.7b remaining (-∞%)
Threshold costs -0.7b (-∞%)
| Inputs |
|---|
(pow.f64 x #s(literal -2 binary64)) |
(/.f64 #s(literal 1 binary64) (*.f64 x x)) |
| Outputs |
|---|
(pow.f64 x #s(literal -2 binary64)) |
3 calls:
| 1.0ms | x |
| 1.0ms | (/.f64 #s(literal 1 binary64) (*.f64 x x)) |
| 1.0ms | (*.f64 x x) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | (*.f64 x x) |
| 100.0% | 1 | (/.f64 #s(literal 1 binary64) (*.f64 x x)) |
| 100.0% | 1 | x |
Compiled 9 to 7 computations (22.2% saved)
| 1× | done |
Compiled 3 to 3 computations (0% saved)
(abs x)
Compiled 22 to 20 computations (9.1% saved)
Loading profile data...