Average Error: 0.0 → 0.0
Time: 11.5s
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x - \left(y \cdot 4\right) \cdot z\]
x - \left(y \cdot 4\right) \cdot z
↓
x - \left(y \cdot 4\right) \cdot z
double f(double x, double y, double z) {
        double r225147 = x;
        double r225148 = y;
        double r225149 = 4.0;
        double r225150 = r225148 * r225149;
        double r225151 = z;
        double r225152 = r225150 * r225151;
        double r225153 = r225147 - r225152;
        return r225153;
}
↓
double f(double x, double y, double z) {
        double r225154 = x;
        double r225155 = y;
        double r225156 = 4.0;
        double r225157 = r225155 * r225156;
        double r225158 = z;
        double r225159 = r225157 * r225158;
        double r225160 = r225154 - r225159;
        return r225160;
}

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

Reproduce

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