Average Error: 0.3 → 0.3
Time: 1.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 r271216 = x;
        double r271217 = 27.0;
        double r271218 = r271216 * r271217;
        double r271219 = y;
        double r271220 = r271218 * r271219;
        return r271220;
}
↓
double f(double x, double y) {
        double r271221 = x;
        double r271222 = 27.0;
        double r271223 = y;
        double r271224 = r271222 * r271223;
        double r271225 = r271221 * r271224;
        return r271225;
}

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