Average Error: 0.0 → 0.0
Time: 922.0ms
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 r284574 = x;
        double r284575 = y;
        double r284576 = 4.0;
        double r284577 = r284575 * r284576;
        double r284578 = z;
        double r284579 = r284577 * r284578;
        double r284580 = r284574 - r284579;
        return r284580;
}
↓
double f(double x, double y, double z) {
        double r284581 = x;
        double r284582 = 4.0;
        double r284583 = z;
        double r284584 = y;
        double r284585 = r284583 * r284584;
        double r284586 = r284582 * r284585;
        double r284587 = r284581 - r284586;
        return r284587;
}

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