Average Error: 0.3 → 0.3
Time: 1.4s
Precision: 64
\[\left(x \cdot 27\right) \cdot y\]
↓
\[\left(x \cdot 27\right) \cdot y\]
\left(x \cdot 27\right) \cdot y
↓
\left(x \cdot 27\right) \cdot y
double f(double x, double y) {
        double r258382 = x;
        double r258383 = 27.0;
        double r258384 = r258382 * r258383;
        double r258385 = y;
        double r258386 = r258384 * r258385;
        return r258386;
}
↓
double f(double x, double y) {
        double r258387 = x;
        double r258388 = 27.0;
        double r258389 = r258387 * r258388;
        double r258390 = y;
        double r258391 = r258389 * r258390;
        return r258391;
}

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. Final simplification0.3

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

Reproduce

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