Metrics for Cancel like terms

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

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

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample938.0ms (43.1%)

Memory

41.6MiB live, 528.0MiB allocated; 878ms collecting garbage

Samples

613.0ms	3 855×	1	valid
123.0ms	4 401×	0	valid

Precisions

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

ival-add: 146.0ms (47.5% of total)

adjust: 94.0ms (30.6% of total)

ival-sub: 54.0ms (17.6% of total)

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

exact: 5.0ms (1.6% of total)

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

Bogosity

explain61.0ms (2.8%)

Memory

-41.2MiB live, 55.0MiB allocated; 15ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
127	4	(1678764.7643587661)	-	`(-.f64 (+.f64 #s(literal 1 binary64) x) x)`
0	0	-	-	`(+.f64 #s(literal 1 binary64) x)`
0	0	-	-	`#s(literal 1 binary64)`
0	0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`-.f64`	`(-.f64 (+.f64 #s(literal 1 binary64) x) x)`	cancellation	131	0

Confusion

	Predicted +	Predicted -
+	127	0
-	4	125

Precision

0.9694656488549618

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	127	0	0
-	4	0	125

Precision?

0.9694656488549618

Recall?

1.0

Freqs

test

number	freq
0	125
1	131

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

18.0ms	252×	1	valid
8.0ms	260×	0	valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

adjust: 6.0ms (42.4% of total)

ival-add: 4.0ms (28.3% of total)

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

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

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

exact: 0.0ms (0% of total)

preprocess228.0ms (10.5%)

Memory

18.0MiB live, 156.2MiB allocated; 23ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	6	15
1	11	2
2	24	2
3	67	2
4	287	2
5	2340	2
0	4	5
0	6	5
1	11	1
2	18	1
3	53	1
4	194	1
5	1686	1
6	7283	1
0	8033	1

Stop Event

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

Calls

Call 1

Inputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Outputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
#s(literal 1 binary64)

Symmetry

(abs x)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	51.9%	(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Compiler

Compiled 5 to 4 computations (20% saved)

simplify177.0ms (8.1%)

Memory

17.9MiB live, 109.3MiB allocated; 9ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(+.f64 #s(literal 1 binary64) x)
cost-diff	4	(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	6
1	11	6
2	18	6
3	53	6
4	194	6
5	1686	6
6	7283	6
0	8033	6

Stop Event

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

Calls

Call 1

Inputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
(+.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x

Outputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
#s(literal 1 binary64)
(+.f64 #s(literal 1 binary64) x)
(-.f64 x #s(literal -1 binary64))
#s(literal 1 binary64)
x

localize17.0ms (0.8%)

Memory

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

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(+.f64 #s(literal 1 binary64) x)
accuracy	30.757113221006527	(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Samples

8.0ms	126×	1	valid
4.0ms	130×	0	valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

adjust: 3.0ms (44.1% of total)

ival-add: 2.0ms (29.4% of total)

ival-sub: 2.0ms (29.4% of total)

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

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

exact: 0.0ms (0% of total)

series1.0ms (0%)

Memory

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

Counts

2 → 5

Calls

Call 1

Inputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
(+.f64 #s(literal 1 binary64) x)

Outputs
#s(approx (- (+ 1 x) x) #s(hole binary64 1))
#s(approx (+ 1 x) #s(hole binary64 1))
#s(approx (+ 1 x) #s(hole binary64 (+ 1 x)))
#s(approx (+ 1 x) #s(hole binary64 x))
#s(approx (+ 1 x) #s(hole binary64 (* x (+ 1 (/ 1 x)))))

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	inf	((- (+ 1 x) x) (+ 1 x))
0.0ms	x	@	-inf	((- (+ 1 x) x) (+ 1 x))
0.0ms	x	@	0	((- (+ 1 x) x) (+ 1 x))

simplify193.0ms (8.9%)

Memory

-21.0MiB live, 94.4MiB allocated; 38ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	31
1	25	27
2	44	27
3	194	27
4	1736	27
5	6275	27
0	8534	27

Stop Event

1×	iter limit
1×	node limit

Counts

5 → 5

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(hole binary64 1))
#s(approx (+ 1 x) #s(hole binary64 1))
#s(approx (+ 1 x) #s(hole binary64 (+ 1 x)))
#s(approx (+ 1 x) #s(hole binary64 x))
#s(approx (+ 1 x) #s(hole binary64 (* x (+ 1 (/ 1 x)))))

Outputs
#s(approx (- (+ 1 x) x) #s(hole binary64 1))
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))
#s(approx (+ 1 x) #s(hole binary64 1))
#s(approx (+ 1 x) #s(literal 1 binary64))
#s(approx (+ 1 x) #s(hole binary64 (+ 1 x)))
#s(approx (+ 1 x) (-.f64 x #s(literal -1 binary64)))
#s(approx (+ 1 x) #s(hole binary64 x))
#s(approx (+ 1 x) x)
#s(approx (+ 1 x) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (+ 1 x) (-.f64 x #s(literal -1 binary64)))

rewrite59.0ms (2.7%)

Memory

3.1MiB live, 47.7MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	4	8
0	6	8
1	35	4
0	307	4

Stop Event

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

Counts

2 → 12

Calls

Call 1

Inputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
(+.f64 #s(literal 1 binary64) x)

Outputs
#s(literal 1 binary64)
(/.f64 (-.f64 (*.f64 x x) #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))) (neg.f64 (-.f64 #s(literal 1 binary64) x)))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64))) (neg.f64 (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))))
(/.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)) (-.f64 #s(literal 1 binary64) x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 x x (-.f64 #s(literal 1 binary64) x)))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64)))
(-.f64 (/.f64 #s(literal 1 binary64) (-.f64 #s(literal 1 binary64) x)) (/.f64 (*.f64 x x) (-.f64 #s(literal 1 binary64) x)))
(-.f64 x #s(literal -1 binary64))
(+.f64 (/.f64 #s(literal 1 binary64) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))))
(+.f64 x #s(literal 1 binary64))
(+.f64 #s(literal 1 binary64) x)

eval2.0ms (0.1%)

Memory: 1.6MiB live, 1.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 161 to 53 computations (67.1% saved)

prune1.0ms (0%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	15	1	16
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	16	1	17

Accuracy

100.0%

Counts

17 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Compiler

Compiled 7 to 6 computations (14.3% saved)

simplify161.0ms (7.4%)

Memory

5.8MiB live, 94.1MiB allocated; 10ms collecting garbage

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
cost-diff	0	#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	5	8
1	10	4
2	18	4
3	53	4
4	194	4
5	1708	4
6	7315	4
0	8011	4

Stop Event

1×	iter limit
1×	node limit
1×	saturated

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))
#s(literal 1 binary64)

localize42.0ms (1.9%)

Memory

-42.9MiB live, 13.9MiB allocated; 6ms collecting garbage

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Samples

35.0ms	126×	1	valid
3.0ms	130×	0	valid

Compiler

Compiled 8 to 6 computations (25% saved)

Precisions

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

adjust: 19.0ms (56.8% of total)

ival-add: 12.0ms (35.9% of total)

ival-sub: 2.0ms (6% of total)

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

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

exact: 0.0ms (0% of total)

series0.0ms (0%)

Memory

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

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Outputs
#s(approx (- (+ 1 x) x) #s(hole binary64 1))

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	0	((- (+ 1 x) x))
0.0ms	x	@	inf	((- (+ 1 x) x))
0.0ms	x	@	-inf	((- (+ 1 x) x))

simplify157.0ms (7.2%)

Memory

21.8MiB live, 111.8MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	7
1	10	3
2	18	3
3	53	3
4	194	3
5	1708	3
6	7315	3
0	8011	3

Stop Event

1×	iter limit
1×	node limit

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(hole binary64 1))

Outputs
#s(approx (- (+ 1 x) x) #s(hole binary64 1))
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

rewrite50.0ms (2.3%)

Memory

-15.6MiB live, 30.7MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	7
0	5	7
1	34	3
0	307	3

Stop Event

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

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Outputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 7 to 6 computations (14.3% saved)

prune1.0ms (0%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	1	0	1
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	1	1	2

Accuracy

100.0%

Counts

2 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Compiler

Compiled 19 to 14 computations (26.3% saved)

regimes2.0ms (0.1%)

Memory

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

Accuracy

Total -30.8b remaining (-∞%)

Threshold costs -30.8b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))
(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Outputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Calls

2 calls:

1.0ms	x
1.0ms	(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Results

Accuracy	Segments	Branch
100.0%	1	`(-.f64 (+.f64 #s(literal 1 binary64) x) x)`
100.0%	1	`x`

Compiler

Compiled 6 to 5 computations (16.7% saved)

simplify35.0ms (1.6%)

Memory

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

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	5	7
1	10	5
2	17	3
3	41	3
4	153	3
5	1141	3
6	4949	3

Stop Event

1×	node limit

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Outputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

derivations33.0ms (1.5%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 7 to 6 computations (14.3% saved)

preprocess19.0ms (0.9%)

Memory: -28.0MiB live, 21.9MiB allocated; 7ms collecting garbage
Remove: (abs x)
Compiler: Compiled 38 to 32 computations (15.8% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample938.0ms (43.1%)

explain61.0ms (2.8%)

preprocess228.0ms (10.5%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify177.0ms (8.1%)

localize17.0ms (0.8%)

series1.0ms (0%)

simplify193.0ms (8.9%)

rewrite59.0ms (2.7%)

eval2.0ms (0.1%)

prune1.0ms (0%)

simplify161.0ms (7.4%)

localize42.0ms (1.9%)

series0.0ms (0%)

simplify157.0ms (7.2%)

rewrite50.0ms (2.3%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes2.0ms (0.1%)

simplify35.0ms (1.6%)

derivations33.0ms (1.5%)

preprocess19.0ms (0.9%)

end0.0ms (0%)

Profiling