Metrics for ENA, Section 1.4, Mentioned, A

start0.0ms (0%)

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

analyze2.0ms (0.1%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	49.6%	50.4%	0%	0%	0%	0
0%	0%	49.6%	50.4%	0%	0%	0%	1
0%	0%	49.6%	50.4%	0%	0%	0%	2
50%	24.8%	24.8%	50.4%	0%	0%	0%	3
75%	37.2%	12.4%	50.4%	0%	0%	0%	4
87.5%	43.4%	6.2%	50.4%	0%	0%	0%	5
93.8%	46.5%	3.1%	50.4%	0%	0%	0%	6
96.9%	48.1%	1.6%	50.4%	0%	0%	0%	7
98.4%	48.8%	0.8%	50.4%	0%	0%	0%	8
99.2%	49.2%	0.4%	50.4%	0%	0%	0%	9
99.6%	49.4%	0.2%	50.4%	0%	0%	0%	10
99.8%	49.5%	0.1%	50.4%	0%	0%	0%	11
99.9%	49.6%	0%	50.4%	0%	0%	0%	12

Compiler

Compiled 12 to 10 computations (16.7% saved)

sample2.2s (81.2%)

Memory

18.0MiB live, 2 301.3MiB allocated; 568ms collecting garbage

Samples

1.6s	5 962×	2	valid
188.0ms	2 287×	1	valid
0.0ms	7×	0	valid

Precisions

Click to see histograms. Total time spent on operations: 1.5s

ival-cos: 1.2s (81.5% of total)

adjust: 208.0ms (13.6% of total)

ival-sub!: 76.0ms (5% of total)

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

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

ival-<=: 0.0ms (0% of total)

Bogosity

preprocess46.0ms (1.7%)

Memory

15.2MiB live, 59.7MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	12
1	29	12
2	117	12
3	493	12

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(abs x)

Compiler

Compiled 8 to 8 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

4 → 11

Calls

Call 1

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

Outputs
#s(approx (- 1 (cos x)) #s(hole binary64 (* 1/2 (pow x 2))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* -1/24 (pow x 2))))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* (pow x 2) (- (* 1/720 (pow x 2)) 1/24))))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* (pow x 2) (- (* (pow x 2) (+ 1/720 (* -1/40320 (pow x 2)))) 1/24))))))
#s(approx (cos x) #s(hole binary64 1))
#s(approx (cos x) #s(hole binary64 (+ 1 (* -1/2 (pow x 2)))))
#s(approx (cos x) #s(hole binary64 (+ 1 (* (pow x 2) (- (* 1/24 (pow x 2)) 1/2)))))
#s(approx (cos x) #s(hole binary64 (+ 1 (* (pow x 2) (- (* (pow x 2) (+ 1/24 (* -1/720 (pow x 2)))) 1/2)))))
#s(approx x #s(hole binary64 x))
#s(approx (- 1 (cos x)) #s(hole binary64 (- 1 (cos x))))
#s(approx (cos x) #s(hole binary64 (cos x)))

Calls

3 calls:

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

rewrite246.0ms (8.9%)

Memory

-16.8MiB live, 216.7MiB allocated; 33ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	54	153
0	56	153
1	342	153
2	2307	153

Stop Event

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

Counts

15 → 8

Calls

Call 1

Inputs
(-.f64 #s(literal 1 binary64) (cos.f64 x))
#s(literal 1 binary64)
(cos.f64 x)
x
#s(approx (- 1 (cos x)) #s(hole binary64 (* 1/2 (pow x 2))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* -1/24 (pow x 2))))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* (pow x 2) (- (* 1/720 (pow x 2)) 1/24))))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* (pow x 2) (- (* (pow x 2) (+ 1/720 (* -1/40320 (pow x 2)))) 1/24))))))
#s(approx (cos x) #s(hole binary64 1))
#s(approx (cos x) #s(hole binary64 (+ 1 (* -1/2 (pow x 2)))))
#s(approx (cos x) #s(hole binary64 (+ 1 (* (pow x 2) (- (* 1/24 (pow x 2)) 1/2)))))
#s(approx (cos x) #s(hole binary64 (+ 1 (* (pow x 2) (- (* (pow x 2) (+ 1/24 (* -1/720 (pow x 2)))) 1/2)))))
#s(approx x #s(hole binary64 x))
#s(approx (- 1 (cos x)) #s(hole binary64 (- 1 (cos x))))
#s(approx (cos x) #s(hole binary64 (cos x)))

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

eval0.0ms (0%)

Memory: 1.3MiB live, 1.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 18 to 15 computations (16.7% saved)

prune1.0ms (0%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	3	1	4
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	3	2	5

Accuracy

56.5%

Counts

5 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	56.5%	(-.f64 #s(literal 1 binary64) (cos.f64 x))
▶	55.4%	(-.f64 #s(literal 1 binary64) #s(approx (cos x) #s(literal 1 binary64)))

Compiler

Compiled 9 to 9 computations (0% saved)

series0.0ms (0%)

Memory

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

Counts

3 → 10

Calls

Call 1

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

Outputs
#s(approx (- 1 (cos x)) #s(hole binary64 (* 1/2 (pow x 2))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* -1/24 (pow x 2))))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* (pow x 2) (- (* 1/720 (pow x 2)) 1/24))))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* (pow x 2) (- (* (pow x 2) (+ 1/720 (* -1/40320 (pow x 2)))) 1/24))))))
#s(approx (cos x) #s(hole binary64 1))
#s(approx (cos x) #s(hole binary64 (+ 1 (* -1/2 (pow x 2)))))
#s(approx (cos x) #s(hole binary64 (+ 1 (* (pow x 2) (- (* 1/24 (pow x 2)) 1/2)))))
#s(approx (cos x) #s(hole binary64 (+ 1 (* (pow x 2) (- (* (pow x 2) (+ 1/24 (* -1/720 (pow x 2)))) 1/2)))))
#s(approx (- 1 (cos x)) #s(hole binary64 (- 1 (cos x))))
#s(approx (cos x) #s(hole binary64 (cos x)))

Calls

3 calls:

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

rewrite185.0ms (6.7%)

Memory

-6.2MiB live, 284.8MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	52	153
0	53	153
1	354	153
2	2388	153

Stop Event

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

Counts

13 → 4

Calls

Call 1

Inputs
(-.f64 #s(literal 1 binary64) #s(approx (cos x) #s(literal 1 binary64)))
#s(literal 1 binary64)
#s(approx (cos x) #s(literal 1 binary64))
#s(approx (- 1 (cos x)) #s(hole binary64 (* 1/2 (pow x 2))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* -1/24 (pow x 2))))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* (pow x 2) (- (* 1/720 (pow x 2)) 1/24))))))
#s(approx (- 1 (cos x)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* (pow x 2) (- (* (pow x 2) (+ 1/720 (* -1/40320 (pow x 2)))) 1/24))))))
#s(approx (cos x) #s(hole binary64 1))
#s(approx (cos x) #s(hole binary64 (+ 1 (* -1/2 (pow x 2)))))
#s(approx (cos x) #s(hole binary64 (+ 1 (* (pow x 2) (- (* 1/24 (pow x 2)) 1/2)))))
#s(approx (cos x) #s(hole binary64 (+ 1 (* (pow x 2) (- (* (pow x 2) (+ 1/24 (* -1/720 (pow x 2)))) 1/2)))))
#s(approx (- 1 (cos x)) #s(hole binary64 (- 1 (cos x))))
#s(approx (cos x) #s(hole binary64 (cos x)))

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

eval0.0ms (0%)

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

prune1.0ms (0%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

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

Accuracy

56.5%

Counts

2 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	56.5%	(-.f64 #s(literal 1 binary64) (cos.f64 x))
✓	55.4%	(-.f64 #s(literal 1 binary64) #s(approx (cos x) #s(literal 1 binary64)))

Compiler

Compiled 16 to 16 computations (0% saved)

regimes3.0ms (0.1%)

Memory

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

Counts

2 → 1

Calls

Call 1

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

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 7 to 7 computations (0% saved)

regimes3.0ms (0.1%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 7 to 7 computations (0% saved)

derivations9.0ms (0.3%)

Memory

-43.4MiB live, 3.8MiB allocated; 2ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 7 to 7 computations (0% saved)

preprocess20.0ms (0.7%)

Memory: 26.1MiB live, 70.5MiB allocated; 4ms collecting garbage
Remove: (abs x)
Compiler: Compiled 37 to 36 computations (2.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze2.0ms (0.1%)

sample2.2s (81.2%)

preprocess46.0ms (1.7%)

series1.0ms (0.1%)

rewrite246.0ms (8.9%)

eval0.0ms (0%)

prune1.0ms (0%)

series0.0ms (0%)

rewrite185.0ms (6.7%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes3.0ms (0.1%)

regimes3.0ms (0.1%)

derivations9.0ms (0.3%)

preprocess20.0ms (0.7%)

end0.0ms (0%)

Profiling