TSTP Solution File: SYN449+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN449+1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n011.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:28:05 EDT 2022
% Result : Unknown 4.50s 4.68s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN449+1 : TPTP v8.1.0. Released v2.1.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 23:20:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.42 % FOF problem with conjecture
% 0.20/0.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_1c73ee.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_4d4d0b.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_bc9dd5 | grep -v "SZS"
% 0.20/0.45
% 0.20/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.45
% 0.20/0.45 %
% 0.20/0.45 % ------ iProver source info
% 0.20/0.45
% 0.20/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.45 % git: non_committed_changes: true
% 0.20/0.45 % git: last_make_outside_of_git: true
% 0.20/0.45
% 0.20/0.45 %
% 0.20/0.45 % ------ Input Options
% 0.20/0.45
% 0.20/0.45 % --out_options all
% 0.20/0.45 % --tptp_safe_out true
% 0.20/0.45 % --problem_path ""
% 0.20/0.45 % --include_path ""
% 0.20/0.45 % --clausifier .//eprover
% 0.20/0.45 % --clausifier_options --tstp-format
% 0.20/0.45 % --stdin false
% 0.20/0.45 % --dbg_backtrace false
% 0.20/0.45 % --dbg_dump_prop_clauses false
% 0.20/0.45 % --dbg_dump_prop_clauses_file -
% 0.20/0.45 % --dbg_out_stat false
% 0.20/0.45
% 0.20/0.45 % ------ General Options
% 0.20/0.45
% 0.20/0.45 % --fof false
% 0.20/0.45 % --time_out_real 150.
% 0.20/0.45 % --time_out_prep_mult 0.2
% 0.20/0.45 % --time_out_virtual -1.
% 0.20/0.45 % --schedule none
% 0.20/0.45 % --ground_splitting input
% 0.20/0.45 % --splitting_nvd 16
% 0.20/0.45 % --non_eq_to_eq false
% 0.20/0.45 % --prep_gs_sim true
% 0.20/0.45 % --prep_unflatten false
% 0.20/0.45 % --prep_res_sim true
% 0.20/0.45 % --prep_upred true
% 0.20/0.45 % --res_sim_input true
% 0.20/0.45 % --clause_weak_htbl true
% 0.20/0.45 % --gc_record_bc_elim false
% 0.20/0.45 % --symbol_type_check false
% 0.20/0.45 % --clausify_out false
% 0.20/0.45 % --large_theory_mode false
% 0.20/0.45 % --prep_sem_filter none
% 0.20/0.45 % --prep_sem_filter_out false
% 0.20/0.45 % --preprocessed_out false
% 0.20/0.45 % --sub_typing false
% 0.20/0.45 % --brand_transform false
% 0.20/0.45 % --pure_diseq_elim true
% 0.20/0.45 % --min_unsat_core false
% 0.20/0.45 % --pred_elim true
% 0.20/0.45 % --add_important_lit false
% 0.20/0.45 % --soft_assumptions false
% 0.20/0.45 % --reset_solvers false
% 0.20/0.45 % --bc_imp_inh []
% 0.20/0.45 % --conj_cone_tolerance 1.5
% 0.20/0.45 % --prolific_symb_bound 500
% 0.20/0.45 % --lt_threshold 2000
% 0.20/0.45
% 0.20/0.45 % ------ SAT Options
% 0.20/0.45
% 0.20/0.45 % --sat_mode false
% 0.20/0.45 % --sat_fm_restart_options ""
% 0.20/0.45 % --sat_gr_def false
% 0.20/0.45 % --sat_epr_types true
% 0.20/0.45 % --sat_non_cyclic_types false
% 0.20/0.45 % --sat_finite_models false
% 0.20/0.45 % --sat_fm_lemmas false
% 0.20/0.45 % --sat_fm_prep false
% 0.20/0.45 % --sat_fm_uc_incr true
% 0.20/0.45 % --sat_out_model small
% 0.20/0.45 % --sat_out_clauses false
% 0.20/0.45
% 0.20/0.45 % ------ QBF Options
% 0.20/0.45
% 0.20/0.45 % --qbf_mode false
% 0.20/0.45 % --qbf_elim_univ true
% 0.20/0.45 % --qbf_sk_in true
% 0.20/0.45 % --qbf_pred_elim true
% 0.20/0.45 % --qbf_split 32
% 0.20/0.45
% 0.20/0.45 % ------ BMC1 Options
% 0.20/0.45
% 0.20/0.45 % --bmc1_incremental false
% 0.20/0.45 % --bmc1_axioms reachable_all
% 0.20/0.45 % --bmc1_min_bound 0
% 0.20/0.45 % --bmc1_max_bound -1
% 0.20/0.45 % --bmc1_max_bound_default -1
% 0.20/0.45 % --bmc1_symbol_reachability true
% 0.20/0.45 % --bmc1_property_lemmas false
% 0.20/0.45 % --bmc1_k_induction false
% 0.20/0.45 % --bmc1_non_equiv_states false
% 0.20/0.45 % --bmc1_deadlock false
% 0.20/0.45 % --bmc1_ucm false
% 0.20/0.45 % --bmc1_add_unsat_core none
% 0.20/0.45 % --bmc1_unsat_core_children false
% 0.20/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.45 % --bmc1_out_stat full
% 0.20/0.45 % --bmc1_ground_init false
% 0.20/0.45 % --bmc1_pre_inst_next_state false
% 0.20/0.45 % --bmc1_pre_inst_state false
% 0.20/0.45 % --bmc1_pre_inst_reach_state false
% 0.20/0.45 % --bmc1_out_unsat_core false
% 0.20/0.45 % --bmc1_aig_witness_out false
% 0.20/0.45 % --bmc1_verbose false
% 0.20/0.45 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 0.20/0.51 % --inst_prop_sim_given true
% 0.20/0.51 % --inst_prop_sim_new false
% 0.20/0.51 % --inst_orphan_elimination true
% 0.20/0.51 % --inst_learning_loop_flag true
% 0.20/0.51 % --inst_learning_start 3000
% 0.20/0.51 % --inst_learning_factor 2
% 0.20/0.51 % --inst_start_prop_sim_after_learn 3
% 0.20/0.51 % --inst_sel_renew solver
% 0.20/0.51 % --inst_lit_activity_flag true
% 0.20/0.51 % --inst_out_proof true
% 0.20/0.51
% 0.20/0.51 % ------ Resolution Options
% 0.20/0.51
% 0.20/0.51 % --resolution_flag true
% 0.20/0.51 % --res_lit_sel kbo_max
% 0.20/0.51 % --res_to_prop_solver none
% 0.20/0.51 % --res_prop_simpl_new false
% 0.20/0.51 % --res_prop_simpl_given false
% 0.20/0.51 % --res_passive_queue_type priority_queues
% 0.20/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.51 % --res_passive_queues_freq [15;5]
% 0.20/0.51 % --res_forward_subs full
% 0.20/0.51 % --res_backward_subs full
% 0.20/0.51 % --res_forward_subs_resolution true
% 0.20/0.51 % --res_backward_subs_resolution true
% 0.20/0.51 % --res_orphan_elimination false
% 0.20/0.51 % --res_time_limit 1000.
% 0.20/0.51 % --res_out_proof true
% 0.20/0.51 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_1c73ee.s
% 0.20/0.51 % --modulo true
% 0.20/0.51
% 0.20/0.51 % ------ Combination Options
% 0.20/0.51
% 0.20/0.51 % --comb_res_mult 1000
% 0.20/0.51 % --comb_inst_mult 300
% 0.20/0.51 % ------
% 0.20/0.51
% 0.20/0.51 % ------ Parsing...% successful
% 0.20/0.51
% 0.20/0.51 % ------ Preprocessing... gs_s sp: 172 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.51
% 0.20/0.51 % ------ Proving...
% 0.20/0.51 % ------ Problem Properties
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % EPR true
% 0.20/0.51 % Horn false
% 0.20/0.51 % Has equality false
% 0.20/0.51
% 0.20/0.51 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 % % ------ Current options:
% 0.20/0.51
% 0.20/0.51 % ------ Input Options
% 0.20/0.51
% 0.20/0.51 % --out_options all
% 0.20/0.51 % --tptp_safe_out true
% 0.20/0.51 % --problem_path ""
% 0.20/0.51 % --include_path ""
% 0.20/0.51 % --clausifier .//eprover
% 0.20/0.51 % --clausifier_options --tstp-format
% 0.20/0.51 % --stdin false
% 0.20/0.51 % --dbg_backtrace false
% 0.20/0.51 % --dbg_dump_prop_clauses false
% 0.20/0.51 % --dbg_dump_prop_clauses_file -
% 0.20/0.51 % --dbg_out_stat false
% 0.20/0.51
% 0.20/0.51 % ------ General Options
% 0.20/0.51
% 0.20/0.51 % --fof false
% 0.20/0.51 % --time_out_real 150.
% 0.20/0.51 % --time_out_prep_mult 0.2
% 0.20/0.51 % --time_out_virtual -1.
% 0.20/0.51 % --schedule none
% 0.20/0.51 % --ground_splitting input
% 0.20/0.51 % --splitting_nvd 16
% 0.20/0.51 % --non_eq_to_eq false
% 0.20/0.51 % --prep_gs_sim true
% 0.20/0.51 % --prep_unflatten false
% 0.20/0.51 % --prep_res_sim true
% 0.20/0.51 % --prep_upred true
% 0.20/0.51 % --res_sim_input true
% 0.20/0.51 % --clause_weak_htbl true
% 0.20/0.51 % --gc_record_bc_elim false
% 0.20/0.51 % --symbol_type_check false
% 0.20/0.51 % --clausify_out false
% 0.20/0.51 % --large_theory_mode false
% 0.20/0.51 % --prep_sem_filter none
% 0.20/0.51 % --prep_sem_filter_out false
% 0.20/0.51 % --preprocessed_out false
% 0.20/0.51 % --sub_typing false
% 0.20/0.51 % --brand_transform false
% 0.20/0.51 % --pure_diseq_elim true
% 0.20/0.51 % --min_unsat_core false
% 0.20/0.51 % --pred_elim true
% 0.20/0.51 % --add_important_lit false
% 0.20/0.51 % --soft_assumptions false
% 0.20/0.51 % --reset_solvers false
% 0.20/0.51 % --bc_imp_inh []
% 0.20/0.51 % --conj_cone_tolerance 1.5
% 0.20/0.51 % --prolific_symb_bound 500
% 0.20/0.51 % --lt_threshold 2000
% 0.20/0.51
% 0.20/0.51 % ------ SAT Options
% 0.20/0.51
% 0.20/0.51 % --sat_mode false
% 0.20/0.51 % --sat_fm_restart_options ""
% 0.20/0.51 % --sat_gr_def false
% 0.20/0.51 % --sat_epr_types true
% 0.20/0.51 % --sat_non_cyclic_types false
% 0.20/0.51 % --sat_finite_models false
% 0.20/0.51 % --sat_fm_lemmas false
% 0.20/0.51 % --sat_fm_prep false
% 0.20/0.51 % --sat_fm_uc_incr true
% 0.20/0.51 % --sat_out_model small
% 0.20/0.51 % --sat_out_clauses false
% 0.20/0.51
% 0.20/0.51 % ------ QBF Options
% 0.20/0.51
% 0.20/0.51 % --qbf_mode false
% 0.20/0.51 % --qbf_elim_univ true
% 0.20/0.51 % --qbf_sk_in true
% 0.20/0.51 % --qbf_pred_elim true
% 0.20/0.51 % --qbf_split 32
% 0.20/0.51
% 0.20/0.51 % ------ BMC1 Options
% 0.20/0.51
% 0.20/0.51 % --bmc1_incremental false
% 0.20/0.51 % --bmc1_axioms reachable_all
% 0.20/0.51 % --bmc1_min_bound 0
% 0.20/0.51 % --bmc1_max_bound -1
% 0.20/0.51 % --bmc1_max_bound_default -1
% 0.20/0.51 % --bmc1_symbol_reachability true
% 0.20/0.51 % --bmc1_property_lemmas false
% 0.20/0.51 % --bmc1_k_induction false
% 0.20/0.51 % --bmc1_non_equiv_states false
% 0.20/0.51 % --bmc1_deadlock false
% 0.20/0.51 % --bmc1_ucm false
% 0.20/0.51 % --bmc1_add_unsat_core none
% 0.20/0.51 % --bmc1_unsat_core_children false
% 0.20/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.51 % --bmc1_out_stat full
% 0.20/0.51 % --bmc1_ground_init false
% 0.20/0.51 % --bmc1_pre_inst_next_state false
% 0.20/0.51 % --bmc1_pre_inst_state false
% 0.20/0.51 % --bmc1_pre_inst_reach_state false
% 0.20/0.51 % --bmc1_out_unsat_core false
% 0.20/0.51 % --bmc1_aig_witness_out false
% 0.20/0.51 % --bmc1_verbose false
% 0.20/0.51 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 2.33/2.58 % --inst_prop_sim_given true
% 2.33/2.58 % --inst_prop_sim_new false
% 2.33/2.58 % --inst_orphan_elimination true
% 2.33/2.58 % --inst_learning_loop_flag true
% 2.33/2.58 % --inst_learning_start 3000
% 2.33/2.58 % --inst_learning_factor 2
% 2.33/2.58 % --inst_start_prop_sim_after_learn 3
% 2.33/2.58 % --inst_sel_renew solver
% 2.33/2.58 % --inst_lit_activity_flag true
% 2.33/2.58 % --inst_out_proof true
% 2.33/2.58
% 2.33/2.58 % ------ Resolution Options
% 2.33/2.58
% 2.33/2.58 % --resolution_flag true
% 2.33/2.58 % --res_lit_sel kbo_max
% 2.33/2.58 % --res_to_prop_solver none
% 2.33/2.58 % --res_prop_simpl_new false
% 2.33/2.58 % --res_prop_simpl_given false
% 2.33/2.58 % --res_passive_queue_type priority_queues
% 2.33/2.58 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.33/2.58 % --res_passive_queues_freq [15;5]
% 2.33/2.58 % --res_forward_subs full
% 2.33/2.58 % --res_backward_subs full
% 2.33/2.58 % --res_forward_subs_resolution true
% 2.33/2.58 % --res_backward_subs_resolution true
% 2.33/2.58 % --res_orphan_elimination false
% 2.33/2.58 % --res_time_limit 1000.
% 2.33/2.58 % --res_out_proof true
% 2.33/2.58 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_1c73ee.s
% 2.33/2.58 % --modulo true
% 2.33/2.58
% 2.33/2.58 % ------ Combination Options
% 2.33/2.58
% 2.33/2.58 % --comb_res_mult 1000
% 2.33/2.58 % --comb_inst_mult 300
% 2.33/2.58 % ------
% 2.33/2.58
% 2.33/2.58
% 2.33/2.58
% 2.33/2.58 % ------ Proving...
% 2.33/2.58 % warning: shown sat in sat incomplete mode
% 2.33/2.58 %
% 2.33/2.58
% 2.33/2.58
% 2.33/2.58 ------ Building Model...Done
% 2.33/2.58
% 2.33/2.58 %------ The model is defined over ground terms (initial term algebra).
% 2.33/2.58 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.33/2.58 %------ where \phi is a formula over the term algebra.
% 2.33/2.58 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.33/2.58 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.33/2.58 %------ See help for --sat_out_model for different model outputs.
% 2.33/2.58 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.33/2.58 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.33/2.58
% 2.33/2.58
% 2.33/2.58
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of c0_1
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 (! [X0] :
% 2.33/2.58 ( c0_1(X0) <=>
% 2.33/2.58 (
% 2.33/2.58 (
% 2.33/2.58 ( X0=a549 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a551 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a552 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a556 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a560 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a566 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a576 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a584 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a587 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a628 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a608 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 )
% 2.33/2.58 )
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of c3_1
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 (! [X0] :
% 2.33/2.58 ( c3_1(X0) <=>
% 2.33/2.58 (
% 2.33/2.58 (
% 2.33/2.58 ( X0=a548 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a550 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a558 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a561 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a563 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a564 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a570 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a599 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a607 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a581 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a609 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 )
% 2.33/2.58 )
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of c2_1
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 (! [X0] :
% 2.33/2.58 ( c2_1(X0) <=>
% 2.33/2.58 (
% 2.33/2.58 (
% 2.33/2.58 ( X0=a547 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a556 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a557 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a559 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a560 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a562 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a563 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a564 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a566 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a576 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a577 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a601 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a607 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a608 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a609 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 )
% 2.33/2.58 )
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Negative definition of c1_1
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 (! [X0] :
% 2.33/2.58 ( ~(c1_1(X0)) <=>
% 2.33/2.58 (
% 2.33/2.58 (
% 2.33/2.58 ( X0=a547 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a549 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a551 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a552 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a554 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a555 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a556 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a557 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a559 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a560 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a562 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a566 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a576 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a577 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a584 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a587 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a601 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a628 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 |
% 2.33/2.58 (
% 2.33/2.58 ( X0=a608 )
% 2.33/2.58 )
% 2.33/2.58
% 2.33/2.58 )
% 2.33/2.58 )
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of ndr1_0
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( ndr1_0 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp24
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp24 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp16
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp16 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp15
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp15 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp19
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp19 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp29
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp29 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp0
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp0 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp11
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp11 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp17
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp17 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp21
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp21 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp22
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp22 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp9
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp9 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp3
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp3 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp7
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp7 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp12
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp12 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp31
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp31 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp6
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp6 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp25
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp25 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp28
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp28 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp18
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp18 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp13
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp13 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp20
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp20 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp23
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp23 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp8
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp8 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp10
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp10 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp4
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp4 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp26
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp26 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp30
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp30 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp14
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp14 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp5
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp5 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp2
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp2 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp1
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp1 <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of hskp27
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( hskp27 <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP0_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP0_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP1_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP1_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP2_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP2_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP3_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP3_iProver_split <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP4_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP4_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP5_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP5_iProver_split <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP6_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP6_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP7_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP7_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP8_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP8_iProver_split <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP9_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP9_iProver_split <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP10_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP10_iProver_split <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP11_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP11_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP13_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP13_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP14_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP14_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP15_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP15_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP16_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP16_iProver_split <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP17_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP17_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP19_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP19_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP21_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP21_iProver_split <=>
% 2.33/2.58 $true
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP25_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP25_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58 %------ Positive definition of sP26_iProver_split
% 2.33/2.58 fof(lit_def,axiom,
% 2.33/2.58 ( sP26_iProver_split <=>
% 2.33/2.58 $false
% 2.33/2.58 )
% 2.33/2.58 ).
% 2.33/2.58
% 2.33/2.58
% 2.33/2.58
% 2.33/2.58 % ------ Statistics
% 2.33/2.58
% 2.33/2.58 % ------ General
% 2.33/2.58
% 2.33/2.58 % num_of_input_clauses: 188
% 2.33/2.58 % num_of_input_neg_conjectures: 188
% 2.33/2.58 % num_of_splits: 172
% 2.33/2.58 % num_of_split_atoms: 29
% 2.33/2.58 % num_of_sem_filtered_clauses: 0
% 2.33/2.58 % num_of_subtypes: 0
% 2.33/2.58 % monotx_restored_types: 0
% 2.33/2.58 % sat_num_of_epr_types: 0
% 2.33/2.58 % sat_num_of_non_cyclic_types: 0
% 2.33/2.58 % sat_guarded_non_collapsed_types: 0
% 2.33/2.58 % is_epr: 1
% 2.33/2.58 % is_horn: 0
% 2.33/2.58 % has_eq: 0
% 2.33/2.58 % num_pure_diseq_elim: 0
% 2.33/2.58 % simp_replaced_by: 0
% 2.33/2.58 % res_preprocessed: 548
% 2.33/2.58 % prep_upred: 0
% 2.33/2.58 % prep_unflattend: 0
% 2.33/2.58 % pred_elim_cands: 29
% 2.33/2.58 % pred_elim: 8
% 2.33/2.58 % pred_elim_cl: 8
% 2.33/2.58 % pred_elim_cycles: 29
% 2.33/2.58 % forced_gc_time: 0
% 2.33/2.58 % gc_basic_clause_elim: 0
% 2.33/2.58 % parsing_time: 0.004
% 2.33/2.58 % sem_filter_time: 0.
% 2.33/2.58 % pred_elim_time: 0.035
% 2.33/2.58 % out_proof_time: 0.
% 2.33/2.58 % monotx_time: 0.
% 2.33/2.58 % subtype_inf_time: 0.
% 2.33/2.58 % unif_index_cands_time: 0.006
% 2.33/2.58 % unif_index_add_time: 0.005
% 2.33/2.58 % total_time: 2.15
% 2.33/2.58 % num_of_symbols: 123
% 2.33/2.58 % num_of_terms: 448
% 2.33/2.58
% 2.33/2.58 % ------ Propositional Solver
% 2.33/2.58
% 2.33/2.58 % prop_solver_calls: 15
% 2.33/2.58 % prop_fast_solver_calls: 3001
% 2.33/2.58 % prop_num_of_clauses: 1203
% 2.33/2.58 % prop_preprocess_simplified: 3966
% 2.33/2.58 % prop_fo_subsumed: 174
% 2.33/2.58 % prop_solver_time: 0.001
% 2.33/2.58 % prop_fast_solver_time: 0.003
% 2.33/2.58 % prop_unsat_core_time: 0.
% 2.33/2.58
% 2.33/2.58 % ------ QBF
% 2.33/2.58
% 2.33/2.58 % qbf_q_res: 0
% 2.33/2.58 % qbf_num_tautologies: 0
% 2.33/2.58 % qbf_prep_cycles: 0
% 2.33/2.58
% 2.33/2.58 % ------ BMC1
% 2.33/2.58
% 2.33/2.58 % bmc1_current_bound: -1
% 2.33/2.58 % bmc1_last_solved_bound: -1
% 2.33/2.58 % bmc1_unsat_core_size: -1
% 2.33/2.58 % bmc1_unsat_core_parents_size: -1
% 2.33/2.58 % bmc1_merge_next_fun: 0
% 2.33/2.58 % bmc1_unsat_core_clauses_time: 0.
% 2.33/2.58
% 2.33/2.58 % ------ Instantiation
% 2.33/2.58
% 2.33/2.58 % inst_num_of_clauses: 829
% 2.33/2.58 % inst_num_in_passive: 0
% 2.33/2.58 % inst_num_in_active: 829
% 2.33/2.58 % inst_num_in_unprocessed: 0
% 2.33/2.58 % inst_num_of_loops: 1735
% 2.33/2.58 % inst_num_of_learning_restarts: 0
% 2.33/2.58 % inst_num_moves_active_passive: 895
% 2.33/2.58 % inst_lit_activity: 68
% 2.33/2.58 % inst_lit_activity_moves: 0
% 2.33/2.58 % inst_num_tautologies: 0
% 2.33/2.58 % inst_num_prop_implied: 0
% 2.33/2.58 % inst_num_existing_simplified: 0
% 2.33/2.58 % inst_num_eq_res_simplified: 0
% 2.33/2.58 % inst_num_child_elim: 0
% 2.33/2.58 % inst_num_of_dismatching_blockings: 0
% 2.33/2.58 % inst_num_of_non_proper_insts: 994
% 2.33/2.58 % inst_num_of_duplicates: 301
% 2.33/2.58 % inst_inst_num_from_inst_to_res: 0
% 2.33/2.58 % inst_dismatching_checking_time: 0.
% 2.33/2.58
% 2.33/2.58 % ------ Resolution
% 2.33/2.58
% 2.33/2.58 % res_num_of_clauses: 49021
% 2.33/2.58 % res_num_in_passive: 49019
% 2.33/2.58 % res_num_in_active: 3480
% 2.33/2.58 % res_num_of_loops: 6000
% 2.33/2.58 % res_forward_subset_subsumed: 13346
% 2.33/2.58 % res_backward_subset_subsumed: 4010
% 2.33/2.58 % res_forward_subsumed: 1804
% 2.33/2.58 % res_backward_subsumed: 282
% 2.33/2.58 % res_forward_subsumption_resolution: 924
% 2.33/2.58 % res_backward_subsumption_resolution: 195
% 2.33/2.58 % res_clause_to_clause_subsumption: 3205
% 2.33/2.58 % res_orphan_elimination: 0
% 2.33/2.58 % res_tautology_del: 15507
% 2.33/2.58 % res_num_eq_res_simplified: 0
% 2.33/2.58 % res_num_sel_changes: 0
% 2.33/2.58 % res_moves_from_active_to_pass: 0
% 2.33/2.58
% 2.33/2.58 % Status Unknown
% 2.42/2.64 % Orienting using strategy ClausalAll
% 2.42/2.64 % FOF problem with conjecture
% 2.42/2.64 % 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_1c73ee.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_4d4d0b.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_e43293 | grep -v "SZS"
% 2.42/2.66
% 2.42/2.66 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 2.42/2.66
% 2.42/2.66 %
% 2.42/2.66 % ------ iProver source info
% 2.42/2.66
% 2.42/2.66 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 2.42/2.66 % git: non_committed_changes: true
% 2.42/2.66 % git: last_make_outside_of_git: true
% 2.42/2.66
% 2.42/2.66 %
% 2.42/2.66 % ------ Input Options
% 2.42/2.66
% 2.42/2.66 % --out_options all
% 2.42/2.66 % --tptp_safe_out true
% 2.42/2.66 % --problem_path ""
% 2.42/2.66 % --include_path ""
% 2.42/2.66 % --clausifier .//eprover
% 2.42/2.66 % --clausifier_options --tstp-format
% 2.42/2.66 % --stdin false
% 2.42/2.66 % --dbg_backtrace false
% 2.42/2.66 % --dbg_dump_prop_clauses false
% 2.42/2.66 % --dbg_dump_prop_clauses_file -
% 2.42/2.66 % --dbg_out_stat false
% 2.42/2.66
% 2.42/2.66 % ------ General Options
% 2.42/2.66
% 2.42/2.66 % --fof false
% 2.42/2.66 % --time_out_real 150.
% 2.42/2.66 % --time_out_prep_mult 0.2
% 2.42/2.66 % --time_out_virtual -1.
% 2.42/2.66 % --schedule none
% 2.42/2.66 % --ground_splitting input
% 2.42/2.66 % --splitting_nvd 16
% 2.42/2.66 % --non_eq_to_eq false
% 2.42/2.66 % --prep_gs_sim true
% 2.42/2.66 % --prep_unflatten false
% 2.42/2.66 % --prep_res_sim true
% 2.42/2.66 % --prep_upred true
% 2.42/2.66 % --res_sim_input true
% 2.42/2.66 % --clause_weak_htbl true
% 2.42/2.66 % --gc_record_bc_elim false
% 2.42/2.66 % --symbol_type_check false
% 2.42/2.66 % --clausify_out false
% 2.42/2.66 % --large_theory_mode false
% 2.42/2.66 % --prep_sem_filter none
% 2.42/2.66 % --prep_sem_filter_out false
% 2.42/2.66 % --preprocessed_out false
% 2.42/2.66 % --sub_typing false
% 2.42/2.66 % --brand_transform false
% 2.42/2.66 % --pure_diseq_elim true
% 2.42/2.66 % --min_unsat_core false
% 2.42/2.66 % --pred_elim true
% 2.42/2.66 % --add_important_lit false
% 2.42/2.66 % --soft_assumptions false
% 2.42/2.66 % --reset_solvers false
% 2.42/2.66 % --bc_imp_inh []
% 2.42/2.66 % --conj_cone_tolerance 1.5
% 2.42/2.66 % --prolific_symb_bound 500
% 2.42/2.66 % --lt_threshold 2000
% 2.42/2.66
% 2.42/2.66 % ------ SAT Options
% 2.42/2.66
% 2.42/2.66 % --sat_mode false
% 2.42/2.66 % --sat_fm_restart_options ""
% 2.42/2.66 % --sat_gr_def false
% 2.42/2.66 % --sat_epr_types true
% 2.42/2.66 % --sat_non_cyclic_types false
% 2.42/2.66 % --sat_finite_models false
% 2.42/2.66 % --sat_fm_lemmas false
% 2.42/2.66 % --sat_fm_prep false
% 2.42/2.66 % --sat_fm_uc_incr true
% 2.42/2.66 % --sat_out_model small
% 2.42/2.66 % --sat_out_clauses false
% 2.42/2.66
% 2.42/2.66 % ------ QBF Options
% 2.42/2.66
% 2.42/2.66 % --qbf_mode false
% 2.42/2.66 % --qbf_elim_univ true
% 2.42/2.66 % --qbf_sk_in true
% 2.42/2.66 % --qbf_pred_elim true
% 2.42/2.66 % --qbf_split 32
% 2.42/2.66
% 2.42/2.66 % ------ BMC1 Options
% 2.42/2.66
% 2.42/2.66 % --bmc1_incremental false
% 2.42/2.66 % --bmc1_axioms reachable_all
% 2.42/2.66 % --bmc1_min_bound 0
% 2.42/2.66 % --bmc1_max_bound -1
% 2.42/2.66 % --bmc1_max_bound_default -1
% 2.42/2.66 % --bmc1_symbol_reachability true
% 2.42/2.66 % --bmc1_property_lemmas false
% 2.42/2.66 % --bmc1_k_induction false
% 2.42/2.66 % --bmc1_non_equiv_states false
% 2.42/2.66 % --bmc1_deadlock false
% 2.42/2.66 % --bmc1_ucm false
% 2.42/2.66 % --bmc1_add_unsat_core none
% 2.42/2.66 % --bmc1_unsat_core_children false
% 2.42/2.66 % --bmc1_unsat_core_extrapolate_axioms false
% 2.42/2.66 % --bmc1_out_stat full
% 2.42/2.66 % --bmc1_ground_init false
% 2.42/2.66 % --bmc1_pre_inst_next_state false
% 2.42/2.66 % --bmc1_pre_inst_state false
% 2.42/2.66 % --bmc1_pre_inst_reach_state false
% 2.42/2.66 % --bmc1_out_unsat_core false
% 2.42/2.66 % --bmc1_aig_witness_out false
% 2.42/2.66 % --bmc1_verbose false
% 2.42/2.66 % --bmc1_dump_clauses_tptp false
% 2.48/2.70 % --bmc1_dump_unsat_core_tptp false
% 2.48/2.70 % --bmc1_dump_file -
% 2.48/2.70 % --bmc1_ucm_expand_uc_limit 128
% 2.48/2.70 % --bmc1_ucm_n_expand_iterations 6
% 2.48/2.70 % --bmc1_ucm_extend_mode 1
% 2.48/2.70 % --bmc1_ucm_init_mode 2
% 2.48/2.70 % --bmc1_ucm_cone_mode none
% 2.48/2.70 % --bmc1_ucm_reduced_relation_type 0
% 2.48/2.70 % --bmc1_ucm_relax_model 4
% 2.48/2.70 % --bmc1_ucm_full_tr_after_sat true
% 2.48/2.70 % --bmc1_ucm_expand_neg_assumptions false
% 2.48/2.70 % --bmc1_ucm_layered_model none
% 2.48/2.70 % --bmc1_ucm_max_lemma_size 10
% 2.48/2.70
% 2.48/2.70 % ------ AIG Options
% 2.48/2.70
% 2.48/2.70 % --aig_mode false
% 2.48/2.70
% 2.48/2.70 % ------ Instantiation Options
% 2.48/2.70
% 2.48/2.70 % --instantiation_flag true
% 2.48/2.70 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.48/2.70 % --inst_solver_per_active 750
% 2.48/2.70 % --inst_solver_calls_frac 0.5
% 2.48/2.70 % --inst_passive_queue_type priority_queues
% 2.48/2.70 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.48/2.70 % --inst_passive_queues_freq [25;2]
% 2.48/2.70 % --inst_dismatching true
% 2.48/2.70 % --inst_eager_unprocessed_to_passive true
% 2.48/2.70 % --inst_prop_sim_given true
% 2.48/2.70 % --inst_prop_sim_new false
% 2.48/2.70 % --inst_orphan_elimination true
% 2.48/2.70 % --inst_learning_loop_flag true
% 2.48/2.70 % --inst_learning_start 3000
% 2.48/2.70 % --inst_learning_factor 2
% 2.48/2.70 % --inst_start_prop_sim_after_learn 3
% 2.48/2.70 % --inst_sel_renew solver
% 2.48/2.70 % --inst_lit_activity_flag true
% 2.48/2.70 % --inst_out_proof true
% 2.48/2.70
% 2.48/2.70 % ------ Resolution Options
% 2.48/2.70
% 2.48/2.70 % --resolution_flag true
% 2.48/2.70 % --res_lit_sel kbo_max
% 2.48/2.70 % --res_to_prop_solver none
% 2.48/2.70 % --res_prop_simpl_new false
% 2.48/2.70 % --res_prop_simpl_given false
% 2.48/2.70 % --res_passive_queue_type priority_queues
% 2.48/2.70 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.48/2.70 % --res_passive_queues_freq [15;5]
% 2.48/2.70 % --res_forward_subs full
% 2.48/2.70 % --res_backward_subs full
% 2.48/2.70 % --res_forward_subs_resolution true
% 2.48/2.70 % --res_backward_subs_resolution true
% 2.48/2.70 % --res_orphan_elimination false
% 2.48/2.70 % --res_time_limit 1000.
% 2.48/2.70 % --res_out_proof true
% 2.48/2.70 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_1c73ee.s
% 2.48/2.70 % --modulo true
% 2.48/2.70
% 2.48/2.70 % ------ Combination Options
% 2.48/2.70
% 2.48/2.70 % --comb_res_mult 1000
% 2.48/2.70 % --comb_inst_mult 300
% 2.48/2.70 % ------
% 2.48/2.70
% 2.48/2.70 % ------ Parsing...% successful
% 2.48/2.70
% 2.48/2.70 % ------ Preprocessing... gs_s sp: 172 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 2.48/2.70
% 2.48/2.70 % ------ Proving...
% 2.48/2.70 % ------ Problem Properties
% 2.48/2.70
% 2.48/2.70 %
% 2.48/2.70 % EPR true
% 2.48/2.70 % Horn false
% 2.48/2.70 % Has equality false
% 2.48/2.70
% 2.48/2.70 % % ------ Input Options Time Limit: Unbounded
% 2.48/2.70
% 2.48/2.70
% 2.48/2.70 % % ------ Current options:
% 2.48/2.70
% 2.48/2.70 % ------ Input Options
% 2.48/2.70
% 2.48/2.70 % --out_options all
% 2.48/2.70 % --tptp_safe_out true
% 2.48/2.70 % --problem_path ""
% 2.48/2.70 % --include_path ""
% 2.48/2.70 % --clausifier .//eprover
% 2.48/2.70 % --clausifier_options --tstp-format
% 2.48/2.70 % --stdin false
% 2.48/2.70 % --dbg_backtrace false
% 2.48/2.70 % --dbg_dump_prop_clauses false
% 2.48/2.70 % --dbg_dump_prop_clauses_file -
% 2.48/2.70 % --dbg_out_stat false
% 2.48/2.70
% 2.48/2.70 % ------ General Options
% 2.48/2.70
% 2.48/2.70 % --fof false
% 2.48/2.70 % --time_out_real 150.
% 2.48/2.70 % --time_out_prep_mult 0.2
% 2.48/2.70 % --time_out_virtual -1.
% 2.48/2.70 % --schedule none
% 2.48/2.70 % --ground_splitting input
% 2.48/2.70 % --splitting_nvd 16
% 2.48/2.70 % --non_eq_to_eq false
% 2.48/2.70 % --prep_gs_sim true
% 2.48/2.70 % --prep_unflatten false
% 2.48/2.70 % --prep_res_sim true
% 2.48/2.70 % --prep_upred true
% 2.48/2.70 % --res_sim_input true
% 2.48/2.70 % --clause_weak_htbl true
% 2.48/2.70 % --gc_record_bc_elim false
% 2.48/2.70 % --symbol_type_check false
% 2.48/2.70 % --clausify_out false
% 2.48/2.70 % --large_theory_mode false
% 2.48/2.70 % --prep_sem_filter none
% 2.48/2.70 % --prep_sem_filter_out false
% 2.48/2.70 % --preprocessed_out false
% 2.48/2.70 % --sub_typing false
% 2.48/2.70 % --brand_transform false
% 2.48/2.70 % --pure_diseq_elim true
% 2.48/2.70 % --min_unsat_core false
% 2.48/2.70 % --pred_elim true
% 2.48/2.70 % --add_important_lit false
% 2.48/2.70 % --soft_assumptions false
% 2.48/2.70 % --reset_solvers false
% 2.48/2.70 % --bc_imp_inh []
% 2.48/2.70 % --conj_cone_tolerance 1.5
% 2.48/2.70 % --prolific_symb_bound 500
% 2.48/2.70 % --lt_threshold 2000
% 2.48/2.70
% 2.48/2.70 % ------ SAT Options
% 2.48/2.70
% 2.48/2.70 % --sat_mode false
% 2.48/2.70 % --sat_fm_restart_options ""
% 2.48/2.70 % --sat_gr_def false
% 2.48/2.70 % --sat_epr_types true
% 2.48/2.70 % --sat_non_cyclic_types false
% 2.48/2.70 % --sat_finite_models false
% 2.48/2.70 % --sat_fm_lemmas false
% 2.48/2.70 % --sat_fm_prep false
% 2.48/2.70 % --sat_fm_uc_incr true
% 2.48/2.70 % --sat_out_model small
% 2.48/2.70 % --sat_out_clauses false
% 2.48/2.70
% 2.48/2.70 % ------ QBF Options
% 2.48/2.70
% 2.48/2.70 % --qbf_mode false
% 2.48/2.70 % --qbf_elim_univ true
% 2.48/2.70 % --qbf_sk_in true
% 2.48/2.70 % --qbf_pred_elim true
% 2.48/2.70 % --qbf_split 32
% 2.48/2.70
% 2.48/2.70 % ------ BMC1 Options
% 2.48/2.70
% 2.48/2.70 % --bmc1_incremental false
% 2.48/2.70 % --bmc1_axioms reachable_all
% 2.48/2.70 % --bmc1_min_bound 0
% 2.48/2.70 % --bmc1_max_bound -1
% 2.48/2.70 % --bmc1_max_bound_default -1
% 2.48/2.70 % --bmc1_symbol_reachability true
% 2.48/2.70 % --bmc1_property_lemmas false
% 2.48/2.70 % --bmc1_k_induction false
% 2.48/2.70 % --bmc1_non_equiv_states false
% 2.48/2.70 % --bmc1_deadlock false
% 2.48/2.70 % --bmc1_ucm false
% 2.48/2.70 % --bmc1_add_unsat_core none
% 2.48/2.70 % --bmc1_unsat_core_children false
% 2.48/2.70 % --bmc1_unsat_core_extrapolate_axioms false
% 2.48/2.70 % --bmc1_out_stat full
% 2.48/2.70 % --bmc1_ground_init false
% 2.48/2.70 % --bmc1_pre_inst_next_state false
% 2.48/2.70 % --bmc1_pre_inst_state false
% 2.48/2.70 % --bmc1_pre_inst_reach_state false
% 2.48/2.70 % --bmc1_out_unsat_core false
% 2.48/2.70 % --bmc1_aig_witness_out false
% 2.48/2.70 % --bmc1_verbose false
% 2.48/2.70 % --bmc1_dump_clauses_tptp false
% 2.48/2.70 % --bmc1_dump_unsat_core_tptp false
% 2.48/2.70 % --bmc1_dump_file -
% 2.48/2.70 % --bmc1_ucm_expand_uc_limit 128
% 2.48/2.70 % --bmc1_ucm_n_expand_iterations 6
% 2.48/2.70 % --bmc1_ucm_extend_mode 1
% 2.48/2.70 % --bmc1_ucm_init_mode 2
% 2.48/2.70 % --bmc1_ucm_cone_mode none
% 2.48/2.70 % --bmc1_ucm_reduced_relation_type 0
% 2.48/2.70 % --bmc1_ucm_relax_model 4
% 2.48/2.70 % --bmc1_ucm_full_tr_after_sat true
% 2.48/2.70 % --bmc1_ucm_expand_neg_assumptions false
% 2.48/2.70 % --bmc1_ucm_layered_model none
% 2.48/2.70 % --bmc1_ucm_max_lemma_size 10
% 2.48/2.70
% 2.48/2.70 % ------ AIG Options
% 2.48/2.70
% 2.48/2.70 % --aig_mode false
% 2.48/2.70
% 2.48/2.70 % ------ Instantiation Options
% 2.48/2.70
% 2.48/2.70 % --instantiation_flag true
% 2.48/2.70 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.48/2.70 % --inst_solver_per_active 750
% 2.48/2.70 % --inst_solver_calls_frac 0.5
% 2.48/2.70 % --inst_passive_queue_type priority_queues
% 2.48/2.70 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.48/2.70 % --inst_passive_queues_freq [25;2]
% 2.48/2.70 % --inst_dismatching true
% 2.48/2.70 % --inst_eager_unprocessed_to_passive true
% 4.41/4.68 % --inst_prop_sim_given true
% 4.41/4.68 % --inst_prop_sim_new false
% 4.41/4.68 % --inst_orphan_elimination true
% 4.41/4.68 % --inst_learning_loop_flag true
% 4.41/4.68 % --inst_learning_start 3000
% 4.41/4.68 % --inst_learning_factor 2
% 4.41/4.68 % --inst_start_prop_sim_after_learn 3
% 4.41/4.68 % --inst_sel_renew solver
% 4.41/4.68 % --inst_lit_activity_flag true
% 4.41/4.68 % --inst_out_proof true
% 4.41/4.68
% 4.41/4.68 % ------ Resolution Options
% 4.41/4.68
% 4.41/4.68 % --resolution_flag true
% 4.41/4.68 % --res_lit_sel kbo_max
% 4.41/4.68 % --res_to_prop_solver none
% 4.41/4.68 % --res_prop_simpl_new false
% 4.41/4.68 % --res_prop_simpl_given false
% 4.41/4.68 % --res_passive_queue_type priority_queues
% 4.41/4.68 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.41/4.68 % --res_passive_queues_freq [15;5]
% 4.41/4.68 % --res_forward_subs full
% 4.41/4.68 % --res_backward_subs full
% 4.41/4.68 % --res_forward_subs_resolution true
% 4.41/4.68 % --res_backward_subs_resolution true
% 4.41/4.68 % --res_orphan_elimination false
% 4.41/4.68 % --res_time_limit 1000.
% 4.41/4.68 % --res_out_proof true
% 4.41/4.68 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_1c73ee.s
% 4.41/4.68 % --modulo true
% 4.41/4.68
% 4.41/4.68 % ------ Combination Options
% 4.41/4.68
% 4.41/4.68 % --comb_res_mult 1000
% 4.41/4.68 % --comb_inst_mult 300
% 4.41/4.68 % ------
% 4.41/4.68
% 4.41/4.68
% 4.41/4.68
% 4.41/4.68 % ------ Proving...
% 4.41/4.68 % warning: shown sat in sat incomplete mode
% 4.41/4.68 %
% 4.41/4.68
% 4.41/4.68
% 4.41/4.68 ------ Building Model...Done
% 4.41/4.68
% 4.41/4.68 %------ The model is defined over ground terms (initial term algebra).
% 4.41/4.68 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 4.41/4.68 %------ where \phi is a formula over the term algebra.
% 4.41/4.68 %------ If we have equality in the problem then it is also defined as a predicate above,
% 4.41/4.68 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 4.41/4.68 %------ See help for --sat_out_model for different model outputs.
% 4.41/4.68 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 4.41/4.68 %------ where the first argument stands for the sort ($i in the unsorted case)
% 4.41/4.68
% 4.41/4.68
% 4.41/4.68
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of c0_1
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 (! [X0] :
% 4.41/4.68 ( c0_1(X0) <=>
% 4.41/4.68 (
% 4.41/4.68 (
% 4.41/4.68 ( X0=a549 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a551 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a552 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a556 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a560 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a566 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a576 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a584 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a587 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a628 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a608 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 )
% 4.41/4.68 )
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of c3_1
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 (! [X0] :
% 4.41/4.68 ( c3_1(X0) <=>
% 4.41/4.68 (
% 4.41/4.68 (
% 4.41/4.68 ( X0=a548 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a550 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a558 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a561 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a563 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a564 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a570 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a599 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a607 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a581 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a609 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 )
% 4.41/4.68 )
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of c2_1
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 (! [X0] :
% 4.41/4.68 ( c2_1(X0) <=>
% 4.41/4.68 (
% 4.41/4.68 (
% 4.41/4.68 ( X0=a547 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a556 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a557 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a559 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a560 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a562 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a563 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a564 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a566 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a576 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a577 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a601 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a607 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a608 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a609 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 )
% 4.41/4.68 )
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Negative definition of c1_1
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 (! [X0] :
% 4.41/4.68 ( ~(c1_1(X0)) <=>
% 4.41/4.68 (
% 4.41/4.68 (
% 4.41/4.68 ( X0=a547 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a549 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a551 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a552 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a554 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a555 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a556 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a557 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a559 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a560 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a562 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a566 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a576 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a577 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a584 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a587 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a601 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a628 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 |
% 4.41/4.68 (
% 4.41/4.68 ( X0=a608 )
% 4.41/4.68 )
% 4.41/4.68
% 4.41/4.68 )
% 4.41/4.68 )
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of ndr1_0
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( ndr1_0 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp24
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp24 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp16
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp16 <=>
% 4.41/4.68 $false
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp15
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp15 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp19
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp19 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp29
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp29 <=>
% 4.41/4.68 $false
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp0
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp0 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp11
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp11 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp17
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp17 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp21
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp21 <=>
% 4.41/4.68 $false
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp22
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp22 <=>
% 4.41/4.68 $false
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp9
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp9 <=>
% 4.41/4.68 $false
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp3
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp3 <=>
% 4.41/4.68 $false
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp7
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp7 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp12
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp12 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp31
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp31 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp6
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp6 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp25
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp25 <=>
% 4.41/4.68 $true
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp28
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp28 <=>
% 4.41/4.68 $false
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp18
% 4.41/4.68 fof(lit_def,axiom,
% 4.41/4.68 ( hskp18 <=>
% 4.41/4.68 $false
% 4.41/4.68 )
% 4.41/4.68 ).
% 4.41/4.68
% 4.41/4.68 %------ Positive definition of hskp13
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp13 <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp20
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp20 <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp23
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp23 <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp8
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp8 <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp10
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp10 <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp4
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp4 <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp26
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp26 <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp30
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp30 <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp14
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp14 <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp5
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp5 <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp2
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp2 <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp1
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp1 <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of hskp27
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( hskp27 <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP0_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP0_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP1_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP1_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP2_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP2_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP3_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP3_iProver_split <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP4_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP4_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP5_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP5_iProver_split <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP6_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP6_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP7_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP7_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP8_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP8_iProver_split <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP9_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP9_iProver_split <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP10_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP10_iProver_split <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP11_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP11_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP13_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP13_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP14_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP14_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP15_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP15_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP16_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP16_iProver_split <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP17_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP17_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP19_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP19_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP21_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP21_iProver_split <=>
% 4.50/4.68 $true
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP25_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP25_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68 %------ Positive definition of sP26_iProver_split
% 4.50/4.68 fof(lit_def,axiom,
% 4.50/4.68 ( sP26_iProver_split <=>
% 4.50/4.68 $false
% 4.50/4.68 )
% 4.50/4.68 ).
% 4.50/4.68
% 4.50/4.68
% 4.50/4.68
% 4.50/4.68 % ------ Statistics
% 4.50/4.68
% 4.50/4.68 % ------ General
% 4.50/4.68
% 4.50/4.68 % num_of_input_clauses: 188
% 4.50/4.68 % num_of_input_neg_conjectures: 188
% 4.50/4.68 % num_of_splits: 172
% 4.50/4.68 % num_of_split_atoms: 29
% 4.50/4.68 % num_of_sem_filtered_clauses: 0
% 4.50/4.68 % num_of_subtypes: 0
% 4.50/4.68 % monotx_restored_types: 0
% 4.50/4.68 % sat_num_of_epr_types: 0
% 4.50/4.68 % sat_num_of_non_cyclic_types: 0
% 4.50/4.68 % sat_guarded_non_collapsed_types: 0
% 4.50/4.68 % is_epr: 1
% 4.50/4.68 % is_horn: 0
% 4.50/4.68 % has_eq: 0
% 4.50/4.68 % num_pure_diseq_elim: 0
% 4.50/4.68 % simp_replaced_by: 0
% 4.50/4.68 % res_preprocessed: 548
% 4.50/4.68 % prep_upred: 0
% 4.50/4.68 % prep_unflattend: 0
% 4.50/4.68 % pred_elim_cands: 29
% 4.50/4.68 % pred_elim: 8
% 4.50/4.68 % pred_elim_cl: 8
% 4.50/4.68 % pred_elim_cycles: 29
% 4.50/4.68 % forced_gc_time: 0
% 4.50/4.68 % gc_basic_clause_elim: 0
% 4.50/4.68 % parsing_time: 0.002
% 4.50/4.68 % sem_filter_time: 0.
% 4.50/4.68 % pred_elim_time: 0.018
% 4.50/4.68 % out_proof_time: 0.
% 4.50/4.68 % monotx_time: 0.
% 4.50/4.68 % subtype_inf_time: 0.
% 4.50/4.68 % unif_index_cands_time: 0.005
% 4.50/4.68 % unif_index_add_time: 0.005
% 4.50/4.68 % total_time: 2.029
% 4.50/4.68 % num_of_symbols: 123
% 4.50/4.68 % num_of_terms: 448
% 4.50/4.68
% 4.50/4.68 % ------ Propositional Solver
% 4.50/4.68
% 4.50/4.68 % prop_solver_calls: 15
% 4.50/4.68 % prop_fast_solver_calls: 3001
% 4.50/4.68 % prop_num_of_clauses: 1203
% 4.50/4.68 % prop_preprocess_simplified: 3966
% 4.50/4.68 % prop_fo_subsumed: 174
% 4.50/4.68 % prop_solver_time: 0.001
% 4.50/4.68 % prop_fast_solver_time: 0.001
% 4.50/4.68 % prop_unsat_core_time: 0.
% 4.50/4.68
% 4.50/4.68 % ------ QBF
% 4.50/4.68
% 4.50/4.68 % qbf_q_res: 0
% 4.50/4.68 % qbf_num_tautologies: 0
% 4.50/4.68 % qbf_prep_cycles: 0
% 4.50/4.68
% 4.50/4.68 % ------ BMC1
% 4.50/4.68
% 4.50/4.68 % bmc1_current_bound: -1
% 4.50/4.68 % bmc1_last_solved_bound: -1
% 4.50/4.68 % bmc1_unsat_core_size: -1
% 4.50/4.68 % bmc1_unsat_core_parents_size: -1
% 4.50/4.68 % bmc1_merge_next_fun: 0
% 4.50/4.68 % bmc1_unsat_core_clauses_time: 0.
% 4.50/4.68
% 4.50/4.68 % ------ Instantiation
% 4.50/4.68
% 4.50/4.68 % inst_num_of_clauses: 829
% 4.50/4.68 % inst_num_in_passive: 0
% 4.50/4.68 % inst_num_in_active: 829
% 4.50/4.68 % inst_num_in_unprocessed: 0
% 4.50/4.68 % inst_num_of_loops: 1735
% 4.50/4.68 % inst_num_of_learning_restarts: 0
% 4.50/4.68 % inst_num_moves_active_passive: 895
% 4.50/4.68 % inst_lit_activity: 68
% 4.50/4.68 % inst_lit_activity_moves: 0
% 4.50/4.68 % inst_num_tautologies: 0
% 4.50/4.68 % inst_num_prop_implied: 0
% 4.50/4.68 % inst_num_existing_simplified: 0
% 4.50/4.68 % inst_num_eq_res_simplified: 0
% 4.50/4.68 % inst_num_child_elim: 0
% 4.50/4.68 % inst_num_of_dismatching_blockings: 0
% 4.50/4.68 % inst_num_of_non_proper_insts: 994
% 4.50/4.68 % inst_num_of_duplicates: 301
% 4.50/4.68 % inst_inst_num_from_inst_to_res: 0
% 4.50/4.68 % inst_dismatching_checking_time: 0.
% 4.50/4.68
% 4.50/4.68 % ------ Resolution
% 4.50/4.68
% 4.50/4.68 % res_num_of_clauses: 49021
% 4.50/4.68 % res_num_in_passive: 49019
% 4.50/4.68 % res_num_in_active: 3480
% 4.50/4.68 % res_num_of_loops: 6000
% 4.50/4.68 % res_forward_subset_subsumed: 13346
% 4.50/4.68 % res_backward_subset_subsumed: 4010
% 4.50/4.68 % res_forward_subsumed: 1804
% 4.50/4.68 % res_backward_subsumed: 282
% 4.50/4.68 % res_forward_subsumption_resolution: 924
% 4.50/4.68 % res_backward_subsumption_resolution: 195
% 4.50/4.68 % res_clause_to_clause_subsumption: 3205
% 4.50/4.68 % res_orphan_elimination: 0
% 4.50/4.68 % res_tautology_del: 15507
% 4.50/4.68 % res_num_eq_res_simplified: 0
% 4.50/4.68 % res_num_sel_changes: 0
% 4.50/4.68 % res_moves_from_active_to_pass: 0
% 4.50/4.68
% 4.50/4.68 % Status Unknown
% 4.50/4.68 % Last status :
% 4.50/4.68 % SZS status Unknown
%------------------------------------------------------------------------------