Average Error: 0.3 → 0.3
Time: 25.8s
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 r121261 = x;
        double r121262 = 27.0;
        double r121263 = r121261 * r121262;
        double r121264 = y;
        double r121265 = r121263 * r121264;
        return r121265;
}
↓
double f(double x, double y) {
        double r121266 = x;
        double r121267 = 27.0;
        double r121268 = r121266 * r121267;
        double r121269 = y;
        double r121270 = r121268 * r121269;
        return r121270;
}

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