Average Error: 0.0 → 0.0
Time: 2.7s
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 r167951 = x;
        double r167952 = y;
        double r167953 = z;
        double r167954 = r167953 + r167951;
        double r167955 = r167952 * r167954;
        double r167956 = r167951 + r167955;
        return r167956;
}
↓
double f(double x, double y, double z) {
        double r167957 = x;
        double r167958 = y;
        double r167959 = z;
        double r167960 = r167958 * r167959;
        double r167961 = r167958 * r167957;
        double r167962 = r167960 + r167961;
        double r167963 = r167957 + r167962;
        return r167963;
}

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