Average Error: 0.0 → 0.0
Time: 2.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 r207901 = x;
        double r207902 = y;
        double r207903 = 4.0;
        double r207904 = r207902 * r207903;
        double r207905 = z;
        double r207906 = r207904 * r207905;
        double r207907 = r207901 - r207906;
        return r207907;
}
↓
double f(double x, double y, double z) {
        double r207908 = x;
        double r207909 = y;
        double r207910 = 4.0;
        double r207911 = r207909 * r207910;
        double r207912 = z;
        double r207913 = r207911 * r207912;
        double r207914 = r207908 - r207913;
        return r207914;
}

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.0

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

  2. Final simplification0.0

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

Reproduce

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