Average Error: 0.0 → 0.0
Time: 2.6s
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x - 4 \cdot \left(z \cdot y\right)\]
x - \left(y \cdot 4\right) \cdot z
↓
x - 4 \cdot \left(z \cdot y\right)
double f(double x, double y, double z) {
        double r131586 = x;
        double r131587 = y;
        double r131588 = 4.0;
        double r131589 = r131587 * r131588;
        double r131590 = z;
        double r131591 = r131589 * r131590;
        double r131592 = r131586 - r131591;
        return r131592;
}
↓
double f(double x, double y, double z) {
        double r131593 = x;
        double r131594 = 4.0;
        double r131595 = z;
        double r131596 = y;
        double r131597 = r131595 * r131596;
        double r131598 = r131594 * r131597;
        double r131599 = r131593 - r131598;
        return r131599;
}

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. Taylor expanded around inf 0.0

    \[\leadsto \color{blue}{x - 4 \cdot \left(z \cdot y\right)}\]

  3. Final simplification0.0

    \[\leadsto x - 4 \cdot \left(z \cdot y\right)\]

Reproduce

herbie shell --seed 2019304 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))