Average Error: 0.0 → 0.0
Time: 11.2s
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 r5503297 = x;
        double r5503298 = y;
        double r5503299 = z;
        double r5503300 = r5503299 + r5503297;
        double r5503301 = r5503298 * r5503300;
        double r5503302 = r5503297 + r5503301;
        return r5503302;
}
↓
double f(double x, double y, double z) {
        double r5503303 = x;
        double r5503304 = z;
        double r5503305 = r5503303 + r5503304;
        double r5503306 = y;
        double r5503307 = r5503305 * r5503306;
        double r5503308 = r5503303 + r5503307;
        return r5503308;
}

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