Average Error: 0.0 → 0.0
Time: 999.0ms
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + \left(y \cdot z + y \cdot x\right)\]
x + y \cdot \left(z + x\right)
↓
x + \left(y \cdot z + y \cdot x\right)
double f(double x, double y, double z) {
        double r115359 = x;
        double r115360 = y;
        double r115361 = z;
        double r115362 = r115361 + r115359;
        double r115363 = r115360 * r115362;
        double r115364 = r115359 + r115363;
        return r115364;
}
↓
double f(double x, double y, double z) {
        double r115365 = x;
        double r115366 = y;
        double r115367 = z;
        double r115368 = r115366 * r115367;
        double r115369 = r115366 * r115365;
        double r115370 = r115368 + r115369;
        double r115371 = r115365 + r115370;
        return r115371;
}

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. Final simplification0.0

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

Reproduce

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