Average Error: 0.0 → 0.0
Time: 1.6s
Precision: 64
\[x - y \cdot z\]
↓
\[\left(x + y \cdot z\right) \cdot \frac{x - y \cdot z}{x + y \cdot z}\]
x - y \cdot z
↓
\left(x + y \cdot z\right) \cdot \frac{x - y \cdot z}{x + y \cdot z}
double code(double x, double y, double z) {
	return (x - (y * z));
}
↓
double code(double x, double y, double z) {
	return ((x + (y * z)) * ((x - (y * z)) / (x + (y * z))));
}

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

Target

Original0.0
Target0.0
Herbie0.0
\[\frac{x + y \cdot z}{\frac{x + y \cdot z}{x - y \cdot z}}\]

Derivation

  1. Initial program 0.0

    \[x - y \cdot z\]
  2. Using strategy rm

  3. Applied flip--28.8

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

  5. Applied *-un-lft-identity28.8

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

  6. Applied difference-of-squares28.8

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

  7. Applied times-frac0.0

    \[\leadsto \color{blue}{\frac{x + y \cdot z}{1} \cdot \frac{x - y \cdot z}{x + y \cdot z}}\]

  8. Simplified0.0

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

  9. Final simplification0.0

    \[\leadsto \left(x + y \cdot z\right) \cdot \frac{x - y \cdot z}{x + y \cdot z}\]

Reproduce

herbie shell --seed 2020057 
(FPCore (x y z)
  :name "Diagrams.Solve.Tridiagonal:solveTriDiagonal from diagrams-solve-0.1, C"
  :precision binary64

  :herbie-target
  (/ (+ x (* y z)) (/ (+ x (* y z)) (- x (* y z))))

  (- x (* y z)))