Average Error: 0.0 → 0.0
Time: 1.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 r153888 = x;
        double r153889 = y;
        double r153890 = z;
        double r153891 = r153890 + r153888;
        double r153892 = r153889 * r153891;
        double r153893 = r153888 + r153892;
        return r153893;
}
↓
double f(double x, double y, double z) {
        double r153894 = x;
        double r153895 = y;
        double r153896 = z;
        double r153897 = r153896 + r153894;
        double r153898 = r153895 * r153897;
        double r153899 = r153894 + r153898;
        return r153899;
}

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