Average Error: 0.3 → 0.3
Time: 1.3s
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 r243212 = x;
        double r243213 = 27.0;
        double r243214 = r243212 * r243213;
        double r243215 = y;
        double r243216 = r243214 * r243215;
        return r243216;
}
↓
double f(double x, double y) {
        double r243217 = x;
        double r243218 = 27.0;
        double r243219 = r243217 * r243218;
        double r243220 = y;
        double r243221 = r243219 * r243220;
        return r243221;
}

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