Average Error: 0.3 → 0.3
Time: 31.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 r137842 = x;
        double r137843 = 27.0;
        double r137844 = r137842 * r137843;
        double r137845 = y;
        double r137846 = r137844 * r137845;
        return r137846;
}
↓
double f(double x, double y) {
        double r137847 = x;
        double r137848 = 27.0;
        double r137849 = r137847 * r137848;
        double r137850 = y;
        double r137851 = r137849 * r137850;
        return r137851;
}

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