Average Error: 0.3 → 0.3
Time: 1.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 r254063 = x;
        double r254064 = 27.0;
        double r254065 = r254063 * r254064;
        double r254066 = y;
        double r254067 = r254065 * r254066;
        return r254067;
}
↓
double f(double x, double y) {
        double r254068 = x;
        double r254069 = 27.0;
        double r254070 = r254068 * r254069;
        double r254071 = y;
        double r254072 = r254070 * r254071;
        return r254072;
}

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