Average Error: 0.0 → 0.0
Time: 1.1s
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 r83009 = x;
        double r83010 = y;
        double r83011 = z;
        double r83012 = r83011 + r83009;
        double r83013 = r83010 * r83012;
        double r83014 = r83009 + r83013;
        return r83014;
}
↓
double f(double x, double y, double z) {
        double r83015 = x;
        double r83016 = y;
        double r83017 = z;
        double r83018 = r83016 * r83017;
        double r83019 = r83016 * r83015;
        double r83020 = r83018 + r83019;
        double r83021 = r83015 + r83020;
        return r83021;
}

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