
Time bar (total: 735.0ms)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 50% | 50% | 0% | 0% | 0% | 0 |
| 100% | 50% | 0% | 50% | 0% | 0% | 0% | 1 |
Compiled 9 to 6 computations (33.3% saved)
| 215.0ms | 8 256× | 0 | valid |
ival-expm1: 74.0ms (98.7% of total)adjust: 1.0ms (1.3% of total)Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 8 | 14 |
| 1 | 29 | 14 |
| 2 | 94 | 14 |
| 3 | 554 | 14 |
| 1× | node-limit |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 8.5% | (-.f64 (exp.f64 x) #s(literal 1 binary64)) |
Compiled 8 to 8 computations (0% saved)
| Inputs |
|---|
(-.f64 (exp.f64 x) #s(literal 1 binary64)) |
(exp.f64 x) |
x |
#s(literal 1 binary64) |
| Outputs |
|---|
#s(approx (- (exp x) 1) #s(hole binary64 x)) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* 1/2 x))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* x (+ 1/6 (* 1/24 x))))))))) |
#s(approx (exp x) #s(hole binary64 1)) |
#s(approx (exp x) #s(hole binary64 (+ 1 x))) |
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* 1/2 x)))))) |
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* x (+ 1/2 (* 1/6 x)))))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (- (exp x) 1))) |
#s(approx (exp x) #s(hole binary64 (exp x))) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 0.0ms | x | @ | -inf | ((- (exp x) 1) (exp x) x 1) |
| 0.0ms | x | @ | inf | ((- (exp x) 1) (exp x) x 1) |
| 0.0ms | x | @ | 0 | ((- (exp x) 1) (exp x) x 1) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 37 | 114 |
| 0 | 39 | 114 |
| 1 | 262 | 114 |
| 2 | 1808 | 114 |
| 1× | iter-limit |
| 1× | unsound |
| 1× | node-limit |
| 1× | iter-limit |
| Inputs |
|---|
(-.f64 (exp.f64 x) #s(literal 1 binary64)) |
(exp.f64 x) |
x |
#s(literal 1 binary64) |
#s(approx (- (exp x) 1) #s(hole binary64 x)) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* 1/2 x))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* x (+ 1/6 (* 1/24 x))))))))) |
#s(approx (exp x) #s(hole binary64 1)) |
#s(approx (exp x) #s(hole binary64 (+ 1 x))) |
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* 1/2 x)))))) |
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* x (+ 1/2 (* 1/6 x)))))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (- (exp x) 1))) |
#s(approx (exp x) #s(hole binary64 (exp x))) |
| Outputs |
|---|
(-.f64 (exp.f64 x) #s(literal 1 binary64)) |
(exp.f64 x) |
x |
#s(literal 1 binary64) |
#s(approx (- (exp x) 1) x) |
#s(approx (exp x) #s(literal 1 binary64)) |
#s(approx (- (exp x) 1) (-.f64 (exp.f64 x) #s(literal 1 binary64))) |
#s(approx (exp x) (exp.f64 x)) |
Compiled 18 to 13 computations (27.8% saved)
2 alts after pruning (1 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 3 | 1 | 4 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 3 | 2 | 5 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 8.5% | (-.f64 (exp.f64 x) #s(literal 1 binary64)) |
| ▶ | 98.0% | #s(approx (- (exp x) 1) x) |
Compiled 9 to 9 computations (0% saved)
| Inputs |
|---|
#s(approx (- (exp x) 1) x) |
x |
| Outputs |
|---|
#s(approx (- (exp x) 1) #s(hole binary64 x)) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* 1/2 x))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* x (+ 1/6 (* 1/24 x))))))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (- (exp x) 1))) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 0.0ms | x | @ | -inf | ((- (exp x) 1) x) |
| 0.0ms | x | @ | inf | ((- (exp x) 1) x) |
| 0.0ms | x | @ | 0 | ((- (exp x) 1) x) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 27 | 70 |
| 0 | 27 | 70 |
| 1 | 205 | 70 |
| 2 | 1391 | 70 |
| 1× | iter-limit |
| 1× | unsound |
| 1× | node-limit |
| 1× | saturated |
| Inputs |
|---|
#s(approx (- (exp x) 1) x) |
x |
#s(approx (- (exp x) 1) #s(hole binary64 x)) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* 1/2 x))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (* x (+ 1 (* x (+ 1/2 (* x (+ 1/6 (* 1/24 x))))))))) |
#s(approx (- (exp x) 1) #s(hole binary64 (- (exp x) 1))) |
| Outputs |
|---|
#s(approx (- (exp x) 1) x) |
x |
#s(approx (- (exp x) 1) x) |
Compiled 0 to 1 computations (-∞% saved)
2 alts after pruning (0 fresh and 2 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 0 | 0 | 0 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 1 | 1 |
| Total | 0 | 2 | 2 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 8.5% | (-.f64 (exp.f64 x) #s(literal 1 binary64)) |
| ✓ | 98.0% | #s(approx (- (exp x) 1) x) |
Compiled 17 to 17 computations (0% saved)
Total -57.9b remaining (-4468.2%)
Threshold costs -57.9b (-4468.2%)
| Inputs |
|---|
#s(approx (- (exp x) 1) x) |
(-.f64 (exp.f64 x) #s(literal 1 binary64)) |
| Outputs |
|---|
#s(approx (- (exp x) 1) x) |
3 calls:
| 1.0ms | x |
| 1.0ms | (-.f64 (exp.f64 x) #s(literal 1 binary64)) |
| 1.0ms | (exp.f64 x) |
| Accuracy | Segments | Branch |
|---|---|---|
| 98.0% | 1 | (exp.f64 x) |
| 98.0% | 1 | (-.f64 (exp.f64 x) #s(literal 1 binary64)) |
| 98.0% | 1 | x |
Compiled 7 to 7 computations (0% saved)
| 1× | done |
Compiled 5 to 5 computations (0% saved)
Compiled 11 to 11 computations (0% saved)
Loading profile data...