Average Error: 0.0 → 0.0
Time: 12.5s
Precision: 64
\[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 f(double x, double y, double z) {
        double r82493 = x;
        double r82494 = y;
        double r82495 = z;
        double r82496 = r82495 + r82493;
        double r82497 = r82494 * r82496;
        double r82498 = r82493 + r82497;
        return r82498;
}
↓
double f(double x, double y, double z) {
        double r82499 = x;
        double r82500 = y;
        double r82501 = z;
        double r82502 = r82500 * r82501;
        double r82503 = r82499 * r82500;
        double r82504 = r82502 + r82503;
        double r82505 = r82499 + r82504;
        return r82505;
}

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. Simplified0.0

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

  5. Final simplification0.0

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

Reproduce

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