Average Error: 0.0 → 0.0
Time: 2.0s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(z + 1\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(z + 1\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r51307 = x;
        double r51308 = y;
        double r51309 = r51307 + r51308;
        double r51310 = z;
        double r51311 = 1.0;
        double r51312 = r51310 + r51311;
        double r51313 = r51309 * r51312;
        return r51313;
}
↓
double f(double x, double y, double z) {
        double r51314 = z;
        double r51315 = 1.0;
        double r51316 = r51314 + r51315;
        double r51317 = x;
        double r51318 = y;
        double r51319 = r51317 + r51318;
        double r51320 = r51316 * r51319;
        return r51320;
}

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

  3. Applied *-commutative0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2020057 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))