Average Error: 0.0 → 0.0
Time: 4.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 r157526 = x;
        double r157527 = y;
        double r157528 = z;
        double r157529 = r157528 + r157526;
        double r157530 = r157527 * r157529;
        double r157531 = r157526 + r157530;
        return r157531;
}
↓
double f(double x, double y, double z) {
        double r157532 = x;
        double r157533 = y;
        double r157534 = z;
        double r157535 = r157534 + r157532;
        double r157536 = r157533 * r157535;
        double r157537 = r157532 + r157536;
        return r157537;
}

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