TSTP Solution File: SYN541+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN541+1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n008.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:45 EDT 2022
% Result : Unknown 2.93s 3.17s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN541+1 : TPTP v8.1.0. Released v2.1.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n008.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 14:42:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.19/0.43 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.43 % FOF problem with conjecture
% 0.19/0.43 % 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_00b8a3.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c0cb64.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_4e7e46 | grep -v "SZS"
% 0.19/0.45
% 0.19/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.45
% 0.19/0.45 %
% 0.19/0.45 % ------ iProver source info
% 0.19/0.45
% 0.19/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.45 % git: non_committed_changes: true
% 0.19/0.45 % git: last_make_outside_of_git: true
% 0.19/0.45
% 0.19/0.45 %
% 0.19/0.45 % ------ Input Options
% 0.19/0.45
% 0.19/0.45 % --out_options all
% 0.19/0.45 % --tptp_safe_out true
% 0.19/0.45 % --problem_path ""
% 0.19/0.45 % --include_path ""
% 0.19/0.45 % --clausifier .//eprover
% 0.19/0.45 % --clausifier_options --tstp-format
% 0.19/0.45 % --stdin false
% 0.19/0.45 % --dbg_backtrace false
% 0.19/0.45 % --dbg_dump_prop_clauses false
% 0.19/0.45 % --dbg_dump_prop_clauses_file -
% 0.19/0.45 % --dbg_out_stat false
% 0.19/0.45
% 0.19/0.45 % ------ General Options
% 0.19/0.45
% 0.19/0.45 % --fof false
% 0.19/0.45 % --time_out_real 150.
% 0.19/0.45 % --time_out_prep_mult 0.2
% 0.19/0.45 % --time_out_virtual -1.
% 0.19/0.45 % --schedule none
% 0.19/0.45 % --ground_splitting input
% 0.19/0.45 % --splitting_nvd 16
% 0.19/0.45 % --non_eq_to_eq false
% 0.19/0.45 % --prep_gs_sim true
% 0.19/0.45 % --prep_unflatten false
% 0.19/0.45 % --prep_res_sim true
% 0.19/0.45 % --prep_upred true
% 0.19/0.45 % --res_sim_input true
% 0.19/0.45 % --clause_weak_htbl true
% 0.19/0.45 % --gc_record_bc_elim false
% 0.19/0.45 % --symbol_type_check false
% 0.19/0.45 % --clausify_out false
% 0.19/0.45 % --large_theory_mode false
% 0.19/0.45 % --prep_sem_filter none
% 0.19/0.45 % --prep_sem_filter_out false
% 0.19/0.45 % --preprocessed_out false
% 0.19/0.45 % --sub_typing false
% 0.19/0.45 % --brand_transform false
% 0.19/0.45 % --pure_diseq_elim true
% 0.19/0.45 % --min_unsat_core false
% 0.19/0.45 % --pred_elim true
% 0.19/0.45 % --add_important_lit false
% 0.19/0.45 % --soft_assumptions false
% 0.19/0.45 % --reset_solvers false
% 0.19/0.45 % --bc_imp_inh []
% 0.19/0.45 % --conj_cone_tolerance 1.5
% 0.19/0.45 % --prolific_symb_bound 500
% 0.19/0.45 % --lt_threshold 2000
% 0.19/0.45
% 0.19/0.45 % ------ SAT Options
% 0.19/0.45
% 0.19/0.45 % --sat_mode false
% 0.19/0.45 % --sat_fm_restart_options ""
% 0.19/0.45 % --sat_gr_def false
% 0.19/0.45 % --sat_epr_types true
% 0.19/0.45 % --sat_non_cyclic_types false
% 0.19/0.45 % --sat_finite_models false
% 0.19/0.45 % --sat_fm_lemmas false
% 0.19/0.45 % --sat_fm_prep false
% 0.19/0.45 % --sat_fm_uc_incr true
% 0.19/0.45 % --sat_out_model small
% 0.19/0.45 % --sat_out_clauses false
% 0.19/0.45
% 0.19/0.45 % ------ QBF Options
% 0.19/0.45
% 0.19/0.45 % --qbf_mode false
% 0.19/0.45 % --qbf_elim_univ true
% 0.19/0.45 % --qbf_sk_in true
% 0.19/0.45 % --qbf_pred_elim true
% 0.19/0.45 % --qbf_split 32
% 0.19/0.45
% 0.19/0.45 % ------ BMC1 Options
% 0.19/0.45
% 0.19/0.45 % --bmc1_incremental false
% 0.19/0.45 % --bmc1_axioms reachable_all
% 0.19/0.45 % --bmc1_min_bound 0
% 0.19/0.45 % --bmc1_max_bound -1
% 0.19/0.45 % --bmc1_max_bound_default -1
% 0.19/0.45 % --bmc1_symbol_reachability true
% 0.19/0.45 % --bmc1_property_lemmas false
% 0.19/0.45 % --bmc1_k_induction false
% 0.19/0.45 % --bmc1_non_equiv_states false
% 0.19/0.45 % --bmc1_deadlock false
% 0.19/0.45 % --bmc1_ucm false
% 0.19/0.45 % --bmc1_add_unsat_core none
% 0.19/0.45 % --bmc1_unsat_core_children false
% 0.19/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.45 % --bmc1_out_stat full
% 0.19/0.45 % --bmc1_ground_init false
% 0.19/0.45 % --bmc1_pre_inst_next_state false
% 0.19/0.45 % --bmc1_pre_inst_state false
% 0.19/0.45 % --bmc1_pre_inst_reach_state false
% 0.19/0.45 % --bmc1_out_unsat_core false
% 0.19/0.45 % --bmc1_aig_witness_out false
% 0.19/0.45 % --bmc1_verbose false
% 0.19/0.45 % --bmc1_dump_clauses_tptp false
% 0.45/0.67 % --bmc1_dump_unsat_core_tptp false
% 0.45/0.67 % --bmc1_dump_file -
% 0.45/0.67 % --bmc1_ucm_expand_uc_limit 128
% 0.45/0.67 % --bmc1_ucm_n_expand_iterations 6
% 0.45/0.67 % --bmc1_ucm_extend_mode 1
% 0.45/0.67 % --bmc1_ucm_init_mode 2
% 0.45/0.67 % --bmc1_ucm_cone_mode none
% 0.45/0.67 % --bmc1_ucm_reduced_relation_type 0
% 0.45/0.67 % --bmc1_ucm_relax_model 4
% 0.45/0.67 % --bmc1_ucm_full_tr_after_sat true
% 0.45/0.67 % --bmc1_ucm_expand_neg_assumptions false
% 0.45/0.67 % --bmc1_ucm_layered_model none
% 0.45/0.67 % --bmc1_ucm_max_lemma_size 10
% 0.45/0.67
% 0.45/0.67 % ------ AIG Options
% 0.45/0.67
% 0.45/0.67 % --aig_mode false
% 0.45/0.67
% 0.45/0.67 % ------ Instantiation Options
% 0.45/0.67
% 0.45/0.67 % --instantiation_flag true
% 0.45/0.67 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.45/0.67 % --inst_solver_per_active 750
% 0.45/0.67 % --inst_solver_calls_frac 0.5
% 0.45/0.67 % --inst_passive_queue_type priority_queues
% 0.45/0.67 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.45/0.67 % --inst_passive_queues_freq [25;2]
% 0.45/0.67 % --inst_dismatching true
% 0.45/0.67 % --inst_eager_unprocessed_to_passive true
% 0.45/0.67 % --inst_prop_sim_given true
% 0.45/0.67 % --inst_prop_sim_new false
% 0.45/0.67 % --inst_orphan_elimination true
% 0.45/0.67 % --inst_learning_loop_flag true
% 0.45/0.67 % --inst_learning_start 3000
% 0.45/0.67 % --inst_learning_factor 2
% 0.45/0.67 % --inst_start_prop_sim_after_learn 3
% 0.45/0.67 % --inst_sel_renew solver
% 0.45/0.67 % --inst_lit_activity_flag true
% 0.45/0.67 % --inst_out_proof true
% 0.45/0.67
% 0.45/0.67 % ------ Resolution Options
% 0.45/0.67
% 0.45/0.67 % --resolution_flag true
% 0.45/0.67 % --res_lit_sel kbo_max
% 0.45/0.67 % --res_to_prop_solver none
% 0.45/0.67 % --res_prop_simpl_new false
% 0.45/0.67 % --res_prop_simpl_given false
% 0.45/0.67 % --res_passive_queue_type priority_queues
% 0.45/0.67 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.45/0.67 % --res_passive_queues_freq [15;5]
% 0.45/0.67 % --res_forward_subs full
% 0.45/0.67 % --res_backward_subs full
% 0.45/0.67 % --res_forward_subs_resolution true
% 0.45/0.67 % --res_backward_subs_resolution true
% 0.45/0.67 % --res_orphan_elimination false
% 0.45/0.67 % --res_time_limit 1000.
% 0.45/0.67 % --res_out_proof true
% 0.45/0.67 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_00b8a3.s
% 0.45/0.67 % --modulo true
% 0.45/0.67
% 0.45/0.67 % ------ Combination Options
% 0.45/0.67
% 0.45/0.67 % --comb_res_mult 1000
% 0.45/0.67 % --comb_inst_mult 300
% 0.45/0.67 % ------
% 0.45/0.67
% 0.45/0.67 % ------ Parsing...% successful
% 0.45/0.67
% 0.45/0.67 % ------ Preprocessing... gs_s sp: 712 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_e snvd_s sp: 0 0s snvd_e %
% 0.45/0.67
% 0.45/0.67 % ------ Proving...
% 0.45/0.67 % ------ Problem Properties
% 0.45/0.67
% 0.45/0.67 %
% 0.45/0.67 % EPR true
% 0.45/0.67 % Horn false
% 0.45/0.67 % Has equality false
% 0.45/0.67
% 0.45/0.67 % % ------ Input Options Time Limit: Unbounded
% 0.45/0.67
% 0.45/0.67
% 0.45/0.67 % % ------ Current options:
% 0.45/0.67
% 0.45/0.67 % ------ Input Options
% 0.45/0.67
% 0.45/0.67 % --out_options all
% 0.45/0.67 % --tptp_safe_out true
% 0.45/0.67 % --problem_path ""
% 0.45/0.67 % --include_path ""
% 0.45/0.67 % --clausifier .//eprover
% 0.45/0.67 % --clausifier_options --tstp-format
% 0.45/0.67 % --stdin false
% 0.45/0.67 % --dbg_backtrace false
% 0.45/0.67 % --dbg_dump_prop_clauses false
% 0.45/0.67 % --dbg_dump_prop_clauses_file -
% 0.45/0.67 % --dbg_out_stat false
% 0.45/0.67
% 0.45/0.67 % ------ General Options
% 0.45/0.67
% 0.45/0.67 % --fof false
% 0.45/0.67 % --time_out_real 150.
% 0.45/0.67 % --time_out_prep_mult 0.2
% 0.45/0.67 % --time_out_virtual -1.
% 0.45/0.67 % --schedule none
% 0.45/0.67 % --ground_splitting input
% 0.45/0.67 % --splitting_nvd 16
% 0.45/0.67 % --non_eq_to_eq false
% 0.45/0.67 % --prep_gs_sim true
% 0.45/0.67 % --prep_unflatten false
% 0.45/0.67 % --prep_res_sim true
% 0.45/0.67 % --prep_upred true
% 0.45/0.67 % --res_sim_input true
% 0.45/0.67 % --clause_weak_htbl true
% 0.45/0.67 % --gc_record_bc_elim false
% 0.45/0.67 % --symbol_type_check false
% 0.45/0.67 % --clausify_out false
% 0.45/0.67 % --large_theory_mode false
% 0.45/0.67 % --prep_sem_filter none
% 0.45/0.67 % --prep_sem_filter_out false
% 0.45/0.67 % --preprocessed_out false
% 0.45/0.67 % --sub_typing false
% 0.45/0.67 % --brand_transform false
% 0.45/0.67 % --pure_diseq_elim true
% 0.45/0.67 % --min_unsat_core false
% 0.45/0.67 % --pred_elim true
% 0.45/0.67 % --add_important_lit false
% 0.45/0.67 % --soft_assumptions false
% 0.45/0.67 % --reset_solvers false
% 0.45/0.67 % --bc_imp_inh []
% 0.45/0.67 % --conj_cone_tolerance 1.5
% 0.45/0.67 % --prolific_symb_bound 500
% 0.45/0.67 % --lt_threshold 2000
% 0.45/0.67
% 0.45/0.67 % ------ SAT Options
% 0.45/0.67
% 0.45/0.67 % --sat_mode false
% 0.45/0.67 % --sat_fm_restart_options ""
% 0.45/0.67 % --sat_gr_def false
% 0.45/0.67 % --sat_epr_types true
% 0.45/0.67 % --sat_non_cyclic_types false
% 0.45/0.67 % --sat_finite_models false
% 0.45/0.67 % --sat_fm_lemmas false
% 0.45/0.67 % --sat_fm_prep false
% 0.45/0.67 % --sat_fm_uc_incr true
% 0.45/0.67 % --sat_out_model small
% 0.45/0.67 % --sat_out_clauses false
% 0.45/0.67
% 0.45/0.67 % ------ QBF Options
% 0.45/0.67
% 0.45/0.67 % --qbf_mode false
% 0.45/0.67 % --qbf_elim_univ true
% 0.45/0.67 % --qbf_sk_in true
% 0.45/0.67 % --qbf_pred_elim true
% 0.45/0.67 % --qbf_split 32
% 0.45/0.67
% 0.45/0.67 % ------ BMC1 Options
% 0.45/0.67
% 0.45/0.67 % --bmc1_incremental false
% 0.45/0.67 % --bmc1_axioms reachable_all
% 0.45/0.67 % --bmc1_min_bound 0
% 0.45/0.67 % --bmc1_max_bound -1
% 0.45/0.67 % --bmc1_max_bound_default -1
% 0.45/0.67 % --bmc1_symbol_reachability true
% 0.45/0.67 % --bmc1_property_lemmas false
% 0.45/0.67 % --bmc1_k_induction false
% 0.45/0.67 % --bmc1_non_equiv_states false
% 0.45/0.67 % --bmc1_deadlock false
% 0.45/0.67 % --bmc1_ucm false
% 0.45/0.67 % --bmc1_add_unsat_core none
% 0.45/0.67 % --bmc1_unsat_core_children false
% 0.45/0.67 % --bmc1_unsat_core_extrapolate_axioms false
% 0.45/0.67 % --bmc1_out_stat full
% 0.45/0.67 % --bmc1_ground_init false
% 0.45/0.67 % --bmc1_pre_inst_next_state false
% 0.45/0.67 % --bmc1_pre_inst_state false
% 0.45/0.67 % --bmc1_pre_inst_reach_state false
% 0.45/0.67 % --bmc1_out_unsat_core false
% 0.45/0.67 % --bmc1_aig_witness_out false
% 0.45/0.67 % --bmc1_verbose false
% 0.45/0.67 % --bmc1_dump_clauses_tptp false
% 0.45/0.67 % --bmc1_dump_unsat_core_tptp false
% 0.45/0.67 % --bmc1_dump_file -
% 0.45/0.67 % --bmc1_ucm_expand_uc_limit 128
% 0.45/0.67 % --bmc1_ucm_n_expand_iterations 6
% 0.45/0.67 % --bmc1_ucm_extend_mode 1
% 0.45/0.67 % --bmc1_ucm_init_mode 2
% 0.45/0.67 % --bmc1_ucm_cone_mode none
% 0.45/0.67 % --bmc1_ucm_reduced_relation_type 0
% 0.45/0.67 % --bmc1_ucm_relax_model 4
% 0.45/0.67 % --bmc1_ucm_full_tr_after_sat true
% 0.45/0.67 % --bmc1_ucm_expand_neg_assumptions false
% 0.45/0.67 % --bmc1_ucm_layered_model none
% 0.45/0.67 % --bmc1_ucm_max_lemma_size 10
% 0.45/0.67
% 0.45/0.67 % ------ AIG Options
% 0.45/0.67
% 0.45/0.67 % --aig_mode false
% 0.45/0.67
% 0.45/0.67 % ------ Instantiation Options
% 0.45/0.67
% 0.45/0.67 % --instantiation_flag true
% 0.45/0.67 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.45/0.67 % --inst_solver_per_active 750
% 0.45/0.67 % --inst_solver_calls_frac 0.5
% 0.45/0.67 % --inst_passive_queue_type priority_queues
% 0.45/0.67 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.45/0.67 % --inst_passive_queues_freq [25;2]
% 0.45/0.67 % --inst_dismatching true
% 0.45/0.67 % --inst_eager_unprocessed_to_passive true
% 1.63/1.82 % --inst_prop_sim_given true
% 1.63/1.82 % --inst_prop_sim_new false
% 1.63/1.82 % --inst_orphan_elimination true
% 1.63/1.82 % --inst_learning_loop_flag true
% 1.63/1.82 % --inst_learning_start 3000
% 1.63/1.82 % --inst_learning_factor 2
% 1.63/1.82 % --inst_start_prop_sim_after_learn 3
% 1.63/1.82 % --inst_sel_renew solver
% 1.63/1.82 % --inst_lit_activity_flag true
% 1.63/1.82 % --inst_out_proof true
% 1.63/1.82
% 1.63/1.82 % ------ Resolution Options
% 1.63/1.82
% 1.63/1.82 % --resolution_flag true
% 1.63/1.82 % --res_lit_sel kbo_max
% 1.63/1.82 % --res_to_prop_solver none
% 1.63/1.82 % --res_prop_simpl_new false
% 1.63/1.82 % --res_prop_simpl_given false
% 1.63/1.82 % --res_passive_queue_type priority_queues
% 1.63/1.82 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.63/1.82 % --res_passive_queues_freq [15;5]
% 1.63/1.82 % --res_forward_subs full
% 1.63/1.82 % --res_backward_subs full
% 1.63/1.82 % --res_forward_subs_resolution true
% 1.63/1.82 % --res_backward_subs_resolution true
% 1.63/1.82 % --res_orphan_elimination false
% 1.63/1.82 % --res_time_limit 1000.
% 1.63/1.82 % --res_out_proof true
% 1.63/1.82 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_00b8a3.s
% 1.63/1.82 % --modulo true
% 1.63/1.82
% 1.63/1.82 % ------ Combination Options
% 1.63/1.82
% 1.63/1.82 % --comb_res_mult 1000
% 1.63/1.82 % --comb_inst_mult 300
% 1.63/1.82 % ------
% 1.63/1.82
% 1.63/1.82
% 1.63/1.82
% 1.63/1.82 % ------ Proving...
% 1.63/1.82 % warning: shown sat in sat incomplete mode
% 1.63/1.82 %
% 1.63/1.82
% 1.63/1.82
% 1.63/1.82 ------ Building Model...Done
% 1.63/1.82
% 1.63/1.82 %------ The model is defined over ground terms (initial term algebra).
% 1.63/1.82 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.63/1.82 %------ where \phi is a formula over the term algebra.
% 1.63/1.82 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.63/1.82 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.63/1.82 %------ See help for --sat_out_model for different model outputs.
% 1.63/1.82 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.63/1.82 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.63/1.82
% 1.63/1.82
% 1.63/1.82
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c2_0
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( c2_0 <=>
% 1.63/1.82 $true
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Negative definition of c3_2
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 (! [X0,X1] :
% 1.63/1.82 ( ~(c3_2(X0,X1)) <=>
% 1.63/1.82 (
% 1.63/1.82 (
% 1.63/1.82 ( X0=a759 & X1=a760 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 |
% 1.63/1.82 (
% 1.63/1.82 ( X0=a738 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c1_2
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 (! [X0,X1] :
% 1.63/1.82 ( c1_2(X0,X1) <=>
% 1.63/1.82 (
% 1.63/1.82 (
% 1.63/1.82 ( X0=a769 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 |
% 1.63/1.82 (
% 1.63/1.82 ( X0=a738 & X1=a740 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c2_2
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 (! [X0,X1] :
% 1.63/1.82 ( c2_2(X0,X1) <=>
% 1.63/1.82 (
% 1.63/1.82 (
% 1.63/1.82 ( X0=a742 & X1=a743 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Negative definition of ndr1_1
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 (! [X0] :
% 1.63/1.82 ( ~(ndr1_1(X0)) <=>
% 1.63/1.82 (
% 1.63/1.82 (
% 1.63/1.82 ( X0=a729 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 |
% 1.63/1.82 (
% 1.63/1.82 ( X0=a738 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 |
% 1.63/1.82 (
% 1.63/1.82 ( X0=a731 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of ndr1_0
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( ndr1_0 <=>
% 1.63/1.82 $true
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c4_2
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 (! [X0,X1] :
% 1.63/1.82 ( c4_2(X0,X1) <=>
% 1.63/1.82 (
% 1.63/1.82 (
% 1.63/1.82 ( X0=a742 )
% 1.63/1.82 &
% 1.63/1.82 ( X1!=a743 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 |
% 1.63/1.82 (
% 1.63/1.82 ( X0=a759 & X1=a760 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 |
% 1.63/1.82 (
% 1.63/1.82 ( X0=a769 & X1=a770 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c5_2
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 (! [X0,X1] :
% 1.63/1.82 ( c5_2(X0,X1) <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c2_1
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 (! [X0] :
% 1.63/1.82 ( c2_1(X0) <=>
% 1.63/1.82 (
% 1.63/1.82 (
% 1.63/1.82 ( X0=a731 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c5_1
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 (! [X0] :
% 1.63/1.82 ( c5_1(X0) <=>
% 1.63/1.82 (
% 1.63/1.82 (
% 1.63/1.82 ( X0=a769 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Negative definition of c3_1
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 (! [X0] :
% 1.63/1.82 ( ~(c3_1(X0)) <=>
% 1.63/1.82 (
% 1.63/1.82 (
% 1.63/1.82 ( X0=a769 )
% 1.63/1.82 )
% 1.63/1.82
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c1_0
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( c1_0 <=>
% 1.63/1.82 $true
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c5_0
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( c5_0 <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c1_1
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 (! [X0] :
% 1.63/1.82 ( c1_1(X0) <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c4_0
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( c4_0 <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of c3_0
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( c3_0 <=>
% 1.63/1.82 $true
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Negative definition of c4_1
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 (! [X0] :
% 1.63/1.82 ( ~(c4_1(X0)) <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of epred1_0
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( epred1_0 <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP0_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP0_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP2_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP2_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP3_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP3_iProver_split <=>
% 1.63/1.82 $true
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP8_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP8_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP9_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP9_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP14_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP14_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP18_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP18_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP23_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP23_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP29_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP29_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP30_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP30_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP31_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP31_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP36_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP36_iProver_split <=>
% 1.63/1.82 $true
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP37_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP37_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP38_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP38_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP40_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP40_iProver_split <=>
% 1.63/1.82 $true
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP43_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP43_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP45_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP45_iProver_split <=>
% 1.63/1.82 $true
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP53_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP53_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP54_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP54_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP56_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP56_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP60_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP60_iProver_split <=>
% 1.63/1.82 $true
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP66_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP66_iProver_split <=>
% 1.63/1.82 $true
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP68_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP68_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP69_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP69_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP70_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP70_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP73_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP73_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82 %------ Positive definition of sP74_iProver_split
% 1.63/1.82 fof(lit_def,axiom,
% 1.63/1.82 ( sP74_iProver_split <=>
% 1.63/1.82 $false
% 1.63/1.82 )
% 1.63/1.82 ).
% 1.63/1.82
% 1.63/1.82
% 1.63/1.82
% 1.63/1.82 % ------ Statistics
% 1.63/1.82
% 1.63/1.82 % ------ General
% 1.63/1.82
% 1.63/1.82 % num_of_input_clauses: 397
% 1.63/1.82 % num_of_input_neg_conjectures: 369
% 1.63/1.82 % num_of_splits: 712
% 1.63/1.82 % num_of_split_atoms: 75
% 1.63/1.82 % num_of_sem_filtered_clauses: 0
% 1.63/1.82 % num_of_subtypes: 0
% 1.63/1.82 % monotx_restored_types: 0
% 1.63/1.82 % sat_num_of_epr_types: 0
% 1.63/1.82 % sat_num_of_non_cyclic_types: 0
% 1.63/1.82 % sat_guarded_non_collapsed_types: 0
% 1.63/1.82 % is_epr: 1
% 1.63/1.82 % is_horn: 0
% 1.63/1.82 % has_eq: 0
% 1.63/1.82 % num_pure_diseq_elim: 0
% 1.63/1.82 % simp_replaced_by: 0
% 1.63/1.82 % res_preprocessed: 1224
% 1.63/1.82 % prep_upred: 0
% 1.63/1.82 % prep_unflattend: 0
% 1.63/1.82 % pred_elim_cands: 75
% 1.63/1.82 % pred_elim: 48
% 1.63/1.82 % pred_elim_cl: 118
% 1.63/1.82 % pred_elim_cycles: 77
% 1.63/1.82 % forced_gc_time: 0
% 1.63/1.82 % gc_basic_clause_elim: 0
% 1.63/1.82 % parsing_time: 0.021
% 1.63/1.82 % sem_filter_time: 0.
% 1.63/1.82 % pred_elim_time: 0.114
% 1.63/1.82 % out_proof_time: 0.
% 1.63/1.82 % monotx_time: 0.
% 1.63/1.82 % subtype_inf_time: 0.
% 1.63/1.82 % unif_index_cands_time: 0.001
% 1.63/1.82 % unif_index_add_time: 0.001
% 1.63/1.82 % total_time: 1.389
% 1.63/1.82 % num_of_symbols: 168
% 1.63/1.82 % num_of_terms: 2056
% 1.63/1.82
% 1.63/1.82 % ------ Propositional Solver
% 1.63/1.82
% 1.63/1.82 % prop_solver_calls: 5
% 1.63/1.82 % prop_fast_solver_calls: 9927
% 1.63/1.82 % prop_num_of_clauses: 1468
% 1.63/1.82 % prop_preprocess_simplified: 8277
% 1.63/1.82 % prop_fo_subsumed: 621
% 1.63/1.82 % prop_solver_time: 0.
% 1.63/1.82 % prop_fast_solver_time: 0.011
% 1.63/1.82 % prop_unsat_core_time: 0.
% 1.63/1.82
% 1.63/1.82 % ------ QBF
% 1.63/1.82
% 1.63/1.82 % qbf_q_res: 0
% 1.63/1.82 % qbf_num_tautologies: 0
% 1.63/1.82 % qbf_prep_cycles: 0
% 1.63/1.82
% 1.63/1.82 % ------ BMC1
% 1.63/1.82
% 1.63/1.82 % bmc1_current_bound: -1
% 1.63/1.82 % bmc1_last_solved_bound: -1
% 1.63/1.82 % bmc1_unsat_core_size: -1
% 1.63/1.82 % bmc1_unsat_core_parents_size: -1
% 1.63/1.82 % bmc1_merge_next_fun: 0
% 1.63/1.82 % bmc1_unsat_core_clauses_time: 0.
% 1.63/1.82
% 1.63/1.82 % ------ Instantiation
% 1.63/1.82
% 1.63/1.82 % inst_num_of_clauses: 327
% 1.63/1.82 % inst_num_in_passive: 0
% 1.63/1.82 % inst_num_in_active: 327
% 1.63/1.82 % inst_num_in_unprocessed: 0
% 1.63/1.82 % inst_num_of_loops: 372
% 1.63/1.82 % inst_num_of_learning_restarts: 0
% 1.63/1.82 % inst_num_moves_active_passive: 40
% 1.63/1.82 % inst_lit_activity: 35
% 1.63/1.82 % inst_lit_activity_moves: 0
% 1.63/1.82 % inst_num_tautologies: 0
% 1.63/1.82 % inst_num_prop_implied: 0
% 1.63/1.82 % inst_num_existing_simplified: 0
% 1.63/1.82 % inst_num_eq_res_simplified: 0
% 1.63/1.82 % inst_num_child_elim: 0
% 1.63/1.82 % inst_num_of_dismatching_blockings: 0
% 1.63/1.82 % inst_num_of_non_proper_insts: 37
% 1.63/1.82 % inst_num_of_duplicates: 3
% 1.63/1.82 % inst_inst_num_from_inst_to_res: 0
% 1.63/1.82 % inst_dismatching_checking_time: 0.
% 1.63/1.82
% 1.63/1.82 % ------ Resolution
% 1.63/1.82
% 1.63/1.82 % res_num_of_clauses: 4270
% 1.63/1.82 % res_num_in_passive: 3218
% 1.63/1.82 % res_num_in_active: 1019
% 1.63/1.82 % res_num_of_loops: 2000
% 1.63/1.82 % res_forward_subset_subsumed: 412
% 1.63/1.82 % res_backward_subset_subsumed: 5
% 1.63/1.82 % res_forward_subsumed: 955
% 1.63/1.82 % res_backward_subsumed: 17
% 1.63/1.82 % res_forward_subsumption_resolution: 759
% 1.63/1.82 % res_backward_subsumption_resolution: 0
% 1.63/1.82 % res_clause_to_clause_subsumption: 5802
% 1.63/1.82 % res_orphan_elimination: 0
% 1.63/1.82 % res_tautology_del: 4218
% 1.63/1.82 % res_num_eq_res_simplified: 0
% 1.63/1.82 % res_num_sel_changes: 0
% 1.63/1.82 % res_moves_from_active_to_pass: 0
% 1.63/1.82
% 1.63/1.82 % Status Unknown
% 1.63/1.90 % Orienting using strategy ClausalAll
% 1.63/1.90 % FOF problem with conjecture
% 1.63/1.90 % 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_00b8a3.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c0cb64.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_b58d4c | grep -v "SZS"
% 1.74/1.91
% 1.74/1.91 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.74/1.91
% 1.74/1.91 %
% 1.74/1.91 % ------ iProver source info
% 1.74/1.91
% 1.74/1.91 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.74/1.91 % git: non_committed_changes: true
% 1.74/1.91 % git: last_make_outside_of_git: true
% 1.74/1.91
% 1.74/1.91 %
% 1.74/1.91 % ------ Input Options
% 1.74/1.91
% 1.74/1.91 % --out_options all
% 1.74/1.91 % --tptp_safe_out true
% 1.74/1.91 % --problem_path ""
% 1.74/1.91 % --include_path ""
% 1.74/1.91 % --clausifier .//eprover
% 1.74/1.91 % --clausifier_options --tstp-format
% 1.74/1.91 % --stdin false
% 1.74/1.91 % --dbg_backtrace false
% 1.74/1.91 % --dbg_dump_prop_clauses false
% 1.74/1.91 % --dbg_dump_prop_clauses_file -
% 1.74/1.91 % --dbg_out_stat false
% 1.74/1.91
% 1.74/1.91 % ------ General Options
% 1.74/1.91
% 1.74/1.91 % --fof false
% 1.74/1.91 % --time_out_real 150.
% 1.74/1.91 % --time_out_prep_mult 0.2
% 1.74/1.91 % --time_out_virtual -1.
% 1.74/1.91 % --schedule none
% 1.74/1.91 % --ground_splitting input
% 1.74/1.91 % --splitting_nvd 16
% 1.74/1.91 % --non_eq_to_eq false
% 1.74/1.91 % --prep_gs_sim true
% 1.74/1.91 % --prep_unflatten false
% 1.74/1.91 % --prep_res_sim true
% 1.74/1.91 % --prep_upred true
% 1.74/1.91 % --res_sim_input true
% 1.74/1.91 % --clause_weak_htbl true
% 1.74/1.91 % --gc_record_bc_elim false
% 1.74/1.91 % --symbol_type_check false
% 1.74/1.91 % --clausify_out false
% 1.74/1.91 % --large_theory_mode false
% 1.74/1.91 % --prep_sem_filter none
% 1.74/1.91 % --prep_sem_filter_out false
% 1.74/1.91 % --preprocessed_out false
% 1.74/1.91 % --sub_typing false
% 1.74/1.91 % --brand_transform false
% 1.74/1.91 % --pure_diseq_elim true
% 1.74/1.91 % --min_unsat_core false
% 1.74/1.91 % --pred_elim true
% 1.74/1.91 % --add_important_lit false
% 1.74/1.91 % --soft_assumptions false
% 1.74/1.91 % --reset_solvers false
% 1.74/1.91 % --bc_imp_inh []
% 1.74/1.91 % --conj_cone_tolerance 1.5
% 1.74/1.91 % --prolific_symb_bound 500
% 1.74/1.91 % --lt_threshold 2000
% 1.74/1.91
% 1.74/1.91 % ------ SAT Options
% 1.74/1.91
% 1.74/1.91 % --sat_mode false
% 1.74/1.91 % --sat_fm_restart_options ""
% 1.74/1.91 % --sat_gr_def false
% 1.74/1.91 % --sat_epr_types true
% 1.74/1.91 % --sat_non_cyclic_types false
% 1.74/1.91 % --sat_finite_models false
% 1.74/1.91 % --sat_fm_lemmas false
% 1.74/1.91 % --sat_fm_prep false
% 1.74/1.91 % --sat_fm_uc_incr true
% 1.74/1.91 % --sat_out_model small
% 1.74/1.91 % --sat_out_clauses false
% 1.74/1.91
% 1.74/1.91 % ------ QBF Options
% 1.74/1.91
% 1.74/1.91 % --qbf_mode false
% 1.74/1.91 % --qbf_elim_univ true
% 1.74/1.91 % --qbf_sk_in true
% 1.74/1.91 % --qbf_pred_elim true
% 1.74/1.91 % --qbf_split 32
% 1.74/1.91
% 1.74/1.91 % ------ BMC1 Options
% 1.74/1.91
% 1.74/1.91 % --bmc1_incremental false
% 1.74/1.91 % --bmc1_axioms reachable_all
% 1.74/1.91 % --bmc1_min_bound 0
% 1.74/1.91 % --bmc1_max_bound -1
% 1.74/1.91 % --bmc1_max_bound_default -1
% 1.74/1.91 % --bmc1_symbol_reachability true
% 1.74/1.91 % --bmc1_property_lemmas false
% 1.74/1.91 % --bmc1_k_induction false
% 1.74/1.91 % --bmc1_non_equiv_states false
% 1.74/1.91 % --bmc1_deadlock false
% 1.74/1.91 % --bmc1_ucm false
% 1.74/1.91 % --bmc1_add_unsat_core none
% 1.74/1.91 % --bmc1_unsat_core_children false
% 1.74/1.91 % --bmc1_unsat_core_extrapolate_axioms false
% 1.74/1.91 % --bmc1_out_stat full
% 1.74/1.91 % --bmc1_ground_init false
% 1.74/1.91 % --bmc1_pre_inst_next_state false
% 1.74/1.91 % --bmc1_pre_inst_state false
% 1.74/1.91 % --bmc1_pre_inst_reach_state false
% 1.74/1.91 % --bmc1_out_unsat_core false
% 1.74/1.91 % --bmc1_aig_witness_out false
% 1.74/1.91 % --bmc1_verbose false
% 1.74/1.91 % --bmc1_dump_clauses_tptp false
% 1.74/2.05 % --bmc1_dump_unsat_core_tptp false
% 1.74/2.05 % --bmc1_dump_file -
% 1.74/2.05 % --bmc1_ucm_expand_uc_limit 128
% 1.74/2.05 % --bmc1_ucm_n_expand_iterations 6
% 1.74/2.05 % --bmc1_ucm_extend_mode 1
% 1.74/2.05 % --bmc1_ucm_init_mode 2
% 1.74/2.05 % --bmc1_ucm_cone_mode none
% 1.74/2.05 % --bmc1_ucm_reduced_relation_type 0
% 1.74/2.05 % --bmc1_ucm_relax_model 4
% 1.74/2.05 % --bmc1_ucm_full_tr_after_sat true
% 1.74/2.05 % --bmc1_ucm_expand_neg_assumptions false
% 1.74/2.05 % --bmc1_ucm_layered_model none
% 1.74/2.05 % --bmc1_ucm_max_lemma_size 10
% 1.74/2.05
% 1.74/2.05 % ------ AIG Options
% 1.74/2.05
% 1.74/2.05 % --aig_mode false
% 1.74/2.05
% 1.74/2.05 % ------ Instantiation Options
% 1.74/2.05
% 1.74/2.05 % --instantiation_flag true
% 1.74/2.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.74/2.05 % --inst_solver_per_active 750
% 1.74/2.05 % --inst_solver_calls_frac 0.5
% 1.74/2.05 % --inst_passive_queue_type priority_queues
% 1.74/2.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.74/2.05 % --inst_passive_queues_freq [25;2]
% 1.74/2.05 % --inst_dismatching true
% 1.74/2.05 % --inst_eager_unprocessed_to_passive true
% 1.74/2.05 % --inst_prop_sim_given true
% 1.74/2.05 % --inst_prop_sim_new false
% 1.74/2.05 % --inst_orphan_elimination true
% 1.74/2.05 % --inst_learning_loop_flag true
% 1.74/2.05 % --inst_learning_start 3000
% 1.74/2.05 % --inst_learning_factor 2
% 1.74/2.05 % --inst_start_prop_sim_after_learn 3
% 1.74/2.05 % --inst_sel_renew solver
% 1.74/2.05 % --inst_lit_activity_flag true
% 1.74/2.05 % --inst_out_proof true
% 1.74/2.05
% 1.74/2.05 % ------ Resolution Options
% 1.74/2.05
% 1.74/2.05 % --resolution_flag true
% 1.74/2.05 % --res_lit_sel kbo_max
% 1.74/2.05 % --res_to_prop_solver none
% 1.74/2.05 % --res_prop_simpl_new false
% 1.74/2.05 % --res_prop_simpl_given false
% 1.74/2.05 % --res_passive_queue_type priority_queues
% 1.74/2.05 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.74/2.05 % --res_passive_queues_freq [15;5]
% 1.74/2.05 % --res_forward_subs full
% 1.74/2.05 % --res_backward_subs full
% 1.74/2.05 % --res_forward_subs_resolution true
% 1.74/2.05 % --res_backward_subs_resolution true
% 1.74/2.05 % --res_orphan_elimination false
% 1.74/2.05 % --res_time_limit 1000.
% 1.74/2.05 % --res_out_proof true
% 1.74/2.05 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_00b8a3.s
% 1.74/2.05 % --modulo true
% 1.74/2.05
% 1.74/2.05 % ------ Combination Options
% 1.74/2.05
% 1.74/2.05 % --comb_res_mult 1000
% 1.74/2.05 % --comb_inst_mult 300
% 1.74/2.05 % ------
% 1.74/2.05
% 1.74/2.05 % ------ Parsing...% successful
% 1.74/2.05
% 1.74/2.05 % ------ Preprocessing... gs_s sp: 712 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_e snvd_s sp: 0 0s snvd_e %
% 1.74/2.05
% 1.74/2.05 % ------ Proving...
% 1.74/2.05 % ------ Problem Properties
% 1.74/2.05
% 1.74/2.05 %
% 1.74/2.05 % EPR true
% 1.74/2.05 % Horn false
% 1.74/2.05 % Has equality false
% 1.74/2.05
% 1.74/2.05 % % ------ Input Options Time Limit: Unbounded
% 1.74/2.05
% 1.74/2.05
% 1.74/2.05 % % ------ Current options:
% 1.74/2.05
% 1.74/2.05 % ------ Input Options
% 1.74/2.05
% 1.74/2.05 % --out_options all
% 1.74/2.05 % --tptp_safe_out true
% 1.74/2.05 % --problem_path ""
% 1.74/2.05 % --include_path ""
% 1.74/2.05 % --clausifier .//eprover
% 1.74/2.05 % --clausifier_options --tstp-format
% 1.74/2.05 % --stdin false
% 1.74/2.05 % --dbg_backtrace false
% 1.74/2.05 % --dbg_dump_prop_clauses false
% 1.74/2.05 % --dbg_dump_prop_clauses_file -
% 1.74/2.05 % --dbg_out_stat false
% 1.74/2.05
% 1.74/2.05 % ------ General Options
% 1.74/2.05
% 1.74/2.05 % --fof false
% 1.74/2.05 % --time_out_real 150.
% 1.74/2.05 % --time_out_prep_mult 0.2
% 1.74/2.05 % --time_out_virtual -1.
% 1.74/2.05 % --schedule none
% 1.74/2.05 % --ground_splitting input
% 1.74/2.05 % --splitting_nvd 16
% 1.74/2.05 % --non_eq_to_eq false
% 1.74/2.05 % --prep_gs_sim true
% 1.74/2.05 % --prep_unflatten false
% 1.74/2.05 % --prep_res_sim true
% 1.74/2.05 % --prep_upred true
% 1.74/2.05 % --res_sim_input true
% 1.74/2.05 % --clause_weak_htbl true
% 1.74/2.05 % --gc_record_bc_elim false
% 1.74/2.05 % --symbol_type_check false
% 1.74/2.05 % --clausify_out false
% 1.74/2.05 % --large_theory_mode false
% 1.74/2.05 % --prep_sem_filter none
% 1.74/2.05 % --prep_sem_filter_out false
% 1.74/2.05 % --preprocessed_out false
% 1.74/2.05 % --sub_typing false
% 1.74/2.05 % --brand_transform false
% 1.74/2.05 % --pure_diseq_elim true
% 1.74/2.05 % --min_unsat_core false
% 1.74/2.05 % --pred_elim true
% 1.74/2.05 % --add_important_lit false
% 1.74/2.05 % --soft_assumptions false
% 1.74/2.05 % --reset_solvers false
% 1.74/2.05 % --bc_imp_inh []
% 1.74/2.05 % --conj_cone_tolerance 1.5
% 1.74/2.05 % --prolific_symb_bound 500
% 1.74/2.05 % --lt_threshold 2000
% 1.74/2.05
% 1.74/2.05 % ------ SAT Options
% 1.74/2.05
% 1.74/2.05 % --sat_mode false
% 1.74/2.05 % --sat_fm_restart_options ""
% 1.74/2.05 % --sat_gr_def false
% 1.74/2.05 % --sat_epr_types true
% 1.74/2.05 % --sat_non_cyclic_types false
% 1.74/2.05 % --sat_finite_models false
% 1.74/2.05 % --sat_fm_lemmas false
% 1.74/2.05 % --sat_fm_prep false
% 1.74/2.05 % --sat_fm_uc_incr true
% 1.74/2.05 % --sat_out_model small
% 1.74/2.05 % --sat_out_clauses false
% 1.74/2.05
% 1.74/2.05 % ------ QBF Options
% 1.74/2.05
% 1.74/2.05 % --qbf_mode false
% 1.74/2.05 % --qbf_elim_univ true
% 1.74/2.05 % --qbf_sk_in true
% 1.74/2.05 % --qbf_pred_elim true
% 1.74/2.05 % --qbf_split 32
% 1.74/2.05
% 1.74/2.05 % ------ BMC1 Options
% 1.74/2.05
% 1.74/2.05 % --bmc1_incremental false
% 1.74/2.05 % --bmc1_axioms reachable_all
% 1.74/2.05 % --bmc1_min_bound 0
% 1.74/2.05 % --bmc1_max_bound -1
% 1.74/2.05 % --bmc1_max_bound_default -1
% 1.74/2.05 % --bmc1_symbol_reachability true
% 1.74/2.05 % --bmc1_property_lemmas false
% 1.74/2.05 % --bmc1_k_induction false
% 1.74/2.05 % --bmc1_non_equiv_states false
% 1.74/2.05 % --bmc1_deadlock false
% 1.74/2.05 % --bmc1_ucm false
% 1.74/2.05 % --bmc1_add_unsat_core none
% 1.74/2.05 % --bmc1_unsat_core_children false
% 1.74/2.05 % --bmc1_unsat_core_extrapolate_axioms false
% 1.74/2.05 % --bmc1_out_stat full
% 1.74/2.05 % --bmc1_ground_init false
% 1.74/2.05 % --bmc1_pre_inst_next_state false
% 1.74/2.05 % --bmc1_pre_inst_state false
% 1.74/2.05 % --bmc1_pre_inst_reach_state false
% 1.74/2.05 % --bmc1_out_unsat_core false
% 1.74/2.05 % --bmc1_aig_witness_out false
% 1.74/2.05 % --bmc1_verbose false
% 1.74/2.05 % --bmc1_dump_clauses_tptp false
% 1.74/2.05 % --bmc1_dump_unsat_core_tptp false
% 1.74/2.05 % --bmc1_dump_file -
% 1.74/2.05 % --bmc1_ucm_expand_uc_limit 128
% 1.74/2.05 % --bmc1_ucm_n_expand_iterations 6
% 1.74/2.05 % --bmc1_ucm_extend_mode 1
% 1.74/2.05 % --bmc1_ucm_init_mode 2
% 1.74/2.05 % --bmc1_ucm_cone_mode none
% 1.74/2.05 % --bmc1_ucm_reduced_relation_type 0
% 1.74/2.05 % --bmc1_ucm_relax_model 4
% 1.74/2.05 % --bmc1_ucm_full_tr_after_sat true
% 1.74/2.05 % --bmc1_ucm_expand_neg_assumptions false
% 1.74/2.05 % --bmc1_ucm_layered_model none
% 1.74/2.05 % --bmc1_ucm_max_lemma_size 10
% 1.74/2.05
% 1.74/2.05 % ------ AIG Options
% 1.74/2.05
% 1.74/2.05 % --aig_mode false
% 1.74/2.05
% 1.74/2.05 % ------ Instantiation Options
% 1.74/2.05
% 1.74/2.05 % --instantiation_flag true
% 1.74/2.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.74/2.05 % --inst_solver_per_active 750
% 1.74/2.05 % --inst_solver_calls_frac 0.5
% 1.74/2.05 % --inst_passive_queue_type priority_queues
% 1.74/2.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.74/2.05 % --inst_passive_queues_freq [25;2]
% 1.74/2.05 % --inst_dismatching true
% 1.74/2.05 % --inst_eager_unprocessed_to_passive true
% 2.93/3.17 % --inst_prop_sim_given true
% 2.93/3.17 % --inst_prop_sim_new false
% 2.93/3.17 % --inst_orphan_elimination true
% 2.93/3.17 % --inst_learning_loop_flag true
% 2.93/3.17 % --inst_learning_start 3000
% 2.93/3.17 % --inst_learning_factor 2
% 2.93/3.17 % --inst_start_prop_sim_after_learn 3
% 2.93/3.17 % --inst_sel_renew solver
% 2.93/3.17 % --inst_lit_activity_flag true
% 2.93/3.17 % --inst_out_proof true
% 2.93/3.17
% 2.93/3.17 % ------ Resolution Options
% 2.93/3.17
% 2.93/3.17 % --resolution_flag true
% 2.93/3.17 % --res_lit_sel kbo_max
% 2.93/3.17 % --res_to_prop_solver none
% 2.93/3.17 % --res_prop_simpl_new false
% 2.93/3.17 % --res_prop_simpl_given false
% 2.93/3.17 % --res_passive_queue_type priority_queues
% 2.93/3.17 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.93/3.17 % --res_passive_queues_freq [15;5]
% 2.93/3.17 % --res_forward_subs full
% 2.93/3.17 % --res_backward_subs full
% 2.93/3.17 % --res_forward_subs_resolution true
% 2.93/3.17 % --res_backward_subs_resolution true
% 2.93/3.17 % --res_orphan_elimination false
% 2.93/3.17 % --res_time_limit 1000.
% 2.93/3.17 % --res_out_proof true
% 2.93/3.17 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_00b8a3.s
% 2.93/3.17 % --modulo true
% 2.93/3.17
% 2.93/3.17 % ------ Combination Options
% 2.93/3.17
% 2.93/3.17 % --comb_res_mult 1000
% 2.93/3.17 % --comb_inst_mult 300
% 2.93/3.17 % ------
% 2.93/3.17
% 2.93/3.17
% 2.93/3.17
% 2.93/3.17 % ------ Proving...
% 2.93/3.17 % warning: shown sat in sat incomplete mode
% 2.93/3.17 %
% 2.93/3.17
% 2.93/3.17
% 2.93/3.17 ------ Building Model...Done
% 2.93/3.17
% 2.93/3.17 %------ The model is defined over ground terms (initial term algebra).
% 2.93/3.17 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.93/3.17 %------ where \phi is a formula over the term algebra.
% 2.93/3.17 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.93/3.17 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.93/3.17 %------ See help for --sat_out_model for different model outputs.
% 2.93/3.17 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.93/3.17 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.93/3.17
% 2.93/3.17
% 2.93/3.17
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c2_0
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( c2_0 <=>
% 2.93/3.17 $true
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Negative definition of c3_2
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 (! [X0,X1] :
% 2.93/3.17 ( ~(c3_2(X0,X1)) <=>
% 2.93/3.17 (
% 2.93/3.17 (
% 2.93/3.17 ( X0=a759 & X1=a760 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 |
% 2.93/3.17 (
% 2.93/3.17 ( X0=a738 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c1_2
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 (! [X0,X1] :
% 2.93/3.17 ( c1_2(X0,X1) <=>
% 2.93/3.17 (
% 2.93/3.17 (
% 2.93/3.17 ( X0=a769 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 |
% 2.93/3.17 (
% 2.93/3.17 ( X0=a738 & X1=a740 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c2_2
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 (! [X0,X1] :
% 2.93/3.17 ( c2_2(X0,X1) <=>
% 2.93/3.17 (
% 2.93/3.17 (
% 2.93/3.17 ( X0=a742 & X1=a743 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Negative definition of ndr1_1
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 (! [X0] :
% 2.93/3.17 ( ~(ndr1_1(X0)) <=>
% 2.93/3.17 (
% 2.93/3.17 (
% 2.93/3.17 ( X0=a729 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 |
% 2.93/3.17 (
% 2.93/3.17 ( X0=a738 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 |
% 2.93/3.17 (
% 2.93/3.17 ( X0=a731 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of ndr1_0
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( ndr1_0 <=>
% 2.93/3.17 $true
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c4_2
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 (! [X0,X1] :
% 2.93/3.17 ( c4_2(X0,X1) <=>
% 2.93/3.17 (
% 2.93/3.17 (
% 2.93/3.17 ( X0=a742 )
% 2.93/3.17 &
% 2.93/3.17 ( X1!=a743 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 |
% 2.93/3.17 (
% 2.93/3.17 ( X0=a759 & X1=a760 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 |
% 2.93/3.17 (
% 2.93/3.17 ( X0=a769 & X1=a770 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c5_2
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 (! [X0,X1] :
% 2.93/3.17 ( c5_2(X0,X1) <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c2_1
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 (! [X0] :
% 2.93/3.17 ( c2_1(X0) <=>
% 2.93/3.17 (
% 2.93/3.17 (
% 2.93/3.17 ( X0=a731 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c5_1
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 (! [X0] :
% 2.93/3.17 ( c5_1(X0) <=>
% 2.93/3.17 (
% 2.93/3.17 (
% 2.93/3.17 ( X0=a769 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Negative definition of c3_1
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 (! [X0] :
% 2.93/3.17 ( ~(c3_1(X0)) <=>
% 2.93/3.17 (
% 2.93/3.17 (
% 2.93/3.17 ( X0=a769 )
% 2.93/3.17 )
% 2.93/3.17
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c1_0
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( c1_0 <=>
% 2.93/3.17 $true
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c5_0
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( c5_0 <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c1_1
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 (! [X0] :
% 2.93/3.17 ( c1_1(X0) <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c4_0
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( c4_0 <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of c3_0
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( c3_0 <=>
% 2.93/3.17 $true
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Negative definition of c4_1
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 (! [X0] :
% 2.93/3.17 ( ~(c4_1(X0)) <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of epred1_0
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( epred1_0 <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP0_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP0_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP2_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP2_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP3_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP3_iProver_split <=>
% 2.93/3.17 $true
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP8_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP8_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP9_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP9_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP14_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP14_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP18_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP18_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP23_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP23_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP29_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP29_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP30_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP30_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP31_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP31_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP36_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP36_iProver_split <=>
% 2.93/3.17 $true
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP37_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP37_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP38_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP38_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP40_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP40_iProver_split <=>
% 2.93/3.17 $true
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP43_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP43_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP45_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP45_iProver_split <=>
% 2.93/3.17 $true
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP53_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP53_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP54_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP54_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP56_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP56_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP60_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP60_iProver_split <=>
% 2.93/3.17 $true
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP66_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP66_iProver_split <=>
% 2.93/3.17 $true
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP68_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP68_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP69_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP69_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP70_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP70_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP73_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP73_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17 %------ Positive definition of sP74_iProver_split
% 2.93/3.17 fof(lit_def,axiom,
% 2.93/3.17 ( sP74_iProver_split <=>
% 2.93/3.17 $false
% 2.93/3.17 )
% 2.93/3.17 ).
% 2.93/3.17
% 2.93/3.17
% 2.93/3.17
% 2.93/3.17 % ------ Statistics
% 2.93/3.17
% 2.93/3.17 % ------ General
% 2.93/3.17
% 2.93/3.17 % num_of_input_clauses: 397
% 2.93/3.17 % num_of_input_neg_conjectures: 369
% 2.93/3.17 % num_of_splits: 712
% 2.93/3.17 % num_of_split_atoms: 75
% 2.93/3.17 % num_of_sem_filtered_clauses: 0
% 2.93/3.17 % num_of_subtypes: 0
% 2.93/3.17 % monotx_restored_types: 0
% 2.93/3.17 % sat_num_of_epr_types: 0
% 2.93/3.17 % sat_num_of_non_cyclic_types: 0
% 2.93/3.17 % sat_guarded_non_collapsed_types: 0
% 2.93/3.17 % is_epr: 1
% 2.93/3.17 % is_horn: 0
% 2.93/3.17 % has_eq: 0
% 2.93/3.17 % num_pure_diseq_elim: 0
% 2.93/3.17 % simp_replaced_by: 0
% 2.93/3.17 % res_preprocessed: 1224
% 2.93/3.17 % prep_upred: 0
% 2.93/3.17 % prep_unflattend: 0
% 2.93/3.17 % pred_elim_cands: 75
% 2.93/3.17 % pred_elim: 48
% 2.93/3.17 % pred_elim_cl: 118
% 2.93/3.17 % pred_elim_cycles: 77
% 2.93/3.17 % forced_gc_time: 0
% 2.93/3.17 % gc_basic_clause_elim: 0
% 2.93/3.17 % parsing_time: 0.011
% 2.93/3.17 % sem_filter_time: 0.
% 2.93/3.17 % pred_elim_time: 0.085
% 2.93/3.17 % out_proof_time: 0.
% 2.93/3.17 % monotx_time: 0.
% 2.93/3.17 % subtype_inf_time: 0.
% 2.93/3.17 % unif_index_cands_time: 0.001
% 2.93/3.17 % unif_index_add_time: 0.001
% 2.93/3.17 % total_time: 1.265
% 2.93/3.17 % num_of_symbols: 168
% 2.93/3.17 % num_of_terms: 2056
% 2.93/3.17
% 2.93/3.17 % ------ Propositional Solver
% 2.93/3.17
% 2.93/3.17 % prop_solver_calls: 5
% 2.93/3.17 % prop_fast_solver_calls: 9927
% 2.93/3.17 % prop_num_of_clauses: 1468
% 2.93/3.17 % prop_preprocess_simplified: 8277
% 2.93/3.17 % prop_fo_subsumed: 621
% 2.93/3.17 % prop_solver_time: 0.
% 2.93/3.17 % prop_fast_solver_time: 0.006
% 2.93/3.17 % prop_unsat_core_time: 0.
% 2.93/3.17
% 2.93/3.17 % ------ QBF
% 2.93/3.17
% 2.93/3.17 % qbf_q_res: 0
% 2.93/3.17 % qbf_num_tautologies: 0
% 2.93/3.17 % qbf_prep_cycles: 0
% 2.93/3.17
% 2.93/3.17 % ------ BMC1
% 2.93/3.17
% 2.93/3.17 % bmc1_current_bound: -1
% 2.93/3.17 % bmc1_last_solved_bound: -1
% 2.93/3.17 % bmc1_unsat_core_size: -1
% 2.93/3.17 % bmc1_unsat_core_parents_size: -1
% 2.93/3.17 % bmc1_merge_next_fun: 0
% 2.93/3.17 % bmc1_unsat_core_clauses_time: 0.
% 2.93/3.17
% 2.93/3.17 % ------ Instantiation
% 2.93/3.17
% 2.93/3.17 % inst_num_of_clauses: 327
% 2.93/3.17 % inst_num_in_passive: 0
% 2.93/3.17 % inst_num_in_active: 327
% 2.93/3.17 % inst_num_in_unprocessed: 0
% 2.93/3.17 % inst_num_of_loops: 372
% 2.93/3.17 % inst_num_of_learning_restarts: 0
% 2.93/3.17 % inst_num_moves_active_passive: 40
% 2.93/3.17 % inst_lit_activity: 35
% 2.93/3.17 % inst_lit_activity_moves: 0
% 2.93/3.17 % inst_num_tautologies: 0
% 2.93/3.17 % inst_num_prop_implied: 0
% 2.93/3.17 % inst_num_existing_simplified: 0
% 2.93/3.17 % inst_num_eq_res_simplified: 0
% 2.93/3.17 % inst_num_child_elim: 0
% 2.93/3.17 % inst_num_of_dismatching_blockings: 0
% 2.93/3.17 % inst_num_of_non_proper_insts: 37
% 2.93/3.17 % inst_num_of_duplicates: 3
% 2.93/3.17 % inst_inst_num_from_inst_to_res: 0
% 2.93/3.17 % inst_dismatching_checking_time: 0.
% 2.93/3.17
% 2.93/3.17 % ------ Resolution
% 2.93/3.17
% 2.93/3.17 % res_num_of_clauses: 4270
% 2.93/3.17 % res_num_in_passive: 3218
% 2.93/3.17 % res_num_in_active: 1019
% 2.93/3.17 % res_num_of_loops: 2000
% 2.93/3.17 % res_forward_subset_subsumed: 412
% 2.93/3.17 % res_backward_subset_subsumed: 5
% 2.93/3.17 % res_forward_subsumed: 955
% 2.93/3.17 % res_backward_subsumed: 17
% 2.93/3.17 % res_forward_subsumption_resolution: 759
% 2.93/3.17 % res_backward_subsumption_resolution: 0
% 2.93/3.17 % res_clause_to_clause_subsumption: 5802
% 2.93/3.17 % res_orphan_elimination: 0
% 2.93/3.17 % res_tautology_del: 4218
% 2.93/3.17 % res_num_eq_res_simplified: 0
% 2.93/3.17 % res_num_sel_changes: 0
% 2.93/3.17 % res_moves_from_active_to_pass: 0
% 2.93/3.17
% 2.93/3.17 % Status Unknown
% 2.93/3.17 % Last status :
% 2.93/3.17 % SZS status Unknown
%------------------------------------------------------------------------------