Average Error: 0.0 → 0.0
Time: 3.6s
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 r141517 = x;
        double r141518 = y;
        double r141519 = z;
        double r141520 = r141519 + r141517;
        double r141521 = r141518 * r141520;
        double r141522 = r141517 + r141521;
        return r141522;
}
↓
double f(double x, double y, double z) {
        double r141523 = x;
        double r141524 = y;
        double r141525 = z;
        double r141526 = r141525 + r141523;
        double r141527 = r141524 * r141526;
        double r141528 = r141523 + r141527;
        return r141528;
}

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