Average Error: 0.0 → 0.0
Time: 13.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 r8654589 = x;
        double r8654590 = y;
        double r8654591 = z;
        double r8654592 = r8654591 + r8654589;
        double r8654593 = r8654590 * r8654592;
        double r8654594 = r8654589 + r8654593;
        return r8654594;
}
↓
double f(double x, double y, double z) {
        double r8654595 = x;
        double r8654596 = y;
        double r8654597 = z;
        double r8654598 = r8654597 + r8654595;
        double r8654599 = r8654596 * r8654598;
        double r8654600 = r8654595 + r8654599;
        return r8654600;
}

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