Average Error: 0.3 → 0.3
Time: 1.4s
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 r253556 = x;
        double r253557 = 27.0;
        double r253558 = r253556 * r253557;
        double r253559 = y;
        double r253560 = r253558 * r253559;
        return r253560;
}
↓
double f(double x, double y) {
        double r253561 = x;
        double r253562 = 27.0;
        double r253563 = r253561 * r253562;
        double r253564 = y;
        double r253565 = r253563 * r253564;
        return r253565;
}

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