Average Error: 0.0 → 0.0
Time: 11.7s
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 r232015 = x;
        double r232016 = y;
        double r232017 = 4.0;
        double r232018 = r232016 * r232017;
        double r232019 = z;
        double r232020 = r232018 * r232019;
        double r232021 = r232015 - r232020;
        return r232021;
}
↓
double f(double x, double y, double z) {
        double r232022 = x;
        double r232023 = y;
        double r232024 = 4.0;
        double r232025 = r232023 * r232024;
        double r232026 = z;
        double r232027 = r232025 * r232026;
        double r232028 = r232022 - r232027;
        return r232028;
}

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