Average Error: 0.0 → 0.0
Time: 1.7m
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 r954566 = x;
        double r954567 = y;
        double r954568 = 4.0;
        double r954569 = r954567 * r954568;
        double r954570 = z;
        double r954571 = r954569 * r954570;
        double r954572 = r954566 - r954571;
        return r954572;
}
↓
double f(double x, double y, double z) {
        double r954573 = x;
        double r954574 = y;
        double r954575 = 4.0;
        double r954576 = r954574 * r954575;
        double r954577 = z;
        double r954578 = r954576 * r954577;
        double r954579 = r954573 - r954578;
        return r954579;
}

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