TSTP Solution File: NLP029-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP029-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 02:38:45 EDT 2022
% Result : Unknown 1.99s 2.19s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NLP029-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : iprover_modulo %s %d
% 0.12/0.32 % Computer : n019.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Fri Jul 1 06:28:08 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.33 % Running in mono-core mode
% 0.18/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.18/0.39 % Orientation found
% 0.18/0.39 % 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_01f835.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_033728.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_a1f710 | grep -v "SZS"
% 0.18/0.41
% 0.18/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.18/0.41
% 0.18/0.41 %
% 0.18/0.41 % ------ iProver source info
% 0.18/0.41
% 0.18/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.18/0.41 % git: non_committed_changes: true
% 0.18/0.41 % git: last_make_outside_of_git: true
% 0.18/0.41
% 0.18/0.41 %
% 0.18/0.41 % ------ Input Options
% 0.18/0.41
% 0.18/0.41 % --out_options all
% 0.18/0.41 % --tptp_safe_out true
% 0.18/0.41 % --problem_path ""
% 0.18/0.41 % --include_path ""
% 0.18/0.41 % --clausifier .//eprover
% 0.18/0.41 % --clausifier_options --tstp-format
% 0.18/0.41 % --stdin false
% 0.18/0.41 % --dbg_backtrace false
% 0.18/0.41 % --dbg_dump_prop_clauses false
% 0.18/0.41 % --dbg_dump_prop_clauses_file -
% 0.18/0.41 % --dbg_out_stat false
% 0.18/0.41
% 0.18/0.41 % ------ General Options
% 0.18/0.41
% 0.18/0.41 % --fof false
% 0.18/0.41 % --time_out_real 150.
% 0.18/0.41 % --time_out_prep_mult 0.2
% 0.18/0.41 % --time_out_virtual -1.
% 0.18/0.41 % --schedule none
% 0.18/0.41 % --ground_splitting input
% 0.18/0.41 % --splitting_nvd 16
% 0.18/0.41 % --non_eq_to_eq false
% 0.18/0.41 % --prep_gs_sim true
% 0.18/0.41 % --prep_unflatten false
% 0.18/0.41 % --prep_res_sim true
% 0.18/0.41 % --prep_upred true
% 0.18/0.41 % --res_sim_input true
% 0.18/0.41 % --clause_weak_htbl true
% 0.18/0.41 % --gc_record_bc_elim false
% 0.18/0.41 % --symbol_type_check false
% 0.18/0.41 % --clausify_out false
% 0.18/0.41 % --large_theory_mode false
% 0.18/0.41 % --prep_sem_filter none
% 0.18/0.41 % --prep_sem_filter_out false
% 0.18/0.41 % --preprocessed_out false
% 0.18/0.41 % --sub_typing false
% 0.18/0.41 % --brand_transform false
% 0.18/0.41 % --pure_diseq_elim true
% 0.18/0.41 % --min_unsat_core false
% 0.18/0.41 % --pred_elim true
% 0.18/0.41 % --add_important_lit false
% 0.18/0.41 % --soft_assumptions false
% 0.18/0.41 % --reset_solvers false
% 0.18/0.41 % --bc_imp_inh []
% 0.18/0.41 % --conj_cone_tolerance 1.5
% 0.18/0.41 % --prolific_symb_bound 500
% 0.18/0.41 % --lt_threshold 2000
% 0.18/0.41
% 0.18/0.41 % ------ SAT Options
% 0.18/0.41
% 0.18/0.41 % --sat_mode false
% 0.18/0.41 % --sat_fm_restart_options ""
% 0.18/0.41 % --sat_gr_def false
% 0.18/0.41 % --sat_epr_types true
% 0.18/0.41 % --sat_non_cyclic_types false
% 0.18/0.41 % --sat_finite_models false
% 0.18/0.41 % --sat_fm_lemmas false
% 0.18/0.41 % --sat_fm_prep false
% 0.18/0.41 % --sat_fm_uc_incr true
% 0.18/0.41 % --sat_out_model small
% 0.18/0.41 % --sat_out_clauses false
% 0.18/0.41
% 0.18/0.41 % ------ QBF Options
% 0.18/0.41
% 0.18/0.41 % --qbf_mode false
% 0.18/0.41 % --qbf_elim_univ true
% 0.18/0.41 % --qbf_sk_in true
% 0.18/0.41 % --qbf_pred_elim true
% 0.18/0.41 % --qbf_split 32
% 0.18/0.41
% 0.18/0.41 % ------ BMC1 Options
% 0.18/0.41
% 0.18/0.41 % --bmc1_incremental false
% 0.18/0.41 % --bmc1_axioms reachable_all
% 0.18/0.41 % --bmc1_min_bound 0
% 0.18/0.41 % --bmc1_max_bound -1
% 0.18/0.41 % --bmc1_max_bound_default -1
% 0.18/0.41 % --bmc1_symbol_reachability true
% 0.18/0.41 % --bmc1_property_lemmas false
% 0.18/0.41 % --bmc1_k_induction false
% 0.18/0.41 % --bmc1_non_equiv_states false
% 0.18/0.41 % --bmc1_deadlock false
% 0.18/0.41 % --bmc1_ucm false
% 0.18/0.41 % --bmc1_add_unsat_core none
% 0.18/0.41 % --bmc1_unsat_core_children false
% 0.18/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.41 % --bmc1_out_stat full
% 0.18/0.41 % --bmc1_ground_init false
% 0.18/0.41 % --bmc1_pre_inst_next_state false
% 0.18/0.41 % --bmc1_pre_inst_state false
% 0.18/0.41 % --bmc1_pre_inst_reach_state false
% 0.18/0.41 % --bmc1_out_unsat_core false
% 0.18/0.41 % --bmc1_aig_witness_out false
% 0.18/0.41 % --bmc1_verbose false
% 0.18/0.41 % --bmc1_dump_clauses_tptp false
% 0.18/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.43 % --bmc1_dump_file -
% 0.18/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.43 % --bmc1_ucm_extend_mode 1
% 0.18/0.43 % --bmc1_ucm_init_mode 2
% 0.18/0.43 % --bmc1_ucm_cone_mode none
% 0.18/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.43 % --bmc1_ucm_relax_model 4
% 0.18/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.43 % --bmc1_ucm_layered_model none
% 0.18/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.43
% 0.18/0.43 % ------ AIG Options
% 0.18/0.43
% 0.18/0.43 % --aig_mode false
% 0.18/0.43
% 0.18/0.43 % ------ Instantiation Options
% 0.18/0.43
% 0.18/0.43 % --instantiation_flag true
% 0.18/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.43 % --inst_solver_per_active 750
% 0.18/0.43 % --inst_solver_calls_frac 0.5
% 0.18/0.43 % --inst_passive_queue_type priority_queues
% 0.18/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.43 % --inst_passive_queues_freq [25;2]
% 0.18/0.43 % --inst_dismatching true
% 0.18/0.43 % --inst_eager_unprocessed_to_passive true
% 0.18/0.43 % --inst_prop_sim_given true
% 0.18/0.43 % --inst_prop_sim_new false
% 0.18/0.43 % --inst_orphan_elimination true
% 0.18/0.43 % --inst_learning_loop_flag true
% 0.18/0.43 % --inst_learning_start 3000
% 0.18/0.43 % --inst_learning_factor 2
% 0.18/0.43 % --inst_start_prop_sim_after_learn 3
% 0.18/0.43 % --inst_sel_renew solver
% 0.18/0.43 % --inst_lit_activity_flag true
% 0.18/0.43 % --inst_out_proof true
% 0.18/0.43
% 0.18/0.43 % ------ Resolution Options
% 0.18/0.43
% 0.18/0.43 % --resolution_flag true
% 0.18/0.43 % --res_lit_sel kbo_max
% 0.18/0.43 % --res_to_prop_solver none
% 0.18/0.43 % --res_prop_simpl_new false
% 0.18/0.43 % --res_prop_simpl_given false
% 0.18/0.43 % --res_passive_queue_type priority_queues
% 0.18/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.43 % --res_passive_queues_freq [15;5]
% 0.18/0.43 % --res_forward_subs full
% 0.18/0.43 % --res_backward_subs full
% 0.18/0.43 % --res_forward_subs_resolution true
% 0.18/0.43 % --res_backward_subs_resolution true
% 0.18/0.43 % --res_orphan_elimination false
% 0.18/0.43 % --res_time_limit 1000.
% 0.18/0.43 % --res_out_proof true
% 0.18/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_01f835.s
% 0.18/0.43 % --modulo true
% 0.18/0.43
% 0.18/0.43 % ------ Combination Options
% 0.18/0.43
% 0.18/0.43 % --comb_res_mult 1000
% 0.18/0.43 % --comb_inst_mult 300
% 0.18/0.43 % ------
% 0.18/0.43
% 0.18/0.43 % ------ Parsing...% successful
% 0.18/0.43
% 0.18/0.43 % ------ 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.18/0.43
% 0.18/0.43 % ------ Proving...
% 0.18/0.43 % ------ Problem Properties
% 0.18/0.43
% 0.18/0.43 %
% 0.18/0.43 % EPR false
% 0.18/0.43 % Horn false
% 0.18/0.43 % Has equality false
% 0.18/0.43
% 0.18/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 % % ------ Current options:
% 0.18/0.43
% 0.18/0.43 % ------ Input Options
% 0.18/0.43
% 0.18/0.43 % --out_options all
% 0.18/0.43 % --tptp_safe_out true
% 0.18/0.43 % --problem_path ""
% 0.18/0.43 % --include_path ""
% 0.18/0.43 % --clausifier .//eprover
% 0.18/0.43 % --clausifier_options --tstp-format
% 0.18/0.43 % --stdin false
% 0.18/0.43 % --dbg_backtrace false
% 0.18/0.43 % --dbg_dump_prop_clauses false
% 0.18/0.43 % --dbg_dump_prop_clauses_file -
% 0.18/0.43 % --dbg_out_stat false
% 0.18/0.43
% 0.18/0.43 % ------ General Options
% 0.18/0.43
% 0.18/0.43 % --fof false
% 0.18/0.43 % --time_out_real 150.
% 0.18/0.43 % --time_out_prep_mult 0.2
% 0.18/0.43 % --time_out_virtual -1.
% 0.18/0.43 % --schedule none
% 0.18/0.43 % --ground_splitting input
% 0.18/0.43 % --splitting_nvd 16
% 0.18/0.43 % --non_eq_to_eq false
% 0.18/0.43 % --prep_gs_sim true
% 0.18/0.43 % --prep_unflatten false
% 0.18/0.43 % --prep_res_sim true
% 0.18/0.43 % --prep_upred true
% 0.18/0.43 % --res_sim_input true
% 0.18/0.43 % --clause_weak_htbl true
% 0.18/0.43 % --gc_record_bc_elim false
% 0.18/0.43 % --symbol_type_check false
% 0.18/0.43 % --clausify_out false
% 0.18/0.43 % --large_theory_mode false
% 0.18/0.43 % --prep_sem_filter none
% 0.18/0.43 % --prep_sem_filter_out false
% 0.18/0.43 % --preprocessed_out false
% 0.18/0.43 % --sub_typing false
% 0.18/0.43 % --brand_transform false
% 0.18/0.43 % --pure_diseq_elim true
% 0.18/0.43 % --min_unsat_core false
% 0.18/0.43 % --pred_elim true
% 0.18/0.43 % --add_important_lit false
% 0.18/0.43 % --soft_assumptions false
% 0.18/0.43 % --reset_solvers false
% 0.18/0.43 % --bc_imp_inh []
% 0.18/0.43 % --conj_cone_tolerance 1.5
% 0.18/0.43 % --prolific_symb_bound 500
% 0.18/0.43 % --lt_threshold 2000
% 0.18/0.43
% 0.18/0.43 % ------ SAT Options
% 0.18/0.43
% 0.18/0.43 % --sat_mode false
% 0.18/0.43 % --sat_fm_restart_options ""
% 0.18/0.43 % --sat_gr_def false
% 0.18/0.43 % --sat_epr_types true
% 0.18/0.43 % --sat_non_cyclic_types false
% 0.18/0.43 % --sat_finite_models false
% 0.18/0.43 % --sat_fm_lemmas false
% 0.18/0.43 % --sat_fm_prep false
% 0.18/0.43 % --sat_fm_uc_incr true
% 0.18/0.43 % --sat_out_model small
% 0.18/0.43 % --sat_out_clauses false
% 0.18/0.43
% 0.18/0.43 % ------ QBF Options
% 0.18/0.43
% 0.18/0.43 % --qbf_mode false
% 0.18/0.43 % --qbf_elim_univ true
% 0.18/0.43 % --qbf_sk_in true
% 0.18/0.43 % --qbf_pred_elim true
% 0.18/0.43 % --qbf_split 32
% 0.18/0.43
% 0.18/0.43 % ------ BMC1 Options
% 0.18/0.43
% 0.18/0.43 % --bmc1_incremental false
% 0.18/0.43 % --bmc1_axioms reachable_all
% 0.18/0.43 % --bmc1_min_bound 0
% 0.18/0.43 % --bmc1_max_bound -1
% 0.18/0.43 % --bmc1_max_bound_default -1
% 0.18/0.43 % --bmc1_symbol_reachability true
% 0.18/0.43 % --bmc1_property_lemmas false
% 0.18/0.43 % --bmc1_k_induction false
% 0.18/0.43 % --bmc1_non_equiv_states false
% 0.18/0.43 % --bmc1_deadlock false
% 0.18/0.43 % --bmc1_ucm false
% 0.18/0.43 % --bmc1_add_unsat_core none
% 0.18/0.43 % --bmc1_unsat_core_children false
% 0.18/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.43 % --bmc1_out_stat full
% 0.18/0.43 % --bmc1_ground_init false
% 0.18/0.43 % --bmc1_pre_inst_next_state false
% 0.18/0.43 % --bmc1_pre_inst_state false
% 0.18/0.43 % --bmc1_pre_inst_reach_state false
% 0.18/0.43 % --bmc1_out_unsat_core false
% 0.18/0.43 % --bmc1_aig_witness_out false
% 0.18/0.43 % --bmc1_verbose false
% 0.18/0.43 % --bmc1_dump_clauses_tptp false
% 0.18/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.43 % --bmc1_dump_file -
% 0.18/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.43 % --bmc1_ucm_extend_mode 1
% 0.18/0.43 % --bmc1_ucm_init_mode 2
% 0.18/0.43 % --bmc1_ucm_cone_mode none
% 0.18/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.43 % --bmc1_ucm_relax_model 4
% 0.18/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.43 % --bmc1_ucm_layered_model none
% 0.18/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.43
% 0.18/0.43 % ------ AIG Options
% 0.18/0.43
% 0.18/0.43 % --aig_mode false
% 0.18/0.43
% 0.18/0.43 % ------ Instantiation Options
% 0.18/0.43
% 0.18/0.43 % --instantiation_flag true
% 0.18/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.43 % --inst_solver_per_active 750
% 0.18/0.43 % --inst_solver_calls_frac 0.5
% 0.18/0.43 % --inst_passive_queue_type priority_queues
% 0.18/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.43 % --inst_passive_queues_freq [25;2]
% 0.18/0.43 % --inst_dismatching true
% 0.18/0.43 % --inst_eager_unprocessed_to_passive true
% 0.18/0.43 % --inst_prop_sim_given true
% 1.16/1.35 % --inst_prop_sim_new false
% 1.16/1.35 % --inst_orphan_elimination true
% 1.16/1.35 % --inst_learning_loop_flag true
% 1.16/1.35 % --inst_learning_start 3000
% 1.16/1.35 % --inst_learning_factor 2
% 1.16/1.35 % --inst_start_prop_sim_after_learn 3
% 1.16/1.35 % --inst_sel_renew solver
% 1.16/1.35 % --inst_lit_activity_flag true
% 1.16/1.35 % --inst_out_proof true
% 1.16/1.35
% 1.16/1.35 % ------ Resolution Options
% 1.16/1.35
% 1.16/1.35 % --resolution_flag true
% 1.16/1.35 % --res_lit_sel kbo_max
% 1.16/1.35 % --res_to_prop_solver none
% 1.16/1.35 % --res_prop_simpl_new false
% 1.16/1.35 % --res_prop_simpl_given false
% 1.16/1.35 % --res_passive_queue_type priority_queues
% 1.16/1.35 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.16/1.35 % --res_passive_queues_freq [15;5]
% 1.16/1.35 % --res_forward_subs full
% 1.16/1.35 % --res_backward_subs full
% 1.16/1.35 % --res_forward_subs_resolution true
% 1.16/1.35 % --res_backward_subs_resolution true
% 1.16/1.35 % --res_orphan_elimination false
% 1.16/1.35 % --res_time_limit 1000.
% 1.16/1.35 % --res_out_proof true
% 1.16/1.35 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_01f835.s
% 1.16/1.35 % --modulo true
% 1.16/1.35
% 1.16/1.35 % ------ Combination Options
% 1.16/1.35
% 1.16/1.35 % --comb_res_mult 1000
% 1.16/1.35 % --comb_inst_mult 300
% 1.16/1.35 % ------
% 1.16/1.35
% 1.16/1.35
% 1.16/1.35
% 1.16/1.35 % ------ Proving...
% 1.16/1.35 % warning: shown sat in sat incomplete mode
% 1.16/1.35 %
% 1.16/1.35
% 1.16/1.35
% 1.16/1.35 ------ Building Model...Done
% 1.16/1.35
% 1.16/1.35 %------ The model is defined over ground terms (initial term algebra).
% 1.16/1.35 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.16/1.35 %------ where \phi is a formula over the term algebra.
% 1.16/1.35 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.16/1.35 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.16/1.35 %------ See help for --sat_out_model for different model outputs.
% 1.16/1.35 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.16/1.35 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.16/1.35
% 1.16/1.35
% 1.16/1.35
% 1.16/1.35
% 1.16/1.35 %------ Positive definition of ssSkP0
% 1.16/1.35 fof(lit_def,axiom,
% 1.16/1.35 (! [X0,X1,X2,X3] :
% 1.16/1.35 ( ssSkP0(X0,X1,X2,X3) <=>
% 1.16/1.35 $true
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 ).
% 1.16/1.35
% 1.16/1.35 %------ Positive definition of event
% 1.16/1.35 fof(lit_def,axiom,
% 1.16/1.35 (! [X0,X1] :
% 1.16/1.35 ( event(X0,X1) <=>
% 1.16/1.35 $false
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 ).
% 1.16/1.35
% 1.16/1.35 %------ Positive definition of member
% 1.16/1.35 fof(lit_def,axiom,
% 1.16/1.35 (! [X0,X1,X2] :
% 1.16/1.35 ( member(X0,X1,X2) <=>
% 1.16/1.35 $false
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 ).
% 1.16/1.35
% 1.16/1.35 %------ Negative definition of ssSkP1
% 1.16/1.35 fof(lit_def,axiom,
% 1.16/1.35 (! [X0,X1,X2] :
% 1.16/1.35 ( ~(ssSkP1(X0,X1,X2)) <=>
% 1.16/1.35 $false
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 ).
% 1.16/1.35
% 1.16/1.35 %------ Positive definition of table
% 1.16/1.35 fof(lit_def,axiom,
% 1.16/1.35 (! [X0,X1] :
% 1.16/1.35 ( table(X0,X1) <=>
% 1.16/1.35 (
% 1.16/1.35 ? [X2] :
% 1.16/1.35 (
% 1.16/1.35 ( X0=skc63 & X1=skf26(skc63,X2) )
% 1.16/1.35 )
% 1.16/1.35
% 1.16/1.35 |
% 1.16/1.35 ? [X2] :
% 1.16/1.35 (
% 1.16/1.35 ( X1=skf26(X0,X2) )
% 1.16/1.35 )
% 1.16/1.35
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 ).
% 1.16/1.35
% 1.16/1.35 %------ Negative definition of ssSkP2
% 1.16/1.35 fof(lit_def,axiom,
% 1.16/1.35 (! [X0,X1] :
% 1.16/1.35 ( ~(ssSkP2(X0,X1)) <=>
% 1.16/1.35 $false
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 ).
% 1.16/1.35
% 1.16/1.35 %------ Positive definition of group
% 1.16/1.35 fof(lit_def,axiom,
% 1.16/1.35 (! [X0,X1] :
% 1.16/1.35 ( group(X0,X1) <=>
% 1.16/1.35 (
% 1.16/1.35 (
% 1.16/1.35 ( X0=skc4 & X1=skc5 )
% 1.16/1.35 )
% 1.16/1.35
% 1.16/1.35 |
% 1.16/1.35 (
% 1.16/1.35 ( X0=skc63 & X1=skc64 )
% 1.16/1.35 )
% 1.16/1.35
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 ).
% 1.16/1.35
% 1.16/1.35 %------ Positive definition of hamburger
% 1.16/1.35 fof(lit_def,axiom,
% 1.16/1.35 (! [X0,X1] :
% 1.16/1.35 ( hamburger(X0,X1) <=>
% 1.16/1.35 $false
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 ).
% 1.16/1.35
% 1.16/1.35 %------ Positive definition of ssSkP3
% 1.16/1.35 fof(lit_def,axiom,
% 1.16/1.35 (! [X0,X1] :
% 1.16/1.35 ( ssSkP3(X0,X1) <=>
% 1.16/1.35 $true
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 ).
% 1.16/1.35
% 1.16/1.35 %------ Positive definition of three
% 1.16/1.35 fof(lit_def,axiom,
% 1.16/1.35 (! [X0,X1] :
% 1.16/1.35 ( three(X0,X1) <=>
% 1.16/1.35 $false
% 1.16/1.35 )
% 1.16/1.35 )
% 1.16/1.35 ).
% 1.16/1.35
% 1.16/1.35 %------ Negative definition of guy
% 1.16/1.35 fof(lit_def,axiom,
% 1.16/1.35 (! [X0,X1] :
% 1.16/1.36 ( ~(guy(X0,X1)) <=>
% 1.16/1.36 $false
% 1.16/1.36 )
% 1.16/1.36 )
% 1.16/1.36 ).
% 1.16/1.36
% 1.16/1.36 %------ Negative definition of young
% 1.16/1.36 fof(lit_def,axiom,
% 1.16/1.36 (! [X0,X1] :
% 1.16/1.36 ( ~(young(X0,X1)) <=>
% 1.16/1.36 $false
% 1.16/1.36 )
% 1.16/1.36 )
% 1.16/1.36 ).
% 1.16/1.36
% 1.16/1.36 %------ Positive definition of ssSkC0
% 1.16/1.36 fof(lit_def,axiom,
% 1.16/1.36 ( ssSkC0 <=>
% 1.16/1.36 $true
% 1.16/1.36 )
% 1.16/1.36 ).
% 1.16/1.36
% 1.16/1.36 %------ Negative definition of actual_world
% 1.16/1.36 fof(lit_def,axiom,
% 1.16/1.36 (! [X0] :
% 1.16/1.36 ( ~(actual_world(X0)) <=>
% 1.16/1.36 $false
% 1.16/1.36 )
% 1.16/1.36 )
% 1.16/1.36 ).
% 1.16/1.36
% 1.16/1.36
% 1.16/1.36
% 1.16/1.36 % ------ Statistics
% 1.16/1.36
% 1.16/1.36 % ------ General
% 1.16/1.36
% 1.16/1.36 % num_of_input_clauses: 46
% 1.16/1.36 % num_of_input_neg_conjectures: 46
% 1.16/1.36 % num_of_splits: 0
% 1.16/1.36 % num_of_split_atoms: 0
% 1.16/1.36 % num_of_sem_filtered_clauses: 0
% 1.16/1.36 % num_of_subtypes: 0
% 1.16/1.36 % monotx_restored_types: 0
% 1.16/1.36 % sat_num_of_epr_types: 0
% 1.16/1.36 % sat_num_of_non_cyclic_types: 0
% 1.16/1.36 % sat_guarded_non_collapsed_types: 0
% 1.16/1.36 % is_epr: 0
% 1.16/1.36 % is_horn: 0
% 1.16/1.36 % has_eq: 0
% 1.16/1.36 % num_pure_diseq_elim: 0
% 1.16/1.36 % simp_replaced_by: 0
% 1.16/1.36 % res_preprocessed: 92
% 1.16/1.36 % prep_upred: 0
% 1.16/1.36 % prep_unflattend: 0
% 1.16/1.36 % pred_elim_cands: 0
% 1.16/1.36 % pred_elim: 0
% 1.16/1.36 % pred_elim_cl: 0
% 1.16/1.36 % pred_elim_cycles: 0
% 1.16/1.36 % forced_gc_time: 0
% 1.16/1.36 % gc_basic_clause_elim: 0
% 1.16/1.36 % parsing_time: 0.003
% 1.16/1.36 % sem_filter_time: 0.
% 1.16/1.36 % pred_elim_time: 0.
% 1.16/1.36 % out_proof_time: 0.
% 1.16/1.36 % monotx_time: 0.
% 1.16/1.36 % subtype_inf_time: 0.
% 1.16/1.36 % unif_index_cands_time: 0.002
% 1.16/1.36 % unif_index_add_time: 0.002
% 1.16/1.36 % total_time: 0.958
% 1.16/1.36 % num_of_symbols: 62
% 1.16/1.36 % num_of_terms: 6512
% 1.16/1.36
% 1.16/1.36 % ------ Propositional Solver
% 1.16/1.36
% 1.16/1.36 % prop_solver_calls: 8
% 1.16/1.36 % prop_fast_solver_calls: 471
% 1.16/1.36 % prop_num_of_clauses: 411
% 1.16/1.36 % prop_preprocess_simplified: 1190
% 1.16/1.36 % prop_fo_subsumed: 0
% 1.16/1.36 % prop_solver_time: 0.
% 1.16/1.36 % prop_fast_solver_time: 0.
% 1.16/1.36 % prop_unsat_core_time: 0.
% 1.16/1.36
% 1.16/1.36 % ------ QBF
% 1.16/1.36
% 1.16/1.36 % qbf_q_res: 0
% 1.16/1.36 % qbf_num_tautologies: 0
% 1.16/1.36 % qbf_prep_cycles: 0
% 1.16/1.36
% 1.16/1.36 % ------ BMC1
% 1.16/1.36
% 1.16/1.36 % bmc1_current_bound: -1
% 1.16/1.36 % bmc1_last_solved_bound: -1
% 1.16/1.36 % bmc1_unsat_core_size: -1
% 1.16/1.36 % bmc1_unsat_core_parents_size: -1
% 1.16/1.36 % bmc1_merge_next_fun: 0
% 1.16/1.36 % bmc1_unsat_core_clauses_time: 0.
% 1.16/1.36
% 1.16/1.36 % ------ Instantiation
% 1.16/1.36
% 1.16/1.36 % inst_num_of_clauses: 223
% 1.16/1.36 % inst_num_in_passive: 0
% 1.16/1.36 % inst_num_in_active: 223
% 1.16/1.36 % inst_num_in_unprocessed: 0
% 1.16/1.36 % inst_num_of_loops: 267
% 1.16/1.36 % inst_num_of_learning_restarts: 0
% 1.16/1.36 % inst_num_moves_active_passive: 37
% 1.16/1.36 % inst_lit_activity: 42
% 1.16/1.36 % inst_lit_activity_moves: 0
% 1.16/1.36 % inst_num_tautologies: 0
% 1.16/1.36 % inst_num_prop_implied: 0
% 1.16/1.36 % inst_num_existing_simplified: 0
% 1.16/1.36 % inst_num_eq_res_simplified: 0
% 1.16/1.36 % inst_num_child_elim: 0
% 1.16/1.36 % inst_num_of_dismatching_blockings: 34
% 1.16/1.36 % inst_num_of_non_proper_insts: 183
% 1.16/1.36 % inst_num_of_duplicates: 20
% 1.16/1.36 % inst_inst_num_from_inst_to_res: 0
% 1.16/1.36 % inst_dismatching_checking_time: 0.
% 1.16/1.36
% 1.16/1.36 % ------ Resolution
% 1.16/1.36
% 1.16/1.36 % res_num_of_clauses: 12587
% 1.16/1.36 % res_num_in_passive: 11883
% 1.16/1.36 % res_num_in_active: 706
% 1.16/1.36 % res_num_of_loops: 1000
% 1.16/1.36 % res_forward_subset_subsumed: 3052
% 1.16/1.36 % res_backward_subset_subsumed: 4
% 1.16/1.36 % res_forward_subsumed: 260
% 1.16/1.36 % res_backward_subsumed: 30
% 1.16/1.36 % res_forward_subsumption_resolution: 49
% 1.16/1.36 % res_backward_subsumption_resolution: 2
% 1.16/1.36 % res_clause_to_clause_subsumption: 753
% 1.16/1.36 % res_orphan_elimination: 0
% 1.16/1.36 % res_tautology_del: 2849
% 1.16/1.36 % res_num_eq_res_simplified: 0
% 1.16/1.36 % res_num_sel_changes: 0
% 1.16/1.36 % res_moves_from_active_to_pass: 0
% 1.16/1.36
% 1.16/1.36 % Status Unknown
% 1.20/1.40 % Orienting using strategy ClausalAll
% 1.20/1.40 % Orientation found
% 1.20/1.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_01f835.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_033728.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_c6a347 | grep -v "SZS"
% 1.20/1.41
% 1.20/1.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.20/1.41
% 1.20/1.41 %
% 1.20/1.41 % ------ iProver source info
% 1.20/1.41
% 1.20/1.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.20/1.41 % git: non_committed_changes: true
% 1.20/1.41 % git: last_make_outside_of_git: true
% 1.20/1.41
% 1.20/1.41 %
% 1.20/1.41 % ------ Input Options
% 1.20/1.41
% 1.20/1.41 % --out_options all
% 1.20/1.41 % --tptp_safe_out true
% 1.20/1.41 % --problem_path ""
% 1.20/1.41 % --include_path ""
% 1.20/1.41 % --clausifier .//eprover
% 1.20/1.41 % --clausifier_options --tstp-format
% 1.20/1.41 % --stdin false
% 1.20/1.41 % --dbg_backtrace false
% 1.20/1.41 % --dbg_dump_prop_clauses false
% 1.20/1.41 % --dbg_dump_prop_clauses_file -
% 1.20/1.41 % --dbg_out_stat false
% 1.20/1.41
% 1.20/1.41 % ------ General Options
% 1.20/1.41
% 1.20/1.41 % --fof false
% 1.20/1.41 % --time_out_real 150.
% 1.20/1.41 % --time_out_prep_mult 0.2
% 1.20/1.41 % --time_out_virtual -1.
% 1.20/1.41 % --schedule none
% 1.20/1.41 % --ground_splitting input
% 1.20/1.41 % --splitting_nvd 16
% 1.20/1.41 % --non_eq_to_eq false
% 1.20/1.41 % --prep_gs_sim true
% 1.20/1.41 % --prep_unflatten false
% 1.20/1.41 % --prep_res_sim true
% 1.20/1.41 % --prep_upred true
% 1.20/1.41 % --res_sim_input true
% 1.20/1.41 % --clause_weak_htbl true
% 1.20/1.41 % --gc_record_bc_elim false
% 1.20/1.41 % --symbol_type_check false
% 1.20/1.41 % --clausify_out false
% 1.20/1.41 % --large_theory_mode false
% 1.20/1.41 % --prep_sem_filter none
% 1.20/1.41 % --prep_sem_filter_out false
% 1.20/1.41 % --preprocessed_out false
% 1.20/1.41 % --sub_typing false
% 1.20/1.41 % --brand_transform false
% 1.20/1.41 % --pure_diseq_elim true
% 1.20/1.41 % --min_unsat_core false
% 1.20/1.41 % --pred_elim true
% 1.20/1.41 % --add_important_lit false
% 1.20/1.41 % --soft_assumptions false
% 1.20/1.41 % --reset_solvers false
% 1.20/1.41 % --bc_imp_inh []
% 1.20/1.41 % --conj_cone_tolerance 1.5
% 1.20/1.41 % --prolific_symb_bound 500
% 1.20/1.41 % --lt_threshold 2000
% 1.20/1.41
% 1.20/1.41 % ------ SAT Options
% 1.20/1.41
% 1.20/1.41 % --sat_mode false
% 1.20/1.41 % --sat_fm_restart_options ""
% 1.20/1.41 % --sat_gr_def false
% 1.20/1.41 % --sat_epr_types true
% 1.20/1.41 % --sat_non_cyclic_types false
% 1.20/1.41 % --sat_finite_models false
% 1.20/1.41 % --sat_fm_lemmas false
% 1.20/1.41 % --sat_fm_prep false
% 1.20/1.41 % --sat_fm_uc_incr true
% 1.20/1.41 % --sat_out_model small
% 1.20/1.41 % --sat_out_clauses false
% 1.20/1.41
% 1.20/1.41 % ------ QBF Options
% 1.20/1.41
% 1.20/1.41 % --qbf_mode false
% 1.20/1.41 % --qbf_elim_univ true
% 1.20/1.41 % --qbf_sk_in true
% 1.20/1.41 % --qbf_pred_elim true
% 1.20/1.41 % --qbf_split 32
% 1.20/1.41
% 1.20/1.41 % ------ BMC1 Options
% 1.20/1.41
% 1.20/1.41 % --bmc1_incremental false
% 1.20/1.41 % --bmc1_axioms reachable_all
% 1.20/1.41 % --bmc1_min_bound 0
% 1.20/1.41 % --bmc1_max_bound -1
% 1.20/1.41 % --bmc1_max_bound_default -1
% 1.20/1.41 % --bmc1_symbol_reachability true
% 1.20/1.41 % --bmc1_property_lemmas false
% 1.20/1.41 % --bmc1_k_induction false
% 1.20/1.41 % --bmc1_non_equiv_states false
% 1.20/1.41 % --bmc1_deadlock false
% 1.20/1.41 % --bmc1_ucm false
% 1.20/1.41 % --bmc1_add_unsat_core none
% 1.20/1.41 % --bmc1_unsat_core_children false
% 1.20/1.41 % --bmc1_unsat_core_extrapolate_axioms false
% 1.20/1.41 % --bmc1_out_stat full
% 1.20/1.41 % --bmc1_ground_init false
% 1.20/1.41 % --bmc1_pre_inst_next_state false
% 1.20/1.41 % --bmc1_pre_inst_state false
% 1.20/1.41 % --bmc1_pre_inst_reach_state false
% 1.20/1.41 % --bmc1_out_unsat_core false
% 1.20/1.41 % --bmc1_aig_witness_out false
% 1.20/1.41 % --bmc1_verbose false
% 1.20/1.41 % --bmc1_dump_clauses_tptp false
% 1.20/1.42 % --bmc1_dump_unsat_core_tptp false
% 1.20/1.42 % --bmc1_dump_file -
% 1.20/1.42 % --bmc1_ucm_expand_uc_limit 128
% 1.20/1.42 % --bmc1_ucm_n_expand_iterations 6
% 1.20/1.42 % --bmc1_ucm_extend_mode 1
% 1.20/1.42 % --bmc1_ucm_init_mode 2
% 1.20/1.42 % --bmc1_ucm_cone_mode none
% 1.20/1.42 % --bmc1_ucm_reduced_relation_type 0
% 1.20/1.42 % --bmc1_ucm_relax_model 4
% 1.20/1.42 % --bmc1_ucm_full_tr_after_sat true
% 1.20/1.42 % --bmc1_ucm_expand_neg_assumptions false
% 1.20/1.42 % --bmc1_ucm_layered_model none
% 1.20/1.42 % --bmc1_ucm_max_lemma_size 10
% 1.20/1.42
% 1.20/1.42 % ------ AIG Options
% 1.20/1.42
% 1.20/1.42 % --aig_mode false
% 1.20/1.42
% 1.20/1.42 % ------ Instantiation Options
% 1.20/1.42
% 1.20/1.42 % --instantiation_flag true
% 1.20/1.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.20/1.42 % --inst_solver_per_active 750
% 1.20/1.42 % --inst_solver_calls_frac 0.5
% 1.20/1.42 % --inst_passive_queue_type priority_queues
% 1.20/1.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.20/1.42 % --inst_passive_queues_freq [25;2]
% 1.20/1.42 % --inst_dismatching true
% 1.20/1.42 % --inst_eager_unprocessed_to_passive true
% 1.20/1.42 % --inst_prop_sim_given true
% 1.20/1.42 % --inst_prop_sim_new false
% 1.20/1.42 % --inst_orphan_elimination true
% 1.20/1.42 % --inst_learning_loop_flag true
% 1.20/1.42 % --inst_learning_start 3000
% 1.20/1.42 % --inst_learning_factor 2
% 1.20/1.42 % --inst_start_prop_sim_after_learn 3
% 1.20/1.42 % --inst_sel_renew solver
% 1.20/1.42 % --inst_lit_activity_flag true
% 1.20/1.42 % --inst_out_proof true
% 1.20/1.42
% 1.20/1.42 % ------ Resolution Options
% 1.20/1.42
% 1.20/1.42 % --resolution_flag true
% 1.20/1.42 % --res_lit_sel kbo_max
% 1.20/1.42 % --res_to_prop_solver none
% 1.20/1.42 % --res_prop_simpl_new false
% 1.20/1.42 % --res_prop_simpl_given false
% 1.20/1.42 % --res_passive_queue_type priority_queues
% 1.20/1.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.20/1.42 % --res_passive_queues_freq [15;5]
% 1.20/1.42 % --res_forward_subs full
% 1.20/1.42 % --res_backward_subs full
% 1.20/1.42 % --res_forward_subs_resolution true
% 1.20/1.42 % --res_backward_subs_resolution true
% 1.20/1.42 % --res_orphan_elimination false
% 1.20/1.42 % --res_time_limit 1000.
% 1.20/1.42 % --res_out_proof true
% 1.20/1.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_01f835.s
% 1.20/1.42 % --modulo true
% 1.20/1.42
% 1.20/1.42 % ------ Combination Options
% 1.20/1.42
% 1.20/1.42 % --comb_res_mult 1000
% 1.20/1.42 % --comb_inst_mult 300
% 1.20/1.42 % ------
% 1.20/1.42
% 1.20/1.42 % ------ Parsing...% successful
% 1.20/1.42
% 1.20/1.42 % ------ 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.20/1.42
% 1.20/1.42 % ------ Proving...
% 1.20/1.42 % ------ Problem Properties
% 1.20/1.42
% 1.20/1.42 %
% 1.20/1.42 % EPR false
% 1.20/1.42 % Horn false
% 1.20/1.42 % Has equality false
% 1.20/1.42
% 1.20/1.42 % % ------ Input Options Time Limit: Unbounded
% 1.20/1.42
% 1.20/1.42
% 1.20/1.42 % % ------ Current options:
% 1.20/1.42
% 1.20/1.42 % ------ Input Options
% 1.20/1.42
% 1.20/1.42 % --out_options all
% 1.20/1.42 % --tptp_safe_out true
% 1.20/1.42 % --problem_path ""
% 1.20/1.42 % --include_path ""
% 1.20/1.42 % --clausifier .//eprover
% 1.20/1.42 % --clausifier_options --tstp-format
% 1.20/1.42 % --stdin false
% 1.20/1.42 % --dbg_backtrace false
% 1.20/1.42 % --dbg_dump_prop_clauses false
% 1.20/1.42 % --dbg_dump_prop_clauses_file -
% 1.20/1.42 % --dbg_out_stat false
% 1.20/1.42
% 1.20/1.42 % ------ General Options
% 1.20/1.42
% 1.20/1.42 % --fof false
% 1.20/1.42 % --time_out_real 150.
% 1.20/1.42 % --time_out_prep_mult 0.2
% 1.20/1.42 % --time_out_virtual -1.
% 1.20/1.42 % --schedule none
% 1.20/1.42 % --ground_splitting input
% 1.20/1.42 % --splitting_nvd 16
% 1.20/1.42 % --non_eq_to_eq false
% 1.20/1.42 % --prep_gs_sim true
% 1.20/1.42 % --prep_unflatten false
% 1.20/1.42 % --prep_res_sim true
% 1.20/1.42 % --prep_upred true
% 1.20/1.42 % --res_sim_input true
% 1.20/1.42 % --clause_weak_htbl true
% 1.20/1.42 % --gc_record_bc_elim false
% 1.20/1.42 % --symbol_type_check false
% 1.20/1.42 % --clausify_out false
% 1.20/1.42 % --large_theory_mode false
% 1.20/1.42 % --prep_sem_filter none
% 1.20/1.42 % --prep_sem_filter_out false
% 1.20/1.42 % --preprocessed_out false
% 1.20/1.42 % --sub_typing false
% 1.20/1.42 % --brand_transform false
% 1.20/1.42 % --pure_diseq_elim true
% 1.20/1.42 % --min_unsat_core false
% 1.20/1.42 % --pred_elim true
% 1.20/1.42 % --add_important_lit false
% 1.20/1.42 % --soft_assumptions false
% 1.20/1.42 % --reset_solvers false
% 1.20/1.42 % --bc_imp_inh []
% 1.20/1.42 % --conj_cone_tolerance 1.5
% 1.20/1.42 % --prolific_symb_bound 500
% 1.20/1.42 % --lt_threshold 2000
% 1.20/1.42
% 1.20/1.42 % ------ SAT Options
% 1.20/1.42
% 1.20/1.42 % --sat_mode false
% 1.20/1.42 % --sat_fm_restart_options ""
% 1.20/1.42 % --sat_gr_def false
% 1.20/1.42 % --sat_epr_types true
% 1.20/1.42 % --sat_non_cyclic_types false
% 1.20/1.42 % --sat_finite_models false
% 1.20/1.42 % --sat_fm_lemmas false
% 1.20/1.42 % --sat_fm_prep false
% 1.20/1.42 % --sat_fm_uc_incr true
% 1.20/1.42 % --sat_out_model small
% 1.20/1.42 % --sat_out_clauses false
% 1.20/1.42
% 1.20/1.42 % ------ QBF Options
% 1.20/1.42
% 1.20/1.42 % --qbf_mode false
% 1.20/1.42 % --qbf_elim_univ true
% 1.20/1.42 % --qbf_sk_in true
% 1.20/1.42 % --qbf_pred_elim true
% 1.20/1.42 % --qbf_split 32
% 1.20/1.42
% 1.20/1.42 % ------ BMC1 Options
% 1.20/1.42
% 1.20/1.42 % --bmc1_incremental false
% 1.20/1.42 % --bmc1_axioms reachable_all
% 1.20/1.42 % --bmc1_min_bound 0
% 1.20/1.42 % --bmc1_max_bound -1
% 1.20/1.42 % --bmc1_max_bound_default -1
% 1.20/1.42 % --bmc1_symbol_reachability true
% 1.20/1.42 % --bmc1_property_lemmas false
% 1.20/1.42 % --bmc1_k_induction false
% 1.20/1.42 % --bmc1_non_equiv_states false
% 1.20/1.42 % --bmc1_deadlock false
% 1.20/1.42 % --bmc1_ucm false
% 1.20/1.42 % --bmc1_add_unsat_core none
% 1.20/1.42 % --bmc1_unsat_core_children false
% 1.20/1.42 % --bmc1_unsat_core_extrapolate_axioms false
% 1.20/1.42 % --bmc1_out_stat full
% 1.20/1.42 % --bmc1_ground_init false
% 1.20/1.42 % --bmc1_pre_inst_next_state false
% 1.20/1.42 % --bmc1_pre_inst_state false
% 1.20/1.42 % --bmc1_pre_inst_reach_state false
% 1.20/1.42 % --bmc1_out_unsat_core false
% 1.20/1.42 % --bmc1_aig_witness_out false
% 1.20/1.42 % --bmc1_verbose false
% 1.20/1.42 % --bmc1_dump_clauses_tptp false
% 1.20/1.42 % --bmc1_dump_unsat_core_tptp false
% 1.20/1.42 % --bmc1_dump_file -
% 1.20/1.42 % --bmc1_ucm_expand_uc_limit 128
% 1.20/1.42 % --bmc1_ucm_n_expand_iterations 6
% 1.20/1.42 % --bmc1_ucm_extend_mode 1
% 1.20/1.42 % --bmc1_ucm_init_mode 2
% 1.20/1.42 % --bmc1_ucm_cone_mode none
% 1.20/1.42 % --bmc1_ucm_reduced_relation_type 0
% 1.20/1.42 % --bmc1_ucm_relax_model 4
% 1.20/1.42 % --bmc1_ucm_full_tr_after_sat true
% 1.20/1.42 % --bmc1_ucm_expand_neg_assumptions false
% 1.20/1.42 % --bmc1_ucm_layered_model none
% 1.20/1.42 % --bmc1_ucm_max_lemma_size 10
% 1.20/1.42
% 1.20/1.42 % ------ AIG Options
% 1.20/1.42
% 1.20/1.42 % --aig_mode false
% 1.20/1.42
% 1.20/1.42 % ------ Instantiation Options
% 1.20/1.42
% 1.20/1.42 % --instantiation_flag true
% 1.20/1.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.20/1.42 % --inst_solver_per_active 750
% 1.20/1.42 % --inst_solver_calls_frac 0.5
% 1.20/1.42 % --inst_passive_queue_type priority_queues
% 1.20/1.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.20/1.42 % --inst_passive_queues_freq [25;2]
% 1.20/1.42 % --inst_dismatching true
% 1.20/1.42 % --inst_eager_unprocessed_to_passive true
% 1.20/1.42 % --inst_prop_sim_given true
% 1.99/2.19 % --inst_prop_sim_new false
% 1.99/2.19 % --inst_orphan_elimination true
% 1.99/2.19 % --inst_learning_loop_flag true
% 1.99/2.19 % --inst_learning_start 3000
% 1.99/2.19 % --inst_learning_factor 2
% 1.99/2.19 % --inst_start_prop_sim_after_learn 3
% 1.99/2.19 % --inst_sel_renew solver
% 1.99/2.19 % --inst_lit_activity_flag true
% 1.99/2.19 % --inst_out_proof true
% 1.99/2.19
% 1.99/2.19 % ------ Resolution Options
% 1.99/2.19
% 1.99/2.19 % --resolution_flag true
% 1.99/2.19 % --res_lit_sel kbo_max
% 1.99/2.19 % --res_to_prop_solver none
% 1.99/2.19 % --res_prop_simpl_new false
% 1.99/2.19 % --res_prop_simpl_given false
% 1.99/2.19 % --res_passive_queue_type priority_queues
% 1.99/2.19 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.99/2.19 % --res_passive_queues_freq [15;5]
% 1.99/2.19 % --res_forward_subs full
% 1.99/2.19 % --res_backward_subs full
% 1.99/2.19 % --res_forward_subs_resolution true
% 1.99/2.19 % --res_backward_subs_resolution true
% 1.99/2.19 % --res_orphan_elimination false
% 1.99/2.19 % --res_time_limit 1000.
% 1.99/2.19 % --res_out_proof true
% 1.99/2.19 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_01f835.s
% 1.99/2.19 % --modulo true
% 1.99/2.19
% 1.99/2.19 % ------ Combination Options
% 1.99/2.19
% 1.99/2.19 % --comb_res_mult 1000
% 1.99/2.19 % --comb_inst_mult 300
% 1.99/2.19 % ------
% 1.99/2.19
% 1.99/2.19
% 1.99/2.19
% 1.99/2.19 % ------ Proving...
% 1.99/2.19 % warning: shown sat in sat incomplete mode
% 1.99/2.19 %
% 1.99/2.19
% 1.99/2.19
% 1.99/2.19 ------ Building Model...Done
% 1.99/2.19
% 1.99/2.19 %------ The model is defined over ground terms (initial term algebra).
% 1.99/2.19 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.99/2.19 %------ where \phi is a formula over the term algebra.
% 1.99/2.19 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.99/2.19 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.99/2.19 %------ See help for --sat_out_model for different model outputs.
% 1.99/2.19 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.99/2.19 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.99/2.19
% 1.99/2.19
% 1.99/2.19
% 1.99/2.19
% 1.99/2.19 %------ Positive definition of ssSkP0
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1,X2,X3] :
% 1.99/2.19 ( ssSkP0(X0,X1,X2,X3) <=>
% 1.99/2.19 $true
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Positive definition of event
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1] :
% 1.99/2.19 ( event(X0,X1) <=>
% 1.99/2.19 $false
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Positive definition of member
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1,X2] :
% 1.99/2.19 ( member(X0,X1,X2) <=>
% 1.99/2.19 $false
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Negative definition of ssSkP1
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1,X2] :
% 1.99/2.19 ( ~(ssSkP1(X0,X1,X2)) <=>
% 1.99/2.19 $false
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Positive definition of table
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1] :
% 1.99/2.19 ( table(X0,X1) <=>
% 1.99/2.19 (
% 1.99/2.19 ? [X2] :
% 1.99/2.19 (
% 1.99/2.19 ( X0=skc63 & X1=skf26(skc63,X2) )
% 1.99/2.19 )
% 1.99/2.19
% 1.99/2.19 |
% 1.99/2.19 ? [X2] :
% 1.99/2.19 (
% 1.99/2.19 ( X1=skf26(X0,X2) )
% 1.99/2.19 )
% 1.99/2.19
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Negative definition of ssSkP2
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1] :
% 1.99/2.19 ( ~(ssSkP2(X0,X1)) <=>
% 1.99/2.19 $false
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Positive definition of group
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1] :
% 1.99/2.19 ( group(X0,X1) <=>
% 1.99/2.19 (
% 1.99/2.19 (
% 1.99/2.19 ( X0=skc4 & X1=skc5 )
% 1.99/2.19 )
% 1.99/2.19
% 1.99/2.19 |
% 1.99/2.19 (
% 1.99/2.19 ( X0=skc63 & X1=skc64 )
% 1.99/2.19 )
% 1.99/2.19
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Positive definition of hamburger
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1] :
% 1.99/2.19 ( hamburger(X0,X1) <=>
% 1.99/2.19 $false
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Positive definition of ssSkP3
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1] :
% 1.99/2.19 ( ssSkP3(X0,X1) <=>
% 1.99/2.19 $true
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Positive definition of three
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1] :
% 1.99/2.19 ( three(X0,X1) <=>
% 1.99/2.19 $false
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Negative definition of guy
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1] :
% 1.99/2.19 ( ~(guy(X0,X1)) <=>
% 1.99/2.19 $false
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Negative definition of young
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0,X1] :
% 1.99/2.19 ( ~(young(X0,X1)) <=>
% 1.99/2.19 $false
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Positive definition of ssSkC0
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 ( ssSkC0 <=>
% 1.99/2.19 $true
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19 %------ Negative definition of actual_world
% 1.99/2.19 fof(lit_def,axiom,
% 1.99/2.19 (! [X0] :
% 1.99/2.19 ( ~(actual_world(X0)) <=>
% 1.99/2.19 $false
% 1.99/2.19 )
% 1.99/2.19 )
% 1.99/2.19 ).
% 1.99/2.19
% 1.99/2.19
% 1.99/2.19
% 1.99/2.19 % ------ Statistics
% 1.99/2.19
% 1.99/2.19 % ------ General
% 1.99/2.19
% 1.99/2.19 % num_of_input_clauses: 46
% 1.99/2.19 % num_of_input_neg_conjectures: 46
% 1.99/2.19 % num_of_splits: 0
% 1.99/2.19 % num_of_split_atoms: 0
% 1.99/2.19 % num_of_sem_filtered_clauses: 0
% 1.99/2.19 % num_of_subtypes: 0
% 1.99/2.19 % monotx_restored_types: 0
% 1.99/2.19 % sat_num_of_epr_types: 0
% 1.99/2.19 % sat_num_of_non_cyclic_types: 0
% 1.99/2.19 % sat_guarded_non_collapsed_types: 0
% 1.99/2.19 % is_epr: 0
% 1.99/2.19 % is_horn: 0
% 1.99/2.19 % has_eq: 0
% 1.99/2.19 % num_pure_diseq_elim: 0
% 1.99/2.19 % simp_replaced_by: 0
% 1.99/2.19 % res_preprocessed: 92
% 1.99/2.19 % prep_upred: 0
% 1.99/2.19 % prep_unflattend: 0
% 1.99/2.19 % pred_elim_cands: 0
% 1.99/2.19 % pred_elim: 0
% 1.99/2.19 % pred_elim_cl: 0
% 1.99/2.19 % pred_elim_cycles: 0
% 1.99/2.19 % forced_gc_time: 0
% 1.99/2.19 % gc_basic_clause_elim: 0
% 1.99/2.19 % parsing_time: 0.001
% 1.99/2.19 % sem_filter_time: 0.
% 1.99/2.19 % pred_elim_time: 0.
% 1.99/2.19 % out_proof_time: 0.
% 1.99/2.19 % monotx_time: 0.
% 1.99/2.19 % subtype_inf_time: 0.
% 1.99/2.19 % unif_index_cands_time: 0.002
% 1.99/2.19 % unif_index_add_time: 0.001
% 1.99/2.19 % total_time: 0.788
% 1.99/2.19 % num_of_symbols: 62
% 1.99/2.19 % num_of_terms: 6512
% 1.99/2.19
% 1.99/2.19 % ------ Propositional Solver
% 1.99/2.19
% 1.99/2.19 % prop_solver_calls: 8
% 1.99/2.19 % prop_fast_solver_calls: 471
% 1.99/2.19 % prop_num_of_clauses: 411
% 1.99/2.19 % prop_preprocess_simplified: 1190
% 1.99/2.19 % prop_fo_subsumed: 0
% 1.99/2.19 % prop_solver_time: 0.
% 1.99/2.19 % prop_fast_solver_time: 0.
% 1.99/2.19 % prop_unsat_core_time: 0.
% 1.99/2.19
% 1.99/2.19 % ------ QBF
% 1.99/2.19
% 1.99/2.19 % qbf_q_res: 0
% 1.99/2.19 % qbf_num_tautologies: 0
% 1.99/2.19 % qbf_prep_cycles: 0
% 1.99/2.19
% 1.99/2.19 % ------ BMC1
% 1.99/2.19
% 1.99/2.19 % bmc1_current_bound: -1
% 1.99/2.19 % bmc1_last_solved_bound: -1
% 1.99/2.19 % bmc1_unsat_core_size: -1
% 1.99/2.19 % bmc1_unsat_core_parents_size: -1
% 1.99/2.19 % bmc1_merge_next_fun: 0
% 1.99/2.19 % bmc1_unsat_core_clauses_time: 0.
% 1.99/2.19
% 1.99/2.19 % ------ Instantiation
% 1.99/2.19
% 1.99/2.19 % inst_num_of_clauses: 223
% 1.99/2.19 % inst_num_in_passive: 0
% 1.99/2.19 % inst_num_in_active: 223
% 1.99/2.19 % inst_num_in_unprocessed: 0
% 1.99/2.19 % inst_num_of_loops: 267
% 1.99/2.19 % inst_num_of_learning_restarts: 0
% 1.99/2.19 % inst_num_moves_active_passive: 37
% 1.99/2.19 % inst_lit_activity: 42
% 1.99/2.19 % inst_lit_activity_moves: 0
% 1.99/2.19 % inst_num_tautologies: 0
% 1.99/2.19 % inst_num_prop_implied: 0
% 1.99/2.19 % inst_num_existing_simplified: 0
% 1.99/2.19 % inst_num_eq_res_simplified: 0
% 1.99/2.19 % inst_num_child_elim: 0
% 1.99/2.19 % inst_num_of_dismatching_blockings: 34
% 1.99/2.19 % inst_num_of_non_proper_insts: 183
% 1.99/2.19 % inst_num_of_duplicates: 20
% 1.99/2.19 % inst_inst_num_from_inst_to_res: 0
% 1.99/2.19 % inst_dismatching_checking_time: 0.
% 1.99/2.19
% 1.99/2.19 % ------ Resolution
% 1.99/2.19
% 1.99/2.19 % res_num_of_clauses: 12587
% 1.99/2.19 % res_num_in_passive: 11883
% 1.99/2.19 % res_num_in_active: 706
% 1.99/2.19 % res_num_of_loops: 1000
% 1.99/2.19 % res_forward_subset_subsumed: 3052
% 1.99/2.19 % res_backward_subset_subsumed: 4
% 1.99/2.19 % res_forward_subsumed: 260
% 1.99/2.19 % res_backward_subsumed: 30
% 1.99/2.19 % res_forward_subsumption_resolution: 49
% 1.99/2.19 % res_backward_subsumption_resolution: 2
% 1.99/2.19 % res_clause_to_clause_subsumption: 753
% 1.99/2.19 % res_orphan_elimination: 0
% 1.99/2.19 % res_tautology_del: 2849
% 1.99/2.19 % res_num_eq_res_simplified: 0
% 1.99/2.19 % res_num_sel_changes: 0
% 1.99/2.19 % res_moves_from_active_to_pass: 0
% 1.99/2.19
% 1.99/2.19 % Status Unknown
% 1.99/2.19 % Last status :
% 1.99/2.19 % SZS status Unknown
%------------------------------------------------------------------------------