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

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 + y \cdot \left(z + x\right)\]
  2. Using strategy rm

  3. Applied distribute-lft-in0.0

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

  4. Applied associate-+r+0.0

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

  5. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2020121 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))