Data.Random.Distribution.Normal:doubleStdNormalZ from random-fu-0.2.6.2

Time bar (total: 2.1s)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory
0.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
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)

sample599.0ms (28%)

Memory
26.4MiB live, 866.5MiB allocated; 237ms collecting garbage
Samples
324.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 145.0ms
ival-add: 69.0ms (47.6% of total)
ival-sub: 59.0ms (40.7% of total)
ival-true: 6.0ms (4.1% of total)
exact: 5.0ms (3.5% of total)
ival-assert: 3.0ms (2.1% of total)
adjust: 2.0ms (1.4% of total)
Bogosity

explain100.0ms (4.7%)

Memory
5.5MiB live, 50.3MiB allocated; 15ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-(+.f64 x x)
00-0-#s(literal 1 binary64)
00-0-(-.f64 (+.f64 x x) #s(literal 1 binary64))
00-0-x
Confusion
Predicted +Predicted -
+00
-0256
Precision
0/0
Recall
0/0
Confusion?
Predicted +Predicted MaybePredicted -
+000
-00256
Precision?
0/0
Recall?
0/0
Freqs
test
numberfreq
0256
Total Confusion?
Predicted +Predicted MaybePredicted -
+000
-001
Precision?
0/0
Recall?
0/0
Samples
16.0ms512×0valid
Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 7.0ms
ival-sub: 3.0ms (45.8% of total)
ival-add: 3.0ms (45.8% 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)

preprocess306.0ms (14.3%)

Memory
-9.0MiB live, 197.1MiB allocated; 50ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0613
11413
22511
34911
413811
571010
6633510
045
065
1125
2185
3345
41075
55955
655375
080404
Stop Event
1×iter limit
1×node limit
1×iter limit
1×node limit
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

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

Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory
0.9MiB live, 0.9MiB allocated; 0ms collecting garbage
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Compiler

Compiled 5 to 4 computations (20% saved)

series2.0ms (0.1%)

Memory
4.1MiB live, 4.1MiB allocated; 0ms collecting garbage
Counts
4 → 7
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
x
#s(literal 1 binary64)
Outputs
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))
Calls

3 calls:

TimeVariablePointExpression
1.0ms
x
@inf
((- (+ x x) 1) (+ x x) x 1)
1.0ms
x
@-inf
((- (+ x x) 1) (+ x x) x 1)
0.0ms
x
@0
((- (+ x x) 1) (+ x x) x 1)

simplify196.0ms (9.1%)

Memory
-2.3MiB live, 192.9MiB allocated; 17ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
02159
13559
26059
311159
446059
5264359
6711959
0800651
Stop Event
1×iter limit
1×node limit
Counts
7 → 7
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))
Outputs
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (- (+ x x) 1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (+ x x) (*.f64 #s(literal 2 binary64) x))
#s(approx x #s(hole binary64 x))
#s(approx x x)
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))
#s(approx (- (+ x x) 1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))

rewrite125.0ms (5.8%)

Memory
-22.1MiB live, 83.7MiB allocated; 9ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0410
0610
13410
03269
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
4 → 64
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
x
#s(literal 1 binary64)
Outputs
(*.f64 (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
(*.f64 (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
(/.f64 (-.f64 (*.f64 x x) (*.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))) (-.f64 x (-.f64 x #s(literal 1 binary64))))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (-.f64 x #s(literal 1 binary64)) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (*.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (*.f64 x (-.f64 x #s(literal 1 binary64))))))
(/.f64 (neg.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(/.f64 (neg.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))))
(/.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))
(/.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(fma.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x #s(literal -1 binary64))
(fma.f64 (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (*.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 (*.f64 #s(literal 2 binary64) x)) (fabs.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal -1 binary64))
(fma.f64 #s(literal 4 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x (*.f64 #s(literal 2 binary64) x)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(expm1.f64 (*.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(-.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(-.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))))
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(+.f64 (-.f64 x #s(literal 1 binary64)) x)
(+.f64 (*.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(+.f64 x (-.f64 x #s(literal 1 binary64)))
(*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(*.f64 (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(*.f64 (neg.f64 (*.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 (fabs.f64 (*.f64 #s(literal 2 binary64) x)) (fabs.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(*.f64 #s(literal 2 binary64) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (*.f64 #s(literal 2 binary64) x) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(exp.f64 (*.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(+.f64 (*.f64 x (*.f64 #s(literal 2 binary64) x)) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(+.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) x) (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)
x
#s(literal 1 binary64)

eval7.0ms (0.3%)

Memory
15.5MiB live, 15.5MiB allocated; 0ms collecting garbage
Compiler

Compiled 705 to 164 computations (76.7% saved)

prune3.0ms (0.1%)

Memory
6.5MiB live, 6.5MiB allocated; 0ms collecting garbage
Pruning

3 alts after pruning (2 fresh and 1 done)

PrunedKeptTotal
New69271
Fresh000
Picked011
Done000
Total69372
Accuracy
100.0%
Counts
72 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶53.1%
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
▶48.1%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 21 to 17 computations (19% saved)

series24.0ms (1.1%)

Memory
-39.9MiB live, 5.0MiB allocated; 4ms collecting garbage
Counts
6 → 7
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x
Outputs
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (* 2 x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))
Calls

3 calls:

TimeVariablePointExpression
22.0ms
x
@inf
((- (+ x x) 1) -1 (- (+ x x) 1) (* 2 x) 2 x)
1.0ms
x
@-inf
((- (+ x x) 1) -1 (- (+ x x) 1) (* 2 x) 2 x)
0.0ms
x
@0
((- (+ x x) 1) -1 (- (+ x x) 1) (* 2 x) 2 x)

simplify178.0ms (8.3%)

Memory
16.8MiB live, 195.8MiB allocated; 38ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
02159
13459
25959
311059
445959
5264259
6711859
0800551
Stop Event
1×iter limit
1×node limit
Counts
7 → 7
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (* 2 x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))
Outputs
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (- (+ x x) 1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
#s(approx (* 2 x) #s(hole binary64 (* 2 x)))
#s(approx (* 2 x) (*.f64 #s(literal 2 binary64) x))
#s(approx x #s(hole binary64 x))
#s(approx x x)
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))
#s(approx (- (+ x x) 1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))

rewrite19.0ms (0.9%)

Memory
32.9MiB live, 32.9MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0922
01022
03922
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
6 → 10
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x
Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(/.f64 (-.f64 (*.f64 x x) (*.f64 x x)) (-.f64 x x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x (-.f64 (*.f64 x x) (*.f64 x x))))
(+.f64 x x)
#s(literal 2 binary64)
x

eval1.0ms (0.1%)

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

Compiled 143 to 33 computations (76.9% saved)

prune1.0ms (0.1%)

Memory
2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Pruning

3 alts after pruning (1 fresh and 2 done)

PrunedKeptTotal
New12113
Fresh000
Picked112
Done011
Total13316
Accuracy
100.0%
Counts
16 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶53.1%
#s(approx (- (+ x x) 1) (+.f64 x x))
✓48.1%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 21 to 16 computations (23.8% saved)

series1.0ms (0.1%)

Memory
1.9MiB live, 1.9MiB allocated; 0ms collecting garbage
Counts
3 → 7
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
x
Outputs
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))
Calls

3 calls:

TimeVariablePointExpression
0.0ms
x
@-inf
((- (+ x x) 1) (+ x x) x)
0.0ms
x
@inf
((- (+ x x) 1) (+ x x) x)
0.0ms
x
@0
((- (+ x x) 1) (+ x x) x)

simplify281.0ms (13.1%)

Memory
-45.1MiB live, 196.8MiB allocated; 51ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
02159
13559
26059
311159
446059
5264359
6711959
0800651
Stop Event
1×iter limit
1×node limit
Counts
7 → 7
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))
Outputs
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (- (+ x x) 1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (+ x x) (*.f64 #s(literal 2 binary64) x))
#s(approx x #s(hole binary64 x))
#s(approx x x)
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))
#s(approx (- (+ x x) 1) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))

rewrite60.0ms (2.8%)

Memory
27.6MiB live, 82.2MiB allocated; 11ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0613
0713
13513
032712
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
3 → 36
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
x
Outputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(*.f64 (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(*.f64 (neg.f64 (*.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 (fabs.f64 (*.f64 #s(literal 2 binary64) x)) (fabs.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(*.f64 #s(literal 2 binary64) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) x))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (*.f64 #s(literal 2 binary64) x) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(exp.f64 (*.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(+.f64 (*.f64 x (*.f64 #s(literal 2 binary64) x)) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(+.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) x) (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)
x

eval7.0ms (0.3%)

Memory
-33.2MiB live, 11.6MiB allocated; 5ms collecting garbage
Compiler

Compiled 589 to 119 computations (79.8% saved)

prune3.0ms (0.2%)

Memory
11.1MiB live, 11.1MiB allocated; 0ms collecting garbage
Pruning

3 alts after pruning (0 fresh and 3 done)

PrunedKeptTotal
New42042
Fresh000
Picked011
Done022
Total42345
Accuracy
100.0%
Counts
45 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓53.1%
#s(approx (- (+ x x) 1) (+.f64 x x))
✓48.1%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 51 to 29 computations (43.1% saved)

regimes5.0ms (0.3%)

Memory
21.3MiB live, 21.3MiB allocated; 0ms collecting garbage
Counts
4 → 1
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Calls

3 calls:

2.0ms
x
2.0ms
(+.f64 x x)
2.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
100.0%1(+.f64 x x)
100.0%1(-.f64 (+.f64 x x) #s(literal 1 binary64))
100.0%1x
Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes7.0ms (0.3%)

Memory
-27.2MiB live, 19.0MiB allocated; 4ms collecting garbage
Counts
3 → 3
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
Outputs
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
Calls

3 calls:

4.0ms
(+.f64 x x)
1.0ms
x
1.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
97.8%3(+.f64 x x)
97.8%3(-.f64 (+.f64 x x) #s(literal 1 binary64))
97.8%3x
Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.2%)

Memory
14.0MiB live, 14.0MiB allocated; 0ms collecting garbage
Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts
1 → 1
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Calls

3 calls:

1.0ms
x
1.0ms
(+.f64 x x)
1.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
48.1%1(+.f64 x x)
48.1%1(-.f64 (+.f64 x x) #s(literal 1 binary64))
48.1%1x
Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch34.0ms (1.6%)

Memory
21.6MiB live, 117.6MiB allocated; 17ms collecting garbage
Algorithm
2×binary-search
Stop Event
1×narrow-enough
1×narrow-enough
Steps
TimeLeftRight
19.0ms
2.218596813098147e-14
2.4757361783022342
13.0ms
-5435.1385423780885
-3.288414224135621e-8
Samples
12.0ms320×0valid
Compiler

Compiled 328 to 288 computations (12.2% saved)

Precisions
Click to see histograms. Total time spent on operations: 4.0ms
ival-add: 2.0ms (55.4% of total)
ival-sub: 1.0ms (27.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)

simplify75.0ms (3.5%)

Memory
-27.9MiB live, 61.1MiB allocated; 15ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01537
12637
23537
36337
415437
5114937
Stop Event
1×node limit
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(if (<=.f64 x #s(literal -1/2 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 x #s(literal 1/2 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(if (<=.f64 x #s(literal -1/2 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 x #s(literal 1/2 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))
(if (or (<=.f64 x #s(literal -1/2 binary64)) (not (<=.f64 x #s(literal 1/2 binary64)))) #s(approx (- (+ x x) 1) (+.f64 x x)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

derivations86.0ms (4%)

Memory
8.4MiB live, 103.0MiB allocated; 25ms collecting garbage
Stop Event
1×done
Compiler

Compiled 37 to 17 computations (54.1% saved)

preprocess18.0ms (0.8%)

Memory
5.2MiB live, 50.9MiB allocated; 6ms collecting garbage
Compiler

Compiled 84 to 42 computations (50% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...