Average Error: 0.3 → 0.3
Time: 1.2s
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 r262197 = x;
        double r262198 = 27.0;
        double r262199 = r262197 * r262198;
        double r262200 = y;
        double r262201 = r262199 * r262200;
        return r262201;
}
↓
double f(double x, double y) {
        double r262202 = x;
        double r262203 = 27.0;
        double r262204 = r262202 * r262203;
        double r262205 = y;
        double r262206 = r262204 * r262205;
        return r262206;
}

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))