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

start0.0ms (0%)

Memory: 0.1MiB live, 0.0MiB 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)

sample795.0ms (72.1%)

Memory

21.1MiB live, 1 193.1MiB allocated; 365ms collecting garbage

Samples

478.0ms

8 256×

valid

Precisions

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

ival-mult: 108.0ms (56.4% of total)

ival-div: 67.0ms (35% of total)

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

exact: 5.0ms (2.6% of total)

adjust: 3.0ms (1.6% of total)

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

Bogosity

explain80.0ms (7.2%)

Memory

7.1MiB live, 150.2MiB allocated; 8ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`y`
-	-	`#s(literal 2 binary64)`
-	-	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
-	-	`(*.f64 x y)`
-	-	`x`

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

46.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult: 28.0ms (85% of total)

ival-div: 4.0ms (12.1% 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)

preprocess25.0ms (2.3%)

Memory

-2.1MiB live, 47.0MiB allocated; 13ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	30
1	31	27
2	66	25
3	118	25
4	129	25
0	5	5
0	7	5
1	12	5
2	17	5
3	18	5
0	18	5

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

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

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

Symmetry

(negabs y)

(negabs x)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

simplify4.0ms (0.3%)

Memory

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

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 x y)
cost-diff	0	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	12	11
2	17	11
3	18	11
0	18	11

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize21.0ms (1.9%)

Memory

1.7MiB live, 45.4MiB allocated; 13ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(/.f64 (*.f64 x y) #s(literal 2 binary64))
accuracy	0.0	(*.f64 x y)

Samples

11.0ms

256×

valid

Compiler

Compiled 13 to 7 computations (46.2% saved)

Precisions

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

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

ival-mult: 2.0ms (43.6% 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.4%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

Outputs
(* 1/2 (* x y))
(* x y)

Calls

6 calls:

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

simplify3.0ms (0.3%)

Memory

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

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
1	9	8
2	16	8
3	18	8
0	18	8

Stop Event

1×	iter limit
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
(* 1/2 (* x y))
(* x y)

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

rewrite24.0ms (2.2%)

Memory

0.3MiB live, 45.0MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	7	8
1	16	8
2	34	8
3	56	8
4	80	8
5	90	8
0	90	8

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

2 → 16

Calls

Call 1

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

Outputs
(*.f64 (/.f64 x #s(literal -2 binary64)) (neg.f64 y))
(*.f64 (/.f64 y #s(literal -2 binary64)) (neg.f64 x))
(*.f64 (/.f64 x #s(literal 2 binary64)) y)
(*.f64 (neg.f64 x) (/.f64 y #s(literal -2 binary64)))
(*.f64 (neg.f64 y) (/.f64 x #s(literal -2 binary64)))
(*.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 (*.f64 (neg.f64 x) y) #s(literal -2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
(neg.f64 (/.f64 (*.f64 y x) #s(literal -2 binary64)))
(*.f64 (neg.f64 x) (neg.f64 y))
(*.f64 (neg.f64 y) (neg.f64 x))
(*.f64 y x)
(*.f64 x y)
(neg.f64 (*.f64 (neg.f64 x) y))

eval2.0ms (0.2%)

Memory: 5.7MiB live, 5.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 112 to 40 computations (64.3% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	17	1	18
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	18	1	19

Accuracy

100.0%

Counts

19 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 11 to 9 computations (18.2% saved)

simplify7.0ms (0.7%)

Memory

-34.1MiB live, 11.3MiB allocated; 8ms collecting garbage

Algorithm

1×	egg-herbie

Localize:

Found 3 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	22
0	11	22
1	19	22
2	31	22
3	34	22
0	34	22

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize26.0ms (2.3%)

Memory

2.1MiB live, 60.0MiB allocated; 8ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(.f64 (.f64 y x) #s(literal 1/2 binary64))
accuracy	0.0	(*.f64 y x)
accuracy	0.0	#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))

Samples

19.0ms

256×

valid

Compiler

Compiled 18 to 10 computations (44.4% saved)

Precisions

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

ival-mult: 10.0ms (83.7% of total)

ival-div: 2.0ms (16.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)

series2.0ms (0.2%)

Memory

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

Counts

3 → 2

Calls

Call 1

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

Outputs
(* 1/2 (* x y))
(* x y)

Calls

6 calls:

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

simplify3.0ms (0.3%)

Memory

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

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
1	9	8
2	16	8
3	18	8
0	18	8

Stop Event

1×	iter limit
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
(* 1/2 (* x y))
(* x y)

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

rewrite22.0ms (2%)

Memory

-25.9MiB live, 20.7MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	19
0	11	19
1	24	19
2	49	19
3	73	19
4	109	19
5	149	19
6	160	19
0	160	19

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

3 → 19

Calls

Call 1

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

Outputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 #s(literal -1/2 binary64) (.f64 (neg.f64 x) y))
(.f64 (.f64 #s(literal -1/2 binary64) y) (neg.f64 x))
(.f64 (.f64 #s(literal -1/2 binary64) x) (neg.f64 y))
(.f64 (.f64 #s(literal 1/2 binary64) y) x)
(.f64 (neg.f64 x) (.f64 #s(literal -1/2 binary64) y))
(.f64 (neg.f64 y) (.f64 #s(literal -1/2 binary64) x))
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(.f64 (.f64 (neg.f64 x) y) #s(literal -1/2 binary64))
(.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))
(neg.f64 (.f64 #s(literal -1/2 binary64) (.f64 y x)))
(*.f64 (neg.f64 x) (neg.f64 y))
(*.f64 (neg.f64 y) (neg.f64 x))
(*.f64 y x)
(*.f64 x y)
(neg.f64 (*.f64 (neg.f64 x) y))

eval3.0ms (0.3%)

Memory: 7.0MiB live, 7.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 237 to 58 computations (75.5% saved)

prune3.0ms (0.3%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	20	0	20
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	20	1	21

Accuracy

100.0%

Counts

21 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 27 to 21 computations (22.2% saved)

regimes5.0ms (0.5%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

4 calls:

1.0ms	y
1.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))
1.0ms	x
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)

simplify40.0ms (3.6%)

Memory

-12.1MiB live, 35.3MiB allocated; 3ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	11
1	14	11
2	19	11
3	23	11
4	30	11
5	52	11
6	208	11
7	1866	11
8	3521	11

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations3.0ms (0.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
1	9	8
2	16	8
3	18	8
0	18	8

Stop Event

1×	done
1×	iter limit
1×	saturated

Compiler

Compiled 11 to 9 computations (18.2% saved)

preprocess27.0ms (2.5%)

Memory

8.5MiB live, 54.9MiB allocated; 6ms collecting garbage

Remove

(sort x y)

(negabs x)

(negabs y)

Compiler

Compiled 98 to 82 computations (16.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample795.0ms (72.1%)

explain80.0ms (7.2%)

preprocess25.0ms (2.3%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify4.0ms (0.3%)

localize21.0ms (1.9%)

series4.0ms (0.4%)

simplify3.0ms (0.3%)

rewrite24.0ms (2.2%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

simplify7.0ms (0.7%)

localize26.0ms (2.3%)

series2.0ms (0.2%)

simplify3.0ms (0.3%)

rewrite22.0ms (2%)

eval3.0ms (0.3%)

prune3.0ms (0.3%)

regimes5.0ms (0.5%)

simplify40.0ms (3.6%)

derivations3.0ms (0.3%)

preprocess27.0ms (2.5%)

end0.0ms (0%)

Profiling