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 r306708 = x;
        double r306709 = 27.0;
        double r306710 = r306708 * r306709;
        double r306711 = y;
        double r306712 = r306710 * r306711;
        return r306712;
}
↓
double f(double x, double y) {
        double r306713 = x;
        double r306714 = 27.0;
        double r306715 = r306713 * r306714;
        double r306716 = y;
        double r306717 = r306715 * r306716;
        return r306717;
}

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