Average Error: 0.3 → 0.3
Time: 10.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 r157711 = x;
        double r157712 = 27.0;
        double r157713 = r157711 * r157712;
        double r157714 = y;
        double r157715 = r157713 * r157714;
        return r157715;
}
↓
double f(double x, double y) {
        double r157716 = x;
        double r157717 = 27.0;
        double r157718 = r157716 * r157717;
        double r157719 = y;
        double r157720 = r157718 * r157719;
        return r157720;
}

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