Average Error: 0.0 → 0.0
Time: 1.4s
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 r9518374 = x;
        double r9518375 = y;
        double r9518376 = 4.0;
        double r9518377 = r9518375 * r9518376;
        double r9518378 = z;
        double r9518379 = r9518377 * r9518378;
        double r9518380 = r9518374 - r9518379;
        return r9518380;
}
↓
double f(double x, double y, double z) {
        double r9518381 = x;
        double r9518382 = 4.0;
        double r9518383 = y;
        double r9518384 = r9518382 * r9518383;
        double r9518385 = z;
        double r9518386 = r9518384 * r9518385;
        double r9518387 = r9518381 - r9518386;
        return r9518387;
}

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