Average Error: 0.3 → 0.3
Time: 13.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 r243603 = x;
        double r243604 = 27.0;
        double r243605 = r243603 * r243604;
        double r243606 = y;
        double r243607 = r243605 * r243606;
        return r243607;
}
↓
double f(double x, double y) {
        double r243608 = x;
        double r243609 = 27.0;
        double r243610 = r243608 * r243609;
        double r243611 = y;
        double r243612 = r243610 * r243611;
        return r243612;
}

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