Average Error: 0.3 → 0.3
Time: 5.0s
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 r166010 = x;
        double r166011 = 27.0;
        double r166012 = r166010 * r166011;
        double r166013 = y;
        double r166014 = r166012 * r166013;
        return r166014;
}
↓
double f(double x, double y) {
        double r166015 = x;
        double r166016 = 27.0;
        double r166017 = r166015 * r166016;
        double r166018 = y;
        double r166019 = r166017 * r166018;
        return r166019;
}

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