Average Error: 0.0 → 0.0
Time: 6.9s
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 r1799167 = x;
        double r1799168 = y;
        double r1799169 = z;
        double r1799170 = r1799169 + r1799167;
        double r1799171 = r1799168 * r1799170;
        double r1799172 = r1799167 + r1799171;
        return r1799172;
}
↓
double f(double x, double y, double z) {
        double r1799173 = x;
        double r1799174 = z;
        double r1799175 = r1799173 + r1799174;
        double r1799176 = y;
        double r1799177 = r1799175 * r1799176;
        double r1799178 = r1799173 + r1799177;
        return r1799178;
}

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

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

Reproduce

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