Average Error: 0.0 → 0.0
Time: 1.5s
Precision: 64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + \left(y \cdot z + y \cdot x\right)\]
x + y \cdot \left(z + x\right)
↓
x + \left(y \cdot z + y \cdot x\right)
double f(double x, double y, double z) {
        double r148915 = x;
        double r148916 = y;
        double r148917 = z;
        double r148918 = r148917 + r148915;
        double r148919 = r148916 * r148918;
        double r148920 = r148915 + r148919;
        return r148920;
}
↓
double f(double x, double y, double z) {
        double r148921 = x;
        double r148922 = y;
        double r148923 = z;
        double r148924 = r148922 * r148923;
        double r148925 = r148922 * r148921;
        double r148926 = r148924 + r148925;
        double r148927 = r148921 + r148926;
        return r148927;
}

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. Using strategy rm

  3. Applied distribute-lft-in0.0

    \[\leadsto x + \color{blue}{\left(y \cdot z + y \cdot x\right)}\]

  4. Final simplification0.0

    \[\leadsto x + \left(y \cdot z + y \cdot x\right)\]

Reproduce

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