Average Error: 0.0 → 0.0
Time: 1.7s
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 r296401 = x;
        double r296402 = y;
        double r296403 = 4.0;
        double r296404 = r296402 * r296403;
        double r296405 = z;
        double r296406 = r296404 * r296405;
        double r296407 = r296401 - r296406;
        return r296407;
}
↓
double f(double x, double y, double z) {
        double r296408 = x;
        double r296409 = y;
        double r296410 = 4.0;
        double r296411 = r296409 * r296410;
        double r296412 = z;
        double r296413 = r296411 * r296412;
        double r296414 = r296408 - r296413;
        return r296414;
}

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