Average Error: 0.4 → 0.4
Time: 1.4s
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 r250308 = x;
        double r250309 = 27.0;
        double r250310 = r250308 * r250309;
        double r250311 = y;
        double r250312 = r250310 * r250311;
        return r250312;
}
↓
double f(double x, double y) {
        double r250313 = x;
        double r250314 = 27.0;
        double r250315 = r250313 * r250314;
        double r250316 = y;
        double r250317 = r250315 * r250316;
        return r250317;
}

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