Average Error: 0.4 → 0.4
Time: 21.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 r453854 = x;
        double r453855 = 27.0;
        double r453856 = r453854 * r453855;
        double r453857 = y;
        double r453858 = r453856 * r453857;
        return r453858;
}
↓
double f(double x, double y) {
        double r453859 = x;
        double r453860 = 27.0;
        double r453861 = r453859 * r453860;
        double r453862 = y;
        double r453863 = r453861 * r453862;
        return r453863;
}

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.4

    \[\left(x \cdot 27\right) \cdot y\]

  2. Final simplification0.4

    \[\leadsto \left(x \cdot 27\right) \cdot y\]

Reproduce

herbie shell --seed 2020042 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, F"
  :precision binary64
  (* (* x 27) y))