Average Error: 0.0 → 0.0
Time: 30.3s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(1 - z\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(1 - z\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r2903063 = x;
        double r2903064 = y;
        double r2903065 = r2903063 + r2903064;
        double r2903066 = 1.0;
        double r2903067 = z;
        double r2903068 = r2903066 - r2903067;
        double r2903069 = r2903065 * r2903068;
        return r2903069;
}
↓
double f(double x, double y, double z) {
        double r2903070 = 1.0;
        double r2903071 = z;
        double r2903072 = r2903070 - r2903071;
        double r2903073 = x;
        double r2903074 = y;
        double r2903075 = r2903073 + r2903074;
        double r2903076 = r2903072 * r2903075;
        return r2903076;
}

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

  3. Applied *-commutative0.0

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

  4. Final simplification0.0

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

Reproduce

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