SynthBasics:oscSampleBasedAux from YampaSynth-0.2

Percentage Accurate: 100.0% → 100.0%

Time: 6.9s

Alternatives: 5

Speedup: 1.2×

• 21.0% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ x + y \cdot \left(z - x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (* y (- z x))))

C

double code(double x, double y, double z) {
	return x + (y * (z - x));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (y * (z - x))
end function

Java

public static double code(double x, double y, double z) {
	return x + (y * (z - x));
}

Python

def code(x, y, z):
	return x + (y * (z - x))

Julia

function code(x, y, z)
	return Float64(x + Float64(y * Float64(z - x)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + (y * (z - x));
end

Wolfram

code[x_, y_, z_] := N[(x + N[(y * N[(z - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + y \cdot \left(z - x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (* y (- z x))))

C

double code(double x, double y, double z) {
	return x + (y * (z - x));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (y * (z - x))
end function

Java

public static double code(double x, double y, double z) {
	return x + (y * (z - x));
}

Python

def code(x, y, z):
	return x + (y * (z - x))

Julia

function code(x, y, z)
	return Float64(x + Float64(y * Float64(z - x)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + (y * (z - x));
end

Wolfram

code[x_, y_, z_] := N[(x + N[(y * N[(z - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(z - x, y, x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma (- z x) y x))

C

double code(double x, double y, double z) {
	return fma((z - x), y, x);
}

Julia

function code(x, y, z)
	return fma(Float64(z - x), y, x)
end

Wolfram

code[x_, y_, z_] := N[(N[(z - x), $MachinePrecision] * y + x), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z - x\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. +-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-fma.f64 100.0

      \[\leadsto \color{blue}{\mathsf{fma}\left(z - x, y, x\right)} \]

4. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(z - x, y, x\right)} \]
5. Add Preprocessing

Alternative 2: 99.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(z - x\right) \cdot y\\ \mathbf{if}\;y \leq -1:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;\mathsf{fma}\left(z, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- z x) y)))
   (if (<= y -1.0) t_0 (if (<= y 1.0) (fma z y x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (z - x) * y;
	double tmp;
	if (y <= -1.0) {
		tmp = t_0;
	} else if (y <= 1.0) {
		tmp = fma(z, y, x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(z - x) * y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = t_0;
	elseif (y <= 1.0)
		tmp = fma(z, y, x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(z - x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -1.0], t$95$0, If[LessEqual[y, 1.0], N[(z * y + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(z - x\right)} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower--.f64 97.8

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

   5. Simplified 97.8%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[x + y \cdot \left(z - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

      \[\leadsto x + \color{blue}{y \cdot z} \]
   4. Step-by-step derivation

      1. lower-*.f64 98.3

         \[\leadsto x + \color{blue}{y \cdot z} \]

   5. Simplified 98.3%

      \[\leadsto x + \color{blue}{y \cdot z} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto x + \color{blue}{y \cdot z} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot z + x} \]

      3. lift-*.f64 N/A

         \[\leadsto \color{blue}{y \cdot z} + x \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{z \cdot y} + x \]

      5. lower-fma.f64 98.3

         \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, x\right)} \]

   7. Applied egg-rr 98.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;\left(z - x\right) \cdot y\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;\mathsf{fma}\left(z, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(z - x\right) \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 75.6% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(z, y, x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma z y x))

C

double code(double x, double y, double z) {
	return fma(z, y, x);
}

Julia

function code(x, y, z)
	return fma(z, y, x)
end

Wolfram

code[x_, y_, z_] := N[(z * y + x), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z - x\right) \]
2. Add Preprocessing

3. Taylor expanded in z around inf

   \[\leadsto x + \color{blue}{y \cdot z} \]
4. Step-by-step derivation

   1. lower-*.f64 74.2

      \[\leadsto x + \color{blue}{y \cdot z} \]

5. Simplified 74.2%

   \[\leadsto x + \color{blue}{y \cdot z} \]
6. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto x + \color{blue}{y \cdot z} \]

   2. +-commutative N/A

      \[\leadsto \color{blue}{y \cdot z + x} \]

   3. lift-*.f64 N/A

      \[\leadsto \color{blue}{y \cdot z} + x \]

   4. *-commutative N/A

      \[\leadsto \color{blue}{z \cdot y} + x \]

   5. lower-fma.f64 74.2

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, x\right)} \]

7. Applied egg-rr 74.2%

   \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, x\right)} \]
8. Add Preprocessing

Alternative 4: 41.6% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ z \cdot y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* z y))

C

double code(double x, double y, double z) {
	return z * y;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = z * y
end function

Java

public static double code(double x, double y, double z) {
	return z * y;
}

Python

def code(x, y, z):
	return z * y

Julia

function code(x, y, z)
	return Float64(z * y)
end

MATLAB

function tmp = code(x, y, z)
	tmp = z * y;
end

Wolfram

code[x_, y_, z_] := N[(z * y), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z - x\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{y \cdot z} \]
4. Step-by-step derivation

   1. lower-*.f64 43.2

      \[\leadsto \color{blue}{y \cdot z} \]

5. Simplified 43.2%

   \[\leadsto \color{blue}{y \cdot z} \]

6. Final simplification 43.2%

   \[\leadsto z \cdot y \]
7. Add Preprocessing

Alternative 5: 3.8% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ x \cdot y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* x y))

C

double code(double x, double y, double z) {
	return x * y;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x * y
end function

Java

public static double code(double x, double y, double z) {
	return x * y;
}

Python

def code(x, y, z):
	return x * y

Julia

function code(x, y, z)
	return Float64(x * y)
end

MATLAB

function tmp = code(x, y, z)
	tmp = x * y;
end

Wolfram

code[x_, y_, z_] := N[(x * y), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z - x\right) \]
2. Add Preprocessing

3. Taylor expanded in y around inf

   \[\leadsto \color{blue}{y \cdot \left(z - x\right)} \]
4. Step-by-step derivation

   1. lower-*.f64 N/A

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

   2. lower--.f64 67.3

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

5. Simplified 67.3%

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

6. Taylor expanded in z around 0

   \[\leadsto y \cdot \color{blue}{\left(-1 \cdot x\right)} \]
7. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto y \cdot \color{blue}{\left(\mathsf{neg}\left(x\right)\right)} \]

   2. lower-neg.f64 29.5

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

8. Simplified 29.5%

   \[\leadsto y \cdot \color{blue}{\left(-x\right)} \]
9. Step-by-step derivation

   1. distribute-rgt-neg-out N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(y \cdot x\right)} \]

   2. distribute-lft-neg-out N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

   3. neg-sub0 N/A

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

   4. flip3-- N/A

      \[\leadsto \color{blue}{\frac{{0}^{3} - {y}^{3}}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)}} \cdot x \]

   5. metadata-eval N/A

      \[\leadsto \frac{\color{blue}{0} - {y}^{3}}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   6. sub0-neg N/A

      \[\leadsto \frac{\color{blue}{\mathsf{neg}\left({y}^{3}\right)}}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   7. sqr-pow N/A

      \[\leadsto \frac{\mathsf{neg}\left(\color{blue}{{y}^{\left(\frac{3}{2}\right)} \cdot {y}^{\left(\frac{3}{2}\right)}}\right)}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   8. pow-prod-down N/A

      \[\leadsto \frac{\mathsf{neg}\left(\color{blue}{{\left(y \cdot y\right)}^{\left(\frac{3}{2}\right)}}\right)}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   9. sqr-neg N/A

      \[\leadsto \frac{\mathsf{neg}\left({\color{blue}{\left(\left(\mathsf{neg}\left(y\right)\right) \cdot \left(\mathsf{neg}\left(y\right)\right)\right)}}^{\left(\frac{3}{2}\right)}\right)}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   10. lift-neg.f64 N/A

       \[\leadsto \frac{\mathsf{neg}\left({\left(\color{blue}{\left(\mathsf{neg}\left(y\right)\right)} \cdot \left(\mathsf{neg}\left(y\right)\right)\right)}^{\left(\frac{3}{2}\right)}\right)}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   11. lift-neg.f64 N/A

       \[\leadsto \frac{\mathsf{neg}\left({\left(\left(\mathsf{neg}\left(y\right)\right) \cdot \color{blue}{\left(\mathsf{neg}\left(y\right)\right)}\right)}^{\left(\frac{3}{2}\right)}\right)}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   12. pow-prod-down N/A

       \[\leadsto \frac{\mathsf{neg}\left(\color{blue}{{\left(\mathsf{neg}\left(y\right)\right)}^{\left(\frac{3}{2}\right)} \cdot {\left(\mathsf{neg}\left(y\right)\right)}^{\left(\frac{3}{2}\right)}}\right)}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   13. sqr-pow N/A

       \[\leadsto \frac{\mathsf{neg}\left(\color{blue}{{\left(\mathsf{neg}\left(y\right)\right)}^{3}}\right)}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   14. lift-neg.f64 N/A

       \[\leadsto \frac{\mathsf{neg}\left({\color{blue}{\left(\mathsf{neg}\left(y\right)\right)}}^{3}\right)}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   15. cube-neg N/A

       \[\leadsto \frac{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left({y}^{3}\right)\right)}\right)}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   16. sub0-neg N/A

       \[\leadsto \frac{\mathsf{neg}\left(\color{blue}{\left(0 - {y}^{3}\right)}\right)}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   17. metadata-eval N/A

       \[\leadsto \frac{\mathsf{neg}\left(\left(\color{blue}{{0}^{3}} - {y}^{3}\right)\right)}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)} \cdot x \]

   18. distribute-neg-frac N/A

       \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{{0}^{3} - {y}^{3}}{0 \cdot 0 + \left(y \cdot y + 0 \cdot y\right)}\right)\right)} \cdot x \]

   19. flip3-- N/A

       \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\left(0 - y\right)}\right)\right) \cdot x \]

   20. neg-sub0 N/A

       \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(y\right)\right)}\right)\right) \cdot x \]

   21. remove-double-neg N/A

       \[\leadsto \color{blue}{y} \cdot x \]

10. Applied egg-rr 4.3%

    \[\leadsto \color{blue}{y \cdot x} \]

11. Final simplification 4.3%

    \[\leadsto x \cdot y \]
12. Add Preprocessing

Reproduce

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