Average Error: 0.0 → 0.0
Time: 2.4s
Precision: 64
\[x + y \cdot \left(z - x\right)\]
↓
\[y \cdot \left(z - x\right) + x\]
x + y \cdot \left(z - x\right)
↓
y \cdot \left(z - x\right) + x
double f(double x, double y, double z) {
        double r7150 = x;
        double r7151 = y;
        double r7152 = z;
        double r7153 = r7152 - r7150;
        double r7154 = r7151 * r7153;
        double r7155 = r7150 + r7154;
        return r7155;
}
↓
double f(double x, double y, double z) {
        double r7156 = y;
        double r7157 = z;
        double r7158 = x;
        double r7159 = r7157 - r7158;
        double r7160 = r7156 * r7159;
        double r7161 = r7160 + r7158;
        return r7161;
}

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

    \[x + y \cdot \left(z - x\right)\]
  2. Using strategy rm

  3. Applied +-commutative0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019354 
(FPCore (x y z)
  :name "SynthBasics:oscSampleBasedAux from YampaSynth-0.2"
  :precision binary64
  (+ x (* y (- z x))))