Average Error: 0.3 → 0.3
Time: 1.7s
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 r242918 = x;
        double r242919 = 27.0;
        double r242920 = r242918 * r242919;
        double r242921 = y;
        double r242922 = r242920 * r242921;
        return r242922;
}
↓
double f(double x, double y) {
        double r242923 = x;
        double r242924 = 27.0;
        double r242925 = r242923 * r242924;
        double r242926 = y;
        double r242927 = r242925 * r242926;
        return r242927;
}

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