Diagrams.Tangent:$catParam from diagrams-lib-1.3.0.3, D

Percentage Accurate: 99.8% → 99.9%

Time: 8.8s

Alternatives: 7

Speedup: 1.4×

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

Specification

Math

\[\begin{array}{l} \\ 3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* 3.0 (+ (- (* (* x 3.0) x) (* x 4.0)) 1.0)))

C

double code(double x) {
	return 3.0 * ((((x * 3.0) * x) - (x * 4.0)) + 1.0);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 3.0d0 * ((((x * 3.0d0) * x) - (x * 4.0d0)) + 1.0d0)
end function

Java

public static double code(double x) {
	return 3.0 * ((((x * 3.0) * x) - (x * 4.0)) + 1.0);
}

Python

def code(x):
	return 3.0 * ((((x * 3.0) * x) - (x * 4.0)) + 1.0)

Julia

function code(x)
	return Float64(3.0 * Float64(Float64(Float64(Float64(x * 3.0) * x) - Float64(x * 4.0)) + 1.0))
end

MATLAB

function tmp = code(x)
	tmp = 3.0 * ((((x * 3.0) * x) - (x * 4.0)) + 1.0);
end

Wolfram

code[x_] := N[(3.0 * N[(N[(N[(N[(x * 3.0), $MachinePrecision] * x), $MachinePrecision] - N[(x * 4.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* 3.0 (+ (- (* (* x 3.0) x) (* x 4.0)) 1.0)))

C

double code(double x) {
	return 3.0 * ((((x * 3.0) * x) - (x * 4.0)) + 1.0);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 3.0d0 * ((((x * 3.0d0) * x) - (x * 4.0d0)) + 1.0d0)
end function

Java

public static double code(double x) {
	return 3.0 * ((((x * 3.0) * x) - (x * 4.0)) + 1.0);
}

Python

def code(x):
	return 3.0 * ((((x * 3.0) * x) - (x * 4.0)) + 1.0)

Julia

function code(x)
	return Float64(3.0 * Float64(Float64(Float64(Float64(x * 3.0) * x) - Float64(x * 4.0)) + 1.0))
end

MATLAB

function tmp = code(x)
	tmp = 3.0 * ((((x * 3.0) * x) - (x * 4.0)) + 1.0);
end

Wolfram

code[x_] := N[(3.0 * N[(N[(N[(N[(x * 3.0), $MachinePrecision] * x), $MachinePrecision] - N[(x * 4.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, -12 + x \cdot 9, 3\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (fma x (+ -12.0 (* x 9.0)) 3.0))

C

double code(double x) {
	return fma(x, (-12.0 + (x * 9.0)), 3.0);
}

Julia

function code(x)
	return fma(x, Float64(-12.0 + Float64(x * 9.0)), 3.0)
end

Wolfram

code[x_] := N[(x * N[(-12.0 + N[(x * 9.0), $MachinePrecision]), $MachinePrecision] + 3.0), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \]
2. Step-by-step derivation

   1. distribute-rgt-in 99.4%

      \[\leadsto \color{blue}{\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) \cdot 3 + 1 \cdot 3} \]

   2. metadata-eval 99.4%

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

   3. *-commutative 99.4%

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

   4. distribute-lft-out-- 99.8%

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

   5. associate-*l* 99.8%

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

   6. fma-define 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, \left(x \cdot 3 - 4\right) \cdot 3, 3\right)} \]

   7. *-commutative 99.8%

      \[\leadsto \mathsf{fma}\left(x, \color{blue}{3 \cdot \left(x \cdot 3 - 4\right)}, 3\right) \]

   8. sub-neg 99.8%

      \[\leadsto \mathsf{fma}\left(x, 3 \cdot \color{blue}{\left(x \cdot 3 + \left(-4\right)\right)}, 3\right) \]

   9. +-commutative 99.8%

      \[\leadsto \mathsf{fma}\left(x, 3 \cdot \color{blue}{\left(\left(-4\right) + x \cdot 3\right)}, 3\right) \]

   10. distribute-rgt-in 99.8%

       \[\leadsto \mathsf{fma}\left(x, \color{blue}{\left(-4\right) \cdot 3 + \left(x \cdot 3\right) \cdot 3}, 3\right) \]

   11. metadata-eval 99.8%

       \[\leadsto \mathsf{fma}\left(x, \color{blue}{-4} \cdot 3 + \left(x \cdot 3\right) \cdot 3, 3\right) \]

   12. metadata-eval 99.8%

       \[\leadsto \mathsf{fma}\left(x, \color{blue}{-12} + \left(x \cdot 3\right) \cdot 3, 3\right) \]

   13. associate-*l* 99.9%

       \[\leadsto \mathsf{fma}\left(x, -12 + \color{blue}{x \cdot \left(3 \cdot 3\right)}, 3\right) \]

   14. metadata-eval 99.9%

       \[\leadsto \mathsf{fma}\left(x, -12 + x \cdot \color{blue}{9}, 3\right) \]

3. Simplified 99.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, -12 + x \cdot 9, 3\right)} \]
4. Add Preprocessing

5. Final simplification 99.9%

   \[\leadsto \mathsf{fma}\left(x, -12 + x \cdot 9, 3\right) \]
6. Add Preprocessing

Alternative 2: 98.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.56 \lor \neg \left(x \leq 0.55\right):\\ \;\;\;\;x \cdot \left(-12 + x \cdot 9\right)\\ \mathbf{else}:\\ \;\;\;\;3 + x \cdot -12\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -0.56) (not (<= x 0.55)))
   (* x (+ -12.0 (* x 9.0)))
   (+ 3.0 (* x -12.0))))

C

double code(double x) {
	double tmp;
	if ((x <= -0.56) || !(x <= 0.55)) {
		tmp = x * (-12.0 + (x * 9.0));
	} else {
		tmp = 3.0 + (x * -12.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-0.56d0)) .or. (.not. (x <= 0.55d0))) then
        tmp = x * ((-12.0d0) + (x * 9.0d0))
    else
        tmp = 3.0d0 + (x * (-12.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -0.56) || !(x <= 0.55)) {
		tmp = x * (-12.0 + (x * 9.0));
	} else {
		tmp = 3.0 + (x * -12.0);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -0.56) or not (x <= 0.55):
		tmp = x * (-12.0 + (x * 9.0))
	else:
		tmp = 3.0 + (x * -12.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -0.56) || !(x <= 0.55))
		tmp = Float64(x * Float64(-12.0 + Float64(x * 9.0)));
	else
		tmp = Float64(3.0 + Float64(x * -12.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -0.56) || ~((x <= 0.55)))
		tmp = x * (-12.0 + (x * 9.0));
	else
		tmp = 3.0 + (x * -12.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -0.56], N[Not[LessEqual[x, 0.55]], $MachinePrecision]], N[(x * N[(-12.0 + N[(x * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(3.0 + N[(x * -12.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -0.56000000000000005 or 0.55000000000000004 < x

   1. Initial program 98.8%

      \[3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.5%

      \[\leadsto 3 \cdot \left(\color{blue}{x \cdot \left(3 \cdot x - 4\right)} + 1\right) \]

   4. Taylor expanded in x around inf 99.8%

      \[\leadsto \color{blue}{{x}^{2} \cdot \left(\left(9 + \frac{3}{{x}^{2}}\right) - 12 \cdot \frac{1}{x}\right)} \]

   6. Simplified 98.3%

      \[\leadsto \color{blue}{x \cdot \left(x \cdot 9 + \frac{\mathsf{fma}\left(-12, x, 3\right)}{x}\right)} \]

   7. Taylor expanded in x around inf 99.1%

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

   if -0.56000000000000005 < x < 0.55000000000000004

   1. Initial program 100.0%

      \[3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 98.6%

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

      1. *-commutative 98.6%

         \[\leadsto 3 + \color{blue}{x \cdot -12} \]

   5. Simplified 98.6%

      \[\leadsto \color{blue}{3 + x \cdot -12} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.56 \lor \neg \left(x \leq 0.55\right):\\ \;\;\;\;x \cdot \left(-12 + x \cdot 9\right)\\ \mathbf{else}:\\ \;\;\;\;3 + x \cdot -12\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.56 \lor \neg \left(x \leq 1.7\right):\\ \;\;\;\;x \cdot \left(x \cdot 9\right)\\ \mathbf{else}:\\ \;\;\;\;3\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -0.56) (not (<= x 1.7))) (* x (* x 9.0)) 3.0))

C

double code(double x) {
	double tmp;
	if ((x <= -0.56) || !(x <= 1.7)) {
		tmp = x * (x * 9.0);
	} else {
		tmp = 3.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-0.56d0)) .or. (.not. (x <= 1.7d0))) then
        tmp = x * (x * 9.0d0)
    else
        tmp = 3.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -0.56) || !(x <= 1.7)) {
		tmp = x * (x * 9.0);
	} else {
		tmp = 3.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -0.56) or not (x <= 1.7):
		tmp = x * (x * 9.0)
	else:
		tmp = 3.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -0.56) || !(x <= 1.7))
		tmp = Float64(x * Float64(x * 9.0));
	else
		tmp = 3.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -0.56) || ~((x <= 1.7)))
		tmp = x * (x * 9.0);
	else
		tmp = 3.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -0.56], N[Not[LessEqual[x, 1.7]], $MachinePrecision]], N[(x * N[(x * 9.0), $MachinePrecision]), $MachinePrecision], 3.0]

Derivation

1. Split input into 2 regimes

2. if x < -0.56000000000000005 or 1.69999999999999996 < x

   1. Initial program 98.8%

      \[3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 98.8%

      \[\leadsto \color{blue}{9 \cdot {x}^{2}} \]
   4. Step-by-step derivation

      1. *-commutative 98.8%

         \[\leadsto \color{blue}{{x}^{2} \cdot 9} \]

   5. Simplified 98.8%

      \[\leadsto \color{blue}{{x}^{2} \cdot 9} \]
   6. Step-by-step derivation

      1. add-sqr-sqrt 98.5%

         \[\leadsto \color{blue}{\sqrt{{x}^{2} \cdot 9} \cdot \sqrt{{x}^{2} \cdot 9}} \]

      2. pow2 98.5%

         \[\leadsto \color{blue}{{\left(\sqrt{{x}^{2} \cdot 9}\right)}^{2}} \]

      3. sqrt-prod 98.6%

         \[\leadsto {\color{blue}{\left(\sqrt{{x}^{2}} \cdot \sqrt{9}\right)}}^{2} \]

      4. sqrt-pow1 98.6%

         \[\leadsto {\left(\color{blue}{{x}^{\left(\frac{2}{2}\right)}} \cdot \sqrt{9}\right)}^{2} \]

      5. metadata-eval 98.6%

         \[\leadsto {\left({x}^{\color{blue}{1}} \cdot \sqrt{9}\right)}^{2} \]

      6. pow1 98.6%

         \[\leadsto {\left(\color{blue}{x} \cdot \sqrt{9}\right)}^{2} \]

      7. metadata-eval 98.6%

         \[\leadsto {\left(x \cdot \color{blue}{3}\right)}^{2} \]

   7. Applied egg-rr 98.6%

      \[\leadsto \color{blue}{{\left(x \cdot 3\right)}^{2}} \]
   8. Step-by-step derivation

      1. unpow-prod-down 98.8%

         \[\leadsto \color{blue}{{x}^{2} \cdot {3}^{2}} \]

      2. metadata-eval 98.8%

         \[\leadsto {x}^{2} \cdot \color{blue}{9} \]

      3. pow2 98.8%

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

      4. associate-*r* 98.7%

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

      5. *-commutative 98.7%

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

   9. Applied egg-rr 98.7%

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

   if -0.56000000000000005 < x < 1.69999999999999996

   1. Initial program 99.9%

      \[3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 95.9%

      \[\leadsto \color{blue}{3} \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.56 \lor \neg \left(x \leq 1.7\right):\\ \;\;\;\;x \cdot \left(x \cdot 9\right)\\ \mathbf{else}:\\ \;\;\;\;3\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.55 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;x \cdot \left(x \cdot 9\right)\\ \mathbf{else}:\\ \;\;\;\;3 + x \cdot -12\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -1.55) (not (<= x 1.0))) (* x (* x 9.0)) (+ 3.0 (* x -12.0))))

C

double code(double x) {
	double tmp;
	if ((x <= -1.55) || !(x <= 1.0)) {
		tmp = x * (x * 9.0);
	} else {
		tmp = 3.0 + (x * -12.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-1.55d0)) .or. (.not. (x <= 1.0d0))) then
        tmp = x * (x * 9.0d0)
    else
        tmp = 3.0d0 + (x * (-12.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -1.55) || !(x <= 1.0)) {
		tmp = x * (x * 9.0);
	} else {
		tmp = 3.0 + (x * -12.0);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -1.55) or not (x <= 1.0):
		tmp = x * (x * 9.0)
	else:
		tmp = 3.0 + (x * -12.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -1.55) || !(x <= 1.0))
		tmp = Float64(x * Float64(x * 9.0));
	else
		tmp = Float64(3.0 + Float64(x * -12.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -1.55) || ~((x <= 1.0)))
		tmp = x * (x * 9.0);
	else
		tmp = 3.0 + (x * -12.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -1.55], N[Not[LessEqual[x, 1.0]], $MachinePrecision]], N[(x * N[(x * 9.0), $MachinePrecision]), $MachinePrecision], N[(3.0 + N[(x * -12.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.55000000000000004 or 1 < x

   1. Initial program 98.8%

      \[3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 98.8%

      \[\leadsto \color{blue}{9 \cdot {x}^{2}} \]
   4. Step-by-step derivation

      1. *-commutative 98.8%

         \[\leadsto \color{blue}{{x}^{2} \cdot 9} \]

   5. Simplified 98.8%

      \[\leadsto \color{blue}{{x}^{2} \cdot 9} \]
   6. Step-by-step derivation

      1. add-sqr-sqrt 98.5%

         \[\leadsto \color{blue}{\sqrt{{x}^{2} \cdot 9} \cdot \sqrt{{x}^{2} \cdot 9}} \]

      2. pow2 98.5%

         \[\leadsto \color{blue}{{\left(\sqrt{{x}^{2} \cdot 9}\right)}^{2}} \]

      3. sqrt-prod 98.6%

         \[\leadsto {\color{blue}{\left(\sqrt{{x}^{2}} \cdot \sqrt{9}\right)}}^{2} \]

      4. sqrt-pow1 98.6%

         \[\leadsto {\left(\color{blue}{{x}^{\left(\frac{2}{2}\right)}} \cdot \sqrt{9}\right)}^{2} \]

      5. metadata-eval 98.6%

         \[\leadsto {\left({x}^{\color{blue}{1}} \cdot \sqrt{9}\right)}^{2} \]

      6. pow1 98.6%

         \[\leadsto {\left(\color{blue}{x} \cdot \sqrt{9}\right)}^{2} \]

      7. metadata-eval 98.6%

         \[\leadsto {\left(x \cdot \color{blue}{3}\right)}^{2} \]

   7. Applied egg-rr 98.6%

      \[\leadsto \color{blue}{{\left(x \cdot 3\right)}^{2}} \]
   8. Step-by-step derivation

      1. unpow-prod-down 98.8%

         \[\leadsto \color{blue}{{x}^{2} \cdot {3}^{2}} \]

      2. metadata-eval 98.8%

         \[\leadsto {x}^{2} \cdot \color{blue}{9} \]

      3. pow2 98.8%

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

      4. associate-*r* 98.7%

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

      5. *-commutative 98.7%

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

   9. Applied egg-rr 98.7%

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

   if -1.55000000000000004 < x < 1

   1. Initial program 99.9%

      \[3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 97.9%

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

      1. *-commutative 97.9%

         \[\leadsto 3 + \color{blue}{x \cdot -12} \]

   5. Simplified 97.9%

      \[\leadsto \color{blue}{3 + x \cdot -12} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.55 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;x \cdot \left(x \cdot 9\right)\\ \mathbf{else}:\\ \;\;\;\;3 + x \cdot -12\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ 3 + x \cdot \left(x \cdot 9 - 12\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (+ 3.0 (* x (- (* x 9.0) 12.0))))

C

double code(double x) {
	return 3.0 + (x * ((x * 9.0) - 12.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 3.0d0 + (x * ((x * 9.0d0) - 12.0d0))
end function

Java

public static double code(double x) {
	return 3.0 + (x * ((x * 9.0) - 12.0));
}

Python

def code(x):
	return 3.0 + (x * ((x * 9.0) - 12.0))

Julia

function code(x)
	return Float64(3.0 + Float64(x * Float64(Float64(x * 9.0) - 12.0)))
end

MATLAB

function tmp = code(x)
	tmp = 3.0 + (x * ((x * 9.0) - 12.0));
end

Wolfram

code[x_] := N[(3.0 + N[(x * N[(N[(x * 9.0), $MachinePrecision] - 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0 99.8%

   \[\leadsto \color{blue}{3 + x \cdot \left(9 \cdot x - 12\right)} \]

4. Final simplification 99.8%

   \[\leadsto 3 + x \cdot \left(x \cdot 9 - 12\right) \]
5. Add Preprocessing

Alternative 6: 97.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ 3 + x \cdot \left(x \cdot 9\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (+ 3.0 (* x (* x 9.0))))

C

double code(double x) {
	return 3.0 + (x * (x * 9.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 3.0d0 + (x * (x * 9.0d0))
end function

Java

public static double code(double x) {
	return 3.0 + (x * (x * 9.0));
}

Python

def code(x):
	return 3.0 + (x * (x * 9.0))

Julia

function code(x)
	return Float64(3.0 + Float64(x * Float64(x * 9.0)))
end

MATLAB

function tmp = code(x)
	tmp = 3.0 + (x * (x * 9.0));
end

Wolfram

code[x_] := N[(3.0 + N[(x * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0 99.8%

   \[\leadsto \color{blue}{3 + x \cdot \left(9 \cdot x - 12\right)} \]

4. Taylor expanded in x around inf 97.4%

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

   1. *-commutative 97.4%

      \[\leadsto 3 + x \cdot \color{blue}{\left(x \cdot 9\right)} \]

6. Simplified 97.4%

   \[\leadsto 3 + x \cdot \color{blue}{\left(x \cdot 9\right)} \]

7. Final simplification 97.4%

   \[\leadsto 3 + x \cdot \left(x \cdot 9\right) \]
8. Add Preprocessing

Alternative 7: 50.8% accurate, 13.0× speedup

Math

\[\begin{array}{l} \\ 3 \end{array} \]

FPCore

(FPCore (x) :precision binary64 3.0)

C

double code(double x) {
	return 3.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 3.0d0
end function

Java

public static double code(double x) {
	return 3.0;
}

Python

def code(x):
	return 3.0

Julia

function code(x)
	return 3.0
end

MATLAB

function tmp = code(x)
	tmp = 3.0;
end

Wolfram

code[x_] := 3.0

Derivation

1. Initial program 99.3%

   \[3 \cdot \left(\left(\left(x \cdot 3\right) \cdot x - x \cdot 4\right) + 1\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0 47.9%

   \[\leadsto \color{blue}{3} \]

4. Final simplification 47.9%

   \[\leadsto 3 \]
5. Add Preprocessing

Developer target: 99.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ 3 + \left(\left(9 \cdot x\right) \cdot x - 12 \cdot x\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (+ 3.0 (- (* (* 9.0 x) x) (* 12.0 x))))

C

double code(double x) {
	return 3.0 + (((9.0 * x) * x) - (12.0 * x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 3.0d0 + (((9.0d0 * x) * x) - (12.0d0 * x))
end function

Java

public static double code(double x) {
	return 3.0 + (((9.0 * x) * x) - (12.0 * x));
}

Python

def code(x):
	return 3.0 + (((9.0 * x) * x) - (12.0 * x))

Julia

function code(x)
	return Float64(3.0 + Float64(Float64(Float64(9.0 * x) * x) - Float64(12.0 * x)))
end

MATLAB

function tmp = code(x)
	tmp = 3.0 + (((9.0 * x) * x) - (12.0 * x));
end

Wolfram

code[x_] := N[(3.0 + N[(N[(N[(9.0 * x), $MachinePrecision] * x), $MachinePrecision] - N[(12.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024074 
(FPCore (x)
  :name "Diagrams.Tangent:$catParam from diagrams-lib-1.3.0.3, D"
  :precision binary64

  :alt
  (+ 3.0 (- (* (* 9.0 x) x) (* 12.0 x)))

  (* 3.0 (+ (- (* (* x 3.0) x) (* x 4.0)) 1.0)))