Average Error: 0.0 → 0.0
Time: 3.8s
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 r116482 = x;
        double r116483 = y;
        double r116484 = z;
        double r116485 = r116484 + r116482;
        double r116486 = r116483 * r116485;
        double r116487 = r116482 + r116486;
        return r116487;
}
↓
double f(double x, double y, double z) {
        double r116488 = x;
        double r116489 = y;
        double r116490 = z;
        double r116491 = r116490 + r116488;
        double r116492 = r116489 * r116491;
        double r116493 = r116488 + r116492;
        return r116493;
}

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