Average Error: 0.3 → 0.3
Time: 27.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 r119884 = x;
        double r119885 = 27.0;
        double r119886 = r119884 * r119885;
        double r119887 = y;
        double r119888 = r119886 * r119887;
        return r119888;
}
↓
double f(double x, double y) {
        double r119889 = x;
        double r119890 = 27.0;
        double r119891 = r119889 * r119890;
        double r119892 = y;
        double r119893 = r119891 * r119892;
        return r119893;
}

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