Average Error: 0.3 → 0.3
Time: 1.5s
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 r237137 = x;
        double r237138 = 27.0;
        double r237139 = r237137 * r237138;
        double r237140 = y;
        double r237141 = r237139 * r237140;
        return r237141;
}
↓
double f(double x, double y) {
        double r237142 = x;
        double r237143 = 27.0;
        double r237144 = r237142 * r237143;
        double r237145 = y;
        double r237146 = r237144 * r237145;
        return r237146;
}

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