Average Error: 0.0 → 0.0
Time: 3.6s
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 r203786 = x;
        double r203787 = y;
        double r203788 = 4.0;
        double r203789 = r203787 * r203788;
        double r203790 = z;
        double r203791 = r203789 * r203790;
        double r203792 = r203786 - r203791;
        return r203792;
}
↓
double f(double x, double y, double z) {
        double r203793 = x;
        double r203794 = y;
        double r203795 = 4.0;
        double r203796 = r203794 * r203795;
        double r203797 = z;
        double r203798 = r203796 * r203797;
        double r203799 = r203793 - r203798;
        return r203799;
}

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