Average Error: 0.3 → 0.3
Time: 1.3s
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 r321027 = x;
        double r321028 = 27.0;
        double r321029 = r321027 * r321028;
        double r321030 = y;
        double r321031 = r321029 * r321030;
        return r321031;
}
↓
double f(double x, double y) {
        double r321032 = x;
        double r321033 = 27.0;
        double r321034 = r321032 * r321033;
        double r321035 = y;
        double r321036 = r321034 * r321035;
        return r321036;
}

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