subtraction fraction

Average Accuracy: 100.0% → 100.0%

Time: 8.8s

Precision: binary64

Cost: 448

Math

\[\frac{-\left(f + n\right)}{f - n} \]

↓

\[\frac{f + n}{n - f} \]

FPCore

(FPCore (f n) :precision binary64 (/ (- (+ f n)) (- f n)))

↓

(FPCore (f n) :precision binary64 (/ (+ f n) (- n f)))

C

double code(double f, double n) {
	return -(f + n) / (f - n);
}

↓

double code(double f, double n) {
	return (f + n) / (n - f);
}

Fortran

real(8) function code(f, n)
    real(8), intent (in) :: f
    real(8), intent (in) :: n
    code = -(f + n) / (f - n)
end function

↓

real(8) function code(f, n)
    real(8), intent (in) :: f
    real(8), intent (in) :: n
    code = (f + n) / (n - f)
end function

Java

public static double code(double f, double n) {
	return -(f + n) / (f - n);
}

↓

public static double code(double f, double n) {
	return (f + n) / (n - f);
}

Python

def code(f, n):
	return -(f + n) / (f - n)

↓

def code(f, n):
	return (f + n) / (n - f)

Julia

function code(f, n)
	return Float64(Float64(-Float64(f + n)) / Float64(f - n))
end

↓

function code(f, n)
	return Float64(Float64(f + n) / Float64(n - f))
end

MATLAB

function tmp = code(f, n)
	tmp = -(f + n) / (f - n);
end

↓

function tmp = code(f, n)
	tmp = (f + n) / (n - f);
end

Wolfram

code[f_, n_] := N[((-N[(f + n), $MachinePrecision]) / N[(f - n), $MachinePrecision]), $MachinePrecision]

↓

code[f_, n_] := N[(N[(f + n), $MachinePrecision] / N[(n - f), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{-\left(f + n\right)}{f - n} \]

2. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{f + n}{n - f}} \]
   Proof

   [Start] 100.0	\[ \frac{-\left(f + n\right)}{f - n} \]
   neg-mul-1 [=>] 100.0	\[ \frac{\color{blue}{-1 \cdot \left(f + n\right)}}{f - n} \]
   *-commutative [=>] 100.0	\[ \frac{\color{blue}{\left(f + n\right) \cdot -1}}{f - n} \]
   associate-/l* [=>] 100.0	\[ \color{blue}{\frac{f + n}{\frac{f - n}{-1}}} \]
   div-sub [=>] 100.0	\[ \frac{f + n}{\color{blue}{\frac{f}{-1} - \frac{n}{-1}}} \]
   metadata-eval [<=] 100.0	\[ \frac{f + n}{\frac{f}{\color{blue}{\frac{1}{-1}}} - \frac{n}{-1}} \]
   metadata-eval [<=] 100.0	\[ \frac{f + n}{\frac{f}{\frac{\color{blue}{--1}}{-1}} - \frac{n}{-1}} \]
   associate-/l* [<=] 100.0	\[ \frac{f + n}{\color{blue}{\frac{f \cdot -1}{--1}} - \frac{n}{-1}} \]
   *-commutative [<=] 100.0	\[ \frac{f + n}{\frac{\color{blue}{-1 \cdot f}}{--1} - \frac{n}{-1}} \]
   neg-mul-1 [<=] 100.0	\[ \frac{f + n}{\frac{\color{blue}{-f}}{--1} - \frac{n}{-1}} \]
   metadata-eval [<=] 100.0	\[ \frac{f + n}{\frac{-f}{--1} - \frac{n}{\color{blue}{\frac{1}{-1}}}} \]
   metadata-eval [<=] 100.0	\[ \frac{f + n}{\frac{-f}{--1} - \frac{n}{\frac{\color{blue}{--1}}{-1}}} \]
   associate-/l* [<=] 100.0	\[ \frac{f + n}{\frac{-f}{--1} - \color{blue}{\frac{n \cdot -1}{--1}}} \]
   *-commutative [=>] 100.0	\[ \frac{f + n}{\frac{-f}{--1} - \frac{\color{blue}{-1 \cdot n}}{--1}} \]
   neg-mul-1 [<=] 100.0	\[ \frac{f + n}{\frac{-f}{--1} - \frac{\color{blue}{-n}}{--1}} \]
   div-sub [<=] 100.0	\[ \frac{f + n}{\color{blue}{\frac{\left(-f\right) - \left(-n\right)}{--1}}} \]
   unsub-neg [<=] 100.0	\[ \frac{f + n}{\frac{\color{blue}{\left(-f\right) + \left(-\left(-n\right)\right)}}{--1}} \]
   remove-double-neg [=>] 100.0	\[ \frac{f + n}{\frac{\left(-f\right) + \color{blue}{n}}{--1}} \]
   +-commutative [<=] 100.0	\[ \frac{f + n}{\frac{\color{blue}{n + \left(-f\right)}}{--1}} \]
   sub-neg [<=] 100.0	\[ \frac{f + n}{\frac{\color{blue}{n - f}}{--1}} \]
   metadata-eval [=>] 100.0	\[ \frac{f + n}{\frac{n - f}{\color{blue}{1}}} \]
   /-rgt-identity [=>] 100.0	\[ \frac{f + n}{\color{blue}{n - f}} \]

3. Final simplification 100.0%

   \[\leadsto \frac{f + n}{n - f} \]

Alternatives

Alternative 1
Accuracy	72.7%
Cost	713

\[\begin{array}{l} \mathbf{if}\;f \leq -1.5 \cdot 10^{+90} \lor \neg \left(f \leq 9.8 \cdot 10^{+113}\right):\\ \;\;\;\;-2 \cdot \frac{n}{f} + -1\\ \mathbf{else}:\\ \;\;\;\;1 + 2 \cdot \frac{f}{n}\\ \end{array} \]

Alternative 2
Accuracy	72.5%
Cost	712

\[\begin{array}{l} \mathbf{if}\;f \leq -3.2 \cdot 10^{+89}:\\ \;\;\;\;-1 - \frac{n}{f}\\ \mathbf{elif}\;f \leq 1.02 \cdot 10^{+114}:\\ \;\;\;\;1 + 2 \cdot \frac{f}{n}\\ \mathbf{else}:\\ \;\;\;\;\frac{f}{n - f}\\ \end{array} \]

Alternative 3
Accuracy	72.2%
Cost	585

\[\begin{array}{l} \mathbf{if}\;f \leq -3.8 \cdot 10^{+89} \lor \neg \left(f \leq 1.22 \cdot 10^{+114}\right):\\ \;\;\;\;-1 - \frac{n}{f}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{f}{n}\\ \end{array} \]

Alternative 4
Accuracy	72.0%
Cost	584

\[\begin{array}{l} \mathbf{if}\;f \leq -2.7 \cdot 10^{+89}:\\ \;\;\;\;-1\\ \mathbf{elif}\;f \leq 1.7 \cdot 10^{+114}:\\ \;\;\;\;1 + \frac{f}{n}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 5
Accuracy	72.2%
Cost	584

\[\begin{array}{l} \mathbf{if}\;f \leq -1.42 \cdot 10^{+90}:\\ \;\;\;\;-1 - \frac{n}{f}\\ \mathbf{elif}\;f \leq 7.3 \cdot 10^{+114}:\\ \;\;\;\;1 + \frac{f}{n}\\ \mathbf{else}:\\ \;\;\;\;\frac{f}{n - f}\\ \end{array} \]

Alternative 6
Accuracy	72.4%
Cost	584

\[\begin{array}{l} \mathbf{if}\;f \leq -4.4 \cdot 10^{+89}:\\ \;\;\;\;-1 - \frac{n}{f}\\ \mathbf{elif}\;f \leq 8.2 \cdot 10^{+113}:\\ \;\;\;\;\frac{n}{n - f}\\ \mathbf{else}:\\ \;\;\;\;\frac{f}{n - f}\\ \end{array} \]

Alternative 7
Accuracy	71.6%
Cost	328

\[\begin{array}{l} \mathbf{if}\;f \leq -2.9 \cdot 10^{+92}:\\ \;\;\;\;-1\\ \mathbf{elif}\;f \leq 8.4 \cdot 10^{+113}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 8
Accuracy	49.7%
Cost	64

\[-1 \]

Reproduce

herbie shell --seed 2023151 
(FPCore (f n)
  :name "subtraction fraction"
  :precision binary64
  (/ (- (+ f n)) (- f n)))