Average Error: 0.0 → 0.0
Time: 12.4s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(x + y\right) \cdot 1.0 + \left(x + y\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(x + y\right) \cdot 1.0 + \left(x + y\right) \cdot z
double f(double x, double y, double z) {
        double r2708965 = x;
        double r2708966 = y;
        double r2708967 = r2708965 + r2708966;
        double r2708968 = z;
        double r2708969 = 1.0;
        double r2708970 = r2708968 + r2708969;
        double r2708971 = r2708967 * r2708970;
        return r2708971;
}
↓
double f(double x, double y, double z) {
        double r2708972 = x;
        double r2708973 = y;
        double r2708974 = r2708972 + r2708973;
        double r2708975 = 1.0;
        double r2708976 = r2708974 * r2708975;
        double r2708977 = z;
        double r2708978 = r2708974 * r2708977;
        double r2708979 = r2708976 + r2708978;
        return r2708979;
}

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.0\right)\]
  2. Using strategy rm

  3. Applied distribute-rgt-in0.0

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

  4. Final simplification0.0

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

Reproduce

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