Average Error: 0.0 → 0.0
Time: 5.6s
Precision: 64
\[x - \left(y \cdot 4.0\right) \cdot z\]
↓
\[x - \left(4.0 \cdot y\right) \cdot z\]
x - \left(y \cdot 4.0\right) \cdot z
↓
x - \left(4.0 \cdot y\right) \cdot z
double f(double x, double y, double z) {
        double r13521269 = x;
        double r13521270 = y;
        double r13521271 = 4.0;
        double r13521272 = r13521270 * r13521271;
        double r13521273 = z;
        double r13521274 = r13521272 * r13521273;
        double r13521275 = r13521269 - r13521274;
        return r13521275;
}
↓
double f(double x, double y, double z) {
        double r13521276 = x;
        double r13521277 = 4.0;
        double r13521278 = y;
        double r13521279 = r13521277 * r13521278;
        double r13521280 = z;
        double r13521281 = r13521279 * r13521280;
        double r13521282 = r13521276 - r13521281;
        return r13521282;
}

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.0\right) \cdot z\]

  2. Final simplification0.0

    \[\leadsto x - \left(4.0 \cdot y\right) \cdot z\]

Reproduce

herbie shell --seed 2019163 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  (- x (* (* y 4.0) z)))