Average Error: 0.3 → 0.3
Time: 8.4s
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 r140481 = x;
        double r140482 = 27.0;
        double r140483 = r140481 * r140482;
        double r140484 = y;
        double r140485 = r140483 * r140484;
        return r140485;
}
↓
double f(double x, double y) {
        double r140486 = x;
        double r140487 = 27.0;
        double r140488 = y;
        double r140489 = r140487 * r140488;
        double r140490 = r140486 * r140489;
        return r140490;
}

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 2019298 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, F"
  :precision binary64
  (* (* x 27) y))