Average Error: 0.0 → 0.0
Time: 14.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 r116039 = x;
        double r116040 = y;
        double r116041 = z;
        double r116042 = r116041 + r116039;
        double r116043 = r116040 * r116042;
        double r116044 = r116039 + r116043;
        return r116044;
}
↓
double f(double x, double y, double z) {
        double r116045 = x;
        double r116046 = y;
        double r116047 = z;
        double r116048 = r116047 + r116045;
        double r116049 = r116046 * r116048;
        double r116050 = r116045 + r116049;
        return r116050;
}

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