Average Error: 0.0 → 0.0
Time: 1.4s
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 r226652 = x;
        double r226653 = y;
        double r226654 = 4.0;
        double r226655 = r226653 * r226654;
        double r226656 = z;
        double r226657 = r226655 * r226656;
        double r226658 = r226652 - r226657;
        return r226658;
}
↓
double f(double x, double y, double z) {
        double r226659 = x;
        double r226660 = y;
        double r226661 = 4.0;
        double r226662 = r226660 * r226661;
        double r226663 = z;
        double r226664 = r226662 * r226663;
        double r226665 = r226659 - r226664;
        return r226665;
}

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