TSTP Solution File: NLP023-10 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP023-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 02:38:39 EDT 2022
% Result : Unknown 1.67s 2.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NLP023-10 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 1 05:53:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.40 % Orientation found
% 0.12/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_81ce6b.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_d711bc | grep -v "SZS"
% 0.18/0.42
% 0.18/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.18/0.42
% 0.18/0.42 %
% 0.18/0.42 % ------ iProver source info
% 0.18/0.42
% 0.18/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.18/0.42 % git: non_committed_changes: true
% 0.18/0.42 % git: last_make_outside_of_git: true
% 0.18/0.42
% 0.18/0.42 %
% 0.18/0.42 % ------ Input Options
% 0.18/0.42
% 0.18/0.42 % --out_options all
% 0.18/0.42 % --tptp_safe_out true
% 0.18/0.42 % --problem_path ""
% 0.18/0.42 % --include_path ""
% 0.18/0.42 % --clausifier .//eprover
% 0.18/0.42 % --clausifier_options --tstp-format
% 0.18/0.42 % --stdin false
% 0.18/0.42 % --dbg_backtrace false
% 0.18/0.42 % --dbg_dump_prop_clauses false
% 0.18/0.42 % --dbg_dump_prop_clauses_file -
% 0.18/0.42 % --dbg_out_stat false
% 0.18/0.42
% 0.18/0.42 % ------ General Options
% 0.18/0.42
% 0.18/0.42 % --fof false
% 0.18/0.42 % --time_out_real 150.
% 0.18/0.42 % --time_out_prep_mult 0.2
% 0.18/0.42 % --time_out_virtual -1.
% 0.18/0.42 % --schedule none
% 0.18/0.42 % --ground_splitting input
% 0.18/0.42 % --splitting_nvd 16
% 0.18/0.42 % --non_eq_to_eq false
% 0.18/0.42 % --prep_gs_sim true
% 0.18/0.42 % --prep_unflatten false
% 0.18/0.42 % --prep_res_sim true
% 0.18/0.42 % --prep_upred true
% 0.18/0.42 % --res_sim_input true
% 0.18/0.42 % --clause_weak_htbl true
% 0.18/0.42 % --gc_record_bc_elim false
% 0.18/0.42 % --symbol_type_check false
% 0.18/0.42 % --clausify_out false
% 0.18/0.42 % --large_theory_mode false
% 0.18/0.42 % --prep_sem_filter none
% 0.18/0.42 % --prep_sem_filter_out false
% 0.18/0.42 % --preprocessed_out false
% 0.18/0.42 % --sub_typing false
% 0.18/0.42 % --brand_transform false
% 0.18/0.42 % --pure_diseq_elim true
% 0.18/0.42 % --min_unsat_core false
% 0.18/0.42 % --pred_elim true
% 0.18/0.42 % --add_important_lit false
% 0.18/0.42 % --soft_assumptions false
% 0.18/0.42 % --reset_solvers false
% 0.18/0.42 % --bc_imp_inh []
% 0.18/0.42 % --conj_cone_tolerance 1.5
% 0.18/0.42 % --prolific_symb_bound 500
% 0.18/0.42 % --lt_threshold 2000
% 0.18/0.42
% 0.18/0.42 % ------ SAT Options
% 0.18/0.42
% 0.18/0.42 % --sat_mode false
% 0.18/0.42 % --sat_fm_restart_options ""
% 0.18/0.42 % --sat_gr_def false
% 0.18/0.42 % --sat_epr_types true
% 0.18/0.42 % --sat_non_cyclic_types false
% 0.18/0.42 % --sat_finite_models false
% 0.18/0.42 % --sat_fm_lemmas false
% 0.18/0.42 % --sat_fm_prep false
% 0.18/0.42 % --sat_fm_uc_incr true
% 0.18/0.42 % --sat_out_model small
% 0.18/0.42 % --sat_out_clauses false
% 0.18/0.42
% 0.18/0.42 % ------ QBF Options
% 0.18/0.42
% 0.18/0.42 % --qbf_mode false
% 0.18/0.42 % --qbf_elim_univ true
% 0.18/0.42 % --qbf_sk_in true
% 0.18/0.42 % --qbf_pred_elim true
% 0.18/0.42 % --qbf_split 32
% 0.18/0.42
% 0.18/0.42 % ------ BMC1 Options
% 0.18/0.42
% 0.18/0.42 % --bmc1_incremental false
% 0.18/0.42 % --bmc1_axioms reachable_all
% 0.18/0.42 % --bmc1_min_bound 0
% 0.18/0.42 % --bmc1_max_bound -1
% 0.18/0.42 % --bmc1_max_bound_default -1
% 0.18/0.42 % --bmc1_symbol_reachability true
% 0.18/0.42 % --bmc1_property_lemmas false
% 0.18/0.42 % --bmc1_k_induction false
% 0.18/0.42 % --bmc1_non_equiv_states false
% 0.18/0.42 % --bmc1_deadlock false
% 0.18/0.42 % --bmc1_ucm false
% 0.18/0.42 % --bmc1_add_unsat_core none
% 0.18/0.42 % --bmc1_unsat_core_children false
% 0.18/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.42 % --bmc1_out_stat full
% 0.18/0.42 % --bmc1_ground_init false
% 0.18/0.42 % --bmc1_pre_inst_next_state false
% 0.18/0.42 % --bmc1_pre_inst_state false
% 0.18/0.42 % --bmc1_pre_inst_reach_state false
% 0.18/0.42 % --bmc1_out_unsat_core false
% 0.18/0.42 % --bmc1_aig_witness_out false
% 0.18/0.42 % --bmc1_verbose false
% 0.18/0.42 % --bmc1_dump_clauses_tptp false
% 0.88/1.16 % --bmc1_dump_unsat_core_tptp false
% 0.88/1.16 % --bmc1_dump_file -
% 0.88/1.16 % --bmc1_ucm_expand_uc_limit 128
% 0.88/1.16 % --bmc1_ucm_n_expand_iterations 6
% 0.88/1.16 % --bmc1_ucm_extend_mode 1
% 0.88/1.16 % --bmc1_ucm_init_mode 2
% 0.88/1.16 % --bmc1_ucm_cone_mode none
% 0.88/1.16 % --bmc1_ucm_reduced_relation_type 0
% 0.88/1.16 % --bmc1_ucm_relax_model 4
% 0.88/1.16 % --bmc1_ucm_full_tr_after_sat true
% 0.88/1.16 % --bmc1_ucm_expand_neg_assumptions false
% 0.88/1.16 % --bmc1_ucm_layered_model none
% 0.88/1.16 % --bmc1_ucm_max_lemma_size 10
% 0.88/1.16
% 0.88/1.16 % ------ AIG Options
% 0.88/1.16
% 0.88/1.16 % --aig_mode false
% 0.88/1.16
% 0.88/1.16 % ------ Instantiation Options
% 0.88/1.16
% 0.88/1.16 % --instantiation_flag true
% 0.88/1.16 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.88/1.16 % --inst_solver_per_active 750
% 0.88/1.16 % --inst_solver_calls_frac 0.5
% 0.88/1.16 % --inst_passive_queue_type priority_queues
% 0.88/1.16 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.88/1.16 % --inst_passive_queues_freq [25;2]
% 0.88/1.16 % --inst_dismatching true
% 0.88/1.16 % --inst_eager_unprocessed_to_passive true
% 0.88/1.16 % --inst_prop_sim_given true
% 0.88/1.16 % --inst_prop_sim_new false
% 0.88/1.16 % --inst_orphan_elimination true
% 0.88/1.16 % --inst_learning_loop_flag true
% 0.88/1.16 % --inst_learning_start 3000
% 0.88/1.16 % --inst_learning_factor 2
% 0.88/1.16 % --inst_start_prop_sim_after_learn 3
% 0.88/1.16 % --inst_sel_renew solver
% 0.88/1.16 % --inst_lit_activity_flag true
% 0.88/1.16 % --inst_out_proof true
% 0.88/1.16
% 0.88/1.16 % ------ Resolution Options
% 0.88/1.16
% 0.88/1.16 % --resolution_flag true
% 0.88/1.16 % --res_lit_sel kbo_max
% 0.88/1.16 % --res_to_prop_solver none
% 0.88/1.16 % --res_prop_simpl_new false
% 0.88/1.16 % --res_prop_simpl_given false
% 0.88/1.16 % --res_passive_queue_type priority_queues
% 0.88/1.16 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.88/1.16 % --res_passive_queues_freq [15;5]
% 0.88/1.16 % --res_forward_subs full
% 0.88/1.16 % --res_backward_subs full
% 0.88/1.16 % --res_forward_subs_resolution true
% 0.88/1.16 % --res_backward_subs_resolution true
% 0.88/1.16 % --res_orphan_elimination false
% 0.88/1.16 % --res_time_limit 1000.
% 0.88/1.16 % --res_out_proof true
% 0.88/1.16 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_81ce6b.s
% 0.88/1.16 % --modulo true
% 0.88/1.16
% 0.88/1.16 % ------ Combination Options
% 0.88/1.16
% 0.88/1.16 % --comb_res_mult 1000
% 0.88/1.16 % --comb_inst_mult 300
% 0.88/1.16 % ------
% 0.88/1.16
% 0.88/1.16 % ------ Parsing...% successful
% 0.88/1.16
% 0.88/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.88/1.16
% 0.88/1.16 % ------ Proving...
% 0.88/1.16 % ------ Problem Properties
% 0.88/1.16
% 0.88/1.16 %
% 0.88/1.16 % EPR false
% 0.88/1.16 % Horn true
% 0.88/1.16 % Has equality true
% 0.88/1.16
% 0.88/1.16 % % ------ Input Options Time Limit: Unbounded
% 0.88/1.16
% 0.88/1.16
% 0.88/1.16 Compiling...
% 0.88/1.16 Loading plugin: done.
% 0.88/1.16 % % ------ Current options:
% 0.88/1.16
% 0.88/1.16 % ------ Input Options
% 0.88/1.16
% 0.88/1.16 % --out_options all
% 0.88/1.16 % --tptp_safe_out true
% 0.88/1.16 % --problem_path ""
% 0.88/1.16 % --include_path ""
% 0.88/1.16 % --clausifier .//eprover
% 0.88/1.16 % --clausifier_options --tstp-format
% 0.88/1.16 % --stdin false
% 0.88/1.16 % --dbg_backtrace false
% 0.88/1.16 % --dbg_dump_prop_clauses false
% 0.88/1.16 % --dbg_dump_prop_clauses_file -
% 0.88/1.16 % --dbg_out_stat false
% 0.88/1.16
% 0.88/1.16 % ------ General Options
% 0.88/1.16
% 0.88/1.16 % --fof false
% 0.88/1.16 % --time_out_real 150.
% 0.88/1.16 % --time_out_prep_mult 0.2
% 0.88/1.16 % --time_out_virtual -1.
% 0.88/1.16 % --schedule none
% 0.88/1.16 % --ground_splitting input
% 0.88/1.16 % --splitting_nvd 16
% 0.88/1.16 % --non_eq_to_eq false
% 0.88/1.16 % --prep_gs_sim true
% 0.88/1.16 % --prep_unflatten false
% 0.88/1.16 % --prep_res_sim true
% 0.88/1.16 % --prep_upred true
% 0.88/1.16 % --res_sim_input true
% 0.88/1.16 % --clause_weak_htbl true
% 0.88/1.16 % --gc_record_bc_elim false
% 0.88/1.16 % --symbol_type_check false
% 0.88/1.16 % --clausify_out false
% 0.88/1.16 % --large_theory_mode false
% 0.88/1.16 % --prep_sem_filter none
% 0.88/1.16 % --prep_sem_filter_out false
% 0.88/1.16 % --preprocessed_out false
% 0.88/1.16 % --sub_typing false
% 0.88/1.16 % --brand_transform false
% 0.88/1.16 % --pure_diseq_elim true
% 0.88/1.16 % --min_unsat_core false
% 0.88/1.16 % --pred_elim true
% 0.88/1.16 % --add_important_lit false
% 0.88/1.16 % --soft_assumptions false
% 0.88/1.16 % --reset_solvers false
% 0.88/1.16 % --bc_imp_inh []
% 0.88/1.16 % --conj_cone_tolerance 1.5
% 0.88/1.16 % --prolific_symb_bound 500
% 0.88/1.16 % --lt_threshold 2000
% 0.88/1.16
% 0.88/1.16 % ------ SAT Options
% 0.88/1.16
% 0.88/1.16 % --sat_mode false
% 0.88/1.16 % --sat_fm_restart_options ""
% 0.88/1.16 % --sat_gr_def false
% 0.88/1.16 % --sat_epr_types true
% 0.88/1.16 % --sat_non_cyclic_types false
% 0.88/1.16 % --sat_finite_models false
% 0.88/1.16 % --sat_fm_lemmas false
% 0.88/1.16 % --sat_fm_prep false
% 0.88/1.16 % --sat_fm_uc_incr true
% 0.88/1.16 % --sat_out_model small
% 0.88/1.16 % --sat_out_clauses false
% 0.88/1.16
% 0.88/1.16 % ------ QBF Options
% 0.88/1.16
% 0.88/1.16 % --qbf_mode false
% 0.88/1.16 % --qbf_elim_univ true
% 0.88/1.16 % --qbf_sk_in true
% 0.88/1.16 % --qbf_pred_elim true
% 0.88/1.16 % --qbf_split 32
% 0.88/1.16
% 0.88/1.16 % ------ BMC1 Options
% 0.88/1.16
% 0.88/1.16 % --bmc1_incremental false
% 0.88/1.16 % --bmc1_axioms reachable_all
% 0.88/1.16 % --bmc1_min_bound 0
% 0.88/1.16 % --bmc1_max_bound -1
% 0.88/1.16 % --bmc1_max_bound_default -1
% 0.88/1.16 % --bmc1_symbol_reachability true
% 0.88/1.16 % --bmc1_property_lemmas false
% 0.88/1.16 % --bmc1_k_induction false
% 0.88/1.16 % --bmc1_non_equiv_states false
% 0.88/1.16 % --bmc1_deadlock false
% 0.88/1.16 % --bmc1_ucm false
% 0.88/1.16 % --bmc1_add_unsat_core none
% 0.88/1.16 % --bmc1_unsat_core_children false
% 0.88/1.16 % --bmc1_unsat_core_extrapolate_axioms false
% 0.88/1.16 % --bmc1_out_stat full
% 0.88/1.16 % --bmc1_ground_init false
% 0.88/1.16 % --bmc1_pre_inst_next_state false
% 0.88/1.16 % --bmc1_pre_inst_state false
% 0.88/1.16 % --bmc1_pre_inst_reach_state false
% 0.88/1.16 % --bmc1_out_unsat_core false
% 0.88/1.16 % --bmc1_aig_witness_out false
% 0.88/1.16 % --bmc1_verbose false
% 0.88/1.16 % --bmc1_dump_clauses_tptp false
% 0.88/1.16 % --bmc1_dump_unsat_core_tptp false
% 0.88/1.16 % --bmc1_dump_file -
% 0.88/1.16 % --bmc1_ucm_expand_uc_limit 128
% 0.88/1.16 % --bmc1_ucm_n_expand_iterations 6
% 0.88/1.16 % --bmc1_ucm_extend_mode 1
% 0.88/1.16 % --bmc1_ucm_init_mode 2
% 0.88/1.16 % --bmc1_ucm_cone_mode none
% 0.88/1.16 % --bmc1_ucm_reduced_relation_type 0
% 0.88/1.16 % --bmc1_ucm_relax_model 4
% 0.88/1.16 % --bmc1_ucm_full_tr_after_sat true
% 0.88/1.16 % --bmc1_ucm_expand_neg_assumptions false
% 0.88/1.16 % --bmc1_ucm_layered_model none
% 0.88/1.16 % --bmc1_ucm_max_lemma_size 10
% 0.88/1.16
% 0.88/1.16 % ------ AIG Options
% 0.88/1.16
% 0.88/1.16 % --aig_mode false
% 0.88/1.16
% 0.88/1.16 % ------ Instantiation Options
% 0.88/1.16
% 0.88/1.16 % --instantiation_flag true
% 0.88/1.16 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.88/1.16 % --inst_solver_per_active 750
% 0.88/1.16 % --inst_solver_calls_frac 0.5
% 0.88/1.16 % --inst_passive_queue_type priority_queues
% 0.88/1.16 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.88/1.16 % --inst_passive_queues_freq [25;2]
% 0.88/1.16 % --inst_dismatching true
% 0.88/1.16 % --inst_eager_unprocessed_to_passive true
% 0.88/1.16 % --inst_prop_sim_given true
% 0.88/1.16 % --inst_prop_sim_new false
% 0.88/1.16 % --inst_orphan_elimination true
% 0.88/1.16 % --inst_learning_loop_flag true
% 0.88/1.16 % --inst_learning_start 3000
% 0.88/1.16 % --inst_learning_factor 2
% 0.88/1.16 % --inst_start_prop_sim_after_learn 3
% 0.88/1.16 % --inst_sel_renew solver
% 0.88/1.16 % --inst_lit_activity_flag true
% 0.88/1.16 % --inst_out_proof true
% 0.88/1.16
% 0.88/1.16 % ------ Resolution Options
% 0.88/1.16
% 0.88/1.16 % --resolution_flag true
% 0.88/1.16 % --res_lit_sel kbo_max
% 0.88/1.16 % --res_to_prop_solver none
% 0.88/1.16 % --res_prop_simpl_new false
% 0.88/1.16 % --res_prop_simpl_given false
% 0.88/1.16 % --res_passive_queue_type priority_queues
% 0.88/1.16 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.88/1.16 % --res_passive_queues_freq [15;5]
% 0.88/1.16 % --res_forward_subs full
% 0.88/1.16 % --res_backward_subs full
% 0.88/1.16 % --res_forward_subs_resolution true
% 0.88/1.16 % --res_backward_subs_resolution true
% 0.88/1.16 % --res_orphan_elimination false
% 0.88/1.16 % --res_time_limit 1000.
% 0.88/1.16 % --res_out_proof true
% 0.88/1.16 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_81ce6b.s
% 0.88/1.16 % --modulo true
% 0.88/1.16
% 0.88/1.16 % ------ Combination Options
% 0.88/1.16
% 0.88/1.16 % --comb_res_mult 1000
% 0.88/1.16 % --comb_inst_mult 300
% 0.88/1.16 % ------
% 0.88/1.16
% 0.88/1.16
% 0.88/1.16
% 0.88/1.16 % ------ Proving...
% 0.88/1.16 % warning: shown sat in sat incomplete mode
% 0.88/1.16 %
% 0.88/1.16
% 0.88/1.16
% 0.88/1.16
% 0.88/1.16
% 0.88/1.16 cnf(c_83,negated_conjecture,
% 0.88/1.16 ( actual_world(skc6) = true ),
% 0.88/1.16 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_78) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_182,negated_conjecture,
% 0.88/1.16 ( actual_world(skc6) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_83]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_231,negated_conjecture,
% 0.88/1.16 ( actual_world(skc6) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_182]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_232,negated_conjecture,
% 0.88/1.16 ( actual_world(skc6) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_231]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_251,negated_conjecture,
% 0.88/1.16 ( actual_world(skc6) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_232]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_422,negated_conjecture,
% 0.88/1.16 ( actual_world(skc6) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_251]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_82,negated_conjecture,
% 0.88/1.16 ( event(skc8,skc11) = true ),
% 0.88/1.16 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_77) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_180,negated_conjecture,
% 0.88/1.16 ( event(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_82]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_230,negated_conjecture,
% 0.88/1.16 ( event(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_180]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_233,negated_conjecture,
% 0.88/1.16 ( event(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_230]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_250,negated_conjecture,
% 0.88/1.16 ( event(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_233]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_420,negated_conjecture,
% 0.88/1.16 ( event(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_250]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_81,negated_conjecture,
% 0.88/1.16 ( woman(skc6,skc10) = true ),
% 0.88/1.16 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_76) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_178,negated_conjecture,
% 0.88/1.16 ( woman(skc6,skc10) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_81]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_229,negated_conjecture,
% 0.88/1.16 ( woman(skc6,skc10) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_178]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_234,negated_conjecture,
% 0.88/1.16 ( woman(skc6,skc10) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_229]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_249,negated_conjecture,
% 0.88/1.16 ( woman(skc6,skc10) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_234]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_418,negated_conjecture,
% 0.88/1.16 ( woman(skc6,skc10) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_249]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_80,negated_conjecture,
% 0.88/1.16 ( present(skc8,skc11) = true ),
% 0.88/1.16 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_75) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_176,negated_conjecture,
% 0.88/1.16 ( present(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_80]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_228,negated_conjecture,
% 0.88/1.16 ( present(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_176]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_235,negated_conjecture,
% 0.88/1.16 ( present(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_228]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_248,negated_conjecture,
% 0.88/1.16 ( present(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_235]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_416,negated_conjecture,
% 0.88/1.16 ( present(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_248]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_79,negated_conjecture,
% 0.88/1.16 ( dance(skc8,skc11) = true ),
% 0.88/1.16 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_74) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_174,negated_conjecture,
% 0.88/1.16 ( dance(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_79]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_227,negated_conjecture,
% 0.88/1.16 ( dance(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_174]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_236,negated_conjecture,
% 0.88/1.16 ( dance(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_227]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_263,negated_conjecture,
% 0.88/1.16 ( dance(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_236]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_446,negated_conjecture,
% 0.88/1.16 ( dance(skc8,skc11) = true ),
% 0.88/1.16 inference(copy,[status(esa)],[c_263]) ).
% 0.88/1.16
% 0.88/1.16 cnf(c_78,negated_conjecture,
% 0.88/1.16 ( forename(skc6,skc9) = true ),
% 0.88/1.16 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_73) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_172,negated_conjecture,
% 0.88/1.17 ( forename(skc6,skc9) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_78]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_226,negated_conjecture,
% 0.88/1.17 ( forename(skc6,skc9) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_172]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_237,negated_conjecture,
% 0.88/1.17 ( forename(skc6,skc9) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_226]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_262,negated_conjecture,
% 0.88/1.17 ( forename(skc6,skc9) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_237]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_444,negated_conjecture,
% 0.88/1.17 ( forename(skc6,skc9) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_262]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_77,negated_conjecture,
% 0.88/1.17 ( mia_forename(skc6,skc9) = true ),
% 0.88/1.17 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_72) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_170,negated_conjecture,
% 0.88/1.17 ( mia_forename(skc6,skc9) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_77]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_225,negated_conjecture,
% 0.88/1.17 ( mia_forename(skc6,skc9) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_170]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_238,negated_conjecture,
% 0.88/1.17 ( mia_forename(skc6,skc9) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_225]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_261,negated_conjecture,
% 0.88/1.17 ( mia_forename(skc6,skc9) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_238]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_442,negated_conjecture,
% 0.88/1.17 ( mia_forename(skc6,skc9) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_261]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_76,negated_conjecture,
% 0.88/1.17 ( proposition(skc6,skc8) = true ),
% 0.88/1.17 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_71) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_168,negated_conjecture,
% 0.88/1.17 ( proposition(skc6,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_76]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_224,negated_conjecture,
% 0.88/1.17 ( proposition(skc6,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_168]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_239,negated_conjecture,
% 0.88/1.17 ( proposition(skc6,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_224]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_260,negated_conjecture,
% 0.88/1.17 ( proposition(skc6,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_239]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_440,negated_conjecture,
% 0.88/1.17 ( proposition(skc6,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_260]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_75,negated_conjecture,
% 0.88/1.17 ( accessible_world(skc6,skc8) = true ),
% 0.88/1.17 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_70) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_166,negated_conjecture,
% 0.88/1.17 ( accessible_world(skc6,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_75]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_223,negated_conjecture,
% 0.88/1.17 ( accessible_world(skc6,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_166]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_240,negated_conjecture,
% 0.88/1.17 ( accessible_world(skc6,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_223]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_259,negated_conjecture,
% 0.88/1.17 ( accessible_world(skc6,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_240]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_438,negated_conjecture,
% 0.88/1.17 ( accessible_world(skc6,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_259]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_74,negated_conjecture,
% 0.88/1.17 ( desire_want(skc6,skc7) = true ),
% 0.88/1.17 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_69) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_164,negated_conjecture,
% 0.88/1.17 ( desire_want(skc6,skc7) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_74]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_222,negated_conjecture,
% 0.88/1.17 ( desire_want(skc6,skc7) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_164]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_241,negated_conjecture,
% 0.88/1.17 ( desire_want(skc6,skc7) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_222]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_258,negated_conjecture,
% 0.88/1.17 ( desire_want(skc6,skc7) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_241]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_436,negated_conjecture,
% 0.88/1.17 ( desire_want(skc6,skc7) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_258]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_73,negated_conjecture,
% 0.88/1.17 ( present(skc6,skc7) = true ),
% 0.88/1.17 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_68) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_162,negated_conjecture,
% 0.88/1.17 ( present(skc6,skc7) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_73]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_221,negated_conjecture,
% 0.88/1.17 ( present(skc6,skc7) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_162]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_242,negated_conjecture,
% 0.88/1.17 ( present(skc6,skc7) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_221]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_257,negated_conjecture,
% 0.88/1.17 ( present(skc6,skc7) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_242]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_434,negated_conjecture,
% 0.88/1.17 ( present(skc6,skc7) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_257]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_72,negated_conjecture,
% 0.88/1.17 ( of(skc6,skc9,skc10) = true ),
% 0.88/1.17 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_67) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_160,negated_conjecture,
% 0.88/1.17 ( of(skc6,skc9,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_72]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_220,negated_conjecture,
% 0.88/1.17 ( of(skc6,skc9,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_160]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_243,negated_conjecture,
% 0.88/1.17 ( of(skc6,skc9,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_220]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_256,negated_conjecture,
% 0.88/1.17 ( of(skc6,skc9,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_243]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_432,negated_conjecture,
% 0.88/1.17 ( of(skc6,skc9,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_256]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_71,negated_conjecture,
% 0.88/1.17 ( agent(skc6,skc7,skc10) = true ),
% 0.88/1.17 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_66) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_158,negated_conjecture,
% 0.88/1.17 ( agent(skc6,skc7,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_71]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_219,negated_conjecture,
% 0.88/1.17 ( agent(skc6,skc7,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_158]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_244,negated_conjecture,
% 0.88/1.17 ( agent(skc6,skc7,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_219]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_255,negated_conjecture,
% 0.88/1.17 ( agent(skc6,skc7,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_244]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_430,negated_conjecture,
% 0.88/1.17 ( agent(skc6,skc7,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_255]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_70,negated_conjecture,
% 0.88/1.17 ( agent(skc8,skc11,skc10) = true ),
% 0.88/1.17 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_65) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_156,negated_conjecture,
% 0.88/1.17 ( agent(skc8,skc11,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_70]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_218,negated_conjecture,
% 0.88/1.17 ( agent(skc8,skc11,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_156]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_245,negated_conjecture,
% 0.88/1.17 ( agent(skc8,skc11,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_218]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_254,negated_conjecture,
% 0.88/1.17 ( agent(skc8,skc11,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_245]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_428,negated_conjecture,
% 0.88/1.17 ( agent(skc8,skc11,skc10) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_254]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_69,negated_conjecture,
% 0.88/1.17 ( theme(skc6,skc7,skc8) = true ),
% 0.88/1.17 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_64) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_154,negated_conjecture,
% 0.88/1.17 ( theme(skc6,skc7,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_69]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_217,negated_conjecture,
% 0.88/1.17 ( theme(skc6,skc7,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_154]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_246,negated_conjecture,
% 0.88/1.17 ( theme(skc6,skc7,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_217]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_253,negated_conjecture,
% 0.88/1.17 ( theme(skc6,skc7,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_246]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_426,negated_conjecture,
% 0.88/1.17 ( theme(skc6,skc7,skc8) = true ),
% 0.88/1.17 inference(copy,[status(esa)],[c_253]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_68,negated_conjecture,
% 0.88/1.17 ( b != a ),
% 0.88/1.17 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_79) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_152,negated_conjecture,
% 0.88/1.17 ( b != a ),
% 0.88/1.17 inference(copy,[status(esa)],[c_68]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_216,negated_conjecture,
% 0.88/1.17 ( b != a ),
% 0.88/1.17 inference(copy,[status(esa)],[c_152]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_247,negated_conjecture,
% 0.88/1.17 ( b != a ),
% 0.88/1.17 inference(copy,[status(esa)],[c_216]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_252,negated_conjecture,
% 0.88/1.17 ( b != a ),
% 0.88/1.17 inference(copy,[status(esa)],[c_247]) ).
% 0.88/1.17
% 0.88/1.17 cnf(c_424,negated_conjecture,
% 0.88/1.17 ( b != a ),
% 0.88/1.17 inference(copy,[status(esa)],[c_252]) ).
% 0.88/1.17
% 0.88/1.17
% 0.88/1.17
% 0.88/1.17 % ------ Statistics
% 0.88/1.17
% 0.88/1.17 % ------ General
% 0.88/1.17
% 0.88/1.17 % num_of_input_clauses: 84
% 0.88/1.17 % num_of_input_neg_conjectures: 16
% 0.88/1.17 % num_of_splits: 0
% 0.88/1.17 % num_of_split_atoms: 0
% 0.88/1.17 % num_of_sem_filtered_clauses: 0
% 0.88/1.17 % num_of_subtypes: 0
% 0.88/1.17 % monotx_restored_types: 0
% 0.88/1.17 % sat_num_of_epr_types: 0
% 0.88/1.17 % sat_num_of_non_cyclic_types: 0
% 0.88/1.17 % sat_guarded_non_collapsed_types: 0
% 0.88/1.17 % is_epr: 0
% 0.88/1.17 % is_horn: 1
% 0.88/1.17 % has_eq: 1
% 0.88/1.17 % num_pure_diseq_elim: 0
% 0.88/1.17 % simp_replaced_by: 0
% 0.88/1.17 % res_preprocessed: 32
% 0.88/1.17 % prep_upred: 0
% 0.88/1.17 % prep_unflattend: 0
% 0.88/1.17 % pred_elim_cands: 0
% 0.88/1.17 % pred_elim: 0
% 0.88/1.17 % pred_elim_cl: 0
% 0.88/1.17 % pred_elim_cycles: 0
% 0.88/1.17 % forced_gc_time: 0
% 0.88/1.17 % gc_basic_clause_elim: 0
% 0.88/1.17 % parsing_time: 0.004
% 0.88/1.17 % sem_filter_time: 0.
% 0.88/1.17 % pred_elim_time: 0.
% 0.88/1.17 % out_proof_time: 0.
% 0.88/1.17 % monotx_time: 0.
% 0.88/1.17 % subtype_inf_time: 0.
% 0.88/1.17 % unif_index_cands_time: 0.
% 0.88/1.17 % unif_index_add_time: 0.
% 0.88/1.17 % total_time: 0.762
% 0.88/1.17 % num_of_symbols: 71
% 0.88/1.17 % num_of_terms: 716
% 0.88/1.17
% 0.88/1.17 % ------ Propositional Solver
% 0.88/1.17
% 0.88/1.17 % prop_solver_calls: 1
% 0.88/1.17 % prop_fast_solver_calls: 48
% 0.88/1.17 % prop_num_of_clauses: 152
% 0.88/1.17 % prop_preprocess_simplified: 280
% 0.88/1.17 % prop_fo_subsumed: 0
% 0.88/1.17 % prop_solver_time: 0.
% 0.88/1.17 % prop_fast_solver_time: 0.
% 0.88/1.17 % prop_unsat_core_time: 0.
% 0.88/1.17
% 0.88/1.17 % ------ QBF
% 0.88/1.17
% 0.88/1.17 % qbf_q_res: 0
% 0.88/1.17 % qbf_num_tautologies: 0
% 0.88/1.17 % qbf_prep_cycles: 0
% 0.88/1.17
% 0.88/1.17 % ------ BMC1
% 0.88/1.17
% 0.88/1.17 % bmc1_current_bound: -1
% 0.88/1.17 % bmc1_last_solved_bound: -1
% 0.88/1.17 % bmc1_unsat_core_size: -1
% 0.88/1.17 % bmc1_unsat_core_parents_size: -1
% 0.88/1.17 % bmc1_merge_next_fun: 0
% 0.88/1.17 % bmc1_unsat_core_clauses_time: 0.
% 0.88/1.17
% 0.88/1.17 % ------ Instantiation
% 0.88/1.17
% 0.88/1.17 % inst_num_of_clauses: 84
% 0.88/1.17 % inst_num_in_passive: 0
% 0.88/1.17 % inst_num_in_active: 0
% 0.88/1.17 % inst_num_in_unprocessed: 84
% 0.88/1.17 % inst_num_of_loops: 0
% 0.88/1.17 % inst_num_of_learning_restarts: 0
% 0.88/1.17 % inst_num_moves_active_passive: 0
% 0.88/1.17 % inst_lit_activity: 0
% 0.88/1.17 % inst_lit_activity_moves: 0
% 0.88/1.17 % inst_num_tautologies: 0
% 0.88/1.17 % inst_num_prop_implied: 0
% 0.88/1.17 % inst_num_existing_simplified: 0
% 0.88/1.17 % inst_num_eq_res_simplified: 0
% 0.88/1.17 % inst_num_child_elim: 0
% 0.88/1.17 % inst_num_of_dismatching_blockings: 0
% 0.88/1.17 % inst_num_of_non_proper_insts: 0
% 0.88/1.17 % inst_num_of_duplicates: 0
% 0.88/1.17 % inst_inst_num_from_inst_to_res: 0
% 0.88/1.17 % inst_dismatching_checking_time: 0.
% 0.88/1.17
% 0.88/1.17 % ------ Resolution
% 0.88/1.17
% 0.88/1.17 % res_num_of_clauses: 84
% 0.88/1.17 % res_num_in_passive: 0
% 0.88/1.17 % res_num_in_active: 16
% 0.88/1.17 % res_num_of_loops: 17
% 0.88/1.17 % res_forward_subset_subsumed: 0
% 0.88/1.17 % res_backward_subset_subsumed: 0
% 0.88/1.17 % res_forward_subsumed: 0
% 0.88/1.17 % res_backward_subsumed: 0
% 0.88/1.17 % res_forward_subsumption_resolution: 0
% 0.88/1.17 % res_backward_subsumption_resolution: 0
% 0.88/1.17 % res_clause_to_clause_subsumption: 0
% 0.88/1.17 % res_orphan_elimination: 0
% 0.88/1.17 % res_tautology_del: 0
% 0.88/1.17 % res_num_eq_res_simplified: 0
% 0.88/1.17 % res_num_sel_changes: 0
% 0.88/1.17 % res_moves_from_active_to_pass: 0
% 0.88/1.17
% 0.88/1.17 % Status Unknown
% 1.00/1.20 % Orienting using strategy ClausalAll
% 1.00/1.20 % Orientation found
% 1.00/1.20 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_81ce6b.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_eaf5cf | grep -v "SZS"
% 1.04/1.23
% 1.04/1.23 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.04/1.23
% 1.04/1.23 %
% 1.04/1.23 % ------ iProver source info
% 1.04/1.23
% 1.04/1.23 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.04/1.23 % git: non_committed_changes: true
% 1.04/1.23 % git: last_make_outside_of_git: true
% 1.04/1.23
% 1.04/1.23 %
% 1.04/1.23 % ------ Input Options
% 1.04/1.23
% 1.04/1.23 % --out_options all
% 1.04/1.23 % --tptp_safe_out true
% 1.04/1.23 % --problem_path ""
% 1.04/1.23 % --include_path ""
% 1.04/1.23 % --clausifier .//eprover
% 1.04/1.23 % --clausifier_options --tstp-format
% 1.04/1.23 % --stdin false
% 1.04/1.23 % --dbg_backtrace false
% 1.04/1.23 % --dbg_dump_prop_clauses false
% 1.04/1.23 % --dbg_dump_prop_clauses_file -
% 1.04/1.23 % --dbg_out_stat false
% 1.04/1.23
% 1.04/1.23 % ------ General Options
% 1.04/1.23
% 1.04/1.23 % --fof false
% 1.04/1.23 % --time_out_real 150.
% 1.04/1.23 % --time_out_prep_mult 0.2
% 1.04/1.23 % --time_out_virtual -1.
% 1.04/1.23 % --schedule none
% 1.04/1.23 % --ground_splitting input
% 1.04/1.23 % --splitting_nvd 16
% 1.04/1.23 % --non_eq_to_eq false
% 1.04/1.23 % --prep_gs_sim true
% 1.04/1.23 % --prep_unflatten false
% 1.04/1.23 % --prep_res_sim true
% 1.04/1.23 % --prep_upred true
% 1.04/1.23 % --res_sim_input true
% 1.04/1.23 % --clause_weak_htbl true
% 1.04/1.23 % --gc_record_bc_elim false
% 1.04/1.23 % --symbol_type_check false
% 1.04/1.23 % --clausify_out false
% 1.04/1.23 % --large_theory_mode false
% 1.04/1.23 % --prep_sem_filter none
% 1.04/1.23 % --prep_sem_filter_out false
% 1.04/1.23 % --preprocessed_out false
% 1.04/1.23 % --sub_typing false
% 1.04/1.23 % --brand_transform false
% 1.04/1.23 % --pure_diseq_elim true
% 1.04/1.23 % --min_unsat_core false
% 1.04/1.23 % --pred_elim true
% 1.04/1.23 % --add_important_lit false
% 1.04/1.23 % --soft_assumptions false
% 1.04/1.23 % --reset_solvers false
% 1.04/1.23 % --bc_imp_inh []
% 1.04/1.23 % --conj_cone_tolerance 1.5
% 1.04/1.23 % --prolific_symb_bound 500
% 1.04/1.23 % --lt_threshold 2000
% 1.04/1.23
% 1.04/1.23 % ------ SAT Options
% 1.04/1.23
% 1.04/1.23 % --sat_mode false
% 1.04/1.23 % --sat_fm_restart_options ""
% 1.04/1.23 % --sat_gr_def false
% 1.04/1.23 % --sat_epr_types true
% 1.04/1.23 % --sat_non_cyclic_types false
% 1.04/1.23 % --sat_finite_models false
% 1.04/1.23 % --sat_fm_lemmas false
% 1.04/1.23 % --sat_fm_prep false
% 1.04/1.23 % --sat_fm_uc_incr true
% 1.04/1.23 % --sat_out_model small
% 1.04/1.23 % --sat_out_clauses false
% 1.04/1.23
% 1.04/1.23 % ------ QBF Options
% 1.04/1.23
% 1.04/1.23 % --qbf_mode false
% 1.04/1.23 % --qbf_elim_univ true
% 1.04/1.23 % --qbf_sk_in true
% 1.04/1.23 % --qbf_pred_elim true
% 1.04/1.23 % --qbf_split 32
% 1.04/1.23
% 1.04/1.23 % ------ BMC1 Options
% 1.04/1.23
% 1.04/1.23 % --bmc1_incremental false
% 1.04/1.23 % --bmc1_axioms reachable_all
% 1.04/1.23 % --bmc1_min_bound 0
% 1.04/1.23 % --bmc1_max_bound -1
% 1.04/1.23 % --bmc1_max_bound_default -1
% 1.04/1.23 % --bmc1_symbol_reachability true
% 1.04/1.23 % --bmc1_property_lemmas false
% 1.04/1.23 % --bmc1_k_induction false
% 1.04/1.23 % --bmc1_non_equiv_states false
% 1.04/1.23 % --bmc1_deadlock false
% 1.04/1.23 % --bmc1_ucm false
% 1.04/1.23 % --bmc1_add_unsat_core none
% 1.04/1.23 % --bmc1_unsat_core_children false
% 1.04/1.23 % --bmc1_unsat_core_extrapolate_axioms false
% 1.04/1.23 % --bmc1_out_stat full
% 1.04/1.23 % --bmc1_ground_init false
% 1.04/1.23 % --bmc1_pre_inst_next_state false
% 1.04/1.23 % --bmc1_pre_inst_state false
% 1.04/1.23 % --bmc1_pre_inst_reach_state false
% 1.04/1.23 % --bmc1_out_unsat_core false
% 1.04/1.23 % --bmc1_aig_witness_out false
% 1.04/1.23 % --bmc1_verbose false
% 1.04/1.23 % --bmc1_dump_clauses_tptp false
% 1.67/2.03 % --bmc1_dump_unsat_core_tptp false
% 1.67/2.03 % --bmc1_dump_file -
% 1.67/2.03 % --bmc1_ucm_expand_uc_limit 128
% 1.67/2.03 % --bmc1_ucm_n_expand_iterations 6
% 1.67/2.03 % --bmc1_ucm_extend_mode 1
% 1.67/2.03 % --bmc1_ucm_init_mode 2
% 1.67/2.03 % --bmc1_ucm_cone_mode none
% 1.67/2.03 % --bmc1_ucm_reduced_relation_type 0
% 1.67/2.03 % --bmc1_ucm_relax_model 4
% 1.67/2.03 % --bmc1_ucm_full_tr_after_sat true
% 1.67/2.03 % --bmc1_ucm_expand_neg_assumptions false
% 1.67/2.03 % --bmc1_ucm_layered_model none
% 1.67/2.03 % --bmc1_ucm_max_lemma_size 10
% 1.67/2.03
% 1.67/2.03 % ------ AIG Options
% 1.67/2.03
% 1.67/2.03 % --aig_mode false
% 1.67/2.03
% 1.67/2.03 % ------ Instantiation Options
% 1.67/2.03
% 1.67/2.03 % --instantiation_flag true
% 1.67/2.03 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.67/2.03 % --inst_solver_per_active 750
% 1.67/2.03 % --inst_solver_calls_frac 0.5
% 1.67/2.03 % --inst_passive_queue_type priority_queues
% 1.67/2.03 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.67/2.03 % --inst_passive_queues_freq [25;2]
% 1.67/2.03 % --inst_dismatching true
% 1.67/2.03 % --inst_eager_unprocessed_to_passive true
% 1.67/2.03 % --inst_prop_sim_given true
% 1.67/2.03 % --inst_prop_sim_new false
% 1.67/2.03 % --inst_orphan_elimination true
% 1.67/2.03 % --inst_learning_loop_flag true
% 1.67/2.03 % --inst_learning_start 3000
% 1.67/2.03 % --inst_learning_factor 2
% 1.67/2.03 % --inst_start_prop_sim_after_learn 3
% 1.67/2.03 % --inst_sel_renew solver
% 1.67/2.03 % --inst_lit_activity_flag true
% 1.67/2.03 % --inst_out_proof true
% 1.67/2.03
% 1.67/2.03 % ------ Resolution Options
% 1.67/2.03
% 1.67/2.03 % --resolution_flag true
% 1.67/2.03 % --res_lit_sel kbo_max
% 1.67/2.03 % --res_to_prop_solver none
% 1.67/2.03 % --res_prop_simpl_new false
% 1.67/2.03 % --res_prop_simpl_given false
% 1.67/2.03 % --res_passive_queue_type priority_queues
% 1.67/2.03 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.67/2.03 % --res_passive_queues_freq [15;5]
% 1.67/2.03 % --res_forward_subs full
% 1.67/2.03 % --res_backward_subs full
% 1.67/2.03 % --res_forward_subs_resolution true
% 1.67/2.03 % --res_backward_subs_resolution true
% 1.67/2.03 % --res_orphan_elimination false
% 1.67/2.03 % --res_time_limit 1000.
% 1.67/2.03 % --res_out_proof true
% 1.67/2.03 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_81ce6b.s
% 1.67/2.03 % --modulo true
% 1.67/2.03
% 1.67/2.03 % ------ Combination Options
% 1.67/2.03
% 1.67/2.03 % --comb_res_mult 1000
% 1.67/2.03 % --comb_inst_mult 300
% 1.67/2.03 % ------
% 1.67/2.03
% 1.67/2.03 % ------ Parsing...% successful
% 1.67/2.03
% 1.67/2.03 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 1.67/2.03
% 1.67/2.03 % ------ Proving...
% 1.67/2.03 % ------ Problem Properties
% 1.67/2.03
% 1.67/2.03 %
% 1.67/2.03 % EPR false
% 1.67/2.03 % Horn true
% 1.67/2.03 % Has equality true
% 1.67/2.03
% 1.67/2.03 % % ------ Input Options Time Limit: Unbounded
% 1.67/2.03
% 1.67/2.03
% 1.67/2.03 Compiling...
% 1.67/2.03 Loading plugin: done.
% 1.67/2.03 % % ------ Current options:
% 1.67/2.03
% 1.67/2.03 % ------ Input Options
% 1.67/2.03
% 1.67/2.03 % --out_options all
% 1.67/2.03 % --tptp_safe_out true
% 1.67/2.03 % --problem_path ""
% 1.67/2.03 % --include_path ""
% 1.67/2.03 % --clausifier .//eprover
% 1.67/2.03 % --clausifier_options --tstp-format
% 1.67/2.03 % --stdin false
% 1.67/2.03 % --dbg_backtrace false
% 1.67/2.03 % --dbg_dump_prop_clauses false
% 1.67/2.03 % --dbg_dump_prop_clauses_file -
% 1.67/2.03 % --dbg_out_stat false
% 1.67/2.03
% 1.67/2.03 % ------ General Options
% 1.67/2.03
% 1.67/2.03 % --fof false
% 1.67/2.03 % --time_out_real 150.
% 1.67/2.03 % --time_out_prep_mult 0.2
% 1.67/2.03 % --time_out_virtual -1.
% 1.67/2.03 % --schedule none
% 1.67/2.03 % --ground_splitting input
% 1.67/2.03 % --splitting_nvd 16
% 1.67/2.03 % --non_eq_to_eq false
% 1.67/2.03 % --prep_gs_sim true
% 1.67/2.03 % --prep_unflatten false
% 1.67/2.03 % --prep_res_sim true
% 1.67/2.03 % --prep_upred true
% 1.67/2.03 % --res_sim_input true
% 1.67/2.03 % --clause_weak_htbl true
% 1.67/2.03 % --gc_record_bc_elim false
% 1.67/2.03 % --symbol_type_check false
% 1.67/2.03 % --clausify_out false
% 1.67/2.03 % --large_theory_mode false
% 1.67/2.03 % --prep_sem_filter none
% 1.67/2.03 % --prep_sem_filter_out false
% 1.67/2.03 % --preprocessed_out false
% 1.67/2.03 % --sub_typing false
% 1.67/2.03 % --brand_transform false
% 1.67/2.03 % --pure_diseq_elim true
% 1.67/2.03 % --min_unsat_core false
% 1.67/2.03 % --pred_elim true
% 1.67/2.03 % --add_important_lit false
% 1.67/2.03 % --soft_assumptions false
% 1.67/2.03 % --reset_solvers false
% 1.67/2.03 % --bc_imp_inh []
% 1.67/2.03 % --conj_cone_tolerance 1.5
% 1.67/2.03 % --prolific_symb_bound 500
% 1.67/2.03 % --lt_threshold 2000
% 1.67/2.03
% 1.67/2.03 % ------ SAT Options
% 1.67/2.03
% 1.67/2.03 % --sat_mode false
% 1.67/2.03 % --sat_fm_restart_options ""
% 1.67/2.03 % --sat_gr_def false
% 1.67/2.03 % --sat_epr_types true
% 1.67/2.03 % --sat_non_cyclic_types false
% 1.67/2.03 % --sat_finite_models false
% 1.67/2.03 % --sat_fm_lemmas false
% 1.67/2.03 % --sat_fm_prep false
% 1.67/2.03 % --sat_fm_uc_incr true
% 1.67/2.03 % --sat_out_model small
% 1.67/2.03 % --sat_out_clauses false
% 1.67/2.03
% 1.67/2.03 % ------ QBF Options
% 1.67/2.03
% 1.67/2.03 % --qbf_mode false
% 1.67/2.03 % --qbf_elim_univ true
% 1.67/2.03 % --qbf_sk_in true
% 1.67/2.03 % --qbf_pred_elim true
% 1.67/2.03 % --qbf_split 32
% 1.67/2.03
% 1.67/2.03 % ------ BMC1 Options
% 1.67/2.03
% 1.67/2.03 % --bmc1_incremental false
% 1.67/2.03 % --bmc1_axioms reachable_all
% 1.67/2.03 % --bmc1_min_bound 0
% 1.67/2.03 % --bmc1_max_bound -1
% 1.67/2.03 % --bmc1_max_bound_default -1
% 1.67/2.03 % --bmc1_symbol_reachability true
% 1.67/2.03 % --bmc1_property_lemmas false
% 1.67/2.03 % --bmc1_k_induction false
% 1.67/2.03 % --bmc1_non_equiv_states false
% 1.67/2.03 % --bmc1_deadlock false
% 1.67/2.03 % --bmc1_ucm false
% 1.67/2.03 % --bmc1_add_unsat_core none
% 1.67/2.03 % --bmc1_unsat_core_children false
% 1.67/2.03 % --bmc1_unsat_core_extrapolate_axioms false
% 1.67/2.03 % --bmc1_out_stat full
% 1.67/2.03 % --bmc1_ground_init false
% 1.67/2.03 % --bmc1_pre_inst_next_state false
% 1.67/2.03 % --bmc1_pre_inst_state false
% 1.67/2.03 % --bmc1_pre_inst_reach_state false
% 1.67/2.03 % --bmc1_out_unsat_core false
% 1.67/2.03 % --bmc1_aig_witness_out false
% 1.67/2.03 % --bmc1_verbose false
% 1.67/2.03 % --bmc1_dump_clauses_tptp false
% 1.67/2.03 % --bmc1_dump_unsat_core_tptp false
% 1.67/2.03 % --bmc1_dump_file -
% 1.67/2.03 % --bmc1_ucm_expand_uc_limit 128
% 1.67/2.03 % --bmc1_ucm_n_expand_iterations 6
% 1.67/2.03 % --bmc1_ucm_extend_mode 1
% 1.67/2.03 % --bmc1_ucm_init_mode 2
% 1.67/2.03 % --bmc1_ucm_cone_mode none
% 1.67/2.03 % --bmc1_ucm_reduced_relation_type 0
% 1.67/2.03 % --bmc1_ucm_relax_model 4
% 1.67/2.03 % --bmc1_ucm_full_tr_after_sat true
% 1.67/2.03 % --bmc1_ucm_expand_neg_assumptions false
% 1.67/2.03 % --bmc1_ucm_layered_model none
% 1.67/2.03 % --bmc1_ucm_max_lemma_size 10
% 1.67/2.03
% 1.67/2.03 % ------ AIG Options
% 1.67/2.03
% 1.67/2.03 % --aig_mode false
% 1.67/2.03
% 1.67/2.03 % ------ Instantiation Options
% 1.67/2.03
% 1.67/2.03 % --instantiation_flag true
% 1.67/2.03 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.67/2.03 % --inst_solver_per_active 750
% 1.67/2.03 % --inst_solver_calls_frac 0.5
% 1.67/2.03 % --inst_passive_queue_type priority_queues
% 1.67/2.03 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.67/2.03 % --inst_passive_queues_freq [25;2]
% 1.67/2.03 % --inst_dismatching true
% 1.67/2.03 % --inst_eager_unprocessed_to_passive true
% 1.67/2.03 % --inst_prop_sim_given true
% 1.67/2.03 % --inst_prop_sim_new false
% 1.67/2.03 % --inst_orphan_elimination true
% 1.67/2.03 % --inst_learning_loop_flag true
% 1.67/2.03 % --inst_learning_start 3000
% 1.67/2.03 % --inst_learning_factor 2
% 1.67/2.03 % --inst_start_prop_sim_after_learn 3
% 1.67/2.03 % --inst_sel_renew solver
% 1.67/2.03 % --inst_lit_activity_flag true
% 1.67/2.03 % --inst_out_proof true
% 1.67/2.03
% 1.67/2.03 % ------ Resolution Options
% 1.67/2.03
% 1.67/2.03 % --resolution_flag true
% 1.67/2.03 % --res_lit_sel kbo_max
% 1.67/2.03 % --res_to_prop_solver none
% 1.67/2.03 % --res_prop_simpl_new false
% 1.67/2.03 % --res_prop_simpl_given false
% 1.67/2.03 % --res_passive_queue_type priority_queues
% 1.67/2.03 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.67/2.03 % --res_passive_queues_freq [15;5]
% 1.67/2.03 % --res_forward_subs full
% 1.67/2.03 % --res_backward_subs full
% 1.67/2.03 % --res_forward_subs_resolution true
% 1.67/2.03 % --res_backward_subs_resolution true
% 1.67/2.03 % --res_orphan_elimination false
% 1.67/2.03 % --res_time_limit 1000.
% 1.67/2.03 % --res_out_proof true
% 1.67/2.03 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_81ce6b.s
% 1.67/2.03 % --modulo true
% 1.67/2.03
% 1.67/2.03 % ------ Combination Options
% 1.67/2.03
% 1.67/2.03 % --comb_res_mult 1000
% 1.67/2.03 % --comb_inst_mult 300
% 1.67/2.03 % ------
% 1.67/2.03
% 1.67/2.03
% 1.67/2.03
% 1.67/2.03 % ------ Proving...
% 1.67/2.03 % warning: shown sat in sat incomplete mode
% 1.67/2.03 %
% 1.67/2.03
% 1.67/2.03
% 1.67/2.03
% 1.67/2.03
% 1.67/2.03 cnf(c_83,negated_conjecture,
% 1.67/2.03 ( actual_world(skc6) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_78) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_182,negated_conjecture,
% 1.67/2.03 ( actual_world(skc6) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_83]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_231,negated_conjecture,
% 1.67/2.03 ( actual_world(skc6) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_182]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_232,negated_conjecture,
% 1.67/2.03 ( actual_world(skc6) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_231]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_251,negated_conjecture,
% 1.67/2.03 ( actual_world(skc6) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_232]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_422,negated_conjecture,
% 1.67/2.03 ( actual_world(skc6) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_251]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_82,negated_conjecture,
% 1.67/2.03 ( event(skc8,skc11) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_77) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_180,negated_conjecture,
% 1.67/2.03 ( event(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_82]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_230,negated_conjecture,
% 1.67/2.03 ( event(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_180]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_233,negated_conjecture,
% 1.67/2.03 ( event(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_230]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_250,negated_conjecture,
% 1.67/2.03 ( event(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_233]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_420,negated_conjecture,
% 1.67/2.03 ( event(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_250]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_81,negated_conjecture,
% 1.67/2.03 ( woman(skc6,skc10) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_76) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_178,negated_conjecture,
% 1.67/2.03 ( woman(skc6,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_81]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_229,negated_conjecture,
% 1.67/2.03 ( woman(skc6,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_178]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_234,negated_conjecture,
% 1.67/2.03 ( woman(skc6,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_229]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_249,negated_conjecture,
% 1.67/2.03 ( woman(skc6,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_234]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_418,negated_conjecture,
% 1.67/2.03 ( woman(skc6,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_249]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_80,negated_conjecture,
% 1.67/2.03 ( present(skc8,skc11) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_75) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_176,negated_conjecture,
% 1.67/2.03 ( present(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_80]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_228,negated_conjecture,
% 1.67/2.03 ( present(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_176]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_235,negated_conjecture,
% 1.67/2.03 ( present(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_228]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_248,negated_conjecture,
% 1.67/2.03 ( present(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_235]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_416,negated_conjecture,
% 1.67/2.03 ( present(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_248]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_79,negated_conjecture,
% 1.67/2.03 ( dance(skc8,skc11) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_74) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_174,negated_conjecture,
% 1.67/2.03 ( dance(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_79]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_227,negated_conjecture,
% 1.67/2.03 ( dance(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_174]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_236,negated_conjecture,
% 1.67/2.03 ( dance(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_227]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_263,negated_conjecture,
% 1.67/2.03 ( dance(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_236]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_446,negated_conjecture,
% 1.67/2.03 ( dance(skc8,skc11) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_263]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_78,negated_conjecture,
% 1.67/2.03 ( forename(skc6,skc9) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_73) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_172,negated_conjecture,
% 1.67/2.03 ( forename(skc6,skc9) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_78]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_226,negated_conjecture,
% 1.67/2.03 ( forename(skc6,skc9) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_172]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_237,negated_conjecture,
% 1.67/2.03 ( forename(skc6,skc9) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_226]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_262,negated_conjecture,
% 1.67/2.03 ( forename(skc6,skc9) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_237]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_444,negated_conjecture,
% 1.67/2.03 ( forename(skc6,skc9) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_262]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_77,negated_conjecture,
% 1.67/2.03 ( mia_forename(skc6,skc9) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_72) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_170,negated_conjecture,
% 1.67/2.03 ( mia_forename(skc6,skc9) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_77]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_225,negated_conjecture,
% 1.67/2.03 ( mia_forename(skc6,skc9) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_170]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_238,negated_conjecture,
% 1.67/2.03 ( mia_forename(skc6,skc9) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_225]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_261,negated_conjecture,
% 1.67/2.03 ( mia_forename(skc6,skc9) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_238]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_442,negated_conjecture,
% 1.67/2.03 ( mia_forename(skc6,skc9) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_261]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_76,negated_conjecture,
% 1.67/2.03 ( proposition(skc6,skc8) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_71) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_168,negated_conjecture,
% 1.67/2.03 ( proposition(skc6,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_76]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_224,negated_conjecture,
% 1.67/2.03 ( proposition(skc6,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_168]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_239,negated_conjecture,
% 1.67/2.03 ( proposition(skc6,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_224]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_260,negated_conjecture,
% 1.67/2.03 ( proposition(skc6,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_239]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_440,negated_conjecture,
% 1.67/2.03 ( proposition(skc6,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_260]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_75,negated_conjecture,
% 1.67/2.03 ( accessible_world(skc6,skc8) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_70) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_166,negated_conjecture,
% 1.67/2.03 ( accessible_world(skc6,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_75]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_223,negated_conjecture,
% 1.67/2.03 ( accessible_world(skc6,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_166]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_240,negated_conjecture,
% 1.67/2.03 ( accessible_world(skc6,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_223]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_259,negated_conjecture,
% 1.67/2.03 ( accessible_world(skc6,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_240]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_438,negated_conjecture,
% 1.67/2.03 ( accessible_world(skc6,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_259]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_74,negated_conjecture,
% 1.67/2.03 ( desire_want(skc6,skc7) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_69) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_164,negated_conjecture,
% 1.67/2.03 ( desire_want(skc6,skc7) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_74]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_222,negated_conjecture,
% 1.67/2.03 ( desire_want(skc6,skc7) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_164]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_241,negated_conjecture,
% 1.67/2.03 ( desire_want(skc6,skc7) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_222]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_258,negated_conjecture,
% 1.67/2.03 ( desire_want(skc6,skc7) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_241]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_436,negated_conjecture,
% 1.67/2.03 ( desire_want(skc6,skc7) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_258]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_73,negated_conjecture,
% 1.67/2.03 ( present(skc6,skc7) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_68) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_162,negated_conjecture,
% 1.67/2.03 ( present(skc6,skc7) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_73]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_221,negated_conjecture,
% 1.67/2.03 ( present(skc6,skc7) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_162]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_242,negated_conjecture,
% 1.67/2.03 ( present(skc6,skc7) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_221]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_257,negated_conjecture,
% 1.67/2.03 ( present(skc6,skc7) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_242]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_434,negated_conjecture,
% 1.67/2.03 ( present(skc6,skc7) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_257]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_72,negated_conjecture,
% 1.67/2.03 ( of(skc6,skc9,skc10) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_67) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_160,negated_conjecture,
% 1.67/2.03 ( of(skc6,skc9,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_72]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_220,negated_conjecture,
% 1.67/2.03 ( of(skc6,skc9,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_160]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_243,negated_conjecture,
% 1.67/2.03 ( of(skc6,skc9,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_220]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_256,negated_conjecture,
% 1.67/2.03 ( of(skc6,skc9,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_243]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_432,negated_conjecture,
% 1.67/2.03 ( of(skc6,skc9,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_256]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_71,negated_conjecture,
% 1.67/2.03 ( agent(skc6,skc7,skc10) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_66) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_158,negated_conjecture,
% 1.67/2.03 ( agent(skc6,skc7,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_71]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_219,negated_conjecture,
% 1.67/2.03 ( agent(skc6,skc7,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_158]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_244,negated_conjecture,
% 1.67/2.03 ( agent(skc6,skc7,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_219]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_255,negated_conjecture,
% 1.67/2.03 ( agent(skc6,skc7,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_244]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_430,negated_conjecture,
% 1.67/2.03 ( agent(skc6,skc7,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_255]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_70,negated_conjecture,
% 1.67/2.03 ( agent(skc8,skc11,skc10) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_65) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_156,negated_conjecture,
% 1.67/2.03 ( agent(skc8,skc11,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_70]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_218,negated_conjecture,
% 1.67/2.03 ( agent(skc8,skc11,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_156]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_245,negated_conjecture,
% 1.67/2.03 ( agent(skc8,skc11,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_218]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_254,negated_conjecture,
% 1.67/2.03 ( agent(skc8,skc11,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_245]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_428,negated_conjecture,
% 1.67/2.03 ( agent(skc8,skc11,skc10) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_254]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_69,negated_conjecture,
% 1.67/2.03 ( theme(skc6,skc7,skc8) = true ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_64) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_154,negated_conjecture,
% 1.67/2.03 ( theme(skc6,skc7,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_69]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_217,negated_conjecture,
% 1.67/2.03 ( theme(skc6,skc7,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_154]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_246,negated_conjecture,
% 1.67/2.03 ( theme(skc6,skc7,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_217]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_253,negated_conjecture,
% 1.67/2.03 ( theme(skc6,skc7,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_246]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_426,negated_conjecture,
% 1.67/2.03 ( theme(skc6,skc7,skc8) = true ),
% 1.67/2.03 inference(copy,[status(esa)],[c_253]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_68,negated_conjecture,
% 1.67/2.03 ( b != a ),
% 1.67/2.03 file('/export/starexec/sandbox2/tmp/iprover_modulo_30a9e2.p', c_0_79) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_152,negated_conjecture,
% 1.67/2.03 ( b != a ),
% 1.67/2.03 inference(copy,[status(esa)],[c_68]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_216,negated_conjecture,
% 1.67/2.03 ( b != a ),
% 1.67/2.03 inference(copy,[status(esa)],[c_152]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_247,negated_conjecture,
% 1.67/2.03 ( b != a ),
% 1.67/2.03 inference(copy,[status(esa)],[c_216]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_252,negated_conjecture,
% 1.67/2.03 ( b != a ),
% 1.67/2.03 inference(copy,[status(esa)],[c_247]) ).
% 1.67/2.03
% 1.67/2.03 cnf(c_424,negated_conjecture,
% 1.67/2.03 ( b != a ),
% 1.67/2.03 inference(copy,[status(esa)],[c_252]) ).
% 1.67/2.03
% 1.67/2.03
% 1.67/2.03
% 1.67/2.03 % ------ Statistics
% 1.67/2.03
% 1.67/2.03 % ------ General
% 1.67/2.03
% 1.67/2.03 % num_of_input_clauses: 84
% 1.67/2.03 % num_of_input_neg_conjectures: 16
% 1.67/2.03 % num_of_splits: 0
% 1.67/2.03 % num_of_split_atoms: 0
% 1.67/2.03 % num_of_sem_filtered_clauses: 0
% 1.67/2.03 % num_of_subtypes: 0
% 1.67/2.03 % monotx_restored_types: 0
% 1.67/2.03 % sat_num_of_epr_types: 0
% 1.67/2.03 % sat_num_of_non_cyclic_types: 0
% 1.67/2.03 % sat_guarded_non_collapsed_types: 0
% 1.67/2.03 % is_epr: 0
% 1.67/2.03 % is_horn: 1
% 1.67/2.03 % has_eq: 1
% 1.67/2.03 % num_pure_diseq_elim: 0
% 1.67/2.03 % simp_replaced_by: 0
% 1.67/2.03 % res_preprocessed: 32
% 1.67/2.03 % prep_upred: 0
% 1.67/2.03 % prep_unflattend: 0
% 1.67/2.03 % pred_elim_cands: 0
% 1.67/2.03 % pred_elim: 0
% 1.67/2.03 % pred_elim_cl: 0
% 1.67/2.03 % pred_elim_cycles: 0
% 1.67/2.03 % forced_gc_time: 0
% 1.67/2.03 % gc_basic_clause_elim: 0
% 1.67/2.03 % parsing_time: 0.004
% 1.67/2.03 % sem_filter_time: 0.
% 1.67/2.03 % pred_elim_time: 0.
% 1.67/2.03 % out_proof_time: 0.
% 1.67/2.03 % monotx_time: 0.
% 1.67/2.03 % subtype_inf_time: 0.
% 1.67/2.03 % unif_index_cands_time: 0.
% 1.67/2.03 % unif_index_add_time: 0.
% 1.67/2.03 % total_time: 0.822
% 1.67/2.03 % num_of_symbols: 71
% 1.67/2.03 % num_of_terms: 559
% 1.67/2.03
% 1.67/2.03 % ------ Propositional Solver
% 1.67/2.03
% 1.67/2.03 % prop_solver_calls: 1
% 1.67/2.03 % prop_fast_solver_calls: 48
% 1.67/2.03 % prop_num_of_clauses: 152
% 1.67/2.03 % prop_preprocess_simplified: 280
% 1.67/2.03 % prop_fo_subsumed: 0
% 1.67/2.03 % prop_solver_time: 0.
% 1.67/2.03 % prop_fast_solver_time: 0.
% 1.67/2.03 % prop_unsat_core_time: 0.
% 1.67/2.03
% 1.67/2.03 % ------ QBF
% 1.67/2.03
% 1.67/2.03 % qbf_q_res: 0
% 1.67/2.03 % qbf_num_tautologies: 0
% 1.67/2.03 % qbf_prep_cycles: 0
% 1.67/2.03
% 1.67/2.03 % ------ BMC1
% 1.67/2.03
% 1.67/2.03 % bmc1_current_bound: -1
% 1.67/2.03 % bmc1_last_solved_bound: -1
% 1.67/2.03 % bmc1_unsat_core_size: -1
% 1.67/2.03 % bmc1_unsat_core_parents_size: -1
% 1.67/2.03 % bmc1_merge_next_fun: 0
% 1.67/2.03 % bmc1_unsat_core_clauses_time: 0.
% 1.67/2.03
% 1.67/2.03 % ------ Instantiation
% 1.67/2.03
% 1.67/2.03 % inst_num_of_clauses: 84
% 1.67/2.03 % inst_num_in_passive: 0
% 1.67/2.03 % inst_num_in_active: 0
% 1.67/2.03 % inst_num_in_unprocessed: 84
% 1.67/2.03 % inst_num_of_loops: 0
% 1.67/2.03 % inst_num_of_learning_restarts: 0
% 1.67/2.03 % inst_num_moves_active_passive: 0
% 1.67/2.03 % inst_lit_activity: 0
% 1.67/2.03 % inst_lit_activity_moves: 0
% 1.67/2.03 % inst_num_tautologies: 0
% 1.67/2.03 % inst_num_prop_implied: 0
% 1.67/2.03 % inst_num_existing_simplified: 0
% 1.67/2.03 % inst_num_eq_res_simplified: 0
% 1.67/2.03 % inst_num_child_elim: 0
% 1.67/2.03 % inst_num_of_dismatching_blockings: 0
% 1.67/2.03 % inst_num_of_non_proper_insts: 0
% 1.67/2.03 % inst_num_of_duplicates: 0
% 1.67/2.03 % inst_inst_num_from_inst_to_res: 0
% 1.67/2.03 % inst_dismatching_checking_time: 0.
% 1.67/2.03
% 1.67/2.03 % ------ Resolution
% 1.67/2.03
% 1.67/2.03 % res_num_of_clauses: 84
% 1.67/2.03 % res_num_in_passive: 0
% 1.67/2.03 % res_num_in_active: 16
% 1.67/2.03 % res_num_of_loops: 17
% 1.67/2.03 % res_forward_subset_subsumed: 0
% 1.67/2.03 % res_backward_subset_subsumed: 0
% 1.67/2.03 % res_forward_subsumed: 0
% 1.67/2.03 % res_backward_subsumed: 0
% 1.67/2.03 % res_forward_subsumption_resolution: 0
% 1.67/2.03 % res_backward_subsumption_resolution: 0
% 1.67/2.03 % res_clause_to_clause_subsumption: 0
% 1.67/2.03 % res_orphan_elimination: 0
% 1.67/2.03 % res_tautology_del: 0
% 1.67/2.03 % res_num_eq_res_simplified: 0
% 1.67/2.03 % res_num_sel_changes: 0
% 1.67/2.03 % res_moves_from_active_to_pass: 0
% 1.67/2.03
% 1.67/2.03 % Status Unknown
% 1.67/2.03 % Last status :
% 1.67/2.03 % SZS status Unknown
%------------------------------------------------------------------------------