Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, F
Time bar (total: 777.0ms)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 99.9% | 0.1% | 0% | 0% | 0% | 0 |
| 100% | 99.9% | 0% | 0.1% | 0% | 0% | 0% | 1 |
Compiled 7 to 7 computations (0% saved)
| 329.0ms | 8 256× | 0 | valid |
ival-mult: 133.0ms (92% of total)exact: 6.0ms (4.2% of total)ival-assert: 3.0ms (2.1% of total)adjust: 2.0ms (1.4% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | (*.f64 (*.f64 x #s(literal 27 binary64)) y) |
| 0 | 0 | - | 0 | - | #s(literal 27 binary64) |
| 0 | 0 | - | 0 | - | y |
| 0 | 0 | - | 0 | - | (*.f64 x #s(literal 27 binary64)) |
| 0 | 0 | - | 0 | - | x |
| Predicted + | Predicted - | |
|---|---|---|
| + | 0 | 0 |
| - | 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 256 |
| number | freq |
|---|---|
| 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 1 |
| 21.0ms | 512× | 0 | valid |
Compiled 31 to 19 computations (38.7% saved)
ival-mult: 7.0ms (89.5% of total)ival-true: 0.0ms (0% of total)adjust: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 14 | 32 |
| 1 | 35 | 30 |
| 2 | 76 | 30 |
| 3 | 125 | 30 |
| 0 | 5 | 5 |
| 0 | 7 | 5 |
| 1 | 11 | 5 |
| 2 | 18 | 5 |
| 3 | 20 | 5 |
| 0 | 20 | 5 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 27 binary64)) y) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 27 binary64)) y) |
(*.f64 y (*.f64 #s(literal 27 binary64) x)) |
(negabs x)
(negabs y)
(sort x y)
Compiled 5 to 5 computations (0% saved)
Compiled 0 to 2 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 99.7% | (*.f64 (*.f64 x #s(literal 27 binary64)) y) |
Compiled 5 to 5 computations (0% saved)
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 27 binary64)) y) |
(*.f64 x #s(literal 27 binary64)) |
x |
#s(literal 27 binary64) |
y |
| Outputs |
|---|
#s(approx (* (* x 27) y) #s(hole binary64 (* 27 (* x y)))) |
#s(approx (* x 27) #s(hole binary64 (* 27 x))) |
#s(approx x #s(hole binary64 x)) |
#s(approx y #s(hole binary64 y)) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | y | @ | inf | ((* (* x 27) y) (* x 27) x 27 y) |
| 1.0ms | x | @ | inf | ((* (* x 27) y) (* x 27) x 27 y) |
| 1.0ms | x | @ | 0 | ((* (* x 27) y) (* x 27) x 27 y) |
| 1.0ms | x | @ | -inf | ((* (* x 27) y) (* x 27) x 27 y) |
| 1.0ms | y | @ | -inf | ((* (* x 27) y) (* x 27) x 27 y) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 14 | 35 |
| 0 | 15 | 35 |
| 1 | 23 | 35 |
| 2 | 27 | 35 |
| 0 | 27 | 35 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 27 binary64)) y) |
(*.f64 x #s(literal 27 binary64)) |
x |
#s(literal 27 binary64) |
y |
#s(approx (* (* x 27) y) #s(hole binary64 (* 27 (* x y)))) |
#s(approx (* x 27) #s(hole binary64 (* 27 x))) |
#s(approx x #s(hole binary64 x)) |
#s(approx y #s(hole binary64 y)) |
| Outputs |
|---|
(*.f64 (*.f64 y #s(literal 27 binary64)) x) |
(*.f64 (*.f64 y x) #s(literal 27 binary64)) |
(*.f64 (*.f64 #s(literal 27 binary64) x) y) |
(*.f64 y (*.f64 #s(literal 27 binary64) x)) |
(*.f64 #s(literal 27 binary64) (*.f64 y x)) |
(*.f64 x (*.f64 y #s(literal 27 binary64))) |
(*.f64 #s(literal 27 binary64) x) |
(*.f64 x #s(literal 27 binary64)) |
x |
#s(literal 27 binary64) |
y |
#s(approx (* (* x 27) y) (*.f64 (*.f64 #s(literal 27 binary64) x) y)) |
#s(approx (* x 27) (*.f64 #s(literal 27 binary64) x)) |
#s(approx x x) |
#s(approx y y) |
Compiled 89 to 25 computations (71.9% saved)
3 alts after pruning (2 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 13 | 2 | 15 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 13 | 3 | 16 |
| Status | Accuracy | Program |
|---|---|---|
| 99.7% | (*.f64 (*.f64 y x) #s(literal 27 binary64)) | |
| ▶ | 99.7% | (*.f64 (*.f64 y #s(literal 27 binary64)) x) |
| ✓ | 99.7% | (*.f64 (*.f64 x #s(literal 27 binary64)) y) |
Compiled 15 to 15 computations (0% saved)
| Inputs |
|---|
(*.f64 (*.f64 y #s(literal 27 binary64)) x) |
(*.f64 y #s(literal 27 binary64)) |
y |
#s(literal 27 binary64) |
x |
| Outputs |
|---|
#s(approx (* (* y 27) x) #s(hole binary64 (* 27 (* x y)))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (* y 27) #s(hole binary64 (* 27 y))) |
#s(approx y #s(hole binary64 y)) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | y | @ | -inf | ((* (* y 27) x) (* y 27) y 27 x) |
| 1.0ms | y | @ | inf | ((* (* y 27) x) (* y 27) y 27 x) |
| 0.0ms | x | @ | inf | ((* (* y 27) x) (* y 27) y 27 x) |
| 0.0ms | x | @ | -inf | ((* (* y 27) x) (* y 27) y 27 x) |
| 0.0ms | y | @ | 0 | ((* (* y 27) x) (* y 27) y 27 x) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 14 | 35 |
| 0 | 15 | 35 |
| 1 | 22 | 35 |
| 2 | 26 | 35 |
| 0 | 26 | 35 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 (*.f64 y #s(literal 27 binary64)) x) |
(*.f64 y #s(literal 27 binary64)) |
y |
#s(literal 27 binary64) |
x |
#s(approx (* (* y 27) x) #s(hole binary64 (* 27 (* x y)))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (* y 27) #s(hole binary64 (* 27 y))) |
#s(approx y #s(hole binary64 y)) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 27 binary64)) y) |
(*.f64 (*.f64 x y) #s(literal 27 binary64)) |
(*.f64 (*.f64 #s(literal 27 binary64) y) x) |
(*.f64 x (*.f64 #s(literal 27 binary64) y)) |
(*.f64 #s(literal 27 binary64) (*.f64 x y)) |
(*.f64 y (*.f64 x #s(literal 27 binary64))) |
(*.f64 #s(literal 27 binary64) y) |
(*.f64 y #s(literal 27 binary64)) |
y |
#s(literal 27 binary64) |
x |
#s(approx (* (* y 27) x) (*.f64 (*.f64 x y) #s(literal 27 binary64))) |
#s(approx x x) |
#s(approx (* y 27) (*.f64 #s(literal 27 binary64) y)) |
#s(approx y y) |
Compiled 89 to 25 computations (71.9% saved)
3 alts after pruning (1 fresh and 2 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 15 | 0 | 15 |
| Fresh | 0 | 1 | 1 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 1 | 1 |
| Total | 15 | 3 | 18 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 99.7% | (*.f64 (*.f64 y x) #s(literal 27 binary64)) |
| ✓ | 99.7% | (*.f64 (*.f64 y #s(literal 27 binary64)) x) |
| ✓ | 99.7% | (*.f64 (*.f64 x #s(literal 27 binary64)) y) |
Compiled 15 to 15 computations (0% saved)
| Inputs |
|---|
(*.f64 (*.f64 y x) #s(literal 27 binary64)) |
(*.f64 y x) |
y |
x |
#s(literal 27 binary64) |
| Outputs |
|---|
#s(approx (* (* y x) 27) #s(hole binary64 (* 27 (* x y)))) |
#s(approx (* y x) #s(hole binary64 (* x y))) |
#s(approx x #s(hole binary64 x)) |
#s(approx y #s(hole binary64 y)) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | y | @ | -inf | ((* (* y x) 27) (* y x) y x 27) |
| 1.0ms | x | @ | -inf | ((* (* y x) 27) (* y x) y x 27) |
| 1.0ms | x | @ | inf | ((* (* y x) 27) (* y x) y x 27) |
| 0.0ms | y | @ | inf | ((* (* y x) 27) (* y x) y x 27) |
| 0.0ms | x | @ | 0 | ((* (* y x) 27) (* y x) y x 27) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 13 | 35 |
| 0 | 14 | 35 |
| 1 | 22 | 35 |
| 2 | 27 | 35 |
| 3 | 29 | 35 |
| 0 | 29 | 35 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 (*.f64 y x) #s(literal 27 binary64)) |
(*.f64 y x) |
y |
x |
#s(literal 27 binary64) |
#s(approx (* (* y x) 27) #s(hole binary64 (* 27 (* x y)))) |
#s(approx (* y x) #s(hole binary64 (* x y))) |
#s(approx x #s(hole binary64 x)) |
#s(approx y #s(hole binary64 y)) |
| Outputs |
|---|
(*.f64 (*.f64 #s(literal 27 binary64) y) x) |
(*.f64 (*.f64 #s(literal 27 binary64) x) y) |
(*.f64 (*.f64 x y) #s(literal 27 binary64)) |
(*.f64 #s(literal 27 binary64) (*.f64 x y)) |
(*.f64 x (*.f64 #s(literal 27 binary64) y)) |
(*.f64 y (*.f64 #s(literal 27 binary64) x)) |
(*.f64 x y) |
(*.f64 y x) |
y |
x |
#s(literal 27 binary64) |
#s(approx (* (* y x) 27) (*.f64 (*.f64 x y) #s(literal 27 binary64))) |
#s(approx (* y x) (*.f64 x y)) |
#s(approx x x) |
#s(approx y y) |
Compiled 89 to 26 computations (70.8% saved)
3 alts after pruning (0 fresh and 3 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 15 | 0 | 15 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 2 | 2 |
| Total | 15 | 3 | 18 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 99.7% | (*.f64 (*.f64 y x) #s(literal 27 binary64)) |
| ✓ | 99.7% | (*.f64 (*.f64 y #s(literal 27 binary64)) x) |
| ✓ | 99.7% | (*.f64 (*.f64 x #s(literal 27 binary64)) y) |
Compiled 30 to 24 computations (20% saved)
Total -0.3b remaining (-141.7%)
Threshold costs -0.3b (-141.7%)
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 27 binary64)) y) |
(*.f64 (*.f64 y #s(literal 27 binary64)) x) |
(*.f64 (*.f64 y x) #s(literal 27 binary64)) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 27 binary64)) y) |
4 calls:
| 8.0ms | (*.f64 x #s(literal 27 binary64)) |
| 2.0ms | x |
| 1.0ms | y |
| 1.0ms | (*.f64 (*.f64 x #s(literal 27 binary64)) y) |
| Accuracy | Segments | Branch |
|---|---|---|
| 99.7% | 1 | (*.f64 x #s(literal 27 binary64)) |
| 99.7% | 1 | (*.f64 (*.f64 x #s(literal 27 binary64)) y) |
| 99.7% | 1 | x |
| 99.7% | 1 | y |
Compiled 10 to 13 computations (-30% saved)
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 5 |
| 1× | saturated |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 27 binary64)) y) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 27 binary64)) y) |
| 1× | done |
Compiled 5 to 5 computations (0% saved)
(negabs y)
(sort x y)
(negabs x)
Compiled 100 to 100 computations (0% saved)
Loading profile data...