Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, A
Time bar (total: 625.0ms)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0.0% | 0.0% | 99.9% | 0.1% | 0.0% | 0.0% | 0.0% | 0 |
| 100.0% | 99.9% | 0.0% | 0.1% | 0.0% | 0.0% | 0.0% | 1 |
Compiled 9 to 9 computations (0.0% saved)
| 145.0ms | 7 626× | 0 | valid |
| 16.0ms | 141× | 3 | valid |
| 5.0ms | 281× | 1 | valid |
| 4.0ms | 208× | 2 | valid |
Mul: 3.0ms (49.2% of total, 0.0 MiB)Sub: 2.0ms (32.8% of total, 0.0 MiB)adjust: 0.0ms (0.0% of total, 0.0 MiB)Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 17 | 34 |
| 1 | 82 | 30 |
| 2 | 245 | 30 |
| 3 | 722 | 30 |
| 4 | 1943 | 30 |
| 1× | node-limit |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 99.9% | (-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)) |
Compiled 2 to 14 computations (-600.0% saved)
| Inputs |
|---|
(/ 3 8) |
| Outputs |
|---|
#s(literal 3/8 binary64) |
| 0.0ms | 1× | 0 | valid |
Compiled 5 to 5 computations (0.0% saved)
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 40 | 109 |
| 1× | iter-limit |
| Inputs |
|---|
%3 = (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) %5 = (*.f64 %3 y) x #s(literal 3 binary64) #s(literal 8 binary64) %3 y %5 (-.f64 x %5) |
| Outputs |
|---|
%6 = (* 3/8 y) %7 = (- x %6) %9 = (*.f64 #s(literal -3/8 binary64) y) %12 = (*.f64 #s(literal 3/8 binary64) y) %16 = (/.f64 y x) %31 = (/.f64 x y) (approx x #s(literal 0 binary64)) (approx x x) (approx %7 %9) (approx %7 (-.f64 x %12)) (approx %7 (*.f64 x (+.f64 #s(literal 1 binary64) (*.f64 #s(literal -3/8 binary64) %16)))) (approx %7 (*.f64 #s(literal -1 binary64) (*.f64 x (-.f64 (*.f64 #s(literal 3/8 binary64) %16) #s(literal 1 binary64))))) (approx y y) (approx %6 %12) (approx %7 (+.f64 x %9)) (approx %7 (*.f64 y (-.f64 %31 #s(literal 3/8 binary64)))) (approx %7 (*.f64 #s(literal -1 binary64) (*.f64 y (+.f64 #s(literal 3/8 binary64) (*.f64 #s(literal -1 binary64) %31))))) |
6 calls:
| Time | Variable | Point |
|---|---|---|
| 1.0ms | y | -inf |
| 1.0ms | y | inf |
| 1.0ms | x | -inf |
| 1.0ms | x | inf |
| 0.0ms | y | 0 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 7 | 13 |
| 0 | 11 | 13 |
| 1 | 28 | 13 |
| 2 | 53 | 13 |
| 3 | 89 | 13 |
| 4 | 162 | 13 |
| 5 | 520 | 13 |
| 0 | 4113 | 13 |
| 0 | 4227 | 12 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | node-limit |
| 1× | iter-limit |
| Inputs |
|---|
%3 = (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) %5 = (*.f64 %3 y) x #s(literal 3 binary64) #s(literal 8 binary64) %3 y %5 (-.f64 x %5) |
| Outputs |
|---|
%7 = (*.f64 #s(literal -3/8 binary64) y) %9 = (neg.f64 y) %13 = (*.f64 y #s(literal 3/8 binary64)) %20 = (-.f64 %13 x) %22 = (fma.f64 #s(literal -3/8 binary64) y x) %30 = (*.f64 x #s(literal 1 binary64)) %35 = (*.f64 %7 #s(literal 1 binary64)) x #s(literal 3 binary64) #s(literal 8 binary64) #s(literal 3/8 binary64) y (*.f64 #s(literal -1 binary64) %7) (*.f64 %9 #s(literal -3/8 binary64)) (*.f64 #s(literal -3/8 binary64) %9) (*.f64 #s(literal 1 binary64) %13) %13 (*.f64 #s(literal 3/8 binary64) y) (pow.f64 %13 #s(literal 1 binary64)) (/.f64 #s(literal 1 binary64) (pow.f64 %13 #s(literal -1 binary64))) (neg.f64 %7) (*.f64 #s(literal -1 binary64) %20) (*.f64 #s(literal 1 binary64) %22) (pow.f64 %22 #s(literal 1 binary64)) (/.f64 #s(literal 1 binary64) (pow.f64 %22 #s(literal -1 binary64))) (neg.f64 %20) (fma.f64 #s(literal -1 binary64) %13 x) (fma.f64 %9 #s(literal 3/8 binary64) x) (fma.f64 %7 #s(literal 1 binary64) %30) %22 (fma.f64 #s(literal 1 binary64) %7 x) (fma.f64 y #s(literal -3/8 binary64) x) (fma.f64 #s(literal 3/8 binary64) %9 x) (fma.f64 x #s(literal 1 binary64) %35) (-.f64 %7 (neg.f64 x)) (-.f64 x %13) (+.f64 %35 %30) (+.f64 %30 %35) (+.f64 %7 x) (+.f64 x %7) |
Compiled 44 to 61 computations (-38.6% saved)
Compiled 11 to 32 computations (-190.9% saved)
2 alts after pruning (2 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 9 | 2 | 11 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 10 | 2 | 12 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (fma.f64 #s(literal -3/8 binary64) y x) |
| ▶ | 51.1% | (approx (- x (* 3/8 y)) (*.f64 #s(literal -3/8 binary64) y)) |
Compiled 2 to 5 computations (-150.0% saved)
| Inputs |
|---|
| Outputs |
|---|
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 37 | 101 |
| 1× | iter-limit |
| Inputs |
|---|
%3 = (*.f64 #s(literal -3/8 binary64) y) x y #s(literal -3/8 binary64) %3 (approx (- x (* 3/8 y)) %3) (fma.f64 #s(literal -3/8 binary64) y x) |
| Outputs |
|---|
%7 = (- x (* 3/8 y)) %9 = (*.f64 #s(literal -3/8 binary64) y) %21 = (/.f64 y x) %33 = (/.f64 x y) (approx x #s(literal 0 binary64)) (approx x x) (approx %7 %9) (approx %7 (-.f64 x (*.f64 #s(literal 3/8 binary64) y))) (approx (+ (* -3/8 y) x) (+.f64 x %9)) (approx %7 (*.f64 x (+.f64 #s(literal 1 binary64) (*.f64 #s(literal -3/8 binary64) %21)))) (approx %7 (*.f64 #s(literal -1 binary64) (*.f64 x (-.f64 (*.f64 #s(literal 3/8 binary64) %21) #s(literal 1 binary64))))) (approx y y) (approx %7 (*.f64 y (-.f64 %33 #s(literal 3/8 binary64)))) (approx %7 (*.f64 #s(literal -1 binary64) (*.f64 y (+.f64 #s(literal 3/8 binary64) (*.f64 #s(literal -1 binary64) %33))))) |
6 calls:
| Time | Variable | Point |
|---|---|---|
| 3.0ms | x | -inf |
| 2.0ms | x | inf |
| 1.0ms | y | -inf |
| 1.0ms | y | inf |
| 0.0ms | y | 0 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 9 | 19 |
| 0 | 12 | 18 |
| 1 | 32 | 18 |
| 2 | 59 | 18 |
| 3 | 104 | 18 |
| 4 | 173 | 18 |
| 5 | 531 | 18 |
| 0 | 4062 | 18 |
| 0 | 4170 | 18 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | node-limit |
| 1× | iter-limit |
| Inputs |
|---|
%3 = (*.f64 #s(literal -3/8 binary64) y) x y #s(literal -3/8 binary64) %3 (approx (- x (* 3/8 y)) %3) (fma.f64 #s(literal -3/8 binary64) y x) |
| Outputs |
|---|
%5 = (*.f64 #s(literal 3/8 binary64) y) %7 = (neg.f64 y) %10 = (*.f64 #s(literal -3/8 binary64) y) %21 = (approx (+ (* -3/8 y) x) %10) %26 = (-.f64 %5 x) %28 = (fma.f64 #s(literal -3/8 binary64) y x) %38 = (*.f64 x #s(literal 1 binary64)) %41 = (*.f64 %10 #s(literal 1 binary64)) x y #s(literal -3/8 binary64) (*.f64 #s(literal -1 binary64) %5) (*.f64 %7 #s(literal 3/8 binary64)) (*.f64 #s(literal 1 binary64) %10) (*.f64 #s(literal 3/8 binary64) %7) %10 (*.f64 y #s(literal -3/8 binary64)) (pow.f64 %10 #s(literal 1 binary64)) (/.f64 #s(literal 1 binary64) (pow.f64 %10 #s(literal -1 binary64))) (neg.f64 %5) (*.f64 #s(literal 1 binary64) %21) (pow.f64 %21 #s(literal 1 binary64)) %21 (/.f64 #s(literal 1 binary64) (pow.f64 %21 #s(literal -1 binary64))) (*.f64 #s(literal -1 binary64) %26) (*.f64 #s(literal 1 binary64) %28) (pow.f64 %28 #s(literal 1 binary64)) (/.f64 #s(literal 1 binary64) (pow.f64 %28 #s(literal -1 binary64))) (neg.f64 %26) (fma.f64 #s(literal -1 binary64) %5 x) (fma.f64 %7 #s(literal 3/8 binary64) x) (fma.f64 #s(literal 1 binary64) %10 x) (fma.f64 #s(literal 3/8 binary64) %7 x) (fma.f64 %10 #s(literal 1 binary64) %38) %28 (fma.f64 y #s(literal -3/8 binary64) x) (fma.f64 x #s(literal 1 binary64) %41) (-.f64 %10 (neg.f64 x)) (-.f64 x %5) (+.f64 %41 %38) (+.f64 %38 %41) (+.f64 %10 x) (+.f64 x %10) |
Compiled 45 to 62 computations (-37.8% saved)
Compiled 11 to 26 computations (-136.4% saved)
2 alts after pruning (0 fresh and 2 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 11 | 0 | 11 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 2 | 2 |
| Done | 0 | 0 | 0 |
| Total | 11 | 2 | 13 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (fma.f64 #s(literal -3/8 binary64) y x) |
| ✓ | 51.1% | (approx (- x (* 3/8 y)) (*.f64 #s(literal -3/8 binary64) y)) |
Compiled 2 to 5 computations (-150.0% saved)
Total -0.0b remaining (-0.0%)
Threshold costs -0.0b (-0.0%)
| 0.0b | 0% |
| -0.0b | -0.0% |
| Inputs |
|---|
(approx (- x (* 3/8 y)) (*.f64 #s(literal -3/8 binary64) y)) |
| Outputs |
|---|
(approx (- x (* 3/8 y)) (*.f64 #s(literal -3/8 binary64) y)) |
| Inputs |
|---|
(approx (- x (* 3/8 y)) (*.f64 #s(literal -3/8 binary64) y)) (fma.f64 #s(literal -3/8 binary64) y x) |
| Outputs |
|---|
(fma.f64 #s(literal -3/8 binary64) y x) |
4 calls:
| 2.0ms | (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y) |
| 2.0ms | (-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)) |
| 2.0ms | y |
| 2.0ms | x |
| Accuracy | Segments | Branch |
|---|---|---|
| 51.1% | 1 | y |
| 51.1% | 1 | x |
| 51.1% | 1 | (-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)) |
| 51.1% | 1 | (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y) |
Compiled 7 to 17 computations (-142.9% saved)
| 1× | done |
Compiled 2 to 5 computations (-150.0% saved)
Compiled 3 to 12 computations (-300.0% saved)
| Allocated | Percent | Phase |
|---|---|---|
| 241.3 MiB | 52.0% | sample |
| 107.8 MiB | 23.2% | rewrite |
| 36.8 MiB | 7.9% | series |
| 31.9 MiB | 6.9% | preprocess |
| 21.3 MiB | 4.6% | regimes |
| 11.2 MiB | 2.4% | derivations |
| 7.7 MiB | 1.7% | reconstruct |
| 2.9 MiB | 0.6% | eval |
| 2.6 MiB | 0.6% | prune |
| 0.3 MiB | 0.1% | analyze |
| 0.0 MiB | 0.0% | bsearch |
| 0.0 MiB | 0.0% | start |
| 0.0 MiB | 0.0% | end |
| 463.9 MiB | 100.0% | total |
Loading profile data...