Average Error: 0.0 → 0.0
Time: 11.7s
Precision: 64
\[\left(x + y\right) \cdot \left(1.0 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1.0 - z\right)\]
\left(x + y\right) \cdot \left(1.0 - z\right)
↓
\left(y + x\right) \cdot \left(1.0 - z\right)
double f(double x, double y, double z) {
        double r2254969 = x;
        double r2254970 = y;
        double r2254971 = r2254969 + r2254970;
        double r2254972 = 1.0;
        double r2254973 = z;
        double r2254974 = r2254972 - r2254973;
        double r2254975 = r2254971 * r2254974;
        return r2254975;
}
↓
double f(double x, double y, double z) {
        double r2254976 = y;
        double r2254977 = x;
        double r2254978 = r2254976 + r2254977;
        double r2254979 = 1.0;
        double r2254980 = z;
        double r2254981 = r2254979 - r2254980;
        double r2254982 = r2254978 * r2254981;
        return r2254982;
}

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(1.0 - z\right)\]

  2. Final simplification0.0

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

Reproduce

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