Average Error: 0.3 → 0.3
Time: 2.2s
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 r233768 = x;
        double r233769 = 27.0;
        double r233770 = r233768 * r233769;
        double r233771 = y;
        double r233772 = r233770 * r233771;
        return r233772;
}
↓
double f(double x, double y) {
        double r233773 = x;
        double r233774 = 27.0;
        double r233775 = r233773 * r233774;
        double r233776 = y;
        double r233777 = r233775 * r233776;
        return r233777;
}

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