Average Error: 0.0 → 0.0
Time: 10.3s
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 r94485 = x;
        double r94486 = y;
        double r94487 = z;
        double r94488 = r94487 + r94485;
        double r94489 = r94486 * r94488;
        double r94490 = r94485 + r94489;
        return r94490;
}
↓
double f(double x, double y, double z) {
        double r94491 = x;
        double r94492 = y;
        double r94493 = z;
        double r94494 = r94493 + r94491;
        double r94495 = r94492 * r94494;
        double r94496 = r94491 + r94495;
        return r94496;
}

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