Average Error: 0.0 → 0.0
Time: 14.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 r3070512 = x;
        double r3070513 = y;
        double r3070514 = r3070512 + r3070513;
        double r3070515 = z;
        double r3070516 = 1.0;
        double r3070517 = r3070515 + r3070516;
        double r3070518 = r3070514 * r3070517;
        return r3070518;
}
↓
double f(double x, double y, double z) {
        double r3070519 = y;
        double r3070520 = x;
        double r3070521 = r3070519 + r3070520;
        double r3070522 = 1.0;
        double r3070523 = r3070521 * r3070522;
        double r3070524 = z;
        double r3070525 = r3070521 * r3070524;
        double r3070526 = r3070523 + r3070525;
        return r3070526;
}

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 distribute-lft-in0.0

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

  4. Final simplification0.0

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

Reproduce

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