Average Error: 0.0 → 0.0
Time: 3.8s
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 r222266 = x;
        double r222267 = y;
        double r222268 = 4.0;
        double r222269 = r222267 * r222268;
        double r222270 = z;
        double r222271 = r222269 * r222270;
        double r222272 = r222266 - r222271;
        return r222272;
}
↓
double f(double x, double y, double z) {
        double r222273 = x;
        double r222274 = y;
        double r222275 = 4.0;
        double r222276 = r222274 * r222275;
        double r222277 = z;
        double r222278 = r222276 * r222277;
        double r222279 = r222273 - r222278;
        return r222279;
}

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