Average Error: 0.0 → 0.0
Time: 20.4s
Precision: 64
\[\left(x + \sin y\right) + z \cdot \cos y\]
↓
\[z \cdot \cos y + \left(x + \sin y\right)\]
\left(x + \sin y\right) + z \cdot \cos y
↓
z \cdot \cos y + \left(x + \sin y\right)
double f(double x, double y, double z) {
        double r160405 = x;
        double r160406 = y;
        double r160407 = sin(r160406);
        double r160408 = r160405 + r160407;
        double r160409 = z;
        double r160410 = cos(r160406);
        double r160411 = r160409 * r160410;
        double r160412 = r160408 + r160411;
        return r160412;
}
↓
double f(double x, double y, double z) {
        double r160413 = z;
        double r160414 = y;
        double r160415 = cos(r160414);
        double r160416 = r160413 * r160415;
        double r160417 = x;
        double r160418 = sin(r160414);
        double r160419 = r160417 + r160418;
        double r160420 = r160416 + r160419;
        return r160420;
}

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 + \sin y\right) + z \cdot \cos y\]
  2. Using strategy rm

  3. Applied +-commutative0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019323 
(FPCore (x y z)
  :name "Graphics.Rasterific.Svg.PathConverter:segmentToBezier from rasterific-svg-0.2.3.1, C"
  :precision binary64
  (+ (+ x (sin y)) (* z (cos y))))