Average Error: 0.0 → 0.0
Time: 12.6s
Precision: binary64
Cost: 448
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x + y \cdot \left(z \cdot -4\right)\]
x - \left(y \cdot 4\right) \cdot z
↓
x + y \cdot \left(z \cdot -4\right)
(FPCore (x y z) :precision binary64 (- x (* (* y 4.0) z)))
↓
(FPCore (x y z) :precision binary64 (+ x (* y (* z -4.0))))
double code(double x, double y, double z) {
	return x - ((y * 4.0) * z);
}
↓
double code(double x, double y, double z) {
	return x + (y * (z * -4.0));
}

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. Using strategy rm

  3. Applied pow1_binary64_55950.0

    \[\leadsto \color{blue}{{\left(x - \left(y \cdot 4\right) \cdot z\right)}^{1}}\]
  4. Using strategy rm

  5. Applied sub-neg_binary64_55270.0

    \[\leadsto {\color{blue}{\left(x + \left(-\left(y \cdot 4\right) \cdot z\right)\right)}}^{1}\]

  6. Simplified0.0

    \[\leadsto {\left(x + \color{blue}{y \cdot \left(z \cdot -4\right)}\right)}^{1}\]

  7. Final simplification0.0

    \[\leadsto x + y \cdot \left(z \cdot -4\right)\]

Reproduce

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