Average Error: 0.3 → 0.3
Time: 1.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 r259612 = x;
        double r259613 = 27.0;
        double r259614 = r259612 * r259613;
        double r259615 = y;
        double r259616 = r259614 * r259615;
        return r259616;
}
↓
double f(double x, double y) {
        double r259617 = x;
        double r259618 = 27.0;
        double r259619 = r259617 * r259618;
        double r259620 = y;
        double r259621 = r259619 * r259620;
        return r259621;
}

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