Average Error: 0.3 → 0.3
Time: 1.5s
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 r209618 = x;
        double r209619 = 27.0;
        double r209620 = r209618 * r209619;
        double r209621 = y;
        double r209622 = r209620 * r209621;
        return r209622;
}
↓
double f(double x, double y) {
        double r209623 = x;
        double r209624 = 27.0;
        double r209625 = r209623 * r209624;
        double r209626 = y;
        double r209627 = r209625 * r209626;
        return r209627;
}

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