static int ai_solveQuestionInSubSpace_limit = 10000;
static bool ai_solveQuestionInSubSpace_saveIfSuccessful = true;

static S ai_solveQuestionInSubSpace_noTimeOut(T3<S> seed, T3<S> lookingFor) {
  ret pairB(ai_solveQuestionInSubSpace_noTimeOut2(seed, lookingFor));
}

static Pair<AI_SubSpace, S> ai_solveQuestionInSubSpace_noTimeOut2(T3<S> seed, T3<S> lookingFor) {
  AI_SubSpace subSpace = new(ai_solveQuestionInSubSpace_limit);
  ai_setSubSpace(subSpace);
  try {
    subSpace.postTriple(seed); // force it to be posted in SubSpace
    subSpace.postTriple(t3("_goal", "is", ai_renderTriple(lookingFor)));
    
    int step = 0;
    while (!subSpace.limitReached()) {
      ++step;
      int n = l(subSpace.webs);
      print("Solving question: " + lookingFor + " (step " + step + ", " + n + "/" + subSpace.limit + ")");
      
      pcall-short {
        for (S term : concatLists(keys(subSpace.index), keys(subSpace.websByID)))
          ai_speculate(term);
      }
      
      L<Web> newWebs = cloneSubList(subSpace.webs, n);
      ai_spec_possiblyToActually(newWebs);
      
      S a = ai_text(lookingFor);
      if (a != null) {
        if (ai_solveQuestionInSubSpace_saveIfSuccessful)
          saveGZStructure(countTillNewFile(programFile("logged-subspaces/subspace"), ".gz"), subSpace);
        ret pair(subSpace, a);
      }
  
      if (l(subSpace.webs) == n) {
        print("No new webs made");
        break;
      }
    }
    
    print("Subspace limit reached");
    ret pair(subSpace, null);
  } finally {
    ai_setSubSpace(null);
  }
}

static Pair<AI_SubSpace, S> ai_solveQuestionInSubSpace_noTimeOut2(S q) {
  ret ai_solveQuestionInSubSpace_noTimeOut2(
    triple(q, "should be", "answered"),
    triple("$X", "answers", q));
}