Average Error: 0.3 → 0.3
Time: 32.6s
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 r117054 = x;
        double r117055 = 27.0;
        double r117056 = r117054 * r117055;
        double r117057 = y;
        double r117058 = r117056 * r117057;
        return r117058;
}
↓
double f(double x, double y) {
        double r117059 = x;
        double r117060 = 27.0;
        double r117061 = r117059 * r117060;
        double r117062 = y;
        double r117063 = r117061 * r117062;
        return r117063;
}

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