Trigonometry A

Percentage Accurate: 99.8% → 99.8%

Time: 9.8s

Alternatives: 11

Speedup: 1.0×

Specification

\[0 \leq e \land e \leq 1\]

Math

\[\begin{array}{l} \\ \frac{e \cdot \sin v}{1 + e \cdot \cos v} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (/ (* e (sin v)) (+ 1.0 (* e (cos v)))))

C

double code(double e, double v) {
	return (e * sin(v)) / (1.0 + (e * cos(v)));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = (e * sin(v)) / (1.0d0 + (e * cos(v)))
end function

Java

public static double code(double e, double v) {
	return (e * Math.sin(v)) / (1.0 + (e * Math.cos(v)));
}

Python

def code(e, v):
	return (e * math.sin(v)) / (1.0 + (e * math.cos(v)))

Julia

function code(e, v)
	return Float64(Float64(e * sin(v)) / Float64(1.0 + Float64(e * cos(v))))
end

MATLAB

function tmp = code(e, v)
	tmp = (e * sin(v)) / (1.0 + (e * cos(v)));
end

Wolfram

code[e_, v_] := N[(N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(e * N[Cos[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e \cdot \sin v}{1 + e \cdot \cos v} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (/ (* e (sin v)) (+ 1.0 (* e (cos v)))))

C

double code(double e, double v) {
	return (e * sin(v)) / (1.0 + (e * cos(v)));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = (e * sin(v)) / (1.0d0 + (e * cos(v)))
end function

Java

public static double code(double e, double v) {
	return (e * Math.sin(v)) / (1.0 + (e * Math.cos(v)));
}

Python

def code(e, v):
	return (e * math.sin(v)) / (1.0 + (e * math.cos(v)))

Julia

function code(e, v)
	return Float64(Float64(e * sin(v)) / Float64(1.0 + Float64(e * cos(v))))
end

MATLAB

function tmp = code(e, v)
	tmp = (e * sin(v)) / (1.0 + (e * cos(v)));
end

Wolfram

code[e_, v_] := N[(N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(e * N[Cos[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e \cdot \sin v}{\mathsf{fma}\left(\cos v, e, 1\right)} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (/ (* e (sin v)) (fma (cos v) e 1.0)))

C

double code(double e, double v) {
	return (e * sin(v)) / fma(cos(v), e, 1.0);
}

Julia

function code(e, v)
	return Float64(Float64(e * sin(v)) / fma(cos(v), e, 1.0))
end

Wolfram

code[e_, v_] := N[(N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[v], $MachinePrecision] * e + 1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-cos.f64 N/A

      \[\leadsto \frac{e \cdot \sin v}{1 + e \cdot \color{blue}{\cos v}} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{e \cdot \sin v}{1 + \color{blue}{e \cdot \cos v}} \]

   3. +-commutative N/A

      \[\leadsto \frac{e \cdot \sin v}{\color{blue}{e \cdot \cos v + 1}} \]

   4. lift-*.f64 N/A

      \[\leadsto \frac{e \cdot \sin v}{\color{blue}{e \cdot \cos v} + 1} \]

   5. *-commutative N/A

      \[\leadsto \frac{e \cdot \sin v}{\color{blue}{\cos v \cdot e} + 1} \]

   6. lower-fma.f64 99.8

      \[\leadsto \frac{e \cdot \sin v}{\color{blue}{\mathsf{fma}\left(\cos v, e, 1\right)}} \]

4. Applied rewrites 99.8%

   \[\leadsto \frac{e \cdot \sin v}{\color{blue}{\mathsf{fma}\left(\cos v, e, 1\right)}} \]
5. Add Preprocessing

Alternative 2: 98.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \frac{e \cdot \sin v}{e + 1} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (/ (* e (sin v)) (+ e 1.0)))

C

double code(double e, double v) {
	return (e * sin(v)) / (e + 1.0);
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = (e * sin(v)) / (e + 1.0d0)
end function

Java

public static double code(double e, double v) {
	return (e * Math.sin(v)) / (e + 1.0);
}

Python

def code(e, v):
	return (e * math.sin(v)) / (e + 1.0)

Julia

function code(e, v)
	return Float64(Float64(e * sin(v)) / Float64(e + 1.0))
end

MATLAB

function tmp = code(e, v)
	tmp = (e * sin(v)) / (e + 1.0);
end

Wolfram

code[e_, v_] := N[(N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision] / N[(e + 1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in v around 0

   \[\leadsto \frac{e \cdot \sin v}{\color{blue}{1 + e}} \]
4. Step-by-step derivation

   1. lower-+.f64 99.5

      \[\leadsto \frac{e \cdot \sin v}{\color{blue}{1 + e}} \]

5. Applied rewrites 99.5%

   \[\leadsto \frac{e \cdot \sin v}{\color{blue}{1 + e}} \]

6. Final simplification 99.5%

   \[\leadsto \frac{e \cdot \sin v}{e + 1} \]
7. Add Preprocessing

Alternative 3: 98.2% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \sin v \cdot \left(e - e \cdot e\right) \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* (sin v) (- e (* e e))))

C

double code(double e, double v) {
	return sin(v) * (e - (e * e));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = sin(v) * (e - (e * e))
end function

Java

public static double code(double e, double v) {
	return Math.sin(v) * (e - (e * e));
}

Python

def code(e, v):
	return math.sin(v) * (e - (e * e))

Julia

function code(e, v)
	return Float64(sin(v) * Float64(e - Float64(e * e)))
end

MATLAB

function tmp = code(e, v)
	tmp = sin(v) * (e - (e * e));
end

Wolfram

code[e_, v_] := N[(N[Sin[v], $MachinePrecision] * N[(e - N[(e * e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in e around 0

   \[\leadsto \color{blue}{e \cdot \left(\sin v + -1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto e \cdot \color{blue}{\left(-1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right) + \sin v\right)} \]

   2. distribute-lft-in N/A

      \[\leadsto \color{blue}{e \cdot \left(-1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right)\right) + e \cdot \sin v} \]

   3. associate-*r* N/A

      \[\leadsto e \cdot \color{blue}{\left(\left(-1 \cdot e\right) \cdot \left(\cos v \cdot \sin v\right)\right)} + e \cdot \sin v \]

   4. associate-*r* N/A

      \[\leadsto \color{blue}{\left(e \cdot \left(-1 \cdot e\right)\right) \cdot \left(\cos v \cdot \sin v\right)} + e \cdot \sin v \]

   5. mul-1-neg N/A

      \[\leadsto \left(e \cdot \color{blue}{\left(\mathsf{neg}\left(e\right)\right)}\right) \cdot \left(\cos v \cdot \sin v\right) + e \cdot \sin v \]

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

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(e \cdot e\right)\right)} \cdot \left(\cos v \cdot \sin v\right) + e \cdot \sin v \]

   7. unpow2 N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{{e}^{2}}\right)\right) \cdot \left(\cos v \cdot \sin v\right) + e \cdot \sin v \]

   8. associate-*r* N/A

      \[\leadsto \color{blue}{\left(\left(\mathsf{neg}\left({e}^{2}\right)\right) \cdot \cos v\right) \cdot \sin v} + e \cdot \sin v \]

   9. distribute-lft-neg-in N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right)} \cdot \sin v + e \cdot \sin v \]

   10. distribute-rgt-out N/A

       \[\leadsto \color{blue}{\sin v \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right)} \]

   11. lower-*.f64 N/A

       \[\leadsto \color{blue}{\sin v \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right)} \]

   12. lower-sin.f64 N/A

       \[\leadsto \color{blue}{\sin v} \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right) \]

   13. *-commutative N/A

       \[\leadsto \sin v \cdot \left(\left(\mathsf{neg}\left(\color{blue}{\cos v \cdot {e}^{2}}\right)\right) + e\right) \]

   14. distribute-rgt-neg-in N/A

       \[\leadsto \sin v \cdot \left(\color{blue}{\cos v \cdot \left(\mathsf{neg}\left({e}^{2}\right)\right)} + e\right) \]

   15. lower-fma.f64 N/A

       \[\leadsto \sin v \cdot \color{blue}{\mathsf{fma}\left(\cos v, \mathsf{neg}\left({e}^{2}\right), e\right)} \]

5. Applied rewrites 99.5%

   \[\leadsto \color{blue}{\sin v \cdot \mathsf{fma}\left(\cos v, e \cdot \left(-e\right), e\right)} \]

6. Taylor expanded in v around 0

   \[\leadsto \sin v \cdot \color{blue}{\left(e + -1 \cdot {e}^{2}\right)} \]
7. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \sin v \cdot \left(e + \color{blue}{\left(\mathsf{neg}\left({e}^{2}\right)\right)}\right) \]

   2. unsub-neg N/A

      \[\leadsto \sin v \cdot \color{blue}{\left(e - {e}^{2}\right)} \]

   3. lower--.f64 N/A

      \[\leadsto \sin v \cdot \color{blue}{\left(e - {e}^{2}\right)} \]

   4. unpow2 N/A

      \[\leadsto \sin v \cdot \left(e - \color{blue}{e \cdot e}\right) \]

   5. lower-*.f64 99.2

      \[\leadsto \sin v \cdot \left(e - \color{blue}{e \cdot e}\right) \]

8. Applied rewrites 99.2%

   \[\leadsto \sin v \cdot \color{blue}{\left(e - e \cdot e\right)} \]
9. Add Preprocessing

Alternative 4: 97.7% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ e \cdot \sin v \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* e (sin v)))

C

double code(double e, double v) {
	return e * sin(v);
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = e * sin(v)
end function

Java

public static double code(double e, double v) {
	return e * Math.sin(v);
}

Python

def code(e, v):
	return e * math.sin(v)

Julia

function code(e, v)
	return Float64(e * sin(v))
end

MATLAB

function tmp = code(e, v)
	tmp = e * sin(v);
end

Wolfram

code[e_, v_] := N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in e around 0

   \[\leadsto \color{blue}{e \cdot \sin v} \]
4. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto \color{blue}{e \cdot \sin v} \]

   2. lower-sin.f64 98.9

      \[\leadsto e \cdot \color{blue}{\sin v} \]

5. Applied rewrites 98.9%

   \[\leadsto \color{blue}{e \cdot \sin v} \]
6. Add Preprocessing

Alternative 5: 50.5% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\frac{\mathsf{fma}\left(v \cdot v, \mathsf{fma}\left(0.16666666666666666, \frac{e + 1}{e}, -0.5\right), 1 + \frac{1}{e}\right)}{v}} \end{array} \]

FPCore

(FPCore (e v)
 :precision binary64
 (/
  1.0
  (/
   (fma
    (* v v)
    (fma 0.16666666666666666 (/ (+ e 1.0) e) -0.5)
    (+ 1.0 (/ 1.0 e)))
   v)))

C

double code(double e, double v) {
	return 1.0 / (fma((v * v), fma(0.16666666666666666, ((e + 1.0) / e), -0.5), (1.0 + (1.0 / e))) / v);
}

Julia

function code(e, v)
	return Float64(1.0 / Float64(fma(Float64(v * v), fma(0.16666666666666666, Float64(Float64(e + 1.0) / e), -0.5), Float64(1.0 + Float64(1.0 / e))) / v))
end

Wolfram

code[e_, v_] := N[(1.0 / N[(N[(N[(v * v), $MachinePrecision] * N[(0.16666666666666666 * N[(N[(e + 1.0), $MachinePrecision] / e), $MachinePrecision] + -0.5), $MachinePrecision] + N[(1.0 + N[(1.0 / e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-sin.f64 N/A

      \[\leadsto \frac{e \cdot \color{blue}{\sin v}}{1 + e \cdot \cos v} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{e \cdot \sin v}}{1 + e \cdot \cos v} \]

   3. lift-cos.f64 N/A

      \[\leadsto \frac{e \cdot \sin v}{1 + e \cdot \color{blue}{\cos v}} \]

   4. lift-*.f64 N/A

      \[\leadsto \frac{e \cdot \sin v}{1 + \color{blue}{e \cdot \cos v}} \]

   5. lift-+.f64 N/A

      \[\leadsto \frac{e \cdot \sin v}{\color{blue}{1 + e \cdot \cos v}} \]

   6. clear-num N/A

      \[\leadsto \color{blue}{\frac{1}{\frac{1 + e \cdot \cos v}{e \cdot \sin v}}} \]

   7. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{1}{\frac{1 + e \cdot \cos v}{e \cdot \sin v}}} \]

   8. lower-/.f64 98.8

      \[\leadsto \frac{1}{\color{blue}{\frac{1 + e \cdot \cos v}{e \cdot \sin v}}} \]

   9. lift-+.f64 N/A

      \[\leadsto \frac{1}{\frac{\color{blue}{1 + e \cdot \cos v}}{e \cdot \sin v}} \]

   10. +-commutative N/A

       \[\leadsto \frac{1}{\frac{\color{blue}{e \cdot \cos v + 1}}{e \cdot \sin v}} \]

   11. lift-*.f64 N/A

       \[\leadsto \frac{1}{\frac{\color{blue}{e \cdot \cos v} + 1}{e \cdot \sin v}} \]

   12. lower-fma.f64 98.8

       \[\leadsto \frac{1}{\frac{\color{blue}{\mathsf{fma}\left(e, \cos v, 1\right)}}{e \cdot \sin v}} \]

4. Applied rewrites 98.8%

   \[\leadsto \color{blue}{\frac{1}{\frac{\mathsf{fma}\left(e, \cos v, 1\right)}{e \cdot \sin v}}} \]

5. Taylor expanded in v around 0

   \[\leadsto \frac{1}{\color{blue}{\frac{1 + \left(-1 \cdot \left({v}^{2} \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot \frac{1 + e}{e}\right)\right) + \frac{1}{e}\right)}{v}}} \]
6. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \frac{1}{\color{blue}{\frac{1 + \left(-1 \cdot \left({v}^{2} \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot \frac{1 + e}{e}\right)\right) + \frac{1}{e}\right)}{v}}} \]

7. Applied rewrites 47.2%

   \[\leadsto \frac{1}{\color{blue}{\frac{\mathsf{fma}\left(v \cdot v, \mathsf{fma}\left(0.16666666666666666, \frac{e + 1}{e}, -0.5\right), 1 + \frac{1}{e}\right)}{v}}} \]
8. Add Preprocessing

Alternative 6: 50.4% accurate, 6.1× speedup

Math

\[\begin{array}{l} \\ \frac{e \cdot v}{\frac{\mathsf{fma}\left(e, e, -1\right)}{e + -1}} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (/ (* e v) (/ (fma e e -1.0) (+ e -1.0))))

C

double code(double e, double v) {
	return (e * v) / (fma(e, e, -1.0) / (e + -1.0));
}

Julia

function code(e, v)
	return Float64(Float64(e * v) / Float64(fma(e, e, -1.0) / Float64(e + -1.0)))
end

Wolfram

code[e_, v_] := N[(N[(e * v), $MachinePrecision] / N[(N[(e * e + -1.0), $MachinePrecision] / N[(e + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]

   2. lower-*.f64 N/A

      \[\leadsto \frac{\color{blue}{e \cdot v}}{1 + e} \]

   3. lower-+.f64 46.7

      \[\leadsto \frac{e \cdot v}{\color{blue}{1 + e}} \]

5. Applied rewrites 46.7%

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]
6. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \frac{e \cdot v}{\color{blue}{e + 1}} \]

   2. flip-+ N/A

      \[\leadsto \frac{e \cdot v}{\color{blue}{\frac{e \cdot e - 1 \cdot 1}{e - 1}}} \]

   3. lower-/.f64 N/A

      \[\leadsto \frac{e \cdot v}{\color{blue}{\frac{e \cdot e - 1 \cdot 1}{e - 1}}} \]

   4. metadata-eval N/A

      \[\leadsto \frac{e \cdot v}{\frac{e \cdot e - \color{blue}{1}}{e - 1}} \]

   5. sub-neg N/A

      \[\leadsto \frac{e \cdot v}{\frac{\color{blue}{e \cdot e + \left(\mathsf{neg}\left(1\right)\right)}}{e - 1}} \]

   6. metadata-eval N/A

      \[\leadsto \frac{e \cdot v}{\frac{e \cdot e + \color{blue}{-1}}{e - 1}} \]

   7. lower-fma.f64 N/A

      \[\leadsto \frac{e \cdot v}{\frac{\color{blue}{\mathsf{fma}\left(e, e, -1\right)}}{e - 1}} \]

   8. sub-neg N/A

      \[\leadsto \frac{e \cdot v}{\frac{\mathsf{fma}\left(e, e, -1\right)}{\color{blue}{e + \left(\mathsf{neg}\left(1\right)\right)}}} \]

   9. metadata-eval N/A

      \[\leadsto \frac{e \cdot v}{\frac{\mathsf{fma}\left(e, e, -1\right)}{e + \color{blue}{-1}}} \]

   10. lower-+.f64 46.7

       \[\leadsto \frac{e \cdot v}{\frac{\mathsf{fma}\left(e, e, -1\right)}{\color{blue}{e + -1}}} \]

7. Applied rewrites 46.7%

   \[\leadsto \frac{e \cdot v}{\color{blue}{\frac{\mathsf{fma}\left(e, e, -1\right)}{e + -1}}} \]
8. Add Preprocessing

Alternative 7: 50.4% accurate, 11.3× speedup

Math

\[\begin{array}{l} \\ \frac{e \cdot v}{e + 1} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (/ (* e v) (+ e 1.0)))

C

double code(double e, double v) {
	return (e * v) / (e + 1.0);
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = (e * v) / (e + 1.0d0)
end function

Java

public static double code(double e, double v) {
	return (e * v) / (e + 1.0);
}

Python

def code(e, v):
	return (e * v) / (e + 1.0)

Julia

function code(e, v)
	return Float64(Float64(e * v) / Float64(e + 1.0))
end

MATLAB

function tmp = code(e, v)
	tmp = (e * v) / (e + 1.0);
end

Wolfram

code[e_, v_] := N[(N[(e * v), $MachinePrecision] / N[(e + 1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]

   2. lower-*.f64 N/A

      \[\leadsto \frac{\color{blue}{e \cdot v}}{1 + e} \]

   3. lower-+.f64 46.7

      \[\leadsto \frac{e \cdot v}{\color{blue}{1 + e}} \]

5. Applied rewrites 46.7%

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]

6. Final simplification 46.7%

   \[\leadsto \frac{e \cdot v}{e + 1} \]
7. Add Preprocessing

Alternative 8: 50.1% accurate, 11.3× speedup

Math

\[\begin{array}{l} \\ e \cdot \mathsf{fma}\left(e, e \cdot v - v, v\right) \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* e (fma e (- (* e v) v) v)))

C

double code(double e, double v) {
	return e * fma(e, ((e * v) - v), v);
}

Julia

function code(e, v)
	return Float64(e * fma(e, Float64(Float64(e * v) - v), v))
end

Wolfram

code[e_, v_] := N[(e * N[(e * N[(N[(e * v), $MachinePrecision] - v), $MachinePrecision] + v), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]

   2. lower-*.f64 N/A

      \[\leadsto \frac{\color{blue}{e \cdot v}}{1 + e} \]

   3. lower-+.f64 46.7

      \[\leadsto \frac{e \cdot v}{\color{blue}{1 + e}} \]

5. Applied rewrites 46.7%

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]

6. Taylor expanded in e around 0

   \[\leadsto \color{blue}{e \cdot \left(v + e \cdot \left(e \cdot v - v\right)\right)} \]
7. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto \color{blue}{e \cdot \left(v + e \cdot \left(e \cdot v - v\right)\right)} \]

   2. +-commutative N/A

      \[\leadsto e \cdot \color{blue}{\left(e \cdot \left(e \cdot v - v\right) + v\right)} \]

   3. lower-fma.f64 N/A

      \[\leadsto e \cdot \color{blue}{\mathsf{fma}\left(e, e \cdot v - v, v\right)} \]

   4. lower--.f64 N/A

      \[\leadsto e \cdot \mathsf{fma}\left(e, \color{blue}{e \cdot v - v}, v\right) \]

   5. lower-*.f64 46.5

      \[\leadsto e \cdot \mathsf{fma}\left(e, \color{blue}{e \cdot v} - v, v\right) \]

8. Applied rewrites 46.5%

   \[\leadsto \color{blue}{e \cdot \mathsf{fma}\left(e, e \cdot v - v, v\right)} \]
9. Add Preprocessing

Alternative 9: 49.9% accurate, 16.1× speedup

Math

\[\begin{array}{l} \\ v \cdot \left(e - e \cdot e\right) \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* v (- e (* e e))))

C

double code(double e, double v) {
	return v * (e - (e * e));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = v * (e - (e * e))
end function

Java

public static double code(double e, double v) {
	return v * (e - (e * e));
}

Python

def code(e, v):
	return v * (e - (e * e))

Julia

function code(e, v)
	return Float64(v * Float64(e - Float64(e * e)))
end

MATLAB

function tmp = code(e, v)
	tmp = v * (e - (e * e));
end

Wolfram

code[e_, v_] := N[(v * N[(e - N[(e * e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]

   2. lower-*.f64 N/A

      \[\leadsto \frac{\color{blue}{e \cdot v}}{1 + e} \]

   3. lower-+.f64 46.7

      \[\leadsto \frac{e \cdot v}{\color{blue}{1 + e}} \]

5. Applied rewrites 46.7%

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]

6. Taylor expanded in e around 0

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

   1. distribute-lft-in N/A

      \[\leadsto \color{blue}{e \cdot v + e \cdot \left(-1 \cdot \left(e \cdot v\right)\right)} \]

   2. associate-*r* N/A

      \[\leadsto e \cdot v + e \cdot \color{blue}{\left(\left(-1 \cdot e\right) \cdot v\right)} \]

   3. associate-*r* N/A

      \[\leadsto e \cdot v + \color{blue}{\left(e \cdot \left(-1 \cdot e\right)\right) \cdot v} \]

   4. mul-1-neg N/A

      \[\leadsto e \cdot v + \left(e \cdot \color{blue}{\left(\mathsf{neg}\left(e\right)\right)}\right) \cdot v \]

   5. distribute-rgt-neg-in N/A

      \[\leadsto e \cdot v + \color{blue}{\left(\mathsf{neg}\left(e \cdot e\right)\right)} \cdot v \]

   6. unpow2 N/A

      \[\leadsto e \cdot v + \left(\mathsf{neg}\left(\color{blue}{{e}^{2}}\right)\right) \cdot v \]

   7. mul-1-neg N/A

      \[\leadsto e \cdot v + \color{blue}{\left(-1 \cdot {e}^{2}\right)} \cdot v \]

   8. distribute-rgt-in N/A

      \[\leadsto \color{blue}{v \cdot \left(e + -1 \cdot {e}^{2}\right)} \]

   9. lower-*.f64 N/A

      \[\leadsto \color{blue}{v \cdot \left(e + -1 \cdot {e}^{2}\right)} \]

   10. mul-1-neg N/A

       \[\leadsto v \cdot \left(e + \color{blue}{\left(\mathsf{neg}\left({e}^{2}\right)\right)}\right) \]

   11. unsub-neg N/A

       \[\leadsto v \cdot \color{blue}{\left(e - {e}^{2}\right)} \]

   12. lower--.f64 N/A

       \[\leadsto v \cdot \color{blue}{\left(e - {e}^{2}\right)} \]

   13. unpow2 N/A

       \[\leadsto v \cdot \left(e - \color{blue}{e \cdot e}\right) \]

   14. lower-*.f64 46.4

       \[\leadsto v \cdot \left(e - \color{blue}{e \cdot e}\right) \]

8. Applied rewrites 46.4%

   \[\leadsto \color{blue}{v \cdot \left(e - e \cdot e\right)} \]
9. Add Preprocessing

Alternative 10: 49.9% accurate, 16.1× speedup

Math

\[\begin{array}{l} \\ e \cdot \left(v - e \cdot v\right) \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* e (- v (* e v))))

C

double code(double e, double v) {
	return e * (v - (e * v));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = e * (v - (e * v))
end function

Java

public static double code(double e, double v) {
	return e * (v - (e * v));
}

Python

def code(e, v):
	return e * (v - (e * v))

Julia

function code(e, v)
	return Float64(e * Float64(v - Float64(e * v)))
end

MATLAB

function tmp = code(e, v)
	tmp = e * (v - (e * v));
end

Wolfram

code[e_, v_] := N[(e * N[(v - N[(e * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]

   2. lower-*.f64 N/A

      \[\leadsto \frac{\color{blue}{e \cdot v}}{1 + e} \]

   3. lower-+.f64 46.7

      \[\leadsto \frac{e \cdot v}{\color{blue}{1 + e}} \]

5. Applied rewrites 46.7%

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]
6. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \frac{e \cdot v}{\color{blue}{e + 1}} \]

   2. flip-+ N/A

      \[\leadsto \frac{e \cdot v}{\color{blue}{\frac{e \cdot e - 1 \cdot 1}{e - 1}}} \]

   3. lower-/.f64 N/A

      \[\leadsto \frac{e \cdot v}{\color{blue}{\frac{e \cdot e - 1 \cdot 1}{e - 1}}} \]

   4. metadata-eval N/A

      \[\leadsto \frac{e \cdot v}{\frac{e \cdot e - \color{blue}{1}}{e - 1}} \]

   5. sub-neg N/A

      \[\leadsto \frac{e \cdot v}{\frac{\color{blue}{e \cdot e + \left(\mathsf{neg}\left(1\right)\right)}}{e - 1}} \]

   6. metadata-eval N/A

      \[\leadsto \frac{e \cdot v}{\frac{e \cdot e + \color{blue}{-1}}{e - 1}} \]

   7. lower-fma.f64 N/A

      \[\leadsto \frac{e \cdot v}{\frac{\color{blue}{\mathsf{fma}\left(e, e, -1\right)}}{e - 1}} \]

   8. sub-neg N/A

      \[\leadsto \frac{e \cdot v}{\frac{\mathsf{fma}\left(e, e, -1\right)}{\color{blue}{e + \left(\mathsf{neg}\left(1\right)\right)}}} \]

   9. metadata-eval N/A

      \[\leadsto \frac{e \cdot v}{\frac{\mathsf{fma}\left(e, e, -1\right)}{e + \color{blue}{-1}}} \]

   10. lower-+.f64 46.7

       \[\leadsto \frac{e \cdot v}{\frac{\mathsf{fma}\left(e, e, -1\right)}{\color{blue}{e + -1}}} \]

7. Applied rewrites 46.7%

   \[\leadsto \frac{e \cdot v}{\color{blue}{\frac{\mathsf{fma}\left(e, e, -1\right)}{e + -1}}} \]

8. Taylor expanded in e around 0

   \[\leadsto \color{blue}{e \cdot \left(v + -1 \cdot \left(e \cdot v\right)\right)} \]
9. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto \color{blue}{e \cdot \left(v + -1 \cdot \left(e \cdot v\right)\right)} \]

   2. mul-1-neg N/A

      \[\leadsto e \cdot \left(v + \color{blue}{\left(\mathsf{neg}\left(e \cdot v\right)\right)}\right) \]

   3. unsub-neg N/A

      \[\leadsto e \cdot \color{blue}{\left(v - e \cdot v\right)} \]

   4. lower--.f64 N/A

      \[\leadsto e \cdot \color{blue}{\left(v - e \cdot v\right)} \]

   5. lower-*.f64 46.4

      \[\leadsto e \cdot \left(v - \color{blue}{e \cdot v}\right) \]

10. Applied rewrites 46.4%

    \[\leadsto \color{blue}{e \cdot \left(v - e \cdot v\right)} \]
11. Add Preprocessing

Alternative 11: 49.5% accurate, 37.5× speedup

Math

\[\begin{array}{l} \\ e \cdot v \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* e v))

C

double code(double e, double v) {
	return e * v;
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = e * v
end function

Java

public static double code(double e, double v) {
	return e * v;
}

Python

def code(e, v):
	return e * v

Julia

function code(e, v)
	return Float64(e * v)
end

MATLAB

function tmp = code(e, v)
	tmp = e * v;
end

Wolfram

code[e_, v_] := N[(e * v), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in e around 0

   \[\leadsto \color{blue}{e \cdot \sin v} \]
4. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto \color{blue}{e \cdot \sin v} \]

   2. lower-sin.f64 98.9

      \[\leadsto e \cdot \color{blue}{\sin v} \]

5. Applied rewrites 98.9%

   \[\leadsto \color{blue}{e \cdot \sin v} \]

6. Taylor expanded in v around 0

   \[\leadsto \color{blue}{e \cdot v} \]
7. Step-by-step derivation

   1. lower-*.f64 46.0

      \[\leadsto \color{blue}{e \cdot v} \]

8. Applied rewrites 46.0%

   \[\leadsto \color{blue}{e \cdot v} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024221 
(FPCore (e v)
  :name "Trigonometry A"
  :precision binary64
  :pre (and (<= 0.0 e) (<= e 1.0))
  (/ (* e (sin v)) (+ 1.0 (* e (cos v)))))