Average Error: 0.0 → 0.0
Time: 1.2s
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 r26106 = x;
        double r26107 = y;
        double r26108 = 4.0;
        double r26109 = r26107 * r26108;
        double r26110 = z;
        double r26111 = r26109 * r26110;
        double r26112 = r26106 - r26111;
        return r26112;
}
↓
double f(double x, double y, double z) {
        double r26113 = x;
        double r26114 = y;
        double r26115 = 4.0;
        double r26116 = r26114 * r26115;
        double r26117 = z;
        double r26118 = r26116 * r26117;
        double r26119 = r26113 - r26118;
        return r26119;
}

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