Average Error: 0.0 → 0.0
Time: 3.1s
Precision: binary64
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x - \left(z \cdot y\right) \cdot 4\]
x - \left(y \cdot 4\right) \cdot z
↓
x - \left(z \cdot y\right) \cdot 4
(FPCore (x y z) :precision binary64 (- x (* (* y 4.0) z)))
↓
(FPCore (x y z) :precision binary64 (- x (* (* z y) 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 - ((z * y) * 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. Taylor expanded around 0 0.0

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

  4. Applied *-commutative_binary64_81930.0

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

  5. Final simplification0.0

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

Reproduce

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