module Config:configuration for a derivationsig..end
typeliteral =Term.literal
typeflags =Flags.flags
typeproblem =Problem.problem
type config
val create : flags:flags ->
problem:problem ->
is_horn:bool -> start_time:float -> fof:bool -> theorem:bool -> configcreate ~flags ~horn ~equality ~start_time ~fof ~theorem
creates a new configuration initialized with flags.
The problem is considered to be Horn, if is-horn is true,
to contain equality predicates, if contains_equality is true.
The time (wall clock) when the derivation was started is given with start_time
fof states that the problem is formulated with first-order formulas,
theorem that it also contains a conjecture.val start_time : config -> floatval is_horn : config -> boolval is_fof : config -> boolval is_theorem : config -> boolval problem : config -> problemFlags.val resolve : config -> boolval subsume : config -> boolval compact : config -> boolval productivity : config -> boolval mixed_literals : config -> boolval finite_domain : config -> boolval finite_domain_functionality : config -> boole.g, for domain size 3 and the binary function symbol f add:
f(x, y) != 1 \/ f(x, y) != 2
f(x, y) != 2 \/ f(x, y) != 1
f(x, y) != 1 \/ f(x, y) != 3
f(x, y) != 3 \/ f(x, y) != 1
f(x, y) != 2 \/ f(x, y) != 3
f(x, y) != 3 \/ f(x, y) != 2
which in essence is for all domain different elements d, d':
f(x, y) = d => f(x, y) != d'
val lemma : config -> Flags.opt_lemmaval lemma_min : config -> intlemma_min lemmas.val lemma_max : config -> intlemma_max lemmas.val lemma_uip : config -> boolLemma.val lemma_parametric_assert : config -> intval equality : config -> Flags.opt_equalityval plus_v : config -> boolval default_v : config -> literalConfig.plus_v.val backtracking : config -> Flags.opt_backtrackingval iterative_deepening : config -> Flags.opt_iterative_deepeningval deepening_bound : config -> intBound.bound.val lookahead_exceeding : config -> boolval restart : config -> Flags.opt_restartval jumping : config -> boolJumping.val neg_assert_candidates : config -> Flags.opt_neg_assert_candidatesval term_indexing : config -> boolval problem_file_name : config -> stringval time_out_CPU : config -> floatval time_out_WC : config -> floatval print_level : config -> intval print_configuration : config -> boolval print_equality_axioms : config -> boolval print_lemmas : config -> boolval print_finite_domain_axioms : config -> boolFinite_domain).val print_finite_domain_problem : config -> Flags.opt_print_fd_problemFinite_domain).val print_statistics : config -> boolval print_model_context : config -> boolval print_model_context_file : config -> stringConfig.print_model_context,
but to the file with the given name.val print_model_DIG : config -> boolval print_model_DIG_file : config -> stringConfig.print_model_DIG,
but to the file with the given name.val print_model_finite : config -> boolval print_model_tptp : config -> boolval print_model_tptp_file : config -> stringConfig.print_model_tptp,
but to the file with the given name.val print_derivation_online : config -> boolval print_derivation_context_unifier : config -> boolval print_assert_candidates : config -> boolval print_split_candidates : config -> boolval print : config -> unitPrint.print_label).