Average Error: 0.3 → 0.3
Time: 24.0s
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 r275179 = x;
        double r275180 = 27.0;
        double r275181 = r275179 * r275180;
        double r275182 = y;
        double r275183 = r275181 * r275182;
        return r275183;
}
↓
double f(double x, double y) {
        double r275184 = x;
        double r275185 = 27.0;
        double r275186 = r275184 * r275185;
        double r275187 = y;
        double r275188 = r275186 * r275187;
        return r275188;
}

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