TSTP Solution File: SYN526+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN526+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:29:25 EDT 2022
% Result : Unknown 1.15s 1.36s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN526+1 : TPTP v8.1.0. Released v2.1.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 08:50:44 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.20/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.42 % FOF problem with conjecture
% 0.20/0.42 % 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/sandbox2/tmp/iprover_proof_d953d7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_313a82.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_2b128c | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.40/0.62 % --bmc1_dump_unsat_core_tptp false
% 0.40/0.62 % --bmc1_dump_file -
% 0.40/0.62 % --bmc1_ucm_expand_uc_limit 128
% 0.40/0.62 % --bmc1_ucm_n_expand_iterations 6
% 0.40/0.62 % --bmc1_ucm_extend_mode 1
% 0.40/0.62 % --bmc1_ucm_init_mode 2
% 0.40/0.62 % --bmc1_ucm_cone_mode none
% 0.40/0.62 % --bmc1_ucm_reduced_relation_type 0
% 0.40/0.62 % --bmc1_ucm_relax_model 4
% 0.40/0.62 % --bmc1_ucm_full_tr_after_sat true
% 0.40/0.62 % --bmc1_ucm_expand_neg_assumptions false
% 0.40/0.62 % --bmc1_ucm_layered_model none
% 0.40/0.62 % --bmc1_ucm_max_lemma_size 10
% 0.40/0.62
% 0.40/0.62 % ------ AIG Options
% 0.40/0.62
% 0.40/0.62 % --aig_mode false
% 0.40/0.62
% 0.40/0.62 % ------ Instantiation Options
% 0.40/0.62
% 0.40/0.62 % --instantiation_flag true
% 0.40/0.62 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.40/0.62 % --inst_solver_per_active 750
% 0.40/0.62 % --inst_solver_calls_frac 0.5
% 0.40/0.62 % --inst_passive_queue_type priority_queues
% 0.40/0.62 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.40/0.62 % --inst_passive_queues_freq [25;2]
% 0.40/0.62 % --inst_dismatching true
% 0.40/0.62 % --inst_eager_unprocessed_to_passive true
% 0.40/0.62 % --inst_prop_sim_given true
% 0.40/0.62 % --inst_prop_sim_new false
% 0.40/0.62 % --inst_orphan_elimination true
% 0.40/0.62 % --inst_learning_loop_flag true
% 0.40/0.62 % --inst_learning_start 3000
% 0.40/0.62 % --inst_learning_factor 2
% 0.40/0.62 % --inst_start_prop_sim_after_learn 3
% 0.40/0.62 % --inst_sel_renew solver
% 0.40/0.62 % --inst_lit_activity_flag true
% 0.40/0.62 % --inst_out_proof true
% 0.40/0.62
% 0.40/0.62 % ------ Resolution Options
% 0.40/0.62
% 0.40/0.62 % --resolution_flag true
% 0.40/0.62 % --res_lit_sel kbo_max
% 0.40/0.62 % --res_to_prop_solver none
% 0.40/0.62 % --res_prop_simpl_new false
% 0.40/0.62 % --res_prop_simpl_given false
% 0.40/0.62 % --res_passive_queue_type priority_queues
% 0.40/0.62 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.40/0.62 % --res_passive_queues_freq [15;5]
% 0.40/0.62 % --res_forward_subs full
% 0.40/0.62 % --res_backward_subs full
% 0.40/0.62 % --res_forward_subs_resolution true
% 0.40/0.62 % --res_backward_subs_resolution true
% 0.40/0.62 % --res_orphan_elimination false
% 0.40/0.62 % --res_time_limit 1000.
% 0.40/0.62 % --res_out_proof true
% 0.40/0.62 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_d953d7.s
% 0.40/0.62 % --modulo true
% 0.40/0.62
% 0.40/0.62 % ------ Combination Options
% 0.40/0.62
% 0.40/0.62 % --comb_res_mult 1000
% 0.40/0.62 % --comb_inst_mult 300
% 0.40/0.62 % ------
% 0.40/0.62
% 0.40/0.62 % ------ Parsing...% successful
% 0.40/0.62
% 0.40/0.62 % ------ Preprocessing... gs_s sp: 696 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:16:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.40/0.62
% 0.40/0.62 % ------ Proving...
% 0.40/0.62 % ------ Problem Properties
% 0.40/0.62
% 0.40/0.62 %
% 0.40/0.62 % EPR true
% 0.40/0.62 % Horn false
% 0.40/0.62 % Has equality false
% 0.40/0.62
% 0.40/0.62 % % ------ Input Options Time Limit: Unbounded
% 0.40/0.62
% 0.40/0.62
% 0.40/0.62 % % ------ Current options:
% 0.40/0.62
% 0.40/0.62 % ------ Input Options
% 0.40/0.62
% 0.40/0.62 % --out_options all
% 0.40/0.62 % --tptp_safe_out true
% 0.40/0.62 % --problem_path ""
% 0.40/0.62 % --include_path ""
% 0.40/0.62 % --clausifier .//eprover
% 0.40/0.62 % --clausifier_options --tstp-format
% 0.40/0.62 % --stdin false
% 0.40/0.62 % --dbg_backtrace false
% 0.40/0.62 % --dbg_dump_prop_clauses false
% 0.40/0.62 % --dbg_dump_prop_clauses_file -
% 0.40/0.62 % --dbg_out_stat false
% 0.40/0.62
% 0.40/0.62 % ------ General Options
% 0.40/0.62
% 0.40/0.62 % --fof false
% 0.40/0.62 % --time_out_real 150.
% 0.40/0.62 % --time_out_prep_mult 0.2
% 0.40/0.62 % --time_out_virtual -1.
% 0.40/0.62 % --schedule none
% 0.40/0.62 % --ground_splitting input
% 0.40/0.62 % --splitting_nvd 16
% 0.40/0.62 % --non_eq_to_eq false
% 0.40/0.62 % --prep_gs_sim true
% 0.40/0.62 % --prep_unflatten false
% 0.40/0.62 % --prep_res_sim true
% 0.40/0.62 % --prep_upred true
% 0.40/0.62 % --res_sim_input true
% 0.40/0.62 % --clause_weak_htbl true
% 0.40/0.62 % --gc_record_bc_elim false
% 0.40/0.62 % --symbol_type_check false
% 0.40/0.62 % --clausify_out false
% 0.40/0.62 % --large_theory_mode false
% 0.40/0.62 % --prep_sem_filter none
% 0.40/0.62 % --prep_sem_filter_out false
% 0.40/0.62 % --preprocessed_out false
% 0.40/0.62 % --sub_typing false
% 0.40/0.62 % --brand_transform false
% 0.40/0.62 % --pure_diseq_elim true
% 0.40/0.62 % --min_unsat_core false
% 0.40/0.62 % --pred_elim true
% 0.40/0.62 % --add_important_lit false
% 0.40/0.62 % --soft_assumptions false
% 0.40/0.62 % --reset_solvers false
% 0.40/0.62 % --bc_imp_inh []
% 0.40/0.62 % --conj_cone_tolerance 1.5
% 0.40/0.62 % --prolific_symb_bound 500
% 0.40/0.62 % --lt_threshold 2000
% 0.40/0.62
% 0.40/0.62 % ------ SAT Options
% 0.40/0.62
% 0.40/0.62 % --sat_mode false
% 0.40/0.62 % --sat_fm_restart_options ""
% 0.40/0.62 % --sat_gr_def false
% 0.40/0.62 % --sat_epr_types true
% 0.40/0.62 % --sat_non_cyclic_types false
% 0.40/0.62 % --sat_finite_models false
% 0.40/0.62 % --sat_fm_lemmas false
% 0.40/0.62 % --sat_fm_prep false
% 0.40/0.62 % --sat_fm_uc_incr true
% 0.40/0.62 % --sat_out_model small
% 0.40/0.62 % --sat_out_clauses false
% 0.40/0.62
% 0.40/0.62 % ------ QBF Options
% 0.40/0.62
% 0.40/0.62 % --qbf_mode false
% 0.40/0.62 % --qbf_elim_univ true
% 0.40/0.62 % --qbf_sk_in true
% 0.40/0.62 % --qbf_pred_elim true
% 0.40/0.62 % --qbf_split 32
% 0.40/0.62
% 0.40/0.62 % ------ BMC1 Options
% 0.40/0.62
% 0.40/0.62 % --bmc1_incremental false
% 0.40/0.62 % --bmc1_axioms reachable_all
% 0.40/0.62 % --bmc1_min_bound 0
% 0.40/0.62 % --bmc1_max_bound -1
% 0.40/0.62 % --bmc1_max_bound_default -1
% 0.40/0.62 % --bmc1_symbol_reachability true
% 0.40/0.62 % --bmc1_property_lemmas false
% 0.40/0.62 % --bmc1_k_induction false
% 0.40/0.62 % --bmc1_non_equiv_states false
% 0.40/0.62 % --bmc1_deadlock false
% 0.40/0.62 % --bmc1_ucm false
% 0.40/0.62 % --bmc1_add_unsat_core none
% 0.40/0.62 % --bmc1_unsat_core_children false
% 0.40/0.62 % --bmc1_unsat_core_extrapolate_axioms false
% 0.40/0.62 % --bmc1_out_stat full
% 0.40/0.62 % --bmc1_ground_init false
% 0.40/0.62 % --bmc1_pre_inst_next_state false
% 0.40/0.62 % --bmc1_pre_inst_state false
% 0.40/0.62 % --bmc1_pre_inst_reach_state false
% 0.40/0.62 % --bmc1_out_unsat_core false
% 0.40/0.62 % --bmc1_aig_witness_out false
% 0.40/0.62 % --bmc1_verbose false
% 0.40/0.62 % --bmc1_dump_clauses_tptp false
% 0.40/0.62 % --bmc1_dump_unsat_core_tptp false
% 0.40/0.62 % --bmc1_dump_file -
% 0.40/0.62 % --bmc1_ucm_expand_uc_limit 128
% 0.40/0.62 % --bmc1_ucm_n_expand_iterations 6
% 0.40/0.62 % --bmc1_ucm_extend_mode 1
% 0.40/0.62 % --bmc1_ucm_init_mode 2
% 0.40/0.62 % --bmc1_ucm_cone_mode none
% 0.40/0.62 % --bmc1_ucm_reduced_relation_type 0
% 0.40/0.62 % --bmc1_ucm_relax_model 4
% 0.40/0.62 % --bmc1_ucm_full_tr_after_sat true
% 0.40/0.62 % --bmc1_ucm_expand_neg_assumptions false
% 0.40/0.62 % --bmc1_ucm_layered_model none
% 0.40/0.62 % --bmc1_ucm_max_lemma_size 10
% 0.40/0.62
% 0.40/0.62 % ------ AIG Options
% 0.40/0.62
% 0.40/0.62 % --aig_mode false
% 0.40/0.62
% 0.40/0.62 % ------ Instantiation Options
% 0.40/0.62
% 0.40/0.62 % --instantiation_flag true
% 0.40/0.62 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.40/0.62 % --inst_solver_per_active 750
% 0.40/0.62 % --inst_solver_calls_frac 0.5
% 0.40/0.62 % --inst_passive_queue_type priority_queues
% 0.40/0.62 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.40/0.62 % --inst_passive_queues_freq [25;2]
% 0.40/0.62 % --inst_dismatching true
% 0.40/0.62 % --inst_eager_unprocessed_to_passive true
% 0.70/0.92 % --inst_prop_sim_given true
% 0.70/0.92 % --inst_prop_sim_new false
% 0.70/0.92 % --inst_orphan_elimination true
% 0.70/0.92 % --inst_learning_loop_flag true
% 0.70/0.92 % --inst_learning_start 3000
% 0.70/0.92 % --inst_learning_factor 2
% 0.70/0.92 % --inst_start_prop_sim_after_learn 3
% 0.70/0.92 % --inst_sel_renew solver
% 0.70/0.92 % --inst_lit_activity_flag true
% 0.70/0.92 % --inst_out_proof true
% 0.70/0.92
% 0.70/0.92 % ------ Resolution Options
% 0.70/0.92
% 0.70/0.92 % --resolution_flag true
% 0.70/0.92 % --res_lit_sel kbo_max
% 0.70/0.92 % --res_to_prop_solver none
% 0.70/0.92 % --res_prop_simpl_new false
% 0.70/0.92 % --res_prop_simpl_given false
% 0.70/0.92 % --res_passive_queue_type priority_queues
% 0.70/0.92 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.70/0.92 % --res_passive_queues_freq [15;5]
% 0.70/0.92 % --res_forward_subs full
% 0.70/0.92 % --res_backward_subs full
% 0.70/0.92 % --res_forward_subs_resolution true
% 0.70/0.92 % --res_backward_subs_resolution true
% 0.70/0.92 % --res_orphan_elimination false
% 0.70/0.92 % --res_time_limit 1000.
% 0.70/0.92 % --res_out_proof true
% 0.70/0.92 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_d953d7.s
% 0.70/0.92 % --modulo true
% 0.70/0.92
% 0.70/0.92 % ------ Combination Options
% 0.70/0.92
% 0.70/0.92 % --comb_res_mult 1000
% 0.70/0.92 % --comb_inst_mult 300
% 0.70/0.92 % ------
% 0.70/0.92
% 0.70/0.92
% 0.70/0.92
% 0.70/0.92 % ------ Proving...
% 0.70/0.92 % warning: shown sat in sat incomplete mode
% 0.70/0.92 %
% 0.70/0.92
% 0.70/0.92
% 0.70/0.92 ------ Building Model...Done
% 0.70/0.92
% 0.70/0.92 %------ The model is defined over ground terms (initial term algebra).
% 0.70/0.92 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 0.70/0.92 %------ where \phi is a formula over the term algebra.
% 0.70/0.92 %------ If we have equality in the problem then it is also defined as a predicate above,
% 0.70/0.92 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 0.70/0.92 %------ See help for --sat_out_model for different model outputs.
% 0.70/0.92 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 0.70/0.92 %------ where the first argument stands for the sort ($i in the unsorted case)
% 0.70/0.92
% 0.70/0.92
% 0.70/0.92
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of c5_1
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 (! [X0] :
% 0.70/0.92 ( c5_1(X0) <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of c2_2
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 (! [X0,X1] :
% 0.70/0.92 ( c2_2(X0,X1) <=>
% 0.70/0.92 (
% 0.70/0.92 (
% 0.70/0.92 ( X0=a248 & X1=a249 )
% 0.70/0.92 )
% 0.70/0.92
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of c2_1
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 (! [X0] :
% 0.70/0.92 ( c2_1(X0) <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Negative definition of c3_2
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 (! [X0,X1] :
% 0.70/0.92 ( ~(c3_2(X0,X1)) <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Negative definition of c4_2
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 (! [X0,X1] :
% 0.70/0.92 ( ~(c4_2(X0,X1)) <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of c4_0
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 ( c4_0 <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of c1_2
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 (! [X0,X1] :
% 0.70/0.92 ( c1_2(X0,X1) <=>
% 0.70/0.92 (
% 0.70/0.92 (
% 0.70/0.92 ( X0=a221 & X1=a222 )
% 0.70/0.92 )
% 0.70/0.92
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of c5_2
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 (! [X0,X1] :
% 0.70/0.92 ( c5_2(X0,X1) <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Negative definition of ndr1_1
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 (! [X0] :
% 0.70/0.92 ( ~(ndr1_1(X0)) <=>
% 0.70/0.92 (
% 0.70/0.92 (
% 0.70/0.92 ( X0=a245 )
% 0.70/0.92 )
% 0.70/0.92
% 0.70/0.92 |
% 0.70/0.92 (
% 0.70/0.92 ( X0=a247 )
% 0.70/0.92 )
% 0.70/0.92
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of ndr1_0
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 ( ndr1_0 <=>
% 0.70/0.92 $true
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Negative definition of c3_1
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 (! [X0] :
% 0.70/0.92 ( ~(c3_1(X0)) <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of epred1_0
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 ( epred1_0 <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of c3_0
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 ( c3_0 <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of c5_0
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 ( c5_0 <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of epred2_0
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 ( epred2_0 <=>
% 0.70/0.92 $true
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of c2_0
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 ( c2_0 <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of sP0_iProver_split
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 ( sP0_iProver_split <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of sP2_iProver_split
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 ( sP2_iProver_split <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of sP3_iProver_split
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 ( sP3_iProver_split <=>
% 0.70/0.92 $false
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of sP5_iProver_split
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.92 ( sP5_iProver_split <=>
% 0.70/0.92 $true
% 0.70/0.92 )
% 0.70/0.92 ).
% 0.70/0.92
% 0.70/0.92 %------ Positive definition of sP6_iProver_split
% 0.70/0.92 fof(lit_def,axiom,
% 0.70/0.93 ( sP6_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP9_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP9_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP11_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP11_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP12_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP12_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP13_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP13_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP17_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP17_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP18_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP18_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP19_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP19_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP20_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP20_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP22_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP22_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP23_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP23_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP26_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP26_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP34_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP34_iProver_split <=>
% 0.70/0.93 $true
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP37_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP37_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP39_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP39_iProver_split <=>
% 0.70/0.93 $true
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP40_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP40_iProver_split <=>
% 0.70/0.93 $true
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP41_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP41_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP42_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP42_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP43_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP43_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP44_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP44_iProver_split <=>
% 0.70/0.93 $true
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP45_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP45_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP46_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP46_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP48_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP48_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP52_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP52_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP53_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP53_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP54_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP54_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP55_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP55_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP56_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP56_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP57_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP57_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP58_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP58_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP59_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP59_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP60_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP60_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP61_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP61_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP62_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP62_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP63_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP63_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP64_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP64_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP65_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP65_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP66_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP66_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP67_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP67_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93 %------ Positive definition of sP68_iProver_split
% 0.70/0.93 fof(lit_def,axiom,
% 0.70/0.93 ( sP68_iProver_split <=>
% 0.70/0.93 $false
% 0.70/0.93 )
% 0.70/0.93 ).
% 0.70/0.93
% 0.70/0.93
% 0.70/0.93
% 0.70/0.93 % ------ Statistics
% 0.70/0.93
% 0.70/0.93 % ------ General
% 0.70/0.93
% 0.70/0.93 % num_of_input_clauses: 283
% 0.70/0.93 % num_of_input_neg_conjectures: 207
% 0.70/0.93 % num_of_splits: 696
% 0.70/0.93 % num_of_split_atoms: 69
% 0.70/0.93 % num_of_sem_filtered_clauses: 0
% 0.70/0.93 % num_of_subtypes: 0
% 0.70/0.93 % monotx_restored_types: 0
% 0.70/0.93 % sat_num_of_epr_types: 0
% 0.70/0.93 % sat_num_of_non_cyclic_types: 0
% 0.70/0.93 % sat_guarded_non_collapsed_types: 0
% 0.70/0.93 % is_epr: 1
% 0.70/0.93 % is_horn: 0
% 0.70/0.93 % has_eq: 0
% 0.70/0.93 % num_pure_diseq_elim: 0
% 0.70/0.93 % simp_replaced_by: 0
% 0.70/0.93 % res_preprocessed: 1078
% 0.70/0.93 % prep_upred: 0
% 0.70/0.93 % prep_unflattend: 0
% 0.70/0.93 % pred_elim_cands: 69
% 0.70/0.93 % pred_elim: 25
% 0.70/0.93 % pred_elim_cl: 40
% 0.70/0.93 % pred_elim_cycles: 69
% 0.70/0.93 % forced_gc_time: 0
% 0.70/0.93 % gc_basic_clause_elim: 0
% 0.70/0.93 % parsing_time: 0.015
% 0.70/0.93 % sem_filter_time: 0.
% 0.70/0.93 % pred_elim_time: 0.1
% 0.70/0.93 % out_proof_time: 0.
% 0.70/0.93 % monotx_time: 0.
% 0.70/0.93 % subtype_inf_time: 0.
% 0.70/0.93 % unif_index_cands_time: 0.
% 0.70/0.93 % unif_index_add_time: 0.001
% 0.70/0.93 % total_time: 0.501
% 0.70/0.93 % num_of_symbols: 146
% 0.70/0.93 % num_of_terms: 1130
% 0.70/0.93
% 0.70/0.93 % ------ Propositional Solver
% 0.70/0.93
% 0.70/0.93 % prop_solver_calls: 2
% 0.70/0.93 % prop_fast_solver_calls: 7941
% 0.70/0.93 % prop_num_of_clauses: 1349
% 0.70/0.93 % prop_preprocess_simplified: 7207
% 0.70/0.93 % prop_fo_subsumed: 383
% 0.70/0.93 % prop_solver_time: 0.
% 0.70/0.93 % prop_fast_solver_time: 0.008
% 0.70/0.93 % prop_unsat_core_time: 0.
% 0.70/0.93
% 0.70/0.93 % ------ QBF
% 0.70/0.93
% 0.70/0.93 % qbf_q_res: 0
% 0.70/0.93 % qbf_num_tautologies: 0
% 0.70/0.93 % qbf_prep_cycles: 0
% 0.70/0.93
% 0.70/0.93 % ------ BMC1
% 0.70/0.93
% 0.70/0.93 % bmc1_current_bound: -1
% 0.70/0.93 % bmc1_last_solved_bound: -1
% 0.70/0.93 % bmc1_unsat_core_size: -1
% 0.70/0.93 % bmc1_unsat_core_parents_size: -1
% 0.70/0.93 % bmc1_merge_next_fun: 0
% 0.70/0.93 % bmc1_unsat_core_clauses_time: 0.
% 0.70/0.93
% 0.70/0.93 % ------ Instantiation
% 0.70/0.93
% 0.70/0.93 % inst_num_of_clauses: 264
% 0.70/0.93 % inst_num_in_passive: 0
% 0.70/0.93 % inst_num_in_active: 264
% 0.70/0.93 % inst_num_in_unprocessed: 0
% 0.70/0.93 % inst_num_of_loops: 266
% 0.70/0.93 % inst_num_of_learning_restarts: 0
% 0.70/0.93 % inst_num_moves_active_passive: 0
% 0.70/0.93 % inst_lit_activity: 36
% 0.70/0.93 % inst_lit_activity_moves: 0
% 0.70/0.93 % inst_num_tautologies: 0
% 0.70/0.93 % inst_num_prop_implied: 0
% 0.70/0.93 % inst_num_existing_simplified: 0
% 0.70/0.93 % inst_num_eq_res_simplified: 0
% 0.70/0.93 % inst_num_child_elim: 0
% 0.70/0.93 % inst_num_of_dismatching_blockings: 0
% 0.70/0.93 % inst_num_of_non_proper_insts: 0
% 0.70/0.93 % inst_num_of_duplicates: 0
% 0.70/0.93 % inst_inst_num_from_inst_to_res: 0
% 0.70/0.93 % inst_dismatching_checking_time: 0.
% 0.70/0.93
% 0.70/0.93 % ------ Resolution
% 0.70/0.93
% 0.70/0.93 % res_num_of_clauses: 1200
% 0.70/0.93 % res_num_in_passive: 479
% 0.70/0.93 % res_num_in_active: 702
% 0.70/0.93 % res_num_of_loops: 1000
% 0.70/0.93 % res_forward_subset_subsumed: 392
% 0.70/0.93 % res_backward_subset_subsumed: 0
% 0.70/0.93 % res_forward_subsumed: 275
% 0.70/0.93 % res_backward_subsumed: 23
% 0.70/0.93 % res_forward_subsumption_resolution: 75
% 0.70/0.93 % res_backward_subsumption_resolution: 0
% 0.70/0.93 % res_clause_to_clause_subsumption: 688
% 0.70/0.93 % res_orphan_elimination: 0
% 0.70/0.93 % res_tautology_del: 515
% 0.70/0.93 % res_num_eq_res_simplified: 0
% 0.70/0.93 % res_num_sel_changes: 0
% 0.70/0.93 % res_moves_from_active_to_pass: 0
% 0.70/0.93
% 0.70/0.93 % Status Unknown
% 0.78/0.98 % Orienting using strategy ClausalAll
% 0.78/0.98 % FOF problem with conjecture
% 0.78/0.98 % 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/sandbox2/tmp/iprover_proof_d953d7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_313a82.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_1ad641 | grep -v "SZS"
% 0.78/1.00
% 0.78/1.00 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.78/1.00
% 0.78/1.00 %
% 0.78/1.00 % ------ iProver source info
% 0.78/1.00
% 0.78/1.00 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.78/1.00 % git: non_committed_changes: true
% 0.78/1.00 % git: last_make_outside_of_git: true
% 0.78/1.00
% 0.78/1.00 %
% 0.78/1.00 % ------ Input Options
% 0.78/1.00
% 0.78/1.00 % --out_options all
% 0.78/1.00 % --tptp_safe_out true
% 0.78/1.00 % --problem_path ""
% 0.78/1.00 % --include_path ""
% 0.78/1.00 % --clausifier .//eprover
% 0.78/1.00 % --clausifier_options --tstp-format
% 0.78/1.00 % --stdin false
% 0.78/1.00 % --dbg_backtrace false
% 0.78/1.00 % --dbg_dump_prop_clauses false
% 0.78/1.00 % --dbg_dump_prop_clauses_file -
% 0.78/1.00 % --dbg_out_stat false
% 0.78/1.00
% 0.78/1.00 % ------ General Options
% 0.78/1.00
% 0.78/1.00 % --fof false
% 0.78/1.00 % --time_out_real 150.
% 0.78/1.00 % --time_out_prep_mult 0.2
% 0.78/1.00 % --time_out_virtual -1.
% 0.78/1.00 % --schedule none
% 0.78/1.00 % --ground_splitting input
% 0.78/1.00 % --splitting_nvd 16
% 0.78/1.00 % --non_eq_to_eq false
% 0.78/1.00 % --prep_gs_sim true
% 0.78/1.00 % --prep_unflatten false
% 0.78/1.00 % --prep_res_sim true
% 0.78/1.00 % --prep_upred true
% 0.78/1.00 % --res_sim_input true
% 0.78/1.00 % --clause_weak_htbl true
% 0.78/1.00 % --gc_record_bc_elim false
% 0.78/1.00 % --symbol_type_check false
% 0.78/1.00 % --clausify_out false
% 0.78/1.00 % --large_theory_mode false
% 0.78/1.00 % --prep_sem_filter none
% 0.78/1.00 % --prep_sem_filter_out false
% 0.78/1.00 % --preprocessed_out false
% 0.78/1.00 % --sub_typing false
% 0.78/1.00 % --brand_transform false
% 0.78/1.00 % --pure_diseq_elim true
% 0.78/1.00 % --min_unsat_core false
% 0.78/1.00 % --pred_elim true
% 0.78/1.00 % --add_important_lit false
% 0.78/1.00 % --soft_assumptions false
% 0.78/1.00 % --reset_solvers false
% 0.78/1.00 % --bc_imp_inh []
% 0.78/1.00 % --conj_cone_tolerance 1.5
% 0.78/1.00 % --prolific_symb_bound 500
% 0.78/1.00 % --lt_threshold 2000
% 0.78/1.00
% 0.78/1.00 % ------ SAT Options
% 0.78/1.00
% 0.78/1.00 % --sat_mode false
% 0.78/1.00 % --sat_fm_restart_options ""
% 0.78/1.00 % --sat_gr_def false
% 0.78/1.00 % --sat_epr_types true
% 0.78/1.00 % --sat_non_cyclic_types false
% 0.78/1.00 % --sat_finite_models false
% 0.78/1.00 % --sat_fm_lemmas false
% 0.78/1.00 % --sat_fm_prep false
% 0.78/1.00 % --sat_fm_uc_incr true
% 0.78/1.00 % --sat_out_model small
% 0.78/1.00 % --sat_out_clauses false
% 0.78/1.00
% 0.78/1.00 % ------ QBF Options
% 0.78/1.00
% 0.78/1.00 % --qbf_mode false
% 0.78/1.00 % --qbf_elim_univ true
% 0.78/1.00 % --qbf_sk_in true
% 0.78/1.00 % --qbf_pred_elim true
% 0.78/1.00 % --qbf_split 32
% 0.78/1.00
% 0.78/1.00 % ------ BMC1 Options
% 0.78/1.00
% 0.78/1.00 % --bmc1_incremental false
% 0.78/1.00 % --bmc1_axioms reachable_all
% 0.78/1.00 % --bmc1_min_bound 0
% 0.78/1.00 % --bmc1_max_bound -1
% 0.78/1.00 % --bmc1_max_bound_default -1
% 0.78/1.00 % --bmc1_symbol_reachability true
% 0.78/1.00 % --bmc1_property_lemmas false
% 0.78/1.00 % --bmc1_k_induction false
% 0.78/1.00 % --bmc1_non_equiv_states false
% 0.78/1.00 % --bmc1_deadlock false
% 0.78/1.00 % --bmc1_ucm false
% 0.78/1.00 % --bmc1_add_unsat_core none
% 0.78/1.00 % --bmc1_unsat_core_children false
% 0.78/1.00 % --bmc1_unsat_core_extrapolate_axioms false
% 0.78/1.00 % --bmc1_out_stat full
% 0.78/1.00 % --bmc1_ground_init false
% 0.78/1.00 % --bmc1_pre_inst_next_state false
% 0.78/1.00 % --bmc1_pre_inst_state false
% 0.78/1.00 % --bmc1_pre_inst_reach_state false
% 0.78/1.00 % --bmc1_out_unsat_core false
% 0.78/1.00 % --bmc1_aig_witness_out false
% 0.78/1.00 % --bmc1_verbose false
% 0.78/1.00 % --bmc1_dump_clauses_tptp false
% 0.92/1.11 % --bmc1_dump_unsat_core_tptp false
% 0.92/1.11 % --bmc1_dump_file -
% 0.92/1.11 % --bmc1_ucm_expand_uc_limit 128
% 0.92/1.11 % --bmc1_ucm_n_expand_iterations 6
% 0.92/1.11 % --bmc1_ucm_extend_mode 1
% 0.92/1.11 % --bmc1_ucm_init_mode 2
% 0.92/1.11 % --bmc1_ucm_cone_mode none
% 0.92/1.11 % --bmc1_ucm_reduced_relation_type 0
% 0.92/1.11 % --bmc1_ucm_relax_model 4
% 0.92/1.11 % --bmc1_ucm_full_tr_after_sat true
% 0.92/1.11 % --bmc1_ucm_expand_neg_assumptions false
% 0.92/1.11 % --bmc1_ucm_layered_model none
% 0.92/1.11 % --bmc1_ucm_max_lemma_size 10
% 0.92/1.11
% 0.92/1.11 % ------ AIG Options
% 0.92/1.11
% 0.92/1.11 % --aig_mode false
% 0.92/1.11
% 0.92/1.11 % ------ Instantiation Options
% 0.92/1.11
% 0.92/1.11 % --instantiation_flag true
% 0.92/1.11 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.92/1.11 % --inst_solver_per_active 750
% 0.92/1.11 % --inst_solver_calls_frac 0.5
% 0.92/1.11 % --inst_passive_queue_type priority_queues
% 0.92/1.11 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.92/1.11 % --inst_passive_queues_freq [25;2]
% 0.92/1.11 % --inst_dismatching true
% 0.92/1.11 % --inst_eager_unprocessed_to_passive true
% 0.92/1.11 % --inst_prop_sim_given true
% 0.92/1.11 % --inst_prop_sim_new false
% 0.92/1.11 % --inst_orphan_elimination true
% 0.92/1.11 % --inst_learning_loop_flag true
% 0.92/1.11 % --inst_learning_start 3000
% 0.92/1.11 % --inst_learning_factor 2
% 0.92/1.11 % --inst_start_prop_sim_after_learn 3
% 0.92/1.11 % --inst_sel_renew solver
% 0.92/1.11 % --inst_lit_activity_flag true
% 0.92/1.11 % --inst_out_proof true
% 0.92/1.11
% 0.92/1.11 % ------ Resolution Options
% 0.92/1.11
% 0.92/1.11 % --resolution_flag true
% 0.92/1.11 % --res_lit_sel kbo_max
% 0.92/1.11 % --res_to_prop_solver none
% 0.92/1.11 % --res_prop_simpl_new false
% 0.92/1.11 % --res_prop_simpl_given false
% 0.92/1.11 % --res_passive_queue_type priority_queues
% 0.92/1.11 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.92/1.11 % --res_passive_queues_freq [15;5]
% 0.92/1.11 % --res_forward_subs full
% 0.92/1.11 % --res_backward_subs full
% 0.92/1.11 % --res_forward_subs_resolution true
% 0.92/1.11 % --res_backward_subs_resolution true
% 0.92/1.11 % --res_orphan_elimination false
% 0.92/1.11 % --res_time_limit 1000.
% 0.92/1.11 % --res_out_proof true
% 0.92/1.11 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_d953d7.s
% 0.92/1.11 % --modulo true
% 0.92/1.11
% 0.92/1.11 % ------ Combination Options
% 0.92/1.11
% 0.92/1.11 % --comb_res_mult 1000
% 0.92/1.11 % --comb_inst_mult 300
% 0.92/1.11 % ------
% 0.92/1.11
% 0.92/1.11 % ------ Parsing...% successful
% 0.92/1.11
% 0.92/1.11 % ------ Preprocessing... gs_s sp: 696 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:16:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.92/1.11
% 0.92/1.11 % ------ Proving...
% 0.92/1.11 % ------ Problem Properties
% 0.92/1.11
% 0.92/1.11 %
% 0.92/1.11 % EPR true
% 0.92/1.11 % Horn false
% 0.92/1.11 % Has equality false
% 0.92/1.11
% 0.92/1.11 % % ------ Input Options Time Limit: Unbounded
% 0.92/1.11
% 0.92/1.11
% 0.92/1.11 % % ------ Current options:
% 0.92/1.11
% 0.92/1.11 % ------ Input Options
% 0.92/1.11
% 0.92/1.11 % --out_options all
% 0.92/1.11 % --tptp_safe_out true
% 0.92/1.11 % --problem_path ""
% 0.92/1.11 % --include_path ""
% 0.92/1.11 % --clausifier .//eprover
% 0.92/1.11 % --clausifier_options --tstp-format
% 0.92/1.11 % --stdin false
% 0.92/1.11 % --dbg_backtrace false
% 0.92/1.11 % --dbg_dump_prop_clauses false
% 0.92/1.11 % --dbg_dump_prop_clauses_file -
% 0.92/1.11 % --dbg_out_stat false
% 0.92/1.11
% 0.92/1.11 % ------ General Options
% 0.92/1.11
% 0.92/1.11 % --fof false
% 0.92/1.11 % --time_out_real 150.
% 0.92/1.11 % --time_out_prep_mult 0.2
% 0.92/1.11 % --time_out_virtual -1.
% 0.92/1.11 % --schedule none
% 0.92/1.11 % --ground_splitting input
% 0.92/1.11 % --splitting_nvd 16
% 0.92/1.11 % --non_eq_to_eq false
% 0.92/1.11 % --prep_gs_sim true
% 0.92/1.11 % --prep_unflatten false
% 0.92/1.11 % --prep_res_sim true
% 0.92/1.11 % --prep_upred true
% 0.92/1.11 % --res_sim_input true
% 0.92/1.11 % --clause_weak_htbl true
% 0.92/1.11 % --gc_record_bc_elim false
% 0.92/1.11 % --symbol_type_check false
% 0.92/1.11 % --clausify_out false
% 0.92/1.11 % --large_theory_mode false
% 0.92/1.11 % --prep_sem_filter none
% 0.92/1.11 % --prep_sem_filter_out false
% 0.92/1.11 % --preprocessed_out false
% 0.92/1.11 % --sub_typing false
% 0.92/1.11 % --brand_transform false
% 0.92/1.11 % --pure_diseq_elim true
% 0.92/1.11 % --min_unsat_core false
% 0.92/1.11 % --pred_elim true
% 0.92/1.11 % --add_important_lit false
% 0.92/1.11 % --soft_assumptions false
% 0.92/1.11 % --reset_solvers false
% 0.92/1.11 % --bc_imp_inh []
% 0.92/1.11 % --conj_cone_tolerance 1.5
% 0.92/1.11 % --prolific_symb_bound 500
% 0.92/1.11 % --lt_threshold 2000
% 0.92/1.11
% 0.92/1.11 % ------ SAT Options
% 0.92/1.11
% 0.92/1.11 % --sat_mode false
% 0.92/1.11 % --sat_fm_restart_options ""
% 0.92/1.11 % --sat_gr_def false
% 0.92/1.11 % --sat_epr_types true
% 0.92/1.11 % --sat_non_cyclic_types false
% 0.92/1.11 % --sat_finite_models false
% 0.92/1.11 % --sat_fm_lemmas false
% 0.92/1.11 % --sat_fm_prep false
% 0.92/1.11 % --sat_fm_uc_incr true
% 0.92/1.11 % --sat_out_model small
% 0.92/1.11 % --sat_out_clauses false
% 0.92/1.11
% 0.92/1.11 % ------ QBF Options
% 0.92/1.11
% 0.92/1.11 % --qbf_mode false
% 0.92/1.11 % --qbf_elim_univ true
% 0.92/1.11 % --qbf_sk_in true
% 0.92/1.11 % --qbf_pred_elim true
% 0.92/1.11 % --qbf_split 32
% 0.92/1.11
% 0.92/1.11 % ------ BMC1 Options
% 0.92/1.11
% 0.92/1.11 % --bmc1_incremental false
% 0.92/1.11 % --bmc1_axioms reachable_all
% 0.92/1.11 % --bmc1_min_bound 0
% 0.92/1.11 % --bmc1_max_bound -1
% 0.92/1.11 % --bmc1_max_bound_default -1
% 0.92/1.11 % --bmc1_symbol_reachability true
% 0.92/1.11 % --bmc1_property_lemmas false
% 0.92/1.11 % --bmc1_k_induction false
% 0.92/1.11 % --bmc1_non_equiv_states false
% 0.92/1.11 % --bmc1_deadlock false
% 0.92/1.11 % --bmc1_ucm false
% 0.92/1.11 % --bmc1_add_unsat_core none
% 0.92/1.11 % --bmc1_unsat_core_children false
% 0.92/1.11 % --bmc1_unsat_core_extrapolate_axioms false
% 0.92/1.11 % --bmc1_out_stat full
% 0.92/1.11 % --bmc1_ground_init false
% 0.92/1.11 % --bmc1_pre_inst_next_state false
% 0.92/1.11 % --bmc1_pre_inst_state false
% 0.92/1.11 % --bmc1_pre_inst_reach_state false
% 0.92/1.11 % --bmc1_out_unsat_core false
% 0.92/1.11 % --bmc1_aig_witness_out false
% 0.92/1.11 % --bmc1_verbose false
% 0.92/1.11 % --bmc1_dump_clauses_tptp false
% 0.92/1.11 % --bmc1_dump_unsat_core_tptp false
% 0.92/1.11 % --bmc1_dump_file -
% 0.92/1.11 % --bmc1_ucm_expand_uc_limit 128
% 0.92/1.11 % --bmc1_ucm_n_expand_iterations 6
% 0.92/1.11 % --bmc1_ucm_extend_mode 1
% 0.92/1.11 % --bmc1_ucm_init_mode 2
% 0.92/1.11 % --bmc1_ucm_cone_mode none
% 0.92/1.11 % --bmc1_ucm_reduced_relation_type 0
% 0.92/1.11 % --bmc1_ucm_relax_model 4
% 0.92/1.11 % --bmc1_ucm_full_tr_after_sat true
% 0.92/1.11 % --bmc1_ucm_expand_neg_assumptions false
% 0.92/1.11 % --bmc1_ucm_layered_model none
% 0.92/1.11 % --bmc1_ucm_max_lemma_size 10
% 0.92/1.11
% 0.92/1.11 % ------ AIG Options
% 0.92/1.11
% 0.92/1.11 % --aig_mode false
% 0.92/1.11
% 0.92/1.11 % ------ Instantiation Options
% 0.92/1.11
% 0.92/1.11 % --instantiation_flag true
% 0.92/1.11 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.92/1.11 % --inst_solver_per_active 750
% 0.92/1.11 % --inst_solver_calls_frac 0.5
% 0.92/1.11 % --inst_passive_queue_type priority_queues
% 0.92/1.11 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.92/1.11 % --inst_passive_queues_freq [25;2]
% 0.92/1.11 % --inst_dismatching true
% 0.92/1.11 % --inst_eager_unprocessed_to_passive true
% 1.15/1.35 % --inst_prop_sim_given true
% 1.15/1.35 % --inst_prop_sim_new false
% 1.15/1.35 % --inst_orphan_elimination true
% 1.15/1.35 % --inst_learning_loop_flag true
% 1.15/1.35 % --inst_learning_start 3000
% 1.15/1.35 % --inst_learning_factor 2
% 1.15/1.35 % --inst_start_prop_sim_after_learn 3
% 1.15/1.35 % --inst_sel_renew solver
% 1.15/1.35 % --inst_lit_activity_flag true
% 1.15/1.35 % --inst_out_proof true
% 1.15/1.35
% 1.15/1.35 % ------ Resolution Options
% 1.15/1.35
% 1.15/1.35 % --resolution_flag true
% 1.15/1.35 % --res_lit_sel kbo_max
% 1.15/1.35 % --res_to_prop_solver none
% 1.15/1.35 % --res_prop_simpl_new false
% 1.15/1.35 % --res_prop_simpl_given false
% 1.15/1.35 % --res_passive_queue_type priority_queues
% 1.15/1.35 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.15/1.35 % --res_passive_queues_freq [15;5]
% 1.15/1.35 % --res_forward_subs full
% 1.15/1.35 % --res_backward_subs full
% 1.15/1.35 % --res_forward_subs_resolution true
% 1.15/1.35 % --res_backward_subs_resolution true
% 1.15/1.35 % --res_orphan_elimination false
% 1.15/1.35 % --res_time_limit 1000.
% 1.15/1.35 % --res_out_proof true
% 1.15/1.35 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_d953d7.s
% 1.15/1.35 % --modulo true
% 1.15/1.35
% 1.15/1.35 % ------ Combination Options
% 1.15/1.35
% 1.15/1.35 % --comb_res_mult 1000
% 1.15/1.35 % --comb_inst_mult 300
% 1.15/1.35 % ------
% 1.15/1.35
% 1.15/1.35
% 1.15/1.35
% 1.15/1.35 % ------ Proving...
% 1.15/1.35 % warning: shown sat in sat incomplete mode
% 1.15/1.35 %
% 1.15/1.35
% 1.15/1.35
% 1.15/1.35 ------ Building Model...Done
% 1.15/1.35
% 1.15/1.35 %------ The model is defined over ground terms (initial term algebra).
% 1.15/1.35 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.15/1.35 %------ where \phi is a formula over the term algebra.
% 1.15/1.35 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.15/1.35 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.15/1.35 %------ See help for --sat_out_model for different model outputs.
% 1.15/1.35 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.15/1.35 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.15/1.35
% 1.15/1.35
% 1.15/1.35
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of c5_1
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 (! [X0] :
% 1.15/1.35 ( c5_1(X0) <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of c2_2
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 (! [X0,X1] :
% 1.15/1.35 ( c2_2(X0,X1) <=>
% 1.15/1.35 (
% 1.15/1.35 (
% 1.15/1.35 ( X0=a248 & X1=a249 )
% 1.15/1.35 )
% 1.15/1.35
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of c2_1
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 (! [X0] :
% 1.15/1.35 ( c2_1(X0) <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Negative definition of c3_2
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 (! [X0,X1] :
% 1.15/1.35 ( ~(c3_2(X0,X1)) <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Negative definition of c4_2
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 (! [X0,X1] :
% 1.15/1.35 ( ~(c4_2(X0,X1)) <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of c4_0
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( c4_0 <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of c1_2
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 (! [X0,X1] :
% 1.15/1.35 ( c1_2(X0,X1) <=>
% 1.15/1.35 (
% 1.15/1.35 (
% 1.15/1.35 ( X0=a221 & X1=a222 )
% 1.15/1.35 )
% 1.15/1.35
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of c5_2
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 (! [X0,X1] :
% 1.15/1.35 ( c5_2(X0,X1) <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Negative definition of ndr1_1
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 (! [X0] :
% 1.15/1.35 ( ~(ndr1_1(X0)) <=>
% 1.15/1.35 (
% 1.15/1.35 (
% 1.15/1.35 ( X0=a245 )
% 1.15/1.35 )
% 1.15/1.35
% 1.15/1.35 |
% 1.15/1.35 (
% 1.15/1.35 ( X0=a247 )
% 1.15/1.35 )
% 1.15/1.35
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of ndr1_0
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( ndr1_0 <=>
% 1.15/1.35 $true
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Negative definition of c3_1
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 (! [X0] :
% 1.15/1.35 ( ~(c3_1(X0)) <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of epred1_0
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( epred1_0 <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of c3_0
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( c3_0 <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of c5_0
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( c5_0 <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of epred2_0
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( epred2_0 <=>
% 1.15/1.35 $true
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of c2_0
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( c2_0 <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP0_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP0_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP2_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP2_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP3_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP3_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP5_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP5_iProver_split <=>
% 1.15/1.35 $true
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP6_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP6_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP9_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP9_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP11_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP11_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP12_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP12_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP13_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP13_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP17_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP17_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP18_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP18_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP19_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP19_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP20_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP20_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP22_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP22_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP23_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP23_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP26_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP26_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP34_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP34_iProver_split <=>
% 1.15/1.35 $true
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP37_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP37_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP39_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP39_iProver_split <=>
% 1.15/1.35 $true
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP40_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP40_iProver_split <=>
% 1.15/1.35 $true
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP41_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP41_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP42_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP42_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP43_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP43_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP44_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP44_iProver_split <=>
% 1.15/1.35 $true
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP45_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP45_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP46_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP46_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP48_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP48_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP52_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP52_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP53_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP53_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP54_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP54_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP55_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP55_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP56_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP56_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP57_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP57_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP58_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP58_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP59_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP59_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP60_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP60_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP61_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP61_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP62_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP62_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP63_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP63_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP64_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP64_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP65_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP65_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP66_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP66_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP67_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP67_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35 %------ Positive definition of sP68_iProver_split
% 1.15/1.35 fof(lit_def,axiom,
% 1.15/1.35 ( sP68_iProver_split <=>
% 1.15/1.35 $false
% 1.15/1.35 )
% 1.15/1.35 ).
% 1.15/1.35
% 1.15/1.35
% 1.15/1.35
% 1.15/1.35 % ------ Statistics
% 1.15/1.35
% 1.15/1.35 % ------ General
% 1.15/1.35
% 1.15/1.35 % num_of_input_clauses: 283
% 1.15/1.35 % num_of_input_neg_conjectures: 207
% 1.15/1.35 % num_of_splits: 696
% 1.15/1.35 % num_of_split_atoms: 69
% 1.15/1.35 % num_of_sem_filtered_clauses: 0
% 1.15/1.35 % num_of_subtypes: 0
% 1.15/1.35 % monotx_restored_types: 0
% 1.15/1.35 % sat_num_of_epr_types: 0
% 1.15/1.35 % sat_num_of_non_cyclic_types: 0
% 1.15/1.35 % sat_guarded_non_collapsed_types: 0
% 1.15/1.35 % is_epr: 1
% 1.15/1.35 % is_horn: 0
% 1.15/1.35 % has_eq: 0
% 1.15/1.35 % num_pure_diseq_elim: 0
% 1.15/1.35 % simp_replaced_by: 0
% 1.15/1.35 % res_preprocessed: 1078
% 1.15/1.35 % prep_upred: 0
% 1.15/1.35 % prep_unflattend: 0
% 1.15/1.35 % pred_elim_cands: 69
% 1.15/1.35 % pred_elim: 25
% 1.15/1.35 % pred_elim_cl: 40
% 1.15/1.35 % pred_elim_cycles: 69
% 1.15/1.35 % forced_gc_time: 0
% 1.15/1.35 % gc_basic_clause_elim: 0
% 1.15/1.35 % parsing_time: 0.008
% 1.15/1.35 % sem_filter_time: 0.
% 1.15/1.35 % pred_elim_time: 0.071
% 1.15/1.35 % out_proof_time: 0.
% 1.15/1.35 % monotx_time: 0.
% 1.15/1.35 % subtype_inf_time: 0.
% 1.15/1.35 % unif_index_cands_time: 0.
% 1.15/1.35 % unif_index_add_time: 0.
% 1.15/1.35 % total_time: 0.364
% 1.15/1.35 % num_of_symbols: 146
% 1.15/1.35 % num_of_terms: 1130
% 1.15/1.35
% 1.15/1.35 % ------ Propositional Solver
% 1.15/1.35
% 1.15/1.35 % prop_solver_calls: 2
% 1.15/1.35 % prop_fast_solver_calls: 7941
% 1.15/1.35 % prop_num_of_clauses: 1349
% 1.15/1.35 % prop_preprocess_simplified: 7207
% 1.15/1.35 % prop_fo_subsumed: 383
% 1.15/1.35 % prop_solver_time: 0.
% 1.15/1.35 % prop_fast_solver_time: 0.004
% 1.15/1.35 % prop_unsat_core_time: 0.
% 1.15/1.35
% 1.15/1.35 % ------ QBF
% 1.15/1.35
% 1.15/1.35 % qbf_q_res: 0
% 1.15/1.35 % qbf_num_tautologies: 0
% 1.15/1.35 % qbf_prep_cycles: 0
% 1.15/1.35
% 1.15/1.35 % ------ BMC1
% 1.15/1.35
% 1.15/1.35 % bmc1_current_bound: -1
% 1.15/1.35 % bmc1_last_solved_bound: -1
% 1.15/1.35 % bmc1_unsat_core_size: -1
% 1.15/1.35 % bmc1_unsat_core_parents_size: -1
% 1.15/1.35 % bmc1_merge_next_fun: 0
% 1.15/1.35 % bmc1_unsat_core_clauses_time: 0.
% 1.15/1.35
% 1.15/1.35 % ------ Instantiation
% 1.15/1.35
% 1.15/1.35 % inst_num_of_clauses: 264
% 1.15/1.35 % inst_num_in_passive: 0
% 1.15/1.35 % inst_num_in_active: 264
% 1.15/1.35 % inst_num_in_unprocessed: 0
% 1.15/1.35 % inst_num_of_loops: 266
% 1.15/1.35 % inst_num_of_learning_restarts: 0
% 1.15/1.35 % inst_num_moves_active_passive: 0
% 1.15/1.35 % inst_lit_activity: 36
% 1.15/1.35 % inst_lit_activity_moves: 0
% 1.15/1.35 % inst_num_tautologies: 0
% 1.15/1.35 % inst_num_prop_implied: 0
% 1.15/1.35 % inst_num_existing_simplified: 0
% 1.15/1.35 % inst_num_eq_res_simplified: 0
% 1.15/1.35 % inst_num_child_elim: 0
% 1.15/1.35 % inst_num_of_dismatching_blockings: 0
% 1.15/1.35 % inst_num_of_non_proper_insts: 0
% 1.15/1.35 % inst_num_of_duplicates: 0
% 1.15/1.35 % inst_inst_num_from_inst_to_res: 0
% 1.15/1.35 % inst_dismatching_checking_time: 0.
% 1.15/1.35
% 1.15/1.35 % ------ Resolution
% 1.15/1.35
% 1.15/1.35 % res_num_of_clauses: 1200
% 1.15/1.35 % res_num_in_passive: 479
% 1.15/1.35 % res_num_in_active: 702
% 1.15/1.35 % res_num_of_loops: 1000
% 1.15/1.35 % res_forward_subset_subsumed: 392
% 1.15/1.35 % res_backward_subset_subsumed: 0
% 1.15/1.35 % res_forward_subsumed: 275
% 1.15/1.35 % res_backward_subsumed: 23
% 1.15/1.35 % res_forward_subsumption_resolution: 75
% 1.15/1.35 % res_backward_subsumption_resolution: 0
% 1.15/1.35 % res_clause_to_clause_subsumption: 688
% 1.15/1.35 % res_orphan_elimination: 0
% 1.15/1.35 % res_tautology_del: 515
% 1.15/1.35 % res_num_eq_res_simplified: 0
% 1.15/1.35 % res_num_sel_changes: 0
% 1.15/1.35 % res_moves_from_active_to_pass: 0
% 1.15/1.35
% 1.15/1.35 % Status Unknown
% 1.15/1.35 % Last status :
% 1.15/1.35 % SZS status Unknown
%------------------------------------------------------------------------------