TSTP Solution File: NLP220-10 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP220-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n014.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:42:33 EDT 2022
% Result : Unknown 1.91s 2.24s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP220-10 : TPTP v8.1.0. Released v7.3.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.34 % CPULimit : 300
% 0.19/0.34 % WCLimit : 600
% 0.19/0.34 % DateTime : Fri Jul 1 00:59:56 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.35 % Running in mono-core mode
% 0.19/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.41 % Orientation found
% 0.19/0.41 % 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_5a1a41.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e4456c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_44af2d | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 1.00/1.17 % --bmc1_dump_unsat_core_tptp false
% 1.00/1.17 % --bmc1_dump_file -
% 1.00/1.17 % --bmc1_ucm_expand_uc_limit 128
% 1.00/1.17 % --bmc1_ucm_n_expand_iterations 6
% 1.00/1.17 % --bmc1_ucm_extend_mode 1
% 1.00/1.17 % --bmc1_ucm_init_mode 2
% 1.00/1.17 % --bmc1_ucm_cone_mode none
% 1.00/1.17 % --bmc1_ucm_reduced_relation_type 0
% 1.00/1.17 % --bmc1_ucm_relax_model 4
% 1.00/1.17 % --bmc1_ucm_full_tr_after_sat true
% 1.00/1.17 % --bmc1_ucm_expand_neg_assumptions false
% 1.00/1.17 % --bmc1_ucm_layered_model none
% 1.00/1.17 % --bmc1_ucm_max_lemma_size 10
% 1.00/1.17
% 1.00/1.17 % ------ AIG Options
% 1.00/1.17
% 1.00/1.17 % --aig_mode false
% 1.00/1.17
% 1.00/1.17 % ------ Instantiation Options
% 1.00/1.17
% 1.00/1.17 % --instantiation_flag true
% 1.00/1.17 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.00/1.17 % --inst_solver_per_active 750
% 1.00/1.17 % --inst_solver_calls_frac 0.5
% 1.00/1.17 % --inst_passive_queue_type priority_queues
% 1.00/1.17 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.00/1.17 % --inst_passive_queues_freq [25;2]
% 1.00/1.17 % --inst_dismatching true
% 1.00/1.17 % --inst_eager_unprocessed_to_passive true
% 1.00/1.17 % --inst_prop_sim_given true
% 1.00/1.17 % --inst_prop_sim_new false
% 1.00/1.17 % --inst_orphan_elimination true
% 1.00/1.17 % --inst_learning_loop_flag true
% 1.00/1.17 % --inst_learning_start 3000
% 1.00/1.17 % --inst_learning_factor 2
% 1.00/1.17 % --inst_start_prop_sim_after_learn 3
% 1.00/1.17 % --inst_sel_renew solver
% 1.00/1.17 % --inst_lit_activity_flag true
% 1.00/1.17 % --inst_out_proof true
% 1.00/1.17
% 1.00/1.17 % ------ Resolution Options
% 1.00/1.17
% 1.00/1.17 % --resolution_flag true
% 1.00/1.17 % --res_lit_sel kbo_max
% 1.00/1.17 % --res_to_prop_solver none
% 1.00/1.17 % --res_prop_simpl_new false
% 1.00/1.17 % --res_prop_simpl_given false
% 1.00/1.17 % --res_passive_queue_type priority_queues
% 1.00/1.17 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.00/1.17 % --res_passive_queues_freq [15;5]
% 1.00/1.17 % --res_forward_subs full
% 1.00/1.17 % --res_backward_subs full
% 1.00/1.17 % --res_forward_subs_resolution true
% 1.00/1.17 % --res_backward_subs_resolution true
% 1.00/1.17 % --res_orphan_elimination false
% 1.00/1.17 % --res_time_limit 1000.
% 1.00/1.17 % --res_out_proof true
% 1.00/1.17 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5a1a41.s
% 1.00/1.17 % --modulo true
% 1.00/1.17
% 1.00/1.17 % ------ Combination Options
% 1.00/1.17
% 1.00/1.17 % --comb_res_mult 1000
% 1.00/1.17 % --comb_inst_mult 300
% 1.00/1.17 % ------
% 1.00/1.17
% 1.00/1.17 % ------ Parsing...% successful
% 1.00/1.17
% 1.00/1.17 % ------ 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.00/1.17
% 1.00/1.17 % ------ Proving...
% 1.00/1.17 % ------ Problem Properties
% 1.00/1.17
% 1.00/1.17 %
% 1.00/1.17 % EPR false
% 1.00/1.17 % Horn true
% 1.00/1.17 % Has equality true
% 1.00/1.17
% 1.00/1.17 % % ------ Input Options Time Limit: Unbounded
% 1.00/1.17
% 1.00/1.17
% 1.00/1.17 Compiling...
% 1.00/1.17 Loading plugin: done.
% 1.00/1.17 % % ------ Current options:
% 1.00/1.17
% 1.00/1.17 % ------ Input Options
% 1.00/1.17
% 1.00/1.17 % --out_options all
% 1.00/1.17 % --tptp_safe_out true
% 1.00/1.17 % --problem_path ""
% 1.00/1.17 % --include_path ""
% 1.00/1.17 % --clausifier .//eprover
% 1.00/1.17 % --clausifier_options --tstp-format
% 1.00/1.17 % --stdin false
% 1.00/1.17 % --dbg_backtrace false
% 1.00/1.17 % --dbg_dump_prop_clauses false
% 1.00/1.17 % --dbg_dump_prop_clauses_file -
% 1.00/1.17 % --dbg_out_stat false
% 1.00/1.17
% 1.00/1.17 % ------ General Options
% 1.00/1.17
% 1.00/1.17 % --fof false
% 1.00/1.17 % --time_out_real 150.
% 1.00/1.17 % --time_out_prep_mult 0.2
% 1.00/1.17 % --time_out_virtual -1.
% 1.00/1.17 % --schedule none
% 1.00/1.17 % --ground_splitting input
% 1.00/1.17 % --splitting_nvd 16
% 1.00/1.17 % --non_eq_to_eq false
% 1.00/1.17 % --prep_gs_sim true
% 1.00/1.17 % --prep_unflatten false
% 1.00/1.17 % --prep_res_sim true
% 1.00/1.17 % --prep_upred true
% 1.00/1.17 % --res_sim_input true
% 1.00/1.17 % --clause_weak_htbl true
% 1.00/1.17 % --gc_record_bc_elim false
% 1.00/1.17 % --symbol_type_check false
% 1.00/1.17 % --clausify_out false
% 1.00/1.17 % --large_theory_mode false
% 1.00/1.17 % --prep_sem_filter none
% 1.00/1.17 % --prep_sem_filter_out false
% 1.00/1.17 % --preprocessed_out false
% 1.00/1.17 % --sub_typing false
% 1.00/1.17 % --brand_transform false
% 1.00/1.17 % --pure_diseq_elim true
% 1.00/1.17 % --min_unsat_core false
% 1.00/1.17 % --pred_elim true
% 1.00/1.17 % --add_important_lit false
% 1.00/1.17 % --soft_assumptions false
% 1.00/1.17 % --reset_solvers false
% 1.00/1.17 % --bc_imp_inh []
% 1.00/1.17 % --conj_cone_tolerance 1.5
% 1.00/1.17 % --prolific_symb_bound 500
% 1.00/1.17 % --lt_threshold 2000
% 1.00/1.17
% 1.00/1.17 % ------ SAT Options
% 1.00/1.17
% 1.00/1.17 % --sat_mode false
% 1.00/1.17 % --sat_fm_restart_options ""
% 1.00/1.17 % --sat_gr_def false
% 1.00/1.17 % --sat_epr_types true
% 1.00/1.17 % --sat_non_cyclic_types false
% 1.00/1.17 % --sat_finite_models false
% 1.00/1.17 % --sat_fm_lemmas false
% 1.00/1.17 % --sat_fm_prep false
% 1.00/1.17 % --sat_fm_uc_incr true
% 1.00/1.17 % --sat_out_model small
% 1.00/1.17 % --sat_out_clauses false
% 1.00/1.17
% 1.00/1.17 % ------ QBF Options
% 1.00/1.17
% 1.00/1.17 % --qbf_mode false
% 1.00/1.17 % --qbf_elim_univ true
% 1.00/1.17 % --qbf_sk_in true
% 1.00/1.17 % --qbf_pred_elim true
% 1.00/1.17 % --qbf_split 32
% 1.00/1.17
% 1.00/1.17 % ------ BMC1 Options
% 1.00/1.17
% 1.00/1.17 % --bmc1_incremental false
% 1.00/1.17 % --bmc1_axioms reachable_all
% 1.00/1.17 % --bmc1_min_bound 0
% 1.00/1.17 % --bmc1_max_bound -1
% 1.00/1.17 % --bmc1_max_bound_default -1
% 1.00/1.17 % --bmc1_symbol_reachability true
% 1.00/1.17 % --bmc1_property_lemmas false
% 1.00/1.17 % --bmc1_k_induction false
% 1.00/1.17 % --bmc1_non_equiv_states false
% 1.00/1.17 % --bmc1_deadlock false
% 1.00/1.17 % --bmc1_ucm false
% 1.00/1.17 % --bmc1_add_unsat_core none
% 1.00/1.17 % --bmc1_unsat_core_children false
% 1.00/1.17 % --bmc1_unsat_core_extrapolate_axioms false
% 1.00/1.17 % --bmc1_out_stat full
% 1.00/1.17 % --bmc1_ground_init false
% 1.00/1.17 % --bmc1_pre_inst_next_state false
% 1.00/1.17 % --bmc1_pre_inst_state false
% 1.00/1.17 % --bmc1_pre_inst_reach_state false
% 1.00/1.17 % --bmc1_out_unsat_core false
% 1.00/1.17 % --bmc1_aig_witness_out false
% 1.00/1.17 % --bmc1_verbose false
% 1.00/1.17 % --bmc1_dump_clauses_tptp false
% 1.00/1.17 % --bmc1_dump_unsat_core_tptp false
% 1.00/1.17 % --bmc1_dump_file -
% 1.00/1.17 % --bmc1_ucm_expand_uc_limit 128
% 1.00/1.17 % --bmc1_ucm_n_expand_iterations 6
% 1.00/1.17 % --bmc1_ucm_extend_mode 1
% 1.00/1.17 % --bmc1_ucm_init_mode 2
% 1.00/1.17 % --bmc1_ucm_cone_mode none
% 1.00/1.17 % --bmc1_ucm_reduced_relation_type 0
% 1.00/1.17 % --bmc1_ucm_relax_model 4
% 1.00/1.17 % --bmc1_ucm_full_tr_after_sat true
% 1.00/1.17 % --bmc1_ucm_expand_neg_assumptions false
% 1.00/1.17 % --bmc1_ucm_layered_model none
% 1.00/1.17 % --bmc1_ucm_max_lemma_size 10
% 1.00/1.17
% 1.00/1.17 % ------ AIG Options
% 1.00/1.17
% 1.00/1.17 % --aig_mode false
% 1.00/1.17
% 1.00/1.17 % ------ Instantiation Options
% 1.00/1.17
% 1.00/1.17 % --instantiation_flag true
% 1.00/1.17 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.00/1.17 % --inst_solver_per_active 750
% 1.00/1.17 % --inst_solver_calls_frac 0.5
% 1.00/1.17 % --inst_passive_queue_type priority_queues
% 1.00/1.17 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.00/1.17 % --inst_passive_queues_freq [25;2]
% 1.00/1.17 % --inst_dismatching true
% 1.00/1.17 % --inst_eager_unprocessed_to_passive true
% 1.00/1.17 % --inst_prop_sim_given true
% 1.00/1.17 % --inst_prop_sim_new false
% 1.00/1.17 % --inst_orphan_elimination true
% 1.00/1.17 % --inst_learning_loop_flag true
% 1.00/1.17 % --inst_learning_start 3000
% 1.00/1.17 % --inst_learning_factor 2
% 1.00/1.17 % --inst_start_prop_sim_after_learn 3
% 1.00/1.17 % --inst_sel_renew solver
% 1.00/1.17 % --inst_lit_activity_flag true
% 1.00/1.17 % --inst_out_proof true
% 1.00/1.17
% 1.00/1.17 % ------ Resolution Options
% 1.00/1.17
% 1.00/1.17 % --resolution_flag true
% 1.00/1.17 % --res_lit_sel kbo_max
% 1.00/1.17 % --res_to_prop_solver none
% 1.00/1.17 % --res_prop_simpl_new false
% 1.00/1.17 % --res_prop_simpl_given false
% 1.00/1.17 % --res_passive_queue_type priority_queues
% 1.00/1.17 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.00/1.17 % --res_passive_queues_freq [15;5]
% 1.00/1.17 % --res_forward_subs full
% 1.00/1.17 % --res_backward_subs full
% 1.00/1.17 % --res_forward_subs_resolution true
% 1.00/1.17 % --res_backward_subs_resolution true
% 1.00/1.17 % --res_orphan_elimination false
% 1.00/1.17 % --res_time_limit 1000.
% 1.00/1.17 % --res_out_proof true
% 1.00/1.17 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5a1a41.s
% 1.00/1.17 % --modulo true
% 1.00/1.17
% 1.00/1.17 % ------ Combination Options
% 1.00/1.17
% 1.00/1.17 % --comb_res_mult 1000
% 1.00/1.17 % --comb_inst_mult 300
% 1.00/1.17 % ------
% 1.00/1.17
% 1.00/1.17
% 1.00/1.17
% 1.00/1.17 % ------ Proving...
% 1.00/1.17 % warning: shown sat in sat incomplete mode
% 1.00/1.17 %
% 1.00/1.17
% 1.00/1.17
% 1.00/1.17
% 1.00/1.17
% 1.00/1.17 cnf(c_83,negated_conjecture,
% 1.00/1.17 ( actual_world(skc5) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_83) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_187,negated_conjecture,
% 1.00/1.17 ( actual_world(skc5) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_83]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_239,negated_conjecture,
% 1.00/1.17 ( actual_world(skc5) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_187]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_240,negated_conjecture,
% 1.00/1.17 ( actual_world(skc5) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_239]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_273,negated_conjecture,
% 1.00/1.17 ( actual_world(skc5) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_240]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_457,negated_conjecture,
% 1.00/1.17 ( actual_world(skc5) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_273]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_82,negated_conjecture,
% 1.00/1.17 ( man(skc5,skc9) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_82) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_185,negated_conjecture,
% 1.00/1.17 ( man(skc5,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_82]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_238,negated_conjecture,
% 1.00/1.17 ( man(skc5,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_185]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_241,negated_conjecture,
% 1.00/1.17 ( man(skc5,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_238]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_272,negated_conjecture,
% 1.00/1.17 ( man(skc5,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_241]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_455,negated_conjecture,
% 1.00/1.17 ( man(skc5,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_272]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_81,negated_conjecture,
% 1.00/1.17 ( forename(skc5,skc8) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_81) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_183,negated_conjecture,
% 1.00/1.17 ( forename(skc5,skc8) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_81]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_237,negated_conjecture,
% 1.00/1.17 ( forename(skc5,skc8) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_183]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_242,negated_conjecture,
% 1.00/1.17 ( forename(skc5,skc8) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_237]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_271,negated_conjecture,
% 1.00/1.17 ( forename(skc5,skc8) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_242]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_453,negated_conjecture,
% 1.00/1.17 ( forename(skc5,skc8) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_271]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_80,negated_conjecture,
% 1.00/1.17 ( vincent_forename(skc5,skc8) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_80) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_181,negated_conjecture,
% 1.00/1.17 ( vincent_forename(skc5,skc8) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_80]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_236,negated_conjecture,
% 1.00/1.17 ( vincent_forename(skc5,skc8) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_181]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_243,negated_conjecture,
% 1.00/1.17 ( vincent_forename(skc5,skc8) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_236]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_270,negated_conjecture,
% 1.00/1.17 ( vincent_forename(skc5,skc8) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_243]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_451,negated_conjecture,
% 1.00/1.17 ( vincent_forename(skc5,skc8) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_270]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_79,negated_conjecture,
% 1.00/1.17 ( event(skc5,skc7) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_79) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_179,negated_conjecture,
% 1.00/1.17 ( event(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_79]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_235,negated_conjecture,
% 1.00/1.17 ( event(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_179]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_244,negated_conjecture,
% 1.00/1.17 ( event(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_235]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_269,negated_conjecture,
% 1.00/1.17 ( event(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_244]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_449,negated_conjecture,
% 1.00/1.17 ( event(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_269]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_78,negated_conjecture,
% 1.00/1.17 ( present(skc5,skc7) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_78) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_177,negated_conjecture,
% 1.00/1.17 ( present(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_78]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_234,negated_conjecture,
% 1.00/1.17 ( present(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_177]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_245,negated_conjecture,
% 1.00/1.17 ( present(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_234]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_268,negated_conjecture,
% 1.00/1.17 ( present(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_245]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_447,negated_conjecture,
% 1.00/1.17 ( present(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_268]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_77,negated_conjecture,
% 1.00/1.17 ( think_believe_consider(skc5,skc7) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_77) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_175,negated_conjecture,
% 1.00/1.17 ( think_believe_consider(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_77]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_233,negated_conjecture,
% 1.00/1.17 ( think_believe_consider(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_175]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_246,negated_conjecture,
% 1.00/1.17 ( think_believe_consider(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_233]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_267,negated_conjecture,
% 1.00/1.17 ( think_believe_consider(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_246]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_445,negated_conjecture,
% 1.00/1.17 ( think_believe_consider(skc5,skc7) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_267]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_76,negated_conjecture,
% 1.00/1.17 ( accessible_world(skc5,skc6) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_76) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_173,negated_conjecture,
% 1.00/1.17 ( accessible_world(skc5,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_76]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_232,negated_conjecture,
% 1.00/1.17 ( accessible_world(skc5,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_173]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_247,negated_conjecture,
% 1.00/1.17 ( accessible_world(skc5,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_232]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_266,negated_conjecture,
% 1.00/1.17 ( accessible_world(skc5,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_247]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_443,negated_conjecture,
% 1.00/1.17 ( accessible_world(skc5,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_266]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_75,negated_conjecture,
% 1.00/1.17 ( proposition(skc5,skc6) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_75) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_171,negated_conjecture,
% 1.00/1.17 ( proposition(skc5,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_75]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_231,negated_conjecture,
% 1.00/1.17 ( proposition(skc5,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_171]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_248,negated_conjecture,
% 1.00/1.17 ( proposition(skc5,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_231]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_265,negated_conjecture,
% 1.00/1.17 ( proposition(skc5,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_248]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_441,negated_conjecture,
% 1.00/1.17 ( proposition(skc5,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_265]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_74,negated_conjecture,
% 1.00/1.17 ( of(skc5,skc8,skc9) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_74) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_169,negated_conjecture,
% 1.00/1.17 ( of(skc5,skc8,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_74]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_230,negated_conjecture,
% 1.00/1.17 ( of(skc5,skc8,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_169]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_249,negated_conjecture,
% 1.00/1.17 ( of(skc5,skc8,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_230]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_264,negated_conjecture,
% 1.00/1.17 ( of(skc5,skc8,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_249]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_439,negated_conjecture,
% 1.00/1.17 ( of(skc5,skc8,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_264]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_73,negated_conjecture,
% 1.00/1.17 ( agent(skc5,skc7,skc9) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_73) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_167,negated_conjecture,
% 1.00/1.17 ( agent(skc5,skc7,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_73]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_229,negated_conjecture,
% 1.00/1.17 ( agent(skc5,skc7,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_167]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_250,negated_conjecture,
% 1.00/1.17 ( agent(skc5,skc7,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_229]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_263,negated_conjecture,
% 1.00/1.17 ( agent(skc5,skc7,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_250]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_437,negated_conjecture,
% 1.00/1.17 ( agent(skc5,skc7,skc9) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_263]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_72,negated_conjecture,
% 1.00/1.17 ( theme(skc5,skc7,skc6) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_72) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_165,negated_conjecture,
% 1.00/1.17 ( theme(skc5,skc7,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_72]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_228,negated_conjecture,
% 1.00/1.17 ( theme(skc5,skc7,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_165]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_251,negated_conjecture,
% 1.00/1.17 ( theme(skc5,skc7,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_228]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_262,negated_conjecture,
% 1.00/1.17 ( theme(skc5,skc7,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_251]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_435,negated_conjecture,
% 1.00/1.17 ( theme(skc5,skc7,skc6) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_262]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_71,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_71) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_163,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_71]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_227,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_163]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_252,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_227]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_261,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_252]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_433,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_261]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_70,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_70) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_161,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_70]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_226,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_161]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_253,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_226]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_260,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_253]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_431,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_260]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_69,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_69) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_159,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_69]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_225,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_159]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_254,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_225]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_259,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_254]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_429,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_259]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_68,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_68) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_157,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_68]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_224,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_157]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_255,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_224]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_258,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_255]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_427,negated_conjecture,
% 1.00/1.17 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.00/1.17 inference(copy,[status(esa)],[c_258]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_67,negated_conjecture,
% 1.00/1.17 ( b != a ),
% 1.00/1.17 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_84) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_155,negated_conjecture,
% 1.00/1.17 ( b != a ),
% 1.00/1.17 inference(copy,[status(esa)],[c_67]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_223,negated_conjecture,
% 1.00/1.17 ( b != a ),
% 1.00/1.17 inference(copy,[status(esa)],[c_155]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_256,negated_conjecture,
% 1.00/1.17 ( b != a ),
% 1.00/1.17 inference(copy,[status(esa)],[c_223]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_257,negated_conjecture,
% 1.00/1.17 ( b != a ),
% 1.00/1.17 inference(copy,[status(esa)],[c_256]) ).
% 1.00/1.17
% 1.00/1.17 cnf(c_425,negated_conjecture,
% 1.00/1.17 ( b != a ),
% 1.00/1.17 inference(copy,[status(esa)],[c_257]) ).
% 1.00/1.17
% 1.00/1.17
% 1.00/1.17
% 1.00/1.17 % ------ Statistics
% 1.00/1.17
% 1.00/1.17 % ------ General
% 1.00/1.17
% 1.00/1.17 % num_of_input_clauses: 84
% 1.00/1.17 % num_of_input_neg_conjectures: 17
% 1.00/1.17 % num_of_splits: 0
% 1.00/1.17 % num_of_split_atoms: 0
% 1.00/1.17 % num_of_sem_filtered_clauses: 0
% 1.00/1.17 % num_of_subtypes: 0
% 1.00/1.17 % monotx_restored_types: 0
% 1.00/1.17 % sat_num_of_epr_types: 0
% 1.00/1.17 % sat_num_of_non_cyclic_types: 0
% 1.00/1.17 % sat_guarded_non_collapsed_types: 0
% 1.00/1.17 % is_epr: 0
% 1.00/1.17 % is_horn: 1
% 1.00/1.17 % has_eq: 1
% 1.00/1.17 % num_pure_diseq_elim: 0
% 1.00/1.17 % simp_replaced_by: 0
% 1.00/1.17 % res_preprocessed: 34
% 1.00/1.17 % prep_upred: 0
% 1.00/1.17 % prep_unflattend: 0
% 1.00/1.17 % pred_elim_cands: 0
% 1.00/1.17 % pred_elim: 0
% 1.00/1.17 % pred_elim_cl: 0
% 1.00/1.17 % pred_elim_cycles: 0
% 1.00/1.17 % forced_gc_time: 0
% 1.00/1.17 % gc_basic_clause_elim: 0
% 1.00/1.17 % parsing_time: 0.004
% 1.00/1.17 % sem_filter_time: 0.
% 1.00/1.17 % pred_elim_time: 0.
% 1.00/1.17 % out_proof_time: 0.
% 1.00/1.17 % monotx_time: 0.
% 1.00/1.17 % subtype_inf_time: 0.
% 1.00/1.17 % unif_index_cands_time: 0.
% 1.00/1.17 % unif_index_add_time: 0.
% 1.00/1.17 % total_time: 0.752
% 1.00/1.17 % num_of_symbols: 71
% 1.00/1.17 % num_of_terms: 757
% 1.00/1.17
% 1.00/1.17 % ------ Propositional Solver
% 1.00/1.17
% 1.00/1.17 % prop_solver_calls: 1
% 1.00/1.17 % prop_fast_solver_calls: 51
% 1.00/1.17 % prop_num_of_clauses: 155
% 1.00/1.17 % prop_preprocess_simplified: 323
% 1.00/1.17 % prop_fo_subsumed: 0
% 1.00/1.17 % prop_solver_time: 0.
% 1.00/1.17 % prop_fast_solver_time: 0.
% 1.00/1.17 % prop_unsat_core_time: 0.
% 1.00/1.17
% 1.00/1.17 % ------ QBF
% 1.00/1.17
% 1.00/1.17 % qbf_q_res: 0
% 1.00/1.17 % qbf_num_tautologies: 0
% 1.00/1.17 % qbf_prep_cycles: 0
% 1.00/1.17
% 1.00/1.17 % ------ BMC1
% 1.00/1.17
% 1.00/1.17 % bmc1_current_bound: -1
% 1.00/1.17 % bmc1_last_solved_bound: -1
% 1.00/1.17 % bmc1_unsat_core_size: -1
% 1.00/1.17 % bmc1_unsat_core_parents_size: -1
% 1.00/1.17 % bmc1_merge_next_fun: 0
% 1.00/1.17 % bmc1_unsat_core_clauses_time: 0.
% 1.00/1.17
% 1.00/1.17 % ------ Instantiation
% 1.00/1.17
% 1.00/1.17 % inst_num_of_clauses: 84
% 1.00/1.17 % inst_num_in_passive: 0
% 1.00/1.17 % inst_num_in_active: 0
% 1.00/1.17 % inst_num_in_unprocessed: 84
% 1.00/1.17 % inst_num_of_loops: 0
% 1.00/1.17 % inst_num_of_learning_restarts: 0
% 1.00/1.17 % inst_num_moves_active_passive: 0
% 1.00/1.17 % inst_lit_activity: 0
% 1.00/1.17 % inst_lit_activity_moves: 0
% 1.00/1.17 % inst_num_tautologies: 0
% 1.00/1.17 % inst_num_prop_implied: 0
% 1.00/1.17 % inst_num_existing_simplified: 0
% 1.00/1.17 % inst_num_eq_res_simplified: 0
% 1.00/1.17 % inst_num_child_elim: 0
% 1.00/1.17 % inst_num_of_dismatching_blockings: 0
% 1.00/1.17 % inst_num_of_non_proper_insts: 0
% 1.00/1.17 % inst_num_of_duplicates: 0
% 1.00/1.17 % inst_inst_num_from_inst_to_res: 0
% 1.00/1.17 % inst_dismatching_checking_time: 0.
% 1.00/1.17
% 1.00/1.17 % ------ Resolution
% 1.00/1.17
% 1.00/1.17 % res_num_of_clauses: 84
% 1.00/1.17 % res_num_in_passive: 0
% 1.00/1.17 % res_num_in_active: 17
% 1.00/1.17 % res_num_of_loops: 18
% 1.00/1.17 % res_forward_subset_subsumed: 0
% 1.00/1.17 % res_backward_subset_subsumed: 0
% 1.00/1.17 % res_forward_subsumed: 0
% 1.00/1.17 % res_backward_subsumed: 0
% 1.00/1.17 % res_forward_subsumption_resolution: 0
% 1.00/1.17 % res_backward_subsumption_resolution: 0
% 1.00/1.17 % res_clause_to_clause_subsumption: 0
% 1.00/1.17 % res_orphan_elimination: 0
% 1.00/1.17 % res_tautology_del: 0
% 1.00/1.17 % res_num_eq_res_simplified: 0
% 1.00/1.17 % res_num_sel_changes: 0
% 1.00/1.17 % res_moves_from_active_to_pass: 0
% 1.00/1.17
% 1.00/1.17 % Status Unknown
% 1.02/1.22 % Orienting using strategy ClausalAll
% 1.02/1.22 % Orientation found
% 1.02/1.22 % 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_5a1a41.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e4456c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_765db2 | grep -v "SZS"
% 1.07/1.24
% 1.07/1.24 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.07/1.24
% 1.07/1.24 %
% 1.07/1.24 % ------ iProver source info
% 1.07/1.24
% 1.07/1.24 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.07/1.24 % git: non_committed_changes: true
% 1.07/1.24 % git: last_make_outside_of_git: true
% 1.07/1.24
% 1.07/1.24 %
% 1.07/1.24 % ------ Input Options
% 1.07/1.24
% 1.07/1.24 % --out_options all
% 1.07/1.24 % --tptp_safe_out true
% 1.07/1.24 % --problem_path ""
% 1.07/1.24 % --include_path ""
% 1.07/1.24 % --clausifier .//eprover
% 1.07/1.24 % --clausifier_options --tstp-format
% 1.07/1.24 % --stdin false
% 1.07/1.24 % --dbg_backtrace false
% 1.07/1.24 % --dbg_dump_prop_clauses false
% 1.07/1.24 % --dbg_dump_prop_clauses_file -
% 1.07/1.24 % --dbg_out_stat false
% 1.07/1.24
% 1.07/1.24 % ------ General Options
% 1.07/1.24
% 1.07/1.24 % --fof false
% 1.07/1.24 % --time_out_real 150.
% 1.07/1.24 % --time_out_prep_mult 0.2
% 1.07/1.24 % --time_out_virtual -1.
% 1.07/1.24 % --schedule none
% 1.07/1.24 % --ground_splitting input
% 1.07/1.24 % --splitting_nvd 16
% 1.07/1.24 % --non_eq_to_eq false
% 1.07/1.24 % --prep_gs_sim true
% 1.07/1.24 % --prep_unflatten false
% 1.07/1.24 % --prep_res_sim true
% 1.07/1.24 % --prep_upred true
% 1.07/1.24 % --res_sim_input true
% 1.07/1.24 % --clause_weak_htbl true
% 1.07/1.24 % --gc_record_bc_elim false
% 1.07/1.24 % --symbol_type_check false
% 1.07/1.24 % --clausify_out false
% 1.07/1.24 % --large_theory_mode false
% 1.07/1.24 % --prep_sem_filter none
% 1.07/1.24 % --prep_sem_filter_out false
% 1.07/1.24 % --preprocessed_out false
% 1.07/1.24 % --sub_typing false
% 1.07/1.24 % --brand_transform false
% 1.07/1.24 % --pure_diseq_elim true
% 1.07/1.24 % --min_unsat_core false
% 1.07/1.24 % --pred_elim true
% 1.07/1.24 % --add_important_lit false
% 1.07/1.24 % --soft_assumptions false
% 1.07/1.24 % --reset_solvers false
% 1.07/1.24 % --bc_imp_inh []
% 1.07/1.24 % --conj_cone_tolerance 1.5
% 1.07/1.24 % --prolific_symb_bound 500
% 1.07/1.24 % --lt_threshold 2000
% 1.07/1.24
% 1.07/1.24 % ------ SAT Options
% 1.07/1.24
% 1.07/1.24 % --sat_mode false
% 1.07/1.24 % --sat_fm_restart_options ""
% 1.07/1.24 % --sat_gr_def false
% 1.07/1.24 % --sat_epr_types true
% 1.07/1.24 % --sat_non_cyclic_types false
% 1.07/1.24 % --sat_finite_models false
% 1.07/1.24 % --sat_fm_lemmas false
% 1.07/1.24 % --sat_fm_prep false
% 1.07/1.24 % --sat_fm_uc_incr true
% 1.07/1.24 % --sat_out_model small
% 1.07/1.24 % --sat_out_clauses false
% 1.07/1.24
% 1.07/1.24 % ------ QBF Options
% 1.07/1.24
% 1.07/1.24 % --qbf_mode false
% 1.07/1.24 % --qbf_elim_univ true
% 1.07/1.24 % --qbf_sk_in true
% 1.07/1.24 % --qbf_pred_elim true
% 1.07/1.24 % --qbf_split 32
% 1.07/1.24
% 1.07/1.24 % ------ BMC1 Options
% 1.07/1.24
% 1.07/1.24 % --bmc1_incremental false
% 1.07/1.24 % --bmc1_axioms reachable_all
% 1.07/1.24 % --bmc1_min_bound 0
% 1.07/1.24 % --bmc1_max_bound -1
% 1.07/1.24 % --bmc1_max_bound_default -1
% 1.07/1.24 % --bmc1_symbol_reachability true
% 1.07/1.24 % --bmc1_property_lemmas false
% 1.07/1.24 % --bmc1_k_induction false
% 1.07/1.24 % --bmc1_non_equiv_states false
% 1.07/1.24 % --bmc1_deadlock false
% 1.07/1.24 % --bmc1_ucm false
% 1.07/1.24 % --bmc1_add_unsat_core none
% 1.07/1.24 % --bmc1_unsat_core_children false
% 1.07/1.24 % --bmc1_unsat_core_extrapolate_axioms false
% 1.07/1.24 % --bmc1_out_stat full
% 1.07/1.24 % --bmc1_ground_init false
% 1.07/1.24 % --bmc1_pre_inst_next_state false
% 1.07/1.24 % --bmc1_pre_inst_state false
% 1.07/1.24 % --bmc1_pre_inst_reach_state false
% 1.07/1.24 % --bmc1_out_unsat_core false
% 1.07/1.24 % --bmc1_aig_witness_out false
% 1.07/1.24 % --bmc1_verbose false
% 1.07/1.24 % --bmc1_dump_clauses_tptp false
% 1.91/2.23 % --bmc1_dump_unsat_core_tptp false
% 1.91/2.23 % --bmc1_dump_file -
% 1.91/2.23 % --bmc1_ucm_expand_uc_limit 128
% 1.91/2.23 % --bmc1_ucm_n_expand_iterations 6
% 1.91/2.23 % --bmc1_ucm_extend_mode 1
% 1.91/2.23 % --bmc1_ucm_init_mode 2
% 1.91/2.23 % --bmc1_ucm_cone_mode none
% 1.91/2.23 % --bmc1_ucm_reduced_relation_type 0
% 1.91/2.23 % --bmc1_ucm_relax_model 4
% 1.91/2.23 % --bmc1_ucm_full_tr_after_sat true
% 1.91/2.23 % --bmc1_ucm_expand_neg_assumptions false
% 1.91/2.23 % --bmc1_ucm_layered_model none
% 1.91/2.23 % --bmc1_ucm_max_lemma_size 10
% 1.91/2.23
% 1.91/2.23 % ------ AIG Options
% 1.91/2.23
% 1.91/2.23 % --aig_mode false
% 1.91/2.23
% 1.91/2.23 % ------ Instantiation Options
% 1.91/2.23
% 1.91/2.23 % --instantiation_flag true
% 1.91/2.23 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.91/2.23 % --inst_solver_per_active 750
% 1.91/2.23 % --inst_solver_calls_frac 0.5
% 1.91/2.23 % --inst_passive_queue_type priority_queues
% 1.91/2.23 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.91/2.23 % --inst_passive_queues_freq [25;2]
% 1.91/2.23 % --inst_dismatching true
% 1.91/2.23 % --inst_eager_unprocessed_to_passive true
% 1.91/2.23 % --inst_prop_sim_given true
% 1.91/2.23 % --inst_prop_sim_new false
% 1.91/2.23 % --inst_orphan_elimination true
% 1.91/2.23 % --inst_learning_loop_flag true
% 1.91/2.23 % --inst_learning_start 3000
% 1.91/2.23 % --inst_learning_factor 2
% 1.91/2.23 % --inst_start_prop_sim_after_learn 3
% 1.91/2.23 % --inst_sel_renew solver
% 1.91/2.23 % --inst_lit_activity_flag true
% 1.91/2.23 % --inst_out_proof true
% 1.91/2.23
% 1.91/2.23 % ------ Resolution Options
% 1.91/2.23
% 1.91/2.23 % --resolution_flag true
% 1.91/2.23 % --res_lit_sel kbo_max
% 1.91/2.23 % --res_to_prop_solver none
% 1.91/2.23 % --res_prop_simpl_new false
% 1.91/2.23 % --res_prop_simpl_given false
% 1.91/2.23 % --res_passive_queue_type priority_queues
% 1.91/2.23 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.91/2.23 % --res_passive_queues_freq [15;5]
% 1.91/2.23 % --res_forward_subs full
% 1.91/2.23 % --res_backward_subs full
% 1.91/2.23 % --res_forward_subs_resolution true
% 1.91/2.23 % --res_backward_subs_resolution true
% 1.91/2.23 % --res_orphan_elimination false
% 1.91/2.23 % --res_time_limit 1000.
% 1.91/2.23 % --res_out_proof true
% 1.91/2.23 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5a1a41.s
% 1.91/2.23 % --modulo true
% 1.91/2.23
% 1.91/2.23 % ------ Combination Options
% 1.91/2.23
% 1.91/2.23 % --comb_res_mult 1000
% 1.91/2.23 % --comb_inst_mult 300
% 1.91/2.23 % ------
% 1.91/2.23
% 1.91/2.23 % ------ Parsing...% successful
% 1.91/2.23
% 1.91/2.23 % ------ 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.91/2.23
% 1.91/2.23 % ------ Proving...
% 1.91/2.23 % ------ Problem Properties
% 1.91/2.23
% 1.91/2.23 %
% 1.91/2.23 % EPR false
% 1.91/2.23 % Horn true
% 1.91/2.23 % Has equality true
% 1.91/2.23
% 1.91/2.23 % % ------ Input Options Time Limit: Unbounded
% 1.91/2.23
% 1.91/2.23
% 1.91/2.23 Compiling...
% 1.91/2.23 Loading plugin: done.
% 1.91/2.23 % % ------ Current options:
% 1.91/2.23
% 1.91/2.23 % ------ Input Options
% 1.91/2.23
% 1.91/2.23 % --out_options all
% 1.91/2.23 % --tptp_safe_out true
% 1.91/2.23 % --problem_path ""
% 1.91/2.23 % --include_path ""
% 1.91/2.23 % --clausifier .//eprover
% 1.91/2.23 % --clausifier_options --tstp-format
% 1.91/2.23 % --stdin false
% 1.91/2.23 % --dbg_backtrace false
% 1.91/2.23 % --dbg_dump_prop_clauses false
% 1.91/2.23 % --dbg_dump_prop_clauses_file -
% 1.91/2.23 % --dbg_out_stat false
% 1.91/2.23
% 1.91/2.23 % ------ General Options
% 1.91/2.23
% 1.91/2.23 % --fof false
% 1.91/2.23 % --time_out_real 150.
% 1.91/2.23 % --time_out_prep_mult 0.2
% 1.91/2.23 % --time_out_virtual -1.
% 1.91/2.23 % --schedule none
% 1.91/2.23 % --ground_splitting input
% 1.91/2.23 % --splitting_nvd 16
% 1.91/2.23 % --non_eq_to_eq false
% 1.91/2.23 % --prep_gs_sim true
% 1.91/2.23 % --prep_unflatten false
% 1.91/2.23 % --prep_res_sim true
% 1.91/2.23 % --prep_upred true
% 1.91/2.23 % --res_sim_input true
% 1.91/2.23 % --clause_weak_htbl true
% 1.91/2.23 % --gc_record_bc_elim false
% 1.91/2.23 % --symbol_type_check false
% 1.91/2.23 % --clausify_out false
% 1.91/2.23 % --large_theory_mode false
% 1.91/2.23 % --prep_sem_filter none
% 1.91/2.23 % --prep_sem_filter_out false
% 1.91/2.23 % --preprocessed_out false
% 1.91/2.23 % --sub_typing false
% 1.91/2.23 % --brand_transform false
% 1.91/2.23 % --pure_diseq_elim true
% 1.91/2.23 % --min_unsat_core false
% 1.91/2.23 % --pred_elim true
% 1.91/2.23 % --add_important_lit false
% 1.91/2.23 % --soft_assumptions false
% 1.91/2.23 % --reset_solvers false
% 1.91/2.23 % --bc_imp_inh []
% 1.91/2.23 % --conj_cone_tolerance 1.5
% 1.91/2.23 % --prolific_symb_bound 500
% 1.91/2.23 % --lt_threshold 2000
% 1.91/2.23
% 1.91/2.23 % ------ SAT Options
% 1.91/2.23
% 1.91/2.23 % --sat_mode false
% 1.91/2.23 % --sat_fm_restart_options ""
% 1.91/2.23 % --sat_gr_def false
% 1.91/2.23 % --sat_epr_types true
% 1.91/2.23 % --sat_non_cyclic_types false
% 1.91/2.23 % --sat_finite_models false
% 1.91/2.23 % --sat_fm_lemmas false
% 1.91/2.23 % --sat_fm_prep false
% 1.91/2.23 % --sat_fm_uc_incr true
% 1.91/2.23 % --sat_out_model small
% 1.91/2.23 % --sat_out_clauses false
% 1.91/2.23
% 1.91/2.23 % ------ QBF Options
% 1.91/2.23
% 1.91/2.23 % --qbf_mode false
% 1.91/2.23 % --qbf_elim_univ true
% 1.91/2.23 % --qbf_sk_in true
% 1.91/2.23 % --qbf_pred_elim true
% 1.91/2.23 % --qbf_split 32
% 1.91/2.23
% 1.91/2.23 % ------ BMC1 Options
% 1.91/2.23
% 1.91/2.23 % --bmc1_incremental false
% 1.91/2.23 % --bmc1_axioms reachable_all
% 1.91/2.23 % --bmc1_min_bound 0
% 1.91/2.23 % --bmc1_max_bound -1
% 1.91/2.23 % --bmc1_max_bound_default -1
% 1.91/2.23 % --bmc1_symbol_reachability true
% 1.91/2.23 % --bmc1_property_lemmas false
% 1.91/2.23 % --bmc1_k_induction false
% 1.91/2.23 % --bmc1_non_equiv_states false
% 1.91/2.23 % --bmc1_deadlock false
% 1.91/2.23 % --bmc1_ucm false
% 1.91/2.23 % --bmc1_add_unsat_core none
% 1.91/2.23 % --bmc1_unsat_core_children false
% 1.91/2.23 % --bmc1_unsat_core_extrapolate_axioms false
% 1.91/2.23 % --bmc1_out_stat full
% 1.91/2.23 % --bmc1_ground_init false
% 1.91/2.23 % --bmc1_pre_inst_next_state false
% 1.91/2.23 % --bmc1_pre_inst_state false
% 1.91/2.23 % --bmc1_pre_inst_reach_state false
% 1.91/2.23 % --bmc1_out_unsat_core false
% 1.91/2.23 % --bmc1_aig_witness_out false
% 1.91/2.23 % --bmc1_verbose false
% 1.91/2.23 % --bmc1_dump_clauses_tptp false
% 1.91/2.23 % --bmc1_dump_unsat_core_tptp false
% 1.91/2.23 % --bmc1_dump_file -
% 1.91/2.23 % --bmc1_ucm_expand_uc_limit 128
% 1.91/2.23 % --bmc1_ucm_n_expand_iterations 6
% 1.91/2.23 % --bmc1_ucm_extend_mode 1
% 1.91/2.23 % --bmc1_ucm_init_mode 2
% 1.91/2.23 % --bmc1_ucm_cone_mode none
% 1.91/2.23 % --bmc1_ucm_reduced_relation_type 0
% 1.91/2.23 % --bmc1_ucm_relax_model 4
% 1.91/2.23 % --bmc1_ucm_full_tr_after_sat true
% 1.91/2.23 % --bmc1_ucm_expand_neg_assumptions false
% 1.91/2.23 % --bmc1_ucm_layered_model none
% 1.91/2.23 % --bmc1_ucm_max_lemma_size 10
% 1.91/2.23
% 1.91/2.23 % ------ AIG Options
% 1.91/2.23
% 1.91/2.23 % --aig_mode false
% 1.91/2.23
% 1.91/2.23 % ------ Instantiation Options
% 1.91/2.23
% 1.91/2.23 % --instantiation_flag true
% 1.91/2.23 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.91/2.23 % --inst_solver_per_active 750
% 1.91/2.23 % --inst_solver_calls_frac 0.5
% 1.91/2.23 % --inst_passive_queue_type priority_queues
% 1.91/2.23 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.91/2.23 % --inst_passive_queues_freq [25;2]
% 1.91/2.23 % --inst_dismatching true
% 1.91/2.23 % --inst_eager_unprocessed_to_passive true
% 1.91/2.23 % --inst_prop_sim_given true
% 1.91/2.23 % --inst_prop_sim_new false
% 1.91/2.23 % --inst_orphan_elimination true
% 1.91/2.23 % --inst_learning_loop_flag true
% 1.91/2.23 % --inst_learning_start 3000
% 1.91/2.23 % --inst_learning_factor 2
% 1.91/2.23 % --inst_start_prop_sim_after_learn 3
% 1.91/2.23 % --inst_sel_renew solver
% 1.91/2.23 % --inst_lit_activity_flag true
% 1.91/2.23 % --inst_out_proof true
% 1.91/2.23
% 1.91/2.23 % ------ Resolution Options
% 1.91/2.23
% 1.91/2.23 % --resolution_flag true
% 1.91/2.23 % --res_lit_sel kbo_max
% 1.91/2.23 % --res_to_prop_solver none
% 1.91/2.23 % --res_prop_simpl_new false
% 1.91/2.23 % --res_prop_simpl_given false
% 1.91/2.23 % --res_passive_queue_type priority_queues
% 1.91/2.23 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.91/2.23 % --res_passive_queues_freq [15;5]
% 1.91/2.23 % --res_forward_subs full
% 1.91/2.23 % --res_backward_subs full
% 1.91/2.23 % --res_forward_subs_resolution true
% 1.91/2.23 % --res_backward_subs_resolution true
% 1.91/2.23 % --res_orphan_elimination false
% 1.91/2.23 % --res_time_limit 1000.
% 1.91/2.23 % --res_out_proof true
% 1.91/2.23 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5a1a41.s
% 1.91/2.23 % --modulo true
% 1.91/2.23
% 1.91/2.23 % ------ Combination Options
% 1.91/2.23
% 1.91/2.23 % --comb_res_mult 1000
% 1.91/2.23 % --comb_inst_mult 300
% 1.91/2.23 % ------
% 1.91/2.23
% 1.91/2.23
% 1.91/2.23
% 1.91/2.23 % ------ Proving...
% 1.91/2.23 % warning: shown sat in sat incomplete mode
% 1.91/2.23 %
% 1.91/2.23
% 1.91/2.23
% 1.91/2.23
% 1.91/2.23
% 1.91/2.23 cnf(c_83,negated_conjecture,
% 1.91/2.23 ( actual_world(skc5) = true ),
% 1.91/2.23 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_83) ).
% 1.91/2.23
% 1.91/2.23 cnf(c_187,negated_conjecture,
% 1.91/2.23 ( actual_world(skc5) = true ),
% 1.91/2.23 inference(copy,[status(esa)],[c_83]) ).
% 1.91/2.23
% 1.91/2.23 cnf(c_239,negated_conjecture,
% 1.91/2.23 ( actual_world(skc5) = true ),
% 1.91/2.23 inference(copy,[status(esa)],[c_187]) ).
% 1.91/2.23
% 1.91/2.23 cnf(c_240,negated_conjecture,
% 1.91/2.23 ( actual_world(skc5) = true ),
% 1.91/2.23 inference(copy,[status(esa)],[c_239]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_273,negated_conjecture,
% 1.91/2.24 ( actual_world(skc5) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_240]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_457,negated_conjecture,
% 1.91/2.24 ( actual_world(skc5) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_273]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_82,negated_conjecture,
% 1.91/2.24 ( man(skc5,skc9) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_82) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_185,negated_conjecture,
% 1.91/2.24 ( man(skc5,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_82]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_238,negated_conjecture,
% 1.91/2.24 ( man(skc5,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_185]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_241,negated_conjecture,
% 1.91/2.24 ( man(skc5,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_238]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_272,negated_conjecture,
% 1.91/2.24 ( man(skc5,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_241]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_455,negated_conjecture,
% 1.91/2.24 ( man(skc5,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_272]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_81,negated_conjecture,
% 1.91/2.24 ( forename(skc5,skc8) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_81) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_183,negated_conjecture,
% 1.91/2.24 ( forename(skc5,skc8) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_81]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_237,negated_conjecture,
% 1.91/2.24 ( forename(skc5,skc8) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_183]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_242,negated_conjecture,
% 1.91/2.24 ( forename(skc5,skc8) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_237]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_271,negated_conjecture,
% 1.91/2.24 ( forename(skc5,skc8) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_242]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_453,negated_conjecture,
% 1.91/2.24 ( forename(skc5,skc8) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_271]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_80,negated_conjecture,
% 1.91/2.24 ( vincent_forename(skc5,skc8) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_80) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_181,negated_conjecture,
% 1.91/2.24 ( vincent_forename(skc5,skc8) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_80]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_236,negated_conjecture,
% 1.91/2.24 ( vincent_forename(skc5,skc8) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_181]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_243,negated_conjecture,
% 1.91/2.24 ( vincent_forename(skc5,skc8) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_236]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_270,negated_conjecture,
% 1.91/2.24 ( vincent_forename(skc5,skc8) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_243]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_451,negated_conjecture,
% 1.91/2.24 ( vincent_forename(skc5,skc8) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_270]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_79,negated_conjecture,
% 1.91/2.24 ( event(skc5,skc7) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_79) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_179,negated_conjecture,
% 1.91/2.24 ( event(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_79]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_235,negated_conjecture,
% 1.91/2.24 ( event(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_179]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_244,negated_conjecture,
% 1.91/2.24 ( event(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_235]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_269,negated_conjecture,
% 1.91/2.24 ( event(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_244]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_449,negated_conjecture,
% 1.91/2.24 ( event(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_269]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_78,negated_conjecture,
% 1.91/2.24 ( present(skc5,skc7) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_78) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_177,negated_conjecture,
% 1.91/2.24 ( present(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_78]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_234,negated_conjecture,
% 1.91/2.24 ( present(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_177]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_245,negated_conjecture,
% 1.91/2.24 ( present(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_234]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_268,negated_conjecture,
% 1.91/2.24 ( present(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_245]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_447,negated_conjecture,
% 1.91/2.24 ( present(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_268]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_77,negated_conjecture,
% 1.91/2.24 ( think_believe_consider(skc5,skc7) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_77) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_175,negated_conjecture,
% 1.91/2.24 ( think_believe_consider(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_77]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_233,negated_conjecture,
% 1.91/2.24 ( think_believe_consider(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_175]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_246,negated_conjecture,
% 1.91/2.24 ( think_believe_consider(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_233]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_267,negated_conjecture,
% 1.91/2.24 ( think_believe_consider(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_246]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_445,negated_conjecture,
% 1.91/2.24 ( think_believe_consider(skc5,skc7) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_267]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_76,negated_conjecture,
% 1.91/2.24 ( accessible_world(skc5,skc6) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_76) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_173,negated_conjecture,
% 1.91/2.24 ( accessible_world(skc5,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_76]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_232,negated_conjecture,
% 1.91/2.24 ( accessible_world(skc5,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_173]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_247,negated_conjecture,
% 1.91/2.24 ( accessible_world(skc5,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_232]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_266,negated_conjecture,
% 1.91/2.24 ( accessible_world(skc5,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_247]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_443,negated_conjecture,
% 1.91/2.24 ( accessible_world(skc5,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_266]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_75,negated_conjecture,
% 1.91/2.24 ( proposition(skc5,skc6) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_75) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_171,negated_conjecture,
% 1.91/2.24 ( proposition(skc5,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_75]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_231,negated_conjecture,
% 1.91/2.24 ( proposition(skc5,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_171]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_248,negated_conjecture,
% 1.91/2.24 ( proposition(skc5,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_231]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_265,negated_conjecture,
% 1.91/2.24 ( proposition(skc5,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_248]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_441,negated_conjecture,
% 1.91/2.24 ( proposition(skc5,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_265]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_74,negated_conjecture,
% 1.91/2.24 ( of(skc5,skc8,skc9) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_74) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_169,negated_conjecture,
% 1.91/2.24 ( of(skc5,skc8,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_74]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_230,negated_conjecture,
% 1.91/2.24 ( of(skc5,skc8,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_169]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_249,negated_conjecture,
% 1.91/2.24 ( of(skc5,skc8,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_230]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_264,negated_conjecture,
% 1.91/2.24 ( of(skc5,skc8,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_249]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_439,negated_conjecture,
% 1.91/2.24 ( of(skc5,skc8,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_264]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_73,negated_conjecture,
% 1.91/2.24 ( agent(skc5,skc7,skc9) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_73) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_167,negated_conjecture,
% 1.91/2.24 ( agent(skc5,skc7,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_73]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_229,negated_conjecture,
% 1.91/2.24 ( agent(skc5,skc7,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_167]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_250,negated_conjecture,
% 1.91/2.24 ( agent(skc5,skc7,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_229]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_263,negated_conjecture,
% 1.91/2.24 ( agent(skc5,skc7,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_250]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_437,negated_conjecture,
% 1.91/2.24 ( agent(skc5,skc7,skc9) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_263]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_72,negated_conjecture,
% 1.91/2.24 ( theme(skc5,skc7,skc6) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_72) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_165,negated_conjecture,
% 1.91/2.24 ( theme(skc5,skc7,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_72]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_228,negated_conjecture,
% 1.91/2.24 ( theme(skc5,skc7,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_165]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_251,negated_conjecture,
% 1.91/2.24 ( theme(skc5,skc7,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_228]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_262,negated_conjecture,
% 1.91/2.24 ( theme(skc5,skc7,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_251]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_435,negated_conjecture,
% 1.91/2.24 ( theme(skc5,skc7,skc6) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_262]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_71,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_71) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_163,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_71]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_227,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_163]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_252,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_227]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_261,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_252]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_433,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,smoke(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_261]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_70,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_70) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_161,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_70]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_226,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_161]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_253,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_226]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_260,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_253]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_431,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,present(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_260]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_69,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_69) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_159,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_69]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_225,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_159]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_254,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_225]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_259,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_254]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_429,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,event(skc6,skf1(X1)),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_259]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_68,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_68) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_157,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_68]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_224,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_157]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_255,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_224]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_258,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_255]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_427,negated_conjecture,
% 1.91/2.24 ( ifeq2(man(skc6,X0),true,agent(skc6,skf1(X0),X0),true) = true ),
% 1.91/2.24 inference(copy,[status(esa)],[c_258]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_67,negated_conjecture,
% 1.91/2.24 ( b != a ),
% 1.91/2.24 file('/export/starexec/sandbox/tmp/iprover_modulo_e4456c.p', c_0_84) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_155,negated_conjecture,
% 1.91/2.24 ( b != a ),
% 1.91/2.24 inference(copy,[status(esa)],[c_67]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_223,negated_conjecture,
% 1.91/2.24 ( b != a ),
% 1.91/2.24 inference(copy,[status(esa)],[c_155]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_256,negated_conjecture,
% 1.91/2.24 ( b != a ),
% 1.91/2.24 inference(copy,[status(esa)],[c_223]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_257,negated_conjecture,
% 1.91/2.24 ( b != a ),
% 1.91/2.24 inference(copy,[status(esa)],[c_256]) ).
% 1.91/2.24
% 1.91/2.24 cnf(c_425,negated_conjecture,
% 1.91/2.24 ( b != a ),
% 1.91/2.24 inference(copy,[status(esa)],[c_257]) ).
% 1.91/2.24
% 1.91/2.24
% 1.91/2.24
% 1.91/2.24 % ------ Statistics
% 1.91/2.24
% 1.91/2.24 % ------ General
% 1.91/2.24
% 1.91/2.24 % num_of_input_clauses: 84
% 1.91/2.24 % num_of_input_neg_conjectures: 17
% 1.91/2.24 % num_of_splits: 0
% 1.91/2.24 % num_of_split_atoms: 0
% 1.91/2.24 % num_of_sem_filtered_clauses: 0
% 1.91/2.24 % num_of_subtypes: 0
% 1.91/2.24 % monotx_restored_types: 0
% 1.91/2.24 % sat_num_of_epr_types: 0
% 1.91/2.24 % sat_num_of_non_cyclic_types: 0
% 1.91/2.24 % sat_guarded_non_collapsed_types: 0
% 1.91/2.24 % is_epr: 0
% 1.91/2.24 % is_horn: 1
% 1.91/2.24 % has_eq: 1
% 1.91/2.24 % num_pure_diseq_elim: 0
% 1.91/2.24 % simp_replaced_by: 0
% 1.91/2.24 % res_preprocessed: 34
% 1.91/2.24 % prep_upred: 0
% 1.91/2.24 % prep_unflattend: 0
% 1.91/2.24 % pred_elim_cands: 0
% 1.91/2.24 % pred_elim: 0
% 1.91/2.24 % pred_elim_cl: 0
% 1.91/2.24 % pred_elim_cycles: 0
% 1.91/2.24 % forced_gc_time: 0
% 1.91/2.24 % gc_basic_clause_elim: 0
% 1.91/2.24 % parsing_time: 0.004
% 1.91/2.24 % sem_filter_time: 0.
% 1.91/2.24 % pred_elim_time: 0.
% 1.91/2.24 % out_proof_time: 0.
% 1.91/2.24 % monotx_time: 0.
% 1.91/2.24 % subtype_inf_time: 0.
% 1.91/2.24 % unif_index_cands_time: 0.
% 1.91/2.24 % unif_index_add_time: 0.
% 1.91/2.24 % total_time: 1.012
% 1.91/2.24 % num_of_symbols: 71
% 1.91/2.24 % num_of_terms: 584
% 1.91/2.24
% 1.91/2.24 % ------ Propositional Solver
% 1.91/2.24
% 1.91/2.24 % prop_solver_calls: 1
% 1.91/2.24 % prop_fast_solver_calls: 51
% 1.91/2.24 % prop_num_of_clauses: 155
% 1.91/2.24 % prop_preprocess_simplified: 323
% 1.91/2.24 % prop_fo_subsumed: 0
% 1.91/2.24 % prop_solver_time: 0.
% 1.91/2.24 % prop_fast_solver_time: 0.
% 1.91/2.24 % prop_unsat_core_time: 0.
% 1.91/2.24
% 1.91/2.24 % ------ QBF
% 1.91/2.24
% 1.91/2.24 % qbf_q_res: 0
% 1.91/2.24 % qbf_num_tautologies: 0
% 1.91/2.24 % qbf_prep_cycles: 0
% 1.91/2.24
% 1.91/2.24 % ------ BMC1
% 1.91/2.24
% 1.91/2.24 % bmc1_current_bound: -1
% 1.91/2.24 % bmc1_last_solved_bound: -1
% 1.91/2.24 % bmc1_unsat_core_size: -1
% 1.91/2.24 % bmc1_unsat_core_parents_size: -1
% 1.91/2.24 % bmc1_merge_next_fun: 0
% 1.91/2.24 % bmc1_unsat_core_clauses_time: 0.
% 1.91/2.24
% 1.91/2.24 % ------ Instantiation
% 1.91/2.24
% 1.91/2.24 % inst_num_of_clauses: 84
% 1.91/2.24 % inst_num_in_passive: 0
% 1.91/2.24 % inst_num_in_active: 0
% 1.91/2.24 % inst_num_in_unprocessed: 84
% 1.91/2.24 % inst_num_of_loops: 0
% 1.91/2.24 % inst_num_of_learning_restarts: 0
% 1.91/2.24 % inst_num_moves_active_passive: 0
% 1.91/2.24 % inst_lit_activity: 0
% 1.91/2.24 % inst_lit_activity_moves: 0
% 1.91/2.24 % inst_num_tautologies: 0
% 1.91/2.24 % inst_num_prop_implied: 0
% 1.91/2.24 % inst_num_existing_simplified: 0
% 1.91/2.24 % inst_num_eq_res_simplified: 0
% 1.91/2.24 % inst_num_child_elim: 0
% 1.91/2.24 % inst_num_of_dismatching_blockings: 0
% 1.91/2.24 % inst_num_of_non_proper_insts: 0
% 1.91/2.24 % inst_num_of_duplicates: 0
% 1.91/2.24 % inst_inst_num_from_inst_to_res: 0
% 1.91/2.24 % inst_dismatching_checking_time: 0.
% 1.91/2.24
% 1.91/2.24 % ------ Resolution
% 1.91/2.24
% 1.91/2.24 % res_num_of_clauses: 84
% 1.91/2.24 % res_num_in_passive: 0
% 1.91/2.24 % res_num_in_active: 17
% 1.91/2.24 % res_num_of_loops: 18
% 1.91/2.24 % res_forward_subset_subsumed: 0
% 1.91/2.24 % res_backward_subset_subsumed: 0
% 1.91/2.24 % res_forward_subsumed: 0
% 1.91/2.24 % res_backward_subsumed: 0
% 1.91/2.24 % res_forward_subsumption_resolution: 0
% 1.91/2.24 % res_backward_subsumption_resolution: 0
% 1.91/2.24 % res_clause_to_clause_subsumption: 0
% 1.91/2.24 % res_orphan_elimination: 0
% 1.91/2.24 % res_tautology_del: 0
% 1.91/2.24 % res_num_eq_res_simplified: 0
% 1.91/2.24 % res_num_sel_changes: 0
% 1.91/2.24 % res_moves_from_active_to_pass: 0
% 1.91/2.24
% 1.91/2.24 % Status Unknown
% 1.91/2.24 % Last status :
% 1.91/2.24 % SZS status Unknown
%------------------------------------------------------------------------------