Average Error: 0.0 → 0.0
Time: 13.4s
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 r2362576 = x;
        double r2362577 = y;
        double r2362578 = r2362576 + r2362577;
        double r2362579 = 1.0;
        double r2362580 = z;
        double r2362581 = r2362579 - r2362580;
        double r2362582 = r2362578 * r2362581;
        return r2362582;
}
↓
double f(double x, double y, double z) {
        double r2362583 = y;
        double r2362584 = x;
        double r2362585 = r2362583 + r2362584;
        double r2362586 = 1.0;
        double r2362587 = z;
        double r2362588 = r2362586 - r2362587;
        double r2362589 = r2362585 * r2362588;
        return r2362589;
}

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 2019164 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  (* (+ x y) (- 1.0 z)))