Average Error: 0.0 → 0.0
Time: 1.9s
Precision: binary64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + \left(y \cdot z + x \cdot y\right)\]
x + y \cdot \left(z + x\right)
↓
x + \left(y \cdot z + x \cdot y\right)
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) (x + ((double) (((double) (y * z)) + ((double) (x * y))))));
}

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 Error: 0.0 bits

    \[x + y \cdot \left(z + x\right)\]
  2. Using strategy rm

  3. Applied distribute-lft-inError: 0.0 bits

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

  4. Final simplificationError: 0.0 bits

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

Reproduce

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