Average Error: 0.3 → 0.3
Time: 35.4s
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 r152934 = x;
        double r152935 = 27.0;
        double r152936 = r152934 * r152935;
        double r152937 = y;
        double r152938 = r152936 * r152937;
        return r152938;
}
↓
double f(double x, double y) {
        double r152939 = x;
        double r152940 = 27.0;
        double r152941 = r152939 * r152940;
        double r152942 = y;
        double r152943 = r152941 * r152942;
        return r152943;
}

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