Average Error: 0.3 → 0.3
Time: 1.3s
Precision: 64
\[\left(x \cdot 27\right) \cdot y\]
↓
\[x \cdot \left(27 \cdot y\right)\]
\left(x \cdot 27\right) \cdot y
↓
x \cdot \left(27 \cdot y\right)
double f(double x, double y) {
        double r227358 = x;
        double r227359 = 27.0;
        double r227360 = r227358 * r227359;
        double r227361 = y;
        double r227362 = r227360 * r227361;
        return r227362;
}
↓
double f(double x, double y) {
        double r227363 = x;
        double r227364 = 27.0;
        double r227365 = y;
        double r227366 = r227364 * r227365;
        double r227367 = r227363 * r227366;
        return r227367;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.3

    \[\left(x \cdot 27\right) \cdot y\]
  2. Using strategy rm

  3. Applied associate-*l*0.3

    \[\leadsto \color{blue}{x \cdot \left(27 \cdot y\right)}\]

  4. Final simplification0.3

    \[\leadsto x \cdot \left(27 \cdot y\right)\]

Reproduce

herbie shell --seed 2020024 +o rules:numerics
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, F"
  :precision binary64
  (* (* x 27) y))