Average Error: 0.0 → 0.0
Time: 969.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 r98590 = x;
        double r98591 = y;
        double r98592 = z;
        double r98593 = r98592 + r98590;
        double r98594 = r98591 * r98593;
        double r98595 = r98590 + r98594;
        return r98595;
}
↓
double f(double x, double y, double z) {
        double r98596 = x;
        double r98597 = y;
        double r98598 = z;
        double r98599 = r98597 * r98598;
        double r98600 = r98597 * r98596;
        double r98601 = r98599 + r98600;
        double r98602 = r98596 + r98601;
        return r98602;
}

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 2020062 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))