Average Error: 0.3 → 0.3
Time: 2.1s
Precision: 64
\[\left(x \cdot 27\right) \cdot y\]
↓
\[x \cdot \left(27 \cdot y\right)\]
\left(x \cdot 27\right) \cdot y
↓
x \cdot \left(27 \cdot y\right)
double f(double x, double y) {
        double r1144 = x;
        double r1145 = 27.0;
        double r1146 = r1144 * r1145;
        double r1147 = y;
        double r1148 = r1146 * r1147;
        return r1148;
}
↓
double f(double x, double y) {
        double r1149 = x;
        double r1150 = 27.0;
        double r1151 = y;
        double r1152 = r1150 * r1151;
        double r1153 = r1149 * r1152;
        return r1153;
}

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. Using strategy rm

  3. Applied associate-*l*0.3

    \[\leadsto \color{blue}{x \cdot \left(27 \cdot y\right)}\]

  4. Final simplification0.3

    \[\leadsto x \cdot \left(27 \cdot y\right)\]

Reproduce

herbie shell --seed 2020025 +o rules:numerics
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, F"
  :precision binary64
  (* (* x 27) y))