Average Error: 0.0 → 0.0
Time: 12.1s
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 r138105 = x;
        double r138106 = y;
        double r138107 = z;
        double r138108 = r138107 + r138105;
        double r138109 = r138106 * r138108;
        double r138110 = r138105 + r138109;
        return r138110;
}
↓
double f(double x, double y, double z) {
        double r138111 = x;
        double r138112 = y;
        double r138113 = z;
        double r138114 = r138113 + r138111;
        double r138115 = r138112 * r138114;
        double r138116 = r138111 + r138115;
        return r138116;
}

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))))