Average Error: 0.1 → 0.0
Time: 11.6s
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 r161874 = x;
        double r161875 = y;
        double r161876 = 4.0;
        double r161877 = r161875 * r161876;
        double r161878 = z;
        double r161879 = r161877 * r161878;
        double r161880 = r161874 - r161879;
        return r161880;
}
↓
double f(double x, double y, double z) {
        double r161881 = x;
        double r161882 = y;
        double r161883 = z;
        double r161884 = 4.0;
        double r161885 = r161883 * r161884;
        double r161886 = r161882 * r161885;
        double r161887 = r161881 - r161886;
        return r161887;
}

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)))