TSTP Solution File: NLP024-10 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP024-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n015.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:40 EDT 2022
% Result : Unknown 1.83s 2.15s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NLP024-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n015.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 04:06:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/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/sandbox/tmp/iprover_proof_66cbf3.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_ae699f | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 1.04/1.24 % --bmc1_dump_unsat_core_tptp false
% 1.04/1.24 % --bmc1_dump_file -
% 1.04/1.24 % --bmc1_ucm_expand_uc_limit 128
% 1.04/1.24 % --bmc1_ucm_n_expand_iterations 6
% 1.04/1.24 % --bmc1_ucm_extend_mode 1
% 1.04/1.24 % --bmc1_ucm_init_mode 2
% 1.04/1.24 % --bmc1_ucm_cone_mode none
% 1.04/1.24 % --bmc1_ucm_reduced_relation_type 0
% 1.04/1.24 % --bmc1_ucm_relax_model 4
% 1.04/1.24 % --bmc1_ucm_full_tr_after_sat true
% 1.04/1.24 % --bmc1_ucm_expand_neg_assumptions false
% 1.04/1.24 % --bmc1_ucm_layered_model none
% 1.04/1.24 % --bmc1_ucm_max_lemma_size 10
% 1.04/1.24
% 1.04/1.24 % ------ AIG Options
% 1.04/1.24
% 1.04/1.24 % --aig_mode false
% 1.04/1.24
% 1.04/1.24 % ------ Instantiation Options
% 1.04/1.24
% 1.04/1.24 % --instantiation_flag true
% 1.04/1.24 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.04/1.24 % --inst_solver_per_active 750
% 1.04/1.24 % --inst_solver_calls_frac 0.5
% 1.04/1.24 % --inst_passive_queue_type priority_queues
% 1.04/1.24 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.04/1.24 % --inst_passive_queues_freq [25;2]
% 1.04/1.24 % --inst_dismatching true
% 1.04/1.24 % --inst_eager_unprocessed_to_passive true
% 1.04/1.24 % --inst_prop_sim_given true
% 1.04/1.24 % --inst_prop_sim_new false
% 1.04/1.24 % --inst_orphan_elimination true
% 1.04/1.24 % --inst_learning_loop_flag true
% 1.04/1.24 % --inst_learning_start 3000
% 1.04/1.24 % --inst_learning_factor 2
% 1.04/1.24 % --inst_start_prop_sim_after_learn 3
% 1.04/1.24 % --inst_sel_renew solver
% 1.04/1.24 % --inst_lit_activity_flag true
% 1.04/1.24 % --inst_out_proof true
% 1.04/1.24
% 1.04/1.24 % ------ Resolution Options
% 1.04/1.24
% 1.04/1.24 % --resolution_flag true
% 1.04/1.24 % --res_lit_sel kbo_max
% 1.04/1.24 % --res_to_prop_solver none
% 1.04/1.24 % --res_prop_simpl_new false
% 1.04/1.24 % --res_prop_simpl_given false
% 1.04/1.24 % --res_passive_queue_type priority_queues
% 1.04/1.24 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.04/1.24 % --res_passive_queues_freq [15;5]
% 1.04/1.24 % --res_forward_subs full
% 1.04/1.24 % --res_backward_subs full
% 1.04/1.24 % --res_forward_subs_resolution true
% 1.04/1.24 % --res_backward_subs_resolution true
% 1.04/1.24 % --res_orphan_elimination false
% 1.04/1.24 % --res_time_limit 1000.
% 1.04/1.24 % --res_out_proof true
% 1.04/1.24 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_66cbf3.s
% 1.04/1.24 % --modulo true
% 1.04/1.24
% 1.04/1.24 % ------ Combination Options
% 1.04/1.24
% 1.04/1.24 % --comb_res_mult 1000
% 1.04/1.24 % --comb_inst_mult 300
% 1.04/1.24 % ------
% 1.04/1.24
% 1.04/1.24 % ------ Parsing...% successful
% 1.04/1.24
% 1.04/1.24 % ------ 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.04/1.24
% 1.04/1.24 % ------ Proving...
% 1.04/1.24 % ------ Problem Properties
% 1.04/1.24
% 1.04/1.24 %
% 1.04/1.24 % EPR false
% 1.04/1.24 % Horn true
% 1.04/1.24 % Has equality true
% 1.04/1.24
% 1.04/1.24 % % ------ Input Options Time Limit: Unbounded
% 1.04/1.24
% 1.04/1.24
% 1.04/1.24 Compiling...
% 1.04/1.24 Loading plugin: done.
% 1.04/1.24 % % ------ Current options:
% 1.04/1.24
% 1.04/1.24 % ------ Input Options
% 1.04/1.24
% 1.04/1.24 % --out_options all
% 1.04/1.24 % --tptp_safe_out true
% 1.04/1.24 % --problem_path ""
% 1.04/1.24 % --include_path ""
% 1.04/1.24 % --clausifier .//eprover
% 1.04/1.24 % --clausifier_options --tstp-format
% 1.04/1.24 % --stdin false
% 1.04/1.24 % --dbg_backtrace false
% 1.04/1.24 % --dbg_dump_prop_clauses false
% 1.04/1.24 % --dbg_dump_prop_clauses_file -
% 1.04/1.24 % --dbg_out_stat false
% 1.04/1.24
% 1.04/1.24 % ------ General Options
% 1.04/1.24
% 1.04/1.24 % --fof false
% 1.04/1.24 % --time_out_real 150.
% 1.04/1.24 % --time_out_prep_mult 0.2
% 1.04/1.24 % --time_out_virtual -1.
% 1.04/1.24 % --schedule none
% 1.04/1.24 % --ground_splitting input
% 1.04/1.24 % --splitting_nvd 16
% 1.04/1.24 % --non_eq_to_eq false
% 1.04/1.24 % --prep_gs_sim true
% 1.04/1.24 % --prep_unflatten false
% 1.04/1.24 % --prep_res_sim true
% 1.04/1.24 % --prep_upred true
% 1.04/1.24 % --res_sim_input true
% 1.04/1.24 % --clause_weak_htbl true
% 1.04/1.24 % --gc_record_bc_elim false
% 1.04/1.24 % --symbol_type_check false
% 1.04/1.24 % --clausify_out false
% 1.04/1.24 % --large_theory_mode false
% 1.04/1.24 % --prep_sem_filter none
% 1.04/1.24 % --prep_sem_filter_out false
% 1.04/1.24 % --preprocessed_out false
% 1.04/1.24 % --sub_typing false
% 1.04/1.24 % --brand_transform false
% 1.04/1.24 % --pure_diseq_elim true
% 1.04/1.24 % --min_unsat_core false
% 1.04/1.24 % --pred_elim true
% 1.04/1.24 % --add_important_lit false
% 1.04/1.24 % --soft_assumptions false
% 1.04/1.24 % --reset_solvers false
% 1.04/1.24 % --bc_imp_inh []
% 1.04/1.24 % --conj_cone_tolerance 1.5
% 1.04/1.24 % --prolific_symb_bound 500
% 1.04/1.24 % --lt_threshold 2000
% 1.04/1.24
% 1.04/1.24 % ------ SAT Options
% 1.04/1.24
% 1.04/1.24 % --sat_mode false
% 1.04/1.24 % --sat_fm_restart_options ""
% 1.04/1.24 % --sat_gr_def false
% 1.04/1.24 % --sat_epr_types true
% 1.04/1.24 % --sat_non_cyclic_types false
% 1.04/1.24 % --sat_finite_models false
% 1.04/1.24 % --sat_fm_lemmas false
% 1.04/1.24 % --sat_fm_prep false
% 1.04/1.24 % --sat_fm_uc_incr true
% 1.04/1.24 % --sat_out_model small
% 1.04/1.24 % --sat_out_clauses false
% 1.04/1.24
% 1.04/1.24 % ------ QBF Options
% 1.04/1.24
% 1.04/1.24 % --qbf_mode false
% 1.04/1.24 % --qbf_elim_univ true
% 1.04/1.24 % --qbf_sk_in true
% 1.04/1.24 % --qbf_pred_elim true
% 1.04/1.24 % --qbf_split 32
% 1.04/1.24
% 1.04/1.24 % ------ BMC1 Options
% 1.04/1.24
% 1.04/1.24 % --bmc1_incremental false
% 1.04/1.24 % --bmc1_axioms reachable_all
% 1.04/1.24 % --bmc1_min_bound 0
% 1.04/1.24 % --bmc1_max_bound -1
% 1.04/1.24 % --bmc1_max_bound_default -1
% 1.04/1.24 % --bmc1_symbol_reachability true
% 1.04/1.24 % --bmc1_property_lemmas false
% 1.04/1.24 % --bmc1_k_induction false
% 1.04/1.24 % --bmc1_non_equiv_states false
% 1.04/1.24 % --bmc1_deadlock false
% 1.04/1.24 % --bmc1_ucm false
% 1.04/1.24 % --bmc1_add_unsat_core none
% 1.04/1.24 % --bmc1_unsat_core_children false
% 1.04/1.24 % --bmc1_unsat_core_extrapolate_axioms false
% 1.04/1.24 % --bmc1_out_stat full
% 1.04/1.24 % --bmc1_ground_init false
% 1.04/1.24 % --bmc1_pre_inst_next_state false
% 1.04/1.24 % --bmc1_pre_inst_state false
% 1.04/1.24 % --bmc1_pre_inst_reach_state false
% 1.04/1.24 % --bmc1_out_unsat_core false
% 1.04/1.24 % --bmc1_aig_witness_out false
% 1.04/1.24 % --bmc1_verbose false
% 1.04/1.24 % --bmc1_dump_clauses_tptp false
% 1.04/1.24 % --bmc1_dump_unsat_core_tptp false
% 1.04/1.24 % --bmc1_dump_file -
% 1.04/1.24 % --bmc1_ucm_expand_uc_limit 128
% 1.04/1.24 % --bmc1_ucm_n_expand_iterations 6
% 1.04/1.24 % --bmc1_ucm_extend_mode 1
% 1.04/1.24 % --bmc1_ucm_init_mode 2
% 1.04/1.24 % --bmc1_ucm_cone_mode none
% 1.04/1.24 % --bmc1_ucm_reduced_relation_type 0
% 1.04/1.24 % --bmc1_ucm_relax_model 4
% 1.04/1.24 % --bmc1_ucm_full_tr_after_sat true
% 1.04/1.24 % --bmc1_ucm_expand_neg_assumptions false
% 1.04/1.24 % --bmc1_ucm_layered_model none
% 1.04/1.24 % --bmc1_ucm_max_lemma_size 10
% 1.04/1.24
% 1.04/1.24 % ------ AIG Options
% 1.04/1.24
% 1.04/1.24 % --aig_mode false
% 1.04/1.24
% 1.04/1.24 % ------ Instantiation Options
% 1.04/1.24
% 1.04/1.24 % --instantiation_flag true
% 1.04/1.24 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.04/1.24 % --inst_solver_per_active 750
% 1.04/1.24 % --inst_solver_calls_frac 0.5
% 1.04/1.24 % --inst_passive_queue_type priority_queues
% 1.04/1.24 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.04/1.24 % --inst_passive_queues_freq [25;2]
% 1.04/1.24 % --inst_dismatching true
% 1.04/1.24 % --inst_eager_unprocessed_to_passive true
% 1.04/1.24 % --inst_prop_sim_given true
% 1.04/1.24 % --inst_prop_sim_new false
% 1.04/1.24 % --inst_orphan_elimination true
% 1.04/1.24 % --inst_learning_loop_flag true
% 1.04/1.24 % --inst_learning_start 3000
% 1.04/1.24 % --inst_learning_factor 2
% 1.04/1.24 % --inst_start_prop_sim_after_learn 3
% 1.04/1.24 % --inst_sel_renew solver
% 1.04/1.24 % --inst_lit_activity_flag true
% 1.04/1.24 % --inst_out_proof true
% 1.04/1.24
% 1.04/1.24 % ------ Resolution Options
% 1.04/1.24
% 1.04/1.24 % --resolution_flag true
% 1.04/1.24 % --res_lit_sel kbo_max
% 1.04/1.24 % --res_to_prop_solver none
% 1.04/1.24 % --res_prop_simpl_new false
% 1.04/1.24 % --res_prop_simpl_given false
% 1.04/1.24 % --res_passive_queue_type priority_queues
% 1.04/1.24 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.04/1.24 % --res_passive_queues_freq [15;5]
% 1.04/1.24 % --res_forward_subs full
% 1.04/1.24 % --res_backward_subs full
% 1.04/1.24 % --res_forward_subs_resolution true
% 1.04/1.24 % --res_backward_subs_resolution true
% 1.04/1.24 % --res_orphan_elimination false
% 1.04/1.24 % --res_time_limit 1000.
% 1.04/1.24 % --res_out_proof true
% 1.04/1.24 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_66cbf3.s
% 1.04/1.24 % --modulo true
% 1.04/1.24
% 1.04/1.24 % ------ Combination Options
% 1.04/1.24
% 1.04/1.24 % --comb_res_mult 1000
% 1.04/1.24 % --comb_inst_mult 300
% 1.04/1.24 % ------
% 1.04/1.24
% 1.04/1.24
% 1.04/1.24
% 1.04/1.24 % ------ Proving...
% 1.04/1.24 % warning: shown sat in sat incomplete mode
% 1.04/1.24 %
% 1.04/1.24
% 1.04/1.24
% 1.04/1.24
% 1.04/1.24
% 1.04/1.24 cnf(c_97,negated_conjecture,
% 1.04/1.24 ( actual_world(skc8) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_103) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_216,negated_conjecture,
% 1.04/1.24 ( actual_world(skc8) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_97]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_280,negated_conjecture,
% 1.04/1.24 ( actual_world(skc8) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_216]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_281,negated_conjecture,
% 1.04/1.24 ( actual_world(skc8) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_280]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_303,negated_conjecture,
% 1.04/1.24 ( actual_world(skc8) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_281]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_500,negated_conjecture,
% 1.04/1.24 ( actual_world(skc8) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_303]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_96,negated_conjecture,
% 1.04/1.24 ( man(skc8,skc15) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_102) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_214,negated_conjecture,
% 1.04/1.24 ( man(skc8,skc15) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_96]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_279,negated_conjecture,
% 1.04/1.24 ( man(skc8,skc15) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_214]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_282,negated_conjecture,
% 1.04/1.24 ( man(skc8,skc15) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_279]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_302,negated_conjecture,
% 1.04/1.24 ( man(skc8,skc15) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_282]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_498,negated_conjecture,
% 1.04/1.24 ( man(skc8,skc15) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_302]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_95,negated_conjecture,
% 1.04/1.24 ( event(skc10,skc13) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_101) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_212,negated_conjecture,
% 1.04/1.24 ( event(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_95]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_278,negated_conjecture,
% 1.04/1.24 ( event(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_212]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_283,negated_conjecture,
% 1.04/1.24 ( event(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_278]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_322,negated_conjecture,
% 1.04/1.24 ( event(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_283]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_538,negated_conjecture,
% 1.04/1.24 ( event(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_322]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_94,negated_conjecture,
% 1.04/1.24 ( woman(skc8,skc12) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_100) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_210,negated_conjecture,
% 1.04/1.24 ( woman(skc8,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_94]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_277,negated_conjecture,
% 1.04/1.24 ( woman(skc8,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_210]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_284,negated_conjecture,
% 1.04/1.24 ( woman(skc8,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_277]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_321,negated_conjecture,
% 1.04/1.24 ( woman(skc8,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_284]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_536,negated_conjecture,
% 1.04/1.24 ( woman(skc8,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_321]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_93,negated_conjecture,
% 1.04/1.24 ( present(skc10,skc13) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_99) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_208,negated_conjecture,
% 1.04/1.24 ( present(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_93]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_276,negated_conjecture,
% 1.04/1.24 ( present(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_208]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_285,negated_conjecture,
% 1.04/1.24 ( present(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_276]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_320,negated_conjecture,
% 1.04/1.24 ( present(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_285]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_534,negated_conjecture,
% 1.04/1.24 ( present(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_320]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_92,negated_conjecture,
% 1.04/1.24 ( dance(skc10,skc13) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_98) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_206,negated_conjecture,
% 1.04/1.24 ( dance(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_92]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_275,negated_conjecture,
% 1.04/1.24 ( dance(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_206]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_286,negated_conjecture,
% 1.04/1.24 ( dance(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_275]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_319,negated_conjecture,
% 1.04/1.24 ( dance(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_286]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_532,negated_conjecture,
% 1.04/1.24 ( dance(skc10,skc13) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_319]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_91,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc11) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_97) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_204,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc11) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_91]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_274,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc11) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_204]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_287,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc11) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_274]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_318,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc11) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_287]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_530,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc11) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_318]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_90,negated_conjecture,
% 1.04/1.24 ( mia_forename(skc8,skc11) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_96) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_202,negated_conjecture,
% 1.04/1.24 ( mia_forename(skc8,skc11) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_90]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_273,negated_conjecture,
% 1.04/1.24 ( mia_forename(skc8,skc11) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_202]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_288,negated_conjecture,
% 1.04/1.24 ( mia_forename(skc8,skc11) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_273]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_317,negated_conjecture,
% 1.04/1.24 ( mia_forename(skc8,skc11) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_288]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_528,negated_conjecture,
% 1.04/1.24 ( mia_forename(skc8,skc11) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_317]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_89,negated_conjecture,
% 1.04/1.24 ( proposition(skc8,skc10) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_95) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_200,negated_conjecture,
% 1.04/1.24 ( proposition(skc8,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_89]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_272,negated_conjecture,
% 1.04/1.24 ( proposition(skc8,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_200]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_289,negated_conjecture,
% 1.04/1.24 ( proposition(skc8,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_272]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_316,negated_conjecture,
% 1.04/1.24 ( proposition(skc8,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_289]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_526,negated_conjecture,
% 1.04/1.24 ( proposition(skc8,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_316]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_88,negated_conjecture,
% 1.04/1.24 ( accessible_world(skc8,skc10) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_94) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_198,negated_conjecture,
% 1.04/1.24 ( accessible_world(skc8,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_88]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_271,negated_conjecture,
% 1.04/1.24 ( accessible_world(skc8,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_198]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_290,negated_conjecture,
% 1.04/1.24 ( accessible_world(skc8,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_271]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_315,negated_conjecture,
% 1.04/1.24 ( accessible_world(skc8,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_290]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_524,negated_conjecture,
% 1.04/1.24 ( accessible_world(skc8,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_315]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_87,negated_conjecture,
% 1.04/1.24 ( desire_want(skc8,skc9) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_93) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_196,negated_conjecture,
% 1.04/1.24 ( desire_want(skc8,skc9) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_87]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_270,negated_conjecture,
% 1.04/1.24 ( desire_want(skc8,skc9) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_196]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_291,negated_conjecture,
% 1.04/1.24 ( desire_want(skc8,skc9) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_270]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_314,negated_conjecture,
% 1.04/1.24 ( desire_want(skc8,skc9) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_291]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_522,negated_conjecture,
% 1.04/1.24 ( desire_want(skc8,skc9) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_314]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_86,negated_conjecture,
% 1.04/1.24 ( present(skc8,skc9) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_92) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_194,negated_conjecture,
% 1.04/1.24 ( present(skc8,skc9) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_86]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_269,negated_conjecture,
% 1.04/1.24 ( present(skc8,skc9) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_194]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_292,negated_conjecture,
% 1.04/1.24 ( present(skc8,skc9) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_269]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_313,negated_conjecture,
% 1.04/1.24 ( present(skc8,skc9) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_292]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_520,negated_conjecture,
% 1.04/1.24 ( present(skc8,skc9) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_313]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_85,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc14) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_91) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_192,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc14) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_85]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_268,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc14) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_192]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_293,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc14) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_268]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_312,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc14) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_293]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_518,negated_conjecture,
% 1.04/1.24 ( forename(skc8,skc14) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_312]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_84,negated_conjecture,
% 1.04/1.24 ( vincent_forename(skc8,skc14) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_90) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_190,negated_conjecture,
% 1.04/1.24 ( vincent_forename(skc8,skc14) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_84]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_267,negated_conjecture,
% 1.04/1.24 ( vincent_forename(skc8,skc14) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_190]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_294,negated_conjecture,
% 1.04/1.24 ( vincent_forename(skc8,skc14) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_267]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_311,negated_conjecture,
% 1.04/1.24 ( vincent_forename(skc8,skc14) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_294]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_516,negated_conjecture,
% 1.04/1.24 ( vincent_forename(skc8,skc14) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_311]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_83,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc14,skc15) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_89) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_188,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc14,skc15) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_83]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_266,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc14,skc15) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_188]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_295,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc14,skc15) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_266]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_310,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc14,skc15) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_295]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_514,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc14,skc15) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_310]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_82,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc11,skc12) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_88) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_186,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc11,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_82]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_265,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc11,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_186]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_296,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc11,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_265]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_309,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc11,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_296]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_512,negated_conjecture,
% 1.04/1.24 ( of(skc8,skc11,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_309]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_81,negated_conjecture,
% 1.04/1.24 ( agent(skc8,skc9,skc12) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_87) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_184,negated_conjecture,
% 1.04/1.24 ( agent(skc8,skc9,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_81]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_264,negated_conjecture,
% 1.04/1.24 ( agent(skc8,skc9,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_184]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_297,negated_conjecture,
% 1.04/1.24 ( agent(skc8,skc9,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_264]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_308,negated_conjecture,
% 1.04/1.24 ( agent(skc8,skc9,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_297]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_510,negated_conjecture,
% 1.04/1.24 ( agent(skc8,skc9,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_308]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_80,negated_conjecture,
% 1.04/1.24 ( agent(skc10,skc13,skc12) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_86) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_182,negated_conjecture,
% 1.04/1.24 ( agent(skc10,skc13,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_80]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_263,negated_conjecture,
% 1.04/1.24 ( agent(skc10,skc13,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_182]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_298,negated_conjecture,
% 1.04/1.24 ( agent(skc10,skc13,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_263]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_307,negated_conjecture,
% 1.04/1.24 ( agent(skc10,skc13,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_298]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_508,negated_conjecture,
% 1.04/1.24 ( agent(skc10,skc13,skc12) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_307]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_79,negated_conjecture,
% 1.04/1.24 ( theme(skc8,skc9,skc10) = true ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_85) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_180,negated_conjecture,
% 1.04/1.24 ( theme(skc8,skc9,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_79]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_262,negated_conjecture,
% 1.04/1.24 ( theme(skc8,skc9,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_180]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_299,negated_conjecture,
% 1.04/1.24 ( theme(skc8,skc9,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_262]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_306,negated_conjecture,
% 1.04/1.24 ( theme(skc8,skc9,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_299]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_506,negated_conjecture,
% 1.04/1.24 ( theme(skc8,skc9,skc10) = true ),
% 1.04/1.24 inference(copy,[status(esa)],[c_306]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_78,negated_conjecture,
% 1.04/1.24 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_84) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_178,negated_conjecture,
% 1.04/1.24 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.04/1.24 inference(copy,[status(esa)],[c_78]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_261,negated_conjecture,
% 1.04/1.24 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.04/1.24 inference(copy,[status(esa)],[c_178]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_300,negated_conjecture,
% 1.04/1.24 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.04/1.24 inference(copy,[status(esa)],[c_261]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_305,negated_conjecture,
% 1.04/1.24 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.04/1.24 inference(copy,[status(esa)],[c_300]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_504,negated_conjecture,
% 1.04/1.24 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.04/1.24 inference(copy,[status(esa)],[c_305]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_77,negated_conjecture,
% 1.04/1.24 ( b != a ),
% 1.04/1.24 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_104) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_176,negated_conjecture,
% 1.04/1.24 ( b != a ),
% 1.04/1.24 inference(copy,[status(esa)],[c_77]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_260,negated_conjecture,
% 1.04/1.24 ( b != a ),
% 1.04/1.24 inference(copy,[status(esa)],[c_176]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_301,negated_conjecture,
% 1.04/1.24 ( b != a ),
% 1.04/1.24 inference(copy,[status(esa)],[c_260]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_304,negated_conjecture,
% 1.04/1.24 ( b != a ),
% 1.04/1.24 inference(copy,[status(esa)],[c_301]) ).
% 1.04/1.24
% 1.04/1.24 cnf(c_502,negated_conjecture,
% 1.04/1.24 ( b != a ),
% 1.04/1.24 inference(copy,[status(esa)],[c_304]) ).
% 1.04/1.24
% 1.04/1.24
% 1.04/1.24
% 1.04/1.24 % ------ Statistics
% 1.04/1.24
% 1.04/1.24 % ------ General
% 1.04/1.24
% 1.04/1.24 % num_of_input_clauses: 98
% 1.04/1.24 % num_of_input_neg_conjectures: 21
% 1.04/1.24 % num_of_splits: 0
% 1.04/1.24 % num_of_split_atoms: 0
% 1.04/1.24 % num_of_sem_filtered_clauses: 0
% 1.04/1.24 % num_of_subtypes: 0
% 1.04/1.24 % monotx_restored_types: 0
% 1.04/1.24 % sat_num_of_epr_types: 0
% 1.04/1.24 % sat_num_of_non_cyclic_types: 0
% 1.04/1.24 % sat_guarded_non_collapsed_types: 0
% 1.04/1.24 % is_epr: 0
% 1.04/1.24 % is_horn: 1
% 1.04/1.24 % has_eq: 1
% 1.04/1.24 % num_pure_diseq_elim: 0
% 1.04/1.24 % simp_replaced_by: 0
% 1.04/1.24 % res_preprocessed: 42
% 1.04/1.24 % prep_upred: 0
% 1.04/1.24 % prep_unflattend: 0
% 1.04/1.24 % pred_elim_cands: 0
% 1.04/1.24 % pred_elim: 0
% 1.04/1.24 % pred_elim_cl: 0
% 1.04/1.24 % pred_elim_cycles: 0
% 1.04/1.24 % forced_gc_time: 0
% 1.04/1.24 % gc_basic_clause_elim: 0
% 1.04/1.24 % parsing_time: 0.004
% 1.04/1.24 % sem_filter_time: 0.
% 1.04/1.24 % pred_elim_time: 0.
% 1.04/1.24 % out_proof_time: 0.
% 1.04/1.24 % monotx_time: 0.
% 1.04/1.24 % subtype_inf_time: 0.
% 1.04/1.24 % unif_index_cands_time: 0.
% 1.04/1.24 % unif_index_add_time: 0.
% 1.04/1.24 % total_time: 0.839
% 1.04/1.24 % num_of_symbols: 78
% 1.04/1.24 % num_of_terms: 834
% 1.04/1.24
% 1.04/1.24 % ------ Propositional Solver
% 1.04/1.24
% 1.04/1.24 % prop_solver_calls: 1
% 1.04/1.24 % prop_fast_solver_calls: 63
% 1.04/1.24 % prop_num_of_clauses: 176
% 1.04/1.24 % prop_preprocess_simplified: 352
% 1.04/1.24 % prop_fo_subsumed: 0
% 1.04/1.24 % prop_solver_time: 0.
% 1.04/1.24 % prop_fast_solver_time: 0.
% 1.04/1.24 % prop_unsat_core_time: 0.
% 1.04/1.24
% 1.04/1.24 % ------ QBF
% 1.04/1.24
% 1.04/1.24 % qbf_q_res: 0
% 1.04/1.24 % qbf_num_tautologies: 0
% 1.04/1.24 % qbf_prep_cycles: 0
% 1.04/1.24
% 1.04/1.24 % ------ BMC1
% 1.04/1.24
% 1.04/1.24 % bmc1_current_bound: -1
% 1.04/1.24 % bmc1_last_solved_bound: -1
% 1.04/1.24 % bmc1_unsat_core_size: -1
% 1.04/1.24 % bmc1_unsat_core_parents_size: -1
% 1.04/1.24 % bmc1_merge_next_fun: 0
% 1.04/1.24 % bmc1_unsat_core_clauses_time: 0.
% 1.04/1.24
% 1.04/1.24 % ------ Instantiation
% 1.04/1.24
% 1.04/1.24 % inst_num_of_clauses: 98
% 1.04/1.24 % inst_num_in_passive: 0
% 1.04/1.24 % inst_num_in_active: 0
% 1.04/1.24 % inst_num_in_unprocessed: 98
% 1.04/1.24 % inst_num_of_loops: 0
% 1.04/1.24 % inst_num_of_learning_restarts: 0
% 1.04/1.24 % inst_num_moves_active_passive: 0
% 1.04/1.25 % inst_lit_activity: 0
% 1.04/1.25 % inst_lit_activity_moves: 0
% 1.04/1.25 % inst_num_tautologies: 0
% 1.04/1.25 % inst_num_prop_implied: 0
% 1.04/1.25 % inst_num_existing_simplified: 0
% 1.04/1.25 % inst_num_eq_res_simplified: 0
% 1.04/1.25 % inst_num_child_elim: 0
% 1.04/1.25 % inst_num_of_dismatching_blockings: 0
% 1.04/1.25 % inst_num_of_non_proper_insts: 0
% 1.04/1.25 % inst_num_of_duplicates: 0
% 1.04/1.25 % inst_inst_num_from_inst_to_res: 0
% 1.04/1.25 % inst_dismatching_checking_time: 0.
% 1.04/1.25
% 1.04/1.25 % ------ Resolution
% 1.04/1.25
% 1.04/1.25 % res_num_of_clauses: 98
% 1.04/1.25 % res_num_in_passive: 0
% 1.04/1.25 % res_num_in_active: 21
% 1.04/1.25 % res_num_of_loops: 22
% 1.04/1.25 % res_forward_subset_subsumed: 0
% 1.04/1.25 % res_backward_subset_subsumed: 0
% 1.04/1.25 % res_forward_subsumed: 0
% 1.04/1.25 % res_backward_subsumed: 0
% 1.04/1.25 % res_forward_subsumption_resolution: 0
% 1.04/1.25 % res_backward_subsumption_resolution: 0
% 1.04/1.25 % res_clause_to_clause_subsumption: 0
% 1.04/1.25 % res_orphan_elimination: 0
% 1.04/1.25 % res_tautology_del: 0
% 1.04/1.25 % res_num_eq_res_simplified: 0
% 1.04/1.25 % res_num_sel_changes: 0
% 1.04/1.25 % res_moves_from_active_to_pass: 0
% 1.04/1.25
% 1.04/1.25 % Status Unknown
% 1.10/1.29 % Orienting using strategy ClausalAll
% 1.10/1.29 % Orientation found
% 1.10/1.29 % 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/sandbox/tmp/iprover_proof_66cbf3.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_ae1bcf | grep -v "SZS"
% 1.10/1.31
% 1.10/1.31 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.10/1.31
% 1.10/1.31 %
% 1.10/1.31 % ------ iProver source info
% 1.10/1.31
% 1.10/1.31 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.10/1.31 % git: non_committed_changes: true
% 1.10/1.31 % git: last_make_outside_of_git: true
% 1.10/1.31
% 1.10/1.31 %
% 1.10/1.31 % ------ Input Options
% 1.10/1.31
% 1.10/1.31 % --out_options all
% 1.10/1.31 % --tptp_safe_out true
% 1.10/1.31 % --problem_path ""
% 1.10/1.31 % --include_path ""
% 1.10/1.31 % --clausifier .//eprover
% 1.10/1.31 % --clausifier_options --tstp-format
% 1.10/1.31 % --stdin false
% 1.10/1.31 % --dbg_backtrace false
% 1.10/1.31 % --dbg_dump_prop_clauses false
% 1.10/1.31 % --dbg_dump_prop_clauses_file -
% 1.10/1.31 % --dbg_out_stat false
% 1.10/1.31
% 1.10/1.31 % ------ General Options
% 1.10/1.31
% 1.10/1.31 % --fof false
% 1.10/1.31 % --time_out_real 150.
% 1.10/1.31 % --time_out_prep_mult 0.2
% 1.10/1.31 % --time_out_virtual -1.
% 1.10/1.31 % --schedule none
% 1.10/1.31 % --ground_splitting input
% 1.10/1.31 % --splitting_nvd 16
% 1.10/1.31 % --non_eq_to_eq false
% 1.10/1.31 % --prep_gs_sim true
% 1.10/1.31 % --prep_unflatten false
% 1.10/1.31 % --prep_res_sim true
% 1.10/1.31 % --prep_upred true
% 1.10/1.31 % --res_sim_input true
% 1.10/1.31 % --clause_weak_htbl true
% 1.10/1.31 % --gc_record_bc_elim false
% 1.10/1.31 % --symbol_type_check false
% 1.10/1.31 % --clausify_out false
% 1.10/1.31 % --large_theory_mode false
% 1.10/1.31 % --prep_sem_filter none
% 1.10/1.31 % --prep_sem_filter_out false
% 1.10/1.31 % --preprocessed_out false
% 1.10/1.31 % --sub_typing false
% 1.10/1.31 % --brand_transform false
% 1.10/1.31 % --pure_diseq_elim true
% 1.10/1.31 % --min_unsat_core false
% 1.10/1.31 % --pred_elim true
% 1.10/1.31 % --add_important_lit false
% 1.10/1.31 % --soft_assumptions false
% 1.10/1.31 % --reset_solvers false
% 1.10/1.31 % --bc_imp_inh []
% 1.10/1.31 % --conj_cone_tolerance 1.5
% 1.10/1.31 % --prolific_symb_bound 500
% 1.10/1.31 % --lt_threshold 2000
% 1.10/1.31
% 1.10/1.31 % ------ SAT Options
% 1.10/1.31
% 1.10/1.31 % --sat_mode false
% 1.10/1.31 % --sat_fm_restart_options ""
% 1.10/1.31 % --sat_gr_def false
% 1.10/1.31 % --sat_epr_types true
% 1.10/1.31 % --sat_non_cyclic_types false
% 1.10/1.31 % --sat_finite_models false
% 1.10/1.31 % --sat_fm_lemmas false
% 1.10/1.31 % --sat_fm_prep false
% 1.10/1.31 % --sat_fm_uc_incr true
% 1.10/1.31 % --sat_out_model small
% 1.10/1.31 % --sat_out_clauses false
% 1.10/1.31
% 1.10/1.31 % ------ QBF Options
% 1.10/1.31
% 1.10/1.31 % --qbf_mode false
% 1.10/1.31 % --qbf_elim_univ true
% 1.10/1.31 % --qbf_sk_in true
% 1.10/1.31 % --qbf_pred_elim true
% 1.10/1.31 % --qbf_split 32
% 1.10/1.31
% 1.10/1.31 % ------ BMC1 Options
% 1.10/1.31
% 1.10/1.31 % --bmc1_incremental false
% 1.10/1.31 % --bmc1_axioms reachable_all
% 1.10/1.31 % --bmc1_min_bound 0
% 1.10/1.31 % --bmc1_max_bound -1
% 1.10/1.31 % --bmc1_max_bound_default -1
% 1.10/1.31 % --bmc1_symbol_reachability true
% 1.10/1.31 % --bmc1_property_lemmas false
% 1.10/1.31 % --bmc1_k_induction false
% 1.10/1.31 % --bmc1_non_equiv_states false
% 1.10/1.31 % --bmc1_deadlock false
% 1.10/1.31 % --bmc1_ucm false
% 1.10/1.31 % --bmc1_add_unsat_core none
% 1.10/1.31 % --bmc1_unsat_core_children false
% 1.10/1.31 % --bmc1_unsat_core_extrapolate_axioms false
% 1.10/1.31 % --bmc1_out_stat full
% 1.10/1.31 % --bmc1_ground_init false
% 1.10/1.31 % --bmc1_pre_inst_next_state false
% 1.10/1.31 % --bmc1_pre_inst_state false
% 1.10/1.31 % --bmc1_pre_inst_reach_state false
% 1.10/1.31 % --bmc1_out_unsat_core false
% 1.10/1.31 % --bmc1_aig_witness_out false
% 1.10/1.31 % --bmc1_verbose false
% 1.10/1.31 % --bmc1_dump_clauses_tptp false
% 1.83/2.14 % --bmc1_dump_unsat_core_tptp false
% 1.83/2.14 % --bmc1_dump_file -
% 1.83/2.14 % --bmc1_ucm_expand_uc_limit 128
% 1.83/2.14 % --bmc1_ucm_n_expand_iterations 6
% 1.83/2.14 % --bmc1_ucm_extend_mode 1
% 1.83/2.14 % --bmc1_ucm_init_mode 2
% 1.83/2.14 % --bmc1_ucm_cone_mode none
% 1.83/2.14 % --bmc1_ucm_reduced_relation_type 0
% 1.83/2.14 % --bmc1_ucm_relax_model 4
% 1.83/2.14 % --bmc1_ucm_full_tr_after_sat true
% 1.83/2.14 % --bmc1_ucm_expand_neg_assumptions false
% 1.83/2.14 % --bmc1_ucm_layered_model none
% 1.83/2.14 % --bmc1_ucm_max_lemma_size 10
% 1.83/2.14
% 1.83/2.14 % ------ AIG Options
% 1.83/2.14
% 1.83/2.14 % --aig_mode false
% 1.83/2.14
% 1.83/2.14 % ------ Instantiation Options
% 1.83/2.14
% 1.83/2.14 % --instantiation_flag true
% 1.83/2.14 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.83/2.14 % --inst_solver_per_active 750
% 1.83/2.14 % --inst_solver_calls_frac 0.5
% 1.83/2.14 % --inst_passive_queue_type priority_queues
% 1.83/2.14 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.83/2.14 % --inst_passive_queues_freq [25;2]
% 1.83/2.14 % --inst_dismatching true
% 1.83/2.14 % --inst_eager_unprocessed_to_passive true
% 1.83/2.14 % --inst_prop_sim_given true
% 1.83/2.14 % --inst_prop_sim_new false
% 1.83/2.14 % --inst_orphan_elimination true
% 1.83/2.14 % --inst_learning_loop_flag true
% 1.83/2.14 % --inst_learning_start 3000
% 1.83/2.14 % --inst_learning_factor 2
% 1.83/2.14 % --inst_start_prop_sim_after_learn 3
% 1.83/2.14 % --inst_sel_renew solver
% 1.83/2.14 % --inst_lit_activity_flag true
% 1.83/2.14 % --inst_out_proof true
% 1.83/2.14
% 1.83/2.14 % ------ Resolution Options
% 1.83/2.14
% 1.83/2.14 % --resolution_flag true
% 1.83/2.14 % --res_lit_sel kbo_max
% 1.83/2.14 % --res_to_prop_solver none
% 1.83/2.14 % --res_prop_simpl_new false
% 1.83/2.14 % --res_prop_simpl_given false
% 1.83/2.14 % --res_passive_queue_type priority_queues
% 1.83/2.14 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.83/2.14 % --res_passive_queues_freq [15;5]
% 1.83/2.14 % --res_forward_subs full
% 1.83/2.14 % --res_backward_subs full
% 1.83/2.14 % --res_forward_subs_resolution true
% 1.83/2.14 % --res_backward_subs_resolution true
% 1.83/2.14 % --res_orphan_elimination false
% 1.83/2.14 % --res_time_limit 1000.
% 1.83/2.14 % --res_out_proof true
% 1.83/2.14 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_66cbf3.s
% 1.83/2.14 % --modulo true
% 1.83/2.14
% 1.83/2.14 % ------ Combination Options
% 1.83/2.14
% 1.83/2.14 % --comb_res_mult 1000
% 1.83/2.14 % --comb_inst_mult 300
% 1.83/2.14 % ------
% 1.83/2.14
% 1.83/2.14 % ------ Parsing...% successful
% 1.83/2.14
% 1.83/2.14 % ------ 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.83/2.14
% 1.83/2.14 % ------ Proving...
% 1.83/2.14 % ------ Problem Properties
% 1.83/2.14
% 1.83/2.14 %
% 1.83/2.14 % EPR false
% 1.83/2.14 % Horn true
% 1.83/2.14 % Has equality true
% 1.83/2.14
% 1.83/2.14 % % ------ Input Options Time Limit: Unbounded
% 1.83/2.14
% 1.83/2.14
% 1.83/2.14 Compiling...
% 1.83/2.14 Loading plugin: done.
% 1.83/2.14 % % ------ Current options:
% 1.83/2.14
% 1.83/2.14 % ------ Input Options
% 1.83/2.14
% 1.83/2.14 % --out_options all
% 1.83/2.14 % --tptp_safe_out true
% 1.83/2.14 % --problem_path ""
% 1.83/2.14 % --include_path ""
% 1.83/2.14 % --clausifier .//eprover
% 1.83/2.14 % --clausifier_options --tstp-format
% 1.83/2.14 % --stdin false
% 1.83/2.14 % --dbg_backtrace false
% 1.83/2.14 % --dbg_dump_prop_clauses false
% 1.83/2.14 % --dbg_dump_prop_clauses_file -
% 1.83/2.14 % --dbg_out_stat false
% 1.83/2.14
% 1.83/2.14 % ------ General Options
% 1.83/2.14
% 1.83/2.14 % --fof false
% 1.83/2.14 % --time_out_real 150.
% 1.83/2.14 % --time_out_prep_mult 0.2
% 1.83/2.14 % --time_out_virtual -1.
% 1.83/2.14 % --schedule none
% 1.83/2.14 % --ground_splitting input
% 1.83/2.14 % --splitting_nvd 16
% 1.83/2.14 % --non_eq_to_eq false
% 1.83/2.14 % --prep_gs_sim true
% 1.83/2.14 % --prep_unflatten false
% 1.83/2.14 % --prep_res_sim true
% 1.83/2.14 % --prep_upred true
% 1.83/2.14 % --res_sim_input true
% 1.83/2.14 % --clause_weak_htbl true
% 1.83/2.14 % --gc_record_bc_elim false
% 1.83/2.14 % --symbol_type_check false
% 1.83/2.14 % --clausify_out false
% 1.83/2.14 % --large_theory_mode false
% 1.83/2.14 % --prep_sem_filter none
% 1.83/2.14 % --prep_sem_filter_out false
% 1.83/2.14 % --preprocessed_out false
% 1.83/2.14 % --sub_typing false
% 1.83/2.14 % --brand_transform false
% 1.83/2.14 % --pure_diseq_elim true
% 1.83/2.14 % --min_unsat_core false
% 1.83/2.14 % --pred_elim true
% 1.83/2.14 % --add_important_lit false
% 1.83/2.14 % --soft_assumptions false
% 1.83/2.14 % --reset_solvers false
% 1.83/2.14 % --bc_imp_inh []
% 1.83/2.14 % --conj_cone_tolerance 1.5
% 1.83/2.14 % --prolific_symb_bound 500
% 1.83/2.14 % --lt_threshold 2000
% 1.83/2.14
% 1.83/2.14 % ------ SAT Options
% 1.83/2.14
% 1.83/2.14 % --sat_mode false
% 1.83/2.14 % --sat_fm_restart_options ""
% 1.83/2.14 % --sat_gr_def false
% 1.83/2.14 % --sat_epr_types true
% 1.83/2.14 % --sat_non_cyclic_types false
% 1.83/2.14 % --sat_finite_models false
% 1.83/2.14 % --sat_fm_lemmas false
% 1.83/2.14 % --sat_fm_prep false
% 1.83/2.14 % --sat_fm_uc_incr true
% 1.83/2.14 % --sat_out_model small
% 1.83/2.14 % --sat_out_clauses false
% 1.83/2.14
% 1.83/2.14 % ------ QBF Options
% 1.83/2.14
% 1.83/2.14 % --qbf_mode false
% 1.83/2.14 % --qbf_elim_univ true
% 1.83/2.14 % --qbf_sk_in true
% 1.83/2.14 % --qbf_pred_elim true
% 1.83/2.14 % --qbf_split 32
% 1.83/2.14
% 1.83/2.14 % ------ BMC1 Options
% 1.83/2.14
% 1.83/2.14 % --bmc1_incremental false
% 1.83/2.14 % --bmc1_axioms reachable_all
% 1.83/2.14 % --bmc1_min_bound 0
% 1.83/2.14 % --bmc1_max_bound -1
% 1.83/2.14 % --bmc1_max_bound_default -1
% 1.83/2.14 % --bmc1_symbol_reachability true
% 1.83/2.14 % --bmc1_property_lemmas false
% 1.83/2.14 % --bmc1_k_induction false
% 1.83/2.14 % --bmc1_non_equiv_states false
% 1.83/2.14 % --bmc1_deadlock false
% 1.83/2.14 % --bmc1_ucm false
% 1.83/2.14 % --bmc1_add_unsat_core none
% 1.83/2.14 % --bmc1_unsat_core_children false
% 1.83/2.14 % --bmc1_unsat_core_extrapolate_axioms false
% 1.83/2.14 % --bmc1_out_stat full
% 1.83/2.14 % --bmc1_ground_init false
% 1.83/2.14 % --bmc1_pre_inst_next_state false
% 1.83/2.14 % --bmc1_pre_inst_state false
% 1.83/2.14 % --bmc1_pre_inst_reach_state false
% 1.83/2.14 % --bmc1_out_unsat_core false
% 1.83/2.14 % --bmc1_aig_witness_out false
% 1.83/2.14 % --bmc1_verbose false
% 1.83/2.14 % --bmc1_dump_clauses_tptp false
% 1.83/2.14 % --bmc1_dump_unsat_core_tptp false
% 1.83/2.14 % --bmc1_dump_file -
% 1.83/2.14 % --bmc1_ucm_expand_uc_limit 128
% 1.83/2.14 % --bmc1_ucm_n_expand_iterations 6
% 1.83/2.14 % --bmc1_ucm_extend_mode 1
% 1.83/2.14 % --bmc1_ucm_init_mode 2
% 1.83/2.14 % --bmc1_ucm_cone_mode none
% 1.83/2.14 % --bmc1_ucm_reduced_relation_type 0
% 1.83/2.14 % --bmc1_ucm_relax_model 4
% 1.83/2.14 % --bmc1_ucm_full_tr_after_sat true
% 1.83/2.14 % --bmc1_ucm_expand_neg_assumptions false
% 1.83/2.14 % --bmc1_ucm_layered_model none
% 1.83/2.14 % --bmc1_ucm_max_lemma_size 10
% 1.83/2.14
% 1.83/2.14 % ------ AIG Options
% 1.83/2.14
% 1.83/2.14 % --aig_mode false
% 1.83/2.14
% 1.83/2.14 % ------ Instantiation Options
% 1.83/2.14
% 1.83/2.14 % --instantiation_flag true
% 1.83/2.14 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.83/2.14 % --inst_solver_per_active 750
% 1.83/2.14 % --inst_solver_calls_frac 0.5
% 1.83/2.14 % --inst_passive_queue_type priority_queues
% 1.83/2.14 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.83/2.14 % --inst_passive_queues_freq [25;2]
% 1.83/2.14 % --inst_dismatching true
% 1.83/2.14 % --inst_eager_unprocessed_to_passive true
% 1.83/2.14 % --inst_prop_sim_given true
% 1.83/2.14 % --inst_prop_sim_new false
% 1.83/2.14 % --inst_orphan_elimination true
% 1.83/2.14 % --inst_learning_loop_flag true
% 1.83/2.14 % --inst_learning_start 3000
% 1.83/2.14 % --inst_learning_factor 2
% 1.83/2.14 % --inst_start_prop_sim_after_learn 3
% 1.83/2.14 % --inst_sel_renew solver
% 1.83/2.14 % --inst_lit_activity_flag true
% 1.83/2.14 % --inst_out_proof true
% 1.83/2.14
% 1.83/2.14 % ------ Resolution Options
% 1.83/2.14
% 1.83/2.14 % --resolution_flag true
% 1.83/2.14 % --res_lit_sel kbo_max
% 1.83/2.14 % --res_to_prop_solver none
% 1.83/2.14 % --res_prop_simpl_new false
% 1.83/2.14 % --res_prop_simpl_given false
% 1.83/2.14 % --res_passive_queue_type priority_queues
% 1.83/2.14 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.83/2.14 % --res_passive_queues_freq [15;5]
% 1.83/2.14 % --res_forward_subs full
% 1.83/2.14 % --res_backward_subs full
% 1.83/2.14 % --res_forward_subs_resolution true
% 1.83/2.14 % --res_backward_subs_resolution true
% 1.83/2.14 % --res_orphan_elimination false
% 1.83/2.14 % --res_time_limit 1000.
% 1.83/2.14 % --res_out_proof true
% 1.83/2.14 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_66cbf3.s
% 1.83/2.14 % --modulo true
% 1.83/2.14
% 1.83/2.14 % ------ Combination Options
% 1.83/2.14
% 1.83/2.14 % --comb_res_mult 1000
% 1.83/2.14 % --comb_inst_mult 300
% 1.83/2.14 % ------
% 1.83/2.14
% 1.83/2.14
% 1.83/2.14
% 1.83/2.14 % ------ Proving...
% 1.83/2.14 % warning: shown sat in sat incomplete mode
% 1.83/2.14 %
% 1.83/2.14
% 1.83/2.14
% 1.83/2.14
% 1.83/2.14
% 1.83/2.14 cnf(c_97,negated_conjecture,
% 1.83/2.14 ( actual_world(skc8) = true ),
% 1.83/2.14 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_103) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_216,negated_conjecture,
% 1.83/2.14 ( actual_world(skc8) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_97]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_280,negated_conjecture,
% 1.83/2.14 ( actual_world(skc8) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_216]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_281,negated_conjecture,
% 1.83/2.14 ( actual_world(skc8) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_280]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_303,negated_conjecture,
% 1.83/2.14 ( actual_world(skc8) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_281]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_500,negated_conjecture,
% 1.83/2.14 ( actual_world(skc8) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_303]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_96,negated_conjecture,
% 1.83/2.14 ( man(skc8,skc15) = true ),
% 1.83/2.14 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_102) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_214,negated_conjecture,
% 1.83/2.14 ( man(skc8,skc15) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_96]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_279,negated_conjecture,
% 1.83/2.14 ( man(skc8,skc15) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_214]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_282,negated_conjecture,
% 1.83/2.14 ( man(skc8,skc15) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_279]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_302,negated_conjecture,
% 1.83/2.14 ( man(skc8,skc15) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_282]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_498,negated_conjecture,
% 1.83/2.14 ( man(skc8,skc15) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_302]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_95,negated_conjecture,
% 1.83/2.14 ( event(skc10,skc13) = true ),
% 1.83/2.14 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_101) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_212,negated_conjecture,
% 1.83/2.14 ( event(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_95]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_278,negated_conjecture,
% 1.83/2.14 ( event(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_212]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_283,negated_conjecture,
% 1.83/2.14 ( event(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_278]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_322,negated_conjecture,
% 1.83/2.14 ( event(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_283]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_538,negated_conjecture,
% 1.83/2.14 ( event(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_322]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_94,negated_conjecture,
% 1.83/2.14 ( woman(skc8,skc12) = true ),
% 1.83/2.14 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_100) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_210,negated_conjecture,
% 1.83/2.14 ( woman(skc8,skc12) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_94]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_277,negated_conjecture,
% 1.83/2.14 ( woman(skc8,skc12) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_210]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_284,negated_conjecture,
% 1.83/2.14 ( woman(skc8,skc12) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_277]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_321,negated_conjecture,
% 1.83/2.14 ( woman(skc8,skc12) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_284]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_536,negated_conjecture,
% 1.83/2.14 ( woman(skc8,skc12) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_321]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_93,negated_conjecture,
% 1.83/2.14 ( present(skc10,skc13) = true ),
% 1.83/2.14 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_99) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_208,negated_conjecture,
% 1.83/2.14 ( present(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_93]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_276,negated_conjecture,
% 1.83/2.14 ( present(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_208]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_285,negated_conjecture,
% 1.83/2.14 ( present(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_276]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_320,negated_conjecture,
% 1.83/2.14 ( present(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_285]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_534,negated_conjecture,
% 1.83/2.14 ( present(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_320]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_92,negated_conjecture,
% 1.83/2.14 ( dance(skc10,skc13) = true ),
% 1.83/2.14 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_98) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_206,negated_conjecture,
% 1.83/2.14 ( dance(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_92]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_275,negated_conjecture,
% 1.83/2.14 ( dance(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_206]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_286,negated_conjecture,
% 1.83/2.14 ( dance(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_275]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_319,negated_conjecture,
% 1.83/2.14 ( dance(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_286]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_532,negated_conjecture,
% 1.83/2.14 ( dance(skc10,skc13) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_319]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_91,negated_conjecture,
% 1.83/2.14 ( forename(skc8,skc11) = true ),
% 1.83/2.14 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_97) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_204,negated_conjecture,
% 1.83/2.14 ( forename(skc8,skc11) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_91]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_274,negated_conjecture,
% 1.83/2.14 ( forename(skc8,skc11) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_204]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_287,negated_conjecture,
% 1.83/2.14 ( forename(skc8,skc11) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_274]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_318,negated_conjecture,
% 1.83/2.14 ( forename(skc8,skc11) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_287]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_530,negated_conjecture,
% 1.83/2.14 ( forename(skc8,skc11) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_318]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_90,negated_conjecture,
% 1.83/2.14 ( mia_forename(skc8,skc11) = true ),
% 1.83/2.14 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_96) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_202,negated_conjecture,
% 1.83/2.14 ( mia_forename(skc8,skc11) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_90]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_273,negated_conjecture,
% 1.83/2.14 ( mia_forename(skc8,skc11) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_202]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_288,negated_conjecture,
% 1.83/2.14 ( mia_forename(skc8,skc11) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_273]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_317,negated_conjecture,
% 1.83/2.14 ( mia_forename(skc8,skc11) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_288]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_528,negated_conjecture,
% 1.83/2.14 ( mia_forename(skc8,skc11) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_317]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_89,negated_conjecture,
% 1.83/2.14 ( proposition(skc8,skc10) = true ),
% 1.83/2.14 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_95) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_200,negated_conjecture,
% 1.83/2.14 ( proposition(skc8,skc10) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_89]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_272,negated_conjecture,
% 1.83/2.14 ( proposition(skc8,skc10) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_200]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_289,negated_conjecture,
% 1.83/2.14 ( proposition(skc8,skc10) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_272]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_316,negated_conjecture,
% 1.83/2.14 ( proposition(skc8,skc10) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_289]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_526,negated_conjecture,
% 1.83/2.14 ( proposition(skc8,skc10) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_316]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_88,negated_conjecture,
% 1.83/2.14 ( accessible_world(skc8,skc10) = true ),
% 1.83/2.14 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_94) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_198,negated_conjecture,
% 1.83/2.14 ( accessible_world(skc8,skc10) = true ),
% 1.83/2.14 inference(copy,[status(esa)],[c_88]) ).
% 1.83/2.14
% 1.83/2.14 cnf(c_271,negated_conjecture,
% 1.83/2.15 ( accessible_world(skc8,skc10) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_198]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_290,negated_conjecture,
% 1.83/2.15 ( accessible_world(skc8,skc10) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_271]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_315,negated_conjecture,
% 1.83/2.15 ( accessible_world(skc8,skc10) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_290]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_524,negated_conjecture,
% 1.83/2.15 ( accessible_world(skc8,skc10) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_315]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_87,negated_conjecture,
% 1.83/2.15 ( desire_want(skc8,skc9) = true ),
% 1.83/2.15 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_93) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_196,negated_conjecture,
% 1.83/2.15 ( desire_want(skc8,skc9) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_87]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_270,negated_conjecture,
% 1.83/2.15 ( desire_want(skc8,skc9) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_196]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_291,negated_conjecture,
% 1.83/2.15 ( desire_want(skc8,skc9) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_270]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_314,negated_conjecture,
% 1.83/2.15 ( desire_want(skc8,skc9) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_291]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_522,negated_conjecture,
% 1.83/2.15 ( desire_want(skc8,skc9) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_314]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_86,negated_conjecture,
% 1.83/2.15 ( present(skc8,skc9) = true ),
% 1.83/2.15 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_92) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_194,negated_conjecture,
% 1.83/2.15 ( present(skc8,skc9) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_86]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_269,negated_conjecture,
% 1.83/2.15 ( present(skc8,skc9) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_194]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_292,negated_conjecture,
% 1.83/2.15 ( present(skc8,skc9) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_269]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_313,negated_conjecture,
% 1.83/2.15 ( present(skc8,skc9) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_292]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_520,negated_conjecture,
% 1.83/2.15 ( present(skc8,skc9) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_313]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_85,negated_conjecture,
% 1.83/2.15 ( forename(skc8,skc14) = true ),
% 1.83/2.15 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_91) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_192,negated_conjecture,
% 1.83/2.15 ( forename(skc8,skc14) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_85]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_268,negated_conjecture,
% 1.83/2.15 ( forename(skc8,skc14) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_192]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_293,negated_conjecture,
% 1.83/2.15 ( forename(skc8,skc14) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_268]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_312,negated_conjecture,
% 1.83/2.15 ( forename(skc8,skc14) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_293]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_518,negated_conjecture,
% 1.83/2.15 ( forename(skc8,skc14) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_312]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_84,negated_conjecture,
% 1.83/2.15 ( vincent_forename(skc8,skc14) = true ),
% 1.83/2.15 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_90) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_190,negated_conjecture,
% 1.83/2.15 ( vincent_forename(skc8,skc14) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_84]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_267,negated_conjecture,
% 1.83/2.15 ( vincent_forename(skc8,skc14) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_190]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_294,negated_conjecture,
% 1.83/2.15 ( vincent_forename(skc8,skc14) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_267]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_311,negated_conjecture,
% 1.83/2.15 ( vincent_forename(skc8,skc14) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_294]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_516,negated_conjecture,
% 1.83/2.15 ( vincent_forename(skc8,skc14) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_311]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_83,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc14,skc15) = true ),
% 1.83/2.15 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_89) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_188,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc14,skc15) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_83]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_266,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc14,skc15) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_188]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_295,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc14,skc15) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_266]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_310,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc14,skc15) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_295]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_514,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc14,skc15) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_310]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_82,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc11,skc12) = true ),
% 1.83/2.15 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_88) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_186,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc11,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_82]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_265,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc11,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_186]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_296,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc11,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_265]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_309,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc11,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_296]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_512,negated_conjecture,
% 1.83/2.15 ( of(skc8,skc11,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_309]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_81,negated_conjecture,
% 1.83/2.15 ( agent(skc8,skc9,skc12) = true ),
% 1.83/2.15 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_87) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_184,negated_conjecture,
% 1.83/2.15 ( agent(skc8,skc9,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_81]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_264,negated_conjecture,
% 1.83/2.15 ( agent(skc8,skc9,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_184]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_297,negated_conjecture,
% 1.83/2.15 ( agent(skc8,skc9,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_264]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_308,negated_conjecture,
% 1.83/2.15 ( agent(skc8,skc9,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_297]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_510,negated_conjecture,
% 1.83/2.15 ( agent(skc8,skc9,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_308]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_80,negated_conjecture,
% 1.83/2.15 ( agent(skc10,skc13,skc12) = true ),
% 1.83/2.15 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_86) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_182,negated_conjecture,
% 1.83/2.15 ( agent(skc10,skc13,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_80]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_263,negated_conjecture,
% 1.83/2.15 ( agent(skc10,skc13,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_182]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_298,negated_conjecture,
% 1.83/2.15 ( agent(skc10,skc13,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_263]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_307,negated_conjecture,
% 1.83/2.15 ( agent(skc10,skc13,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_298]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_508,negated_conjecture,
% 1.83/2.15 ( agent(skc10,skc13,skc12) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_307]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_79,negated_conjecture,
% 1.83/2.15 ( theme(skc8,skc9,skc10) = true ),
% 1.83/2.15 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_85) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_180,negated_conjecture,
% 1.83/2.15 ( theme(skc8,skc9,skc10) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_79]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_262,negated_conjecture,
% 1.83/2.15 ( theme(skc8,skc9,skc10) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_180]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_299,negated_conjecture,
% 1.83/2.15 ( theme(skc8,skc9,skc10) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_262]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_306,negated_conjecture,
% 1.83/2.15 ( theme(skc8,skc9,skc10) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_299]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_506,negated_conjecture,
% 1.83/2.15 ( theme(skc8,skc9,skc10) = true ),
% 1.83/2.15 inference(copy,[status(esa)],[c_306]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_78,negated_conjecture,
% 1.83/2.15 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.83/2.15 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_84) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_178,negated_conjecture,
% 1.83/2.15 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.83/2.15 inference(copy,[status(esa)],[c_78]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_261,negated_conjecture,
% 1.83/2.15 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.83/2.15 inference(copy,[status(esa)],[c_178]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_300,negated_conjecture,
% 1.83/2.15 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.83/2.15 inference(copy,[status(esa)],[c_261]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_305,negated_conjecture,
% 1.83/2.15 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.83/2.15 inference(copy,[status(esa)],[c_300]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_504,negated_conjecture,
% 1.83/2.15 ( ifeq(tuple(dance(X0,X1),event(X0,X1),desire_want(skc8,X2),proposition(skc8,X0),accessible_world(skc8,X0),present(X0,X1),present(skc8,X2),agent(X0,X1,skc15),agent(skc8,X2,skc15),theme(skc8,X2,X0)),tuple(true,true,true,true,true,true,true,true,true,true),a,b) = b ),
% 1.83/2.15 inference(copy,[status(esa)],[c_305]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_77,negated_conjecture,
% 1.83/2.15 ( b != a ),
% 1.83/2.15 file('/export/starexec/sandbox/tmp/iprover_modulo_16d1c7.p', c_0_104) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_176,negated_conjecture,
% 1.83/2.15 ( b != a ),
% 1.83/2.15 inference(copy,[status(esa)],[c_77]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_260,negated_conjecture,
% 1.83/2.15 ( b != a ),
% 1.83/2.15 inference(copy,[status(esa)],[c_176]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_301,negated_conjecture,
% 1.83/2.15 ( b != a ),
% 1.83/2.15 inference(copy,[status(esa)],[c_260]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_304,negated_conjecture,
% 1.83/2.15 ( b != a ),
% 1.83/2.15 inference(copy,[status(esa)],[c_301]) ).
% 1.83/2.15
% 1.83/2.15 cnf(c_502,negated_conjecture,
% 1.83/2.15 ( b != a ),
% 1.83/2.15 inference(copy,[status(esa)],[c_304]) ).
% 1.83/2.15
% 1.83/2.15
% 1.83/2.15
% 1.83/2.15 % ------ Statistics
% 1.83/2.15
% 1.83/2.15 % ------ General
% 1.83/2.15
% 1.83/2.15 % num_of_input_clauses: 98
% 1.83/2.15 % num_of_input_neg_conjectures: 21
% 1.83/2.15 % num_of_splits: 0
% 1.83/2.15 % num_of_split_atoms: 0
% 1.83/2.15 % num_of_sem_filtered_clauses: 0
% 1.83/2.15 % num_of_subtypes: 0
% 1.83/2.15 % monotx_restored_types: 0
% 1.83/2.15 % sat_num_of_epr_types: 0
% 1.83/2.15 % sat_num_of_non_cyclic_types: 0
% 1.83/2.15 % sat_guarded_non_collapsed_types: 0
% 1.83/2.15 % is_epr: 0
% 1.83/2.15 % is_horn: 1
% 1.83/2.15 % has_eq: 1
% 1.83/2.15 % num_pure_diseq_elim: 0
% 1.83/2.15 % simp_replaced_by: 0
% 1.83/2.15 % res_preprocessed: 42
% 1.83/2.15 % prep_upred: 0
% 1.83/2.15 % prep_unflattend: 0
% 1.83/2.15 % pred_elim_cands: 0
% 1.83/2.15 % pred_elim: 0
% 1.83/2.15 % pred_elim_cl: 0
% 1.83/2.15 % pred_elim_cycles: 0
% 1.83/2.15 % forced_gc_time: 0
% 1.83/2.15 % gc_basic_clause_elim: 0
% 1.83/2.15 % parsing_time: 0.004
% 1.83/2.15 % sem_filter_time: 0.
% 1.83/2.15 % pred_elim_time: 0.
% 1.83/2.15 % out_proof_time: 0.
% 1.83/2.15 % monotx_time: 0.
% 1.83/2.15 % subtype_inf_time: 0.
% 1.83/2.15 % unif_index_cands_time: 0.
% 1.83/2.15 % unif_index_add_time: 0.
% 1.83/2.15 % total_time: 0.851
% 1.83/2.15 % num_of_symbols: 78
% 1.83/2.15 % num_of_terms: 653
% 1.83/2.15
% 1.83/2.15 % ------ Propositional Solver
% 1.83/2.15
% 1.83/2.15 % prop_solver_calls: 1
% 1.83/2.15 % prop_fast_solver_calls: 63
% 1.83/2.15 % prop_num_of_clauses: 176
% 1.83/2.15 % prop_preprocess_simplified: 352
% 1.83/2.15 % prop_fo_subsumed: 0
% 1.83/2.15 % prop_solver_time: 0.
% 1.83/2.15 % prop_fast_solver_time: 0.
% 1.83/2.15 % prop_unsat_core_time: 0.
% 1.83/2.15
% 1.83/2.15 % ------ QBF
% 1.83/2.15
% 1.83/2.15 % qbf_q_res: 0
% 1.83/2.15 % qbf_num_tautologies: 0
% 1.83/2.15 % qbf_prep_cycles: 0
% 1.83/2.15
% 1.83/2.15 % ------ BMC1
% 1.83/2.15
% 1.83/2.15 % bmc1_current_bound: -1
% 1.83/2.15 % bmc1_last_solved_bound: -1
% 1.83/2.15 % bmc1_unsat_core_size: -1
% 1.83/2.15 % bmc1_unsat_core_parents_size: -1
% 1.83/2.15 % bmc1_merge_next_fun: 0
% 1.83/2.15 % bmc1_unsat_core_clauses_time: 0.
% 1.83/2.15
% 1.83/2.15 % ------ Instantiation
% 1.83/2.15
% 1.83/2.15 % inst_num_of_clauses: 98
% 1.83/2.15 % inst_num_in_passive: 0
% 1.83/2.15 % inst_num_in_active: 0
% 1.83/2.15 % inst_num_in_unprocessed: 98
% 1.83/2.15 % inst_num_of_loops: 0
% 1.83/2.15 % inst_num_of_learning_restarts: 0
% 1.83/2.15 % inst_num_moves_active_passive: 0
% 1.83/2.15 % inst_lit_activity: 0
% 1.83/2.15 % inst_lit_activity_moves: 0
% 1.83/2.15 % inst_num_tautologies: 0
% 1.83/2.15 % inst_num_prop_implied: 0
% 1.83/2.15 % inst_num_existing_simplified: 0
% 1.83/2.15 % inst_num_eq_res_simplified: 0
% 1.83/2.15 % inst_num_child_elim: 0
% 1.83/2.15 % inst_num_of_dismatching_blockings: 0
% 1.83/2.15 % inst_num_of_non_proper_insts: 0
% 1.83/2.15 % inst_num_of_duplicates: 0
% 1.83/2.15 % inst_inst_num_from_inst_to_res: 0
% 1.83/2.15 % inst_dismatching_checking_time: 0.
% 1.83/2.15
% 1.83/2.15 % ------ Resolution
% 1.83/2.15
% 1.83/2.15 % res_num_of_clauses: 98
% 1.83/2.15 % res_num_in_passive: 0
% 1.83/2.15 % res_num_in_active: 21
% 1.83/2.15 % res_num_of_loops: 22
% 1.83/2.15 % res_forward_subset_subsumed: 0
% 1.83/2.15 % res_backward_subset_subsumed: 0
% 1.83/2.15 % res_forward_subsumed: 0
% 1.83/2.15 % res_backward_subsumed: 0
% 1.83/2.15 % res_forward_subsumption_resolution: 0
% 1.83/2.15 % res_backward_subsumption_resolution: 0
% 1.83/2.15 % res_clause_to_clause_subsumption: 0
% 1.83/2.15 % res_orphan_elimination: 0
% 1.83/2.15 % res_tautology_del: 0
% 1.83/2.15 % res_num_eq_res_simplified: 0
% 1.83/2.15 % res_num_sel_changes: 0
% 1.83/2.15 % res_moves_from_active_to_pass: 0
% 1.83/2.15
% 1.83/2.15 % Status Unknown
% 1.83/2.15 % Last status :
% 1.83/2.15 % SZS status Unknown
%------------------------------------------------------------------------------