Average Error: 0.0 → 0.0
Time: 1.3s
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 r164638 = x;
        double r164639 = y;
        double r164640 = 4.0;
        double r164641 = r164639 * r164640;
        double r164642 = z;
        double r164643 = r164641 * r164642;
        double r164644 = r164638 - r164643;
        return r164644;
}
↓
double f(double x, double y, double z) {
        double r164645 = x;
        double r164646 = y;
        double r164647 = 4.0;
        double r164648 = r164646 * r164647;
        double r164649 = z;
        double r164650 = r164648 * r164649;
        double r164651 = r164645 - r164650;
        return r164651;
}

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