Average Error: 0.3 → 0.3
Time: 32.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 r172770 = x;
        double r172771 = 27.0;
        double r172772 = r172770 * r172771;
        double r172773 = y;
        double r172774 = r172772 * r172773;
        return r172774;
}
↓
double f(double x, double y) {
        double r172775 = x;
        double r172776 = 27.0;
        double r172777 = r172775 * r172776;
        double r172778 = y;
        double r172779 = r172777 * r172778;
        return r172779;
}

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