TSTP Solution File: SYN522+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN522+1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n025.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:18 EDT 2022
% Result : Unknown 3.04s 3.25s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN522+1 : TPTP v8.1.0. Released v2.1.0.
% 0.03/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 15:36:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.19/0.44 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.44 % FOF problem with conjecture
% 0.19/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_8fb934.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_7c56a0.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_e50b1d | grep -v "SZS"
% 0.19/0.46
% 0.19/0.46 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.46
% 0.19/0.46 %
% 0.19/0.46 % ------ iProver source info
% 0.19/0.46
% 0.19/0.46 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.46 % git: non_committed_changes: true
% 0.19/0.46 % git: last_make_outside_of_git: true
% 0.19/0.46
% 0.19/0.46 %
% 0.19/0.46 % ------ Input Options
% 0.19/0.46
% 0.19/0.46 % --out_options all
% 0.19/0.46 % --tptp_safe_out true
% 0.19/0.46 % --problem_path ""
% 0.19/0.46 % --include_path ""
% 0.19/0.46 % --clausifier .//eprover
% 0.19/0.46 % --clausifier_options --tstp-format
% 0.19/0.46 % --stdin false
% 0.19/0.46 % --dbg_backtrace false
% 0.19/0.46 % --dbg_dump_prop_clauses false
% 0.19/0.46 % --dbg_dump_prop_clauses_file -
% 0.19/0.46 % --dbg_out_stat false
% 0.19/0.46
% 0.19/0.46 % ------ General Options
% 0.19/0.46
% 0.19/0.46 % --fof false
% 0.19/0.46 % --time_out_real 150.
% 0.19/0.46 % --time_out_prep_mult 0.2
% 0.19/0.46 % --time_out_virtual -1.
% 0.19/0.46 % --schedule none
% 0.19/0.46 % --ground_splitting input
% 0.19/0.46 % --splitting_nvd 16
% 0.19/0.46 % --non_eq_to_eq false
% 0.19/0.46 % --prep_gs_sim true
% 0.19/0.46 % --prep_unflatten false
% 0.19/0.46 % --prep_res_sim true
% 0.19/0.46 % --prep_upred true
% 0.19/0.46 % --res_sim_input true
% 0.19/0.46 % --clause_weak_htbl true
% 0.19/0.46 % --gc_record_bc_elim false
% 0.19/0.46 % --symbol_type_check false
% 0.19/0.46 % --clausify_out false
% 0.19/0.46 % --large_theory_mode false
% 0.19/0.46 % --prep_sem_filter none
% 0.19/0.46 % --prep_sem_filter_out false
% 0.19/0.46 % --preprocessed_out false
% 0.19/0.46 % --sub_typing false
% 0.19/0.46 % --brand_transform false
% 0.19/0.46 % --pure_diseq_elim true
% 0.19/0.46 % --min_unsat_core false
% 0.19/0.46 % --pred_elim true
% 0.19/0.46 % --add_important_lit false
% 0.19/0.46 % --soft_assumptions false
% 0.19/0.47 % --reset_solvers false
% 0.19/0.47 % --bc_imp_inh []
% 0.19/0.47 % --conj_cone_tolerance 1.5
% 0.19/0.47 % --prolific_symb_bound 500
% 0.19/0.47 % --lt_threshold 2000
% 0.19/0.47
% 0.19/0.47 % ------ SAT Options
% 0.19/0.47
% 0.19/0.47 % --sat_mode false
% 0.19/0.47 % --sat_fm_restart_options ""
% 0.19/0.47 % --sat_gr_def false
% 0.19/0.47 % --sat_epr_types true
% 0.19/0.47 % --sat_non_cyclic_types false
% 0.19/0.47 % --sat_finite_models false
% 0.19/0.47 % --sat_fm_lemmas false
% 0.19/0.47 % --sat_fm_prep false
% 0.19/0.47 % --sat_fm_uc_incr true
% 0.19/0.47 % --sat_out_model small
% 0.19/0.47 % --sat_out_clauses false
% 0.19/0.47
% 0.19/0.47 % ------ QBF Options
% 0.19/0.47
% 0.19/0.47 % --qbf_mode false
% 0.19/0.47 % --qbf_elim_univ true
% 0.19/0.47 % --qbf_sk_in true
% 0.19/0.47 % --qbf_pred_elim true
% 0.19/0.47 % --qbf_split 32
% 0.19/0.47
% 0.19/0.47 % ------ BMC1 Options
% 0.19/0.47
% 0.19/0.47 % --bmc1_incremental false
% 0.19/0.47 % --bmc1_axioms reachable_all
% 0.19/0.47 % --bmc1_min_bound 0
% 0.19/0.47 % --bmc1_max_bound -1
% 0.19/0.47 % --bmc1_max_bound_default -1
% 0.19/0.47 % --bmc1_symbol_reachability true
% 0.19/0.47 % --bmc1_property_lemmas false
% 0.19/0.47 % --bmc1_k_induction false
% 0.19/0.47 % --bmc1_non_equiv_states false
% 0.19/0.47 % --bmc1_deadlock false
% 0.19/0.47 % --bmc1_ucm false
% 0.19/0.47 % --bmc1_add_unsat_core none
% 0.19/0.47 % --bmc1_unsat_core_children false
% 0.19/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.47 % --bmc1_out_stat full
% 0.19/0.47 % --bmc1_ground_init false
% 0.19/0.47 % --bmc1_pre_inst_next_state false
% 0.19/0.47 % --bmc1_pre_inst_state false
% 0.19/0.47 % --bmc1_pre_inst_reach_state false
% 0.19/0.47 % --bmc1_out_unsat_core false
% 0.19/0.47 % --bmc1_aig_witness_out false
% 0.19/0.47 % --bmc1_verbose false
% 0.19/0.47 % --bmc1_dump_clauses_tptp false
% 0.54/0.76 % --bmc1_dump_unsat_core_tptp false
% 0.54/0.76 % --bmc1_dump_file -
% 0.54/0.76 % --bmc1_ucm_expand_uc_limit 128
% 0.54/0.76 % --bmc1_ucm_n_expand_iterations 6
% 0.54/0.76 % --bmc1_ucm_extend_mode 1
% 0.54/0.76 % --bmc1_ucm_init_mode 2
% 0.54/0.76 % --bmc1_ucm_cone_mode none
% 0.54/0.76 % --bmc1_ucm_reduced_relation_type 0
% 0.54/0.76 % --bmc1_ucm_relax_model 4
% 0.54/0.76 % --bmc1_ucm_full_tr_after_sat true
% 0.54/0.76 % --bmc1_ucm_expand_neg_assumptions false
% 0.54/0.76 % --bmc1_ucm_layered_model none
% 0.54/0.76 % --bmc1_ucm_max_lemma_size 10
% 0.54/0.76
% 0.54/0.76 % ------ AIG Options
% 0.54/0.76
% 0.54/0.76 % --aig_mode false
% 0.54/0.76
% 0.54/0.76 % ------ Instantiation Options
% 0.54/0.76
% 0.54/0.76 % --instantiation_flag true
% 0.54/0.76 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.54/0.76 % --inst_solver_per_active 750
% 0.54/0.76 % --inst_solver_calls_frac 0.5
% 0.54/0.76 % --inst_passive_queue_type priority_queues
% 0.54/0.76 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.54/0.76 % --inst_passive_queues_freq [25;2]
% 0.54/0.76 % --inst_dismatching true
% 0.54/0.76 % --inst_eager_unprocessed_to_passive true
% 0.54/0.76 % --inst_prop_sim_given true
% 0.54/0.76 % --inst_prop_sim_new false
% 0.54/0.76 % --inst_orphan_elimination true
% 0.54/0.76 % --inst_learning_loop_flag true
% 0.54/0.76 % --inst_learning_start 3000
% 0.54/0.76 % --inst_learning_factor 2
% 0.54/0.76 % --inst_start_prop_sim_after_learn 3
% 0.54/0.76 % --inst_sel_renew solver
% 0.54/0.76 % --inst_lit_activity_flag true
% 0.54/0.76 % --inst_out_proof true
% 0.54/0.76
% 0.54/0.76 % ------ Resolution Options
% 0.54/0.76
% 0.54/0.76 % --resolution_flag true
% 0.54/0.76 % --res_lit_sel kbo_max
% 0.54/0.76 % --res_to_prop_solver none
% 0.54/0.76 % --res_prop_simpl_new false
% 0.54/0.76 % --res_prop_simpl_given false
% 0.54/0.76 % --res_passive_queue_type priority_queues
% 0.54/0.76 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.54/0.76 % --res_passive_queues_freq [15;5]
% 0.54/0.76 % --res_forward_subs full
% 0.54/0.76 % --res_backward_subs full
% 0.54/0.76 % --res_forward_subs_resolution true
% 0.54/0.76 % --res_backward_subs_resolution true
% 0.54/0.76 % --res_orphan_elimination false
% 0.54/0.76 % --res_time_limit 1000.
% 0.54/0.76 % --res_out_proof true
% 0.54/0.76 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8fb934.s
% 0.54/0.76 % --modulo true
% 0.54/0.76
% 0.54/0.76 % ------ Combination Options
% 0.54/0.76
% 0.54/0.76 % --comb_res_mult 1000
% 0.54/0.76 % --comb_inst_mult 300
% 0.54/0.76 % ------
% 0.54/0.76
% 0.54/0.76 % ------ Parsing...% successful
% 0.54/0.76
% 0.54/0.76 % ------ Preprocessing... gs_s sp: 1298 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:32:0s pe:64:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.54/0.76
% 0.54/0.76 % ------ Proving...
% 0.54/0.76 % ------ Problem Properties
% 0.54/0.76
% 0.54/0.76 %
% 0.54/0.76 % EPR true
% 0.54/0.76 % Horn false
% 0.54/0.76 % Has equality false
% 0.54/0.76
% 0.54/0.76 % % ------ Input Options Time Limit: Unbounded
% 0.54/0.76
% 0.54/0.76
% 0.54/0.76 % % ------ Current options:
% 0.54/0.76
% 0.54/0.76 % ------ Input Options
% 0.54/0.76
% 0.54/0.76 % --out_options all
% 0.54/0.76 % --tptp_safe_out true
% 0.54/0.76 % --problem_path ""
% 0.54/0.76 % --include_path ""
% 0.54/0.76 % --clausifier .//eprover
% 0.54/0.76 % --clausifier_options --tstp-format
% 0.54/0.76 % --stdin false
% 0.54/0.76 % --dbg_backtrace false
% 0.54/0.76 % --dbg_dump_prop_clauses false
% 0.54/0.76 % --dbg_dump_prop_clauses_file -
% 0.54/0.76 % --dbg_out_stat false
% 0.54/0.76
% 0.54/0.76 % ------ General Options
% 0.54/0.76
% 0.54/0.76 % --fof false
% 0.54/0.76 % --time_out_real 150.
% 0.54/0.76 % --time_out_prep_mult 0.2
% 0.54/0.76 % --time_out_virtual -1.
% 0.54/0.76 % --schedule none
% 0.54/0.76 % --ground_splitting input
% 0.54/0.76 % --splitting_nvd 16
% 0.54/0.76 % --non_eq_to_eq false
% 0.54/0.76 % --prep_gs_sim true
% 0.54/0.76 % --prep_unflatten false
% 0.54/0.76 % --prep_res_sim true
% 0.54/0.76 % --prep_upred true
% 0.54/0.76 % --res_sim_input true
% 0.54/0.76 % --clause_weak_htbl true
% 0.54/0.76 % --gc_record_bc_elim false
% 0.54/0.76 % --symbol_type_check false
% 0.54/0.76 % --clausify_out false
% 0.54/0.76 % --large_theory_mode false
% 0.54/0.76 % --prep_sem_filter none
% 0.54/0.76 % --prep_sem_filter_out false
% 0.54/0.76 % --preprocessed_out false
% 0.54/0.76 % --sub_typing false
% 0.54/0.76 % --brand_transform false
% 0.54/0.76 % --pure_diseq_elim true
% 0.54/0.76 % --min_unsat_core false
% 0.54/0.76 % --pred_elim true
% 0.54/0.76 % --add_important_lit false
% 0.54/0.76 % --soft_assumptions false
% 0.54/0.76 % --reset_solvers false
% 0.54/0.76 % --bc_imp_inh []
% 0.54/0.76 % --conj_cone_tolerance 1.5
% 0.54/0.76 % --prolific_symb_bound 500
% 0.54/0.76 % --lt_threshold 2000
% 0.54/0.76
% 0.54/0.76 % ------ SAT Options
% 0.54/0.76
% 0.54/0.76 % --sat_mode false
% 0.54/0.76 % --sat_fm_restart_options ""
% 0.54/0.76 % --sat_gr_def false
% 0.54/0.76 % --sat_epr_types true
% 0.54/0.76 % --sat_non_cyclic_types false
% 0.54/0.76 % --sat_finite_models false
% 0.54/0.76 % --sat_fm_lemmas false
% 0.54/0.76 % --sat_fm_prep false
% 0.54/0.76 % --sat_fm_uc_incr true
% 0.54/0.76 % --sat_out_model small
% 0.54/0.76 % --sat_out_clauses false
% 0.54/0.76
% 0.54/0.76 % ------ QBF Options
% 0.54/0.76
% 0.54/0.76 % --qbf_mode false
% 0.54/0.76 % --qbf_elim_univ true
% 0.54/0.76 % --qbf_sk_in true
% 0.54/0.76 % --qbf_pred_elim true
% 0.54/0.76 % --qbf_split 32
% 0.54/0.76
% 0.54/0.76 % ------ BMC1 Options
% 0.54/0.76
% 0.54/0.76 % --bmc1_incremental false
% 0.54/0.76 % --bmc1_axioms reachable_all
% 0.54/0.76 % --bmc1_min_bound 0
% 0.54/0.76 % --bmc1_max_bound -1
% 0.54/0.76 % --bmc1_max_bound_default -1
% 0.54/0.76 % --bmc1_symbol_reachability true
% 0.54/0.76 % --bmc1_property_lemmas false
% 0.54/0.76 % --bmc1_k_induction false
% 0.54/0.76 % --bmc1_non_equiv_states false
% 0.54/0.76 % --bmc1_deadlock false
% 0.54/0.76 % --bmc1_ucm false
% 0.54/0.76 % --bmc1_add_unsat_core none
% 0.54/0.76 % --bmc1_unsat_core_children false
% 0.54/0.76 % --bmc1_unsat_core_extrapolate_axioms false
% 0.54/0.76 % --bmc1_out_stat full
% 0.54/0.76 % --bmc1_ground_init false
% 0.54/0.76 % --bmc1_pre_inst_next_state false
% 0.54/0.76 % --bmc1_pre_inst_state false
% 0.54/0.76 % --bmc1_pre_inst_reach_state false
% 0.54/0.76 % --bmc1_out_unsat_core false
% 0.54/0.76 % --bmc1_aig_witness_out false
% 0.54/0.76 % --bmc1_verbose false
% 0.54/0.76 % --bmc1_dump_clauses_tptp false
% 0.54/0.76 % --bmc1_dump_unsat_core_tptp false
% 0.54/0.76 % --bmc1_dump_file -
% 0.54/0.76 % --bmc1_ucm_expand_uc_limit 128
% 0.54/0.76 % --bmc1_ucm_n_expand_iterations 6
% 0.54/0.76 % --bmc1_ucm_extend_mode 1
% 0.54/0.76 % --bmc1_ucm_init_mode 2
% 0.54/0.76 % --bmc1_ucm_cone_mode none
% 0.54/0.76 % --bmc1_ucm_reduced_relation_type 0
% 0.54/0.76 % --bmc1_ucm_relax_model 4
% 0.54/0.76 % --bmc1_ucm_full_tr_after_sat true
% 0.54/0.76 % --bmc1_ucm_expand_neg_assumptions false
% 0.54/0.76 % --bmc1_ucm_layered_model none
% 0.54/0.76 % --bmc1_ucm_max_lemma_size 10
% 0.54/0.76
% 0.54/0.76 % ------ AIG Options
% 0.54/0.76
% 0.54/0.76 % --aig_mode false
% 0.54/0.76
% 0.54/0.76 % ------ Instantiation Options
% 0.54/0.76
% 0.54/0.76 % --instantiation_flag true
% 0.54/0.76 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.54/0.76 % --inst_solver_per_active 750
% 0.54/0.76 % --inst_solver_calls_frac 0.5
% 0.54/0.76 % --inst_passive_queue_type priority_queues
% 0.54/0.76 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.54/0.76 % --inst_passive_queues_freq [25;2]
% 0.54/0.76 % --inst_dismatching true
% 0.54/0.76 % --inst_eager_unprocessed_to_passive true
% 1.65/1.88 % --inst_prop_sim_given true
% 1.65/1.88 % --inst_prop_sim_new false
% 1.65/1.88 % --inst_orphan_elimination true
% 1.65/1.88 % --inst_learning_loop_flag true
% 1.65/1.88 % --inst_learning_start 3000
% 1.65/1.88 % --inst_learning_factor 2
% 1.65/1.88 % --inst_start_prop_sim_after_learn 3
% 1.65/1.88 % --inst_sel_renew solver
% 1.65/1.88 % --inst_lit_activity_flag true
% 1.65/1.88 % --inst_out_proof true
% 1.65/1.88
% 1.65/1.88 % ------ Resolution Options
% 1.65/1.88
% 1.65/1.88 % --resolution_flag true
% 1.65/1.88 % --res_lit_sel kbo_max
% 1.65/1.88 % --res_to_prop_solver none
% 1.65/1.88 % --res_prop_simpl_new false
% 1.65/1.88 % --res_prop_simpl_given false
% 1.65/1.88 % --res_passive_queue_type priority_queues
% 1.65/1.88 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.65/1.88 % --res_passive_queues_freq [15;5]
% 1.65/1.88 % --res_forward_subs full
% 1.65/1.88 % --res_backward_subs full
% 1.65/1.88 % --res_forward_subs_resolution true
% 1.65/1.88 % --res_backward_subs_resolution true
% 1.65/1.88 % --res_orphan_elimination false
% 1.65/1.88 % --res_time_limit 1000.
% 1.65/1.88 % --res_out_proof true
% 1.65/1.88 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8fb934.s
% 1.65/1.88 % --modulo true
% 1.65/1.88
% 1.65/1.88 % ------ Combination Options
% 1.65/1.88
% 1.65/1.88 % --comb_res_mult 1000
% 1.65/1.88 % --comb_inst_mult 300
% 1.65/1.88 % ------
% 1.65/1.88
% 1.65/1.88
% 1.65/1.88
% 1.65/1.88 % ------ Proving...
% 1.65/1.88 % warning: shown sat in sat incomplete mode
% 1.65/1.88 %
% 1.65/1.88
% 1.65/1.88
% 1.65/1.88 ------ Building Model...Done
% 1.65/1.88
% 1.65/1.88 %------ The model is defined over ground terms (initial term algebra).
% 1.65/1.88 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.65/1.88 %------ where \phi is a formula over the term algebra.
% 1.65/1.88 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.65/1.88 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.65/1.88 %------ See help for --sat_out_model for different model outputs.
% 1.65/1.88 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.65/1.88 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.65/1.88
% 1.65/1.88
% 1.65/1.88
% 1.65/1.88
% 1.65/1.88 %------ Negative definition of c2_2
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 (! [X0,X1] :
% 1.65/1.88 ( ~(c2_2(X0,X1)) <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Negative definition of c1_2
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 (! [X0,X1] :
% 1.65/1.88 ( ~(c1_2(X0,X1)) <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Negative definition of c4_2
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 (! [X0,X1] :
% 1.65/1.88 ( ~(c4_2(X0,X1)) <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of ndr1_0
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( ndr1_0 <=>
% 1.65/1.88 $true
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of ndr1_1
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 (! [X0] :
% 1.65/1.88 ( ndr1_1(X0) <=>
% 1.65/1.88 (
% 1.65/1.88 (
% 1.65/1.88 ( X0=a106 )
% 1.65/1.88 )
% 1.65/1.88
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of c5_1
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 (! [X0] :
% 1.65/1.88 ( c5_1(X0) <=>
% 1.65/1.88 (
% 1.65/1.88 (
% 1.65/1.88 ( X0=a118 )
% 1.65/1.88 )
% 1.65/1.88
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of c1_1
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 (! [X0] :
% 1.65/1.88 ( c1_1(X0) <=>
% 1.65/1.88 (
% 1.65/1.88 (
% 1.65/1.88 ( X0=a118 )
% 1.65/1.88 )
% 1.65/1.88
% 1.65/1.88 |
% 1.65/1.88 (
% 1.65/1.88 ( X0=a137 )
% 1.65/1.88 )
% 1.65/1.88
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Negative definition of c3_1
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 (! [X0] :
% 1.65/1.88 ( ~(c3_1(X0)) <=>
% 1.65/1.88 (
% 1.65/1.88 (
% 1.65/1.88 ( X0=a110 )
% 1.65/1.88 )
% 1.65/1.88
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Negative definition of c4_1
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 (! [X0] :
% 1.65/1.88 ( ~(c4_1(X0)) <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of c1_0
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( c1_0 <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of epred2_0
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( epred2_0 <=>
% 1.65/1.88 $true
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of c3_0
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( c3_0 <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of c4_0
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( c4_0 <=>
% 1.65/1.88 $true
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of c2_0
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( c2_0 <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of c2_1
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 (! [X0] :
% 1.65/1.88 ( c2_1(X0) <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of epred1_0
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( epred1_0 <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP1_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP1_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP17_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP17_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP18_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP18_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP19_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP19_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP20_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP20_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP21_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP21_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP22_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP22_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP37_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP37_iProver_split <=>
% 1.65/1.88 $true
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP45_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP45_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP46_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP46_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP50_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP50_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP51_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP51_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP52_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP52_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP53_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP53_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP54_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP54_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP55_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP55_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP56_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP56_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP57_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP57_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP58_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP58_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP59_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP59_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP60_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP60_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP61_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP61_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP62_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP62_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP63_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP63_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP74_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP74_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88 %------ Positive definition of sP129_iProver_split
% 1.65/1.88 fof(lit_def,axiom,
% 1.65/1.88 ( sP129_iProver_split <=>
% 1.65/1.88 $false
% 1.65/1.88 )
% 1.65/1.88 ).
% 1.65/1.88
% 1.65/1.88
% 1.65/1.88
% 1.65/1.88 % ------ Statistics
% 1.65/1.88
% 1.65/1.88 % ------ General
% 1.65/1.88
% 1.65/1.88 % num_of_input_clauses: 638
% 1.65/1.88 % num_of_input_neg_conjectures: 546
% 1.65/1.88 % num_of_splits: 1298
% 1.65/1.88 % num_of_split_atoms: 130
% 1.65/1.88 % num_of_sem_filtered_clauses: 0
% 1.65/1.88 % num_of_subtypes: 0
% 1.65/1.88 % monotx_restored_types: 0
% 1.65/1.88 % sat_num_of_epr_types: 0
% 1.65/1.88 % sat_num_of_non_cyclic_types: 0
% 1.65/1.88 % sat_guarded_non_collapsed_types: 0
% 1.65/1.88 % is_epr: 1
% 1.65/1.88 % is_horn: 0
% 1.65/1.88 % has_eq: 0
% 1.65/1.88 % num_pure_diseq_elim: 0
% 1.65/1.88 % simp_replaced_by: 0
% 1.65/1.88 % res_preprocessed: 1796
% 1.65/1.88 % prep_upred: 0
% 1.65/1.88 % prep_unflattend: 0
% 1.65/1.88 % pred_elim_cands: 130
% 1.65/1.88 % pred_elim: 104
% 1.65/1.88 % pred_elim_cl: 256
% 1.65/1.88 % pred_elim_cycles: 130
% 1.65/1.88 % forced_gc_time: 0
% 1.65/1.88 % gc_basic_clause_elim: 0
% 1.65/1.88 % parsing_time: 0.037
% 1.65/1.88 % sem_filter_time: 0.
% 1.65/1.88 % pred_elim_time: 0.158
% 1.65/1.88 % out_proof_time: 0.
% 1.65/1.88 % monotx_time: 0.
% 1.65/1.88 % subtype_inf_time: 0.
% 1.65/1.88 % unif_index_cands_time: 0.001
% 1.65/1.88 % unif_index_add_time: 0.001
% 1.65/1.88 % total_time: 1.432
% 1.65/1.88 % num_of_symbols: 211
% 1.65/1.88 % num_of_terms: 1218
% 1.65/1.88
% 1.65/1.88 % ------ Propositional Solver
% 1.65/1.88
% 1.65/1.88 % prop_solver_calls: 4
% 1.65/1.88 % prop_fast_solver_calls: 14637
% 1.65/1.88 % prop_num_of_clauses: 2076
% 1.65/1.88 % prop_preprocess_simplified: 11820
% 1.65/1.88 % prop_fo_subsumed: 931
% 1.65/1.88 % prop_solver_time: 0.
% 1.65/1.88 % prop_fast_solver_time: 0.013
% 1.65/1.88 % prop_unsat_core_time: 0.
% 1.65/1.88
% 1.65/1.88 % ------ QBF
% 1.65/1.88
% 1.65/1.88 % qbf_q_res: 0
% 1.65/1.88 % qbf_num_tautologies: 0
% 1.65/1.88 % qbf_prep_cycles: 0
% 1.65/1.88
% 1.65/1.88 % ------ BMC1
% 1.65/1.88
% 1.65/1.88 % bmc1_current_bound: -1
% 1.65/1.88 % bmc1_last_solved_bound: -1
% 1.65/1.88 % bmc1_unsat_core_size: -1
% 1.65/1.88 % bmc1_unsat_core_parents_size: -1
% 1.65/1.88 % bmc1_merge_next_fun: 0
% 1.65/1.88 % bmc1_unsat_core_clauses_time: 0.
% 1.65/1.88
% 1.65/1.88 % ------ Instantiation
% 1.65/1.88
% 1.65/1.88 % inst_num_of_clauses: 301
% 1.65/1.88 % inst_num_in_passive: 0
% 1.65/1.88 % inst_num_in_active: 301
% 1.65/1.88 % inst_num_in_unprocessed: 0
% 1.65/1.88 % inst_num_of_loops: 360
% 1.65/1.88 % inst_num_of_learning_restarts: 0
% 1.65/1.88 % inst_num_moves_active_passive: 55
% 1.65/1.88 % inst_lit_activity: 47
% 1.65/1.88 % inst_lit_activity_moves: 0
% 1.65/1.88 % inst_num_tautologies: 0
% 1.65/1.88 % inst_num_prop_implied: 0
% 1.65/1.88 % inst_num_existing_simplified: 0
% 1.65/1.88 % inst_num_eq_res_simplified: 0
% 1.65/1.88 % inst_num_child_elim: 0
% 1.65/1.88 % inst_num_of_dismatching_blockings: 0
% 1.65/1.88 % inst_num_of_non_proper_insts: 28
% 1.65/1.88 % inst_num_of_duplicates: 0
% 1.65/1.88 % inst_inst_num_from_inst_to_res: 0
% 1.65/1.88 % inst_dismatching_checking_time: 0.
% 1.65/1.88
% 1.65/1.88 % ------ Resolution
% 1.65/1.88
% 1.65/1.88 % res_num_of_clauses: 5294
% 1.65/1.88 % res_num_in_passive: 4149
% 1.65/1.88 % res_num_in_active: 1143
% 1.65/1.88 % res_num_of_loops: 2000
% 1.65/1.88 % res_forward_subset_subsumed: 1052
% 1.65/1.88 % res_backward_subset_subsumed: 0
% 1.65/1.88 % res_forward_subsumed: 845
% 1.65/1.88 % res_backward_subsumed: 3
% 1.65/1.88 % res_forward_subsumption_resolution: 693
% 1.65/1.88 % res_backward_subsumption_resolution: 8
% 1.65/1.88 % res_clause_to_clause_subsumption: 7299
% 1.65/1.88 % res_orphan_elimination: 0
% 1.65/1.88 % res_tautology_del: 1791
% 1.65/1.88 % res_num_eq_res_simplified: 0
% 1.65/1.88 % res_num_sel_changes: 0
% 1.65/1.88 % res_moves_from_active_to_pass: 0
% 1.65/1.88
% 1.65/1.88 % Status Unknown
% 1.73/1.97 % Orienting using strategy ClausalAll
% 1.73/1.97 % FOF problem with conjecture
% 1.73/1.97 % 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_8fb934.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_7c56a0.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_9cf644 | grep -v "SZS"
% 1.82/1.98
% 1.82/1.98 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.82/1.98
% 1.82/1.98 %
% 1.82/1.98 % ------ iProver source info
% 1.82/1.98
% 1.82/1.98 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.82/1.98 % git: non_committed_changes: true
% 1.82/1.98 % git: last_make_outside_of_git: true
% 1.82/1.98
% 1.82/1.98 %
% 1.82/1.98 % ------ Input Options
% 1.82/1.98
% 1.82/1.98 % --out_options all
% 1.82/1.98 % --tptp_safe_out true
% 1.82/1.98 % --problem_path ""
% 1.82/1.98 % --include_path ""
% 1.82/1.98 % --clausifier .//eprover
% 1.82/1.98 % --clausifier_options --tstp-format
% 1.82/1.98 % --stdin false
% 1.82/1.98 % --dbg_backtrace false
% 1.82/1.98 % --dbg_dump_prop_clauses false
% 1.82/1.98 % --dbg_dump_prop_clauses_file -
% 1.82/1.98 % --dbg_out_stat false
% 1.82/1.98
% 1.82/1.98 % ------ General Options
% 1.82/1.98
% 1.82/1.98 % --fof false
% 1.82/1.98 % --time_out_real 150.
% 1.82/1.98 % --time_out_prep_mult 0.2
% 1.82/1.98 % --time_out_virtual -1.
% 1.82/1.98 % --schedule none
% 1.82/1.98 % --ground_splitting input
% 1.82/1.98 % --splitting_nvd 16
% 1.82/1.98 % --non_eq_to_eq false
% 1.82/1.98 % --prep_gs_sim true
% 1.82/1.98 % --prep_unflatten false
% 1.82/1.98 % --prep_res_sim true
% 1.82/1.98 % --prep_upred true
% 1.82/1.98 % --res_sim_input true
% 1.82/1.98 % --clause_weak_htbl true
% 1.82/1.98 % --gc_record_bc_elim false
% 1.82/1.98 % --symbol_type_check false
% 1.82/1.98 % --clausify_out false
% 1.82/1.98 % --large_theory_mode false
% 1.82/1.98 % --prep_sem_filter none
% 1.82/1.98 % --prep_sem_filter_out false
% 1.82/1.98 % --preprocessed_out false
% 1.82/1.98 % --sub_typing false
% 1.82/1.98 % --brand_transform false
% 1.82/1.98 % --pure_diseq_elim true
% 1.82/1.98 % --min_unsat_core false
% 1.82/1.98 % --pred_elim true
% 1.82/1.98 % --add_important_lit false
% 1.82/1.98 % --soft_assumptions false
% 1.82/1.98 % --reset_solvers false
% 1.82/1.98 % --bc_imp_inh []
% 1.82/1.98 % --conj_cone_tolerance 1.5
% 1.82/1.98 % --prolific_symb_bound 500
% 1.82/1.98 % --lt_threshold 2000
% 1.82/1.98
% 1.82/1.98 % ------ SAT Options
% 1.82/1.98
% 1.82/1.98 % --sat_mode false
% 1.82/1.98 % --sat_fm_restart_options ""
% 1.82/1.98 % --sat_gr_def false
% 1.82/1.98 % --sat_epr_types true
% 1.82/1.98 % --sat_non_cyclic_types false
% 1.82/1.98 % --sat_finite_models false
% 1.82/1.98 % --sat_fm_lemmas false
% 1.82/1.98 % --sat_fm_prep false
% 1.82/1.98 % --sat_fm_uc_incr true
% 1.82/1.98 % --sat_out_model small
% 1.82/1.98 % --sat_out_clauses false
% 1.82/1.98
% 1.82/1.98 % ------ QBF Options
% 1.82/1.98
% 1.82/1.98 % --qbf_mode false
% 1.82/1.98 % --qbf_elim_univ true
% 1.82/1.98 % --qbf_sk_in true
% 1.82/1.98 % --qbf_pred_elim true
% 1.82/1.98 % --qbf_split 32
% 1.82/1.98
% 1.82/1.98 % ------ BMC1 Options
% 1.82/1.98
% 1.82/1.98 % --bmc1_incremental false
% 1.82/1.98 % --bmc1_axioms reachable_all
% 1.82/1.98 % --bmc1_min_bound 0
% 1.82/1.98 % --bmc1_max_bound -1
% 1.82/1.98 % --bmc1_max_bound_default -1
% 1.82/1.98 % --bmc1_symbol_reachability true
% 1.82/1.98 % --bmc1_property_lemmas false
% 1.82/1.98 % --bmc1_k_induction false
% 1.82/1.98 % --bmc1_non_equiv_states false
% 1.82/1.98 % --bmc1_deadlock false
% 1.82/1.98 % --bmc1_ucm false
% 1.82/1.98 % --bmc1_add_unsat_core none
% 1.82/1.98 % --bmc1_unsat_core_children false
% 1.82/1.98 % --bmc1_unsat_core_extrapolate_axioms false
% 1.82/1.98 % --bmc1_out_stat full
% 1.82/1.98 % --bmc1_ground_init false
% 1.82/1.98 % --bmc1_pre_inst_next_state false
% 1.82/1.98 % --bmc1_pre_inst_state false
% 1.82/1.98 % --bmc1_pre_inst_reach_state false
% 1.82/1.98 % --bmc1_out_unsat_core false
% 1.82/1.98 % --bmc1_aig_witness_out false
% 1.82/1.98 % --bmc1_verbose false
% 1.82/1.98 % --bmc1_dump_clauses_tptp false
% 1.97/2.18 % --bmc1_dump_unsat_core_tptp false
% 1.97/2.18 % --bmc1_dump_file -
% 1.97/2.18 % --bmc1_ucm_expand_uc_limit 128
% 1.97/2.18 % --bmc1_ucm_n_expand_iterations 6
% 1.97/2.18 % --bmc1_ucm_extend_mode 1
% 1.97/2.18 % --bmc1_ucm_init_mode 2
% 1.97/2.18 % --bmc1_ucm_cone_mode none
% 1.97/2.18 % --bmc1_ucm_reduced_relation_type 0
% 1.97/2.18 % --bmc1_ucm_relax_model 4
% 1.97/2.18 % --bmc1_ucm_full_tr_after_sat true
% 1.97/2.18 % --bmc1_ucm_expand_neg_assumptions false
% 1.97/2.18 % --bmc1_ucm_layered_model none
% 1.97/2.18 % --bmc1_ucm_max_lemma_size 10
% 1.97/2.18
% 1.97/2.18 % ------ AIG Options
% 1.97/2.18
% 1.97/2.18 % --aig_mode false
% 1.97/2.18
% 1.97/2.18 % ------ Instantiation Options
% 1.97/2.18
% 1.97/2.18 % --instantiation_flag true
% 1.97/2.18 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.97/2.18 % --inst_solver_per_active 750
% 1.97/2.18 % --inst_solver_calls_frac 0.5
% 1.97/2.18 % --inst_passive_queue_type priority_queues
% 1.97/2.18 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.97/2.18 % --inst_passive_queues_freq [25;2]
% 1.97/2.18 % --inst_dismatching true
% 1.97/2.18 % --inst_eager_unprocessed_to_passive true
% 1.97/2.18 % --inst_prop_sim_given true
% 1.97/2.18 % --inst_prop_sim_new false
% 1.97/2.18 % --inst_orphan_elimination true
% 1.97/2.18 % --inst_learning_loop_flag true
% 1.97/2.18 % --inst_learning_start 3000
% 1.97/2.18 % --inst_learning_factor 2
% 1.97/2.18 % --inst_start_prop_sim_after_learn 3
% 1.97/2.18 % --inst_sel_renew solver
% 1.97/2.18 % --inst_lit_activity_flag true
% 1.97/2.18 % --inst_out_proof true
% 1.97/2.18
% 1.97/2.18 % ------ Resolution Options
% 1.97/2.18
% 1.97/2.18 % --resolution_flag true
% 1.97/2.18 % --res_lit_sel kbo_max
% 1.97/2.18 % --res_to_prop_solver none
% 1.97/2.18 % --res_prop_simpl_new false
% 1.97/2.18 % --res_prop_simpl_given false
% 1.97/2.18 % --res_passive_queue_type priority_queues
% 1.97/2.18 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.97/2.18 % --res_passive_queues_freq [15;5]
% 1.97/2.18 % --res_forward_subs full
% 1.97/2.18 % --res_backward_subs full
% 1.97/2.18 % --res_forward_subs_resolution true
% 1.97/2.18 % --res_backward_subs_resolution true
% 1.97/2.18 % --res_orphan_elimination false
% 1.97/2.18 % --res_time_limit 1000.
% 1.97/2.18 % --res_out_proof true
% 1.97/2.18 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8fb934.s
% 1.97/2.18 % --modulo true
% 1.97/2.18
% 1.97/2.18 % ------ Combination Options
% 1.97/2.18
% 1.97/2.18 % --comb_res_mult 1000
% 1.97/2.18 % --comb_inst_mult 300
% 1.97/2.18 % ------
% 1.97/2.18
% 1.97/2.18 % ------ Parsing...% successful
% 1.97/2.18
% 1.97/2.18 % ------ Preprocessing... gs_s sp: 1298 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:32:0s pe:64:0s pe_e snvd_s sp: 0 0s snvd_e %
% 1.97/2.18
% 1.97/2.18 % ------ Proving...
% 1.97/2.18 % ------ Problem Properties
% 1.97/2.18
% 1.97/2.18 %
% 1.97/2.18 % EPR true
% 1.97/2.18 % Horn false
% 1.97/2.18 % Has equality false
% 1.97/2.18
% 1.97/2.18 % % ------ Input Options Time Limit: Unbounded
% 1.97/2.18
% 1.97/2.18
% 1.97/2.18 % % ------ Current options:
% 1.97/2.18
% 1.97/2.18 % ------ Input Options
% 1.97/2.18
% 1.97/2.18 % --out_options all
% 1.97/2.18 % --tptp_safe_out true
% 1.97/2.18 % --problem_path ""
% 1.97/2.18 % --include_path ""
% 1.97/2.18 % --clausifier .//eprover
% 1.97/2.18 % --clausifier_options --tstp-format
% 1.97/2.18 % --stdin false
% 1.97/2.18 % --dbg_backtrace false
% 1.97/2.18 % --dbg_dump_prop_clauses false
% 1.97/2.18 % --dbg_dump_prop_clauses_file -
% 1.97/2.18 % --dbg_out_stat false
% 1.97/2.18
% 1.97/2.18 % ------ General Options
% 1.97/2.18
% 1.97/2.18 % --fof false
% 1.97/2.18 % --time_out_real 150.
% 1.97/2.18 % --time_out_prep_mult 0.2
% 1.97/2.18 % --time_out_virtual -1.
% 1.97/2.18 % --schedule none
% 1.97/2.18 % --ground_splitting input
% 1.97/2.18 % --splitting_nvd 16
% 1.97/2.18 % --non_eq_to_eq false
% 1.97/2.18 % --prep_gs_sim true
% 1.97/2.18 % --prep_unflatten false
% 1.97/2.18 % --prep_res_sim true
% 1.97/2.18 % --prep_upred true
% 1.97/2.18 % --res_sim_input true
% 1.97/2.18 % --clause_weak_htbl true
% 1.97/2.18 % --gc_record_bc_elim false
% 1.97/2.18 % --symbol_type_check false
% 1.97/2.18 % --clausify_out false
% 1.97/2.18 % --large_theory_mode false
% 1.97/2.18 % --prep_sem_filter none
% 1.97/2.18 % --prep_sem_filter_out false
% 1.97/2.18 % --preprocessed_out false
% 1.97/2.18 % --sub_typing false
% 1.97/2.18 % --brand_transform false
% 1.97/2.18 % --pure_diseq_elim true
% 1.97/2.18 % --min_unsat_core false
% 1.97/2.18 % --pred_elim true
% 1.97/2.18 % --add_important_lit false
% 1.97/2.18 % --soft_assumptions false
% 1.97/2.18 % --reset_solvers false
% 1.97/2.18 % --bc_imp_inh []
% 1.97/2.18 % --conj_cone_tolerance 1.5
% 1.97/2.18 % --prolific_symb_bound 500
% 1.97/2.18 % --lt_threshold 2000
% 1.97/2.18
% 1.97/2.18 % ------ SAT Options
% 1.97/2.18
% 1.97/2.18 % --sat_mode false
% 1.97/2.18 % --sat_fm_restart_options ""
% 1.97/2.18 % --sat_gr_def false
% 1.97/2.18 % --sat_epr_types true
% 1.97/2.18 % --sat_non_cyclic_types false
% 1.97/2.18 % --sat_finite_models false
% 1.97/2.18 % --sat_fm_lemmas false
% 1.97/2.18 % --sat_fm_prep false
% 1.97/2.18 % --sat_fm_uc_incr true
% 1.97/2.18 % --sat_out_model small
% 1.97/2.18 % --sat_out_clauses false
% 1.97/2.18
% 1.97/2.18 % ------ QBF Options
% 1.97/2.18
% 1.97/2.18 % --qbf_mode false
% 1.97/2.18 % --qbf_elim_univ true
% 1.97/2.18 % --qbf_sk_in true
% 1.97/2.18 % --qbf_pred_elim true
% 1.97/2.18 % --qbf_split 32
% 1.97/2.18
% 1.97/2.18 % ------ BMC1 Options
% 1.97/2.18
% 1.97/2.18 % --bmc1_incremental false
% 1.97/2.18 % --bmc1_axioms reachable_all
% 1.97/2.18 % --bmc1_min_bound 0
% 1.97/2.18 % --bmc1_max_bound -1
% 1.97/2.18 % --bmc1_max_bound_default -1
% 1.97/2.18 % --bmc1_symbol_reachability true
% 1.97/2.18 % --bmc1_property_lemmas false
% 1.97/2.18 % --bmc1_k_induction false
% 1.97/2.18 % --bmc1_non_equiv_states false
% 1.97/2.18 % --bmc1_deadlock false
% 1.97/2.18 % --bmc1_ucm false
% 1.97/2.18 % --bmc1_add_unsat_core none
% 1.97/2.18 % --bmc1_unsat_core_children false
% 1.97/2.18 % --bmc1_unsat_core_extrapolate_axioms false
% 1.97/2.18 % --bmc1_out_stat full
% 1.97/2.18 % --bmc1_ground_init false
% 1.97/2.18 % --bmc1_pre_inst_next_state false
% 1.97/2.18 % --bmc1_pre_inst_state false
% 1.97/2.18 % --bmc1_pre_inst_reach_state false
% 1.97/2.18 % --bmc1_out_unsat_core false
% 1.97/2.18 % --bmc1_aig_witness_out false
% 1.97/2.18 % --bmc1_verbose false
% 1.97/2.18 % --bmc1_dump_clauses_tptp false
% 1.97/2.18 % --bmc1_dump_unsat_core_tptp false
% 1.97/2.18 % --bmc1_dump_file -
% 1.97/2.18 % --bmc1_ucm_expand_uc_limit 128
% 1.97/2.18 % --bmc1_ucm_n_expand_iterations 6
% 1.97/2.18 % --bmc1_ucm_extend_mode 1
% 1.97/2.18 % --bmc1_ucm_init_mode 2
% 1.97/2.18 % --bmc1_ucm_cone_mode none
% 1.97/2.18 % --bmc1_ucm_reduced_relation_type 0
% 1.97/2.18 % --bmc1_ucm_relax_model 4
% 1.97/2.18 % --bmc1_ucm_full_tr_after_sat true
% 1.97/2.18 % --bmc1_ucm_expand_neg_assumptions false
% 1.97/2.18 % --bmc1_ucm_layered_model none
% 1.97/2.18 % --bmc1_ucm_max_lemma_size 10
% 1.97/2.18
% 1.97/2.18 % ------ AIG Options
% 1.97/2.18
% 1.97/2.18 % --aig_mode false
% 1.97/2.18
% 1.97/2.18 % ------ Instantiation Options
% 1.97/2.18
% 1.97/2.18 % --instantiation_flag true
% 1.97/2.18 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.97/2.18 % --inst_solver_per_active 750
% 1.97/2.18 % --inst_solver_calls_frac 0.5
% 1.97/2.18 % --inst_passive_queue_type priority_queues
% 1.97/2.18 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.97/2.18 % --inst_passive_queues_freq [25;2]
% 1.97/2.18 % --inst_dismatching true
% 1.97/2.18 % --inst_eager_unprocessed_to_passive true
% 3.04/3.24 % --inst_prop_sim_given true
% 3.04/3.24 % --inst_prop_sim_new false
% 3.04/3.24 % --inst_orphan_elimination true
% 3.04/3.24 % --inst_learning_loop_flag true
% 3.04/3.24 % --inst_learning_start 3000
% 3.04/3.24 % --inst_learning_factor 2
% 3.04/3.24 % --inst_start_prop_sim_after_learn 3
% 3.04/3.24 % --inst_sel_renew solver
% 3.04/3.24 % --inst_lit_activity_flag true
% 3.04/3.24 % --inst_out_proof true
% 3.04/3.24
% 3.04/3.24 % ------ Resolution Options
% 3.04/3.24
% 3.04/3.24 % --resolution_flag true
% 3.04/3.24 % --res_lit_sel kbo_max
% 3.04/3.24 % --res_to_prop_solver none
% 3.04/3.24 % --res_prop_simpl_new false
% 3.04/3.24 % --res_prop_simpl_given false
% 3.04/3.24 % --res_passive_queue_type priority_queues
% 3.04/3.24 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.04/3.24 % --res_passive_queues_freq [15;5]
% 3.04/3.24 % --res_forward_subs full
% 3.04/3.24 % --res_backward_subs full
% 3.04/3.24 % --res_forward_subs_resolution true
% 3.04/3.24 % --res_backward_subs_resolution true
% 3.04/3.24 % --res_orphan_elimination false
% 3.04/3.24 % --res_time_limit 1000.
% 3.04/3.24 % --res_out_proof true
% 3.04/3.24 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8fb934.s
% 3.04/3.24 % --modulo true
% 3.04/3.24
% 3.04/3.24 % ------ Combination Options
% 3.04/3.24
% 3.04/3.24 % --comb_res_mult 1000
% 3.04/3.24 % --comb_inst_mult 300
% 3.04/3.24 % ------
% 3.04/3.24
% 3.04/3.24
% 3.04/3.24
% 3.04/3.24 % ------ Proving...
% 3.04/3.24 % warning: shown sat in sat incomplete mode
% 3.04/3.24 %
% 3.04/3.24
% 3.04/3.24
% 3.04/3.24 ------ Building Model...Done
% 3.04/3.24
% 3.04/3.24 %------ The model is defined over ground terms (initial term algebra).
% 3.04/3.24 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.04/3.24 %------ where \phi is a formula over the term algebra.
% 3.04/3.24 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.04/3.24 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.04/3.24 %------ See help for --sat_out_model for different model outputs.
% 3.04/3.24 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.04/3.24 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.04/3.24
% 3.04/3.24
% 3.04/3.24
% 3.04/3.24
% 3.04/3.24 %------ Negative definition of c2_2
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 (! [X0,X1] :
% 3.04/3.24 ( ~(c2_2(X0,X1)) <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Negative definition of c1_2
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 (! [X0,X1] :
% 3.04/3.24 ( ~(c1_2(X0,X1)) <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Negative definition of c4_2
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 (! [X0,X1] :
% 3.04/3.24 ( ~(c4_2(X0,X1)) <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of ndr1_0
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( ndr1_0 <=>
% 3.04/3.24 $true
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of ndr1_1
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 (! [X0] :
% 3.04/3.24 ( ndr1_1(X0) <=>
% 3.04/3.24 (
% 3.04/3.24 (
% 3.04/3.24 ( X0=a106 )
% 3.04/3.24 )
% 3.04/3.24
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of c5_1
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 (! [X0] :
% 3.04/3.24 ( c5_1(X0) <=>
% 3.04/3.24 (
% 3.04/3.24 (
% 3.04/3.24 ( X0=a118 )
% 3.04/3.24 )
% 3.04/3.24
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of c1_1
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 (! [X0] :
% 3.04/3.24 ( c1_1(X0) <=>
% 3.04/3.24 (
% 3.04/3.24 (
% 3.04/3.24 ( X0=a118 )
% 3.04/3.24 )
% 3.04/3.24
% 3.04/3.24 |
% 3.04/3.24 (
% 3.04/3.24 ( X0=a137 )
% 3.04/3.24 )
% 3.04/3.24
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Negative definition of c3_1
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 (! [X0] :
% 3.04/3.24 ( ~(c3_1(X0)) <=>
% 3.04/3.24 (
% 3.04/3.24 (
% 3.04/3.24 ( X0=a110 )
% 3.04/3.24 )
% 3.04/3.24
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Negative definition of c4_1
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 (! [X0] :
% 3.04/3.24 ( ~(c4_1(X0)) <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of c1_0
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( c1_0 <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of epred2_0
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( epred2_0 <=>
% 3.04/3.24 $true
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of c3_0
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( c3_0 <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of c4_0
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( c4_0 <=>
% 3.04/3.24 $true
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of c2_0
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( c2_0 <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of c2_1
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 (! [X0] :
% 3.04/3.24 ( c2_1(X0) <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of epred1_0
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( epred1_0 <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP1_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP1_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP17_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP17_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP18_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP18_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP19_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP19_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP20_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP20_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP21_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP21_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP22_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP22_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP37_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP37_iProver_split <=>
% 3.04/3.24 $true
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP45_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP45_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP46_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP46_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP50_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP50_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP51_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP51_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP52_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP52_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP53_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP53_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP54_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP54_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP55_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP55_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP56_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP56_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP57_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP57_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP58_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP58_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP59_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP59_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP60_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP60_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP61_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP61_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP62_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP62_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP63_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP63_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP74_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP74_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24 %------ Positive definition of sP129_iProver_split
% 3.04/3.24 fof(lit_def,axiom,
% 3.04/3.24 ( sP129_iProver_split <=>
% 3.04/3.24 $false
% 3.04/3.24 )
% 3.04/3.24 ).
% 3.04/3.24
% 3.04/3.24
% 3.04/3.24
% 3.04/3.24 % ------ Statistics
% 3.04/3.24
% 3.04/3.24 % ------ General
% 3.04/3.24
% 3.04/3.24 % num_of_input_clauses: 638
% 3.04/3.24 % num_of_input_neg_conjectures: 546
% 3.04/3.24 % num_of_splits: 1298
% 3.04/3.24 % num_of_split_atoms: 130
% 3.04/3.24 % num_of_sem_filtered_clauses: 0
% 3.04/3.24 % num_of_subtypes: 0
% 3.04/3.24 % monotx_restored_types: 0
% 3.04/3.24 % sat_num_of_epr_types: 0
% 3.04/3.24 % sat_num_of_non_cyclic_types: 0
% 3.04/3.24 % sat_guarded_non_collapsed_types: 0
% 3.04/3.24 % is_epr: 1
% 3.04/3.24 % is_horn: 0
% 3.04/3.24 % has_eq: 0
% 3.04/3.24 % num_pure_diseq_elim: 0
% 3.04/3.24 % simp_replaced_by: 0
% 3.04/3.24 % res_preprocessed: 1796
% 3.04/3.24 % prep_upred: 0
% 3.04/3.24 % prep_unflattend: 0
% 3.04/3.24 % pred_elim_cands: 130
% 3.04/3.24 % pred_elim: 104
% 3.04/3.24 % pred_elim_cl: 256
% 3.04/3.24 % pred_elim_cycles: 130
% 3.04/3.24 % forced_gc_time: 0
% 3.04/3.24 % gc_basic_clause_elim: 0
% 3.04/3.24 % parsing_time: 0.018
% 3.04/3.24 % sem_filter_time: 0.
% 3.04/3.25 % pred_elim_time: 0.119
% 3.04/3.25 % out_proof_time: 0.
% 3.04/3.25 % monotx_time: 0.
% 3.04/3.25 % subtype_inf_time: 0.
% 3.04/3.25 % unif_index_cands_time: 0.001
% 3.04/3.25 % unif_index_add_time: 0.001
% 3.04/3.25 % total_time: 1.269
% 3.04/3.25 % num_of_symbols: 211
% 3.04/3.25 % num_of_terms: 1218
% 3.04/3.25
% 3.04/3.25 % ------ Propositional Solver
% 3.04/3.25
% 3.04/3.25 % prop_solver_calls: 4
% 3.04/3.25 % prop_fast_solver_calls: 14637
% 3.04/3.25 % prop_num_of_clauses: 2076
% 3.04/3.25 % prop_preprocess_simplified: 11820
% 3.04/3.25 % prop_fo_subsumed: 931
% 3.04/3.25 % prop_solver_time: 0.
% 3.04/3.25 % prop_fast_solver_time: 0.009
% 3.04/3.25 % prop_unsat_core_time: 0.
% 3.04/3.25
% 3.04/3.25 % ------ QBF
% 3.04/3.25
% 3.04/3.25 % qbf_q_res: 0
% 3.04/3.25 % qbf_num_tautologies: 0
% 3.04/3.25 % qbf_prep_cycles: 0
% 3.04/3.25
% 3.04/3.25 % ------ BMC1
% 3.04/3.25
% 3.04/3.25 % bmc1_current_bound: -1
% 3.04/3.25 % bmc1_last_solved_bound: -1
% 3.04/3.25 % bmc1_unsat_core_size: -1
% 3.04/3.25 % bmc1_unsat_core_parents_size: -1
% 3.04/3.25 % bmc1_merge_next_fun: 0
% 3.04/3.25 % bmc1_unsat_core_clauses_time: 0.
% 3.04/3.25
% 3.04/3.25 % ------ Instantiation
% 3.04/3.25
% 3.04/3.25 % inst_num_of_clauses: 301
% 3.04/3.25 % inst_num_in_passive: 0
% 3.04/3.25 % inst_num_in_active: 301
% 3.04/3.25 % inst_num_in_unprocessed: 0
% 3.04/3.25 % inst_num_of_loops: 360
% 3.04/3.25 % inst_num_of_learning_restarts: 0
% 3.04/3.25 % inst_num_moves_active_passive: 55
% 3.04/3.25 % inst_lit_activity: 47
% 3.04/3.25 % inst_lit_activity_moves: 0
% 3.04/3.25 % inst_num_tautologies: 0
% 3.04/3.25 % inst_num_prop_implied: 0
% 3.04/3.25 % inst_num_existing_simplified: 0
% 3.04/3.25 % inst_num_eq_res_simplified: 0
% 3.04/3.25 % inst_num_child_elim: 0
% 3.04/3.25 % inst_num_of_dismatching_blockings: 0
% 3.04/3.25 % inst_num_of_non_proper_insts: 28
% 3.04/3.25 % inst_num_of_duplicates: 0
% 3.04/3.25 % inst_inst_num_from_inst_to_res: 0
% 3.04/3.25 % inst_dismatching_checking_time: 0.
% 3.04/3.25
% 3.04/3.25 % ------ Resolution
% 3.04/3.25
% 3.04/3.25 % res_num_of_clauses: 5294
% 3.04/3.25 % res_num_in_passive: 4149
% 3.04/3.25 % res_num_in_active: 1143
% 3.04/3.25 % res_num_of_loops: 2000
% 3.04/3.25 % res_forward_subset_subsumed: 1052
% 3.04/3.25 % res_backward_subset_subsumed: 0
% 3.04/3.25 % res_forward_subsumed: 845
% 3.04/3.25 % res_backward_subsumed: 3
% 3.04/3.25 % res_forward_subsumption_resolution: 693
% 3.04/3.25 % res_backward_subsumption_resolution: 8
% 3.04/3.25 % res_clause_to_clause_subsumption: 7299
% 3.04/3.25 % res_orphan_elimination: 0
% 3.04/3.25 % res_tautology_del: 1791
% 3.04/3.25 % res_num_eq_res_simplified: 0
% 3.04/3.25 % res_num_sel_changes: 0
% 3.04/3.25 % res_moves_from_active_to_pass: 0
% 3.04/3.25
% 3.04/3.25 % Status Unknown
% 3.04/3.25 % Last status :
% 3.04/3.25 % SZS status Unknown
%------------------------------------------------------------------------------