
Time bar (total: 540.0ms)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0.0% | 0.0% | 100.0% | 0.0% | 0.0% | 0.0% | 0.0% | 0 |
| 100.0% | 100.0% | 0.0% | 0.0% | 0.0% | 0.0% | 0.0% | 1 |
Compiled 7 to 6 computations (14.3% saved)
| 156.0ms | 8 256× | 0 | valid |
Add: 3.0ms (117.7% of total, 0.0 MiB)Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 9 | 12 |
| 1 | 46 | 9 |
| 2 | 134 | 9 |
| 3 | 491 | 9 |
| 4 | 3425 | 9 |
| 1× | node-limit |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64))) |
Compiled 2 to 10 computations (-400.0% saved)
| Inputs |
|---|
(/ 1 3) |
| Outputs |
|---|
#s(literal 6004799503160661/18014398509481984 binary64) |
| 0.0ms | 1× | 0 | valid |
Compiled 5 to 4 computations (20.0% saved)
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 17 | 31 |
| 1× | iter-limit |
| Inputs |
|---|
%3 = (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)) x #s(literal 1 binary64) #s(literal 3 binary64) %3 (+.f64 x %3) |
| Outputs |
|---|
%5 = (+ x 1/3) (approx x #s(literal 0 binary64)) (approx x x) (approx %5 #s(literal 1/3 binary64)) (approx %5 (+.f64 #s(literal 1/3 binary64) x)) (approx %5 (*.f64 x (+.f64 #s(literal 1 binary64) (*.f64 #s(literal 1/3 binary64) (/.f64 #s(literal 1 binary64) x))))) |
3 calls:
| Time | Variable | Point |
|---|---|---|
| 1.0ms | x | -inf |
| 1.0ms | x | inf |
| 0.0ms | x | 0 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 7 |
| 0 | 8 | 7 |
| 1 | 23 | 7 |
| 2 | 41 | 7 |
| 3 | 101 | 7 |
| 4 | 457 | 7 |
| 0 | 4079 | 7 |
| 0 | 4175 | 7 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | node-limit |
| 1× | iter-limit |
| Inputs |
|---|
%3 = (/.f64 #s(literal 1 binary64) #s(literal 3 binary64)) x #s(literal 1 binary64) #s(literal 3 binary64) %3 (+.f64 x %3) |
| Outputs |
|---|
%6 = (-.f64 #s(literal -1/3 binary64) x) %8 = (+.f64 #s(literal 1/3 binary64) x) %18 = (*.f64 x #s(literal 1 binary64)) x #s(literal 1 binary64) #s(literal 3 binary64) #s(literal 1/3 binary64) (*.f64 #s(literal -1 binary64) %6) (*.f64 #s(literal 1 binary64) %8) (pow.f64 %8 #s(literal 1 binary64)) (/.f64 #s(literal 1 binary64) (pow.f64 %8 #s(literal -1 binary64))) (neg.f64 %6) (fma.f64 x #s(literal 1 binary64) #s(literal 1/3 binary64)) (-.f64 #s(literal 1/3 binary64) (neg.f64 x)) (-.f64 x #s(literal -1/3 binary64)) (+.f64 %18 #s(literal 1/3 binary64)) (+.f64 #s(literal 1/3 binary64) %18) %8 (+.f64 x #s(literal 1/3 binary64)) |
Compiled 22 to 28 computations (-27.3% saved)
Compiled 7 to 18 computations (-157.1% saved)
2 alts after pruning (2 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 5 | 2 | 7 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 6 | 2 | 8 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (+.f64 x #s(literal 6004799503160661/18014398509481984 binary64)) |
| ▶ | 46.1% | (approx (+ x 1/3) #s(literal 1/3 binary64)) |
Compiled 2 to 4 computations (-100.0% saved)
| Inputs |
|---|
| Outputs |
|---|
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 24 | 56 |
| 1× | iter-limit |
| Inputs |
|---|
x #s(literal 6004799503160661/18014398509481984 binary64) #s(literal 1/3 binary64) (approx (+ x 1/3) #s(literal 1/3 binary64)) (+.f64 x #s(literal 6004799503160661/18014398509481984 binary64)) |
| Outputs |
|---|
%5 = (+ x 1/3) %11 = (+ x 6004799503160661/18014398509481984) %17 = (/.f64 #s(literal 1 binary64) x) (approx x #s(literal 0 binary64)) (approx x x) (approx %5 #s(literal 1/3 binary64)) (approx %5 (+.f64 #s(literal 1/3 binary64) x)) (approx %11 #s(literal 6004799503160661/18014398509481984 binary64)) (approx %11 (+.f64 #s(literal 6004799503160661/18014398509481984 binary64) x)) (approx %5 (*.f64 x (+.f64 #s(literal 1 binary64) (*.f64 #s(literal 1/3 binary64) %17)))) (approx %11 (*.f64 x (+.f64 #s(literal 1 binary64) (*.f64 #s(literal 6004799503160661/18014398509481984 binary64) %17)))) |
3 calls:
| Time | Variable | Point |
|---|---|---|
| 1.0ms | x | -inf |
| 1.0ms | x | inf |
| 0.0ms | x | 0 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 11 |
| 0 | 7 | 11 |
| 1 | 22 | 11 |
| 2 | 40 | 11 |
| 3 | 66 | 11 |
| 4 | 130 | 11 |
| 5 | 488 | 11 |
| 0 | 4037 | 11 |
| 0 | 4164 | 11 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | node-limit |
| 1× | iter-limit |
| Inputs |
|---|
x #s(literal 6004799503160661/18014398509481984 binary64) #s(literal 1/3 binary64) (approx (+ x 1/3) #s(literal 1/3 binary64)) (+.f64 x #s(literal 6004799503160661/18014398509481984 binary64)) |
| Outputs |
|---|
%6 = (approx (+ 1/3 x) #s(literal 1/3 binary64)) %13 = (-.f64 #s(literal -6004799503160661/18014398509481984 binary64) x) %15 = (+.f64 #s(literal 6004799503160661/18014398509481984 binary64) x) %25 = (*.f64 x #s(literal 1 binary64)) x #s(literal 6004799503160661/18014398509481984 binary64) #s(literal 1/3 binary64) (*.f64 #s(literal 1 binary64) %6) (pow.f64 %6 #s(literal 1 binary64)) %6 (/.f64 #s(literal 1 binary64) (pow.f64 %6 #s(literal -1 binary64))) (*.f64 #s(literal -1 binary64) %13) (*.f64 #s(literal 1 binary64) %15) (pow.f64 %15 #s(literal 1 binary64)) (/.f64 #s(literal 1 binary64) (pow.f64 %15 #s(literal -1 binary64))) (neg.f64 %13) (fma.f64 x #s(literal 1 binary64) #s(literal 6004799503160661/18014398509481984 binary64)) (-.f64 #s(literal 6004799503160661/18014398509481984 binary64) (neg.f64 x)) (-.f64 x #s(literal -6004799503160661/18014398509481984 binary64)) (+.f64 %25 #s(literal 6004799503160661/18014398509481984 binary64)) (+.f64 #s(literal 6004799503160661/18014398509481984 binary64) %25) %15 (+.f64 x #s(literal 6004799503160661/18014398509481984 binary64)) |
Compiled 27 to 35 computations (-29.6% saved)
Compiled 10 to 19 computations (-90.0% saved)
2 alts after pruning (0 fresh and 2 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 10 | 0 | 10 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 2 | 2 |
| Done | 0 | 0 | 0 |
| Total | 10 | 2 | 12 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (+.f64 x #s(literal 6004799503160661/18014398509481984 binary64)) |
| ✓ | 46.1% | (approx (+ x 1/3) #s(literal 1/3 binary64)) |
Compiled 2 to 4 computations (-100.0% saved)
Total 0.0b remaining (0.0%)
Threshold costs 0.0b (0.0%)
| 0.0b | 0% |
| 0.0b | 0% |
| Inputs |
|---|
(approx (+ x 1/3) #s(literal 1/3 binary64)) |
| Outputs |
|---|
(approx (+ x 1/3) #s(literal 1/3 binary64)) |
| Inputs |
|---|
(approx (+ x 1/3) #s(literal 1/3 binary64)) (+.f64 x #s(literal 6004799503160661/18014398509481984 binary64)) |
| Outputs |
|---|
(+.f64 x #s(literal 6004799503160661/18014398509481984 binary64)) |
2 calls:
| 2.0ms | x |
| 2.0ms | (+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64))) |
| Accuracy | Segments | Branch |
|---|---|---|
| 46.1% | 1 | x |
| 46.1% | 1 | (+.f64 x (/.f64 #s(literal 1 binary64) #s(literal 3 binary64))) |
Compiled 5 to 13 computations (-160.0% saved)
| 1× | done |
Compiled 2 to 4 computations (-100.0% saved)
Compiled 3 to 9 computations (-200.0% saved)
| Allocated | Percent | Phase |
|---|---|---|
| 639.6 MiB | 61.4% | sample |
| 227.0 MiB | 21.8% | rewrite |
| 95.8 MiB | 9.2% | preprocess |
| 30.8 MiB | 3.0% | series |
| 19.7 MiB | 1.9% | regimes |
| 11.8 MiB | 1.1% | reconstruct |
| 7.1 MiB | 0.7% | eval |
| 6.8 MiB | 0.7% | prune |
| 3.1 MiB | 0.3% | derivations |
| 0.5 MiB | 0.0% | analyze |
| 0.1 MiB | 0.0% | bsearch |
| 0.1 MiB | 0.0% | end |
| 0.0 MiB | 0.0% | start |
| 1 042.5 MiB | 100.0% | total |
Loading profile data...