Metrics for FastMath test2

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.5MiB live, 0.5MiB 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 13 to 11 computations (15.4% saved)

sample1.2s (78.9%)

Memory

-88.0MiB live, 1 078.0MiB allocated; 265ms collecting garbage

Samples

737.0ms	8 117×	0	valid
16.0ms	78×	2	valid
6.0ms	61×	1	valid

Precisions

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

ival-mult: 252.0ms (67.7% of total)

ival-add: 95.0ms (25.5% of total)

adjust: 8.0ms (2.2% of total)

exact: 8.0ms (2.2% of total)

ival-true: 6.0ms (1.6% of total)

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

Bogosity

explain102.0ms (6.9%)

Memory

18.3MiB live, 162.8MiB allocated; 21ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 d1 #s(literal 10 binary64))`
-	-	`(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))`
-	-	`(*.f64 d1 d2)`
-	-	`(*.f64 d1 #s(literal 20 binary64))`
-	-	`d2`
-	-	`(+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2))`
-	-	`d1`
-	-	`#s(literal 20 binary64)`
-	-	`#s(literal 10 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

30.0ms	478×	0	valid
3.0ms	20×	2	valid
2.0ms	14×	1	valid

Compiler

Compiled 77 to 31 computations (59.7% saved)

Precisions

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

ival-mult: 12.0ms (60.6% of total)

ival-add: 5.0ms (25.3% of total)

adjust: 1.0ms (5.1% of total)

exact: 1.0ms (5.1% of total)

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

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

preprocess58.0ms (3.9%)

Memory

-11.2MiB live, 34.9MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	51
1	76	41
2	264	29
3	568	25
4	1033	25
5	1667	25
6	2422	25
7	2812	25
8	3102	25
9	3212	25
10	3237	25
0	9	11
0	9	11
0	9	11

Stop Event

1×	saturated
1×	saturated
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))

Outputs
(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))

Symmetry

(negabs d1)

Compiler

Compiled 11 to 9 computations (18.2% 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

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))

Compiler

Compiled 11 to 9 computations (18.2% saved)

simplify4.0ms (0.2%)

Memory

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

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 d1 d2)
cost-diff	0	(*.f64 d1 #s(literal 10 binary64))
cost-diff	0	(+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2))
cost-diff	0	(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	31
0	9	31
0	9	31

Stop Event

1×	saturated
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))
(+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2))
(*.f64 d1 #s(literal 10 binary64))
d1
#s(literal 10 binary64)
(*.f64 d1 d2)
d2
(*.f64 d1 #s(literal 20 binary64))
#s(literal 20 binary64)

Outputs
(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))
(+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2))
(*.f64 d1 #s(literal 10 binary64))
d1
#s(literal 10 binary64)
(*.f64 d1 d2)
d2
(*.f64 d1 #s(literal 20 binary64))
#s(literal 20 binary64)

localize24.0ms (1.6%)

Memory

2.4MiB live, 48.9MiB allocated; 3ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.0	(*.f64 d1 #s(literal 20 binary64))
accuracy	0.0	(*.f64 d1 #s(literal 10 binary64))
accuracy	0.05859375	(+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2))
accuracy	0.15234375	(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))

Samples

16.0ms	239×	0	valid
2.0ms	10×	2	valid
1.0ms	7×	1	valid

Compiler

Compiled 33 to 11 computations (66.7% saved)

Precisions

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

ival-add: 5.0ms (46.5% of total)

ival-mult: 5.0ms (46.5% of total)

adjust: 1.0ms (9.3% of total)

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

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

exact: 0.0ms (0% of total)

series7.0ms (0.5%)

Memory

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

Counts

5 → 14

Calls

Call 1

Inputs
(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))
(+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2))
(*.f64 d1 #s(literal 10 binary64))
(*.f64 d1 d2)
(*.f64 d1 #s(literal 20 binary64))

Outputs
(* d1 (+ 30 d2))
(* d1 (+ 10 d2))
(* 10 d1)
(* d1 d2)
(* 20 d1)
(* -1 (* d1 (- (* -1 d2) 30)))
(* -1 (* d1 (- (* -1 d2) 10)))
(+ (* 10 d1) (* 20 d1))
(+ (* 10 d1) (+ (* 20 d1) (* d1 d2)))
(+ (* 10 d1) (* d1 d2))
(* d2 (+ d1 (+ (* 10 (/ d1 d2)) (* 20 (/ d1 d2)))))
(* d2 (+ d1 (* 10 (/ d1 d2))))
(* -1 (* d2 (+ (* -1 d1) (* -1 (/ (+ (* 10 d1) (* 20 d1)) d2)))))
(* -1 (* d2 (+ (* -10 (/ d1 d2)) (* -1 d1))))

Calls

6 calls:

Time	Variable		Point	Expression
2.0ms	d1	@	inf	((+ (+ (* d1 10) (* d1 d2)) (* d1 20)) (+ (* d1 10) (* d1 d2)) (* d1 10) (* d1 d2) (* d1 20))
1.0ms	d1	@	-inf	((+ (+ (* d1 10) (* d1 d2)) (* d1 20)) (+ (* d1 10) (* d1 d2)) (* d1 10) (* d1 d2) (* d1 20))
1.0ms	d2	@	0	((+ (+ (* d1 10) (* d1 d2)) (* d1 20)) (+ (* d1 10) (* d1 d2)) (* d1 10) (* d1 d2) (* d1 20))
1.0ms	d1	@	0	((+ (+ (* d1 10) (* d1 d2)) (* d1 20)) (+ (* d1 10) (* d1 d2)) (* d1 10) (* d1 d2) (* d1 20))
1.0ms	d2	@	-inf	((+ (+ (* d1 10) (* d1 d2)) (* d1 20)) (+ (* d1 10) (* d1 d2)) (* d1 10) (* d1 d2) (* d1 20))

simplify60.0ms (4.1%)

Memory

-21.0MiB live, 29.0MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	43	62
1	149	62
2	465	62
3	1719	62
4	4638	62
5	7867	62
0	8129	62

Stop Event

1×	saturated
1×	node limit

Counts

14 → 0

Calls

Call 1

Inputs
(* d1 (+ 30 d2))
(* d1 (+ 10 d2))
(* 10 d1)
(* d1 d2)
(* 20 d1)
(* -1 (* d1 (- (* -1 d2) 30)))
(* -1 (* d1 (- (* -1 d2) 10)))
(+ (* 10 d1) (* 20 d1))
(+ (* 10 d1) (+ (* 20 d1) (* d1 d2)))
(+ (* 10 d1) (* d1 d2))
(* d2 (+ d1 (+ (* 10 (/ d1 d2)) (* 20 (/ d1 d2)))))
(* d2 (+ d1 (* 10 (/ d1 d2))))
(* -1 (* d2 (+ (* -1 d1) (* -1 (/ (+ (* 10 d1) (* 20 d1)) d2)))))
(* -1 (* d2 (+ (* -10 (/ d1 d2)) (* -1 d1))))

Outputs
(* d1 (+ 30 d2))
(* d1 (+ 10 d2))
(* 10 d1)
(* d1 d2)
(* 20 d1)
(* -1 (* d1 (- (* -1 d2) 30)))
(* -1 (* d1 (- (* -1 d2) 10)))
(+ (* 10 d1) (* 20 d1))
(+ (* 10 d1) (+ (* 20 d1) (* d1 d2)))
(+ (* 10 d1) (* d1 d2))
(* d2 (+ d1 (+ (* 10 (/ d1 d2)) (* 20 (/ d1 d2)))))
(* d2 (+ d1 (* 10 (/ d1 d2))))
(* -1 (* d2 (+ (* -1 d1) (* -1 (/ (+ (* 10 d1) (* 20 d1)) d2)))))
(* -1 (* d2 (+ (* -10 (/ d1 d2)) (* -1 d1))))

rewrite18.0ms (1.2%)

Memory

-15.2MiB live, 28.5MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	27
0	9	27
0	9	27

Stop Event

1×	saturated
1×	saturated
1×	saturated

Counts

5 → 5

Calls

Call 1

Inputs
(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))
(+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2))
(*.f64 d1 #s(literal 10 binary64))
(*.f64 d1 d2)
(*.f64 d1 #s(literal 20 binary64))

Outputs
(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))
(+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2))
(*.f64 d1 #s(literal 10 binary64))
(*.f64 d1 d2)
(*.f64 d1 #s(literal 20 binary64))

eval2.0ms (0.1%)

Memory: 3.9MiB live, 3.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 55 to 9 computations (83.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	5	0	5
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	5	1	6

Accuracy

99.7%

Counts

6 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))

Compiler

Compiled 22 to 18 computations (18.2% saved)

simplify8.0ms (0.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	11

Stop Event

1×

saturated

Calls

Call 1

Inputs
(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))

Outputs
(+.f64 (+.f64 (.f64 d1 #s(literal 10 binary64)) (.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 11 to 9 computations (18.2% saved)

preprocess26.0ms (1.8%)

Memory: -9.1MiB live, 34.0MiB allocated; 11ms collecting garbage
Remove: (negabs d1)
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%)

sample1.2s (78.9%)

explain102.0ms (6.9%)

preprocess58.0ms (3.9%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify4.0ms (0.2%)

localize24.0ms (1.6%)

series7.0ms (0.5%)

simplify60.0ms (4.1%)

rewrite18.0ms (1.2%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

simplify8.0ms (0.6%)

derivations0.0ms (0%)

preprocess26.0ms (1.8%)

end0.0ms (0%)

Profiling