Average Error: 0.0 → 0.0
Time: 2.4s
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 r95981 = x;
        double r95982 = y;
        double r95983 = z;
        double r95984 = r95983 + r95981;
        double r95985 = r95982 * r95984;
        double r95986 = r95981 + r95985;
        return r95986;
}
↓
double f(double x, double y, double z) {
        double r95987 = x;
        double r95988 = y;
        double r95989 = z;
        double r95990 = r95989 + r95987;
        double r95991 = r95988 * r95990;
        double r95992 = r95987 + r95991;
        return r95992;
}

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