Average Error: 0.0 → 0.0
Time: 8.8s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + \left(x + z\right) \cdot y\]
x + y \cdot \left(z + x\right)
↓
x + \left(x + z\right) \cdot y
double f(double x, double y, double z) {
        double r4700806 = x;
        double r4700807 = y;
        double r4700808 = z;
        double r4700809 = r4700808 + r4700806;
        double r4700810 = r4700807 * r4700809;
        double r4700811 = r4700806 + r4700810;
        return r4700811;
}
↓
double f(double x, double y, double z) {
        double r4700812 = x;
        double r4700813 = z;
        double r4700814 = r4700812 + r4700813;
        double r4700815 = y;
        double r4700816 = r4700814 * r4700815;
        double r4700817 = r4700812 + r4700816;
        return r4700817;
}

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 + \left(x + z\right) \cdot y\]

Reproduce

herbie shell --seed 2019165 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  (+ x (* y (+ z x))))