This is CRM114, version 20100106-BlameMichelson (TRE 0.7.5 (LGPL))
 Copyright 2001-2009 William S. Yerazunis
 This software is licensed under the GPL with ABSOLUTELY NO WARRANTY

 CRM114 testing brackets, escapes and #'s 

 If you don't see any compiler error messages, that means the test passed. 

 
  CRM114 testing backslash 
 
/-;-{-abcd-}-;-/    =/==\= 
 This text started out on three lines but it should appear on just one.
 testing part-line comments
 
 CRM114  testing FAULT/TRAP... 
  --- you should not see an error yet --- 
 you should see this --><--and this, with nothing in between. 
 
 --- the next thing you see SHOULD be an error "unable to read-open"--- 
 Caught the error  - fault text was 
./crm114: *ERROR* 
 For some reason, I was unable to read-open the file named  zoob.zipulrlfjf
 Sorry, but this program is very sick and probably should be killed off.
This happened at line 25 of file fataltraptest.crm
(runtime system location: crm_expr_file_io.c(135) in routine: crm_expr_input)
  --- and again, the next thing you see SHOULD be an error "unable to write-open"--- 
 Caught the error  - fault text was 
./crm114: *ERROR* 
 For some reason, I was unable to write-open the file named /No/Such/Directory/frotz.mumble
 Sorry, but this program is very sick and probably should be killed off.
This happened at line 35 of file fataltraptest.crm
(runtime system location: crm_expr_file_io.c(329) in routine: crm_expr_output)
 

Start of insert processor testing 
 start here ... the first middle bit...  the really middle-middle bit ... the last middle bit...  and the last bit of normal text 
now we test nonexistent file overrides 
this should not cause a FATAL ERROR, because we trap it.
We caught the nonexistent file fault here.  Message was:
 <<start of msg>>
Couldn't insert the file named 'there_is_no_such_file_as_this.txt' that you asked for.  This is probably a bad thing.
 <<end of msg>> 
via the TRAP
End of insert testing. 


  CRM114 testing match functionality 

Testing exact match on foo... found exact match on 'foo'
Testing exact match on foo...
Testing absent match on foo... match says "no foo found".
Testing absent match on foo...
Testing nocase match on foo... found a nocase match on 'fOo' 
Testing nocase match on foo...
Testing nocase absent match on foo... match says "no foo found".
Testing nocase absent match on foo...
Testing multiline match on foo... found an allowed multiline match on '
multiline:  this is a multiline test of foo
multiline-- should see both lines ZZZ'
Testing multiline match on foo...
Testing nomultiline match on foo... found a nomultiline match on 'nomultiline:  this is a nomultiline test of foo'
Testing nomultiline match on foo...
Testing fromendchar match for foo then bar...... found the foo...then bar 
Testing fromendchar match for foo then bar...... found the foo...
Testing fromnext match for f+oo+.. first 'foo'.. found one on 'ffoooo'
Testing fromnext match for f+oo+.. first 'foo'..
Testing newend match for f+oo+.. first 'foo'.. found one on 'ffooo'
Testing newend match for f+oo+.. first 'foo'..
Testing indirect goto ":twist:" and ":shout:".... got :twist:... got to TWIST.
Testing indirect goto ":twist:" and ":shout:".... got :shout2:... got to SHOUT. 
Testing self-supplied-match ... found '123' ... found 'smith 123 anderson ZZZ' 
Testing self-supplied-match ... found '123' ...
Testing indep start/end ... found 'foo bar 1 2 foo' ... found '1' ... found 'bar 1 2 foo bar'... found '2'
Testing indep start/end ... found 'foo bar foo' ...
Testing indep start/end ... found 'foo 1 foo' ... found '1' ... found 'bar 2 bar'... found '2'
Testing indep start/end ... found 'foo 2 bar 1 bar foo' ... found '1' ... found 'bar 1 bar'...
Testing box region control
got 10-17 as this: correct  (should be 'correct', no angles)

Testing box region control, part 2
got 10-17 as this: rrec  (should be 'rrec')

Testing box region control, isolated variable
got 10-17 as this: rrec  (should be 'rrec')
Fromend match: esult (should be 'esult')

Testing box region indexed control
got this: 'correct' (should be 'correct', no angles)

Testing box region regex control
got this: '>correct<' (should be '>correct<', with angles)

Testing box region failing regex control
got this: '' (should be '', the empty string)

Testing box region regex/index control
got this: 'correct' (should be 'correct', no angles)

Testing box region index/regex control
got this: '>correct<' (should be '>correct<', with angles)

Testing box region index/index control
got this: 'correct' (should be 'correct', no angles)

Testing box region regex with spaces control
got this: '> correct <' (should be '> correct <', with angles)

Testing box region regex with spaces control
got this: 'correct' (should be 'correct', no angles)
testing <absent> versus binding  (the '67' bug)
  The next stmt --- SHOULD--- get an error message! 
 Caught the error, fault text was: 

./crm114: *WARNING* 
 This program specifies an 'absent' match, and also tries to bind variables that, by the above, aren't matched!   We'll ignore these variable bindings for now.
I'll try to keep working.
This happened at line 298 of file matchtest.crm
(runtime system location: crm_expr_match.c(413) in routine: crm_expr_match)


------------------END OF TESTING----------------------
 searching for a foo...found a foo, searching for bar.ooo... no bar.ooo in front of the foo. 
 searching for a foo...found a foo, searching for bar.ooo... no bar.ooo in front of the foo. 

   CRM114 testing ALTERation and copying 

----- Whole file -----
01abcdefghijkl89----------------------
 1: abcde, 2: cdefg, 3: fghij z: cdefg 
 ---altering the z copy ----- 

 1: abcde, 2: cdefg, 3: fghij z: CDEEEFG 
----- Whole file -----
01abcdefghijkl89 ---altering the original ----- 

 1: abCDEEE, 2: CDEEEFG, 3: FGhij z: CDEEEFG 
----- Whole file -----
01abCDEEEFGhijkl89 ---altering the original again----- 

 1: abCD, 2: CDFG, 3: FGhij z: CDEEEFG 
----- Whole file -----
01abCDFGhijkl89----------------------
----- Rematched Whole file -----
01abCDFGhijkl89
----------------------
------putting things back-----
----- Whole file -----
01abcdefghijkl89
----------------------

----------------------
 :q: = cdefg 
  ISOLATEing :q: - this should copy 
 :q: = cdefg 
  ALTERing :q: to ZZZZZ
 :q: = ZZZZZ 
----- Whole file -----
01abcdefghijkl89
----------------------

 Checking initialization of isolation 
     AAAAA 

 --- CRM114 testing string rewrites 
 
------------------------
abc
frobnitz_singleline this should trigger 
def
frobnitz_multiline zebra
giraffe
and so should this.
testpattern
mno
------------------------
abc
single-line rewrite ran OK.
def
multi-line rewrite ran OK.
mno

 CRM114 testing that start / length works in matches 
 
DEBUG: whitelist==<<CRM114
crm114
harvard.edu
tufts.edu
dartmouth.edu
mit.edu
rpi.edu
>>
DEBUG: matched==<<CRM114>>
DEBUG: matched==<<crm114>>
DEBUG: matched==<<harvard.edu>>
DEBUG: matched==<<tufts.edu>>
DEBUG: matched==<<dartmouth.edu>>
DEBUG: matched==<<mit.edu>>
DEBUG: matched==<<rpi.edu>>
DEBUG: [TheEnd]

 CRM114 testing outcall and status codes 

 ----- keeping a process around ----  

 preparing... 
 OK_IF_PID_CHANGES: one... MINION PROC PID: 20682 from-pipe: 6 to-pipe: 5
 OK_IF_PID_SAME_AS_ABOVE: again... MINION PROC PID: 20682 from-pipe: 6 to-pipe: 5
 and done ...DEAD MINION, EXIT CODE: 0 
exit value test got DEAD MINION, EXIT CODE: 123
 CRM114: Testing union and intersection 
 
We start with this: ' a b c d e f g h i j k l m n o p q r s t u v w x y z ' 
intersection of abc and cde is t1: 'c' 
union of l thru s is t2: 'l m n o p q r s' 
intersection of abc and t2 is t3: '' 
union of zulu and t1 is t4: 'c d e f g h i j k l m n o p q r s t u v w x y z' 

 CRM114: test syscall 'printf beep' 
 

CRM114: testing default command line args 
blah 1 = :blah:
blah 2 = new value
 

CRM114: testing default command line args 
blah 1 = command override
blah 2 = command override

 CRM114: testing windowing on windows and variables 
 

 test one- input by chars, delimited by 'A' 
 Got: 
 This is the test one result A
 test two- input by EOFs, delimited by 'A' 
 Got: 
  this is the test two result A
 test three- window an isolated var by chars, delimited by 'A' 
 Got: 
  this is the test three result A
 test four- isolated var, input by EOFs, delimited by 'A' 
 Got: 
  this is the test four result A
 and lastly- did the data window stay constant? 
 this is the test two result A

 CRM114: testing windowing on windows from a variable 
 
 Input stuff is : This is the test one result A this is the test two result A this is the test three result A this is the test four result A this is the test 5 result A this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter.
 
 

 testing delimited by 'A'
  Data Window: data window test text  
 Windowed value = This is the test one result A 
 Remaining stuff =  this is the test two result A this is the test three result A this is the test four result A this is the test 5 result A this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter.
 
 
 Data Window: data window test text  
 Windowed value =  this is the test two result A 
 Remaining stuff =  this is the test three result A this is the test four result A this is the test 5 result A this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter.
 
 
 Data Window: data window test text  
 Windowed value =  this is the test three result A 
 Remaining stuff =  this is the test four result A this is the test 5 result A this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter.
 
 
 Data Window: data window test text  
 Windowed value =  this is the test four result A 
 Remaining stuff =  this is the test 5 result A this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter.
 
 
 Data Window: data window test text  
 Windowed value =  this is the test 5 result A 
 Remaining stuff =  this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter.
 
 
 Data Window: data window test text  
 Windowed value =  this is the test six result A 
 Remaining stuff =  this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter.
 
 
  Bounced out of the WINDOW loop -- no further stuff
 End of window-from-variable testing 
 Start of approximate match testing. 

Input string to match against: "molasses anaconda foo bar baz agentsmith mranderson "

(foo) {1} ---> foo 
(fou){~} ---> foo
(foo) {1} ---> foo 
(fou){~0} <no match> 
(foo) {1} ---> foo 
(fou){~1} ---> foo
(foo) {1} ---> foo 
(fou){~2} ---> foo
(fou){~3} ---> foo
(fuu){~} ---> foo
(fuu){~0} <no match> 
(fuu){~1} <no match> 
(fuu){~2} ---> foo
(fuu){~3} ---> foo
(fou){#} ---> foo
(fou){#0} <no match> 
(fou){#1} ---> foo
(fou){#2} ---> foo
(fou){#3} ---> foo
(fou){# ~1} ---> foo
(fou){#0 ~1} <no match> 
(fou){#1 ~1} ---> foo
(fou){#2 ~1} ---> foo
(fou){#3 ~1} ---> foo
(fuu){#} ---> foo
(fuu){#0} <no match> 
(fuu){#1} <no match> 
(fuu){#2} ---> foo
(fuu){#3} ---> foo
(fuu){# ~1} <no match> 
(fuu){#0 ~1} <no match> 
(fuu){#1 ~1} <no match> 
(fuu){#2 ~1} <no match> 
(fuu){#3 ~1} <no match> 
(fuu){# ~2} ---> foo
(fuu){#0 ~2} <no match> 
(fuu){#1 ~2} <no match> 
(fuu){#2 ~2} ---> foo
(fuu){#3 ~2} ---> foo
(fuu){# ~3} ---> foo
(fuu){#0 ~3} <no match> 
(fuu){#1 ~3} <no match> 
(fuu){#2 ~3} ---> foo
(fuu){#3 ~3} ---> foo
(fuu){# ~} ---> foo
(fuu){#0 ~} <no match> 
(fuu){#1 ~} <no match> 
(fuu){#2 ~} ---> foo
(fuu){#3 ~} ---> foo
(fou){#} ---> foo
(fou){#0} <no match> 
(fou){+1 -1} ---> fo
(fou){+2 -2} ---> fo
(fou){+3 -3} ---> fo
(fou){# ~1} ---> foo
(fou){#0 ~1} <no match> 
(fou){+1 -1 ~1} ---> fo
(fou){+2 -2 ~1} ---> fo
(fou){+3 -3 ~1} ---> fo
(fou){# ~2} ---> foo
(fou){#0 ~2} <no match> 
(fou){+1 -1 ~2} ---> fo
(fou){+2 -2 ~2} ---> fo
(fou){+3 -3 ~2} ---> fo
(fou){# ~3} ---> foo
(fou){#0 ~3} <no match> 
(fou){+1 -1 ~3} ---> fo
(fou){+2 -2 ~3} ---> fo
(fou){+3 -3 ~3} ---> fo
(fou){# ~} ---> foo
(fou){#0 ~} <no match> 
(fou){+1 -1 ~} ---> fo
(fou){+2 -2 ~} ---> fo
(fou){+3 -3 ~} ---> fo
(fuu){#} ---> foo
(fuu){#0} <no match> 
(fuu){+1 -1} <no match> 
(fuu){+2 -2} ---> f
(fuu){+3 -3} ---> f
(fuu){# ~1} <no match> 
(fuu){#0 ~1} <no match> 
(fuu){+1 -1 ~1} <no match> 
(fuu){+2 -2 ~1} <no match> 
(fuu){+3 -3 ~1} <no match> 
(fuu){# ~2} ---> foo
(fuu){#0 ~2} <no match> 
(fuu){+1 -1 ~2} <no match> 
(fuu){+2 -2 ~2} ---> f
(fuu){+3 -3 ~2} ---> f
(fuu){# ~3} ---> foo
(fuu){#0 ~3} <no match> 
(fuu){+1 -1 ~3} <no match> 
(fuu){+2 -2 ~3} ---> f
(fuu){+3 -3 ~3} ---> f
(fuu){# ~} ---> foo
(fuu){#0 ~} <no match> 
(fuu){+1 -1 ~} <no match> 
(fuu){+2 -2 ~} ---> f
(fuu){+3 -3 ~} ---> f
(anaconda){~} ---> anaconda
(anaonda){ 1i + 1d < 1 } <no match> 
(anaonda){ 1i + 1d < 2 } ---> anaconda
(ananda){ 1i + 1d < 1 } <no match> 
(ananda){ 1i + 1d < 2 } <no match> 
(ananda){ 1i + 1d < 3 } ---> anaconda
(ana123conda){ 1i + 1d < 2 } <no match> 
(ana123conda){ 1i + 1d < 3 } <no match> 
(ana123conda){ 1i + 1d < 4 } ---> anaconda
(ana123cona){ 1i + 1d < 4 } <no match> 
(ana123cona){ 1i + 1d < 5 } ---> anaconda
(ana123coa){ 1i + 1d < 4 } <no match> 
(ana123coa){ 1i + 1d < 5 } ---> anaco
(ana123coa){ 1i + 1d < 6 } ---> anaco
(ana123ca){ 1i + 1d < 4 } <no match> 
(ana123a){ 1i + 1d < 4 } <no match> 
(ana123a){ 1i + 1d < 3 } <no match> 
(anukeonda){~} ---> anaconda
(anaconda){ 1i + 1d < 1} ---> anaconda
(anaconda){ 1i + 1d < 1, #1} ---> anaconda
(anaconda){ 1i + 1d < 1 #1 ~10 } ---> anaconda
(anaconda){ #1, ~1, 1i + 1d < 1 } ---> anaconda
(anaconda){ #1 ~1 1i + 1d < 1 } ---> anaconda
(anacnda){ #1 ~1 1i + 1d < 1 } <no match> 
(agentsmith){~} ---> agentsmith
(annndersen){~} ---> anderson
(anentemstn){~} ---> agentsmith
(anacda){~} ---> anaconda
(anacda){ #1 ~1 1i + 1d < 1 } <no match> 
(znacnda){ #1 ~1 1i + 1d < 1 } <no match> 
(znacnda){ #1 ~2 1i + 1d < 1 } <no match> 
(znacnda){ #1 ~3 1i + 1d < 1 } <no match> 
(znacnda){ #1 ~3 1i + 1d < 2 } ---> anaconda
(anac){~1}(onda){~1} ---> anaconda
(aac){~1}(onda){~1} ---> naconda
(ac){~1}(onda){~1} ---> aconda
(anac){~1}(oda){~1} ---> anaconda
(aac){~1}(oa){~1} ---> nacon
(ac){~1}(oa){~1} ---> acon
(anac){~1}(onda){~1} ---> anaconda
(anZac){~1}(onZda){~1} ---> anaconda
(anZZac){~1}(onZda){~1} <no match> 
(anZac){~1}(onZZda){~1} <no match> 
([a-n]){3,100} ---> anac
([a-n]){3,100}? ---> ana
 end of approximate match testing. 
 
  Algebraic math test 
 string value of x is 12345, string value of pi is 3.14159
 length of x is 5 , length of pi is 7
 string rep of X is shorter than pi
 matheval of x + pi is 12348.14159
 Algebraic matheval of (2*3)+(4*5) is 26 
  and adding 3.14159 to that is 29.14159

     Testing RPN mode math 
 string value of x is 12345, string value of pi is 3.14159
 length of x is 5 , length of pi is 7
 string rep of X is shorter than pi
 matheval of x + pi is 12348.14159
 RPN matheval of (2*3)+(4*5) is 26 
  and adding 3.14159 to that is 29.14159
 

  This test checks to see that EVAL properly detects blowups
  You should see an error message as the next thing,
   with a large string of Z's. 
We should get an error here, due to the (intentional!) loop

./crm114: *WARNING* 
 The variable you're attempting to EVAL seems to eval infinitely, and hence I cannot compute it.  I did try a lot, though.  I got this far before I gave up:  :*:a:ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ(...truncated)
I'll try to keep working.
This happened at line 20 of file eval_infiniteloop.crm
(runtime system location: crm_expr_alter.c(125) function crm_expr_eval)
Original:    The quick brown fox jumped over the lazy dog's back
delete file then append:     alpha bravo charlie 
prior file, no append:    The quick brown fox jumped over the lazy dog's back
prior file, and append:    The quick brown fox jumped over the lazy dog's back alpha bravo charlie 
Grab chars 10 thru 25: brown fox jumpe
Grab chars 17 and length 12:  ox jumped ov
Now, change the fox to cat: uick brown cat jumped over the
Final check- did it really get written? The quick brown cat jumped over the lazy dog's back alpha bravo charlie 
isolate :a: as 'hdgdgb aaa hdgdb', match b as /aaa/
a=hdgdgb aaa hdgdb - b=aaa
alter :a: as 'x'
a=x - b=

re-isolate :a: as 'hdgdgb bbb hdgdb'
a=hdgdgb bbb hdgdb - b=

now match :b: to :a:'s 'bbb' section
a=hdgdgb bbb hdgdb - b=bbb

now alter :a: to 'x' again
a=x - b=

re-re-isolate :a: as 'hdgdgb ccc hdgdb'
a=hdgdgb ccc hdgdb - b=

now match :b: to :a:'s 'ccc' section
a=hdgdgb ccc hdgdb - b=ccc

now alter :a: to 'x' again
a=x - b=
Content-Type: text/html; charset=us-ascii
Content-Transfer-Encoding: 7bit

Content-Type: image/gif;
 name="clonic.GIF"
Content-Transfer-Encoding: base64
Content-ID: <part1.07010905.07040200@mpbnmpsjffb@hotmail.com>
Content-Disposition: inline;
 filename="clonic.GIF"

:boundary:=------------000708090009050006030006
:c:=1
Content-Type: text/html; charset=us-ascii
Content-Transfer-Encoding: 7bit

:c:=2
Content-Type: image/gif;
 name="clonic.GIF"
Content-Transfer-Encoding: base64
Content-ID: <iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii>
Content-Disposition: inline;
 filename="clonic.GIF"

:boundary:=--0123456789
:c:=1
Content-Type: text
Content-Transfer-Encoding: 7bit

:c:=2
Content-Type: image
 name="clonic.GIF"
Content-Transfer-Encoding: base64
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii

:boundary:=--0123
:c:=1
C-T: txt
C-T-E: 7

:c:=2
C-T: img
 name="clonic.GIF"
C-T-E: b64
iiii


Match-Isolate reclamation test 1. If this program doesn't 
error out, the test is passed. (we allocate about 80 megs, 
well past the window size, but in small (400K) chunks that
alternately are allocated and become reclaimable) 
OK_IF_SIZE_CHANGES: Size of isolation at start: 933509
Bytes used per pass: 931467
Passes done: 100 
Total flux through isolation:  186293400
OK_IF_SIZE_CHANGES: Final isolation size: 933525 
OK_IF_LESS_THAN_100: Total growth: 16

Match-Isolate reclamation test.  If this program doesn't 
error out, the test is passed. (we allocate about 80 megs, 
well past the window size, but in small (400K) chunks that
alternately are allocated and become reclaimable) 
OK_IF_SIZE_CHANGES: Size of isolation at start: 935934
Bytes used per pass: 931467
Passes done: 10 
Total flux through isolation:  18629340
OK_IF_SIZE_CHANGES: Final isolation size: 935948 
OK_IF_LESS_THAN_10: Total growth: 14
Bytes used per pass: 931467
Passes done: 20 
Total flux through isolation:  37258680
OK_IF_SIZE_CHANGES: Final isolation size: 935953 
OK_IF_LESS_THAN_20: Total growth: 19
Bytes used per pass: 931467
Passes done: 30 
Total flux through isolation:  55888020
OK_IF_SIZE_CHANGES: Final isolation size: 935953 
OK_IF_LESS_THAN_30: Total growth: 19
Bytes used per pass: 931467
Passes done: 40 
Total flux through isolation:  74517360
OK_IF_SIZE_CHANGES: Final isolation size: 935953 
OK_IF_LESS_THAN_40: Total growth: 19
Starting 


Testing local and forking call and returns. (level 0) 
The foo (level 1)
Middle (level 0)
The bar was > a b c d e < (level 1)
Got back >z y x w v<
End (level 0)
 Doing factorial with a mutating argument 
 arglist return factorial call entry, args =  5 1  (level 1)
 arglist return factorial call entry, args =  4 5  (level 2)
 arglist return factorial call entry, args =  3 20  (level 3)
 arglist return factorial call entry, args =  2 60  (level 4)
 arglist return factorial call entry, args =  1 120  (level 5)
 Recursion bottomed out, returning :out: = 120 
 Call return, :out: = 120 ( level 4) 
 Call return, :out: = 120 ( level 3) 
 Call return, :out: = 120 ( level 2) 
 Call return, :out: = 120 ( level 1) 
 5 factorial is 120 (level 0)

 Doing factorial with inplace args. 
 downward recurse call entry, args =  5 1  (level 1)
 downward recurse call entry, args =  4 5  (level 2)
 downward recurse call entry, args =  3 20  (level 3)
 downward recurse call entry, args =  2 60  (level 4)
 downward recurse call entry, args =  1 120  (level 5)
 Recursion bottomed out, returning :out: = 120 
 Call return, :out: = 120 (level 4)
 Call return, :out: = 120 (level 3)
 Call return, :out: = 120 (level 2)
 Call return, :out: = 120 (level 1)
 5 factorial_inplace is 120 (level 0) 

 Doing factorial with return args 
 Call factorial_returnarg entry, arg =  5  (level 1)
 N is 5 NM1 is 4 
 Call factorial_returnarg entry, arg =  4  5  (level 2)
 N is 4 NM1 is 3 
 Call factorial_returnarg entry, arg =  3  4  5  (level 3)
 N is 3 NM1 is 2 
 Call factorial_returnarg entry, arg =  2  3  4  5  (level 4)
 N is 2 NM1 is 1 
 Call factorial_returnarg entry, arg =  1  2  3  4  5  (level 5)
  Calling bottomed out with N-1 <= 0.00 (level 5)
 Call returned, return value was  1  2  3  4  5  (level 4)
  p1: 1, p2: 2, rest:  3  4  5  
  multiply p1 and p2, put that on the front, and return :out: = 2  3  4  5  (level 4)
 Call returned, return value was 2  3  4  5  (level 3)
  p1: 2, p2: 3, rest:  4  5  
  multiply p1 and p2, put that on the front, and return :out: = 6  4  5  (level 3)
 Call returned, return value was 6  4  5  (level 2)
  p1: 6, p2: 4, rest:  5  
  multiply p1 and p2, put that on the front, and return :out: = 24  5  (level 2)
 Call returned, return value was 24  5  (level 1)
  p1: 24, p2: 5, rest:  
  multiply p1 and p2, put that on the front, and return :out: = 120  (level 1)
 5 factorial_returnarg is 120  (level 0)

 
and now do some fully isolated forking calls 
Returned output = In the fork... data window is This is the original data window.  It shouldn't change (level 0)
Inputted; now the data window is:  this string is your input 
Changing the data window in this fork. 
Now the data window is: This is a _changed_ data window, local to this SYSCALLed fork.
 (level 0)
Returned status:  
DEAD MINION, EXIT CODE: 123
And the data window is now: This is the original data window.  It shouldn't change

TRANSLATE basic functionality test

original: foo bar zappa 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX a-e
rot13:    sbb one mnccn 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX n-r
again:    foo bar zappa 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX a-e
invrange: ull yzi azkkz 9876543210.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX z-v
unique:   fo bar zapa 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX a-e
invrange: ull yzi azkkz 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX z-v
literal:  foo bzr azppz 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX z-e
lit+uniq: foo bzr azppz 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX z-e
deletion:    02468.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX -
del-inv:  foobarzappa13579ae
del-inv2: xyywxwxwxwzzww0y2z4w6x8yywxwwxyzwxyyywxzxzzwXYZZYwQUICKwBROWNwFOXwwxw
srcvar:   FOO BAR ZAPPA 0123456789.,?`~!@#$%^&*()_-+= xyzzy quick brown fox A-E
src-dest: ULL YZI AZKKZ 0123456789.,?`~!@#$%^&*()_-+= cbaab jfrxp yildm ulc Z-V
version: 20100106-BlameMichelson ( TRE 0.7.5 (LGPL) )

noSpaces before: Are The Russian Involved ?
noSpaces after : AreTheRussianInvolved?

withSpaces before: Nuclear Combat Toe To Toe With The Rooskies !
withSpaces after : NuclearCombatToeToToeWithTheRooskies!


#! /usr/bin/crm
#
#	quine.crm - produce program's own source code as output

# Copyright 2009 William S. Yerazunis.
# This file is under GPLv3, as described in COPYING.

{
 window
 output /:*:_pgm_text:/
}


one two three
 
***** checking return and exit codes 
 Status: DEAD MINION, EXIT CODE: 123 

***** check that failed syscalls will code right
 Status: DEAD MINION, EXIT CODE: 127 
result -->you hit the jackpot<--->and that's good<--->:frobotz:<--- 

 ****  Default (SBPH Markovian) classifier 
 type A 
CLASSIFY fails; success probability: 0.0000  pR: -11.4360
Best match to file #1 (a_test.css) prob: 1.0000  pR: 11.4360  
Total features in input file: 192
#0 (m_test.css): features: 63522, hits: 129, prob: 3.66e-12, pR: -11.44 
#1 (a_test.css): features: 68546, hits: 4319, prob: 1.00e+00, pR:  11.44 

 type M 
CLASSIFY succeeds; success probability: 0.9875  pR: 1.8989
Best match to file #0 (m_test.css) prob: 0.9875  pR: 1.8989  
Total features in input file: 130
#0 (m_test.css): features: 63522, hits: 749, prob: 9.88e-01, pR:   1.90 
#1 (a_test.css): features: 68546, hits: 248, prob: 1.25e-02, pR:  -1.90 


**** OSB Markovian classifier 
 type A 
CLASSIFY fails; success probability: 0.0007  pR: -3.1804
Best match to file #1 (a_test.css) prob: 0.9993  pR: 3.1804  
Total features in input file: 48
#0 (m_test.css): features: 15881, hits: 7, prob: 6.60e-04, pR:  -3.18 
#1 (a_test.css): features: 17137, hits: 488, prob: 9.99e-01, pR:   3.18 

 type M 
CLASSIFY succeeds; success probability: 0.8832  pR: 0.8787
Best match to file #0 (m_test.css) prob: 0.8832  pR: 0.8787  
Total features in input file: 40
#0 (m_test.css): features: 15881, hits: 340, prob: 8.83e-01, pR:   0.88 
#1 (a_test.css): features: 17137, hits: 8, prob: 1.17e-01, pR:  -0.88 


**** OSB Markov Unique classifier 
 type A 
CLASSIFY fails; success probability: 0.0007  pR: -3.1365
Best match to file #1 (a_test.css) prob: 0.9993  pR: 3.1365  
Total features in input file: 48
#0 (m_test.css): features: 15047, hits: 7, prob: 7.30e-04, pR:  -3.14 
#1 (a_test.css): features: 14993, hits: 426, prob: 9.99e-01, pR:   3.14 

 type M 
CLASSIFY succeeds; success probability: 0.8612  pR: 0.7928
Best match to file #0 (m_test.css) prob: 0.8612  pR: 0.7928  
Total features in input file: 40
#0 (m_test.css): features: 15047, hits: 112, prob: 8.61e-01, pR:   0.79 
#1 (a_test.css): features: 14993, hits: 4, prob: 1.39e-01, pR:  -0.79 


**** OSB Markov Chisquared Unique classifier 
 type A 
CLASSIFY fails; success probability: 0.0000  pR: -6.0741
Best match to file #1 (a_test.css) prob: 1.0000  pR: 6.0741  
Total features in input file: 48
#0 (m_test.css): features: 15047, hits: 1, chi2: 3.20e+01, pR:  -6.07 
#1 (a_test.css): features: 14993, hits: 33, chi2: 2.94e-02, pR:   6.07 

 type M 
CLASSIFY succeeds; success probability: 0.8238  pR: 0.6700
Best match to file #0 (m_test.css) prob: 0.8238  pR: 0.6700  
Total features in input file: 40
#0 (m_test.css): features: 15047, hits: 9, chi2: 1.11e+01, pR:   0.67 
#1 (a_test.css): features: 14993, hits: 1, chi2: 2.40e+01, pR:  -0.67 


**** OSBF Local Confidence (Fidelis) classifier 
 type A 
CLASSIFY fails; success probability: 0.0538  pR: -1.2453
Best match to file #1 (a_test.css) prob: 0.9462  pR: 1.2453  
Total features in input file: 48
#0 (m_test.css): hits: 1, ufeats: 1, prob: 5.38e-02, pR:  -1.25 
#1 (a_test.css): hits: 33, ufeats: 33, prob: 9.46e-01, pR:   1.25 

 type M 
CLASSIFY succeeds; success probability: 0.6823  pR: 0.3319
Best match to file #0 (m_test.css) prob: 0.6823  pR: 0.3319  
Total features in input file: 40
#0 (m_test.css): hits: 9, ufeats: 9, prob: 6.82e-01, pR:   0.33 
#1 (a_test.css): hits: 1, ufeats: 1, prob: 3.18e-01, pR:  -0.33 

 
**** OSB Winnow classifier 
 type A 
CLASSIFY fails; success probability: 0.4347  pR: -1.1415
Best match to file #1 (a_test.css) weight: 55.3809  pR: 2.2485  
Total features in input file: 48
#0 (m_test.css): features: 30529.10, unseen: 1.50e+01, weight: 4.26e+01, pR:   1.11 
#1 (a_test.css): features: 30507.50, unseen: 1.50e+01, weight: 5.54e+01, pR:   2.25 

 type M 
CLASSIFY succeeds; success probability: 0.5199  pR: 0.3454
Best match to file #0 (m_test.css) weight: 41.8609  pR: 6.6757  
Total features in input file: 40
#0 (m_test.css): features: 30529.10, unseen: 3.10e+01, weight: 4.19e+01, pR:   6.68 
#1 (a_test.css): features: 30507.50, unseen: 3.10e+01, weight: 3.87e+01, pR:   6.33 



**** Now verify that winnow learns affect only the named file (m_test.css)
 type M 
CLASSIFY succeeds; success probability: 0.5213  pR: 0.3697
Best match to file #0 (m_test.css) weight: 42.0957  pR: 6.7000  
Total features in input file: 40
#0 (m_test.css): features: 47122.80, unseen: 3.10e+01, weight: 4.21e+01, pR:   6.70 
#1 (a_test.css): features: 30507.50, unseen: 3.10e+01, weight: 3.87e+01, pR:   6.33 



 and now refute-learn into a_test.css
 type M 
CLASSIFY succeeds; success probability: 0.5224  pR: 0.3892
Best match to file #0 (m_test.css) weight: 42.0957  pR: 6.7000  
Total features in input file: 40
#0 (m_test.css): features: 47122.80, unseen: 3.10e+01, weight: 4.21e+01, pR:   6.70 
#1 (a_test.css): features: 42181.02, unseen: 3.10e+01, weight: 3.85e+01, pR:   6.31 


**** Unigram Bayesian classifier 
 type A 
CLASSIFY fails; success probability: 0.1570  pR: -0.7300
Best match to file #1 (a_test.css) prob: 0.8430  pR: 0.7300  
Total features in input file: 12
#0 (m_test.css): features: 3972, hits: 125, prob: 1.57e-01, pR:  -0.73 
#1 (a_test.css): features: 4286, hits: 283, prob: 8.43e-01, pR:   0.73 

 type M 
CLASSIFY succeeds; success probability: 0.7226  pR: 0.4157
Best match to file #0 (m_test.css) prob: 0.7226  pR: 0.4157  
Total features in input file: 10
#0 (m_test.css): features: 3972, hits: 205, prob: 7.23e-01, pR:   0.42 
#1 (a_test.css): features: 4286, hits: 240, prob: 2.77e-01, pR:  -0.42 

 
**** unigram Winnow classifier 
 type A 
CLASSIFY fails; success probability: 0.4432  pR: -0.9918
Best match to file #1 (a_test.css) weight: 13.7145  pR: 0.5800  
Total features in input file: 12
#0 (m_test.css): features: 3056.52, unseen: 0.00e+00, weight: 1.09e+01, pR:  -0.41 
#1 (a_test.css): features: 2901.72, unseen: 0.00e+00, weight: 1.37e+01, pR:   0.58 

 type M 
CLASSIFY succeeds; success probability: 0.5652  pR: 1.1393
Best match to file #0 (m_test.css) weight: 10.4009  pR: 1.7197  
Total features in input file: 9
#0 (m_test.css): features: 3056.52, unseen: 2.00e+00, weight: 1.04e+01, pR:   1.72 
#1 (a_test.css): features: 2901.72, unseen: 2.00e+00, weight: 8.00e+00, pR:   0.58 


**** OSB Hyperspace classifier 
 type A 
CLASSIFY fails; success probability: 0.0010  pR: -30.1365
Best match to file #1 (a_test.css) prob: 0.9990  pR: 30.1365  
Total features in input file: 47
#0 (m_test.css): features: 15048, hits: 1, radiance: 6.63e-05, prob: 9.68e-04, pR: -30.14 
#1 (a_test.css): features: 14994, hits: 32, radiance: 6.84e-02, prob: 9.99e-01, pR:  30.14 

 type M 
CLASSIFY succeeds; success probability: 1.0000  pR: 216.2810
Best match to file #0 (m_test.css) prob: 1.0000  pR: 216.2810  
Total features in input file: 39
#0 (m_test.css): features: 15048, hits: 8, radiance: 4.25e-03, prob: 1.00e+00, pR: 216.28 
#1 (a_test.css): features: 14994, hits: 0, radiance: 0.00e+00, prob: 2.35e-22, pR: -216.28 


**** OSB three-letter Hyperspace classifier 
 type A 
CLASSIFY fails; success probability: 0.1947  pR: -6.1669
Best match to file #1 (a_test.css) prob: 0.8053  pR: 6.1669  
Total features in input file: 11
#0 (m_test.css): features: 4348, hits: 5, radiance: 5.75e-03, prob: 1.95e-01, pR:  -6.17 
#1 (a_test.css): features: 4214, hits: 10, radiance: 2.38e-02, prob: 8.05e-01, pR:   6.17 

 type M 
CLASSIFY succeeds; success probability: 0.6695  pR: 3.0659
Best match to file #0 (m_test.css) prob: 0.6695  pR: 3.0659  
Total features in input file: 14
#0 (m_test.css): features: 4348, hits: 13, radiance: 3.90e-02, prob: 6.70e-01, pR:   3.07 
#1 (a_test.css): features: 4214, hits: 9, radiance: 1.92e-02, prob: 3.30e-01, pR:  -3.07 


**** Unigram Hyperspace classifier 
 type A 
CLASSIFY fails; success probability: 0.1628  pR: -7.1107
Best match to file #1 (a_test.css) prob: 0.8372  pR: 7.1107  
Total features in input file: 11
#0 (m_test.css): features: 1794, hits: 5, radiance: 1.39e-02, prob: 1.63e-01, pR:  -7.11 
#1 (a_test.css): features: 1406, hits: 10, radiance: 7.17e-02, prob: 8.37e-01, pR:   7.11 

 type M 
CLASSIFY succeeds; success probability: 0.9660  pR: 14.5322
Best match to file #0 (m_test.css) prob: 0.9660  pR: 14.5322  
Total features in input file: 9
#0 (m_test.css): features: 1794, hits: 6, radiance: 2.01e-02, prob: 9.66e-01, pR:  14.53 
#1 (a_test.css): features: 1406, hits: 1, radiance: 7.09e-04, prob: 3.40e-02, pR: -14.53 


**** String Hyperspace classifier 
 type A 
CLASSIFY fails; success probability: 0.0955  pR: -9.7666
Best match to file #1 (a_test.css) prob: 0.9045  pR: 9.7666  
Total features in input file: 61
#0 (m_test.css): features: 22670, hits: 17, radiance: 1.27e-02, prob: 9.55e-02, pR:  -9.77 
#1 (a_test.css): features: 22452, hits: 52, radiance: 1.21e-01, prob: 9.05e-01, pR:   9.77 

 type M 
CLASSIFY succeeds; success probability: 0.8340  pR: 7.0113
Best match to file #0 (m_test.css) prob: 0.8340  pR: 7.0113  
Total features in input file: 72
#0 (m_test.css): features: 22670, hits: 45, radiance: 8.94e-02, prob: 8.34e-01, pR:   7.01 
#1 (a_test.css): features: 22452, hits: 20, radiance: 1.78e-02, prob: 1.66e-01, pR:  -7.01 


**** String Unigram Hyperspace classifier 
 type A 
CLASSIFY fails; success probability: 0.2121  pR: -5.7002
Best match to file #1 (a_test.css) prob: 0.7879  pR: 5.7002  
Total features in input file: 11
#0 (m_test.css): features: 3971, hits: 5, radiance: 6.30e-03, prob: 2.12e-01, pR:  -5.70 
#1 (a_test.css): features: 4285, hits: 10, radiance: 2.34e-02, prob: 7.88e-01, pR:   5.70 

 type M 
CLASSIFY succeeds; success probability: 0.9750  pR: 15.9041
Best match to file #0 (m_test.css) prob: 0.9750  pR: 15.9041  
Total features in input file: 9
#0 (m_test.css): features: 3971, hits: 6, radiance: 9.08e-03, prob: 9.75e-01, pR:  15.90 
#1 (a_test.css): features: 4285, hits: 1, radiance: 2.33e-04, prob: 2.50e-02, pR: -15.90 


**** Vector 3-word-bag Hyperspace classifier 
 type A 
CLASSIFY fails; success probability: 0.0000  pR: -220.5875
Best match to file #1 (a_test.css) prob: 1.0000  pR: 220.5875  
Total features in input file: 11
#0 (m_test.css): features: 3971, hits: 0, radiance: 0.00e+00, prob: 8.73e-23, pR: -220.59 
#1 (a_test.css): features: 4285, hits: 7, radiance: 1.14e-02, prob: 1.00e+00, pR: 220.59 

 type M 
CLASSIFY succeeds; success probability: 1.0000  pR: 204.0055
Best match to file #0 (m_test.css) prob: 1.0000  pR: 204.0055  
Total features in input file: 9
#0 (m_test.css): features: 3971, hits: 1, radiance: 2.52e-04, prob: 1.00e+00, pR: 204.01 
#1 (a_test.css): features: 4285, hits: 0, radiance: 0.00e+00, prob: 3.98e-21, pR: -204.01 


**** Bit-Entropy classifier 
 type A 
CLASSIFY fails; success probability: 0.0000  pR: -12.0014
Best match to file #1 (a_test.css) prob: 1.0000  pR: 12.0014  
Total features in input file: 496
#0 (m_test.css): features: 181352 (3%), entropy: 434.778519, jumps: 31, prob: 9.97e-13, pR: -12.00 
#1 (a_test.css): features: 179608 (3%), entropy: 144.839378, jumps: 5, prob: 1.00e+00, pR:  12.00 

 type M 
CLASSIFY succeeds; success probability: 1.0000  pR: 6.3285
Best match to file #0 (m_test.css) prob: 1.0000  pR: 6.3285  
Total features in input file: 584
#0 (m_test.css): features: 181352 (3%), entropy: 385.057958, jumps: 29, prob: 1.00e+00, pR:   6.33 
#1 (a_test.css): features: 179608 (3%), entropy: 537.946666, jumps: 39, prob: 4.69e-07, pR:  -6.33 


**** Bit-Entropy Toroid classifier 
 type A 
CLASSIFY fails; success probability: 0.0000  pR: -7.5206
Best match to file #1 (a_test.css) prob: 1.0000  pR: 7.5206  
Total features in input file: 496
#0 (m_test.css): features: 181352 (100%), entropy: 464.920710, jumps: 33, prob: 3.02e-08, pR:  -7.52 
#1 (a_test.css): features: 179608 (100%), entropy: 283.231656, jumps: 13, prob: 1.00e+00, pR:   7.52 

 type M 
CLASSIFY succeeds; success probability: 1.0000  pR: 5.1811
Best match to file #0 (m_test.css) prob: 1.0000  pR: 5.1811  
Total features in input file: 584
#0 (m_test.css): features: 181352 (100%), entropy: 550.166118, jumps: 41, prob: 1.00e+00, pR:   5.18 
#1 (a_test.css): features: 179608 (100%), entropy: 675.335081, jumps: 53, prob: 6.59e-06, pR:  -5.18 


**** Fast Substring Compression Match Classifier 
 type A 
CLASSIFY fails; success probability: 0.1272  pR: -167.2656
Best match to file #1 (a_test.css) prob: 0.8728  pR: 167.2656 
Total features in input file: 62
#0 (m_test.css): features: 22673, chcs:  30.40, prob: 1.27e-01, pR: -167.27 
#1 (a_test.css): features: 22455, chcs: 208.52, prob: 8.73e-01, pR: 167.27 

 type M 
CLASSIFY succeeds; success probability: 0.7143  pR: 79.5911
Best match to file #0 (m_test.css) prob: 0.7143  pR: 79.5911 
Total features in input file: 73
#0 (m_test.css): features: 22673, chcs: 138.32, prob: 7.14e-01, pR:  79.59 
#1 (a_test.css): features: 22455, chcs:  55.33, prob: 2.86e-01, pR: -79.59 


**** Neural Network Classifier 
 type A 
CLASSIFY fails; success probability: 0.495362  pR: -1.7894
Best match to file #1 (a_test.css) prob: 0.5046  pR: 95.1750  
Total features in input file: 220
#0 (m_test.css): feats: 33029 ic: 0.95 oc: 0.04 prob: 4.95e-01, pR:  90.08
#1 (a_test.css): feats: 33029 ic: 0.98 oc: 0.03 prob: 5.05e-01, pR:  95.17

 type A 
CLASSIFY fails; success probability: 0.448415  pR: -17.9280
Best match to file #1 (a_test.css) prob: 0.5516  pR: 93.7239  
Total features in input file: 188
#0 (m_test.css): feats: 33029 ic: 0.77 oc: 0.20 prob: 4.48e-01, pR:  55.70
#1 (a_test.css): feats: 33029 ic: 0.97 oc: 0.04 prob: 5.52e-01, pR:  93.72

**** Alternating Example Neural Network Classifier TRAINING

**** Alternating Example Neural Network Classifier RUNNING TEST
 type A 
CLASSIFY fails; success probability: 0.093212  pR: -81.8632
Best match to file #1 (a_test.css) prob: 0.9068  pR: 83.5828  
Total features in input file: 220
#0 (m_test.css): feats: 5826 ic: 0.09 oc: 0.90 prob: 9.32e-02, pR: -80.16
#1 (a_test.css): feats: 5826 ic: 0.92 oc: 0.09 prob: 9.07e-01, pR:  83.58

 type M 
CLASSIFY succeeds; success probability: 0.671733  pR: 39.6054
Best match to file #0 (m_test.css) prob: 0.6717  pR: 51.5804  
Total features in input file: 175
#0 (m_test.css): feats: 5826 ic: 0.76 oc: 0.26 prob: 6.72e-01, pR:  51.58
#1 (a_test.css): feats: 5826 ic: 0.39 oc: 0.65 prob: 3.28e-01, pR: -27.42


**** Support Vector Machine (SVM) unigram classifier 
 type M 
CLASSIFY succeeds success probability: 0.688203 pR: 1.5838
Best match to class #0 prob: 0.6882 pR: 1.5838   
Total features in input file: 12
#0 (label +1): documents: 193, features: 3567, prob: 6.88e-01, pR:   1.58
#1 (label -1): documents: 57, features: 3174, prob: 3.12e-01, pR:  -1.58

 type M 
CLASSIFY succeeds success probability: 0.855189 pR: 7.4081
Best match to class #0 prob: 0.8552 pR: 7.4081   
Total features in input file: 9
#0 (label +1): documents: 193, features: 3567, prob: 8.55e-01, pR:   7.41
#1 (label -1): documents: 57, features: 3174, prob: 1.45e-01, pR:  -7.41


**** Support Vector Machine (SVM) classifier 
 type M 
CLASSIFY succeeds success probability: 0.677904 pR: 1.4405
Best match to class #0 prob: 0.6779 pR: 1.4405   
Total features in input file: 48
#0 (label +1): documents: 193, features: 15809, prob: 6.78e-01, pR:   1.44
#1 (label -1): documents: 57, features: 16604, prob: 3.22e-01, pR:  -1.44

 type M 
CLASSIFY succeeds success probability: 0.801854 pR: 4.3443
Best match to class #0 prob: 0.8019 pR: 4.3443   
Total features in input file: 40
#0 (label +1): documents: 193, features: 15809, prob: 8.02e-01, pR:   4.34
#1 (label -1): documents: 57, features: 16604, prob: 1.98e-01, pR:  -4.34

**** Alternating Example SVM Network Classifier TRAINING

**** Alternating Example SVM Network Classifier RUNNING TEST
 type A 
CLASSIFY fails success probability: 0.075773 pR: -19.0619
Best match to class #1 prob: 0.9242 pR: 19.0619   
Total features in input file: 150
#0 (label +1): documents: 16, features: 2025, prob: 7.58e-02, pR: -19.06
#1 (label -1): documents: 15, features: 2026, prob: 9.24e-01, pR:  19.06

 type M 
CLASSIFY succeeds success probability: 0.784357 pR: 3.7026
Best match to class #0 prob: 0.7844 pR: 3.7026   
Total features in input file: 143
#0 (label +1): documents: 16, features: 2025, prob: 7.84e-01, pR:   3.70
#1 (label -1): documents: 15, features: 2026, prob: 2.16e-01, pR:  -3.70


**** String Kernel SVM (SKS) classifier 
 type M 
CLASSIFY succeeds; success probability: 0.9749  pR: 15.8927
Best match to file #0 (m_test.css) prob: 0.9749  pR: 15.8927  
Total features in input file: 62
#0 (m_test.css):documents: 193, features: 22281,  prob: 9.75e-01, pR:  15.89 
#1 (a_test.css):documents: 57, features: 22045,  prob: 2.51e-02, pR: -15.89 

 type M 
CLASSIFY succeeds; success probability: 0.9782  pR: 16.5262
Best match to file #0 (m_test.css) prob: 0.9782  pR: 16.5262  
Total features in input file: 73
#0 (m_test.css):documents: 193, features: 22281,  prob: 9.78e-01, pR:  16.53 
#1 (a_test.css):documents: 57, features: 22045,  prob: 2.18e-02, pR: -16.53 


**** String Kernel SVM (SKS) Unique classifier 
 type M 
CLASSIFY succeeds; success probability: 0.9114  pR: 10.1239
Best match to file #0 (m_test.css) prob: 0.9114  pR: 10.1239  
Total features in input file: 61
#0 (m_test.css):documents: 193, features: 19836,  prob: 9.11e-01, pR:  10.12 
#1 (a_test.css):documents: 57, features: 17656,  prob: 8.86e-02, pR: -10.12 

 type M 
CLASSIFY succeeds; success probability: 0.8047  pR: 6.1506
Best match to file #0 (m_test.css) prob: 0.8047  pR: 6.1506  
Total features in input file: 70
#0 (m_test.css):documents: 193, features: 19836,  prob: 8.05e-01, pR:   6.15 
#1 (a_test.css):documents: 57, features: 17656,  prob: 1.95e-01, pR:  -6.15 


**** Bytewise Correlation classifier 
 type A 
CLASSIFY fails; success probability: 0.0083  pR: -2.0751
Best match to file #1 (Alice_In_Wonderland_Chap_1_And_2.txt) prob: 0.9917  pR: 2.0751  
Total features in input file: 22451
#0 (Macbeth_Act_IV.txt): features: 22669, L1: 83555 L2: 114702 L3: 173428, l4: 358614 prob: 8.34e-03, pR:  -2.08 
#1 (Alice_In_Wonderland_Chap_1_And_2.txt): features: 22451, L1: 96783 L2: 180165 L3: 1550947, l4: 49378101 prob: 9.92e-01, pR:   2.08 

 type M 
CLASSIFY succeeds; success probability: 0.9223  pR: 1.0742
Best match to file #0 (Macbeth_Act_IV.txt) prob: 0.9223  pR: 1.0742  
Total features in input file: 22669
#0 (Macbeth_Act_IV.txt): features: 22669, L1: 406150 L2: 611044 L3: 2022288, l4: 28898980 prob: 9.22e-01, pR:   1.07 
#1 (Alice_In_Wonderland_Chap_1_And_2.txt): features: 22451, L1: 476674 L2: 678005 L3: 1148703, l4: 2858981 prob: 7.77e-02, pR:  -1.07 


**** Clump / Pmulc Test 
............................................... Unsure result 
PMULC fails; success probabilty: 0.0089 pR: -20.4448
Best match to clump #24 (clump_#24) prob: 0.0089  pR: -20.4448
Closest document: #38 (document_#38) affinity: 0.7076
Total features in input file: 211
1: (clump_#1): documents: 3  affinity: 0.1321  prob: 0.0000  pR: -70.0000
2: (clump_#2): documents: 2  affinity: 0.1186  prob: 0.0000  pR: -70.0000
3: (clump_#3): documents: 1  affinity: 0.1380  prob: 0.0000  pR: -70.0000
4: (clump_#4): documents: 4  affinity: 0.1298  prob: 0.0000  pR: -70.0000
5: (clump_#5): documents: 1  affinity: 0.1121  prob: 0.0000  pR: -70.0000
6: (clump_#6): documents: 1  affinity: 0.1431  prob: 0.0000  pR: -70.0000
7: (clump_#7): documents: 2  affinity: 0.1300  prob: 0.0000  pR: -70.0000
8: (clump_#8): documents: 1  affinity: 0.0980  prob: 0.0000  pR: -70.0000
9: (clump_#9): documents: 1  affinity: 0.1564  prob: 0.0000  pR: -70.0000
10: (clump_#10): documents: 7  affinity: 0.1173  prob: 0.0000  pR: -70.0000
11: (clump_#11): documents: 1  affinity: 0.1436  prob: 0.0000  pR: -70.0000
12: (clump_#12): documents: 1  affinity: 0.1392  prob: 0.0000  pR: -70.0000
13: (clump_#13): documents: 1  affinity: 0.1042  prob: 0.0000  pR: -70.0000
14: (clump_#14): documents: 2  affinity: 0.1344  prob: 0.0000  pR: -70.0000
15: (clump_#15): documents: 1  affinity: 0.1171  prob: 0.0000  pR: -70.0000
16: (clump_#16): documents: 1  affinity: 0.1116  prob: 0.0000  pR: -70.0000
17: (clump_#17): documents: 1  affinity: 0.1134  prob: 0.0000  pR: -70.0000
18: (clump_#18): documents: 2  affinity: 0.1162  prob: 0.0000  pR: -70.0000
19: (clump_#19): documents: 1  affinity: 0.1019  prob: 0.0000  pR: -70.0000
20: (clump_#20): documents: 1  affinity: 0.1322  prob: 0.0000  pR: -70.0000
21: (clump_#21): documents: 1  affinity: 0.1461  prob: 0.0000  pR: -70.0000
22: (clump_#22): documents: 1  affinity: 0.1169  prob: 0.0000  pR: -70.0000
23: (clump_#23): documents: 1  affinity: 0.1131  prob: 0.0000  pR: -70.0000
24: (clump_#24): documents: 9  affinity: 0.2366  prob: 0.0089  pR: -20.4448

Likely result: 
PMULC succeeds; success probabilty: 1.0000 pR: 60.3644
Best match to clump #2 (clump_#2) prob: 1.0000  pR: 60.3644
Closest document: #1 (document_#1) affinity: 0.7264
Total features in input file: 179
1: (clump_#1): documents: 3  affinity: 0.1365  prob: 0.0000  pR: -70.0000
2: (clump_#2): documents: 2  affinity: 0.4956  prob: 1.0000  pR: 60.3644
3: (clump_#3): documents: 1  affinity: 0.1242  prob: 0.0000  pR: -70.0000
4: (clump_#4): documents: 4  affinity: 0.1411  prob: 0.0000  pR: -70.0000
5: (clump_#5): documents: 1  affinity: 0.1009  prob: 0.0000  pR: -70.0000
6: (clump_#6): documents: 1  affinity: 0.0933  prob: 0.0000  pR: -70.0000
7: (clump_#7): documents: 2  affinity: 0.1343  prob: 0.0000  pR: -70.0000
8: (clump_#8): documents: 1  affinity: 0.1013  prob: 0.0000  pR: -70.0000
9: (clump_#9): documents: 1  affinity: 0.1053  prob: 0.0000  pR: -70.0000
10: (clump_#10): documents: 7  affinity: 0.1213  prob: 0.0000  pR: -70.0000
11: (clump_#11): documents: 1  affinity: 0.1484  prob: 0.0000  pR: -70.0000
12: (clump_#12): documents: 1  affinity: 0.1253  prob: 0.0000  pR: -70.0000
13: (clump_#13): documents: 1  affinity: 0.1077  prob: 0.0000  pR: -70.0000
14: (clump_#14): documents: 2  affinity: 0.1080  prob: 0.0000  pR: -70.0000
15: (clump_#15): documents: 1  affinity: 0.0877  prob: 0.0000  pR: -70.0000
16: (clump_#16): documents: 1  affinity: 0.1474  prob: 0.0000  pR: -70.0000
17: (clump_#17): documents: 1  affinity: 0.1346  prob: 0.0000  pR: -70.0000
18: (clump_#18): documents: 2  affinity: 0.1201  prob: 0.0000  pR: -70.0000
19: (clump_#19): documents: 1  affinity: 0.1053  prob: 0.0000  pR: -70.0000
20: (clump_#20): documents: 1  affinity: 0.1366  prob: 0.0000  pR: -70.0000
21: (clump_#21): documents: 1  affinity: 0.1094  prob: 0.0000  pR: -70.0000
22: (clump_#22): documents: 1  affinity: 0.1388  prob: 0.0000  pR: -70.0000
23: (clump_#23): documents: 1  affinity: 0.1018  prob: 0.0000  pR: -70.0000
24: (clump_#24): documents: 9  affinity: 0.1191  prob: 0.0000  pR: -70.0000

Likely result: 
0 (document_#0) clump: 1 (clump_#1) affinity: 0.1255
1 (document_#1) clump: 2 (clump_#2) affinity: 0.2121
2 (document_#2) clump: 2 (clump_#2) affinity: 0.2121
3 (document_#3) clump: 3 (clump_#3) affinity: 0.0000
4 (document_#4) clump: 1 (clump_#1) affinity: 0.1628
5 (document_#5) clump: 4 (clump_#4) affinity: 0.1535
6 (document_#6) clump: 4 (clump_#4) affinity: 0.1334
7 (document_#7) clump: 4 (clump_#4) affinity: 0.1957
8 (document_#8) clump: 4 (clump_#4) affinity: 0.1598
9 (document_#9) clump: 5 (clump_#5) affinity: 0.0000
10 (document_#10) clump: 1 (clump_#1) affinity: 0.1821
11 (document_#11) clump: 6 (clump_#6) affinity: 0.0000
12 (document_#12) clump: 7 (clump_#7) affinity: 0.1364
13 (document_#13) clump: 7 (clump_#7) affinity: 0.1364
14 (document_#14) clump: 8 (clump_#8) affinity: 0.0000
15 (document_#15) clump: 9 (clump_#9) affinity: 0.0000
16 (document_#16) clump: 10 (clump_#10) affinity: 0.1744
17 (document_#17) clump: 10 (clump_#10) affinity: 0.1882
18 (document_#18) clump: 10 (clump_#10) affinity: 0.1999
19 (document_#19) clump: 10 (clump_#10) affinity: 0.1940
20 (document_#20) clump: 10 (clump_#10) affinity: 0.1593
21 (document_#21) clump: 10 (clump_#10) affinity: 0.1684
22 (document_#22) clump: 10 (clump_#10) affinity: 0.1682
23 (document_#23) clump: 11 (clump_#11) affinity: 0.0000
24 (document_#24) clump: 12 (clump_#12) affinity: 0.0000
25 (document_#25) clump: 13 (clump_#13) affinity: 0.0000
26 (document_#26) clump: 14 (clump_#14) affinity: 0.0916
27 (document_#27) clump: 15 (clump_#15) affinity: 0.0000
28 (document_#28) clump: 16 (clump_#16) affinity: 0.0000
29 (document_#29) clump: 17 (clump_#17) affinity: 0.0000
30 (document_#30) clump: 18 (clump_#18) affinity: 0.0892
31 (document_#31) clump: 18 (clump_#18) affinity: 0.0892
32 (document_#32) clump: 19 (clump_#19) affinity: 0.0000
33 (document_#33) clump: 20 (clump_#20) affinity: 0.0000
34 (document_#34) clump: 14 (clump_#14) affinity: 0.0916
35 (document_#35) clump: 21 (clump_#21) affinity: 0.0000
36 (document_#36) clump: 22 (clump_#22) affinity: 0.0000
37 (document_#37) clump: 23 (clump_#23) affinity: 0.0000
38 (document_#38) clump: 24 (clump_#24) affinity: 0.2282
39 (document_#39) clump: 24 (clump_#24) affinity: 0.2296
40 (document_#40) clump: 24 (clump_#24) affinity: 0.2475
41 (document_#41) clump: 24 (clump_#24) affinity: 0.2399
42 (document_#42) clump: 24 (clump_#24) affinity: 0.2422
43 (document_#43) clump: 24 (clump_#24) affinity: 0.1964
44 (document_#44) clump: 24 (clump_#24) affinity: 0.2248
45 (document_#45) clump: 24 (clump_#24) affinity: 0.2493
46 (document_#46) clump: 24 (clump_#24) affinity: 0.2191


**** Principal Component Analysis (PCA) unigram classifier 
 type A 
CLASSIFY fails success probability: 0.499846 pR: -0.3073
Best match to class #1 prob: 0.5002 pR: 0.3073   
Total features in input file: 11
#0 (label +1): documents: 193, features: 3567, prob: 5.00e-01, pR:  -0.31
#1 (label -1): documents: 57, features: 3174, prob: 5.00e-01, pR:   0.31

 type M 
CLASSIFY succeeds success probability: 0.506965 pR: 13.9301
Best match to class #0 prob: 0.5070 pR: 13.9301   
Total features in input file: 8
#0 (label +1): documents: 193, features: 3567, prob: 5.07e-01, pR:  13.93
#1 (label -1): documents: 57, features: 3174, prob: 4.93e-01, pR: -13.93


**** Principal Component Analysis (PCA) classifier 
 type A 
CLASSIFY fails success probability: 0.497977 pR: -4.0453
Best match to class #1 prob: 0.5020 pR: 4.0453   
Total features in input file: 47
#0 (label +1): documents: 193, features: 15809, prob: 4.98e-01, pR:  -4.05
#1 (label -1): documents: 57, features: 16604, prob: 5.02e-01, pR:   4.05

 type M 
CLASSIFY succeeds success probability: 0.502855 pR: 5.7103
Best match to class #0 prob: 0.5029 pR: 5.7103   
Total features in input file: 39
#0 (label +1): documents: 193, features: 15809, prob: 5.03e-01, pR:   5.71
#1 (label -1): documents: 57, features: 16604, prob: 4.97e-01, pR:  -5.71

**** Alternating Example PCA Network Classifier TRAINING

**** Alternating Example PCA Network Classifier RUNNING TEST
 type A 
CLASSIFY fails success probability: 0.171492 pR: -787.5435
Best match to class #1 prob: 0.8285 pR: 787.5435   
Total features in input file: 149
#0 (label +1): documents: 16, features: 2025, prob: 1.71e-01, pR: -787.54
#1 (label -1): documents: 15, features: 2026, prob: 8.29e-01, pR: 787.54

 type M 
CLASSIFY succeeds success probability: 0.779493 pR: 631.3570
Best match to class #0 prob: 0.7795 pR: 631.3570   
Total features in input file: 142
#0 (label +1): documents: 16, features: 2025, prob: 7.79e-01, pR: 631.36
#1 (label -1): documents: 15, features: 2026, prob: 2.21e-01, pR: -631.36