Average Error: 0.0 → 0.0
Time: 8.0s
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 r11753156 = x;
        double r11753157 = y;
        double r11753158 = 4.0;
        double r11753159 = r11753157 * r11753158;
        double r11753160 = z;
        double r11753161 = r11753159 * r11753160;
        double r11753162 = r11753156 - r11753161;
        return r11753162;
}
↓
double f(double x, double y, double z) {
        double r11753163 = x;
        double r11753164 = y;
        double r11753165 = 4.0;
        double r11753166 = r11753164 * r11753165;
        double r11753167 = z;
        double r11753168 = r11753166 * r11753167;
        double r11753169 = r11753163 - r11753168;
        return r11753169;
}

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 2019174 +o rules:numerics
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  (- x (* (* y 4.0) z)))