Average Error: 0.0 → 0.0
Time: 9.4s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(y + x\right) \cdot 1 + \left(y + x\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(y + x\right) \cdot 1 + \left(y + x\right) \cdot z
double f(double x, double y, double z) {
        double r42938 = x;
        double r42939 = y;
        double r42940 = r42938 + r42939;
        double r42941 = z;
        double r42942 = 1.0;
        double r42943 = r42941 + r42942;
        double r42944 = r42940 * r42943;
        return r42944;
}
↓
double f(double x, double y, double z) {
        double r42945 = y;
        double r42946 = x;
        double r42947 = r42945 + r42946;
        double r42948 = 1.0;
        double r42949 = r42947 * r42948;
        double r42950 = z;
        double r42951 = r42947 * r42950;
        double r42952 = r42949 + r42951;
        return r42952;
}

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

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

  2. Simplified0.0

    \[\leadsto \color{blue}{\left(y + x\right) \cdot \left(z + 1\right)}\]
  3. Using strategy rm

  4. Applied distribute-lft-in0.0

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

  5. Simplified0.0

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

  6. Simplified0.0

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

  7. Final simplification0.0

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

Reproduce

herbie shell --seed 2019194 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  (* (+ x y) (+ z 1.0)))