46 void        proof_create_final_unirons_path(
skeleton_glb& skg, ch_string end_dir_pth);
    50 ch_string proof_add_paths(ch_string pth1, ch_string pth2);
    51 ch_string proof_get_nmp_proof_path(
neuromap& the_nmp);
    52 ch_string proof_get_tk_dir_path(ch_string pth_pref, proof_tk& pf_tk);
    53 ch_string proof_get_tk_file_name(proof_tk& pf_tk);
    54 ch_string proof_get_tk_html_file_name(proof_tk& pf_tk);
    56 void proof_do_res_step(
brain& brn, row_quanton_t& curr_res, 
prop_signal& curr_ps);
    58 long proof_get_trace_idx_of(
deduction& dct, 
long to_wrt_idx);
    59 void proof_write_all_json_files_for(
deduction& dct);
    60 void proof_write_json_file_for(
deduction& dct, 
long to_wrt_idx, 
long prv_wrt_idx);
    61 void proof_append_ps(
brain& brn, row<char>& json_str, 
prop_signal& the_sig, 
bool& is_fst_ps, 
    62             ch_string& pth_pref, proof_tk& pf_tk, row<ch_string>& all_to_move);
    63 void proof_append_uniron(row<char>& json_str, 
prop_signal& the_sig, 
bool& is_fst_ps, 
    64             row<ch_string>& all_to_move);
    65 void proof_append_neu_lits(
brain& brn, row<char>& json_str, row_quanton_t& all_quas);
    66 void proof_append_lits(
brain& brn, row<char>& json_str, row_quanton_t& all_quas);
    67 void proof_append_neu(
brain& brn, row<char>& json_str, 
neuron* neu, 
    68             ch_string& pth_pref, proof_tk& pf_tk, row<ch_string>& all_to_move);
    69 void proof_append_qua(row<char>& json_str, 
quanton* qua);
    73 void proof_write_permutation(row<char>& json_str, 
neuromap& nmp);
    74 void proof_write_ref_bj_proof_for(row<char>& json_str, 
deduction& dct);
    75 void proof_write_bj_proof_for(
neuromap& nmp, proof_tk& pf_tk);
    77 void proof_move_all_to_mv(
deduction& dct, ch_string& pf_dir_pth, 
    78                           row<ch_string>& all_to_move, proof_tk& pf_tk);
    80 void proof_write_top_html_file(ch_string the_pth);
    82 bool is_ptk_equal(proof_tk& tk1, proof_tk& tk2);
    98     proof_tk(ticket& tk, 
long w_idx = INVALID_IDX){
   102     void    init_with(ticket& tk, 
long w_idx = INVALID_IDX){
   107     void    init_proof_tk(){
   108         pt_brn_tk.init_ticket();
   109         pt_wrt_idx = INVALID_IDX;
   112     brain*  get_dbg_brn(){
   116     solver* get_dbg_slv(){
   120     bool    is_ptk_virgin(){
   121         bool c1 = pt_brn_tk.is_tk_virgin();
   122         bool c2 = (pt_wrt_idx == INVALID_IDX);
   132 #endif      // PROOF_FUNCS_H Class that holds all data used to solve a particular CNF instance. 
Definition: brain.h:3085
 
Class for CNF variables (each variable has a positon and a negaton). 
Definition: brain.h:600
 
Class that holds the result of analyzing (doing resolution) of a conflict. 
Definition: brain.h:1715
 
Declarations of classes and that implement the solver's core functionality. 
 
A neuromap is a CNF sub-formula. 
Definition: brain.h:2191
 
Class for representing BCP propagation data. 
Definition: brain.h:1525
 
A skeleton_glb is a directory holding a database. 
Definition: skeleton.h:761
 
Class for CNF clause behavior. So there is one neuron per clause. 
Definition: brain.h:1211