Average Error: 0.3 → 0.3
Time: 1.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 r252036 = x;
        double r252037 = 27.0;
        double r252038 = r252036 * r252037;
        double r252039 = y;
        double r252040 = r252038 * r252039;
        return r252040;
}
↓
double f(double x, double y) {
        double r252041 = x;
        double r252042 = 27.0;
        double r252043 = r252041 * r252042;
        double r252044 = y;
        double r252045 = r252043 * r252044;
        return r252045;
}

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