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 r262727 = x;
        double r262728 = 27.0;
        double r262729 = r262727 * r262728;
        double r262730 = y;
        double r262731 = r262729 * r262730;
        return r262731;
}
↓
double f(double x, double y) {
        double r262732 = x;
        double r262733 = 27.0;
        double r262734 = r262732 * r262733;
        double r262735 = y;
        double r262736 = r262734 * r262735;
        return r262736;
}

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