TSTP Solution File: NLP061-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP061-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n017.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:39:12 EDT 2022
% Result : Unknown 6.99s 7.23s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP061-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 30 18:26:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/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_34199f.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_f42cc7.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_584dd6 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_34199f.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44 % ------ Parsing...% successful
% 0.20/0.44
% 0.20/0.44 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 % ------ Problem Properties
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % EPR false
% 0.20/0.44 % Horn false
% 0.20/0.44 % Has equality false
% 0.20/0.44
% 0.20/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % % ------ Current options:
% 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
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 3.61/3.79 % --inst_prop_sim_new false
% 3.61/3.79 % --inst_orphan_elimination true
% 3.61/3.79 % --inst_learning_loop_flag true
% 3.61/3.79 % --inst_learning_start 3000
% 3.61/3.79 % --inst_learning_factor 2
% 3.61/3.79 % --inst_start_prop_sim_after_learn 3
% 3.61/3.79 % --inst_sel_renew solver
% 3.61/3.79 % --inst_lit_activity_flag true
% 3.61/3.79 % --inst_out_proof true
% 3.61/3.79
% 3.61/3.79 % ------ Resolution Options
% 3.61/3.79
% 3.61/3.79 % --resolution_flag true
% 3.61/3.79 % --res_lit_sel kbo_max
% 3.61/3.79 % --res_to_prop_solver none
% 3.61/3.79 % --res_prop_simpl_new false
% 3.61/3.79 % --res_prop_simpl_given false
% 3.61/3.79 % --res_passive_queue_type priority_queues
% 3.61/3.79 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.61/3.79 % --res_passive_queues_freq [15;5]
% 3.61/3.79 % --res_forward_subs full
% 3.61/3.79 % --res_backward_subs full
% 3.61/3.79 % --res_forward_subs_resolution true
% 3.61/3.79 % --res_backward_subs_resolution true
% 3.61/3.79 % --res_orphan_elimination false
% 3.61/3.79 % --res_time_limit 1000.
% 3.61/3.79 % --res_out_proof true
% 3.61/3.79 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_34199f.s
% 3.61/3.79 % --modulo true
% 3.61/3.79
% 3.61/3.79 % ------ Combination Options
% 3.61/3.79
% 3.61/3.79 % --comb_res_mult 1000
% 3.61/3.79 % --comb_inst_mult 300
% 3.61/3.79 % ------
% 3.61/3.79
% 3.61/3.79
% 3.61/3.79
% 3.61/3.79 % ------ Proving...
% 3.61/3.79 % warning: shown sat in sat incomplete mode
% 3.61/3.79 %
% 3.61/3.79
% 3.61/3.79
% 3.61/3.79 ------ Building Model...Done
% 3.61/3.79
% 3.61/3.79 %------ The model is defined over ground terms (initial term algebra).
% 3.61/3.79 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.61/3.79 %------ where \phi is a formula over the term algebra.
% 3.61/3.79 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.61/3.79 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.61/3.79 %------ See help for --sat_out_model for different model outputs.
% 3.61/3.79 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.61/3.79 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.61/3.79
% 3.61/3.79
% 3.61/3.79
% 3.61/3.79
% 3.61/3.79 %------ Negative definition of ssSkP0
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1,X2] :
% 3.61/3.79 ( ~(ssSkP0(X0,X1,X2)) <=>
% 3.61/3.79 (
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc60 & X1=skc61 & X2=skc59 )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Positive definition of event
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1] :
% 3.61/3.79 ( event(X0,X1) <=>
% 3.61/3.79 (
% 3.61/3.79 ? [X2,X3] :
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf19(skc59,X2,X3) )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Positive definition of agent
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1,X2] :
% 3.61/3.79 ( agent(X0,X1,X2) <=>
% 3.61/3.79 (
% 3.61/3.79 ? [X3,X4] :
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf19(skc59,X3,X4) & X2=skf20(skc59,X4,X3) )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Negative definition of patient
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1,X2] :
% 3.61/3.79 ( ~(patient(X0,X1,X2)) <=>
% 3.61/3.79 $false
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Negative definition of present
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1] :
% 3.61/3.79 ( ~(present(X0,X1)) <=>
% 3.61/3.79 $false
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Negative definition of nonreflexive
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1] :
% 3.61/3.79 ( ~(nonreflexive(X0,X1)) <=>
% 3.61/3.79 $false
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Negative definition of fire
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1] :
% 3.61/3.79 ( ~(fire(X0,X1)) <=>
% 3.61/3.79 $false
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Negative definition of from_loc
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1,X2] :
% 3.61/3.79 ( ~(from_loc(X0,X1,X2)) <=>
% 3.61/3.79 $false
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Positive definition of man
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1] :
% 3.61/3.79 ( man(X0,X1) <=>
% 3.61/3.79 (
% 3.61/3.79 ? [X2,X3] :
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf20(skc59,X2,X3) )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 |
% 3.61/3.79 ? [X2,X3] :
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf18(skc59,X2,X3) )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Positive definition of cannon
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1] :
% 3.61/3.79 ( cannon(X0,X1) <=>
% 3.61/3.79 (
% 3.61/3.79 ? [X2,X3] :
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf16(skc59,X2,X3) )
% 3.61/3.79 &
% 3.61/3.79 ( X2!=skc61 )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 |
% 3.61/3.79 ? [X2] :
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf16(skc59,skc61,X2) )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 |
% 3.61/3.79 ? [X2,X3] :
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf26(skc59,X2,X3) )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Positive definition of of
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1,X2] :
% 3.61/3.79 ( of(X0,X1,X2) <=>
% 3.61/3.79 (
% 3.61/3.79 ? [X3] :
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf16(skc59,skc61,X3) & X2=skc61 )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Positive definition of member
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1,X2] :
% 3.61/3.79 ( member(X0,X1,X2) <=>
% 3.61/3.79 (
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf28(skc59,skc60) & X2=skc60 )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 |
% 3.61/3.79 ? [X3] :
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf14(skc60,skc59,X3) & X2=skc60 )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Negative definition of ssSkP1
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1,X2] :
% 3.61/3.79 ( ~(ssSkP1(X0,X1,X2)) <=>
% 3.61/3.79 $false
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Positive definition of ssSkC0
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 ( ssSkC0 <=>
% 3.61/3.79 $false
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Negative definition of actual_world
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0] :
% 3.61/3.79 ( ~(actual_world(X0)) <=>
% 3.61/3.79 $false
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Positive definition of male
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1] :
% 3.61/3.79 ( male(X0,X1) <=>
% 3.61/3.79 (
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skc61 )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Positive definition of group
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1] :
% 3.61/3.79 ( group(X0,X1) <=>
% 3.61/3.79 (
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skc60 )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Negative definition of six
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1] :
% 3.61/3.79 ( ~(six(X0,X1)) <=>
% 3.61/3.79 $false
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79 %------ Positive definition of shot
% 3.61/3.79 fof(lit_def,axiom,
% 3.61/3.79 (! [X0,X1] :
% 3.61/3.79 ( shot(X0,X1) <=>
% 3.61/3.79 (
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf28(skc59,skc60) )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 |
% 3.61/3.79 ? [X2] :
% 3.61/3.79 (
% 3.61/3.79 ( X0=skc59 & X1=skf14(skc60,skc59,X2) )
% 3.61/3.79 )
% 3.61/3.79
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 )
% 3.61/3.79 ).
% 3.61/3.79
% 3.61/3.79
% 3.61/3.79
% 3.61/3.79 % ------ Statistics
% 3.61/3.79
% 3.61/3.79 % ------ General
% 3.61/3.79
% 3.61/3.79 % num_of_input_clauses: 40
% 3.61/3.79 % num_of_input_neg_conjectures: 40
% 3.61/3.79 % num_of_splits: 0
% 3.61/3.79 % num_of_split_atoms: 0
% 3.61/3.79 % num_of_sem_filtered_clauses: 0
% 3.61/3.79 % num_of_subtypes: 0
% 3.61/3.79 % monotx_restored_types: 0
% 3.61/3.79 % sat_num_of_epr_types: 0
% 3.61/3.79 % sat_num_of_non_cyclic_types: 0
% 3.61/3.79 % sat_guarded_non_collapsed_types: 0
% 3.61/3.79 % is_epr: 0
% 3.61/3.79 % is_horn: 0
% 3.61/3.79 % has_eq: 0
% 3.61/3.79 % num_pure_diseq_elim: 0
% 3.61/3.79 % simp_replaced_by: 0
% 3.61/3.79 % res_preprocessed: 80
% 3.61/3.79 % prep_upred: 0
% 3.61/3.79 % prep_unflattend: 0
% 3.61/3.79 % pred_elim_cands: 0
% 3.61/3.79 % pred_elim: 0
% 3.61/3.79 % pred_elim_cl: 0
% 3.61/3.79 % pred_elim_cycles: 0
% 3.61/3.79 % forced_gc_time: 0
% 3.61/3.79 % gc_basic_clause_elim: 0
% 3.61/3.79 % parsing_time: 0.002
% 3.61/3.79 % sem_filter_time: 0.
% 3.61/3.79 % pred_elim_time: 0.
% 3.61/3.79 % out_proof_time: 0.
% 3.61/3.79 % monotx_time: 0.
% 3.61/3.79 % subtype_inf_time: 0.
% 3.61/3.79 % unif_index_cands_time: 0.004
% 3.61/3.79 % unif_index_add_time: 0.003
% 3.61/3.79 % total_time: 3.376
% 3.61/3.79 % num_of_symbols: 60
% 3.61/3.79 % num_of_terms: 7648
% 3.61/3.79
% 3.61/3.79 % ------ Propositional Solver
% 3.61/3.79
% 3.61/3.79 % prop_solver_calls: 10
% 3.61/3.79 % prop_fast_solver_calls: 495
% 3.61/3.79 % prop_num_of_clauses: 557
% 3.61/3.79 % prop_preprocess_simplified: 1187
% 3.61/3.79 % prop_fo_subsumed: 0
% 3.61/3.79 % prop_solver_time: 0.
% 3.61/3.79 % prop_fast_solver_time: 0.
% 3.61/3.79 % prop_unsat_core_time: 0.
% 3.61/3.79
% 3.61/3.79 % ------ QBF
% 3.61/3.79
% 3.61/3.79 % qbf_q_res: 0
% 3.61/3.79 % qbf_num_tautologies: 0
% 3.61/3.79 % qbf_prep_cycles: 0
% 3.61/3.79
% 3.61/3.79 % ------ BMC1
% 3.61/3.79
% 3.61/3.79 % bmc1_current_bound: -1
% 3.61/3.79 % bmc1_last_solved_bound: -1
% 3.61/3.79 % bmc1_unsat_core_size: -1
% 3.61/3.79 % bmc1_unsat_core_parents_size: -1
% 3.61/3.79 % bmc1_merge_next_fun: 0
% 3.61/3.79 % bmc1_unsat_core_clauses_time: 0.
% 3.61/3.79
% 3.61/3.79 % ------ Instantiation
% 3.61/3.79
% 3.61/3.79 % inst_num_of_clauses: 285
% 3.61/3.79 % inst_num_in_passive: 0
% 3.61/3.79 % inst_num_in_active: 285
% 3.61/3.79 % inst_num_in_unprocessed: 0
% 3.61/3.79 % inst_num_of_loops: 348
% 3.61/3.79 % inst_num_of_learning_restarts: 0
% 3.61/3.79 % inst_num_moves_active_passive: 51
% 3.61/3.79 % inst_lit_activity: 60
% 3.61/3.79 % inst_lit_activity_moves: 0
% 3.61/3.79 % inst_num_tautologies: 0
% 3.61/3.79 % inst_num_prop_implied: 0
% 3.61/3.79 % inst_num_existing_simplified: 0
% 3.61/3.79 % inst_num_eq_res_simplified: 0
% 3.61/3.79 % inst_num_child_elim: 0
% 3.61/3.79 % inst_num_of_dismatching_blockings: 22
% 3.61/3.79 % inst_num_of_non_proper_insts: 472
% 3.61/3.79 % inst_num_of_duplicates: 115
% 3.61/3.79 % inst_inst_num_from_inst_to_res: 0
% 3.61/3.79 % inst_dismatching_checking_time: 0.
% 3.61/3.79
% 3.61/3.79 % ------ Resolution
% 3.61/3.79
% 3.61/3.79 % res_num_of_clauses: 40795
% 3.61/3.79 % res_num_in_passive: 40904
% 3.61/3.79 % res_num_in_active: 1126
% 3.61/3.79 % res_num_of_loops: 2000
% 3.61/3.79 % res_forward_subset_subsumed: 15608
% 3.61/3.79 % res_backward_subset_subsumed: 1375
% 3.61/3.79 % res_forward_subsumed: 641
% 3.61/3.79 % res_backward_subsumed: 149
% 3.61/3.79 % res_forward_subsumption_resolution: 509
% 3.61/3.79 % res_backward_subsumption_resolution: 0
% 3.61/3.79 % res_clause_to_clause_subsumption: 3502
% 3.61/3.79 % res_orphan_elimination: 0
% 3.61/3.79 % res_tautology_del: 3764
% 3.61/3.79 % res_num_eq_res_simplified: 0
% 3.61/3.79 % res_num_sel_changes: 0
% 3.61/3.79 % res_moves_from_active_to_pass: 0
% 3.61/3.79
% 3.61/3.79 % Status Unknown
% 3.61/3.83 % Orienting using strategy ClausalAll
% 3.61/3.83 % Orientation found
% 3.61/3.83 % 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_34199f.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_f42cc7.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_dae779 | grep -v "SZS"
% 3.68/3.85
% 3.68/3.85 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 3.68/3.85
% 3.68/3.85 %
% 3.68/3.85 % ------ iProver source info
% 3.68/3.85
% 3.68/3.85 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 3.68/3.85 % git: non_committed_changes: true
% 3.68/3.85 % git: last_make_outside_of_git: true
% 3.68/3.85
% 3.68/3.85 %
% 3.68/3.85 % ------ Input Options
% 3.68/3.85
% 3.68/3.85 % --out_options all
% 3.68/3.85 % --tptp_safe_out true
% 3.68/3.85 % --problem_path ""
% 3.68/3.85 % --include_path ""
% 3.68/3.85 % --clausifier .//eprover
% 3.68/3.85 % --clausifier_options --tstp-format
% 3.68/3.85 % --stdin false
% 3.68/3.85 % --dbg_backtrace false
% 3.68/3.85 % --dbg_dump_prop_clauses false
% 3.68/3.85 % --dbg_dump_prop_clauses_file -
% 3.68/3.85 % --dbg_out_stat false
% 3.68/3.85
% 3.68/3.85 % ------ General Options
% 3.68/3.85
% 3.68/3.85 % --fof false
% 3.68/3.85 % --time_out_real 150.
% 3.68/3.85 % --time_out_prep_mult 0.2
% 3.68/3.85 % --time_out_virtual -1.
% 3.68/3.85 % --schedule none
% 3.68/3.85 % --ground_splitting input
% 3.68/3.85 % --splitting_nvd 16
% 3.68/3.85 % --non_eq_to_eq false
% 3.68/3.85 % --prep_gs_sim true
% 3.68/3.85 % --prep_unflatten false
% 3.68/3.85 % --prep_res_sim true
% 3.68/3.85 % --prep_upred true
% 3.68/3.85 % --res_sim_input true
% 3.68/3.85 % --clause_weak_htbl true
% 3.68/3.85 % --gc_record_bc_elim false
% 3.68/3.85 % --symbol_type_check false
% 3.68/3.85 % --clausify_out false
% 3.68/3.85 % --large_theory_mode false
% 3.68/3.85 % --prep_sem_filter none
% 3.68/3.85 % --prep_sem_filter_out false
% 3.68/3.85 % --preprocessed_out false
% 3.68/3.85 % --sub_typing false
% 3.68/3.85 % --brand_transform false
% 3.68/3.85 % --pure_diseq_elim true
% 3.68/3.85 % --min_unsat_core false
% 3.68/3.85 % --pred_elim true
% 3.68/3.85 % --add_important_lit false
% 3.68/3.85 % --soft_assumptions false
% 3.68/3.85 % --reset_solvers false
% 3.68/3.85 % --bc_imp_inh []
% 3.68/3.85 % --conj_cone_tolerance 1.5
% 3.68/3.85 % --prolific_symb_bound 500
% 3.68/3.85 % --lt_threshold 2000
% 3.68/3.85
% 3.68/3.85 % ------ SAT Options
% 3.68/3.85
% 3.68/3.85 % --sat_mode false
% 3.68/3.85 % --sat_fm_restart_options ""
% 3.68/3.85 % --sat_gr_def false
% 3.68/3.85 % --sat_epr_types true
% 3.68/3.85 % --sat_non_cyclic_types false
% 3.68/3.85 % --sat_finite_models false
% 3.68/3.85 % --sat_fm_lemmas false
% 3.68/3.85 % --sat_fm_prep false
% 3.68/3.85 % --sat_fm_uc_incr true
% 3.68/3.85 % --sat_out_model small
% 3.68/3.85 % --sat_out_clauses false
% 3.68/3.85
% 3.68/3.85 % ------ QBF Options
% 3.68/3.85
% 3.68/3.85 % --qbf_mode false
% 3.68/3.85 % --qbf_elim_univ true
% 3.68/3.85 % --qbf_sk_in true
% 3.68/3.85 % --qbf_pred_elim true
% 3.68/3.85 % --qbf_split 32
% 3.68/3.85
% 3.68/3.85 % ------ BMC1 Options
% 3.68/3.85
% 3.68/3.85 % --bmc1_incremental false
% 3.68/3.85 % --bmc1_axioms reachable_all
% 3.68/3.85 % --bmc1_min_bound 0
% 3.68/3.85 % --bmc1_max_bound -1
% 3.68/3.85 % --bmc1_max_bound_default -1
% 3.68/3.85 % --bmc1_symbol_reachability true
% 3.68/3.85 % --bmc1_property_lemmas false
% 3.68/3.85 % --bmc1_k_induction false
% 3.68/3.85 % --bmc1_non_equiv_states false
% 3.68/3.85 % --bmc1_deadlock false
% 3.68/3.85 % --bmc1_ucm false
% 3.68/3.85 % --bmc1_add_unsat_core none
% 3.68/3.85 % --bmc1_unsat_core_children false
% 3.68/3.85 % --bmc1_unsat_core_extrapolate_axioms false
% 3.68/3.85 % --bmc1_out_stat full
% 3.68/3.85 % --bmc1_ground_init false
% 3.68/3.85 % --bmc1_pre_inst_next_state false
% 3.68/3.85 % --bmc1_pre_inst_state false
% 3.68/3.85 % --bmc1_pre_inst_reach_state false
% 3.68/3.85 % --bmc1_out_unsat_core false
% 3.68/3.85 % --bmc1_aig_witness_out false
% 3.68/3.85 % --bmc1_verbose false
% 3.68/3.85 % --bmc1_dump_clauses_tptp false
% 3.68/3.87 % --bmc1_dump_unsat_core_tptp false
% 3.68/3.87 % --bmc1_dump_file -
% 3.68/3.87 % --bmc1_ucm_expand_uc_limit 128
% 3.68/3.87 % --bmc1_ucm_n_expand_iterations 6
% 3.68/3.87 % --bmc1_ucm_extend_mode 1
% 3.68/3.87 % --bmc1_ucm_init_mode 2
% 3.68/3.87 % --bmc1_ucm_cone_mode none
% 3.68/3.87 % --bmc1_ucm_reduced_relation_type 0
% 3.68/3.87 % --bmc1_ucm_relax_model 4
% 3.68/3.87 % --bmc1_ucm_full_tr_after_sat true
% 3.68/3.87 % --bmc1_ucm_expand_neg_assumptions false
% 3.68/3.87 % --bmc1_ucm_layered_model none
% 3.68/3.87 % --bmc1_ucm_max_lemma_size 10
% 3.68/3.87
% 3.68/3.87 % ------ AIG Options
% 3.68/3.87
% 3.68/3.87 % --aig_mode false
% 3.68/3.87
% 3.68/3.87 % ------ Instantiation Options
% 3.68/3.87
% 3.68/3.87 % --instantiation_flag true
% 3.68/3.87 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 3.68/3.87 % --inst_solver_per_active 750
% 3.68/3.87 % --inst_solver_calls_frac 0.5
% 3.68/3.87 % --inst_passive_queue_type priority_queues
% 3.68/3.87 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 3.68/3.87 % --inst_passive_queues_freq [25;2]
% 3.68/3.87 % --inst_dismatching true
% 3.68/3.87 % --inst_eager_unprocessed_to_passive true
% 3.68/3.87 % --inst_prop_sim_given true
% 3.68/3.87 % --inst_prop_sim_new false
% 3.68/3.87 % --inst_orphan_elimination true
% 3.68/3.87 % --inst_learning_loop_flag true
% 3.68/3.87 % --inst_learning_start 3000
% 3.68/3.87 % --inst_learning_factor 2
% 3.68/3.87 % --inst_start_prop_sim_after_learn 3
% 3.68/3.87 % --inst_sel_renew solver
% 3.68/3.87 % --inst_lit_activity_flag true
% 3.68/3.87 % --inst_out_proof true
% 3.68/3.87
% 3.68/3.87 % ------ Resolution Options
% 3.68/3.87
% 3.68/3.87 % --resolution_flag true
% 3.68/3.87 % --res_lit_sel kbo_max
% 3.68/3.87 % --res_to_prop_solver none
% 3.68/3.87 % --res_prop_simpl_new false
% 3.68/3.87 % --res_prop_simpl_given false
% 3.68/3.87 % --res_passive_queue_type priority_queues
% 3.68/3.87 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.68/3.87 % --res_passive_queues_freq [15;5]
% 3.68/3.87 % --res_forward_subs full
% 3.68/3.87 % --res_backward_subs full
% 3.68/3.87 % --res_forward_subs_resolution true
% 3.68/3.87 % --res_backward_subs_resolution true
% 3.68/3.87 % --res_orphan_elimination false
% 3.68/3.87 % --res_time_limit 1000.
% 3.68/3.87 % --res_out_proof true
% 3.68/3.87 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_34199f.s
% 3.68/3.87 % --modulo true
% 3.68/3.87
% 3.68/3.87 % ------ Combination Options
% 3.68/3.87
% 3.68/3.87 % --comb_res_mult 1000
% 3.68/3.87 % --comb_inst_mult 300
% 3.68/3.87 % ------
% 3.68/3.87
% 3.68/3.87 % ------ Parsing...% successful
% 3.68/3.87
% 3.68/3.87 % ------ 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 %
% 3.68/3.87
% 3.68/3.87 % ------ Proving...
% 3.68/3.87 % ------ Problem Properties
% 3.68/3.87
% 3.68/3.87 %
% 3.68/3.87 % EPR false
% 3.68/3.87 % Horn false
% 3.68/3.87 % Has equality false
% 3.68/3.87
% 3.68/3.87 % % ------ Input Options Time Limit: Unbounded
% 3.68/3.87
% 3.68/3.87
% 3.68/3.87 % % ------ Current options:
% 3.68/3.87
% 3.68/3.87 % ------ Input Options
% 3.68/3.87
% 3.68/3.87 % --out_options all
% 3.68/3.87 % --tptp_safe_out true
% 3.68/3.87 % --problem_path ""
% 3.68/3.87 % --include_path ""
% 3.68/3.87 % --clausifier .//eprover
% 3.68/3.87 % --clausifier_options --tstp-format
% 3.68/3.87 % --stdin false
% 3.68/3.87 % --dbg_backtrace false
% 3.68/3.87 % --dbg_dump_prop_clauses false
% 3.68/3.87 % --dbg_dump_prop_clauses_file -
% 3.68/3.87 % --dbg_out_stat false
% 3.68/3.87
% 3.68/3.87 % ------ General Options
% 3.68/3.87
% 3.68/3.87 % --fof false
% 3.68/3.87 % --time_out_real 150.
% 3.68/3.87 % --time_out_prep_mult 0.2
% 3.68/3.87 % --time_out_virtual -1.
% 3.68/3.87 % --schedule none
% 3.68/3.87 % --ground_splitting input
% 3.68/3.87 % --splitting_nvd 16
% 3.68/3.87 % --non_eq_to_eq false
% 3.68/3.87 % --prep_gs_sim true
% 3.68/3.87 % --prep_unflatten false
% 3.68/3.87 % --prep_res_sim true
% 3.68/3.87 % --prep_upred true
% 3.68/3.87 % --res_sim_input true
% 3.68/3.87 % --clause_weak_htbl true
% 3.68/3.87 % --gc_record_bc_elim false
% 3.68/3.87 % --symbol_type_check false
% 3.68/3.87 % --clausify_out false
% 3.68/3.87 % --large_theory_mode false
% 3.68/3.87 % --prep_sem_filter none
% 3.68/3.87 % --prep_sem_filter_out false
% 3.68/3.87 % --preprocessed_out false
% 3.68/3.87 % --sub_typing false
% 3.68/3.87 % --brand_transform false
% 3.68/3.87 % --pure_diseq_elim true
% 3.68/3.87 % --min_unsat_core false
% 3.68/3.87 % --pred_elim true
% 3.68/3.87 % --add_important_lit false
% 3.68/3.87 % --soft_assumptions false
% 3.68/3.87 % --reset_solvers false
% 3.68/3.87 % --bc_imp_inh []
% 3.68/3.87 % --conj_cone_tolerance 1.5
% 3.68/3.87 % --prolific_symb_bound 500
% 3.68/3.87 % --lt_threshold 2000
% 3.68/3.87
% 3.68/3.87 % ------ SAT Options
% 3.68/3.87
% 3.68/3.87 % --sat_mode false
% 3.68/3.87 % --sat_fm_restart_options ""
% 3.68/3.87 % --sat_gr_def false
% 3.68/3.87 % --sat_epr_types true
% 3.68/3.87 % --sat_non_cyclic_types false
% 3.68/3.87 % --sat_finite_models false
% 3.68/3.87 % --sat_fm_lemmas false
% 3.68/3.87 % --sat_fm_prep false
% 3.68/3.87 % --sat_fm_uc_incr true
% 3.68/3.87 % --sat_out_model small
% 3.68/3.87 % --sat_out_clauses false
% 3.68/3.87
% 3.68/3.87 % ------ QBF Options
% 3.68/3.87
% 3.68/3.87 % --qbf_mode false
% 3.68/3.87 % --qbf_elim_univ true
% 3.68/3.87 % --qbf_sk_in true
% 3.68/3.87 % --qbf_pred_elim true
% 3.68/3.87 % --qbf_split 32
% 3.68/3.87
% 3.68/3.87 % ------ BMC1 Options
% 3.68/3.87
% 3.68/3.87 % --bmc1_incremental false
% 3.68/3.87 % --bmc1_axioms reachable_all
% 3.68/3.87 % --bmc1_min_bound 0
% 3.68/3.87 % --bmc1_max_bound -1
% 3.68/3.87 % --bmc1_max_bound_default -1
% 3.68/3.87 % --bmc1_symbol_reachability true
% 3.68/3.87 % --bmc1_property_lemmas false
% 3.68/3.87 % --bmc1_k_induction false
% 3.68/3.87 % --bmc1_non_equiv_states false
% 3.68/3.87 % --bmc1_deadlock false
% 3.68/3.87 % --bmc1_ucm false
% 3.68/3.87 % --bmc1_add_unsat_core none
% 3.68/3.87 % --bmc1_unsat_core_children false
% 3.68/3.87 % --bmc1_unsat_core_extrapolate_axioms false
% 3.68/3.87 % --bmc1_out_stat full
% 3.68/3.87 % --bmc1_ground_init false
% 3.68/3.87 % --bmc1_pre_inst_next_state false
% 3.68/3.87 % --bmc1_pre_inst_state false
% 3.68/3.87 % --bmc1_pre_inst_reach_state false
% 3.68/3.87 % --bmc1_out_unsat_core false
% 3.68/3.87 % --bmc1_aig_witness_out false
% 3.68/3.87 % --bmc1_verbose false
% 3.68/3.87 % --bmc1_dump_clauses_tptp false
% 3.68/3.87 % --bmc1_dump_unsat_core_tptp false
% 3.68/3.87 % --bmc1_dump_file -
% 3.68/3.87 % --bmc1_ucm_expand_uc_limit 128
% 3.68/3.87 % --bmc1_ucm_n_expand_iterations 6
% 3.68/3.87 % --bmc1_ucm_extend_mode 1
% 3.68/3.87 % --bmc1_ucm_init_mode 2
% 3.68/3.87 % --bmc1_ucm_cone_mode none
% 3.68/3.87 % --bmc1_ucm_reduced_relation_type 0
% 3.68/3.87 % --bmc1_ucm_relax_model 4
% 3.68/3.87 % --bmc1_ucm_full_tr_after_sat true
% 3.68/3.87 % --bmc1_ucm_expand_neg_assumptions false
% 3.68/3.87 % --bmc1_ucm_layered_model none
% 3.68/3.87 % --bmc1_ucm_max_lemma_size 10
% 3.68/3.87
% 3.68/3.87 % ------ AIG Options
% 3.68/3.87
% 3.68/3.87 % --aig_mode false
% 3.68/3.87
% 3.68/3.87 % ------ Instantiation Options
% 3.68/3.87
% 3.68/3.87 % --instantiation_flag true
% 3.68/3.87 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 3.68/3.87 % --inst_solver_per_active 750
% 3.68/3.87 % --inst_solver_calls_frac 0.5
% 3.68/3.87 % --inst_passive_queue_type priority_queues
% 3.68/3.87 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 3.68/3.87 % --inst_passive_queues_freq [25;2]
% 3.68/3.87 % --inst_dismatching true
% 3.68/3.87 % --inst_eager_unprocessed_to_passive true
% 3.68/3.87 % --inst_prop_sim_given true
% 6.99/7.23 % --inst_prop_sim_new false
% 6.99/7.23 % --inst_orphan_elimination true
% 6.99/7.23 % --inst_learning_loop_flag true
% 6.99/7.23 % --inst_learning_start 3000
% 6.99/7.23 % --inst_learning_factor 2
% 6.99/7.23 % --inst_start_prop_sim_after_learn 3
% 6.99/7.23 % --inst_sel_renew solver
% 6.99/7.23 % --inst_lit_activity_flag true
% 6.99/7.23 % --inst_out_proof true
% 6.99/7.23
% 6.99/7.23 % ------ Resolution Options
% 6.99/7.23
% 6.99/7.23 % --resolution_flag true
% 6.99/7.23 % --res_lit_sel kbo_max
% 6.99/7.23 % --res_to_prop_solver none
% 6.99/7.23 % --res_prop_simpl_new false
% 6.99/7.23 % --res_prop_simpl_given false
% 6.99/7.23 % --res_passive_queue_type priority_queues
% 6.99/7.23 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 6.99/7.23 % --res_passive_queues_freq [15;5]
% 6.99/7.23 % --res_forward_subs full
% 6.99/7.23 % --res_backward_subs full
% 6.99/7.23 % --res_forward_subs_resolution true
% 6.99/7.23 % --res_backward_subs_resolution true
% 6.99/7.23 % --res_orphan_elimination false
% 6.99/7.23 % --res_time_limit 1000.
% 6.99/7.23 % --res_out_proof true
% 6.99/7.23 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_34199f.s
% 6.99/7.23 % --modulo true
% 6.99/7.23
% 6.99/7.23 % ------ Combination Options
% 6.99/7.23
% 6.99/7.23 % --comb_res_mult 1000
% 6.99/7.23 % --comb_inst_mult 300
% 6.99/7.23 % ------
% 6.99/7.23
% 6.99/7.23
% 6.99/7.23
% 6.99/7.23 % ------ Proving...
% 6.99/7.23 % warning: shown sat in sat incomplete mode
% 6.99/7.23 %
% 6.99/7.23
% 6.99/7.23
% 6.99/7.23 ------ Building Model...Done
% 6.99/7.23
% 6.99/7.23 %------ The model is defined over ground terms (initial term algebra).
% 6.99/7.23 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 6.99/7.23 %------ where \phi is a formula over the term algebra.
% 6.99/7.23 %------ If we have equality in the problem then it is also defined as a predicate above,
% 6.99/7.23 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 6.99/7.23 %------ See help for --sat_out_model for different model outputs.
% 6.99/7.23 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 6.99/7.23 %------ where the first argument stands for the sort ($i in the unsorted case)
% 6.99/7.23
% 6.99/7.23
% 6.99/7.23
% 6.99/7.23
% 6.99/7.23 %------ Negative definition of ssSkP0
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1,X2] :
% 6.99/7.23 ( ~(ssSkP0(X0,X1,X2)) <=>
% 6.99/7.23 (
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc60 & X1=skc61 & X2=skc59 )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Positive definition of event
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1] :
% 6.99/7.23 ( event(X0,X1) <=>
% 6.99/7.23 (
% 6.99/7.23 ? [X2,X3] :
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf19(skc59,X2,X3) )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Positive definition of agent
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1,X2] :
% 6.99/7.23 ( agent(X0,X1,X2) <=>
% 6.99/7.23 (
% 6.99/7.23 ? [X3,X4] :
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf19(skc59,X3,X4) & X2=skf20(skc59,X4,X3) )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Negative definition of patient
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1,X2] :
% 6.99/7.23 ( ~(patient(X0,X1,X2)) <=>
% 6.99/7.23 $false
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Negative definition of present
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1] :
% 6.99/7.23 ( ~(present(X0,X1)) <=>
% 6.99/7.23 $false
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Negative definition of nonreflexive
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1] :
% 6.99/7.23 ( ~(nonreflexive(X0,X1)) <=>
% 6.99/7.23 $false
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Negative definition of fire
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1] :
% 6.99/7.23 ( ~(fire(X0,X1)) <=>
% 6.99/7.23 $false
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Negative definition of from_loc
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1,X2] :
% 6.99/7.23 ( ~(from_loc(X0,X1,X2)) <=>
% 6.99/7.23 $false
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Positive definition of man
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1] :
% 6.99/7.23 ( man(X0,X1) <=>
% 6.99/7.23 (
% 6.99/7.23 ? [X2,X3] :
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf20(skc59,X2,X3) )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 |
% 6.99/7.23 ? [X2,X3] :
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf18(skc59,X2,X3) )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Positive definition of cannon
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1] :
% 6.99/7.23 ( cannon(X0,X1) <=>
% 6.99/7.23 (
% 6.99/7.23 ? [X2,X3] :
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf16(skc59,X2,X3) )
% 6.99/7.23 &
% 6.99/7.23 ( X2!=skc61 )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 |
% 6.99/7.23 ? [X2] :
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf16(skc59,skc61,X2) )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 |
% 6.99/7.23 ? [X2,X3] :
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf26(skc59,X2,X3) )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Positive definition of of
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1,X2] :
% 6.99/7.23 ( of(X0,X1,X2) <=>
% 6.99/7.23 (
% 6.99/7.23 ? [X3] :
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf16(skc59,skc61,X3) & X2=skc61 )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Positive definition of member
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1,X2] :
% 6.99/7.23 ( member(X0,X1,X2) <=>
% 6.99/7.23 (
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf28(skc59,skc60) & X2=skc60 )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 |
% 6.99/7.23 ? [X3] :
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf14(skc60,skc59,X3) & X2=skc60 )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Negative definition of ssSkP1
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1,X2] :
% 6.99/7.23 ( ~(ssSkP1(X0,X1,X2)) <=>
% 6.99/7.23 $false
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Positive definition of ssSkC0
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 ( ssSkC0 <=>
% 6.99/7.23 $false
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Negative definition of actual_world
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0] :
% 6.99/7.23 ( ~(actual_world(X0)) <=>
% 6.99/7.23 $false
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Positive definition of male
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1] :
% 6.99/7.23 ( male(X0,X1) <=>
% 6.99/7.23 (
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skc61 )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Positive definition of group
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1] :
% 6.99/7.23 ( group(X0,X1) <=>
% 6.99/7.23 (
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skc60 )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Negative definition of six
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1] :
% 6.99/7.23 ( ~(six(X0,X1)) <=>
% 6.99/7.23 $false
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23 %------ Positive definition of shot
% 6.99/7.23 fof(lit_def,axiom,
% 6.99/7.23 (! [X0,X1] :
% 6.99/7.23 ( shot(X0,X1) <=>
% 6.99/7.23 (
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf28(skc59,skc60) )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 |
% 6.99/7.23 ? [X2] :
% 6.99/7.23 (
% 6.99/7.23 ( X0=skc59 & X1=skf14(skc60,skc59,X2) )
% 6.99/7.23 )
% 6.99/7.23
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 )
% 6.99/7.23 ).
% 6.99/7.23
% 6.99/7.23
% 6.99/7.23
% 6.99/7.23 % ------ Statistics
% 6.99/7.23
% 6.99/7.23 % ------ General
% 6.99/7.23
% 6.99/7.23 % num_of_input_clauses: 40
% 6.99/7.23 % num_of_input_neg_conjectures: 40
% 6.99/7.23 % num_of_splits: 0
% 6.99/7.23 % num_of_split_atoms: 0
% 6.99/7.23 % num_of_sem_filtered_clauses: 0
% 6.99/7.23 % num_of_subtypes: 0
% 6.99/7.23 % monotx_restored_types: 0
% 6.99/7.23 % sat_num_of_epr_types: 0
% 6.99/7.23 % sat_num_of_non_cyclic_types: 0
% 6.99/7.23 % sat_guarded_non_collapsed_types: 0
% 6.99/7.23 % is_epr: 0
% 6.99/7.23 % is_horn: 0
% 6.99/7.23 % has_eq: 0
% 6.99/7.23 % num_pure_diseq_elim: 0
% 6.99/7.23 % simp_replaced_by: 0
% 6.99/7.23 % res_preprocessed: 80
% 6.99/7.23 % prep_upred: 0
% 6.99/7.23 % prep_unflattend: 0
% 6.99/7.23 % pred_elim_cands: 0
% 6.99/7.23 % pred_elim: 0
% 6.99/7.23 % pred_elim_cl: 0
% 6.99/7.23 % pred_elim_cycles: 0
% 6.99/7.23 % forced_gc_time: 0
% 6.99/7.23 % gc_basic_clause_elim: 0
% 6.99/7.23 % parsing_time: 0.003
% 6.99/7.23 % sem_filter_time: 0.
% 6.99/7.23 % pred_elim_time: 0.
% 6.99/7.23 % out_proof_time: 0.
% 6.99/7.23 % monotx_time: 0.
% 6.99/7.23 % subtype_inf_time: 0.
% 6.99/7.23 % unif_index_cands_time: 0.004
% 6.99/7.23 % unif_index_add_time: 0.003
% 6.99/7.23 % total_time: 3.393
% 6.99/7.23 % num_of_symbols: 60
% 6.99/7.23 % num_of_terms: 7648
% 6.99/7.23
% 6.99/7.23 % ------ Propositional Solver
% 6.99/7.23
% 6.99/7.23 % prop_solver_calls: 10
% 6.99/7.23 % prop_fast_solver_calls: 495
% 6.99/7.23 % prop_num_of_clauses: 557
% 6.99/7.23 % prop_preprocess_simplified: 1187
% 6.99/7.23 % prop_fo_subsumed: 0
% 6.99/7.23 % prop_solver_time: 0.
% 6.99/7.23 % prop_fast_solver_time: 0.
% 6.99/7.23 % prop_unsat_core_time: 0.
% 6.99/7.23
% 6.99/7.23 % ------ QBF
% 6.99/7.23
% 6.99/7.23 % qbf_q_res: 0
% 6.99/7.23 % qbf_num_tautologies: 0
% 6.99/7.23 % qbf_prep_cycles: 0
% 6.99/7.23
% 6.99/7.23 % ------ BMC1
% 6.99/7.23
% 6.99/7.23 % bmc1_current_bound: -1
% 6.99/7.23 % bmc1_last_solved_bound: -1
% 6.99/7.23 % bmc1_unsat_core_size: -1
% 6.99/7.23 % bmc1_unsat_core_parents_size: -1
% 6.99/7.23 % bmc1_merge_next_fun: 0
% 6.99/7.23 % bmc1_unsat_core_clauses_time: 0.
% 6.99/7.23
% 6.99/7.23 % ------ Instantiation
% 6.99/7.23
% 6.99/7.23 % inst_num_of_clauses: 285
% 6.99/7.23 % inst_num_in_passive: 0
% 6.99/7.23 % inst_num_in_active: 285
% 6.99/7.23 % inst_num_in_unprocessed: 0
% 6.99/7.23 % inst_num_of_loops: 348
% 6.99/7.23 % inst_num_of_learning_restarts: 0
% 6.99/7.23 % inst_num_moves_active_passive: 51
% 6.99/7.23 % inst_lit_activity: 60
% 6.99/7.23 % inst_lit_activity_moves: 0
% 6.99/7.23 % inst_num_tautologies: 0
% 6.99/7.23 % inst_num_prop_implied: 0
% 6.99/7.23 % inst_num_existing_simplified: 0
% 6.99/7.23 % inst_num_eq_res_simplified: 0
% 6.99/7.23 % inst_num_child_elim: 0
% 6.99/7.23 % inst_num_of_dismatching_blockings: 22
% 6.99/7.23 % inst_num_of_non_proper_insts: 472
% 6.99/7.23 % inst_num_of_duplicates: 115
% 6.99/7.23 % inst_inst_num_from_inst_to_res: 0
% 6.99/7.23 % inst_dismatching_checking_time: 0.
% 6.99/7.23
% 6.99/7.23 % ------ Resolution
% 6.99/7.23
% 6.99/7.23 % res_num_of_clauses: 40795
% 6.99/7.23 % res_num_in_passive: 40904
% 6.99/7.23 % res_num_in_active: 1126
% 6.99/7.23 % res_num_of_loops: 2000
% 6.99/7.23 % res_forward_subset_subsumed: 15608
% 6.99/7.23 % res_backward_subset_subsumed: 1375
% 6.99/7.23 % res_forward_subsumed: 641
% 6.99/7.23 % res_backward_subsumed: 149
% 6.99/7.23 % res_forward_subsumption_resolution: 509
% 6.99/7.23 % res_backward_subsumption_resolution: 0
% 6.99/7.23 % res_clause_to_clause_subsumption: 3502
% 6.99/7.23 % res_orphan_elimination: 0
% 6.99/7.23 % res_tautology_del: 3764
% 6.99/7.23 % res_num_eq_res_simplified: 0
% 6.99/7.23 % res_num_sel_changes: 0
% 6.99/7.23 % res_moves_from_active_to_pass: 0
% 6.99/7.23
% 6.99/7.23 % Status Unknown
% 6.99/7.23 % Last status :
% 6.99/7.23 % SZS status Unknown
%------------------------------------------------------------------------------