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 r212740 = x;
        double r212741 = y;
        double r212742 = 4.0;
        double r212743 = r212741 * r212742;
        double r212744 = z;
        double r212745 = r212743 * r212744;
        double r212746 = r212740 - r212745;
        return r212746;
}
↓
double f(double x, double y, double z) {
        double r212747 = x;
        double r212748 = 4.0;
        double r212749 = z;
        double r212750 = y;
        double r212751 = r212749 * r212750;
        double r212752 = r212748 * r212751;
        double r212753 = r212747 - r212752;
        return r212753;
}

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