Average Error: 0.3 → 0.3
Time: 31.9s
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 r138222 = x;
        double r138223 = 27.0;
        double r138224 = r138222 * r138223;
        double r138225 = y;
        double r138226 = r138224 * r138225;
        return r138226;
}
↓
double f(double x, double y) {
        double r138227 = x;
        double r138228 = 27.0;
        double r138229 = r138227 * r138228;
        double r138230 = y;
        double r138231 = r138229 * r138230;
        return r138231;
}

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