Average Error: 0.3 → 0.3
Time: 30.3s
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 r178054 = x;
        double r178055 = 27.0;
        double r178056 = r178054 * r178055;
        double r178057 = y;
        double r178058 = r178056 * r178057;
        return r178058;
}
↓
double f(double x, double y) {
        double r178059 = x;
        double r178060 = 27.0;
        double r178061 = r178059 * r178060;
        double r178062 = y;
        double r178063 = r178061 * r178062;
        return r178063;
}

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