Average Error: 0.0 → 0.0
Time: 1.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 r23059349 = x;
        double r23059350 = y;
        double r23059351 = 4.0;
        double r23059352 = r23059350 * r23059351;
        double r23059353 = z;
        double r23059354 = r23059352 * r23059353;
        double r23059355 = r23059349 - r23059354;
        return r23059355;
}
↓
double f(double x, double y, double z) {
        double r23059356 = x;
        double r23059357 = 4.0;
        double r23059358 = y;
        double r23059359 = r23059357 * r23059358;
        double r23059360 = z;
        double r23059361 = r23059359 * r23059360;
        double r23059362 = r23059356 - r23059361;
        return r23059362;
}

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