Average Error: 0.0 → 0.0
Time: 1.3s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + y \cdot \left(z + x\right)\]
x + y \cdot \left(z + x\right)
↓
x + y \cdot \left(z + x\right)
double f(double x, double y, double z) {
        double r82260 = x;
        double r82261 = y;
        double r82262 = z;
        double r82263 = r82262 + r82260;
        double r82264 = r82261 * r82263;
        double r82265 = r82260 + r82264;
        return r82265;
}
↓
double f(double x, double y, double z) {
        double r82266 = x;
        double r82267 = y;
        double r82268 = z;
        double r82269 = r82268 + r82266;
        double r82270 = r82267 * r82269;
        double r82271 = r82266 + r82270;
        return r82271;
}

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 + y \cdot \left(z + x\right)\]

Reproduce

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