Average Error: 0.0 → 0.0
Time: 2.2s
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 r123419 = x;
        double r123420 = y;
        double r123421 = 4.0;
        double r123422 = r123420 * r123421;
        double r123423 = z;
        double r123424 = r123422 * r123423;
        double r123425 = r123419 - r123424;
        return r123425;
}
↓
double f(double x, double y, double z) {
        double r123426 = x;
        double r123427 = y;
        double r123428 = 4.0;
        double r123429 = r123427 * r123428;
        double r123430 = z;
        double r123431 = r123429 * r123430;
        double r123432 = r123426 - r123431;
        return r123432;
}

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