Average Error: 0.3 → 0.3
Time: 7.0s
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 r118386 = x;
        double r118387 = 27.0;
        double r118388 = r118386 * r118387;
        double r118389 = y;
        double r118390 = r118388 * r118389;
        return r118390;
}
↓
double f(double x, double y) {
        double r118391 = x;
        double r118392 = 27.0;
        double r118393 = r118391 * r118392;
        double r118394 = y;
        double r118395 = r118393 * r118394;
        return r118395;
}

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