Average Error: 0.3 → 0.3
Time: 1.9s
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 r182605 = x;
        double r182606 = 27.0;
        double r182607 = r182605 * r182606;
        double r182608 = y;
        double r182609 = r182607 * r182608;
        return r182609;
}
↓
double f(double x, double y) {
        double r182610 = x;
        double r182611 = 27.0;
        double r182612 = r182610 * r182611;
        double r182613 = y;
        double r182614 = r182612 * r182613;
        return r182614;
}

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