Average Error: 0.1 → 0.0
Time: 10.4s
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x - y \cdot \left(z \cdot 4\right)\]
x - \left(y \cdot 4\right) \cdot z
↓
x - y \cdot \left(z \cdot 4\right)
double f(double x, double y, double z) {
        double r124021 = x;
        double r124022 = y;
        double r124023 = 4.0;
        double r124024 = r124022 * r124023;
        double r124025 = z;
        double r124026 = r124024 * r124025;
        double r124027 = r124021 - r124026;
        return r124027;
}
↓
double f(double x, double y, double z) {
        double r124028 = x;
        double r124029 = y;
        double r124030 = z;
        double r124031 = 4.0;
        double r124032 = r124030 * r124031;
        double r124033 = r124029 * r124032;
        double r124034 = r124028 - r124033;
        return r124034;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[x - \left(y \cdot 4\right) \cdot z\]
  2. Using strategy rm

  3. Applied associate-*l*0.0

    \[\leadsto x - \color{blue}{y \cdot \left(4 \cdot z\right)}\]

  4. Simplified0.0

    \[\leadsto x - y \cdot \color{blue}{\left(z \cdot 4\right)}\]

  5. Final simplification0.0

    \[\leadsto x - y \cdot \left(z \cdot 4\right)\]

Reproduce

herbie shell --seed 2019326 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))