Average Error: 0.3 → 0.3
Time: 32.3s
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 r125487 = x;
        double r125488 = 27.0;
        double r125489 = r125487 * r125488;
        double r125490 = y;
        double r125491 = r125489 * r125490;
        return r125491;
}
↓
double f(double x, double y) {
        double r125492 = x;
        double r125493 = 27.0;
        double r125494 = r125492 * r125493;
        double r125495 = y;
        double r125496 = r125494 * r125495;
        return r125496;
}

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