Average Error: 0.0 → 0.0
Time: 4.5s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot 1 + \left(x + y\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot 1 + \left(x + y\right) \cdot z
double f(double x, double y, double z) {
        double r1913526 = x;
        double r1913527 = y;
        double r1913528 = r1913526 + r1913527;
        double r1913529 = z;
        double r1913530 = 1.0;
        double r1913531 = r1913529 + r1913530;
        double r1913532 = r1913528 * r1913531;
        return r1913532;
}
↓
double f(double x, double y, double z) {
        double r1913533 = x;
        double r1913534 = y;
        double r1913535 = r1913533 + r1913534;
        double r1913536 = 1.0;
        double r1913537 = r1913535 * r1913536;
        double r1913538 = z;
        double r1913539 = r1913535 * r1913538;
        double r1913540 = r1913537 + r1913539;
        return r1913540;
}

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-rgt-in0.0

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

  4. Final simplification0.0

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

Reproduce

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