Average Error: 0.0 → 0.0
Time: 1.1s
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 r188962 = x;
        double r188963 = y;
        double r188964 = 4.0;
        double r188965 = r188963 * r188964;
        double r188966 = z;
        double r188967 = r188965 * r188966;
        double r188968 = r188962 - r188967;
        return r188968;
}
↓
double f(double x, double y, double z) {
        double r188969 = x;
        double r188970 = y;
        double r188971 = 4.0;
        double r188972 = r188970 * r188971;
        double r188973 = z;
        double r188974 = r188972 * r188973;
        double r188975 = r188969 - r188974;
        return r188975;
}

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 2020062 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))