TSTP Solution File: SYN433+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN433+1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n028.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 : Thu Jul 21 07:27:50 EDT 2022
% Result : Unknown 1.64s 1.90s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN433+1 : TPTP v8.1.0. Released v2.1.0.
% 0.11/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n028.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 : Mon Jul 11 19:31:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.44 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.44 % FOF problem with conjecture
% 0.20/0.44 % 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_d1c8b2.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e8f1dd.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_71006b | grep -v "SZS"
% 0.20/0.46
% 0.20/0.46 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.46
% 0.20/0.46 %
% 0.20/0.46 % ------ iProver source info
% 0.20/0.46
% 0.20/0.46 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.46 % git: non_committed_changes: true
% 0.20/0.46 % git: last_make_outside_of_git: true
% 0.20/0.46
% 0.20/0.46 %
% 0.20/0.46 % ------ Input Options
% 0.20/0.46
% 0.20/0.46 % --out_options all
% 0.20/0.46 % --tptp_safe_out true
% 0.20/0.46 % --problem_path ""
% 0.20/0.46 % --include_path ""
% 0.20/0.46 % --clausifier .//eprover
% 0.20/0.46 % --clausifier_options --tstp-format
% 0.20/0.46 % --stdin false
% 0.20/0.46 % --dbg_backtrace false
% 0.20/0.46 % --dbg_dump_prop_clauses false
% 0.20/0.46 % --dbg_dump_prop_clauses_file -
% 0.20/0.46 % --dbg_out_stat false
% 0.20/0.46
% 0.20/0.46 % ------ General Options
% 0.20/0.46
% 0.20/0.46 % --fof false
% 0.20/0.46 % --time_out_real 150.
% 0.20/0.46 % --time_out_prep_mult 0.2
% 0.20/0.46 % --time_out_virtual -1.
% 0.20/0.46 % --schedule none
% 0.20/0.46 % --ground_splitting input
% 0.20/0.46 % --splitting_nvd 16
% 0.20/0.46 % --non_eq_to_eq false
% 0.20/0.46 % --prep_gs_sim true
% 0.20/0.46 % --prep_unflatten false
% 0.20/0.46 % --prep_res_sim true
% 0.20/0.46 % --prep_upred true
% 0.20/0.46 % --res_sim_input true
% 0.20/0.46 % --clause_weak_htbl true
% 0.20/0.46 % --gc_record_bc_elim false
% 0.20/0.46 % --symbol_type_check false
% 0.20/0.46 % --clausify_out false
% 0.20/0.46 % --large_theory_mode false
% 0.20/0.46 % --prep_sem_filter none
% 0.20/0.46 % --prep_sem_filter_out false
% 0.20/0.46 % --preprocessed_out false
% 0.20/0.46 % --sub_typing false
% 0.20/0.46 % --brand_transform false
% 0.20/0.46 % --pure_diseq_elim true
% 0.20/0.46 % --min_unsat_core false
% 0.20/0.46 % --pred_elim true
% 0.20/0.46 % --add_important_lit false
% 0.20/0.46 % --soft_assumptions false
% 0.20/0.46 % --reset_solvers false
% 0.20/0.46 % --bc_imp_inh []
% 0.20/0.46 % --conj_cone_tolerance 1.5
% 0.20/0.46 % --prolific_symb_bound 500
% 0.20/0.46 % --lt_threshold 2000
% 0.20/0.46
% 0.20/0.46 % ------ SAT Options
% 0.20/0.46
% 0.20/0.46 % --sat_mode false
% 0.20/0.46 % --sat_fm_restart_options ""
% 0.20/0.46 % --sat_gr_def false
% 0.20/0.46 % --sat_epr_types true
% 0.20/0.46 % --sat_non_cyclic_types false
% 0.20/0.46 % --sat_finite_models false
% 0.20/0.46 % --sat_fm_lemmas false
% 0.20/0.46 % --sat_fm_prep false
% 0.20/0.46 % --sat_fm_uc_incr true
% 0.20/0.46 % --sat_out_model small
% 0.20/0.46 % --sat_out_clauses false
% 0.20/0.46
% 0.20/0.46 % ------ QBF Options
% 0.20/0.46
% 0.20/0.46 % --qbf_mode false
% 0.20/0.46 % --qbf_elim_univ true
% 0.20/0.46 % --qbf_sk_in true
% 0.20/0.46 % --qbf_pred_elim true
% 0.20/0.46 % --qbf_split 32
% 0.20/0.46
% 0.20/0.46 % ------ BMC1 Options
% 0.20/0.46
% 0.20/0.46 % --bmc1_incremental false
% 0.20/0.46 % --bmc1_axioms reachable_all
% 0.20/0.46 % --bmc1_min_bound 0
% 0.20/0.46 % --bmc1_max_bound -1
% 0.20/0.46 % --bmc1_max_bound_default -1
% 0.20/0.46 % --bmc1_symbol_reachability true
% 0.20/0.46 % --bmc1_property_lemmas false
% 0.20/0.46 % --bmc1_k_induction false
% 0.20/0.46 % --bmc1_non_equiv_states false
% 0.20/0.46 % --bmc1_deadlock false
% 0.20/0.46 % --bmc1_ucm false
% 0.20/0.46 % --bmc1_add_unsat_core none
% 0.20/0.46 % --bmc1_unsat_core_children false
% 0.20/0.46 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.46 % --bmc1_out_stat full
% 0.20/0.46 % --bmc1_ground_init false
% 0.20/0.46 % --bmc1_pre_inst_next_state false
% 0.20/0.46 % --bmc1_pre_inst_state false
% 0.20/0.46 % --bmc1_pre_inst_reach_state false
% 0.20/0.46 % --bmc1_out_unsat_core false
% 0.20/0.46 % --bmc1_aig_witness_out false
% 0.20/0.46 % --bmc1_verbose false
% 0.20/0.46 % --bmc1_dump_clauses_tptp false
% 0.20/0.49 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.49 % --bmc1_dump_file -
% 0.20/0.49 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.49 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.49 % --bmc1_ucm_extend_mode 1
% 0.20/0.49 % --bmc1_ucm_init_mode 2
% 0.20/0.49 % --bmc1_ucm_cone_mode none
% 0.20/0.49 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.49 % --bmc1_ucm_relax_model 4
% 0.20/0.49 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.49 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.49 % --bmc1_ucm_layered_model none
% 0.20/0.49 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.49
% 0.20/0.49 % ------ AIG Options
% 0.20/0.49
% 0.20/0.49 % --aig_mode false
% 0.20/0.49
% 0.20/0.49 % ------ Instantiation Options
% 0.20/0.49
% 0.20/0.49 % --instantiation_flag true
% 0.20/0.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.49 % --inst_solver_per_active 750
% 0.20/0.49 % --inst_solver_calls_frac 0.5
% 0.20/0.49 % --inst_passive_queue_type priority_queues
% 0.20/0.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.49 % --inst_passive_queues_freq [25;2]
% 0.20/0.49 % --inst_dismatching true
% 0.20/0.49 % --inst_eager_unprocessed_to_passive true
% 0.20/0.49 % --inst_prop_sim_given true
% 0.20/0.49 % --inst_prop_sim_new false
% 0.20/0.49 % --inst_orphan_elimination true
% 0.20/0.49 % --inst_learning_loop_flag true
% 0.20/0.49 % --inst_learning_start 3000
% 0.20/0.49 % --inst_learning_factor 2
% 0.20/0.49 % --inst_start_prop_sim_after_learn 3
% 0.20/0.49 % --inst_sel_renew solver
% 0.20/0.49 % --inst_lit_activity_flag true
% 0.20/0.49 % --inst_out_proof true
% 0.20/0.49
% 0.20/0.49 % ------ Resolution Options
% 0.20/0.49
% 0.20/0.49 % --resolution_flag true
% 0.20/0.49 % --res_lit_sel kbo_max
% 0.20/0.49 % --res_to_prop_solver none
% 0.20/0.49 % --res_prop_simpl_new false
% 0.20/0.49 % --res_prop_simpl_given false
% 0.20/0.49 % --res_passive_queue_type priority_queues
% 0.20/0.49 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.49 % --res_passive_queues_freq [15;5]
% 0.20/0.49 % --res_forward_subs full
% 0.20/0.49 % --res_backward_subs full
% 0.20/0.49 % --res_forward_subs_resolution true
% 0.20/0.49 % --res_backward_subs_resolution true
% 0.20/0.49 % --res_orphan_elimination false
% 0.20/0.49 % --res_time_limit 1000.
% 0.20/0.49 % --res_out_proof true
% 0.20/0.49 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d1c8b2.s
% 0.20/0.49 % --modulo true
% 0.20/0.49
% 0.20/0.49 % ------ Combination Options
% 0.20/0.49
% 0.20/0.49 % --comb_res_mult 1000
% 0.20/0.49 % --comb_inst_mult 300
% 0.20/0.49 % ------
% 0.20/0.49
% 0.20/0.49 % ------ Parsing...% successful
% 0.20/0.49
% 0.20/0.49 % ------ Preprocessing... gs_s sp: 66 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.49
% 0.20/0.49 % ------ Proving...
% 0.20/0.49 % ------ Problem Properties
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % EPR true
% 0.20/0.49 % Horn false
% 0.20/0.49 % Has equality false
% 0.20/0.49
% 0.20/0.49 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 % % ------ Current options:
% 0.20/0.49
% 0.20/0.49 % ------ Input Options
% 0.20/0.49
% 0.20/0.49 % --out_options all
% 0.20/0.49 % --tptp_safe_out true
% 0.20/0.49 % --problem_path ""
% 0.20/0.49 % --include_path ""
% 0.20/0.49 % --clausifier .//eprover
% 0.20/0.49 % --clausifier_options --tstp-format
% 0.20/0.49 % --stdin false
% 0.20/0.49 % --dbg_backtrace false
% 0.20/0.49 % --dbg_dump_prop_clauses false
% 0.20/0.49 % --dbg_dump_prop_clauses_file -
% 0.20/0.49 % --dbg_out_stat false
% 0.20/0.49
% 0.20/0.49 % ------ General Options
% 0.20/0.49
% 0.20/0.49 % --fof false
% 0.20/0.49 % --time_out_real 150.
% 0.20/0.49 % --time_out_prep_mult 0.2
% 0.20/0.49 % --time_out_virtual -1.
% 0.20/0.49 % --schedule none
% 0.20/0.49 % --ground_splitting input
% 0.20/0.49 % --splitting_nvd 16
% 0.20/0.49 % --non_eq_to_eq false
% 0.20/0.49 % --prep_gs_sim true
% 0.20/0.49 % --prep_unflatten false
% 0.20/0.49 % --prep_res_sim true
% 0.20/0.49 % --prep_upred true
% 0.20/0.49 % --res_sim_input true
% 0.20/0.49 % --clause_weak_htbl true
% 0.20/0.49 % --gc_record_bc_elim false
% 0.20/0.49 % --symbol_type_check false
% 0.20/0.49 % --clausify_out false
% 0.20/0.49 % --large_theory_mode false
% 0.20/0.49 % --prep_sem_filter none
% 0.20/0.49 % --prep_sem_filter_out false
% 0.20/0.49 % --preprocessed_out false
% 0.20/0.49 % --sub_typing false
% 0.20/0.49 % --brand_transform false
% 0.20/0.49 % --pure_diseq_elim true
% 0.20/0.49 % --min_unsat_core false
% 0.20/0.49 % --pred_elim true
% 0.20/0.49 % --add_important_lit false
% 0.20/0.49 % --soft_assumptions false
% 0.20/0.49 % --reset_solvers false
% 0.20/0.49 % --bc_imp_inh []
% 0.20/0.49 % --conj_cone_tolerance 1.5
% 0.20/0.49 % --prolific_symb_bound 500
% 0.20/0.49 % --lt_threshold 2000
% 0.20/0.49
% 0.20/0.49 % ------ SAT Options
% 0.20/0.49
% 0.20/0.49 % --sat_mode false
% 0.20/0.49 % --sat_fm_restart_options ""
% 0.20/0.49 % --sat_gr_def false
% 0.20/0.49 % --sat_epr_types true
% 0.20/0.49 % --sat_non_cyclic_types false
% 0.20/0.49 % --sat_finite_models false
% 0.20/0.49 % --sat_fm_lemmas false
% 0.20/0.49 % --sat_fm_prep false
% 0.20/0.49 % --sat_fm_uc_incr true
% 0.20/0.49 % --sat_out_model small
% 0.20/0.49 % --sat_out_clauses false
% 0.20/0.49
% 0.20/0.49 % ------ QBF Options
% 0.20/0.49
% 0.20/0.49 % --qbf_mode false
% 0.20/0.49 % --qbf_elim_univ true
% 0.20/0.49 % --qbf_sk_in true
% 0.20/0.49 % --qbf_pred_elim true
% 0.20/0.49 % --qbf_split 32
% 0.20/0.49
% 0.20/0.49 % ------ BMC1 Options
% 0.20/0.49
% 0.20/0.49 % --bmc1_incremental false
% 0.20/0.49 % --bmc1_axioms reachable_all
% 0.20/0.49 % --bmc1_min_bound 0
% 0.20/0.49 % --bmc1_max_bound -1
% 0.20/0.49 % --bmc1_max_bound_default -1
% 0.20/0.49 % --bmc1_symbol_reachability true
% 0.20/0.49 % --bmc1_property_lemmas false
% 0.20/0.49 % --bmc1_k_induction false
% 0.20/0.49 % --bmc1_non_equiv_states false
% 0.20/0.49 % --bmc1_deadlock false
% 0.20/0.49 % --bmc1_ucm false
% 0.20/0.49 % --bmc1_add_unsat_core none
% 0.20/0.49 % --bmc1_unsat_core_children false
% 0.20/0.49 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.49 % --bmc1_out_stat full
% 0.20/0.49 % --bmc1_ground_init false
% 0.20/0.49 % --bmc1_pre_inst_next_state false
% 0.20/0.49 % --bmc1_pre_inst_state false
% 0.20/0.49 % --bmc1_pre_inst_reach_state false
% 0.20/0.49 % --bmc1_out_unsat_core false
% 0.20/0.49 % --bmc1_aig_witness_out false
% 0.20/0.49 % --bmc1_verbose false
% 0.20/0.49 % --bmc1_dump_clauses_tptp false
% 0.20/0.49 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.49 % --bmc1_dump_file -
% 0.20/0.49 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.49 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.49 % --bmc1_ucm_extend_mode 1
% 0.20/0.49 % --bmc1_ucm_init_mode 2
% 0.20/0.49 % --bmc1_ucm_cone_mode none
% 0.20/0.49 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.49 % --bmc1_ucm_relax_model 4
% 0.20/0.49 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.49 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.49 % --bmc1_ucm_layered_model none
% 0.20/0.49 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.49
% 0.20/0.49 % ------ AIG Options
% 0.20/0.49
% 0.20/0.49 % --aig_mode false
% 0.20/0.49
% 0.20/0.49 % ------ Instantiation Options
% 0.20/0.49
% 0.20/0.49 % --instantiation_flag true
% 0.20/0.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.49 % --inst_solver_per_active 750
% 0.20/0.49 % --inst_solver_calls_frac 0.5
% 0.20/0.49 % --inst_passive_queue_type priority_queues
% 0.20/0.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.49 % --inst_passive_queues_freq [25;2]
% 0.20/0.49 % --inst_dismatching true
% 0.20/0.49 % --inst_eager_unprocessed_to_passive true
% 1.06/1.24 % --inst_prop_sim_given true
% 1.06/1.24 % --inst_prop_sim_new false
% 1.06/1.24 % --inst_orphan_elimination true
% 1.06/1.24 % --inst_learning_loop_flag true
% 1.06/1.24 % --inst_learning_start 3000
% 1.06/1.24 % --inst_learning_factor 2
% 1.06/1.24 % --inst_start_prop_sim_after_learn 3
% 1.06/1.24 % --inst_sel_renew solver
% 1.06/1.24 % --inst_lit_activity_flag true
% 1.06/1.24 % --inst_out_proof true
% 1.06/1.24
% 1.06/1.24 % ------ Resolution Options
% 1.06/1.24
% 1.06/1.24 % --resolution_flag true
% 1.06/1.24 % --res_lit_sel kbo_max
% 1.06/1.24 % --res_to_prop_solver none
% 1.06/1.24 % --res_prop_simpl_new false
% 1.06/1.24 % --res_prop_simpl_given false
% 1.06/1.24 % --res_passive_queue_type priority_queues
% 1.06/1.24 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.06/1.24 % --res_passive_queues_freq [15;5]
% 1.06/1.24 % --res_forward_subs full
% 1.06/1.24 % --res_backward_subs full
% 1.06/1.24 % --res_forward_subs_resolution true
% 1.06/1.24 % --res_backward_subs_resolution true
% 1.06/1.24 % --res_orphan_elimination false
% 1.06/1.24 % --res_time_limit 1000.
% 1.06/1.24 % --res_out_proof true
% 1.06/1.24 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d1c8b2.s
% 1.06/1.24 % --modulo true
% 1.06/1.24
% 1.06/1.24 % ------ Combination Options
% 1.06/1.24
% 1.06/1.24 % --comb_res_mult 1000
% 1.06/1.24 % --comb_inst_mult 300
% 1.06/1.24 % ------
% 1.06/1.24
% 1.06/1.24
% 1.06/1.24
% 1.06/1.24 % ------ Proving...
% 1.06/1.24 % warning: shown sat in sat incomplete mode
% 1.06/1.24 %
% 1.06/1.24
% 1.06/1.24
% 1.06/1.24 ------ Building Model...Done
% 1.06/1.24
% 1.06/1.24 %------ The model is defined over ground terms (initial term algebra).
% 1.06/1.24 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.06/1.24 %------ where \phi is a formula over the term algebra.
% 1.06/1.24 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.06/1.24 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.06/1.24 %------ See help for --sat_out_model for different model outputs.
% 1.06/1.24 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.06/1.24 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.06/1.24
% 1.06/1.24
% 1.06/1.24
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of c3_1
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 (! [X0] :
% 1.06/1.24 ( c3_1(X0) <=>
% 1.06/1.24 (
% 1.06/1.24 (
% 1.06/1.24 ( X0=a221 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 )
% 1.06/1.24 )
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Negative definition of c1_1
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 (! [X0] :
% 1.06/1.24 ( ~(c1_1(X0)) <=>
% 1.06/1.24 (
% 1.06/1.24 (
% 1.06/1.24 ( X0=a198 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a205 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a207 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a210 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a215 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a217 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a200 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a203 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a204 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a216 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 )
% 1.06/1.24 )
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Negative definition of c0_1
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 (! [X0] :
% 1.06/1.24 ( ~(c0_1(X0)) <=>
% 1.06/1.24 (
% 1.06/1.24 (
% 1.06/1.24 ( X0=a205 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a221 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a200 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a204 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a216 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 )
% 1.06/1.24 )
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of ndr1_0
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( ndr1_0 <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of c2_1
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 (! [X0] :
% 1.06/1.24 ( c2_1(X0) <=>
% 1.06/1.24 (
% 1.06/1.24 (
% 1.06/1.24 ( X0=a198 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a202 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a205 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a207 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a210 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a215 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a217 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a221 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a200 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a203 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a204 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a214 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a208 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a216 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a219 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 |
% 1.06/1.24 (
% 1.06/1.24 ( X0=a220 )
% 1.06/1.24 )
% 1.06/1.24
% 1.06/1.24 )
% 1.06/1.24 )
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp1
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp1 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp14
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp14 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp15
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp15 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp0
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp0 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp19
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp19 <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp22
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp22 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp12
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp12 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp10
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp10 <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp11
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp11 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp25
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp25 <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp5
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp5 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp20
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp20 <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp7
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp7 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp6
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp6 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp13
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp13 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp24
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp24 <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp23
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp23 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp2
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp2 <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp3
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp3 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp4
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp4 <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp8
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp8 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp9
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp9 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp16
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp16 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp17
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp17 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp21
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp21 <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of hskp18
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( hskp18 <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP1_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP1_iProver_split <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP2_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP2_iProver_split <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP3_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP3_iProver_split <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP4_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP4_iProver_split <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP5_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP5_iProver_split <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP7_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP7_iProver_split <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP8_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP8_iProver_split <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP9_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP9_iProver_split <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP11_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP11_iProver_split <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP14_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP14_iProver_split <=>
% 1.06/1.24 $true
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP16_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP16_iProver_split <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24 %------ Positive definition of sP19_iProver_split
% 1.06/1.24 fof(lit_def,axiom,
% 1.06/1.24 ( sP19_iProver_split <=>
% 1.06/1.24 $false
% 1.06/1.24 )
% 1.06/1.24 ).
% 1.06/1.24
% 1.06/1.24
% 1.06/1.24
% 1.06/1.24 % ------ Statistics
% 1.06/1.24
% 1.06/1.24 % ------ General
% 1.06/1.24
% 1.06/1.24 % num_of_input_clauses: 124
% 1.06/1.24 % num_of_input_neg_conjectures: 124
% 1.06/1.24 % num_of_splits: 66
% 1.06/1.24 % num_of_split_atoms: 22
% 1.06/1.24 % num_of_sem_filtered_clauses: 0
% 1.06/1.24 % num_of_subtypes: 0
% 1.06/1.24 % monotx_restored_types: 0
% 1.06/1.24 % sat_num_of_epr_types: 0
% 1.06/1.24 % sat_num_of_non_cyclic_types: 0
% 1.06/1.24 % sat_guarded_non_collapsed_types: 0
% 1.06/1.24 % is_epr: 1
% 1.06/1.24 % is_horn: 0
% 1.06/1.24 % has_eq: 0
% 1.06/1.24 % num_pure_diseq_elim: 0
% 1.06/1.24 % simp_replaced_by: 0
% 1.06/1.24 % res_preprocessed: 314
% 1.06/1.24 % prep_upred: 0
% 1.06/1.24 % prep_unflattend: 0
% 1.06/1.24 % pred_elim_cands: 22
% 1.06/1.24 % pred_elim: 10
% 1.06/1.24 % pred_elim_cl: 10
% 1.06/1.24 % pred_elim_cycles: 22
% 1.06/1.24 % forced_gc_time: 0
% 1.06/1.24 % gc_basic_clause_elim: 0
% 1.06/1.24 % parsing_time: 0.003
% 1.06/1.24 % sem_filter_time: 0.
% 1.06/1.24 % pred_elim_time: 0.013
% 1.06/1.24 % out_proof_time: 0.
% 1.06/1.24 % monotx_time: 0.
% 1.06/1.24 % subtype_inf_time: 0.
% 1.06/1.24 % unif_index_cands_time: 0.002
% 1.06/1.24 % unif_index_add_time: 0.002
% 1.06/1.24 % total_time: 0.792
% 1.06/1.24 % num_of_symbols: 104
% 1.06/1.24 % num_of_terms: 366
% 1.06/1.24
% 1.06/1.24 % ------ Propositional Solver
% 1.06/1.24
% 1.06/1.24 % prop_solver_calls: 15
% 1.06/1.24 % prop_fast_solver_calls: 1482
% 1.06/1.24 % prop_num_of_clauses: 425
% 1.06/1.24 % prop_preprocess_simplified: 2020
% 1.06/1.24 % prop_fo_subsumed: 86
% 1.06/1.24 % prop_solver_time: 0.
% 1.06/1.24 % prop_fast_solver_time: 0.001
% 1.06/1.24 % prop_unsat_core_time: 0.
% 1.06/1.24
% 1.06/1.24 % ------ QBF
% 1.06/1.24
% 1.06/1.24 % qbf_q_res: 0
% 1.06/1.24 % qbf_num_tautologies: 0
% 1.06/1.24 % qbf_prep_cycles: 0
% 1.06/1.24
% 1.06/1.24 % ------ BMC1
% 1.06/1.24
% 1.06/1.24 % bmc1_current_bound: -1
% 1.06/1.24 % bmc1_last_solved_bound: -1
% 1.06/1.24 % bmc1_unsat_core_size: -1
% 1.06/1.24 % bmc1_unsat_core_parents_size: -1
% 1.06/1.24 % bmc1_merge_next_fun: 0
% 1.06/1.24 % bmc1_unsat_core_clauses_time: 0.
% 1.06/1.24
% 1.06/1.24 % ------ Instantiation
% 1.06/1.24
% 1.06/1.24 % inst_num_of_clauses: 270
% 1.06/1.24 % inst_num_in_passive: 0
% 1.06/1.24 % inst_num_in_active: 270
% 1.06/1.24 % inst_num_in_unprocessed: 0
% 1.06/1.24 % inst_num_of_loops: 373
% 1.06/1.24 % inst_num_of_learning_restarts: 0
% 1.06/1.24 % inst_num_moves_active_passive: 87
% 1.06/1.24 % inst_lit_activity: 34
% 1.06/1.24 % inst_lit_activity_moves: 0
% 1.06/1.24 % inst_num_tautologies: 0
% 1.06/1.24 % inst_num_prop_implied: 0
% 1.06/1.24 % inst_num_existing_simplified: 0
% 1.06/1.24 % inst_num_eq_res_simplified: 0
% 1.06/1.24 % inst_num_child_elim: 0
% 1.06/1.24 % inst_num_of_dismatching_blockings: 0
% 1.06/1.24 % inst_num_of_non_proper_insts: 197
% 1.06/1.24 % inst_num_of_duplicates: 10
% 1.06/1.24 % inst_inst_num_from_inst_to_res: 0
% 1.06/1.24 % inst_dismatching_checking_time: 0.
% 1.06/1.24
% 1.06/1.24 % ------ Resolution
% 1.06/1.24
% 1.06/1.24 % res_num_of_clauses: 6741
% 1.06/1.24 % res_num_in_passive: 5927
% 1.06/1.24 % res_num_in_active: 1119
% 1.06/1.24 % res_num_of_loops: 2000
% 1.06/1.24 % res_forward_subset_subsumed: 1797
% 1.06/1.24 % res_backward_subset_subsumed: 343
% 1.06/1.24 % res_forward_subsumed: 770
% 1.06/1.24 % res_backward_subsumed: 72
% 1.06/1.24 % res_forward_subsumption_resolution: 337
% 1.06/1.24 % res_backward_subsumption_resolution: 27
% 1.06/1.24 % res_clause_to_clause_subsumption: 1206
% 1.06/1.24 % res_orphan_elimination: 0
% 1.06/1.24 % res_tautology_del: 2873
% 1.06/1.24 % res_num_eq_res_simplified: 0
% 1.06/1.24 % res_num_sel_changes: 0
% 1.06/1.24 % res_moves_from_active_to_pass: 0
% 1.06/1.24
% 1.06/1.24 % Status Unknown
% 1.06/1.27 % Orienting using strategy ClausalAll
% 1.06/1.27 % FOF problem with conjecture
% 1.06/1.27 % 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_d1c8b2.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e8f1dd.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_604345 | grep -v "SZS"
% 1.06/1.29
% 1.06/1.29 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.06/1.29
% 1.06/1.29 %
% 1.06/1.29 % ------ iProver source info
% 1.06/1.29
% 1.06/1.29 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.06/1.29 % git: non_committed_changes: true
% 1.06/1.29 % git: last_make_outside_of_git: true
% 1.06/1.29
% 1.06/1.29 %
% 1.06/1.29 % ------ Input Options
% 1.06/1.29
% 1.06/1.29 % --out_options all
% 1.06/1.29 % --tptp_safe_out true
% 1.06/1.29 % --problem_path ""
% 1.06/1.29 % --include_path ""
% 1.06/1.29 % --clausifier .//eprover
% 1.06/1.29 % --clausifier_options --tstp-format
% 1.06/1.29 % --stdin false
% 1.06/1.29 % --dbg_backtrace false
% 1.06/1.29 % --dbg_dump_prop_clauses false
% 1.06/1.29 % --dbg_dump_prop_clauses_file -
% 1.06/1.29 % --dbg_out_stat false
% 1.06/1.29
% 1.06/1.29 % ------ General Options
% 1.06/1.29
% 1.06/1.29 % --fof false
% 1.06/1.29 % --time_out_real 150.
% 1.06/1.29 % --time_out_prep_mult 0.2
% 1.06/1.29 % --time_out_virtual -1.
% 1.06/1.29 % --schedule none
% 1.06/1.29 % --ground_splitting input
% 1.06/1.29 % --splitting_nvd 16
% 1.06/1.29 % --non_eq_to_eq false
% 1.06/1.29 % --prep_gs_sim true
% 1.06/1.29 % --prep_unflatten false
% 1.06/1.29 % --prep_res_sim true
% 1.06/1.29 % --prep_upred true
% 1.06/1.29 % --res_sim_input true
% 1.06/1.29 % --clause_weak_htbl true
% 1.06/1.29 % --gc_record_bc_elim false
% 1.06/1.29 % --symbol_type_check false
% 1.06/1.29 % --clausify_out false
% 1.06/1.29 % --large_theory_mode false
% 1.06/1.29 % --prep_sem_filter none
% 1.06/1.29 % --prep_sem_filter_out false
% 1.06/1.29 % --preprocessed_out false
% 1.06/1.29 % --sub_typing false
% 1.06/1.29 % --brand_transform false
% 1.06/1.29 % --pure_diseq_elim true
% 1.06/1.29 % --min_unsat_core false
% 1.06/1.29 % --pred_elim true
% 1.06/1.29 % --add_important_lit false
% 1.06/1.29 % --soft_assumptions false
% 1.06/1.29 % --reset_solvers false
% 1.06/1.29 % --bc_imp_inh []
% 1.06/1.29 % --conj_cone_tolerance 1.5
% 1.06/1.29 % --prolific_symb_bound 500
% 1.06/1.29 % --lt_threshold 2000
% 1.06/1.29
% 1.06/1.29 % ------ SAT Options
% 1.06/1.29
% 1.06/1.29 % --sat_mode false
% 1.06/1.29 % --sat_fm_restart_options ""
% 1.06/1.29 % --sat_gr_def false
% 1.06/1.29 % --sat_epr_types true
% 1.06/1.29 % --sat_non_cyclic_types false
% 1.06/1.29 % --sat_finite_models false
% 1.06/1.29 % --sat_fm_lemmas false
% 1.06/1.29 % --sat_fm_prep false
% 1.06/1.29 % --sat_fm_uc_incr true
% 1.06/1.29 % --sat_out_model small
% 1.06/1.29 % --sat_out_clauses false
% 1.06/1.29
% 1.06/1.29 % ------ QBF Options
% 1.06/1.29
% 1.06/1.29 % --qbf_mode false
% 1.06/1.29 % --qbf_elim_univ true
% 1.06/1.29 % --qbf_sk_in true
% 1.06/1.29 % --qbf_pred_elim true
% 1.06/1.29 % --qbf_split 32
% 1.06/1.29
% 1.06/1.29 % ------ BMC1 Options
% 1.06/1.29
% 1.06/1.29 % --bmc1_incremental false
% 1.06/1.29 % --bmc1_axioms reachable_all
% 1.06/1.29 % --bmc1_min_bound 0
% 1.06/1.29 % --bmc1_max_bound -1
% 1.06/1.29 % --bmc1_max_bound_default -1
% 1.06/1.29 % --bmc1_symbol_reachability true
% 1.06/1.29 % --bmc1_property_lemmas false
% 1.06/1.29 % --bmc1_k_induction false
% 1.06/1.29 % --bmc1_non_equiv_states false
% 1.06/1.29 % --bmc1_deadlock false
% 1.06/1.29 % --bmc1_ucm false
% 1.06/1.29 % --bmc1_add_unsat_core none
% 1.06/1.29 % --bmc1_unsat_core_children false
% 1.06/1.29 % --bmc1_unsat_core_extrapolate_axioms false
% 1.06/1.29 % --bmc1_out_stat full
% 1.06/1.29 % --bmc1_ground_init false
% 1.06/1.29 % --bmc1_pre_inst_next_state false
% 1.06/1.29 % --bmc1_pre_inst_state false
% 1.06/1.29 % --bmc1_pre_inst_reach_state false
% 1.06/1.29 % --bmc1_out_unsat_core false
% 1.06/1.29 % --bmc1_aig_witness_out false
% 1.06/1.29 % --bmc1_verbose false
% 1.06/1.29 % --bmc1_dump_clauses_tptp false
% 1.12/1.32 % --bmc1_dump_unsat_core_tptp false
% 1.12/1.32 % --bmc1_dump_file -
% 1.12/1.32 % --bmc1_ucm_expand_uc_limit 128
% 1.12/1.32 % --bmc1_ucm_n_expand_iterations 6
% 1.12/1.32 % --bmc1_ucm_extend_mode 1
% 1.12/1.32 % --bmc1_ucm_init_mode 2
% 1.12/1.32 % --bmc1_ucm_cone_mode none
% 1.12/1.32 % --bmc1_ucm_reduced_relation_type 0
% 1.12/1.32 % --bmc1_ucm_relax_model 4
% 1.12/1.32 % --bmc1_ucm_full_tr_after_sat true
% 1.12/1.32 % --bmc1_ucm_expand_neg_assumptions false
% 1.12/1.32 % --bmc1_ucm_layered_model none
% 1.12/1.32 % --bmc1_ucm_max_lemma_size 10
% 1.12/1.32
% 1.12/1.32 % ------ AIG Options
% 1.12/1.32
% 1.12/1.32 % --aig_mode false
% 1.12/1.32
% 1.12/1.32 % ------ Instantiation Options
% 1.12/1.32
% 1.12/1.32 % --instantiation_flag true
% 1.12/1.32 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.12/1.32 % --inst_solver_per_active 750
% 1.12/1.32 % --inst_solver_calls_frac 0.5
% 1.12/1.32 % --inst_passive_queue_type priority_queues
% 1.12/1.32 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.12/1.32 % --inst_passive_queues_freq [25;2]
% 1.12/1.32 % --inst_dismatching true
% 1.12/1.32 % --inst_eager_unprocessed_to_passive true
% 1.12/1.32 % --inst_prop_sim_given true
% 1.12/1.32 % --inst_prop_sim_new false
% 1.12/1.32 % --inst_orphan_elimination true
% 1.12/1.32 % --inst_learning_loop_flag true
% 1.12/1.32 % --inst_learning_start 3000
% 1.12/1.32 % --inst_learning_factor 2
% 1.12/1.32 % --inst_start_prop_sim_after_learn 3
% 1.12/1.32 % --inst_sel_renew solver
% 1.12/1.32 % --inst_lit_activity_flag true
% 1.12/1.32 % --inst_out_proof true
% 1.12/1.32
% 1.12/1.32 % ------ Resolution Options
% 1.12/1.32
% 1.12/1.32 % --resolution_flag true
% 1.12/1.32 % --res_lit_sel kbo_max
% 1.12/1.32 % --res_to_prop_solver none
% 1.12/1.32 % --res_prop_simpl_new false
% 1.12/1.32 % --res_prop_simpl_given false
% 1.12/1.32 % --res_passive_queue_type priority_queues
% 1.12/1.32 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.12/1.32 % --res_passive_queues_freq [15;5]
% 1.12/1.32 % --res_forward_subs full
% 1.12/1.32 % --res_backward_subs full
% 1.12/1.32 % --res_forward_subs_resolution true
% 1.12/1.32 % --res_backward_subs_resolution true
% 1.12/1.32 % --res_orphan_elimination false
% 1.12/1.32 % --res_time_limit 1000.
% 1.12/1.32 % --res_out_proof true
% 1.12/1.32 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d1c8b2.s
% 1.12/1.32 % --modulo true
% 1.12/1.32
% 1.12/1.32 % ------ Combination Options
% 1.12/1.32
% 1.12/1.32 % --comb_res_mult 1000
% 1.12/1.32 % --comb_inst_mult 300
% 1.12/1.32 % ------
% 1.12/1.32
% 1.12/1.32 % ------ Parsing...% successful
% 1.12/1.32
% 1.12/1.32 % ------ Preprocessing... gs_s sp: 66 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 1.12/1.32
% 1.12/1.32 % ------ Proving...
% 1.12/1.32 % ------ Problem Properties
% 1.12/1.32
% 1.12/1.32 %
% 1.12/1.32 % EPR true
% 1.12/1.32 % Horn false
% 1.12/1.32 % Has equality false
% 1.12/1.32
% 1.12/1.32 % % ------ Input Options Time Limit: Unbounded
% 1.12/1.32
% 1.12/1.32
% 1.12/1.32 % % ------ Current options:
% 1.12/1.32
% 1.12/1.32 % ------ Input Options
% 1.12/1.32
% 1.12/1.32 % --out_options all
% 1.12/1.32 % --tptp_safe_out true
% 1.12/1.32 % --problem_path ""
% 1.12/1.32 % --include_path ""
% 1.12/1.32 % --clausifier .//eprover
% 1.12/1.32 % --clausifier_options --tstp-format
% 1.12/1.32 % --stdin false
% 1.12/1.32 % --dbg_backtrace false
% 1.12/1.32 % --dbg_dump_prop_clauses false
% 1.12/1.32 % --dbg_dump_prop_clauses_file -
% 1.12/1.32 % --dbg_out_stat false
% 1.12/1.32
% 1.12/1.32 % ------ General Options
% 1.12/1.32
% 1.12/1.32 % --fof false
% 1.12/1.32 % --time_out_real 150.
% 1.12/1.32 % --time_out_prep_mult 0.2
% 1.12/1.32 % --time_out_virtual -1.
% 1.12/1.32 % --schedule none
% 1.12/1.32 % --ground_splitting input
% 1.12/1.32 % --splitting_nvd 16
% 1.12/1.32 % --non_eq_to_eq false
% 1.12/1.32 % --prep_gs_sim true
% 1.12/1.32 % --prep_unflatten false
% 1.12/1.32 % --prep_res_sim true
% 1.12/1.32 % --prep_upred true
% 1.12/1.32 % --res_sim_input true
% 1.12/1.32 % --clause_weak_htbl true
% 1.12/1.32 % --gc_record_bc_elim false
% 1.12/1.32 % --symbol_type_check false
% 1.12/1.32 % --clausify_out false
% 1.12/1.32 % --large_theory_mode false
% 1.12/1.32 % --prep_sem_filter none
% 1.12/1.32 % --prep_sem_filter_out false
% 1.12/1.32 % --preprocessed_out false
% 1.12/1.32 % --sub_typing false
% 1.12/1.32 % --brand_transform false
% 1.12/1.32 % --pure_diseq_elim true
% 1.12/1.32 % --min_unsat_core false
% 1.12/1.32 % --pred_elim true
% 1.12/1.32 % --add_important_lit false
% 1.12/1.32 % --soft_assumptions false
% 1.12/1.32 % --reset_solvers false
% 1.12/1.32 % --bc_imp_inh []
% 1.12/1.32 % --conj_cone_tolerance 1.5
% 1.12/1.32 % --prolific_symb_bound 500
% 1.12/1.32 % --lt_threshold 2000
% 1.12/1.32
% 1.12/1.32 % ------ SAT Options
% 1.12/1.32
% 1.12/1.32 % --sat_mode false
% 1.12/1.32 % --sat_fm_restart_options ""
% 1.12/1.32 % --sat_gr_def false
% 1.12/1.32 % --sat_epr_types true
% 1.12/1.32 % --sat_non_cyclic_types false
% 1.12/1.32 % --sat_finite_models false
% 1.12/1.32 % --sat_fm_lemmas false
% 1.12/1.32 % --sat_fm_prep false
% 1.12/1.32 % --sat_fm_uc_incr true
% 1.12/1.32 % --sat_out_model small
% 1.12/1.32 % --sat_out_clauses false
% 1.12/1.32
% 1.12/1.32 % ------ QBF Options
% 1.12/1.32
% 1.12/1.32 % --qbf_mode false
% 1.12/1.32 % --qbf_elim_univ true
% 1.12/1.32 % --qbf_sk_in true
% 1.12/1.32 % --qbf_pred_elim true
% 1.12/1.32 % --qbf_split 32
% 1.12/1.32
% 1.12/1.32 % ------ BMC1 Options
% 1.12/1.32
% 1.12/1.32 % --bmc1_incremental false
% 1.12/1.32 % --bmc1_axioms reachable_all
% 1.12/1.32 % --bmc1_min_bound 0
% 1.12/1.32 % --bmc1_max_bound -1
% 1.12/1.32 % --bmc1_max_bound_default -1
% 1.12/1.32 % --bmc1_symbol_reachability true
% 1.12/1.32 % --bmc1_property_lemmas false
% 1.12/1.32 % --bmc1_k_induction false
% 1.12/1.32 % --bmc1_non_equiv_states false
% 1.12/1.32 % --bmc1_deadlock false
% 1.12/1.32 % --bmc1_ucm false
% 1.12/1.32 % --bmc1_add_unsat_core none
% 1.12/1.32 % --bmc1_unsat_core_children false
% 1.12/1.32 % --bmc1_unsat_core_extrapolate_axioms false
% 1.12/1.32 % --bmc1_out_stat full
% 1.12/1.32 % --bmc1_ground_init false
% 1.12/1.32 % --bmc1_pre_inst_next_state false
% 1.12/1.32 % --bmc1_pre_inst_state false
% 1.12/1.32 % --bmc1_pre_inst_reach_state false
% 1.12/1.32 % --bmc1_out_unsat_core false
% 1.12/1.32 % --bmc1_aig_witness_out false
% 1.12/1.32 % --bmc1_verbose false
% 1.12/1.32 % --bmc1_dump_clauses_tptp false
% 1.12/1.32 % --bmc1_dump_unsat_core_tptp false
% 1.12/1.32 % --bmc1_dump_file -
% 1.12/1.32 % --bmc1_ucm_expand_uc_limit 128
% 1.12/1.32 % --bmc1_ucm_n_expand_iterations 6
% 1.12/1.32 % --bmc1_ucm_extend_mode 1
% 1.12/1.32 % --bmc1_ucm_init_mode 2
% 1.12/1.32 % --bmc1_ucm_cone_mode none
% 1.12/1.32 % --bmc1_ucm_reduced_relation_type 0
% 1.12/1.32 % --bmc1_ucm_relax_model 4
% 1.12/1.32 % --bmc1_ucm_full_tr_after_sat true
% 1.12/1.32 % --bmc1_ucm_expand_neg_assumptions false
% 1.12/1.32 % --bmc1_ucm_layered_model none
% 1.12/1.32 % --bmc1_ucm_max_lemma_size 10
% 1.12/1.32
% 1.12/1.32 % ------ AIG Options
% 1.12/1.32
% 1.12/1.32 % --aig_mode false
% 1.12/1.32
% 1.12/1.32 % ------ Instantiation Options
% 1.12/1.32
% 1.12/1.32 % --instantiation_flag true
% 1.12/1.32 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.12/1.32 % --inst_solver_per_active 750
% 1.12/1.32 % --inst_solver_calls_frac 0.5
% 1.12/1.32 % --inst_passive_queue_type priority_queues
% 1.12/1.32 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.12/1.32 % --inst_passive_queues_freq [25;2]
% 1.12/1.32 % --inst_dismatching true
% 1.12/1.32 % --inst_eager_unprocessed_to_passive true
% 1.64/1.89 % --inst_prop_sim_given true
% 1.64/1.89 % --inst_prop_sim_new false
% 1.64/1.89 % --inst_orphan_elimination true
% 1.64/1.89 % --inst_learning_loop_flag true
% 1.64/1.89 % --inst_learning_start 3000
% 1.64/1.89 % --inst_learning_factor 2
% 1.64/1.89 % --inst_start_prop_sim_after_learn 3
% 1.64/1.89 % --inst_sel_renew solver
% 1.64/1.89 % --inst_lit_activity_flag true
% 1.64/1.89 % --inst_out_proof true
% 1.64/1.89
% 1.64/1.89 % ------ Resolution Options
% 1.64/1.89
% 1.64/1.89 % --resolution_flag true
% 1.64/1.89 % --res_lit_sel kbo_max
% 1.64/1.89 % --res_to_prop_solver none
% 1.64/1.89 % --res_prop_simpl_new false
% 1.64/1.89 % --res_prop_simpl_given false
% 1.64/1.89 % --res_passive_queue_type priority_queues
% 1.64/1.89 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.64/1.89 % --res_passive_queues_freq [15;5]
% 1.64/1.89 % --res_forward_subs full
% 1.64/1.89 % --res_backward_subs full
% 1.64/1.89 % --res_forward_subs_resolution true
% 1.64/1.89 % --res_backward_subs_resolution true
% 1.64/1.89 % --res_orphan_elimination false
% 1.64/1.89 % --res_time_limit 1000.
% 1.64/1.89 % --res_out_proof true
% 1.64/1.89 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d1c8b2.s
% 1.64/1.89 % --modulo true
% 1.64/1.89
% 1.64/1.89 % ------ Combination Options
% 1.64/1.89
% 1.64/1.89 % --comb_res_mult 1000
% 1.64/1.89 % --comb_inst_mult 300
% 1.64/1.89 % ------
% 1.64/1.89
% 1.64/1.89
% 1.64/1.89
% 1.64/1.89 % ------ Proving...
% 1.64/1.89 % warning: shown sat in sat incomplete mode
% 1.64/1.89 %
% 1.64/1.89
% 1.64/1.89
% 1.64/1.89 ------ Building Model...Done
% 1.64/1.89
% 1.64/1.89 %------ The model is defined over ground terms (initial term algebra).
% 1.64/1.89 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.64/1.89 %------ where \phi is a formula over the term algebra.
% 1.64/1.89 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.64/1.89 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.64/1.89 %------ See help for --sat_out_model for different model outputs.
% 1.64/1.89 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.64/1.89 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.64/1.89
% 1.64/1.89
% 1.64/1.89
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of c3_1
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 (! [X0] :
% 1.64/1.89 ( c3_1(X0) <=>
% 1.64/1.89 (
% 1.64/1.89 (
% 1.64/1.89 ( X0=a221 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 )
% 1.64/1.89 )
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Negative definition of c1_1
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 (! [X0] :
% 1.64/1.89 ( ~(c1_1(X0)) <=>
% 1.64/1.89 (
% 1.64/1.89 (
% 1.64/1.89 ( X0=a198 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a205 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a207 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a210 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a215 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a217 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a200 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a203 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a204 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a216 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 )
% 1.64/1.89 )
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Negative definition of c0_1
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 (! [X0] :
% 1.64/1.89 ( ~(c0_1(X0)) <=>
% 1.64/1.89 (
% 1.64/1.89 (
% 1.64/1.89 ( X0=a205 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a221 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a200 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a204 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a216 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 )
% 1.64/1.89 )
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of ndr1_0
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( ndr1_0 <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of c2_1
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 (! [X0] :
% 1.64/1.89 ( c2_1(X0) <=>
% 1.64/1.89 (
% 1.64/1.89 (
% 1.64/1.89 ( X0=a198 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a202 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a205 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a207 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a210 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a215 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a217 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a221 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a200 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a203 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a204 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a214 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a208 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a216 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a219 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 |
% 1.64/1.89 (
% 1.64/1.89 ( X0=a220 )
% 1.64/1.89 )
% 1.64/1.89
% 1.64/1.89 )
% 1.64/1.89 )
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp1
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp1 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp14
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp14 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp15
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp15 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp0
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp0 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp19
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp19 <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp22
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp22 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp12
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp12 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp10
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp10 <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp11
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp11 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp25
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp25 <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp5
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp5 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp20
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp20 <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp7
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp7 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp6
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp6 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp13
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp13 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp24
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp24 <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp23
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp23 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp2
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp2 <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp3
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp3 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp4
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp4 <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp8
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp8 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp9
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp9 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp16
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp16 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp17
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp17 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp21
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp21 <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of hskp18
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( hskp18 <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP1_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP1_iProver_split <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP2_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP2_iProver_split <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP3_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP3_iProver_split <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP4_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP4_iProver_split <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP5_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP5_iProver_split <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP7_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP7_iProver_split <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP8_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP8_iProver_split <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP9_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP9_iProver_split <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP11_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP11_iProver_split <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP14_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP14_iProver_split <=>
% 1.64/1.89 $true
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP16_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP16_iProver_split <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89 %------ Positive definition of sP19_iProver_split
% 1.64/1.89 fof(lit_def,axiom,
% 1.64/1.89 ( sP19_iProver_split <=>
% 1.64/1.89 $false
% 1.64/1.89 )
% 1.64/1.89 ).
% 1.64/1.89
% 1.64/1.89
% 1.64/1.89
% 1.64/1.89 % ------ Statistics
% 1.64/1.89
% 1.64/1.89 % ------ General
% 1.64/1.89
% 1.64/1.89 % num_of_input_clauses: 124
% 1.64/1.89 % num_of_input_neg_conjectures: 124
% 1.64/1.89 % num_of_splits: 66
% 1.64/1.89 % num_of_split_atoms: 22
% 1.64/1.89 % num_of_sem_filtered_clauses: 0
% 1.64/1.89 % num_of_subtypes: 0
% 1.64/1.89 % monotx_restored_types: 0
% 1.64/1.89 % sat_num_of_epr_types: 0
% 1.64/1.89 % sat_num_of_non_cyclic_types: 0
% 1.64/1.89 % sat_guarded_non_collapsed_types: 0
% 1.64/1.89 % is_epr: 1
% 1.64/1.89 % is_horn: 0
% 1.64/1.90 % has_eq: 0
% 1.64/1.90 % num_pure_diseq_elim: 0
% 1.64/1.90 % simp_replaced_by: 0
% 1.64/1.90 % res_preprocessed: 314
% 1.64/1.90 % prep_upred: 0
% 1.64/1.90 % prep_unflattend: 0
% 1.64/1.90 % pred_elim_cands: 22
% 1.64/1.90 % pred_elim: 10
% 1.64/1.90 % pred_elim_cl: 10
% 1.64/1.90 % pred_elim_cycles: 22
% 1.64/1.90 % forced_gc_time: 0
% 1.64/1.90 % gc_basic_clause_elim: 0
% 1.64/1.90 % parsing_time: 0.003
% 1.64/1.90 % sem_filter_time: 0.
% 1.64/1.90 % pred_elim_time: 0.011
% 1.64/1.90 % out_proof_time: 0.
% 1.64/1.90 % monotx_time: 0.
% 1.64/1.90 % subtype_inf_time: 0.
% 1.64/1.90 % unif_index_cands_time: 0.001
% 1.64/1.90 % unif_index_add_time: 0.001
% 1.64/1.90 % total_time: 0.616
% 1.64/1.90 % num_of_symbols: 104
% 1.64/1.90 % num_of_terms: 366
% 1.64/1.90
% 1.64/1.90 % ------ Propositional Solver
% 1.64/1.90
% 1.64/1.90 % prop_solver_calls: 15
% 1.64/1.90 % prop_fast_solver_calls: 1482
% 1.64/1.90 % prop_num_of_clauses: 425
% 1.64/1.90 % prop_preprocess_simplified: 2020
% 1.64/1.90 % prop_fo_subsumed: 86
% 1.64/1.90 % prop_solver_time: 0.
% 1.64/1.90 % prop_fast_solver_time: 0.
% 1.64/1.90 % prop_unsat_core_time: 0.
% 1.64/1.90
% 1.64/1.90 % ------ QBF
% 1.64/1.90
% 1.64/1.90 % qbf_q_res: 0
% 1.64/1.90 % qbf_num_tautologies: 0
% 1.64/1.90 % qbf_prep_cycles: 0
% 1.64/1.90
% 1.64/1.90 % ------ BMC1
% 1.64/1.90
% 1.64/1.90 % bmc1_current_bound: -1
% 1.64/1.90 % bmc1_last_solved_bound: -1
% 1.64/1.90 % bmc1_unsat_core_size: -1
% 1.64/1.90 % bmc1_unsat_core_parents_size: -1
% 1.64/1.90 % bmc1_merge_next_fun: 0
% 1.64/1.90 % bmc1_unsat_core_clauses_time: 0.
% 1.64/1.90
% 1.64/1.90 % ------ Instantiation
% 1.64/1.90
% 1.64/1.90 % inst_num_of_clauses: 270
% 1.64/1.90 % inst_num_in_passive: 0
% 1.64/1.90 % inst_num_in_active: 270
% 1.64/1.90 % inst_num_in_unprocessed: 0
% 1.64/1.90 % inst_num_of_loops: 373
% 1.64/1.90 % inst_num_of_learning_restarts: 0
% 1.64/1.90 % inst_num_moves_active_passive: 87
% 1.64/1.90 % inst_lit_activity: 34
% 1.64/1.90 % inst_lit_activity_moves: 0
% 1.64/1.90 % inst_num_tautologies: 0
% 1.64/1.90 % inst_num_prop_implied: 0
% 1.64/1.90 % inst_num_existing_simplified: 0
% 1.64/1.90 % inst_num_eq_res_simplified: 0
% 1.64/1.90 % inst_num_child_elim: 0
% 1.64/1.90 % inst_num_of_dismatching_blockings: 0
% 1.64/1.90 % inst_num_of_non_proper_insts: 197
% 1.64/1.90 % inst_num_of_duplicates: 10
% 1.64/1.90 % inst_inst_num_from_inst_to_res: 0
% 1.64/1.90 % inst_dismatching_checking_time: 0.
% 1.64/1.90
% 1.64/1.90 % ------ Resolution
% 1.64/1.90
% 1.64/1.90 % res_num_of_clauses: 6741
% 1.64/1.90 % res_num_in_passive: 5927
% 1.64/1.90 % res_num_in_active: 1119
% 1.64/1.90 % res_num_of_loops: 2000
% 1.64/1.90 % res_forward_subset_subsumed: 1797
% 1.64/1.90 % res_backward_subset_subsumed: 343
% 1.64/1.90 % res_forward_subsumed: 770
% 1.64/1.90 % res_backward_subsumed: 72
% 1.64/1.90 % res_forward_subsumption_resolution: 337
% 1.64/1.90 % res_backward_subsumption_resolution: 27
% 1.64/1.90 % res_clause_to_clause_subsumption: 1206
% 1.64/1.90 % res_orphan_elimination: 0
% 1.64/1.90 % res_tautology_del: 2873
% 1.64/1.90 % res_num_eq_res_simplified: 0
% 1.64/1.90 % res_num_sel_changes: 0
% 1.64/1.90 % res_moves_from_active_to_pass: 0
% 1.64/1.90
% 1.64/1.90 % Status Unknown
% 1.64/1.90 % Last status :
% 1.64/1.90 % SZS status Unknown
%------------------------------------------------------------------------------