Average Error: 0.0 → 0.0
Time: 26.2s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x \cdot y + \left(z \cdot y + x\right)\]
x + y \cdot \left(z + x\right)
↓
x \cdot y + \left(z \cdot y + x\right)
double f(double x, double y, double z) {
        double r5458496 = x;
        double r5458497 = y;
        double r5458498 = z;
        double r5458499 = r5458498 + r5458496;
        double r5458500 = r5458497 * r5458499;
        double r5458501 = r5458496 + r5458500;
        return r5458501;
}
↓
double f(double x, double y, double z) {
        double r5458502 = x;
        double r5458503 = y;
        double r5458504 = r5458502 * r5458503;
        double r5458505 = z;
        double r5458506 = r5458505 * r5458503;
        double r5458507 = r5458506 + r5458502;
        double r5458508 = r5458504 + r5458507;
        return r5458508;
}

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

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

Reproduce

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