Average Error: 0.3 → 0.3
Time: 32.6s
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 r135923 = x;
        double r135924 = 27.0;
        double r135925 = r135923 * r135924;
        double r135926 = y;
        double r135927 = r135925 * r135926;
        return r135927;
}
↓
double f(double x, double y) {
        double r135928 = x;
        double r135929 = 27.0;
        double r135930 = r135928 * r135929;
        double r135931 = y;
        double r135932 = r135930 * r135931;
        return r135932;
}

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