Average Error: 0.0 → 0.0
Time: 491.0ms
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 r245797 = x;
        double r245798 = y;
        double r245799 = 4.0;
        double r245800 = r245798 * r245799;
        double r245801 = z;
        double r245802 = r245800 * r245801;
        double r245803 = r245797 - r245802;
        return r245803;
}
↓
double f(double x, double y, double z) {
        double r245804 = x;
        double r245805 = y;
        double r245806 = 4.0;
        double r245807 = r245805 * r245806;
        double r245808 = z;
        double r245809 = r245807 * r245808;
        double r245810 = r245804 - r245809;
        return r245810;
}

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