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 r227992 = x;
        double r227993 = y;
        double r227994 = 4.0;
        double r227995 = r227993 * r227994;
        double r227996 = z;
        double r227997 = r227995 * r227996;
        double r227998 = r227992 - r227997;
        return r227998;
}
↓
double f(double x, double y, double z) {
        double r227999 = x;
        double r228000 = y;
        double r228001 = 4.0;
        double r228002 = r228000 * r228001;
        double r228003 = z;
        double r228004 = r228002 * r228003;
        double r228005 = r227999 - r228004;
        return r228005;
}

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