Average Error: 0.4 → 0.4
Time: 19.9s
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 r253391 = x;
        double r253392 = 27.0;
        double r253393 = r253391 * r253392;
        double r253394 = y;
        double r253395 = r253393 * r253394;
        return r253395;
}
↓
double f(double x, double y) {
        double r253396 = x;
        double r253397 = 27.0;
        double r253398 = r253396 * r253397;
        double r253399 = y;
        double r253400 = r253398 * r253399;
        return r253400;
}

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.4

    \[\left(x \cdot 27\right) \cdot y\]

  2. Final simplification0.4

    \[\leadsto \left(x \cdot 27\right) \cdot y\]

Reproduce

herbie shell --seed 2020042 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, F"
  :precision binary64
  (* (* x 27) y))