Average Error: 0.3 → 0.3
Time: 31.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 r152236 = x;
        double r152237 = 27.0;
        double r152238 = r152236 * r152237;
        double r152239 = y;
        double r152240 = r152238 * r152239;
        return r152240;
}
↓
double f(double x, double y) {
        double r152241 = x;
        double r152242 = 27.0;
        double r152243 = r152241 * r152242;
        double r152244 = y;
        double r152245 = r152243 * r152244;
        return r152245;
}

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))