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 r248950 = x;
        double r248951 = 27.0;
        double r248952 = r248950 * r248951;
        double r248953 = y;
        double r248954 = r248952 * r248953;
        return r248954;
}
↓
double f(double x, double y) {
        double r248955 = x;
        double r248956 = 27.0;
        double r248957 = r248955 * r248956;
        double r248958 = y;
        double r248959 = r248957 * r248958;
        return r248959;
}

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