Metrics for fabs fraction 2

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 8 to 8 computations (0% saved)

sample844.0ms (32.8%)

Memory

18.3MiB live, 1 059.8MiB allocated; 303ms collecting garbage

Samples

499.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 245.0ms

ival-fabs: 95.0ms (38.8% of total)

ival-sub: 76.0ms (31% of total)

ival-div: 58.0ms (23.7% of total)

ival-true: 5.0ms (2% of total)

exact: 5.0ms (2% of total)

ival-assert: 3.0ms (1.2% of total)

adjust: 2.0ms (0.8% of total)

Bogosity

explain58.0ms (2.3%)

Memory

44.8MiB live, 136.3MiB allocated; 12ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`a`
-	-	`#s(literal 2 binary64)`
-	-	`(fabs.f64 (-.f64 a b))`
-	-	`(-.f64 a b)`
-	-	`b`
-	-	`(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

26.0ms

512×

valid

Compiler

Compiled 42 to 22 computations (47.6% saved)

Precisions

Click to see histograms. Total time spent on operations: 10.0ms

ival-sub: 3.0ms (29.3% of total)

ival-div: 3.0ms (29.3% of total)

ival-fabs: 3.0ms (29.3% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess246.0ms (9.6%)

Memory

-18.5MiB live, 218.9MiB allocated; 31ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	34
1	38	34
2	59	34
3	111	34
4	229	34
5	417	34
6	1472	34
7	5213	34
0	6	6
0	9	6
1	15	6
2	23	6
3	43	6
4	92	6
5	198	6
6	770	6
7	5212	6
0	8049	6

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

Inputs
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))

Outputs
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
(*.f64 (fabs.f64 (-.f64 b a)) #s(literal 1/2 binary64))

Symmetry

(sort a b)

Compiler

Compiled 6 to 6 computations (0% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

1.3MiB live, 1.3MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))

Compiler

Compiled 6 to 6 computations (0% saved)

simplify163.0ms (6.3%)

Memory

27.8MiB live, 152.0MiB allocated; 35ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(-.f64 a b)
cost-diff	0	(fabs.f64 (-.f64 a b))
cost-diff	0	(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	16
0	9	16
1	15	16
2	23	16
3	43	16
4	92	16
5	198	16
6	770	16
7	5212	16
0	8049	16

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
(fabs.f64 (-.f64 a b))
(-.f64 a b)
a
b
#s(literal 2 binary64)

Outputs
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
(*.f64 (fabs.f64 (-.f64 b a)) #s(literal 1/2 binary64))
(fabs.f64 (-.f64 a b))
(fabs.f64 (-.f64 b a))
(-.f64 a b)
a
b
#s(literal 2 binary64)

localize45.0ms (1.7%)

Memory

-4.0MiB live, 54.9MiB allocated; 25ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
accuracy	0.0	(-.f64 a b)
accuracy	0.0	(fabs.f64 (-.f64 a b))

Samples

40.0ms

256×

valid

Compiler

Compiled 18 to 8 computations (55.6% saved)

Precisions

Click to see histograms. Total time spent on operations: 33.0ms

ival-sub: 18.0ms (54.4% of total)

ival-div: 13.0ms (39.3% of total)

ival-fabs: 1.0ms (3% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series6.0ms (0.2%)

Memory

-39.5MiB live, 7.8MiB allocated; 5ms collecting garbage

Counts

3 → 14

Calls

Call 1

Inputs
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
(fabs.f64 (-.f64 a b))
(-.f64 a b)

Outputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (- a b))))
#s(approx (- a b) #s(hole binary64 (* -1 b)))
#s(approx (- a b) #s(hole binary64 (- a b)))
#s(approx (- a b) #s(hole binary64 a))
#s(approx (- a b) #s(hole binary64 (* a (+ 1 (* -1 (/ b a))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (neg (+ b (* -1 a))))))
#s(approx (- a b) #s(hole binary64 (* -1 (* a (- (/ b a) 1)))))
#s(approx (- a b) #s(hole binary64 (+ a (* -1 b))))
#s(approx (- a b) #s(hole binary64 (* b (- (/ a b) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (+ a (* -1 b)))))
#s(approx (- a b) #s(hole binary64 (* -1 (* b (+ 1 (* -1 (/ a b)))))))

Calls

6 calls:

Time	Variable		Point	Expression
3.0ms	b	@	inf	((/ (fabs (- a b)) 2) (fabs (- a b)) (- a b))
1.0ms	a	@	inf	((/ (fabs (- a b)) 2) (fabs (- a b)) (- a b))
1.0ms	b	@	-inf	((/ (fabs (- a b)) 2) (fabs (- a b)) (- a b))
1.0ms	a	@	-inf	((/ (fabs (- a b)) 2) (fabs (- a b)) (- a b))
0.0ms	a	@	0	((/ (fabs (- a b)) 2) (fabs (- a b)) (- a b))

simplify178.0ms (6.9%)

Memory

12.5MiB live, 239.3MiB allocated; 72ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	47	119
1	108	119
2	290	119
3	836	119
4	3382	119
0	8608	119

Stop Event

1×	iter limit
1×	node limit

Counts

14 → 14

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (- a b))))
#s(approx (- a b) #s(hole binary64 (* -1 b)))
#s(approx (- a b) #s(hole binary64 (- a b)))
#s(approx (- a b) #s(hole binary64 a))
#s(approx (- a b) #s(hole binary64 (* a (+ 1 (* -1 (/ b a))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (neg (+ b (* -1 a))))))
#s(approx (- a b) #s(hole binary64 (* -1 (* a (- (/ b a) 1)))))
#s(approx (- a b) #s(hole binary64 (+ a (* -1 b))))
#s(approx (- a b) #s(hole binary64 (* b (- (/ a b) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (+ a (* -1 b)))))
#s(approx (- a b) #s(hole binary64 (* -1 (* b (+ 1 (* -1 (/ a b)))))))

Outputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (- a b))))
#s(approx (fabs (- a b)) (fabs.f64 (-.f64 b a)))
#s(approx (- a b) #s(hole binary64 (* -1 b)))
#s(approx (- a b) (neg.f64 b))
#s(approx (- a b) #s(hole binary64 (- a b)))
#s(approx (- a b) (-.f64 a b))
#s(approx (- a b) #s(hole binary64 a))
#s(approx (- a b) a)
#s(approx (- a b) #s(hole binary64 (* a (+ 1 (* -1 (/ b a))))))
#s(approx (- a b) (-.f64 a b))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (neg (+ b (* -1 a))))))
#s(approx (fabs (- a b)) (fabs.f64 (-.f64 b a)))
#s(approx (- a b) #s(hole binary64 (* -1 (* a (- (/ b a) 1)))))
#s(approx (- a b) (-.f64 a b))
#s(approx (- a b) #s(hole binary64 (+ a (* -1 b))))
#s(approx (- a b) (-.f64 a b))
#s(approx (- a b) #s(hole binary64 (* b (- (/ a b) 1))))
#s(approx (- a b) (-.f64 a b))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (+ a (* -1 b)))))
#s(approx (fabs (- a b)) (fabs.f64 (-.f64 b a)))
#s(approx (- a b) #s(hole binary64 (* -1 (* b (+ 1 (* -1 (/ a b)))))))
#s(approx (- a b) (-.f64 a b))

rewrite36.0ms (1.4%)

Memory

7.3MiB live, 53.1MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	13
0	9	13
1	34	13
0	203	13

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

3 → 23

Calls

Call 1

Inputs
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
(fabs.f64 (-.f64 a b))
(-.f64 a b)

Outputs
(/.f64 (neg.f64 (neg.f64 (fabs.f64 (-.f64 b a)))) #s(literal 2 binary64))
(/.f64 (neg.f64 (fabs.f64 (-.f64 b a))) #s(literal -2 binary64))
(/.f64 (fabs.f64 (-.f64 b a)) #s(literal 2 binary64))
(neg.f64 (/.f64 (neg.f64 (fabs.f64 (-.f64 b a))) #s(literal 2 binary64)))
(neg.f64 (/.f64 (fabs.f64 (-.f64 b a)) #s(literal -2 binary64)))
(*.f64 (sqrt.f64 (-.f64 a b)) (sqrt.f64 (-.f64 a b)))
(pow.f64 (pow.f64 (-.f64 a b) #s(literal 2 binary64)) #s(literal 1/2 binary64))
(/.f64 (fabs.f64 (*.f64 (+.f64 b a) (-.f64 a b))) (fabs.f64 (+.f64 b a)))
(/.f64 (fabs.f64 (-.f64 (pow.f64 a #s(literal 3 binary64)) (pow.f64 b #s(literal 3 binary64)))) (fabs.f64 (fma.f64 b (+.f64 b a) (*.f64 a a))))
(sqrt.f64 (*.f64 (-.f64 b a) (-.f64 b a)))
(sqrt.f64 (pow.f64 (-.f64 a b) #s(literal 2 binary64)))
(fabs.f64 (neg.f64 (-.f64 b a)))
(fabs.f64 (neg.f64 (neg.f64 (-.f64 a b))))
(fabs.f64 (-.f64 b a))
(fabs.f64 (neg.f64 (-.f64 a b)))
(fabs.f64 (-.f64 a b))
(/.f64 (neg.f64 (*.f64 (+.f64 b a) (-.f64 a b))) (neg.f64 (+.f64 b a)))
(/.f64 (neg.f64 (-.f64 (pow.f64 a #s(literal 3 binary64)) (pow.f64 b #s(literal 3 binary64)))) (neg.f64 (fma.f64 b (+.f64 b a) (*.f64 a a))))
(/.f64 (*.f64 (+.f64 b a) (-.f64 a b)) (+.f64 b a))
(/.f64 (-.f64 (pow.f64 a #s(literal 3 binary64)) (pow.f64 b #s(literal 3 binary64))) (fma.f64 b (+.f64 b a) (*.f64 a a)))
(-.f64 (/.f64 (.f64 a a) (+.f64 b a)) (/.f64 (.f64 b b) (+.f64 b a)))
(-.f64 (/.f64 (pow.f64 a #s(literal 3 binary64)) (fma.f64 b (+.f64 b a) (.f64 a a))) (/.f64 (pow.f64 b #s(literal 3 binary64)) (fma.f64 b (+.f64 b a) (.f64 a a))))
(-.f64 a b)

eval3.0ms (0.1%)

Memory: 5.1MiB live, 5.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 316 to 100 computations (68.4% saved)

prune1.0ms (0%)

Memory

2.3MiB live, 2.3MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	27	1	28
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	28	1	29

Accuracy

100.0%

Counts

29 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

Compiler

Compiled 13 to 11 computations (15.4% saved)

simplify135.0ms (5.3%)

Memory

3.1MiB live, 100.3MiB allocated; 12ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(-.f64 b a)
cost-diff	0	(fabs.f64 (-.f64 b a))
cost-diff	0	(*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a)))
cost-diff	0	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	29
0	14	29
1	22	29
2	30	29
3	56	29
4	107	29
5	202	29
6	783	29
7	5324	29
0	8161	29

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a)))
#s(literal 1/2 binary64)
(fabs.f64 (-.f64 b a))
(-.f64 b a)
b
a

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a)))
(*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64))
#s(literal 1/2 binary64)
(fabs.f64 (-.f64 b a))
(fabs.f64 (-.f64 a b))
(-.f64 b a)
b
a

localize23.0ms (0.9%)

Memory

-6.4MiB live, 36.1MiB allocated; 5ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(-.f64 b a)
accuracy	0.0	(*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a)))
accuracy	0.0	(fabs.f64 (-.f64 b a))
accuracy	0.0	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

Samples

15.0ms

256×

valid

Compiler

Compiled 24 to 12 computations (50% saved)

Precisions

Click to see histograms. Total time spent on operations: 9.0ms

ival-sub: 3.0ms (35.2% of total)

ival-div: 2.0ms (23.5% of total)

ival-fabs: 2.0ms (23.5% of total)

ival-mult: 1.0ms (11.7% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series4.0ms (0.2%)

Memory

10.5MiB live, 10.4MiB allocated; 0ms collecting garbage

Counts

4 → 17

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a)))
(fabs.f64 (-.f64 b a))
(-.f64 b a)

Outputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (- b a)))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (- b a))))
#s(approx (- b a) #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (+ b (* -1 a))))
#s(approx (- b a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) #s(hole binary64 (* a (- (/ b a) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (+ b (* -1 a))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (+ b (* -1 a)))))
#s(approx (- b a) #s(hole binary64 (* -1 (* a (+ 1 (* -1 (/ b a)))))))
#s(approx (- b a) #s(hole binary64 (- b a)))
#s(approx (- b a) #s(hole binary64 (* b (+ 1 (* -1 (/ a b))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (neg (+ a (* -1 b)))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (neg (+ a (* -1 b))))))
#s(approx (- b a) #s(hole binary64 (* -1 (* b (- (/ a b) 1)))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	b	@	inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a))
1.0ms	b	@	-inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a))
1.0ms	a	@	inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a))
1.0ms	a	@	-inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a))
1.0ms	a	@	0	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a))

simplify137.0ms (5.3%)

Memory

35.5MiB live, 129.1MiB allocated; 26ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	58	164
1	129	158
2	337	158
3	946	158
4	3334	158
5	7413	158
0	8010	158

Stop Event

1×	iter limit
1×	node limit

Counts

17 → 17

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (- b a)))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (- b a))))
#s(approx (- b a) #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (+ b (* -1 a))))
#s(approx (- b a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) #s(hole binary64 (* a (- (/ b a) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (+ b (* -1 a))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (+ b (* -1 a)))))
#s(approx (- b a) #s(hole binary64 (* -1 (* a (+ 1 (* -1 (/ b a)))))))
#s(approx (- b a) #s(hole binary64 (- b a)))
#s(approx (- b a) #s(hole binary64 (* b (+ 1 (* -1 (/ a b))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (neg (+ a (* -1 b)))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (neg (+ a (* -1 b))))))
#s(approx (- b a) #s(hole binary64 (* -1 (* b (- (/ a b) 1)))))

Outputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (- b a)))))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (- b a))))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) #s(hole binary64 b))
#s(approx (- b a) b)
#s(approx (- b a) #s(hole binary64 (+ b (* -1 a))))
#s(approx (- b a) (-.f64 b a))
#s(approx (- b a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) (neg.f64 a))
#s(approx (- b a) #s(hole binary64 (* a (- (/ b a) 1))))
#s(approx (- b a) (-.f64 b a))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (+ b (* -1 a))))))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (+ b (* -1 a)))))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) #s(hole binary64 (* -1 (* a (+ 1 (* -1 (/ b a)))))))
#s(approx (- b a) (-.f64 b a))
#s(approx (- b a) #s(hole binary64 (- b a)))
#s(approx (- b a) (-.f64 b a))
#s(approx (- b a) #s(hole binary64 (* b (+ 1 (* -1 (/ a b))))))
#s(approx (- b a) (-.f64 b a))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (neg (+ a (* -1 b)))))))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (neg (+ a (* -1 b))))))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) #s(hole binary64 (* -1 (* b (- (/ a b) 1)))))
#s(approx (- b a) (-.f64 b a))

rewrite36.0ms (1.4%)

Memory

-4.7MiB live, 40.1MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	26
0	14	26
1	51	26
0	324	26

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

4 → 24

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a)))
(fabs.f64 (-.f64 b a))
(-.f64 b a)

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 b a)) #s(literal 1/2 binary64)))
(*.f64 (fabs.f64 (-.f64 b a)) #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a)))
(*.f64 (sqrt.f64 (-.f64 a b)) (sqrt.f64 (-.f64 a b)))
(*.f64 (sqrt.f64 (-.f64 b a)) (sqrt.f64 (-.f64 b a)))
(pow.f64 (pow.f64 (-.f64 b a) #s(literal 2 binary64)) #s(literal 1/2 binary64))
(/.f64 (fabs.f64 (*.f64 (+.f64 b a) (-.f64 b a))) (fabs.f64 (+.f64 b a)))
(/.f64 (fabs.f64 (-.f64 (pow.f64 b #s(literal 3 binary64)) (pow.f64 a #s(literal 3 binary64)))) (fabs.f64 (fma.f64 b b (*.f64 a (+.f64 b a)))))
(/.f64 (fabs.f64 (*.f64 (+.f64 b a) (-.f64 a b))) (fabs.f64 (+.f64 b a)))
(/.f64 (fabs.f64 (-.f64 (pow.f64 a #s(literal 3 binary64)) (pow.f64 b #s(literal 3 binary64)))) (fabs.f64 (fma.f64 b (+.f64 b a) (*.f64 a a))))
(sqrt.f64 (pow.f64 (-.f64 b a) #s(literal 2 binary64)))
(fabs.f64 (neg.f64 (neg.f64 (-.f64 a b))))
(fabs.f64 (neg.f64 (neg.f64 (-.f64 b a))))
(fabs.f64 (neg.f64 (-.f64 a b)))
(fabs.f64 (neg.f64 (-.f64 b a)))
(fabs.f64 (-.f64 b a))
(fabs.f64 (-.f64 a b))
(/.f64 (neg.f64 (*.f64 (+.f64 b a) (-.f64 b a))) (neg.f64 (+.f64 b a)))
(/.f64 (neg.f64 (-.f64 (pow.f64 b #s(literal 3 binary64)) (pow.f64 a #s(literal 3 binary64)))) (neg.f64 (fma.f64 b b (*.f64 a (+.f64 b a)))))
(/.f64 (*.f64 (+.f64 b a) (-.f64 b a)) (+.f64 b a))
(/.f64 (-.f64 (pow.f64 b #s(literal 3 binary64)) (pow.f64 a #s(literal 3 binary64))) (fma.f64 b b (*.f64 a (+.f64 b a))))
(-.f64 (/.f64 (.f64 b b) (+.f64 b a)) (/.f64 (.f64 a a) (+.f64 b a)))
(-.f64 (/.f64 (pow.f64 b #s(literal 3 binary64)) (fma.f64 b b (.f64 a (+.f64 b a)))) (/.f64 (pow.f64 a #s(literal 3 binary64)) (fma.f64 b b (.f64 a (+.f64 b a)))))
(-.f64 b a)

eval3.0ms (0.1%)

Memory: 6.0MiB live, 6.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 558 to 137 computations (75.4% saved)

prune10.0ms (0.4%)

Memory

-36.6MiB live, 8.1MiB allocated; 7ms collecting garbage

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	28	2	30
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	28	3	31

Accuracy

100.0%

Counts

31 → 3

Alt Table

Click to see full alt table

Status

Accuracy

Program

✓

100.0%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

▶

48.3%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))

▶

54.5%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Compiler

Compiled 44 to 36 computations (18.2% saved)

simplify158.0ms (6.2%)

Memory

3.9MiB live, 143.0MiB allocated; 33ms collecting garbage

Localize:

Found 8 expressions of interest:

New	Metric	Score	Program
cost-diff	0	#s(approx (- b a) (neg.f64 a))
cost-diff	0	(fabs.f64 #s(approx (- b a) (neg.f64 a)))
cost-diff	0	(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))
cost-diff	0	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
cost-diff	0	#s(approx (- b a) b)
cost-diff	0	(fabs.f64 #s(approx (- b a) b))
cost-diff	0	(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))
cost-diff	0	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	78
0	22	78
1	33	78
2	47	78
3	91	78
4	178	78
5	309	78
6	896	78
7	5443	78
0	8281	78

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))
#s(literal 1/2 binary64)
(fabs.f64 #s(approx (- b a) b))
#s(approx (- b a) b)
b
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))
#s(literal 1/2 binary64)
(fabs.f64 #s(approx (- b a) (neg.f64 a)))
#s(approx (- b a) (neg.f64 a))
(neg.f64 a)
a

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 #s(approx (- b a) b)) #s(literal 1/2 binary64)))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))
(*.f64 (fabs.f64 #s(approx (- b a) b)) #s(literal 1/2 binary64))
#s(literal 1/2 binary64)
(fabs.f64 #s(approx (- b a) b))
#s(approx (- b a) b)
b
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 #s(approx (- b a) (neg.f64 a))) #s(literal 1/2 binary64)))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))
(*.f64 (fabs.f64 #s(approx (- b a) (neg.f64 a))) #s(literal 1/2 binary64))
#s(literal 1/2 binary64)
(fabs.f64 #s(approx (- b a) (neg.f64 a)))
#s(approx (- b a) (neg.f64 a))
(neg.f64 a)
a

localize29.0ms (1.1%)

Memory

1.5MiB live, 47.0MiB allocated; 6ms collecting garbage

Localize:

Found 8 expressions of interest:

New	Metric	Score
accuracy	0.0	(neg.f64 a)
accuracy	0.0	(fabs.f64 #s(approx (- b a) (neg.f64 a)))
accuracy	0.0	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
accuracy	33.64713739721963	#s(approx (- b a) (neg.f64 a))
accuracy	0.0	(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))
accuracy	0.0	(fabs.f64 #s(approx (- b a) b))
accuracy	0.0	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))
accuracy	29.666902127713357	#s(approx (- b a) b)

Samples

18.0ms

256×

valid

Compiler

Compiled 46 to 13 computations (71.7% saved)

Precisions

Click to see histograms. Total time spent on operations: 9.0ms

ival-sub: 3.0ms (31.7% of total)

ival-div: 2.0ms (21.1% of total)

ival-fabs: 2.0ms (21.1% of total)

ival-mult: 1.0ms (10.6% of total)

ival-neg: 1.0ms (10.6% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

series4.0ms (0.1%)

Memory

7.5MiB live, 7.5MiB allocated; 0ms collecting garbage

Counts

9 → 18

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))
(fabs.f64 #s(approx (- b a) b))
#s(approx (- b a) b)
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))
(fabs.f64 #s(approx (- b a) (neg.f64 a)))
#s(approx (- b a) (neg.f64 a))
(neg.f64 a)

Outputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (- b a)))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (- b a))))
#s(approx (- b a) #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (+ b (* -1 a))))
#s(approx (neg a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) #s(hole binary64 (* a (- (/ b a) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (+ b (* -1 a))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (+ b (* -1 a)))))
#s(approx (- b a) #s(hole binary64 (* -1 (* a (+ 1 (* -1 (/ b a)))))))
#s(approx (- b a) #s(hole binary64 (- b a)))
#s(approx (- b a) #s(hole binary64 (* b (+ 1 (* -1 (/ a b))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (neg (+ a (* -1 b)))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (neg (+ a (* -1 b))))))
#s(approx (- b a) #s(hole binary64 (* -1 (* b (- (/ a b) 1)))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	a	@	inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (neg a))
1.0ms	a	@	-inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (neg a))
1.0ms	b	@	-inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (neg a))
0.0ms	b	@	inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (neg a))
0.0ms	a	@	0	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (neg a))

simplify134.0ms (5.2%)

Memory

-17.3MiB live, 137.2MiB allocated; 37ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	60	169
1	131	163
2	340	163
3	946	163
4	3321	163
5	7400	163
0	8044	163

Stop Event

1×	iter limit
1×	node limit

Counts

18 → 18

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (- b a)))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (- b a))))
#s(approx (- b a) #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (+ b (* -1 a))))
#s(approx (neg a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) #s(hole binary64 (* a (- (/ b a) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (+ b (* -1 a))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (+ b (* -1 a)))))
#s(approx (- b a) #s(hole binary64 (* -1 (* a (+ 1 (* -1 (/ b a)))))))
#s(approx (- b a) #s(hole binary64 (- b a)))
#s(approx (- b a) #s(hole binary64 (* b (+ 1 (* -1 (/ a b))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (neg (+ a (* -1 b)))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (neg (+ a (* -1 b))))))
#s(approx (- b a) #s(hole binary64 (* -1 (* b (- (/ a b) 1)))))

Outputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (- b a)))))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (- b a))))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) #s(hole binary64 b))
#s(approx (- b a) b)
#s(approx (- b a) #s(hole binary64 (+ b (* -1 a))))
#s(approx (- b a) (-.f64 b a))
#s(approx (neg a) #s(hole binary64 (* -1 a)))
#s(approx (neg a) (neg.f64 a))
#s(approx (- b a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) (neg.f64 a))
#s(approx (- b a) #s(hole binary64 (* a (- (/ b a) 1))))
#s(approx (- b a) (-.f64 b a))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (+ b (* -1 a))))))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (+ b (* -1 a)))))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) #s(hole binary64 (* -1 (* a (+ 1 (* -1 (/ b a)))))))
#s(approx (- b a) (-.f64 b a))
#s(approx (- b a) #s(hole binary64 (- b a)))
#s(approx (- b a) (-.f64 b a))
#s(approx (- b a) #s(hole binary64 (* b (+ 1 (* -1 (/ a b))))))
#s(approx (- b a) (-.f64 b a))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (neg (+ a (* -1 b)))))))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (neg (+ a (* -1 b))))))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) #s(hole binary64 (* -1 (* b (- (/ a b) 1)))))
#s(approx (- b a) (-.f64 b a))

rewrite39.0ms (1.5%)

Memory

7.8MiB live, 53.4MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	74
0	22	74
1	64	74
0	318	74

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

9 → 21

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))
(fabs.f64 #s(approx (- b a) b))
#s(approx (- b a) b)
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))
(fabs.f64 #s(approx (- b a) (neg.f64 a)))
#s(approx (- b a) (neg.f64 a))
(neg.f64 a)

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 #s(approx (- b a) b)) #s(literal 1/2 binary64)))
(*.f64 (fabs.f64 #s(approx (- b a) b)) #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))
(*.f64 (sqrt.f64 #s(approx (- b a) b)) (sqrt.f64 #s(approx (- b a) b)))
(pow.f64 (pow.f64 #s(approx (- b a) b) #s(literal 2 binary64)) #s(literal 1/2 binary64))
(sqrt.f64 (pow.f64 #s(approx (- b a) b) #s(literal 2 binary64)))
(fabs.f64 (neg.f64 (neg.f64 #s(approx (- b a) b))))
(fabs.f64 (neg.f64 #s(approx (- b a) b)))
(fabs.f64 #s(approx (- b a) b))
#s(approx (- b a) b)
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 #s(approx (- b a) (neg.f64 a))) #s(literal 1/2 binary64)))
(*.f64 (fabs.f64 #s(approx (- b a) (neg.f64 a))) #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))
(*.f64 (sqrt.f64 #s(approx (- b a) (neg.f64 a))) (sqrt.f64 #s(approx (- b a) (neg.f64 a))))
(pow.f64 (pow.f64 #s(approx (- b a) (neg.f64 a)) #s(literal 2 binary64)) #s(literal 1/2 binary64))
(sqrt.f64 (pow.f64 #s(approx (- b a) (neg.f64 a)) #s(literal 2 binary64)))
(fabs.f64 (neg.f64 (neg.f64 #s(approx (- b a) (neg.f64 a)))))
(fabs.f64 (neg.f64 #s(approx (- b a) (neg.f64 a))))
(fabs.f64 #s(approx (- b a) (neg.f64 a)))
#s(approx (- b a) (neg.f64 a))
(neg.f64 a)

eval2.0ms (0.1%)

Memory: 5.7MiB live, 5.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 444 to 83 computations (81.3% saved)

prune3.0ms (0.1%)

Memory

7.4MiB live, 7.4MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	26	0	26
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	26	3	29

Accuracy

100.0%

Counts

29 → 3

Alt Table

Click to see full alt table

Status

Accuracy

Program

✓

100.0%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

✓

48.3%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))

✓

54.5%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Compiler

Compiled 94 to 61 computations (35.1% saved)

regimes10.0ms (0.4%)

Memory

25.0MiB live, 25.0MiB allocated; 0ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

Calls

5 calls:

2.0ms	(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
2.0ms	b
2.0ms	(fabs.f64 (-.f64 a b))
2.0ms	a
2.0ms	(-.f64 a b)

Results

Accuracy	Segments	Branch
100.0%	1	`(-.f64 a b)`
100.0%	1	`(fabs.f64 (-.f64 a b))`
100.0%	1	`(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))`
100.0%	1	`a`
100.0%	1	`b`

Compiler

Compiled 15 to 17 computations (-13.3% saved)

regimes9.0ms (0.3%)

Memory

-28.2MiB live, 17.8MiB allocated; 3ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))

Outputs

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Calls

5 calls:

3.0ms	b
1.0ms	(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
1.0ms	(fabs.f64 (-.f64 a b))
1.0ms	a
1.0ms	(-.f64 a b)

Results

Accuracy	Segments	Branch
60.4%	3	`(-.f64 a b)`
60.4%	3	`(fabs.f64 (-.f64 a b))`
60.4%	3	`(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))`
81.8%	2	`a`
86.1%	2	`b`

Compiler

Compiled 15 to 17 computations (-13.3% saved)

regimes5.0ms (0.2%)

Memory

14.8MiB live, 14.8MiB allocated; 0ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Calls

5 calls:

1.0ms	(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
1.0ms	(fabs.f64 (-.f64 a b))
1.0ms	(-.f64 a b)
1.0ms	b
1.0ms	a

Results

Accuracy	Segments	Branch
54.5%	1	`(fabs.f64 (-.f64 a b))`
54.5%	1	`(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))`
54.5%	1	`(-.f64 a b)`
54.5%	1	`a`
54.5%	1	`b`

Compiler

Compiled 15 to 17 computations (-13.3% saved)

bsearch9.0ms (0.3%)

Memory

15.2MiB live, 15.2MiB allocated; 0ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
8.0ms	1.2507325118588002e-110	9.073103041562872e-110

Samples

4.0ms

96×

valid

Compiler

Compiled 195 to 173 computations (11.3% saved)

Precisions

Click to see histograms. Total time spent on operations: 2.0ms

ival-sub: 1.0ms (55.5% of total)

ival-div: 1.0ms (55.5% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-fabs: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

simplify50.0ms (2%)

Memory

-36.3MiB live, 62.4MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	24	63
1	43	63
2	72	63
3	141	63
4	271	63
5	738	63
6	3979	63

Stop Event

1×	node limit

Calls

Call 1

Inputs

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

(if (<=.f64 b #s(literal 475960297528979/5288447750321988791615322464262168318627237463714249754277190362195246329890490766601513683517722278780729696200186866434048 binary64)) #s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))) #s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))))

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 a b))))
(if (<=.f64 b #s(literal 475960297528979/5288447750321988791615322464262168318627237463714249754277190362195246329890490766601513683517722278780729696200186866434048 binary64)) #s(approx (/ (fabs (- a b)) 2) (.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))) #s(approx (/ (fabs (- a b)) 2) (.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

derivations174.0ms (6.8%)

Memory

-8.4MiB live, 84.8MiB allocated; 17ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 63 to 24 computations (61.9% saved)

preprocess17.0ms (0.7%)

Memory: 33.1MiB live, 33.1MiB allocated; 0ms collecting garbage
Remove: (sort a b)
Compiler: Compiled 190 to 104 computations (45.3% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample844.0ms (32.8%)

explain58.0ms (2.3%)

preprocess246.0ms (9.6%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify163.0ms (6.3%)

localize45.0ms (1.7%)

series6.0ms (0.2%)

simplify178.0ms (6.9%)

rewrite36.0ms (1.4%)

eval3.0ms (0.1%)

prune1.0ms (0%)

simplify135.0ms (5.3%)

localize23.0ms (0.9%)

series4.0ms (0.2%)

simplify137.0ms (5.3%)

rewrite36.0ms (1.4%)

eval3.0ms (0.1%)

prune10.0ms (0.4%)

simplify158.0ms (6.2%)

localize29.0ms (1.1%)

series4.0ms (0.1%)

simplify134.0ms (5.2%)

rewrite39.0ms (1.5%)

eval2.0ms (0.1%)

prune3.0ms (0.1%)

regimes10.0ms (0.4%)

regimes9.0ms (0.3%)

regimes5.0ms (0.2%)

bsearch9.0ms (0.3%)

simplify50.0ms (2%)

derivations174.0ms (6.8%)

preprocess17.0ms (0.7%)

end0.0ms (0%)

Profiling