clasp version 3.0.5
usage: clasp [number] [options] [file]

Clasp.Config Options:

  --configuration=<arg>   : Configure default configuration [auto]
      <arg>: {auto|frumpy|jumpy|tweety|handy|crafty|trendy|many|<file>}
        auto  : Select configuration based on problem type
        frumpy: Use conservative defaults
        jumpy : Use aggressive defaults
        tweety: Use defaults geared towards asp problems
        handy : Use defaults geared towards large problems
        crafty: Use defaults geared towards crafted problems
        trendy: Use defaults geared towards industrial problems
        many  : Use default portfolio to configure solver(s)
        <file>: Use configuration file to configure solver(s)
  --tester=<options>      : Pass (quoted) string of <options> to tester
  --stats[={0..2}],-s     : Maintain {0=no|1=basic|2=extended} statistics
  --share=<arg>|no        : Configure physical sharing of constraints [auto]
      <arg>: {auto|problem|learnt|all}
  --learn-explicit        : Do not use Short Implication Graph for learning

  --sat-prepro[=<arg>]    : Run SatELite-like preprocessing (Implicit: -1)
      <arg>: <n1>[,...][,<n5 {0..2}>] (-1=no limit)
        <n1>: Run for at most <n1> iterations
        <n2>: Run variable elimination with cutoff <n2>              [-1]
        <n3>: Run for at most <n3> seconds                           [-1]
        <n4>: Disable if <n4>% of vars are frozen                    [-1]
        <n5>: Run blocked clause elimination  {0=no,1=limited,2=full} [1]


Clasp.Solving Options:

  --solve-limit=<n>[,<m>] : Stop search after <n> conflicts or <m> restarts

  --parallel-mode,-t <arg>: Run parallel search with given number of threads
      <arg>: <n {1..64}>[,<mode {compete|split}>]
        <n>   : Number of threads to use in search
        <mode>: Run competition or splitting based search [compete]

  --global-restarts[=<X>] : Configure global restart policy
      <X>: <n>[,<sched>] / Implicit: 5
        <n> : Maximal number of global restarts (0=disable)
     <sched>: Restart schedule [x,100,1.5] (<type {F|L|x|+}>)

  --distribute=<arg>|no   : Configure nogood distribution [conflict,4]
      <arg>: <type>[,<lbd {0..127}>][,<size>]
        <type> : Distribute {all|short|conflict|loop} nogoods
        <lbd>  : Distribute only if LBD  <= <lbd>  [4]
        <size> : Distribute only if size <= <size> [-1]
  --integrate=<arg>       : Configure nogood integration [gp]
      <arg>: <pick>[,<n>][,<topo>]
        <pick>: Add {all|unsat|gp(unsat wrt guiding path)|active} nogoods
        <n>   : Always keep at least last <n> integrated nogoods   [1024]
        <topo>: Accept nogoods from {all|ring|cube|cubex} peers    [all]

  --enum-mode,-e <arg>    : Configure enumeration algorithm [auto]
      <arg>: {bt|record|brave|cautious|auto}
        bt      : Backtrack decision literals from solutions
        record  : Add nogoods for computed solutions
        brave   : Compute brave consequences (union of models)
        cautious: Compute cautious consequences (intersection of models)
        auto    : Use bt for enumeration and record for optimization
  --opt-mode=<arg>        : Configure optimization algorithm
      <arg>: {opt|enum|optN|ignore}
        opt   : Find optimal model
        enum  : Find models with costs <= initial bound
        optN  : Find optimum, then enumerate optimal models
        ignore: Ignore optimize statements
  --opt-bound=<opt>...|no : Initialize objective function(s)
  --opt-sat               : Treat DIMACS input as MaxSAT optimization problem
  --project[=<arg>]       : Project models to named atoms
  --number,-n <n>         : Compute at most <n> models (0 for all)


Clasp.ASP Options:

  --supp-models           : Compute supported models (no unfounded set check)
  --eq=<n>                : Configure equivalence preprocessing
      Run for at most <n> iterations (-1=run to fixpoint)
  --[no-]backprop         : Use backpropagation in ASP-preprocessing
  --no-gamma              : Do not add gamma rules for non-hcf disjunctions
  --eq-dfs                : Enable df-order in eq-preprocessing
  --trans-ext=<arg>|no    : Configure handling of Lparse-like extended rules
      <arg>: {all|choice|card|weight|integ|dynamic}
        all    : Transform all extended rules to basic rules
        choice : Transform choice rules, but keep cardinality and weight rules
        card   : Transform cardinality rules, but keep choice and weight rules
        weight : Transform cardinality and weight rules, but keep choice rules
        scc    : Transform "recursive" cardinality and weight rules
        integ  : Transform cardinality integrity constraints
        dynamic: Transform "simple" extended rules, but keep more complex ones

Clasp.Search Options:

  --restart-on-model      : Restart after each model
  --lookahead[=<arg>|no]  : Configure failed-literal detection (fld)
      <arg>: <type>[,<n {1..umax}>] / Implicit: atom
        <type>: Run fld via {atom|body|hybrid} lookahead
        <n>   : Disable fld after <n> applications ([-1]=no limit)
      --lookahead=atom is default if --no-lookback is used
  --heuristic=<arg>       : Configure decision heuristic
      <arg>: {Berkmin|Vmtf|Vsids|Domain|Unit|None}
        Berkmin: Apply BerkMin-like heuristic
        Vmtf   : Apply Siege-like heuristic
        Vsids  : Apply Chaff-like heuristic
        Domain : Apply domain knowledge to Vsids-like heuristic
        Unit   : Apply Smodels-like heuristic (Default if --no-lookback)
        None   : Select the first free variable
  --hparam=<n>            : Pass <n> as init parameter to heuristic
     Aliases: --berk-max, --vmtf-mtf, --vsids-decay
       --berk-max   : Consider at most <n> nogoods in Berkmin  [no limit]
       --vmtf-mtf   : Move <n> conflict-literals to the front in Vmtf [8]
       --vsids-decay: Use 1.0/0.<n> as decay factor in Vsids/Domain   [95]
  --[no-]init-moms        : Initialize heuristic with MOMS-score
  --score-other=<n>       : Score {0=no|1=loop|2=all} other learnt nogoods
  --sign-def=<n>          : Default sign: {0=asp|1=no|2=yes|3=rnd|4=disj}
  --[no-]sign-fix         : Disable sign heuristics and use default signs only
  --[no-]berk-huang       : Enable/Disable Huang-scoring in Berkmin
  --[no-]berk-once        : Score sets (instead of multisets) in Berkmin
  --[no-]nant             : In Unit count only atoms in NAnt(P)
  --dom-pref=<bitmask>    : Prefer {1=atom|2=scc|4=hcc|8=disj|16=min|32=show}
  --dom-mod={0..6}        : Use {1=level|2=sign+|3=true|4=sign-|5=false|6=min}
  --opt-heuristic[={0..3}]: Use opt. in {1=sign|2=model|3=both} heuristics
  --opt-strategy[={0..5}] : Configure optimization strategy
    Use:
      0: default branch and bound
      1: hierarchical branch and bound
      2: hierarchical with exponentially increasing steps
      3: hierarchical with exponentially decreasing steps
      4: unsatisfiable-core based optimization
      5: unsatisfiable-core based optimization with preprocessing

  --save-progress[=<n>]   : Use RSat-like progress saving on backjumps > <n>
  --init-watches={0..2}   : Configure watched literal initialization [1]
      Watch {0=first|1=random|2=least watched} literals in nogoods
  --update-mode=<arg>     : Process messages on {0=propagation|1=conflict)
  --seed=<n>              : Set random number generator's seed to <n>
  --partial-check[=<arg>] : Configure partial stability tests
      <arg>: <p>[,<h>][,<x>] / Implicit: 50
        <p>: Partial check percentage
        <h>: Initial value for high bound (0 = umax)
        <x>: Increase (1) or keep (0) high bound once reached
  --rand-freq=<p>         : Make random decisions with probability <p>
  --rand-prob[=<arg>|no]  : Configure random probing (Implicit: 10,100)
      <arg>: <n1>[,<n2>]
        Run <n1> random passes with at most <n2> conflicts each

Clasp.Lookback Options:

  --no-lookback           : Disable all lookback strategies

  --forget-on-step=<bits> : Configure forgetting on (incremental) step
      Discard {1=heuristic|2=nogood scores|4=learnt nogoods}

  --strengthen=<arg>|no   : Use MiniSAT-like conflict nogood strengthening
      <arg>: <mode>[,<type>]
        <mode>: Use {local|recursive} self-subsumption check
        <type>: Follow {0=all|1=short|2=binary} antecedents  [0]
  --otfs[={0..2}]         : Enable {1=partial|2=full} on-the-fly subsumption
  --update-lbd[={0..3}]   : Update LBDs of learnt nogoods {1=<|2=strict<|3=+1<}
  --update-act            : Enable LBD-based activity bumping
  --reverse-arcs[={0..3}] : Enable ManySAT-like inverse-arc learning
  --contraction=<arg>|no  : Configure handling of long learnt nogoods
      <arg>: <n>[,<rep>]
        <n>  : Contract nogoods if size > <n> (0=disable)
        <rep>: Replace literal blocks with {1=decisions|2=uips} ([0]=disable)

  --loops=<arg>           : Configure learning of loop nogoods
      <arg>: {common|distinct|shared|no}
        common  : Create loop nogoods for atoms in an unfounded set
        distinct: Create distinct loop nogood for each atom in an unfounded set
        shared  : Create loop formula for a whole unfounded set
        no      : Do not learn loop formulas
  --restarts,-r <sched>|no: Configure restart policy
      <sched>: <type {D|F|L|x|+}>,<n {1..umax}>[,<args>][,<lim>]
        F,<n>    : Run fixed sequence of <n> conflicts
        L,<n>    : Run Luby et al.'s sequence with unit length <n>
        x,<n>,<f>: Run geometric seq. of <n>*(<f>^i) conflicts  (<f> >= 1.0)
        +,<n>,<m>: Run arithmetic seq. of <n>+(<m>*i) conflicts (<m {0..umax}>)
        ...,<lim>: Repeat seq. every <lim>+j restarts           (<type> != F)
        D,<n>,<f>: Restart based on moving LBD average over last <n> conflicts
                   Mavg(<n>,LBD)*<f> > avg(LBD)
                   use conflict level average if <lim> > 0 and avg(LBD) > <lim>
      no|0       : Disable restarts
  --reset-restarts[=0..2] : {0=Keep|1=Reset|2=Disable} restart seq. after model
  --local-restarts        : Use Ryvchin et al.'s local restarts
  --counter-restarts=<n>  : Do a counter implication restart every <n> restarts
  --counter-bump=<n>      : Set CIR bump factor to <n>
  --shuffle=<n1>,<n2>|no  : Shuffle problem after <n1>+(<n2>*i) restarts

  --deletion,-d <arg>|no  : Configure deletion algorithm [basic,75,0]
      <arg>: <algo>[,<n {1..100}>][,<sc>]
        <algo>: Use {basic|sort|ipSort|ipHeap} algorithm
        <n>   : Delete at most <n>% of nogoods on reduction    [75]
        <sc>  : Use {0=activity|1=lbd|2=combined} nogood scores [0]
      no      : Disable nogood deletion
  --del-grow=<arg>|no     : Configure size-based deletion policy
      <arg>: <f>[,<g>][,<sched>] (<f> >= 1.0)
        <f>     : Keep at most T = X*(<f>^i) learnt nogoods with X being the
                  initial limit and i the number of times <sched> fired
        <g>     : Stop growth once T > P*<g> (0=no limit)      [3.0]
        <sched> : Set grow schedule (<type {F|L|x|+}>) [grow on restart]
  --del-cfl=<sched>|no    : Configure conflict-based deletion policy
      <sched>:   <type {F|L|x|+}>,<args>... (see restarts)
  --del-init=<arg>        : Configure initial deletion limit
      <arg>: <f>[,<n>,<o>] (<f> > 0)
        <f>    : Set initial limit to P=estimated problem size/<f> [3.0]
        <n>,<o>: Clamp initial limit to the range [<n>,<n>+<o>]
  --del-estimate[=0..3]   : Use estimated problem complexity in limits
  --del-max=<n>,<X>       : Keep at most <n> learnt nogoods taking up to <X> MB
  --del-glue=<arg>        : Configure glue clause handling
      <arg>: <n {0..127}>[,<m {0|1}>]
        <n>: Do not delete nogoods with LBD <= <n>
        <m>: Count (0) or ignore (1) glue clauses in size limit [0]
  --del-on-restart[=<n>]  : Delete <n>% of learnt nogoods on each restart

Basic Options:

  --help[=<n>],-h         : Print {1=basic|2=more|3=full} help and exit
  --version,-v            : Print version information and exit
  --verbose[=<n>],-V      : Set verbosity level to <n>
  --time-limit=<n>        : Set time limit to <n> seconds (0=no limit)
  --fast-exit             : Force fast exit (do not call dtors)
  --quiet[=<levels>],-q   : Configure printing of models, costs, and calls
      <levels>: <mod>[,<opt>][,<call>]
        <mod> : print {0=all|1=last|2=no} models
        <cost>: print {0=all|1=last|2=no} optimize values [<m>]
        <call>: print {0=all|1=last|2=no} call steps      [2]
  --pre                   : Run preprocessing and exit
  --print-portfolio       : Print default portfolio and exit
  --outf=<n>              : Use {0=default|1=competition|2=JSON|3=no} output
  --out-atomf=<arg>       : Set atom format string (<Pre>?%s<Post>?)
  --out-ifs=<arg>         : Set internal field separator
  --out-hide-aux          : Hide auxiliary atoms in answers
  --lemma-out=<file>      : Write learnt lemmas to <file> on exit
  --lemma-out-lbd=<n>     : Only write lemmas with lbd <= <n>
  --lemma-in=<file>       : Read additional lemmas from <file>
  --lemma-in-lbd=<n>      : Initialize lbd of additional lemmas to <n>
  --hcc-out=<file>        : Write non-hcf programs to <file>.#scc
  --file,-f <arg>         : Input files

usage: clasp [number] [options] [file]
Default command-line:
clasp --configuration=auto --share=auto --distribute=conflict,4 --integrate=gp 
      --enum-mode=auto --init-watches=1 --deletion=basic,75,0 --del-init=3.0 
      --verbose=1 
[asp] --configuration=tweety
[cnf] --configuration=trendy
[opb] --configuration=trendy

Default configurations:
[tweety]:
 --eq=3 --trans-ext=dynamic --del-max=2000000 --strengthen=recursive,0 --otfs=2
 --heuristic=Vsids --vsids-decay=92 --init-moms --score-other=2
 --deletion=basic,50,0 --del-cfl=+,2000,100,20 --del-grow=0 --del-glue=2,0
 --update-lbd=1 --del-estimate=1 --save-progress=160 --init-watches=2
 --restarts=L,60 --local-restarts --loops=shared
[trendy]:
 --sat-p=20,25,240,-1,1 --trans-ext=dynamic --heuristic=Vsids
 --restarts=D,100,0.7 --deletion=basic,50,0 --del-init=3.0,500,19500
 --del-grow=1.1,20.0,x,100,1.5 --del-cfl=+,10000,2000 --del-glue=2
 --strengthen=recursive --update-lbd --otfs=2 --save-p=75 --counter-restarts=3
 --counter-bump=1023 --reverse-arcs=2  --contraction=250 --loops=common
 --opt-heu=1 --opt-strat=5
[frumpy]:
 --eq=5 --heuristic=Berkmin --restarts=x,100,1.5 --deletion=basic,75
 --del-init=3.0,200,40000 --del-max=400000 --contraction=250 --loops=common
 --save-p=180 --del-grow=1.1 --strengthen=local --sign-def=4
[crafty]:
 --sat-p=10,25,240,-1,1 --trans-ext=dynamic --backprop --save-p=180
 --heuristic=Vsids --restarts=x,128,1.5 --deletion=basic,75,0
 --del-init=10.0,1000,9000 --del-grow=1.1,20.0 --del-cfl=+,10000,1000
 --del-glue=2 --otfs=2 --reverse-arcs=1 --counter-restarts=3 --contraction=250
 --opt-heu=1 --opt-strat=1
[jumpy]:
 --sat-p=20,25,240,-1,1 --trans-ext=dynamic --heuristic=Vsids --restarts=L,100
 --deletion=basic,75,2 --del-init=3.0,1000,20000 --del-grow=1.1,25,x,100,1.5
 --del-cfl=x,10000,1.1 --del-glue=2 --update-lbd=3 --strengthen=recursive
 --otfs=2 --save-p=70 --opt-heu=3 --opt-strat=2
[handy]:
 --sat-p=10,25,240,-1,1 --trans-ext=dynamic --backprop --heuristic=Vsids
 --restarts=D,100,0.7 --deletion=sort,50,2 --del-max=200000
 --del-init=20.0,1000,14000 --del-cfl=+,4000,600 --del-glue=2 --update-lbd
 --strengthen=recursive --otfs=2 --save-p=20 --contraction=600 --loops=distinct
 --counter-restarts=7 --counter-bump=1023 --reverse-arcs=2

clasp is part of Potassco: http://potassco.sourceforge.net/#clasp
Get help/report bugs via : http://sourceforge.net/projects/potassco/support
