Error while fetching super- and subclasses of : org.apache.jena.atlas.json.JsonParseException: Broken token (newline): http://www.wikidataSPARQL-QUERY: queryStr=PREFIX rs: at org.apache.jena.atlas.json.io.parser.TokenizerJSON.exception(TokenizerJSON.java:790) at org.apache.jena.atlas.json.io.parser.TokenizerJSON.allBetween(TokenizerJSON.java:570) at org.apache.jena.atlas.json.io.parser.TokenizerJSON.parseToken(TokenizerJSON.java:137) at org.apache.jena.atlas.json.io.parser.TokenizerJSON.hasNext(TokenizerJSON.java:59) at org.apache.jena.atlas.iterator.PeekIterator.fill(PeekIterator.java:50) at org.apache.jena.atlas.iterator.PeekIterator.next(PeekIterator.java:92) at org.apache.jena.atlas.json.io.parser.JSONParserBase.nextToken(JSONParserBase.java:107) at org.apache.jena.atlas.json.io.parser.JSONP.parseObject(JSONP.java:75) at org.apache.jena.atlas.json.io.parser.JSONP.parseAny(JSONP.java:97) at org.apache.jena.atlas.json.io.parser.JSONP.parseObject(JSONP.java:79) at org.apache.jena.atlas.json.io.parser.JSONP.parseAny(JSONP.java:97) at org.apache.jena.atlas.json.io.parser.JSONP.parseArray(JSONP.java:146) at org.apache.jena.atlas.json.io.parser.JSONP.parseAny(JSONP.java:98) at org.apache.jena.atlas.json.io.parser.JSONP.parseObject(JSONP.java:79) at org.apache.jena.atlas.json.io.parser.JSONP.parseAny(JSONP.java:97) at org.apache.jena.atlas.json.io.parser.JSONP.parseObject(JSONP.java:79) at org.apache.jena.atlas.json.io.parser.JSONP.parse(JSONP.java:50) at org.apache.jena.atlas.json.io.parser.JSONParser.parse(JSONParser.java:58) at org.apache.jena.atlas.json.io.parser.JSONParser.parse(JSONParser.java:40) at org.apache.jena.atlas.json.JSON._parse(JSON.java:145) at org.apache.jena.atlas.json.JSON.parse(JSON.java:37) at com.hp.hpl.jena.sparql.resultset.JSONInput.parse(JSONInput.java:125) at com.hp.hpl.jena.sparql.resultset.JSONInput.process(JSONInput.java:109) at com.hp.hpl.jena.sparql.resultset.JSONInput.fromJSON(JSONInput.java:66) at com.hp.hpl.jena.query.ResultSetFactory.fromJSON(ResultSetFactory.java:344) at com.hp.hpl.jena.sparql.engine.http.QueryEngineHTTP.execResultSetInner(QueryEngineHTTP.java:371) at com.hp.hpl.jena.sparql.engine.http.QueryEngineHTTP.execSelect(QueryEngineHTTP.java:338) at nl.wur.ssb.RDFSimpleCon.RDFSimpleCon.runQuery(RDFSimpleCon.java:260) at nl.wur.ssb.RDF2Graph.Main.runRemoteQuery(Main.java:879) at nl.wur.ssb.RDF2Graph.Main.access$100(Main.java:33) at nl.wur.ssb.RDF2Graph.Main$4.handleResult(Main.java:319) at nl.wur.ssb.RDFSimpleCon.concurrent.TaskExecuter$1.run(TaskExecuter.java:33) at nl.wur.ssb.RDFSimpleCon.concurrent.TaskExecuter.executeTask(TaskExecuter.java:44) at nl.wur.ssb.RDFSimpleCon.concurrent.TaskExecuter.runEachAsTask(TaskExecuter.java:30) at nl.wur.ssb.RDF2Graph.Main.run(Main.java:312) at nl.wur.ssb.RDF2Graph.Main.main(Main.java:150) Skipping this class and continuing... Error while fetching super- and subclasses of : org.apache.jena.atlas.json.JsonParseException: Illegal: [KEYWORD:SPARQL-QUERY] at org.apache.jena.atlas.json.io.parser.JSONParserBase.exception(JSONParserBase.java:130) at org.apache.jena.atlas.json.io.parser.JSONP.parseObject(JSONP.java:87) at org.apache.jena.atlas.json.io.parser.JSONP.parseAny(JSONP.java:97) at org.apache.jena.atlas.json.io.parser.JSONP.parseArray(JSONP.java:146) at org.apache.jena.atlas.json.io.parser.JSONP.parseAny(JSONP.java:98) at org.apache.jena.atlas.json.io.parser.JSONP.parseObject(JSONP.java:79) at org.apache.jena.atlas.json.io.parser.JSONP.parseAny(JSONP.java:97) at org.apache.jena.atlas.json.io.parser.JSONP.parseObject(JSONP.java:79) at org.apache.jena.atlas.json.io.parser.JSONP.parse(JSONP.java:50) at org.apache.jena.atlas.json.io.parser.JSONParser.parse(JSONParser.java:58) at org.apache.jena.atlas.json.io.parser.JSONParser.parse(JSONParser.java:40) at org.apache.jena.atlas.json.JSON._parse(JSON.java:145) at org.apache.jena.atlas.json.JSON.parse(JSON.java:37) at com.hp.hpl.jena.sparql.resultset.JSONInput.parse(JSONInput.java:125) at com.hp.hpl.jena.sparql.resultset.JSONInput.process(JSONInput.java:109) at com.hp.hpl.jena.sparql.resultset.JSONInput.fromJSON(JSONInput.java:66) at com.hp.hpl.jena.query.ResultSetFactory.fromJSON(ResultSetFactory.java:344) at com.hp.hpl.jena.sparql.engine.http.QueryEngineHTTP.execResultSetInner(QueryEngineHTTP.java:371) at com.hp.hpl.jena.sparql.engine.http.QueryEngineHTTP.execSelect(QueryEngineHTTP.java:338) at nl.wur.ssb.RDFSimpleCon.RDFSimpleCon.runQuery(RDFSimpleCon.java:260) at nl.wur.ssb.RDF2Graph.Main.runRemoteQuery(Main.java:879) at nl.wur.ssb.RDF2Graph.Main.access$100(Main.java:33) at nl.wur.ssb.RDF2Graph.Main$4.handleResult(Main.java:319) at nl.wur.ssb.RDFSimpleCon.concurrent.TaskExecuter$1.run(TaskExecuter.java:33) at nl.wur.ssb.RDFSimpleCon.concurrent.TaskExecuter.executeTask(TaskExecuter.java:44) at nl.wur.ssb.RDFSimpleCon.concurrent.TaskExecuter.runEachAsTask(TaskExecuter.java:30) at nl.wur.ssb.RDF2Graph.Main.run(Main.java:312) at nl.wur.ssb.RDF2Graph.Main.main(Main.java:150) Skipping this class and continuing... Exception in thread "main" java.lang.StackOverflowError at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) at nl.wur.ssb.RDF2Graph.simplify.TreeNode.findCommon(TreeNode.java:293) 15:21:39 INFO loader :: -- Start triples data phase 15:21:39 INFO loader :: ** Load empty triples table 15:21:39 INFO loader :: Load: 104-results/temp/temp1.n3 -- 2024/05/20 15:21:39 UTC 15:22:07 INFO loader :: Add: 100,000 triples (Batch: 3,547 / Avg: 3,547) 15:22:19 INFO loader :: Add: 200,000 triples (Batch: 8,003 / Avg: 4,916) 15:22:28 INFO loader :: Add: 300,000 triples (Batch: 12,025 / Avg: 6,122) 15:22:32 INFO loader :: Add: 400,000 triples (Batch: 21,213 / Avg: 7,446) 15:22:39 INFO loader :: Add: 500,000 triples (Batch: 15,696 / Avg: 8,321) 15:22:45 INFO loader :: Add: 600,000 triples (Batch: 15,825 / Avg: 9,035) 15:22:50 INFO loader :: Add: 700,000 triples (Batch: 21,635 / Avg: 9,855) 15:22:56 INFO loader :: Add: 800,000 triples (Batch: 15,384 / Avg: 10,319) 15:23:01 INFO loader :: Add: 900,000 triples (Batch: 19,353 / Avg: 10,883) 15:23:06 INFO loader :: -- Finish triples data phase 15:23:06 INFO loader :: ** Data: 992,217 triples loaded in 86.94 seconds [Rate: 11,412.40 per second] 15:23:06 INFO loader :: -- Start triples index phase 15:23:08 INFO loader :: Index GSPO->GPOS: 100,000 slots (Batch: 46,707 slots/s / Avg: 46,707 slots/s) 15:23:10 INFO loader :: Index GSPO->GPOS: 200,000 slots (Batch: 55,679 slots/s / Avg: 50,800 slots/s) 15:23:12 INFO loader :: Index GSPO->GPOS: 300,000 slots (Batch: 49,504 slots/s / Avg: 50,360 slots/s) 15:23:12 INFO loader :: Index GSPO->GPOS: 400,000 slots (Batch: 110,619 slots/s / Avg: 58,300 slots/s) 15:23:14 INFO loader :: Index GSPO->GPOS: 500,000 slots (Batch: 75,700 slots/s / Avg: 61,109 slots/s) 15:23:15 INFO loader :: Index GSPO->GPOS: 600,000 slots (Batch: 75,244 slots/s / Avg: 63,084 slots/s) 15:23:16 INFO loader :: Index GSPO->GPOS: 700,000 slots (Batch: 91,575 slots/s / Avg: 66,019 slots/s) 15:23:18 INFO loader :: Index GSPO->GPOS: 800,000 slots (Batch: 75,357 slots/s / Avg: 67,057 slots/s) 15:23:19 INFO loader :: Index GSPO->GPOS: 900,000 slots (Batch: 66,577 slots/s / Avg: 67,004 slots/s) 15:23:20 INFO loader :: ** Index GSPO->GPOS: 992,217 slots indexed in 14.34 seconds [Rate: 69,216.40 per second] 15:23:21 INFO loader :: Index GSPO->GOSP: 100,000 slots (Batch: 82,644 slots/s / Avg: 82,644 slots/s) 15:23:22 INFO loader :: Index GSPO->GOSP: 200,000 slots (Batch: 101,214 slots/s / Avg: 90,991 slots/s) 15:23:23 INFO loader :: Index GSPO->GOSP: 300,000 slots (Batch: 82,169 slots/s / Avg: 87,847 slots/s) 15:23:24 INFO loader :: Index GSPO->GOSP: 400,000 slots (Batch: 119,904 slots/s / Avg: 94,139 slots/s) 15:23:25 INFO loader :: Index GSPO->GOSP: 500,000 slots (Batch: 80,971 slots/s / Avg: 91,174 slots/s) 15:23:27 INFO loader :: Index GSPO->GOSP: 600,000 slots (Batch: 76,687 slots/s / Avg: 88,391 slots/s) 15:23:28 INFO loader :: Index GSPO->GOSP: 700,000 slots (Batch: 117,096 slots/s / Avg: 91,599 slots/s) 15:23:29 INFO loader :: Index GSPO->GOSP: 800,000 slots (Batch: 66,979 slots/s / Avg: 87,575 slots/s) 15:23:31 INFO loader :: Index GSPO->GOSP: 900,000 slots (Batch: 63,775 slots/s / Avg: 84,088 slots/s) 15:23:31 INFO loader :: ** Index GSPO->GOSP: 992,217 slots indexed in 11.42 seconds [Rate: 86,876.55 per second] 15:23:32 INFO loader :: Index GSPO->POSG: 100,000 slots (Batch: 118,906 slots/s / Avg: 118,906 slots/s) 15:23:33 INFO loader :: Index GSPO->POSG: 200,000 slots (Batch: 98,716 slots/s / Avg: 107,874 slots/s) 15:23:34 INFO loader :: Index GSPO->POSG: 300,000 slots (Batch: 82,169 slots/s / Avg: 97,688 slots/s) 15:23:35 INFO loader :: Index GSPO->POSG: 400,000 slots (Batch: 112,107 slots/s / Avg: 100,933 slots/s) 15:23:37 INFO loader :: Index GSPO->POSG: 500,000 slots (Batch: 72,202 slots/s / Avg: 93,492 slots/s) 15:23:38 INFO loader :: Index GSPO->POSG: 600,000 slots (Batch: 69,589 slots/s / Avg: 88,430 slots/s) 15:23:39 INFO loader :: Index GSPO->POSG: 700,000 slots (Batch: 101,626 slots/s / Avg: 90,101 slots/s) 15:23:41 INFO loader :: Index GSPO->POSG: 800,000 slots (Batch: 62,383 slots/s / Avg: 85,360 slots/s) 15:23:42 INFO loader :: Index GSPO->POSG: 900,000 slots (Batch: 66,622 slots/s / Avg: 82,773 slots/s) 15:23:43 INFO loader :: ** Index GSPO->POSG: 992,217 slots indexed in 11.80 seconds [Rate: 84,114.70 per second] 15:23:44 INFO loader :: Index GSPO->OSPG: 100,000 slots (Batch: 129,366 slots/s / Avg: 129,366 slots/s) 15:23:45 INFO loader :: Index GSPO->OSPG: 200,000 slots (Batch: 101,522 slots/s / Avg: 113,765 slots/s) 15:23:46 INFO loader :: Index GSPO->OSPG: 300,000 slots (Batch: 84,745 slots/s / Avg: 102,110 slots/s) 15:23:47 INFO loader :: Index GSPO->OSPG: 400,000 slots (Batch: 133,868 slots/s / Avg: 108,548 slots/s) 15:23:48 INFO loader :: Index GSPO->OSPG: 500,000 slots (Batch: 73,260 slots/s / Avg: 99,009 slots/s) 15:23:49 INFO loader :: Index GSPO->OSPG: 600,000 slots (Batch: 78,186 slots/s / Avg: 94,801 slots/s) 15:23:50 INFO loader :: Index GSPO->OSPG: 700,000 slots (Batch: 121,212 slots/s / Avg: 97,847 slots/s) 15:23:52 INFO loader :: Index GSPO->OSPG: 800,000 slots (Batch: 76,511 slots/s / Avg: 94,551 slots/s) 15:23:53 INFO loader :: Index GSPO->OSPG: 900,000 slots (Batch: 61,881 slots/s / Avg: 89,312 slots/s) 15:23:54 INFO loader :: ** Index GSPO->OSPG: 992,217 slots indexed in 10.82 seconds [Rate: 91,668.24 per second] 15:23:55 INFO loader :: Index GSPO->SPOG: 100,000 slots (Batch: 118,343 slots/s / Avg: 118,343 slots/s) 15:23:56 INFO loader :: Index GSPO->SPOG: 200,000 slots (Batch: 91,996 slots/s / Avg: 103,519 slots/s) 15:23:57 INFO loader :: Index GSPO->SPOG: 300,000 slots (Batch: 107,526 slots/s / Avg: 104,821 slots/s) 15:23:58 INFO loader :: Index GSPO->SPOG: 400,000 slots (Batch: 136,239 slots/s / Avg: 111,234 slots/s) 15:23:58 INFO loader :: Index GSPO->SPOG: 500,000 slots (Batch: 169,779 slots/s / Avg: 119,474 slots/s) 15:23:59 INFO loader :: Index GSPO->SPOG: 600,000 slots (Batch: 120,772 slots/s / Avg: 119,688 slots/s) 15:24:00 INFO loader :: Index GSPO->SPOG: 700,000 slots (Batch: 104,712 slots/s / Avg: 117,292 slots/s) 15:24:01 INFO loader :: Index GSPO->SPOG: 800,000 slots (Batch: 92,336 slots/s / Avg: 113,459 slots/s) 15:24:02 INFO loader :: Index GSPO->SPOG: 900,000 slots (Batch: 133,155 slots/s / Avg: 115,355 slots/s) 15:24:03 INFO loader :: ** Index GSPO->SPOG: 992,217 slots indexed in 8.73 seconds [Rate: 113,616.98 per second] 15:24:03 INFO loader :: -- Finish triples index phase 15:24:03 INFO loader :: ** 992,217 triples indexed in 57.15 seconds [Rate: 17,362.54 per second] 15:24:03 INFO loader :: -- Finish triples load 15:24:03 INFO loader :: ** Completed: 992,217 triples loaded in 144.19 seconds [Rate: 6,881.27 per second] 15:24:17 INFO loader :: -- Start triples data phase 15:24:17 INFO loader :: ** Load into triples table with existing data 15:24:17 INFO loader :: Load: 104-results/temp/temp2.n3 -- 2024/05/20 15:24:17 UTC 15:24:34 INFO loader :: -- Finish triples data phase 15:24:34 INFO loader :: ** Data: 1,585 triples loaded in 16.60 seconds [Rate: 95.45 per second] 15:24:34 INFO loader :: -- Start triples index phase 15:24:34 INFO loader :: -- Finish triples index phase 15:24:34 INFO loader :: -- Finish triples load 15:24:34 INFO loader :: ** Completed: 1,585 triples loaded in 16.62 seconds [Rate: 95.37 per second] pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy