Average Error: 0.3 → 0.3
Time: 20.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 r223375 = x;
        double r223376 = 27.0;
        double r223377 = r223375 * r223376;
        double r223378 = y;
        double r223379 = r223377 * r223378;
        return r223379;
}
↓
double f(double x, double y) {
        double r223380 = x;
        double r223381 = 27.0;
        double r223382 = r223380 * r223381;
        double r223383 = y;
        double r223384 = r223382 * r223383;
        return r223384;
}

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