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 r9105661 = x;
        double r9105662 = y;
        double r9105663 = 4.0;
        double r9105664 = r9105662 * r9105663;
        double r9105665 = z;
        double r9105666 = r9105664 * r9105665;
        double r9105667 = r9105661 - r9105666;
        return r9105667;
}
↓
double f(double x, double y, double z) {
        double r9105668 = x;
        double r9105669 = 4.0;
        double r9105670 = y;
        double r9105671 = r9105669 * r9105670;
        double r9105672 = z;
        double r9105673 = r9105671 * r9105672;
        double r9105674 = r9105668 - r9105673;
        return r9105674;
}

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