Average Error: 0.0 → 0.0
Time: 12.3s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + \left(x + z\right) \cdot y\]
x + y \cdot \left(z + x\right)
↓
x + \left(x + z\right) \cdot y
double f(double x, double y, double z) {
        double r89907 = x;
        double r89908 = y;
        double r89909 = z;
        double r89910 = r89909 + r89907;
        double r89911 = r89908 * r89910;
        double r89912 = r89907 + r89911;
        return r89912;
}
↓
double f(double x, double y, double z) {
        double r89913 = x;
        double r89914 = z;
        double r89915 = r89913 + r89914;
        double r89916 = y;
        double r89917 = r89915 * r89916;
        double r89918 = r89913 + r89917;
        return r89918;
}

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

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

  3. Final simplification0.0

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

Reproduce

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