Average Error: 0.0 → 0.0
Time: 2.8s
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 r190822 = x;
        double r190823 = y;
        double r190824 = 4.0;
        double r190825 = r190823 * r190824;
        double r190826 = z;
        double r190827 = r190825 * r190826;
        double r190828 = r190822 - r190827;
        return r190828;
}
↓
double f(double x, double y, double z) {
        double r190829 = x;
        double r190830 = y;
        double r190831 = 4.0;
        double r190832 = r190830 * r190831;
        double r190833 = z;
        double r190834 = r190832 * r190833;
        double r190835 = r190829 - r190834;
        return r190835;
}

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