Average Error: 0.1 → 0.1
Time: 4.0s
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x - \left(y \cdot 4\right) \cdot z\]
x - \left(y \cdot 4\right) \cdot z
↓
x - \left(y \cdot 4\right) \cdot z
double f(double x, double y, double z) {
        double r123903 = x;
        double r123904 = y;
        double r123905 = 4.0;
        double r123906 = r123904 * r123905;
        double r123907 = z;
        double r123908 = r123906 * r123907;
        double r123909 = r123903 - r123908;
        return r123909;
}
↓
double f(double x, double y, double z) {
        double r123910 = x;
        double r123911 = y;
        double r123912 = 4.0;
        double r123913 = r123911 * r123912;
        double r123914 = z;
        double r123915 = r123913 * r123914;
        double r123916 = r123910 - r123915;
        return r123916;
}

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. Final simplification0.1

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

Reproduce

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