Average Error: 0.3 → 0.3
Time: 11.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 r318561 = x;
        double r318562 = 27.0;
        double r318563 = r318561 * r318562;
        double r318564 = y;
        double r318565 = r318563 * r318564;
        return r318565;
}
↓
double f(double x, double y) {
        double r318566 = x;
        double r318567 = 27.0;
        double r318568 = r318566 * r318567;
        double r318569 = y;
        double r318570 = r318568 * r318569;
        return r318570;
}

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