Average Error: 0.3 → 0.3
Time: 37.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 r152782 = x;
        double r152783 = 27.0;
        double r152784 = r152782 * r152783;
        double r152785 = y;
        double r152786 = r152784 * r152785;
        return r152786;
}
↓
double f(double x, double y) {
        double r152787 = x;
        double r152788 = 27.0;
        double r152789 = r152787 * r152788;
        double r152790 = y;
        double r152791 = r152789 * r152790;
        return r152791;
}

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))