Average Error: 0.0 → 0.0
Time: 1.2s
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x - \left(4 \cdot y\right) \cdot z\]
x - \left(y \cdot 4\right) \cdot z
↓
x - \left(4 \cdot y\right) \cdot z
double f(double x, double y, double z) {
        double r6678531 = x;
        double r6678532 = y;
        double r6678533 = 4.0;
        double r6678534 = r6678532 * r6678533;
        double r6678535 = z;
        double r6678536 = r6678534 * r6678535;
        double r6678537 = r6678531 - r6678536;
        return r6678537;
}
↓
double f(double x, double y, double z) {
        double r6678538 = x;
        double r6678539 = 4.0;
        double r6678540 = y;
        double r6678541 = r6678539 * r6678540;
        double r6678542 = z;
        double r6678543 = r6678541 * r6678542;
        double r6678544 = r6678538 - r6678543;
        return r6678544;
}

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(4 \cdot y\right) \cdot z\]

Reproduce

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