Average Error: 0.0 → 0.0
Time: 9.4s
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 r119434 = x;
        double r119435 = y;
        double r119436 = 4.0;
        double r119437 = r119435 * r119436;
        double r119438 = z;
        double r119439 = r119437 * r119438;
        double r119440 = r119434 - r119439;
        return r119440;
}
↓
double f(double x, double y, double z) {
        double r119441 = x;
        double r119442 = y;
        double r119443 = 4.0;
        double r119444 = r119442 * r119443;
        double r119445 = z;
        double r119446 = r119444 * r119445;
        double r119447 = r119441 - r119446;
        return r119447;
}

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