From 220d3b0d4e4e175c61b759989ca68a13d8eba8af Mon Sep 17 00:00:00 2001
From: bdemsky <bdemsky@uci.edu>
Date: Tue, 26 Mar 2019 14:07:53 -0700
Subject: [PATCH] Add order benchmark.

---
 src/Test/orderbm.cc | 44 ++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 src/Test/orderbm.cc

diff --git a/src/Test/orderbm.cc b/src/Test/orderbm.cc
new file mode 100644
index 0000000..af3bd91
--- /dev/null
+++ b/src/Test/orderbm.cc
@@ -0,0 +1,44 @@
+#include <stdlib.h>
+#include "csolver.h"
+/**
+ * TotalOrder(5, 1, 4)
+ * 5 => 1
+ * 1 => 4
+ * Result: O(5,1)=0 O(1,4)=0 O(5,4)=0 O(1,5)=1 O(1111,5)=2
+ */
+int main(int numargs, char **argv) {
+  if (numargs < 4) {
+    printf("Requires the following arguments: numpoints numclauses maxclausesize randomseed\n");
+    return -1;
+  }
+  int numpoints = atoi(argv[1]);
+  int numclauses = atoi(argv[2]);
+  int maxclause = atoi(argv[3]);
+  srandom(atoi(argv[4]));
+  
+  CSolver *solver = new CSolver();
+  Set *s =solver->createRangeSet(0, 0, numpoints);
+  Order *order = solver->createOrder(SATC_TOTAL, s);
+  BooleanEdge be[maxclause];
+  for(int i = 0; i < numclauses; i++) {
+    int numterms = (random() % (maxclause -1)) + 1;
+    
+    for(int j = 0; j < numterms; j++) {    
+      uint src = random() % (numpoints - 1);
+      uint dst;
+      do {
+	dst = random() % numpoints;
+      } while (src == dst || ((false) && (src > dst)));
+      
+      be[j] =  solver->orderConstraint(order, src, dst);
+    }
+    solver->addConstraint(solver->applyLogicalOperation(SATC_OR, be, numterms));
+  }
+  solver->serialize();
+  if (solver->solve() == 1) {
+    printf("SAT\n");
+  } else {
+    printf("UNSAT\n");
+  }
+  delete solver;
+}
-- 
2.34.1