Metrics for Numeric.Interval.Internal:scale from intervals-0.7.1, B

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.6MiB live, 0.6MiB 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 7 to 7 computations (0% saved)

sample545.0ms (60.2%)

Memory

-2.9MiB live, 864.2MiB allocated; 196ms collecting garbage

Samples

288.0ms

8 256×

valid

Precisions

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

ival-div!: 63.0ms (52.6% of total)

ival-mult!: 55.0ms (45.9% of total)

adjust: 1.0ms (0.8% of total)

Bogosity

preprocess92.0ms (10.2%)

Memory

-15.9MiB live, 30.7MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	15	32
1	32	32
2	70	30
3	150	30
4	245	30
5	418	30
6	1518	30
7	4830	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Symmetry

(negabs x)

(negabs y)

(sort x y)

Compiler

Compiled 10 to 10 computations (0% saved)

series5.0ms (0.5%)

Memory

10.0MiB live, 9.9MiB allocated; 0ms collecting garbage

Counts

5 → 4

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(*.f64 x y)
x
y
#s(literal 2 binary64)

Outputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* x y) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((/ (* x y) 2) (* x y) x y 2)
1.0ms	x	@	inf	((/ (* x y) 2) (* x y) x y 2)
1.0ms	y	@	-inf	((/ (* x y) 2) (* x y) x y 2)
1.0ms	y	@	inf	((/ (* x y) 2) (* x y) x y 2)
1.0ms	x	@	0	((/ (* x y) 2) (* x y) x y 2)

rewrite36.0ms (4%)

Memory

11.9MiB live, 62.1MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	35
0	14	35
1	26	35
0	64	35

Stop Event

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

Counts

9 → 17

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(*.f64 x y)
x
y
#s(literal 2 binary64)
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* x y) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Outputs
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(*.f64 y (/.f64 x #s(literal 2 binary64)))
(*.f64 x (/.f64 y #s(literal 2 binary64)))
(/.f64 (neg.f64 (*.f64 (neg.f64 x) y)) #s(literal 2 binary64))
(/.f64 (*.f64 (neg.f64 x) y) #s(literal -2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
(neg.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)))
(neg.f64 (/.f64 (*.f64 y x) #s(literal -2 binary64)))
(*.f64 y x)
(*.f64 x y)
x
y
#s(literal 2 binary64)
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (* x y) (*.f64 y x))
#s(approx x x)
#s(approx y y)

eval1.0ms (0.1%)

Memory: 2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 45 to 34 computations (24.4% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	11	2	13
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	12	2	14

Accuracy

100.0%

Counts

14 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (/.f64 y #s(literal 2 binary64)) x)
▶	100.0%	#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Compiler

Compiled 14 to 14 computations (0% saved)

series5.0ms (0.5%)

Memory

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

Counts

9 → 7

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
#s(literal 1/2 binary64)
(*.f64 y x)
y
x
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 y #s(literal 2 binary64))
#s(literal 2 binary64)

Outputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* 1/2 (* y x)) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx y #s(hole binary64 y))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x (* (/ y 2) x) (/ y 2) 2)
1.0ms	y	@	-inf	((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x (* (/ y 2) x) (/ y 2) 2)
1.0ms	y	@	inf	((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x (* (/ y 2) x) (/ y 2) 2)
1.0ms	x	@	inf	((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x (* (/ y 2) x) (/ y 2) 2)
1.0ms	y	@	0	((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x (* (/ y 2) x) (/ y 2) 2)

rewrite22.0ms (2.4%)

Memory

-10.6MiB live, 36.2MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	24	84
0	29	84
1	47	84
0	85	84

Stop Event

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

Counts

16 → 33

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
#s(literal 1/2 binary64)
(*.f64 y x)
y
x
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 y #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* 1/2 (* y x)) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y))))
#s(approx y #s(hole binary64 y))
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y)))

Outputs
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(.f64 (.f64 #s(literal 1/2 binary64) y) x)
(.f64 (.f64 y x) #s(literal 1/2 binary64))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
(.f64 y (.f64 #s(literal 1/2 binary64) x))
(.f64 x (.f64 #s(literal 1/2 binary64) y))
#s(literal 1/2 binary64)
(*.f64 y x)
(*.f64 x y)
y
x
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(*.f64 y (/.f64 x #s(literal 2 binary64)))
(*.f64 x (/.f64 y #s(literal 2 binary64)))
(/.f64 (neg.f64 (*.f64 (neg.f64 x) y)) #s(literal 2 binary64))
(/.f64 (*.f64 (neg.f64 x) y) #s(literal -2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
(neg.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)))
(neg.f64 (/.f64 (*.f64 y x) #s(literal -2 binary64)))
(/.f64 (neg.f64 (neg.f64 y)) #s(literal 2 binary64))
(/.f64 (neg.f64 y) #s(literal -2 binary64))
(/.f64 y #s(literal 2 binary64))
(neg.f64 (/.f64 (neg.f64 y) #s(literal 2 binary64)))
(neg.f64 (/.f64 y #s(literal -2 binary64)))
#s(literal 2 binary64)
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (* y x)) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
#s(approx (* y x) (*.f64 y x))
#s(approx x x)
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
#s(approx y y)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))

eval2.0ms (0.2%)

Memory: 5.3MiB live, 5.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 95 to 72 computations (24.2% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	24	1	25
Fresh	0	0	0
Picked	2	0	2
Done	0	0	0
Total	26	1	27

Accuracy

100.0%

Counts

27 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (/ (* x y) 2) (.f64 (.f64 #s(literal 1/2 binary64) x) y))

Compiler

Compiled 9 to 9 computations (0% saved)

series7.0ms (0.7%)

Memory

-35.8MiB live, 11.4MiB allocated; 2ms collecting garbage

Counts

6 → 5

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 (.f64 #s(literal 1/2 binary64) x) y))
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(*.f64 #s(literal 1/2 binary64) x)
#s(literal 1/2 binary64)
x
y

Outputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* (* 1/2 x) y) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* 1/2 x) #s(hole binary64 (* 1/2 x)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
3.0ms	y	@	inf	((/ (* x y) 2) (* (* 1/2 x) y) (* 1/2 x) 1/2 x y)
2.0ms	x	@	-inf	((/ (* x y) 2) (* (* 1/2 x) y) (* 1/2 x) 1/2 x y)
1.0ms	x	@	inf	((/ (* x y) 2) (* (* 1/2 x) y) (* 1/2 x) 1/2 x y)
1.0ms	y	@	-inf	((/ (* x y) 2) (* (* 1/2 x) y) (* 1/2 x) 1/2 x y)
0.0ms	x	@	0	((/ (* x y) 2) (* (* 1/2 x) y) (* 1/2 x) 1/2 x y)

rewrite19.0ms (2.1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	57
0	20	57
1	33	57
0	70	57

Stop Event

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

Counts

11 → 19

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 (.f64 #s(literal 1/2 binary64) x) y))
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(*.f64 #s(literal 1/2 binary64) x)
#s(literal 1/2 binary64)
x
y
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* (* 1/2 x) y) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* 1/2 x) #s(hole binary64 (* 1/2 x)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Outputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 (.f64 #s(literal 1/2 binary64) y) x)
(.f64 (.f64 y #s(literal 1/2 binary64)) x)
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(.f64 #s(literal 1/2 binary64) (.f64 y x))
(.f64 (.f64 y x) #s(literal 1/2 binary64))
(.f64 y (.f64 #s(literal 1/2 binary64) x))
(.f64 x (.f64 #s(literal 1/2 binary64) y))
(.f64 x (.f64 y #s(literal 1/2 binary64)))
(*.f64 #s(literal 1/2 binary64) x)
(*.f64 x #s(literal 1/2 binary64))
#s(literal 1/2 binary64)
x
y
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (* (* 1/2 x) y) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (* 1/2 x) (*.f64 #s(literal 1/2 binary64) x))
#s(approx x x)
#s(approx y y)

eval1.0ms (0.1%)

Memory: 2.4MiB live, 2.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 55 to 42 computations (23.6% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	13	0	13
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	13	1	14

Accuracy

100.0%

Counts

14 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (/ (* x y) 2) (.f64 (.f64 #s(literal 1/2 binary64) x) y))

Compiler

Compiled 26 to 26 computations (0% saved)

regimes10.0ms (1.1%)

Memory

-25.7MiB live, 21.5MiB allocated; 2ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (/ (* x y) 2) (.f64 (.f64 #s(literal 1/2 binary64) x) y))
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 (*.f64 x y) #s(literal 2 binary64))

Outputs
(*.f64 (/.f64 y #s(literal 2 binary64)) x)

Calls

4 calls:

5.0ms	y
2.0ms	x
2.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))
2.0ms	(*.f64 x y)

Results

Accuracy	Segments	Branch
100.0%	1	`(*.f64 x y)`
100.0%	1	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes5.0ms (0.5%)

Memory

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

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
#s(approx (/ (* x y) 2) (.f64 (.f64 #s(literal 1/2 binary64) x) y))

Outputs
#s(approx (/ (* x y) 2) (.f64 (.f64 #s(literal 1/2 binary64) x) y))

Calls

4 calls:

1.0ms	(*.f64 x y)
1.0ms	y
1.0ms	x
1.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Results

Accuracy	Segments	Branch
100.0%	1	`(*.f64 x y)`
100.0%	1	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes4.0ms (0.4%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Outputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))

Calls

4 calls:

1.0ms	x
1.0ms	y
1.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))
1.0ms	(*.f64 x y)

Results

Accuracy	Segments	Branch
100.0%	1	`(*.f64 x y)`
100.0%	1	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 12 computations (-20% saved)

derivations4.0ms (0.5%)

Memory

-45.0MiB live, 4.2MiB allocated; 4ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 15 to 15 computations (0% saved)

preprocess142.0ms (15.7%)

Memory

8.1MiB live, 246.5MiB allocated; 41ms collecting garbage

Remove

(sort x y)

(negabs y)

(negabs x)

Compiler

Compiled 178 to 178 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample545.0ms (60.2%)

preprocess92.0ms (10.2%)

series5.0ms (0.5%)

rewrite36.0ms (4%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series5.0ms (0.5%)

rewrite22.0ms (2.4%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

series7.0ms (0.7%)

rewrite19.0ms (2.1%)

eval1.0ms (0.1%)

prune2.0ms (0.2%)

regimes10.0ms (1.1%)

regimes5.0ms (0.5%)

regimes4.0ms (0.4%)

derivations4.0ms (0.5%)

preprocess142.0ms (15.7%)

end0.0ms (0%)

Profiling