Average Error: 0.0 → 0.0
Time: 6.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 r104131 = x;
        double r104132 = y;
        double r104133 = z;
        double r104134 = r104133 + r104131;
        double r104135 = r104132 * r104134;
        double r104136 = r104131 + r104135;
        return r104136;
}
↓
double f(double x, double y, double z) {
        double r104137 = x;
        double r104138 = y;
        double r104139 = z;
        double r104140 = r104139 + r104137;
        double r104141 = r104138 * r104140;
        double r104142 = r104137 + r104141;
        return r104142;
}

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