Average Error: 0.0 → 0.0
Time: 10.4s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(-z\right) \cdot \left(y + x\right) + \left(y + x\right) \cdot 1\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(-z\right) \cdot \left(y + x\right) + \left(y + x\right) \cdot 1
double f(double x, double y, double z) {
        double r2325181 = x;
        double r2325182 = y;
        double r2325183 = r2325181 + r2325182;
        double r2325184 = 1.0;
        double r2325185 = z;
        double r2325186 = r2325184 - r2325185;
        double r2325187 = r2325183 * r2325186;
        return r2325187;
}
↓
double f(double x, double y, double z) {
        double r2325188 = z;
        double r2325189 = -r2325188;
        double r2325190 = y;
        double r2325191 = x;
        double r2325192 = r2325190 + r2325191;
        double r2325193 = r2325189 * r2325192;
        double r2325194 = 1.0;
        double r2325195 = r2325192 * r2325194;
        double r2325196 = r2325193 + r2325195;
        return r2325196;
}

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 sub-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Final simplification0.0

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

Reproduce

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