Average Error: 0.1 → 0.0
Time: 3.7s
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 r188602 = x;
        double r188603 = y;
        double r188604 = 4.0;
        double r188605 = r188603 * r188604;
        double r188606 = z;
        double r188607 = r188605 * r188606;
        double r188608 = r188602 - r188607;
        return r188608;
}
↓
double f(double x, double y, double z) {
        double r188609 = x;
        double r188610 = 4.0;
        double r188611 = z;
        double r188612 = y;
        double r188613 = r188611 * r188612;
        double r188614 = r188610 * r188613;
        double r188615 = r188609 - r188614;
        return r188615;
}

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.1

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