Average Error: 0.0 → 0.0
Time: 707.0ms
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 r173962 = x;
        double r173963 = y;
        double r173964 = 4.0;
        double r173965 = r173963 * r173964;
        double r173966 = z;
        double r173967 = r173965 * r173966;
        double r173968 = r173962 - r173967;
        return r173968;
}
↓
double f(double x, double y, double z) {
        double r173969 = x;
        double r173970 = y;
        double r173971 = 4.0;
        double r173972 = r173970 * r173971;
        double r173973 = z;
        double r173974 = r173972 * r173973;
        double r173975 = r173969 - r173974;
        return r173975;
}

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