Average Error: 0.3 → 0.3
Time: 1.6s
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 r225861 = x;
        double r225862 = 27.0;
        double r225863 = r225861 * r225862;
        double r225864 = y;
        double r225865 = r225863 * r225864;
        return r225865;
}
↓
double f(double x, double y) {
        double r225866 = x;
        double r225867 = 27.0;
        double r225868 = r225866 * r225867;
        double r225869 = y;
        double r225870 = r225868 * r225869;
        return r225870;
}

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