TSTP Solution File: SYN456-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN456-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n009.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:12 EDT 2022
% Result : Unknown 5.32s 5.50s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN456-1 : TPTP v8.1.0. Released v2.1.0.
% 0.11/0.13 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n009.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.34 % DateTime : Mon Jul 11 17:42:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.41 % Orientation found
% 0.12/0.41 % 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_343f77.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_f38061.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_9beebd | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 0.20/0.50 % --inst_prop_sim_new false
% 0.20/0.50 % --inst_orphan_elimination true
% 0.20/0.50 % --inst_learning_loop_flag true
% 0.20/0.50 % --inst_learning_start 3000
% 0.20/0.50 % --inst_learning_factor 2
% 0.20/0.50 % --inst_start_prop_sim_after_learn 3
% 0.20/0.50 % --inst_sel_renew solver
% 0.20/0.50 % --inst_lit_activity_flag true
% 0.20/0.50 % --inst_out_proof true
% 0.20/0.50
% 0.20/0.50 % ------ Resolution Options
% 0.20/0.50
% 0.20/0.50 % --resolution_flag true
% 0.20/0.50 % --res_lit_sel kbo_max
% 0.20/0.50 % --res_to_prop_solver none
% 0.20/0.50 % --res_prop_simpl_new false
% 0.20/0.50 % --res_prop_simpl_given false
% 0.20/0.50 % --res_passive_queue_type priority_queues
% 0.20/0.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.50 % --res_passive_queues_freq [15;5]
% 0.20/0.50 % --res_forward_subs full
% 0.20/0.50 % --res_backward_subs full
% 0.20/0.50 % --res_forward_subs_resolution true
% 0.20/0.50 % --res_backward_subs_resolution true
% 0.20/0.50 % --res_orphan_elimination false
% 0.20/0.50 % --res_time_limit 1000.
% 0.20/0.50 % --res_out_proof true
% 0.20/0.50 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_343f77.s
% 0.20/0.50 % --modulo true
% 0.20/0.50
% 0.20/0.50 % ------ Combination Options
% 0.20/0.50
% 0.20/0.50 % --comb_res_mult 1000
% 0.20/0.50 % --comb_inst_mult 300
% 0.20/0.50 % ------
% 0.20/0.50
% 0.20/0.50 % ------ Parsing...% successful
% 0.20/0.50
% 0.20/0.50 % ------ Preprocessing... gs_s sp: 174 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.50
% 0.20/0.50 % ------ Proving...
% 0.20/0.50 % ------ Problem Properties
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % EPR true
% 0.20/0.50 % Horn false
% 0.20/0.50 % Has equality false
% 0.20/0.50
% 0.20/0.50 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 % % ------ Current options:
% 0.20/0.50
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 2.74/2.96 % --inst_prop_sim_given true
% 2.74/2.96 % --inst_prop_sim_new false
% 2.74/2.96 % --inst_orphan_elimination true
% 2.74/2.96 % --inst_learning_loop_flag true
% 2.74/2.96 % --inst_learning_start 3000
% 2.74/2.96 % --inst_learning_factor 2
% 2.74/2.96 % --inst_start_prop_sim_after_learn 3
% 2.74/2.96 % --inst_sel_renew solver
% 2.74/2.96 % --inst_lit_activity_flag true
% 2.74/2.96 % --inst_out_proof true
% 2.74/2.96
% 2.74/2.96 % ------ Resolution Options
% 2.74/2.96
% 2.74/2.96 % --resolution_flag true
% 2.74/2.96 % --res_lit_sel kbo_max
% 2.74/2.96 % --res_to_prop_solver none
% 2.74/2.96 % --res_prop_simpl_new false
% 2.74/2.96 % --res_prop_simpl_given false
% 2.74/2.96 % --res_passive_queue_type priority_queues
% 2.74/2.96 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.74/2.96 % --res_passive_queues_freq [15;5]
% 2.74/2.96 % --res_forward_subs full
% 2.74/2.96 % --res_backward_subs full
% 2.74/2.96 % --res_forward_subs_resolution true
% 2.74/2.96 % --res_backward_subs_resolution true
% 2.74/2.96 % --res_orphan_elimination false
% 2.74/2.96 % --res_time_limit 1000.
% 2.74/2.96 % --res_out_proof true
% 2.74/2.96 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_343f77.s
% 2.74/2.96 % --modulo true
% 2.74/2.96
% 2.74/2.96 % ------ Combination Options
% 2.74/2.96
% 2.74/2.96 % --comb_res_mult 1000
% 2.74/2.96 % --comb_inst_mult 300
% 2.74/2.96 % ------
% 2.74/2.96
% 2.74/2.96
% 2.74/2.96
% 2.74/2.96 % ------ Proving...
% 2.74/2.96 % warning: shown sat in sat incomplete mode
% 2.74/2.96 %
% 2.74/2.96
% 2.74/2.96
% 2.74/2.96 ------ Building Model...Done
% 2.74/2.96
% 2.74/2.96 %------ The model is defined over ground terms (initial term algebra).
% 2.74/2.96 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.74/2.96 %------ where \phi is a formula over the term algebra.
% 2.74/2.96 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.74/2.96 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.74/2.96 %------ See help for --sat_out_model for different model outputs.
% 2.74/2.96 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.74/2.96 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.74/2.96
% 2.74/2.96
% 2.74/2.96
% 2.74/2.96
% 2.74/2.96 %------ Negative definition of c3_1
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 (! [X0] :
% 2.74/2.96 ( ~(c3_1(X0)) <=>
% 2.74/2.96 (
% 2.74/2.96 (
% 2.74/2.96 ( X0=a988 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a990 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a991 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a992 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a994 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a996 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1008 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1012 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1015 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1040 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1051 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 )
% 2.74/2.96 )
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Negative definition of c1_1
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 (! [X0] :
% 2.74/2.96 ( ~(c1_1(X0)) <=>
% 2.74/2.96 (
% 2.74/2.96 (
% 2.74/2.96 ( X0=a988 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a989 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a990 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a991 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a992 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a994 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a995 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a996 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1002 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1003 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1008 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1012 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1015 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1016 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1017 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1040 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1045 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1051 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1058 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1059 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1009 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 )
% 2.74/2.96 )
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of c0_1
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 (! [X0] :
% 2.74/2.96 ( c0_1(X0) <=>
% 2.74/2.96 (
% 2.74/2.96 (
% 2.74/2.96 ( X0=a989 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a995 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1002 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1003 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1016 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1017 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1045 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1058 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1059 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 |
% 2.74/2.96 (
% 2.74/2.96 ( X0=a1009 )
% 2.74/2.96 )
% 2.74/2.96
% 2.74/2.96 )
% 2.74/2.96 )
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Negative definition of c2_1
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 (! [X0] :
% 2.74/2.96 ( ~(c2_1(X0)) <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of ndr1_0
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( ndr1_0 <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp22
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp22 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp4
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp4 <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp14
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp14 <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp28
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp28 <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp7
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp7 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp15
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp15 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp8
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp8 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp5
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp5 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp1
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp1 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp12
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp12 <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp9
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp9 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp11
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp11 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp0
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp0 <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp2
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp2 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp17
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp17 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp23
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp23 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp16
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp16 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp6
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp6 <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp3
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp3 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp21
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp21 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp13
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp13 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp30
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp30 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp29
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp29 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp27
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp27 <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp20
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp20 <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp19
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp19 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp10
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp10 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp18
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp18 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp24
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp24 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp25
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp25 <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of hskp26
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( hskp26 <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP1_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP1_iProver_split <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP2_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP2_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP3_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP3_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP4_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP4_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP5_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP5_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP6_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP6_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP7_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP7_iProver_split <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP8_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP8_iProver_split <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP9_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP9_iProver_split <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP10_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP10_iProver_split <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP11_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP11_iProver_split <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP12_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP12_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP13_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP13_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP14_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP14_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP15_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP15_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP17_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP17_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP18_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP18_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP20_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP20_iProver_split <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP21_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP21_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP22_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP22_iProver_split <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP23_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP23_iProver_split <=>
% 2.74/2.96 $true
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP24_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP24_iProver_split <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96 %------ Positive definition of sP26_iProver_split
% 2.74/2.96 fof(lit_def,axiom,
% 2.74/2.96 ( sP26_iProver_split <=>
% 2.74/2.96 $false
% 2.74/2.96 )
% 2.74/2.96 ).
% 2.74/2.96
% 2.74/2.96
% 2.74/2.96
% 2.74/2.96 % ------ Statistics
% 2.74/2.96
% 2.74/2.96 % ------ General
% 2.74/2.96
% 2.74/2.96 % num_of_input_clauses: 184
% 2.74/2.96 % num_of_input_neg_conjectures: 184
% 2.74/2.96 % num_of_splits: 174
% 2.74/2.96 % num_of_split_atoms: 30
% 2.74/2.96 % num_of_sem_filtered_clauses: 0
% 2.74/2.96 % num_of_subtypes: 0
% 2.74/2.96 % monotx_restored_types: 0
% 2.74/2.96 % sat_num_of_epr_types: 0
% 2.74/2.96 % sat_num_of_non_cyclic_types: 0
% 2.74/2.96 % sat_guarded_non_collapsed_types: 0
% 2.74/2.96 % is_epr: 1
% 2.74/2.96 % is_horn: 0
% 2.74/2.96 % has_eq: 0
% 2.74/2.96 % num_pure_diseq_elim: 0
% 2.74/2.96 % simp_replaced_by: 0
% 2.74/2.96 % res_preprocessed: 542
% 2.74/2.96 % prep_upred: 0
% 2.74/2.96 % prep_unflattend: 0
% 2.74/2.96 % pred_elim_cands: 30
% 2.74/2.96 % pred_elim: 7
% 2.74/2.96 % pred_elim_cl: 7
% 2.74/2.96 % pred_elim_cycles: 30
% 2.74/2.96 % forced_gc_time: 0
% 2.74/2.96 % gc_basic_clause_elim: 0
% 2.74/2.96 % parsing_time: 0.004
% 2.74/2.96 % sem_filter_time: 0.
% 2.74/2.96 % pred_elim_time: 0.035
% 2.74/2.96 % out_proof_time: 0.
% 2.74/2.96 % monotx_time: 0.
% 2.74/2.96 % subtype_inf_time: 0.
% 2.74/2.96 % unif_index_cands_time: 0.005
% 2.74/2.96 % unif_index_add_time: 0.006
% 2.74/2.96 % total_time: 2.54
% 2.74/2.96 % num_of_symbols: 122
% 2.74/2.96 % num_of_terms: 439
% 2.74/2.96
% 2.74/2.96 % ------ Propositional Solver
% 2.74/2.96
% 2.74/2.96 % prop_solver_calls: 15
% 2.74/2.96 % prop_fast_solver_calls: 2943
% 2.74/2.96 % prop_num_of_clauses: 1180
% 2.74/2.96 % prop_preprocess_simplified: 3926
% 2.74/2.96 % prop_fo_subsumed: 161
% 2.74/2.96 % prop_solver_time: 0.001
% 2.74/2.96 % prop_fast_solver_time: 0.002
% 2.74/2.96 % prop_unsat_core_time: 0.
% 2.74/2.96
% 2.74/2.96 % ------ QBF
% 2.74/2.96
% 2.74/2.96 % qbf_q_res: 0
% 2.74/2.96 % qbf_num_tautologies: 0
% 2.74/2.96 % qbf_prep_cycles: 0
% 2.74/2.96
% 2.74/2.96 % ------ BMC1
% 2.74/2.96
% 2.74/2.96 % bmc1_current_bound: -1
% 2.74/2.96 % bmc1_last_solved_bound: -1
% 2.74/2.96 % bmc1_unsat_core_size: -1
% 2.74/2.96 % bmc1_unsat_core_parents_size: -1
% 2.74/2.96 % bmc1_merge_next_fun: 0
% 2.74/2.96 % bmc1_unsat_core_clauses_time: 0.
% 2.74/2.96
% 2.74/2.96 % ------ Instantiation
% 2.74/2.96
% 2.74/2.96 % inst_num_of_clauses: 823
% 2.74/2.96 % inst_num_in_passive: 0
% 2.74/2.96 % inst_num_in_active: 823
% 2.74/2.96 % inst_num_in_unprocessed: 0
% 2.74/2.96 % inst_num_of_loops: 1840
% 2.74/2.96 % inst_num_of_learning_restarts: 0
% 2.74/2.96 % inst_num_moves_active_passive: 1006
% 2.74/2.96 % inst_lit_activity: 179
% 2.74/2.96 % inst_lit_activity_moves: 0
% 2.74/2.96 % inst_num_tautologies: 0
% 2.74/2.96 % inst_num_prop_implied: 0
% 2.74/2.96 % inst_num_existing_simplified: 0
% 2.74/2.96 % inst_num_eq_res_simplified: 0
% 2.74/2.96 % inst_num_child_elim: 0
% 2.74/2.96 % inst_num_of_dismatching_blockings: 0
% 2.74/2.96 % inst_num_of_non_proper_insts: 986
% 2.74/2.96 % inst_num_of_duplicates: 332
% 2.74/2.96 % inst_inst_num_from_inst_to_res: 0
% 2.74/2.96 % inst_dismatching_checking_time: 0.
% 2.74/2.96
% 2.74/2.96 % ------ Resolution
% 2.74/2.96
% 2.74/2.96 % res_num_of_clauses: 60423
% 2.74/2.96 % res_num_in_passive: 60391
% 2.74/2.96 % res_num_in_active: 3798
% 2.74/2.96 % res_num_of_loops: 7000
% 2.74/2.96 % res_forward_subset_subsumed: 19730
% 2.74/2.96 % res_backward_subset_subsumed: 4383
% 2.74/2.96 % res_forward_subsumed: 2427
% 2.74/2.96 % res_backward_subsumed: 349
% 2.74/2.96 % res_forward_subsumption_resolution: 1146
% 2.74/2.96 % res_backward_subsumption_resolution: 181
% 2.74/2.96 % res_clause_to_clause_subsumption: 4103
% 2.74/2.96 % res_orphan_elimination: 0
% 2.74/2.96 % res_tautology_del: 18271
% 2.74/2.96 % res_num_eq_res_simplified: 0
% 2.74/2.96 % res_num_sel_changes: 0
% 2.74/2.96 % res_moves_from_active_to_pass: 0
% 2.74/2.96
% 2.74/2.96 % Status Unknown
% 2.81/3.01 % Orienting using strategy ClausalAll
% 2.81/3.01 % Orientation found
% 2.81/3.01 % 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_343f77.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_f38061.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_29e407 | grep -v "SZS"
% 2.81/3.02
% 2.81/3.02 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 2.81/3.02
% 2.81/3.02 %
% 2.81/3.02 % ------ iProver source info
% 2.81/3.02
% 2.81/3.02 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 2.81/3.02 % git: non_committed_changes: true
% 2.81/3.02 % git: last_make_outside_of_git: true
% 2.81/3.02
% 2.81/3.02 %
% 2.81/3.02 % ------ Input Options
% 2.81/3.02
% 2.81/3.02 % --out_options all
% 2.81/3.02 % --tptp_safe_out true
% 2.81/3.02 % --problem_path ""
% 2.81/3.02 % --include_path ""
% 2.81/3.02 % --clausifier .//eprover
% 2.81/3.02 % --clausifier_options --tstp-format
% 2.81/3.02 % --stdin false
% 2.81/3.02 % --dbg_backtrace false
% 2.81/3.02 % --dbg_dump_prop_clauses false
% 2.81/3.02 % --dbg_dump_prop_clauses_file -
% 2.81/3.02 % --dbg_out_stat false
% 2.81/3.02
% 2.81/3.02 % ------ General Options
% 2.81/3.02
% 2.81/3.02 % --fof false
% 2.81/3.02 % --time_out_real 150.
% 2.81/3.02 % --time_out_prep_mult 0.2
% 2.81/3.02 % --time_out_virtual -1.
% 2.81/3.02 % --schedule none
% 2.81/3.02 % --ground_splitting input
% 2.81/3.02 % --splitting_nvd 16
% 2.81/3.02 % --non_eq_to_eq false
% 2.81/3.02 % --prep_gs_sim true
% 2.81/3.02 % --prep_unflatten false
% 2.81/3.02 % --prep_res_sim true
% 2.81/3.02 % --prep_upred true
% 2.81/3.02 % --res_sim_input true
% 2.81/3.02 % --clause_weak_htbl true
% 2.81/3.02 % --gc_record_bc_elim false
% 2.81/3.02 % --symbol_type_check false
% 2.81/3.02 % --clausify_out false
% 2.81/3.02 % --large_theory_mode false
% 2.81/3.02 % --prep_sem_filter none
% 2.81/3.02 % --prep_sem_filter_out false
% 2.81/3.02 % --preprocessed_out false
% 2.81/3.02 % --sub_typing false
% 2.81/3.02 % --brand_transform false
% 2.81/3.02 % --pure_diseq_elim true
% 2.81/3.02 % --min_unsat_core false
% 2.81/3.02 % --pred_elim true
% 2.81/3.02 % --add_important_lit false
% 2.81/3.02 % --soft_assumptions false
% 2.81/3.02 % --reset_solvers false
% 2.81/3.02 % --bc_imp_inh []
% 2.81/3.02 % --conj_cone_tolerance 1.5
% 2.81/3.02 % --prolific_symb_bound 500
% 2.81/3.02 % --lt_threshold 2000
% 2.81/3.02
% 2.81/3.02 % ------ SAT Options
% 2.81/3.02
% 2.81/3.02 % --sat_mode false
% 2.81/3.02 % --sat_fm_restart_options ""
% 2.81/3.02 % --sat_gr_def false
% 2.81/3.02 % --sat_epr_types true
% 2.81/3.02 % --sat_non_cyclic_types false
% 2.81/3.02 % --sat_finite_models false
% 2.81/3.02 % --sat_fm_lemmas false
% 2.81/3.02 % --sat_fm_prep false
% 2.81/3.02 % --sat_fm_uc_incr true
% 2.81/3.02 % --sat_out_model small
% 2.81/3.02 % --sat_out_clauses false
% 2.81/3.02
% 2.81/3.02 % ------ QBF Options
% 2.81/3.02
% 2.81/3.02 % --qbf_mode false
% 2.81/3.02 % --qbf_elim_univ true
% 2.81/3.02 % --qbf_sk_in true
% 2.81/3.02 % --qbf_pred_elim true
% 2.81/3.02 % --qbf_split 32
% 2.81/3.02
% 2.81/3.02 % ------ BMC1 Options
% 2.81/3.02
% 2.81/3.02 % --bmc1_incremental false
% 2.81/3.02 % --bmc1_axioms reachable_all
% 2.81/3.02 % --bmc1_min_bound 0
% 2.81/3.02 % --bmc1_max_bound -1
% 2.81/3.02 % --bmc1_max_bound_default -1
% 2.81/3.02 % --bmc1_symbol_reachability true
% 2.81/3.02 % --bmc1_property_lemmas false
% 2.81/3.02 % --bmc1_k_induction false
% 2.81/3.02 % --bmc1_non_equiv_states false
% 2.81/3.02 % --bmc1_deadlock false
% 2.81/3.02 % --bmc1_ucm false
% 2.81/3.02 % --bmc1_add_unsat_core none
% 2.81/3.02 % --bmc1_unsat_core_children false
% 2.81/3.02 % --bmc1_unsat_core_extrapolate_axioms false
% 2.81/3.02 % --bmc1_out_stat full
% 2.81/3.02 % --bmc1_ground_init false
% 2.81/3.02 % --bmc1_pre_inst_next_state false
% 2.81/3.02 % --bmc1_pre_inst_state false
% 2.81/3.02 % --bmc1_pre_inst_reach_state false
% 2.81/3.02 % --bmc1_out_unsat_core false
% 2.81/3.02 % --bmc1_aig_witness_out false
% 2.81/3.02 % --bmc1_verbose false
% 2.81/3.02 % --bmc1_dump_clauses_tptp false
% 2.81/3.06 % --bmc1_dump_unsat_core_tptp false
% 2.81/3.06 % --bmc1_dump_file -
% 2.81/3.06 % --bmc1_ucm_expand_uc_limit 128
% 2.81/3.06 % --bmc1_ucm_n_expand_iterations 6
% 2.81/3.06 % --bmc1_ucm_extend_mode 1
% 2.81/3.06 % --bmc1_ucm_init_mode 2
% 2.81/3.06 % --bmc1_ucm_cone_mode none
% 2.81/3.06 % --bmc1_ucm_reduced_relation_type 0
% 2.81/3.06 % --bmc1_ucm_relax_model 4
% 2.81/3.06 % --bmc1_ucm_full_tr_after_sat true
% 2.81/3.06 % --bmc1_ucm_expand_neg_assumptions false
% 2.81/3.06 % --bmc1_ucm_layered_model none
% 2.81/3.06 % --bmc1_ucm_max_lemma_size 10
% 2.81/3.06
% 2.81/3.06 % ------ AIG Options
% 2.81/3.06
% 2.81/3.06 % --aig_mode false
% 2.81/3.06
% 2.81/3.06 % ------ Instantiation Options
% 2.81/3.06
% 2.81/3.06 % --instantiation_flag true
% 2.81/3.06 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.81/3.06 % --inst_solver_per_active 750
% 2.81/3.06 % --inst_solver_calls_frac 0.5
% 2.81/3.06 % --inst_passive_queue_type priority_queues
% 2.81/3.06 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.81/3.06 % --inst_passive_queues_freq [25;2]
% 2.81/3.06 % --inst_dismatching true
% 2.81/3.06 % --inst_eager_unprocessed_to_passive true
% 2.81/3.06 % --inst_prop_sim_given true
% 2.81/3.06 % --inst_prop_sim_new false
% 2.81/3.06 % --inst_orphan_elimination true
% 2.81/3.06 % --inst_learning_loop_flag true
% 2.81/3.06 % --inst_learning_start 3000
% 2.81/3.06 % --inst_learning_factor 2
% 2.81/3.06 % --inst_start_prop_sim_after_learn 3
% 2.81/3.06 % --inst_sel_renew solver
% 2.81/3.06 % --inst_lit_activity_flag true
% 2.81/3.06 % --inst_out_proof true
% 2.81/3.06
% 2.81/3.06 % ------ Resolution Options
% 2.81/3.06
% 2.81/3.06 % --resolution_flag true
% 2.81/3.06 % --res_lit_sel kbo_max
% 2.81/3.06 % --res_to_prop_solver none
% 2.81/3.06 % --res_prop_simpl_new false
% 2.81/3.06 % --res_prop_simpl_given false
% 2.81/3.06 % --res_passive_queue_type priority_queues
% 2.81/3.06 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.81/3.06 % --res_passive_queues_freq [15;5]
% 2.81/3.06 % --res_forward_subs full
% 2.81/3.06 % --res_backward_subs full
% 2.81/3.06 % --res_forward_subs_resolution true
% 2.81/3.06 % --res_backward_subs_resolution true
% 2.81/3.06 % --res_orphan_elimination false
% 2.81/3.06 % --res_time_limit 1000.
% 2.81/3.06 % --res_out_proof true
% 2.81/3.06 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_343f77.s
% 2.81/3.06 % --modulo true
% 2.81/3.06
% 2.81/3.06 % ------ Combination Options
% 2.81/3.06
% 2.81/3.06 % --comb_res_mult 1000
% 2.81/3.06 % --comb_inst_mult 300
% 2.81/3.06 % ------
% 2.81/3.06
% 2.81/3.06 % ------ Parsing...% successful
% 2.81/3.06
% 2.81/3.06 % ------ Preprocessing... gs_s sp: 174 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e snvd_s sp: 0 0s snvd_e %
% 2.81/3.06
% 2.81/3.06 % ------ Proving...
% 2.81/3.06 % ------ Problem Properties
% 2.81/3.06
% 2.81/3.06 %
% 2.81/3.06 % EPR true
% 2.81/3.06 % Horn false
% 2.81/3.06 % Has equality false
% 2.81/3.06
% 2.81/3.06 % % ------ Input Options Time Limit: Unbounded
% 2.81/3.06
% 2.81/3.06
% 2.81/3.06 % % ------ Current options:
% 2.81/3.06
% 2.81/3.06 % ------ Input Options
% 2.81/3.06
% 2.81/3.06 % --out_options all
% 2.81/3.06 % --tptp_safe_out true
% 2.81/3.06 % --problem_path ""
% 2.81/3.06 % --include_path ""
% 2.81/3.06 % --clausifier .//eprover
% 2.81/3.06 % --clausifier_options --tstp-format
% 2.81/3.06 % --stdin false
% 2.81/3.06 % --dbg_backtrace false
% 2.81/3.06 % --dbg_dump_prop_clauses false
% 2.81/3.06 % --dbg_dump_prop_clauses_file -
% 2.81/3.06 % --dbg_out_stat false
% 2.81/3.06
% 2.81/3.06 % ------ General Options
% 2.81/3.06
% 2.81/3.06 % --fof false
% 2.81/3.06 % --time_out_real 150.
% 2.81/3.06 % --time_out_prep_mult 0.2
% 2.81/3.06 % --time_out_virtual -1.
% 2.81/3.06 % --schedule none
% 2.81/3.06 % --ground_splitting input
% 2.81/3.06 % --splitting_nvd 16
% 2.81/3.06 % --non_eq_to_eq false
% 2.81/3.06 % --prep_gs_sim true
% 2.81/3.06 % --prep_unflatten false
% 2.81/3.06 % --prep_res_sim true
% 2.81/3.06 % --prep_upred true
% 2.81/3.06 % --res_sim_input true
% 2.81/3.06 % --clause_weak_htbl true
% 2.81/3.06 % --gc_record_bc_elim false
% 2.81/3.06 % --symbol_type_check false
% 2.81/3.06 % --clausify_out false
% 2.81/3.06 % --large_theory_mode false
% 2.81/3.06 % --prep_sem_filter none
% 2.81/3.06 % --prep_sem_filter_out false
% 2.81/3.06 % --preprocessed_out false
% 2.81/3.06 % --sub_typing false
% 2.81/3.06 % --brand_transform false
% 2.81/3.06 % --pure_diseq_elim true
% 2.81/3.06 % --min_unsat_core false
% 2.81/3.06 % --pred_elim true
% 2.81/3.06 % --add_important_lit false
% 2.81/3.06 % --soft_assumptions false
% 2.81/3.06 % --reset_solvers false
% 2.81/3.06 % --bc_imp_inh []
% 2.81/3.06 % --conj_cone_tolerance 1.5
% 2.81/3.06 % --prolific_symb_bound 500
% 2.81/3.06 % --lt_threshold 2000
% 2.81/3.06
% 2.81/3.06 % ------ SAT Options
% 2.81/3.06
% 2.81/3.06 % --sat_mode false
% 2.81/3.06 % --sat_fm_restart_options ""
% 2.81/3.06 % --sat_gr_def false
% 2.81/3.06 % --sat_epr_types true
% 2.81/3.06 % --sat_non_cyclic_types false
% 2.81/3.06 % --sat_finite_models false
% 2.81/3.06 % --sat_fm_lemmas false
% 2.81/3.06 % --sat_fm_prep false
% 2.81/3.06 % --sat_fm_uc_incr true
% 2.81/3.06 % --sat_out_model small
% 2.81/3.06 % --sat_out_clauses false
% 2.81/3.06
% 2.81/3.06 % ------ QBF Options
% 2.81/3.06
% 2.81/3.06 % --qbf_mode false
% 2.81/3.06 % --qbf_elim_univ true
% 2.81/3.06 % --qbf_sk_in true
% 2.81/3.06 % --qbf_pred_elim true
% 2.81/3.06 % --qbf_split 32
% 2.81/3.06
% 2.81/3.06 % ------ BMC1 Options
% 2.81/3.06
% 2.81/3.06 % --bmc1_incremental false
% 2.81/3.06 % --bmc1_axioms reachable_all
% 2.81/3.06 % --bmc1_min_bound 0
% 2.81/3.06 % --bmc1_max_bound -1
% 2.81/3.06 % --bmc1_max_bound_default -1
% 2.81/3.06 % --bmc1_symbol_reachability true
% 2.81/3.06 % --bmc1_property_lemmas false
% 2.81/3.06 % --bmc1_k_induction false
% 2.81/3.06 % --bmc1_non_equiv_states false
% 2.81/3.06 % --bmc1_deadlock false
% 2.81/3.06 % --bmc1_ucm false
% 2.81/3.06 % --bmc1_add_unsat_core none
% 2.81/3.06 % --bmc1_unsat_core_children false
% 2.81/3.06 % --bmc1_unsat_core_extrapolate_axioms false
% 2.81/3.06 % --bmc1_out_stat full
% 2.81/3.06 % --bmc1_ground_init false
% 2.81/3.06 % --bmc1_pre_inst_next_state false
% 2.81/3.06 % --bmc1_pre_inst_state false
% 2.81/3.06 % --bmc1_pre_inst_reach_state false
% 2.81/3.06 % --bmc1_out_unsat_core false
% 2.81/3.06 % --bmc1_aig_witness_out false
% 2.81/3.06 % --bmc1_verbose false
% 2.81/3.06 % --bmc1_dump_clauses_tptp false
% 2.81/3.06 % --bmc1_dump_unsat_core_tptp false
% 2.81/3.06 % --bmc1_dump_file -
% 2.81/3.06 % --bmc1_ucm_expand_uc_limit 128
% 2.81/3.06 % --bmc1_ucm_n_expand_iterations 6
% 2.81/3.06 % --bmc1_ucm_extend_mode 1
% 2.81/3.06 % --bmc1_ucm_init_mode 2
% 2.81/3.06 % --bmc1_ucm_cone_mode none
% 2.81/3.06 % --bmc1_ucm_reduced_relation_type 0
% 2.81/3.06 % --bmc1_ucm_relax_model 4
% 2.81/3.06 % --bmc1_ucm_full_tr_after_sat true
% 2.81/3.06 % --bmc1_ucm_expand_neg_assumptions false
% 2.81/3.06 % --bmc1_ucm_layered_model none
% 2.81/3.06 % --bmc1_ucm_max_lemma_size 10
% 2.81/3.06
% 2.81/3.06 % ------ AIG Options
% 2.81/3.06
% 2.81/3.06 % --aig_mode false
% 2.81/3.06
% 2.81/3.06 % ------ Instantiation Options
% 2.81/3.06
% 2.81/3.06 % --instantiation_flag true
% 2.81/3.06 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.81/3.06 % --inst_solver_per_active 750
% 2.81/3.06 % --inst_solver_calls_frac 0.5
% 2.81/3.06 % --inst_passive_queue_type priority_queues
% 2.81/3.06 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.81/3.06 % --inst_passive_queues_freq [25;2]
% 2.81/3.06 % --inst_dismatching true
% 2.81/3.06 % --inst_eager_unprocessed_to_passive true
% 5.32/5.49 % --inst_prop_sim_given true
% 5.32/5.49 % --inst_prop_sim_new false
% 5.32/5.49 % --inst_orphan_elimination true
% 5.32/5.49 % --inst_learning_loop_flag true
% 5.32/5.49 % --inst_learning_start 3000
% 5.32/5.49 % --inst_learning_factor 2
% 5.32/5.49 % --inst_start_prop_sim_after_learn 3
% 5.32/5.49 % --inst_sel_renew solver
% 5.32/5.49 % --inst_lit_activity_flag true
% 5.32/5.49 % --inst_out_proof true
% 5.32/5.49
% 5.32/5.49 % ------ Resolution Options
% 5.32/5.49
% 5.32/5.49 % --resolution_flag true
% 5.32/5.49 % --res_lit_sel kbo_max
% 5.32/5.49 % --res_to_prop_solver none
% 5.32/5.49 % --res_prop_simpl_new false
% 5.32/5.49 % --res_prop_simpl_given false
% 5.32/5.49 % --res_passive_queue_type priority_queues
% 5.32/5.49 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 5.32/5.49 % --res_passive_queues_freq [15;5]
% 5.32/5.49 % --res_forward_subs full
% 5.32/5.49 % --res_backward_subs full
% 5.32/5.49 % --res_forward_subs_resolution true
% 5.32/5.49 % --res_backward_subs_resolution true
% 5.32/5.49 % --res_orphan_elimination false
% 5.32/5.49 % --res_time_limit 1000.
% 5.32/5.49 % --res_out_proof true
% 5.32/5.49 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_343f77.s
% 5.32/5.49 % --modulo true
% 5.32/5.49
% 5.32/5.49 % ------ Combination Options
% 5.32/5.49
% 5.32/5.49 % --comb_res_mult 1000
% 5.32/5.49 % --comb_inst_mult 300
% 5.32/5.49 % ------
% 5.32/5.49
% 5.32/5.49
% 5.32/5.49
% 5.32/5.49 % ------ Proving...
% 5.32/5.49 % warning: shown sat in sat incomplete mode
% 5.32/5.49 %
% 5.32/5.49
% 5.32/5.49
% 5.32/5.49 ------ Building Model...Done
% 5.32/5.49
% 5.32/5.49 %------ The model is defined over ground terms (initial term algebra).
% 5.32/5.49 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 5.32/5.49 %------ where \phi is a formula over the term algebra.
% 5.32/5.49 %------ If we have equality in the problem then it is also defined as a predicate above,
% 5.32/5.49 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 5.32/5.49 %------ See help for --sat_out_model for different model outputs.
% 5.32/5.49 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 5.32/5.49 %------ where the first argument stands for the sort ($i in the unsorted case)
% 5.32/5.49
% 5.32/5.49
% 5.32/5.49
% 5.32/5.49
% 5.32/5.49 %------ Negative definition of c3_1
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 (! [X0] :
% 5.32/5.49 ( ~(c3_1(X0)) <=>
% 5.32/5.49 (
% 5.32/5.49 (
% 5.32/5.49 ( X0=a988 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a990 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a991 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a992 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a994 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a996 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1008 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1012 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1015 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1040 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1051 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 )
% 5.32/5.49 )
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Negative definition of c1_1
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 (! [X0] :
% 5.32/5.49 ( ~(c1_1(X0)) <=>
% 5.32/5.49 (
% 5.32/5.49 (
% 5.32/5.49 ( X0=a988 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a989 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a990 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a991 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a992 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a994 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a995 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a996 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1002 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1003 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1008 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1012 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1015 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1016 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1017 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1040 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1045 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1051 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1058 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1059 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1009 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 )
% 5.32/5.49 )
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of c0_1
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 (! [X0] :
% 5.32/5.49 ( c0_1(X0) <=>
% 5.32/5.49 (
% 5.32/5.49 (
% 5.32/5.49 ( X0=a989 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a995 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1002 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1003 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1016 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1017 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1045 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1058 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1059 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 |
% 5.32/5.49 (
% 5.32/5.49 ( X0=a1009 )
% 5.32/5.49 )
% 5.32/5.49
% 5.32/5.49 )
% 5.32/5.49 )
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Negative definition of c2_1
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 (! [X0] :
% 5.32/5.49 ( ~(c2_1(X0)) <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of ndr1_0
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( ndr1_0 <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp22
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp22 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp4
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp4 <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp14
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp14 <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp28
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp28 <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp7
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp7 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp15
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp15 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp8
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp8 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp5
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp5 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp1
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp1 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp12
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp12 <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp9
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp9 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp11
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp11 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp0
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp0 <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp2
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp2 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp17
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp17 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp23
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp23 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp16
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp16 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp6
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp6 <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp3
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp3 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp21
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp21 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp13
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp13 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp30
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp30 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp29
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp29 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp27
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp27 <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp20
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp20 <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp19
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp19 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp10
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp10 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp18
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp18 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp24
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp24 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp25
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp25 <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of hskp26
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( hskp26 <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP1_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP1_iProver_split <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP2_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP2_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP3_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP3_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP4_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP4_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP5_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP5_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP6_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP6_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP7_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP7_iProver_split <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP8_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP8_iProver_split <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP9_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP9_iProver_split <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP10_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP10_iProver_split <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP11_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP11_iProver_split <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP12_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP12_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP13_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP13_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP14_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP14_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP15_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP15_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP17_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP17_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP18_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP18_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP20_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP20_iProver_split <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP21_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP21_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP22_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP22_iProver_split <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP23_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP23_iProver_split <=>
% 5.32/5.49 $true
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP24_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP24_iProver_split <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49 %------ Positive definition of sP26_iProver_split
% 5.32/5.49 fof(lit_def,axiom,
% 5.32/5.49 ( sP26_iProver_split <=>
% 5.32/5.49 $false
% 5.32/5.49 )
% 5.32/5.49 ).
% 5.32/5.49
% 5.32/5.49
% 5.32/5.49
% 5.32/5.49 % ------ Statistics
% 5.32/5.49
% 5.32/5.49 % ------ General
% 5.32/5.49
% 5.32/5.49 % num_of_input_clauses: 184
% 5.32/5.49 % num_of_input_neg_conjectures: 184
% 5.32/5.49 % num_of_splits: 174
% 5.32/5.49 % num_of_split_atoms: 30
% 5.32/5.49 % num_of_sem_filtered_clauses: 0
% 5.32/5.49 % num_of_subtypes: 0
% 5.32/5.49 % monotx_restored_types: 0
% 5.32/5.49 % sat_num_of_epr_types: 0
% 5.32/5.49 % sat_num_of_non_cyclic_types: 0
% 5.32/5.49 % sat_guarded_non_collapsed_types: 0
% 5.32/5.49 % is_epr: 1
% 5.32/5.49 % is_horn: 0
% 5.32/5.49 % has_eq: 0
% 5.32/5.49 % num_pure_diseq_elim: 0
% 5.32/5.49 % simp_replaced_by: 0
% 5.32/5.49 % res_preprocessed: 542
% 5.32/5.49 % prep_upred: 0
% 5.32/5.49 % prep_unflattend: 0
% 5.32/5.49 % pred_elim_cands: 30
% 5.32/5.49 % pred_elim: 7
% 5.32/5.49 % pred_elim_cl: 7
% 5.32/5.49 % pred_elim_cycles: 30
% 5.32/5.49 % forced_gc_time: 0
% 5.32/5.49 % gc_basic_clause_elim: 0
% 5.32/5.49 % parsing_time: 0.002
% 5.32/5.49 % sem_filter_time: 0.
% 5.32/5.49 % pred_elim_time: 0.016
% 5.32/5.49 % out_proof_time: 0.
% 5.32/5.49 % monotx_time: 0.
% 5.32/5.49 % subtype_inf_time: 0.
% 5.32/5.49 % unif_index_cands_time: 0.005
% 5.32/5.49 % unif_index_add_time: 0.005
% 5.32/5.49 % total_time: 2.479
% 5.32/5.49 % num_of_symbols: 122
% 5.32/5.49 % num_of_terms: 439
% 5.32/5.49
% 5.32/5.49 % ------ Propositional Solver
% 5.32/5.49
% 5.32/5.49 % prop_solver_calls: 15
% 5.32/5.49 % prop_fast_solver_calls: 2943
% 5.32/5.49 % prop_num_of_clauses: 1180
% 5.32/5.49 % prop_preprocess_simplified: 3926
% 5.32/5.49 % prop_fo_subsumed: 161
% 5.32/5.49 % prop_solver_time: 0.001
% 5.32/5.49 % prop_fast_solver_time: 0.001
% 5.32/5.49 % prop_unsat_core_time: 0.
% 5.32/5.49
% 5.32/5.49 % ------ QBF
% 5.32/5.49
% 5.32/5.49 % qbf_q_res: 0
% 5.32/5.49 % qbf_num_tautologies: 0
% 5.32/5.49 % qbf_prep_cycles: 0
% 5.32/5.49
% 5.32/5.49 % ------ BMC1
% 5.32/5.49
% 5.32/5.49 % bmc1_current_bound: -1
% 5.32/5.49 % bmc1_last_solved_bound: -1
% 5.32/5.49 % bmc1_unsat_core_size: -1
% 5.32/5.49 % bmc1_unsat_core_parents_size: -1
% 5.32/5.49 % bmc1_merge_next_fun: 0
% 5.32/5.49 % bmc1_unsat_core_clauses_time: 0.
% 5.32/5.49
% 5.32/5.49 % ------ Instantiation
% 5.32/5.49
% 5.32/5.49 % inst_num_of_clauses: 823
% 5.32/5.49 % inst_num_in_passive: 0
% 5.32/5.49 % inst_num_in_active: 823
% 5.32/5.49 % inst_num_in_unprocessed: 0
% 5.32/5.49 % inst_num_of_loops: 1840
% 5.32/5.49 % inst_num_of_learning_restarts: 0
% 5.32/5.49 % inst_num_moves_active_passive: 1006
% 5.32/5.49 % inst_lit_activity: 179
% 5.32/5.49 % inst_lit_activity_moves: 0
% 5.32/5.49 % inst_num_tautologies: 0
% 5.32/5.49 % inst_num_prop_implied: 0
% 5.32/5.49 % inst_num_existing_simplified: 0
% 5.32/5.49 % inst_num_eq_res_simplified: 0
% 5.32/5.49 % inst_num_child_elim: 0
% 5.32/5.49 % inst_num_of_dismatching_blockings: 0
% 5.32/5.49 % inst_num_of_non_proper_insts: 986
% 5.32/5.49 % inst_num_of_duplicates: 332
% 5.32/5.49 % inst_inst_num_from_inst_to_res: 0
% 5.32/5.49 % inst_dismatching_checking_time: 0.
% 5.32/5.49
% 5.32/5.49 % ------ Resolution
% 5.32/5.49
% 5.32/5.49 % res_num_of_clauses: 60423
% 5.32/5.49 % res_num_in_passive: 60391
% 5.32/5.49 % res_num_in_active: 3798
% 5.32/5.49 % res_num_of_loops: 7000
% 5.32/5.49 % res_forward_subset_subsumed: 19730
% 5.32/5.49 % res_backward_subset_subsumed: 4383
% 5.32/5.49 % res_forward_subsumed: 2427
% 5.32/5.49 % res_backward_subsumed: 349
% 5.32/5.49 % res_forward_subsumption_resolution: 1146
% 5.32/5.49 % res_backward_subsumption_resolution: 181
% 5.32/5.49 % res_clause_to_clause_subsumption: 4103
% 5.32/5.49 % res_orphan_elimination: 0
% 5.32/5.49 % res_tautology_del: 18271
% 5.32/5.49 % res_num_eq_res_simplified: 0
% 5.32/5.49 % res_num_sel_changes: 0
% 5.32/5.49 % res_moves_from_active_to_pass: 0
% 5.32/5.49
% 5.32/5.49 % Status Unknown
% 5.32/5.49 % Last status :
% 5.32/5.49 % SZS status Unknown
%------------------------------------------------------------------------------