Average Error: 0.0 → 0.0
Time: 1.3s
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x - \left(4 \cdot y\right) \cdot z\]
x - \left(y \cdot 4\right) \cdot z
↓
x - \left(4 \cdot y\right) \cdot z
double f(double x, double y, double z) {
        double r8368819 = x;
        double r8368820 = y;
        double r8368821 = 4.0;
        double r8368822 = r8368820 * r8368821;
        double r8368823 = z;
        double r8368824 = r8368822 * r8368823;
        double r8368825 = r8368819 - r8368824;
        return r8368825;
}
↓
double f(double x, double y, double z) {
        double r8368826 = x;
        double r8368827 = 4.0;
        double r8368828 = y;
        double r8368829 = r8368827 * r8368828;
        double r8368830 = z;
        double r8368831 = r8368829 * r8368830;
        double r8368832 = r8368826 - r8368831;
        return r8368832;
}

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

Reproduce

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