Average Error: 0.3 → 0.3
Time: 2.0s
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 r228619 = x;
        double r228620 = 27.0;
        double r228621 = r228619 * r228620;
        double r228622 = y;
        double r228623 = r228621 * r228622;
        return r228623;
}
↓
double f(double x, double y) {
        double r228624 = x;
        double r228625 = 27.0;
        double r228626 = r228624 * r228625;
        double r228627 = y;
        double r228628 = r228626 * r228627;
        return r228628;
}

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