run_tests.py

import os
import time
from combo import *
import numpy as np
from literal import *

dirtype='70v'
competition = True

def getstats(results):
    return np.amin(results),np.amax(results),np.mean(results),np.median(results)

def cnf_to_python(file):
    f=open(file)
    instance = []
    for line in f.readlines():
        line.replace('\t',' ')
        line.strip('\n')
        line_tokens = line.split(' ')
        if 'c' in line_tokens[0] or 'p' in line_tokens[0]:
            continue
        else:
            line_tokens = [int(i) for i in line_tokens[0:-1]]
            if len(line_tokens) == 0:
                continue
            instance.append(line_tokens)
    return instance

#creates an array of testcases
def load_testcases():
    testcases = []
    
    for filename in os.listdir(dirtype):
        testcases.append((dirtype+'/'+filename,cnf_to_python(dirtype+'/'+filename)))
    return testcases

def run_testcases(testcases):
    time_suffix = str(int(time.time()))
    f = open('readable_results_'+time_suffix+'.txt','aw')
    resultsdict = {}
    satisfied = parse_opt()
    for filename, instance in testcases:
        print filename
        tmp = filename.replace(dirtype+"/", "")
        if tmp in satisfied.keys():
            f.write(filename+'\n')
            f.flush()
            t1 = time.time()
            var_prob, status = GW(instance)
            t2 = time.time()
            time_gw = t2-t1
            # results_gw = []
            # results_naive = []
            #TODO: add timer
            # for p in range(0,11,1):
            #     rounded = rand_round(instance, var_prob)
            #     gw_sol = satisfied_clauses(instance, rounded)
            #     naive_sol = naive_max_sat(instance,float(p)/10)
            #     results_gw.append(gw_sol)
            #     results_naive.append(naive_sol)
            p=0.5
            rounded = rand_round(instance, var_prob)
            results_gw = satisfied_clauses(instance, rounded)
            results_naive = naive_max_sat(instance,p)

            if competition:
                num_clauses = len(instance)
                ftemp = open(filename)
                num_satisfied = satisfied[tmp]#int(re.findall("c desired:.*",ftemp.read())[0].split(':')[1])
            else:   
                num_clauses, num_satisfied, time_exact = exact_soln_info(filename)

            k= len(instance[0])
            literals = num_literals(instance)

            #resultsdict[filename] = [k, literals, num_clauses, num_satisfied, getstats(results_gw), getstats(results_naive)]
            resultsdict[filename] = [k, literals, num_clauses, num_satisfied, results_gw, results_naive]

            f.write(str(resultsdict[filename])+'\n')
            if status == 1:
                f.write("Recursion depth exceeded. Need to run again\n")
            f.flush()
        else:
            print "not"
    f.close()
    f2 = open('results_object_'+time_suffix+'.json','aw')
    f2.write(str(resultsdict))
    f2.close()
    
def parse_opt():
    g = open("ahmaxsat-ls-ms_random-COMPLETE-1800-3500-2.txt")
    satisfied = {}
    for line in g.readlines():
        line = line.replace('\t',' ')
        line.strip('\n')
        line_tokens = line.split(' ')
        if line_tokens[2] == "OPTIMUM_FOUND":
            filename = line_tokens[0].split("/")[-1]
            num_clauses = int(line_tokens[11])
            num_unsatisfied = int(line_tokens[3])
            num_satisfied = num_clauses - num_unsatisfied
            satisfied[filename] = num_satisfied
    return satisfied
        


def main():
    testcases = load_testcases()
    run_testcases(testcases)

if __name__ == '__main__':
        main()