TSTP Solution File: SYN438-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN438-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n003.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:27:54 EDT 2022
% Result : Unknown 1.84s 2.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN438-1 : TPTP v8.1.0. Released v2.1.0.
% 0.11/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 12:38:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.19/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.41 % Orientation found
% 0.19/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_83ca49.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_e9a055.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_28c032 | grep -v "SZS"
% 0.19/0.44
% 0.19/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.44
% 0.19/0.44 %
% 0.19/0.44 % ------ iProver source info
% 0.19/0.44
% 0.19/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.44 % git: non_committed_changes: true
% 0.19/0.44 % git: last_make_outside_of_git: true
% 0.19/0.44
% 0.19/0.44 %
% 0.19/0.44 % ------ Input Options
% 0.19/0.44
% 0.19/0.44 % --out_options all
% 0.19/0.44 % --tptp_safe_out true
% 0.19/0.44 % --problem_path ""
% 0.19/0.44 % --include_path ""
% 0.19/0.44 % --clausifier .//eprover
% 0.19/0.44 % --clausifier_options --tstp-format
% 0.19/0.44 % --stdin false
% 0.19/0.44 % --dbg_backtrace false
% 0.19/0.44 % --dbg_dump_prop_clauses false
% 0.19/0.44 % --dbg_dump_prop_clauses_file -
% 0.19/0.44 % --dbg_out_stat false
% 0.19/0.44
% 0.19/0.44 % ------ General Options
% 0.19/0.44
% 0.19/0.44 % --fof false
% 0.19/0.44 % --time_out_real 150.
% 0.19/0.44 % --time_out_prep_mult 0.2
% 0.19/0.44 % --time_out_virtual -1.
% 0.19/0.44 % --schedule none
% 0.19/0.44 % --ground_splitting input
% 0.19/0.44 % --splitting_nvd 16
% 0.19/0.44 % --non_eq_to_eq false
% 0.19/0.44 % --prep_gs_sim true
% 0.19/0.44 % --prep_unflatten false
% 0.19/0.44 % --prep_res_sim true
% 0.19/0.44 % --prep_upred true
% 0.19/0.44 % --res_sim_input true
% 0.19/0.44 % --clause_weak_htbl true
% 0.19/0.44 % --gc_record_bc_elim false
% 0.19/0.44 % --symbol_type_check false
% 0.19/0.44 % --clausify_out false
% 0.19/0.44 % --large_theory_mode false
% 0.19/0.44 % --prep_sem_filter none
% 0.19/0.44 % --prep_sem_filter_out false
% 0.19/0.44 % --preprocessed_out false
% 0.19/0.44 % --sub_typing false
% 0.19/0.44 % --brand_transform false
% 0.19/0.44 % --pure_diseq_elim true
% 0.19/0.44 % --min_unsat_core false
% 0.19/0.44 % --pred_elim true
% 0.19/0.44 % --add_important_lit false
% 0.19/0.44 % --soft_assumptions false
% 0.19/0.44 % --reset_solvers false
% 0.19/0.44 % --bc_imp_inh []
% 0.19/0.44 % --conj_cone_tolerance 1.5
% 0.19/0.44 % --prolific_symb_bound 500
% 0.19/0.44 % --lt_threshold 2000
% 0.19/0.44
% 0.19/0.44 % ------ SAT Options
% 0.19/0.44
% 0.19/0.44 % --sat_mode false
% 0.19/0.44 % --sat_fm_restart_options ""
% 0.19/0.44 % --sat_gr_def false
% 0.19/0.44 % --sat_epr_types true
% 0.19/0.44 % --sat_non_cyclic_types false
% 0.19/0.44 % --sat_finite_models false
% 0.19/0.44 % --sat_fm_lemmas false
% 0.19/0.44 % --sat_fm_prep false
% 0.19/0.44 % --sat_fm_uc_incr true
% 0.19/0.44 % --sat_out_model small
% 0.19/0.44 % --sat_out_clauses false
% 0.19/0.44
% 0.19/0.44 % ------ QBF Options
% 0.19/0.44
% 0.19/0.44 % --qbf_mode false
% 0.19/0.44 % --qbf_elim_univ true
% 0.19/0.44 % --qbf_sk_in true
% 0.19/0.44 % --qbf_pred_elim true
% 0.19/0.44 % --qbf_split 32
% 0.19/0.44
% 0.19/0.44 % ------ BMC1 Options
% 0.19/0.44
% 0.19/0.44 % --bmc1_incremental false
% 0.19/0.44 % --bmc1_axioms reachable_all
% 0.19/0.44 % --bmc1_min_bound 0
% 0.19/0.44 % --bmc1_max_bound -1
% 0.19/0.44 % --bmc1_max_bound_default -1
% 0.19/0.44 % --bmc1_symbol_reachability true
% 0.19/0.44 % --bmc1_property_lemmas false
% 0.19/0.44 % --bmc1_k_induction false
% 0.19/0.44 % --bmc1_non_equiv_states false
% 0.19/0.44 % --bmc1_deadlock false
% 0.19/0.44 % --bmc1_ucm false
% 0.19/0.44 % --bmc1_add_unsat_core none
% 0.19/0.44 % --bmc1_unsat_core_children false
% 0.19/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.44 % --bmc1_out_stat full
% 0.19/0.44 % --bmc1_ground_init false
% 0.19/0.44 % --bmc1_pre_inst_next_state false
% 0.19/0.44 % --bmc1_pre_inst_state false
% 0.19/0.44 % --bmc1_pre_inst_reach_state false
% 0.19/0.44 % --bmc1_out_unsat_core false
% 0.19/0.44 % --bmc1_aig_witness_out false
% 0.19/0.44 % --bmc1_verbose false
% 0.19/0.44 % --bmc1_dump_clauses_tptp false
% 0.19/0.49 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.49 % --bmc1_dump_file -
% 0.19/0.49 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.49 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.49 % --bmc1_ucm_extend_mode 1
% 0.19/0.49 % --bmc1_ucm_init_mode 2
% 0.19/0.49 % --bmc1_ucm_cone_mode none
% 0.19/0.49 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.49 % --bmc1_ucm_relax_model 4
% 0.19/0.49 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.49 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.49 % --bmc1_ucm_layered_model none
% 0.19/0.49 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.49
% 0.19/0.49 % ------ AIG Options
% 0.19/0.49
% 0.19/0.49 % --aig_mode false
% 0.19/0.49
% 0.19/0.49 % ------ Instantiation Options
% 0.19/0.49
% 0.19/0.49 % --instantiation_flag true
% 0.19/0.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.49 % --inst_solver_per_active 750
% 0.19/0.49 % --inst_solver_calls_frac 0.5
% 0.19/0.49 % --inst_passive_queue_type priority_queues
% 0.19/0.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.49 % --inst_passive_queues_freq [25;2]
% 0.19/0.49 % --inst_dismatching true
% 0.19/0.49 % --inst_eager_unprocessed_to_passive true
% 0.19/0.49 % --inst_prop_sim_given true
% 0.19/0.49 % --inst_prop_sim_new false
% 0.19/0.49 % --inst_orphan_elimination true
% 0.19/0.49 % --inst_learning_loop_flag true
% 0.19/0.49 % --inst_learning_start 3000
% 0.19/0.49 % --inst_learning_factor 2
% 0.19/0.49 % --inst_start_prop_sim_after_learn 3
% 0.19/0.49 % --inst_sel_renew solver
% 0.19/0.49 % --inst_lit_activity_flag true
% 0.19/0.49 % --inst_out_proof true
% 0.19/0.49
% 0.19/0.49 % ------ Resolution Options
% 0.19/0.49
% 0.19/0.49 % --resolution_flag true
% 0.19/0.49 % --res_lit_sel kbo_max
% 0.19/0.49 % --res_to_prop_solver none
% 0.19/0.49 % --res_prop_simpl_new false
% 0.19/0.49 % --res_prop_simpl_given false
% 0.19/0.49 % --res_passive_queue_type priority_queues
% 0.19/0.49 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.49 % --res_passive_queues_freq [15;5]
% 0.19/0.49 % --res_forward_subs full
% 0.19/0.49 % --res_backward_subs full
% 0.19/0.49 % --res_forward_subs_resolution true
% 0.19/0.49 % --res_backward_subs_resolution true
% 0.19/0.49 % --res_orphan_elimination false
% 0.19/0.49 % --res_time_limit 1000.
% 0.19/0.49 % --res_out_proof true
% 0.19/0.49 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_83ca49.s
% 0.19/0.49 % --modulo true
% 0.19/0.49
% 0.19/0.49 % ------ Combination Options
% 0.19/0.49
% 0.19/0.49 % --comb_res_mult 1000
% 0.19/0.49 % --comb_inst_mult 300
% 0.19/0.49 % ------
% 0.19/0.49
% 0.19/0.49 % ------ Parsing...% successful
% 0.19/0.49
% 0.19/0.49 % ------ Preprocessing... gs_s sp: 148 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.19/0.49
% 0.19/0.49 % ------ Proving...
% 0.19/0.49 % ------ Problem Properties
% 0.19/0.49
% 0.19/0.49 %
% 0.19/0.49 % EPR true
% 0.19/0.49 % Horn false
% 0.19/0.49 % Has equality false
% 0.19/0.49
% 0.19/0.49 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 % % ------ Current options:
% 0.19/0.49
% 0.19/0.49 % ------ Input Options
% 0.19/0.49
% 0.19/0.49 % --out_options all
% 0.19/0.49 % --tptp_safe_out true
% 0.19/0.49 % --problem_path ""
% 0.19/0.49 % --include_path ""
% 0.19/0.49 % --clausifier .//eprover
% 0.19/0.49 % --clausifier_options --tstp-format
% 0.19/0.49 % --stdin false
% 0.19/0.49 % --dbg_backtrace false
% 0.19/0.49 % --dbg_dump_prop_clauses false
% 0.19/0.49 % --dbg_dump_prop_clauses_file -
% 0.19/0.49 % --dbg_out_stat false
% 0.19/0.49
% 0.19/0.49 % ------ General Options
% 0.19/0.49
% 0.19/0.49 % --fof false
% 0.19/0.49 % --time_out_real 150.
% 0.19/0.49 % --time_out_prep_mult 0.2
% 0.19/0.49 % --time_out_virtual -1.
% 0.19/0.49 % --schedule none
% 0.19/0.49 % --ground_splitting input
% 0.19/0.49 % --splitting_nvd 16
% 0.19/0.49 % --non_eq_to_eq false
% 0.19/0.49 % --prep_gs_sim true
% 0.19/0.49 % --prep_unflatten false
% 0.19/0.49 % --prep_res_sim true
% 0.19/0.49 % --prep_upred true
% 0.19/0.49 % --res_sim_input true
% 0.19/0.49 % --clause_weak_htbl true
% 0.19/0.49 % --gc_record_bc_elim false
% 0.19/0.49 % --symbol_type_check false
% 0.19/0.49 % --clausify_out false
% 0.19/0.49 % --large_theory_mode false
% 0.19/0.49 % --prep_sem_filter none
% 0.19/0.49 % --prep_sem_filter_out false
% 0.19/0.49 % --preprocessed_out false
% 0.19/0.49 % --sub_typing false
% 0.19/0.49 % --brand_transform false
% 0.19/0.49 % --pure_diseq_elim true
% 0.19/0.49 % --min_unsat_core false
% 0.19/0.49 % --pred_elim true
% 0.19/0.49 % --add_important_lit false
% 0.19/0.49 % --soft_assumptions false
% 0.19/0.49 % --reset_solvers false
% 0.19/0.49 % --bc_imp_inh []
% 0.19/0.49 % --conj_cone_tolerance 1.5
% 0.19/0.49 % --prolific_symb_bound 500
% 0.19/0.49 % --lt_threshold 2000
% 0.19/0.49
% 0.19/0.49 % ------ SAT Options
% 0.19/0.49
% 0.19/0.49 % --sat_mode false
% 0.19/0.49 % --sat_fm_restart_options ""
% 0.19/0.49 % --sat_gr_def false
% 0.19/0.49 % --sat_epr_types true
% 0.19/0.49 % --sat_non_cyclic_types false
% 0.19/0.49 % --sat_finite_models false
% 0.19/0.49 % --sat_fm_lemmas false
% 0.19/0.49 % --sat_fm_prep false
% 0.19/0.49 % --sat_fm_uc_incr true
% 0.19/0.49 % --sat_out_model small
% 0.19/0.49 % --sat_out_clauses false
% 0.19/0.49
% 0.19/0.49 % ------ QBF Options
% 0.19/0.49
% 0.19/0.49 % --qbf_mode false
% 0.19/0.49 % --qbf_elim_univ true
% 0.19/0.49 % --qbf_sk_in true
% 0.19/0.49 % --qbf_pred_elim true
% 0.19/0.49 % --qbf_split 32
% 0.19/0.49
% 0.19/0.49 % ------ BMC1 Options
% 0.19/0.49
% 0.19/0.49 % --bmc1_incremental false
% 0.19/0.49 % --bmc1_axioms reachable_all
% 0.19/0.49 % --bmc1_min_bound 0
% 0.19/0.49 % --bmc1_max_bound -1
% 0.19/0.49 % --bmc1_max_bound_default -1
% 0.19/0.49 % --bmc1_symbol_reachability true
% 0.19/0.49 % --bmc1_property_lemmas false
% 0.19/0.49 % --bmc1_k_induction false
% 0.19/0.49 % --bmc1_non_equiv_states false
% 0.19/0.49 % --bmc1_deadlock false
% 0.19/0.49 % --bmc1_ucm false
% 0.19/0.49 % --bmc1_add_unsat_core none
% 0.19/0.49 % --bmc1_unsat_core_children false
% 0.19/0.49 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.49 % --bmc1_out_stat full
% 0.19/0.49 % --bmc1_ground_init false
% 0.19/0.49 % --bmc1_pre_inst_next_state false
% 0.19/0.49 % --bmc1_pre_inst_state false
% 0.19/0.49 % --bmc1_pre_inst_reach_state false
% 0.19/0.49 % --bmc1_out_unsat_core false
% 0.19/0.49 % --bmc1_aig_witness_out false
% 0.19/0.49 % --bmc1_verbose false
% 0.19/0.49 % --bmc1_dump_clauses_tptp false
% 0.19/0.49 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.49 % --bmc1_dump_file -
% 0.19/0.49 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.49 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.49 % --bmc1_ucm_extend_mode 1
% 0.19/0.49 % --bmc1_ucm_init_mode 2
% 0.19/0.49 % --bmc1_ucm_cone_mode none
% 0.19/0.49 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.49 % --bmc1_ucm_relax_model 4
% 0.19/0.49 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.49 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.49 % --bmc1_ucm_layered_model none
% 0.19/0.49 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.49
% 0.19/0.49 % ------ AIG Options
% 0.19/0.49
% 0.19/0.49 % --aig_mode false
% 0.19/0.49
% 0.19/0.49 % ------ Instantiation Options
% 0.19/0.49
% 0.19/0.49 % --instantiation_flag true
% 0.19/0.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.49 % --inst_solver_per_active 750
% 0.19/0.49 % --inst_solver_calls_frac 0.5
% 0.19/0.49 % --inst_passive_queue_type priority_queues
% 0.19/0.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.49 % --inst_passive_queues_freq [25;2]
% 0.19/0.49 % --inst_dismatching true
% 0.19/0.49 % --inst_eager_unprocessed_to_passive true
% 1.11/1.29 % --inst_prop_sim_given true
% 1.11/1.29 % --inst_prop_sim_new false
% 1.11/1.29 % --inst_orphan_elimination true
% 1.11/1.29 % --inst_learning_loop_flag true
% 1.11/1.29 % --inst_learning_start 3000
% 1.11/1.29 % --inst_learning_factor 2
% 1.11/1.29 % --inst_start_prop_sim_after_learn 3
% 1.11/1.29 % --inst_sel_renew solver
% 1.11/1.29 % --inst_lit_activity_flag true
% 1.11/1.29 % --inst_out_proof true
% 1.11/1.29
% 1.11/1.29 % ------ Resolution Options
% 1.11/1.29
% 1.11/1.29 % --resolution_flag true
% 1.11/1.29 % --res_lit_sel kbo_max
% 1.11/1.29 % --res_to_prop_solver none
% 1.11/1.29 % --res_prop_simpl_new false
% 1.11/1.29 % --res_prop_simpl_given false
% 1.11/1.29 % --res_passive_queue_type priority_queues
% 1.11/1.29 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.11/1.29 % --res_passive_queues_freq [15;5]
% 1.11/1.29 % --res_forward_subs full
% 1.11/1.29 % --res_backward_subs full
% 1.11/1.29 % --res_forward_subs_resolution true
% 1.11/1.29 % --res_backward_subs_resolution true
% 1.11/1.29 % --res_orphan_elimination false
% 1.11/1.29 % --res_time_limit 1000.
% 1.11/1.29 % --res_out_proof true
% 1.11/1.29 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_83ca49.s
% 1.11/1.29 % --modulo true
% 1.11/1.29
% 1.11/1.29 % ------ Combination Options
% 1.11/1.29
% 1.11/1.29 % --comb_res_mult 1000
% 1.11/1.29 % --comb_inst_mult 300
% 1.11/1.29 % ------
% 1.11/1.29
% 1.11/1.29
% 1.11/1.29
% 1.11/1.29 % ------ Proving...
% 1.11/1.29 % warning: shown sat in sat incomplete mode
% 1.11/1.29 %
% 1.11/1.29
% 1.11/1.29
% 1.11/1.29 ------ Building Model...Done
% 1.11/1.29
% 1.11/1.29 %------ The model is defined over ground terms (initial term algebra).
% 1.11/1.29 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.11/1.29 %------ where \phi is a formula over the term algebra.
% 1.11/1.29 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.11/1.29 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.11/1.29 %------ See help for --sat_out_model for different model outputs.
% 1.11/1.29 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.11/1.29 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.11/1.29
% 1.11/1.29
% 1.11/1.29
% 1.11/1.29
% 1.11/1.29 %------ Negative definition of c1_1
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 (! [X0] :
% 1.11/1.29 ( ~(c1_1(X0)) <=>
% 1.11/1.29 (
% 1.11/1.29 (
% 1.11/1.29 ( X0=a60 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a98 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a117 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 )
% 1.11/1.29 )
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of c2_1
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 (! [X0] :
% 1.11/1.29 ( c2_1(X0) <=>
% 1.11/1.29 (
% 1.11/1.29 (
% 1.11/1.29 ( X0=a55 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a57 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a58 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a59 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a61 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a69 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a71 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a73 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a74 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a104 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a116 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a66 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a87 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 )
% 1.11/1.29 )
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of c3_1
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 (! [X0] :
% 1.11/1.29 ( c3_1(X0) <=>
% 1.11/1.29 (
% 1.11/1.29 (
% 1.11/1.29 ( X0=a55 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a57 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a58 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a59 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a61 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a69 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a71 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a73 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a74 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a79 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a82 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a83 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a104 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a116 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a66 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a87 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a96 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 )
% 1.11/1.29 )
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of ndr1_0
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( ndr1_0 <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Negative definition of c0_1
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 (! [X0] :
% 1.11/1.29 ( ~(c0_1(X0)) <=>
% 1.11/1.29 (
% 1.11/1.29 (
% 1.11/1.29 ( X0=a55 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a57 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a58 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a59 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a61 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a69 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a71 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a73 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a74 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a104 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a116 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a66 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 |
% 1.11/1.29 (
% 1.11/1.29 ( X0=a87 )
% 1.11/1.29 )
% 1.11/1.29
% 1.11/1.29 )
% 1.11/1.29 )
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp0
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp0 <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp15
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp15 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp10
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp10 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp11
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp11 <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp2
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp2 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp17
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp17 <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp20
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp20 <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp14
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp14 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp13
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp13 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp3
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp3 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp4
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp4 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp6
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp6 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp5
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp5 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp7
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp7 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp22
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp22 <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp27
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp27 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp28
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp28 <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp12
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp12 <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp16
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp16 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp26
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp26 <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp21
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp21 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp1
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp1 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp19
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp19 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp18
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp18 <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp9
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp9 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp8
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp8 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp23
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp23 <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp24
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp24 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp25
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp25 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of hskp29
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( hskp29 <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP0_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP0_iProver_split <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP1_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP1_iProver_split <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP2_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP2_iProver_split <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP3_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP3_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP4_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP4_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP5_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP5_iProver_split <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP6_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP6_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP7_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP7_iProver_split <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP8_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP8_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP9_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP9_iProver_split <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP10_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP10_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP13_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP13_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP14_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP14_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP15_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP15_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP16_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP16_iProver_split <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP17_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP17_iProver_split <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP19_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP19_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP20_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP20_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP22_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP22_iProver_split <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP23_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP23_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP24_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP24_iProver_split <=>
% 1.11/1.29 $true
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29 %------ Positive definition of sP25_iProver_split
% 1.11/1.29 fof(lit_def,axiom,
% 1.11/1.29 ( sP25_iProver_split <=>
% 1.11/1.29 $false
% 1.11/1.29 )
% 1.11/1.29 ).
% 1.11/1.29
% 1.11/1.29
% 1.11/1.29
% 1.11/1.29 % ------ Statistics
% 1.11/1.29
% 1.11/1.29 % ------ General
% 1.11/1.29
% 1.11/1.29 % num_of_input_clauses: 168
% 1.11/1.29 % num_of_input_neg_conjectures: 168
% 1.11/1.29 % num_of_splits: 148
% 1.11/1.29 % num_of_split_atoms: 29
% 1.11/1.29 % num_of_sem_filtered_clauses: 0
% 1.11/1.29 % num_of_subtypes: 0
% 1.11/1.29 % monotx_restored_types: 0
% 1.11/1.29 % sat_num_of_epr_types: 0
% 1.11/1.29 % sat_num_of_non_cyclic_types: 0
% 1.11/1.29 % sat_guarded_non_collapsed_types: 0
% 1.11/1.29 % is_epr: 1
% 1.11/1.29 % is_horn: 0
% 1.11/1.29 % has_eq: 0
% 1.11/1.29 % num_pure_diseq_elim: 0
% 1.11/1.29 % simp_replaced_by: 0
% 1.11/1.29 % res_preprocessed: 484
% 1.11/1.29 % prep_upred: 0
% 1.11/1.29 % prep_unflattend: 0
% 1.11/1.29 % pred_elim_cands: 29
% 1.11/1.29 % pred_elim: 7
% 1.11/1.29 % pred_elim_cl: 7
% 1.11/1.29 % pred_elim_cycles: 29
% 1.11/1.29 % forced_gc_time: 0
% 1.11/1.29 % gc_basic_clause_elim: 0
% 1.11/1.29 % parsing_time: 0.003
% 1.11/1.29 % sem_filter_time: 0.
% 1.11/1.29 % pred_elim_time: 0.031
% 1.11/1.29 % out_proof_time: 0.
% 1.11/1.29 % monotx_time: 0.
% 1.11/1.29 % subtype_inf_time: 0.
% 1.11/1.29 % unif_index_cands_time: 0.002
% 1.11/1.29 % unif_index_add_time: 0.003
% 1.11/1.29 % total_time: 0.87
% 1.11/1.29 % num_of_symbols: 119
% 1.11/1.29 % num_of_terms: 426
% 1.11/1.29
% 1.11/1.29 % ------ Propositional Solver
% 1.11/1.29
% 1.11/1.29 % prop_solver_calls: 11
% 1.11/1.29 % prop_fast_solver_calls: 2577
% 1.11/1.29 % prop_num_of_clauses: 795
% 1.11/1.29 % prop_preprocess_simplified: 3262
% 1.11/1.29 % prop_fo_subsumed: 143
% 1.11/1.29 % prop_solver_time: 0.
% 1.11/1.29 % prop_fast_solver_time: 0.002
% 1.11/1.29 % prop_unsat_core_time: 0.
% 1.11/1.29
% 1.11/1.29 % ------ QBF
% 1.11/1.29
% 1.11/1.29 % qbf_q_res: 0
% 1.11/1.29 % qbf_num_tautologies: 0
% 1.11/1.29 % qbf_prep_cycles: 0
% 1.11/1.29
% 1.11/1.29 % ------ BMC1
% 1.11/1.29
% 1.11/1.29 % bmc1_current_bound: -1
% 1.11/1.29 % bmc1_last_solved_bound: -1
% 1.11/1.29 % bmc1_unsat_core_size: -1
% 1.11/1.29 % bmc1_unsat_core_parents_size: -1
% 1.11/1.29 % bmc1_merge_next_fun: 0
% 1.11/1.29 % bmc1_unsat_core_clauses_time: 0.
% 1.11/1.29
% 1.11/1.29 % ------ Instantiation
% 1.11/1.29
% 1.11/1.29 % inst_num_of_clauses: 490
% 1.11/1.29 % inst_num_in_passive: 0
% 1.11/1.29 % inst_num_in_active: 490
% 1.11/1.29 % inst_num_in_unprocessed: 0
% 1.11/1.29 % inst_num_of_loops: 673
% 1.11/1.29 % inst_num_of_learning_restarts: 0
% 1.11/1.29 % inst_num_moves_active_passive: 173
% 1.11/1.29 % inst_lit_activity: 71
% 1.11/1.29 % inst_lit_activity_moves: 0
% 1.11/1.29 % inst_num_tautologies: 0
% 1.11/1.29 % inst_num_prop_implied: 0
% 1.11/1.29 % inst_num_existing_simplified: 0
% 1.11/1.29 % inst_num_eq_res_simplified: 0
% 1.11/1.29 % inst_num_child_elim: 0
% 1.11/1.29 % inst_num_of_dismatching_blockings: 0
% 1.11/1.29 % inst_num_of_non_proper_insts: 489
% 1.11/1.29 % inst_num_of_duplicates: 28
% 1.11/1.29 % inst_inst_num_from_inst_to_res: 0
% 1.11/1.29 % inst_dismatching_checking_time: 0.
% 1.11/1.29
% 1.11/1.29 % ------ Resolution
% 1.11/1.29
% 1.11/1.29 % res_num_of_clauses: 17830
% 1.11/1.29 % res_num_in_passive: 16388
% 1.11/1.29 % res_num_in_active: 2005
% 1.11/1.29 % res_num_of_loops: 3000
% 1.11/1.29 % res_forward_subset_subsumed: 3752
% 1.11/1.29 % res_backward_subset_subsumed: 660
% 1.11/1.29 % res_forward_subsumed: 749
% 1.11/1.29 % res_backward_subsumed: 120
% 1.11/1.29 % res_forward_subsumption_resolution: 606
% 1.11/1.29 % res_backward_subsumption_resolution: 64
% 1.11/1.29 % res_clause_to_clause_subsumption: 1539
% 1.11/1.29 % res_orphan_elimination: 0
% 1.11/1.29 % res_tautology_del: 4470
% 1.11/1.29 % res_num_eq_res_simplified: 0
% 1.11/1.29 % res_num_sel_changes: 0
% 1.11/1.29 % res_moves_from_active_to_pass: 0
% 1.11/1.29
% 1.11/1.29 % Status Unknown
% 1.11/1.34 % Orienting using strategy ClausalAll
% 1.11/1.34 % Orientation found
% 1.11/1.34 % 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_83ca49.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_e9a055.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_5bba0c | grep -v "SZS"
% 1.11/1.35
% 1.11/1.35 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.11/1.35
% 1.11/1.35 %
% 1.11/1.35 % ------ iProver source info
% 1.11/1.35
% 1.11/1.35 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.11/1.35 % git: non_committed_changes: true
% 1.11/1.35 % git: last_make_outside_of_git: true
% 1.11/1.35
% 1.11/1.35 %
% 1.11/1.35 % ------ Input Options
% 1.11/1.35
% 1.11/1.35 % --out_options all
% 1.11/1.35 % --tptp_safe_out true
% 1.11/1.35 % --problem_path ""
% 1.11/1.35 % --include_path ""
% 1.11/1.35 % --clausifier .//eprover
% 1.11/1.35 % --clausifier_options --tstp-format
% 1.11/1.35 % --stdin false
% 1.11/1.35 % --dbg_backtrace false
% 1.11/1.35 % --dbg_dump_prop_clauses false
% 1.11/1.35 % --dbg_dump_prop_clauses_file -
% 1.11/1.35 % --dbg_out_stat false
% 1.11/1.35
% 1.11/1.35 % ------ General Options
% 1.11/1.35
% 1.11/1.35 % --fof false
% 1.11/1.35 % --time_out_real 150.
% 1.11/1.35 % --time_out_prep_mult 0.2
% 1.11/1.35 % --time_out_virtual -1.
% 1.11/1.35 % --schedule none
% 1.11/1.35 % --ground_splitting input
% 1.11/1.35 % --splitting_nvd 16
% 1.11/1.35 % --non_eq_to_eq false
% 1.11/1.35 % --prep_gs_sim true
% 1.11/1.35 % --prep_unflatten false
% 1.11/1.35 % --prep_res_sim true
% 1.11/1.35 % --prep_upred true
% 1.11/1.35 % --res_sim_input true
% 1.11/1.35 % --clause_weak_htbl true
% 1.11/1.35 % --gc_record_bc_elim false
% 1.11/1.35 % --symbol_type_check false
% 1.11/1.35 % --clausify_out false
% 1.11/1.35 % --large_theory_mode false
% 1.11/1.35 % --prep_sem_filter none
% 1.11/1.35 % --prep_sem_filter_out false
% 1.11/1.35 % --preprocessed_out false
% 1.11/1.35 % --sub_typing false
% 1.11/1.35 % --brand_transform false
% 1.11/1.35 % --pure_diseq_elim true
% 1.11/1.35 % --min_unsat_core false
% 1.11/1.35 % --pred_elim true
% 1.11/1.35 % --add_important_lit false
% 1.11/1.35 % --soft_assumptions false
% 1.11/1.35 % --reset_solvers false
% 1.11/1.35 % --bc_imp_inh []
% 1.11/1.35 % --conj_cone_tolerance 1.5
% 1.11/1.35 % --prolific_symb_bound 500
% 1.11/1.35 % --lt_threshold 2000
% 1.11/1.35
% 1.11/1.35 % ------ SAT Options
% 1.11/1.35
% 1.11/1.35 % --sat_mode false
% 1.11/1.35 % --sat_fm_restart_options ""
% 1.11/1.35 % --sat_gr_def false
% 1.11/1.35 % --sat_epr_types true
% 1.11/1.35 % --sat_non_cyclic_types false
% 1.11/1.35 % --sat_finite_models false
% 1.11/1.35 % --sat_fm_lemmas false
% 1.11/1.35 % --sat_fm_prep false
% 1.11/1.35 % --sat_fm_uc_incr true
% 1.11/1.35 % --sat_out_model small
% 1.11/1.35 % --sat_out_clauses false
% 1.11/1.35
% 1.11/1.35 % ------ QBF Options
% 1.11/1.35
% 1.11/1.35 % --qbf_mode false
% 1.11/1.35 % --qbf_elim_univ true
% 1.11/1.35 % --qbf_sk_in true
% 1.11/1.35 % --qbf_pred_elim true
% 1.11/1.35 % --qbf_split 32
% 1.11/1.35
% 1.11/1.35 % ------ BMC1 Options
% 1.11/1.35
% 1.11/1.35 % --bmc1_incremental false
% 1.11/1.35 % --bmc1_axioms reachable_all
% 1.11/1.35 % --bmc1_min_bound 0
% 1.11/1.35 % --bmc1_max_bound -1
% 1.11/1.35 % --bmc1_max_bound_default -1
% 1.11/1.35 % --bmc1_symbol_reachability true
% 1.11/1.35 % --bmc1_property_lemmas false
% 1.11/1.35 % --bmc1_k_induction false
% 1.11/1.35 % --bmc1_non_equiv_states false
% 1.11/1.35 % --bmc1_deadlock false
% 1.11/1.35 % --bmc1_ucm false
% 1.11/1.35 % --bmc1_add_unsat_core none
% 1.11/1.35 % --bmc1_unsat_core_children false
% 1.11/1.35 % --bmc1_unsat_core_extrapolate_axioms false
% 1.11/1.35 % --bmc1_out_stat full
% 1.11/1.35 % --bmc1_ground_init false
% 1.11/1.35 % --bmc1_pre_inst_next_state false
% 1.11/1.35 % --bmc1_pre_inst_state false
% 1.11/1.35 % --bmc1_pre_inst_reach_state false
% 1.11/1.35 % --bmc1_out_unsat_core false
% 1.11/1.35 % --bmc1_aig_witness_out false
% 1.11/1.35 % --bmc1_verbose false
% 1.11/1.35 % --bmc1_dump_clauses_tptp false
% 1.18/1.38 % --bmc1_dump_unsat_core_tptp false
% 1.18/1.38 % --bmc1_dump_file -
% 1.18/1.38 % --bmc1_ucm_expand_uc_limit 128
% 1.18/1.38 % --bmc1_ucm_n_expand_iterations 6
% 1.18/1.38 % --bmc1_ucm_extend_mode 1
% 1.18/1.38 % --bmc1_ucm_init_mode 2
% 1.18/1.38 % --bmc1_ucm_cone_mode none
% 1.18/1.38 % --bmc1_ucm_reduced_relation_type 0
% 1.18/1.38 % --bmc1_ucm_relax_model 4
% 1.18/1.38 % --bmc1_ucm_full_tr_after_sat true
% 1.18/1.38 % --bmc1_ucm_expand_neg_assumptions false
% 1.18/1.38 % --bmc1_ucm_layered_model none
% 1.18/1.38 % --bmc1_ucm_max_lemma_size 10
% 1.18/1.38
% 1.18/1.38 % ------ AIG Options
% 1.18/1.38
% 1.18/1.38 % --aig_mode false
% 1.18/1.38
% 1.18/1.38 % ------ Instantiation Options
% 1.18/1.38
% 1.18/1.38 % --instantiation_flag true
% 1.18/1.38 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.18/1.38 % --inst_solver_per_active 750
% 1.18/1.38 % --inst_solver_calls_frac 0.5
% 1.18/1.38 % --inst_passive_queue_type priority_queues
% 1.18/1.38 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.18/1.38 % --inst_passive_queues_freq [25;2]
% 1.18/1.38 % --inst_dismatching true
% 1.18/1.38 % --inst_eager_unprocessed_to_passive true
% 1.18/1.38 % --inst_prop_sim_given true
% 1.18/1.38 % --inst_prop_sim_new false
% 1.18/1.38 % --inst_orphan_elimination true
% 1.18/1.38 % --inst_learning_loop_flag true
% 1.18/1.38 % --inst_learning_start 3000
% 1.18/1.38 % --inst_learning_factor 2
% 1.18/1.38 % --inst_start_prop_sim_after_learn 3
% 1.18/1.38 % --inst_sel_renew solver
% 1.18/1.38 % --inst_lit_activity_flag true
% 1.18/1.38 % --inst_out_proof true
% 1.18/1.38
% 1.18/1.38 % ------ Resolution Options
% 1.18/1.38
% 1.18/1.38 % --resolution_flag true
% 1.18/1.38 % --res_lit_sel kbo_max
% 1.18/1.38 % --res_to_prop_solver none
% 1.18/1.38 % --res_prop_simpl_new false
% 1.18/1.38 % --res_prop_simpl_given false
% 1.18/1.38 % --res_passive_queue_type priority_queues
% 1.18/1.38 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.18/1.38 % --res_passive_queues_freq [15;5]
% 1.18/1.38 % --res_forward_subs full
% 1.18/1.38 % --res_backward_subs full
% 1.18/1.38 % --res_forward_subs_resolution true
% 1.18/1.38 % --res_backward_subs_resolution true
% 1.18/1.38 % --res_orphan_elimination false
% 1.18/1.38 % --res_time_limit 1000.
% 1.18/1.38 % --res_out_proof true
% 1.18/1.38 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_83ca49.s
% 1.18/1.38 % --modulo true
% 1.18/1.38
% 1.18/1.38 % ------ Combination Options
% 1.18/1.38
% 1.18/1.38 % --comb_res_mult 1000
% 1.18/1.38 % --comb_inst_mult 300
% 1.18/1.38 % ------
% 1.18/1.38
% 1.18/1.38 % ------ Parsing...% successful
% 1.18/1.38
% 1.18/1.38 % ------ Preprocessing... gs_s sp: 148 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 %
% 1.18/1.38
% 1.18/1.38 % ------ Proving...
% 1.18/1.38 % ------ Problem Properties
% 1.18/1.38
% 1.18/1.38 %
% 1.18/1.38 % EPR true
% 1.18/1.38 % Horn false
% 1.18/1.38 % Has equality false
% 1.18/1.38
% 1.18/1.38 % % ------ Input Options Time Limit: Unbounded
% 1.18/1.38
% 1.18/1.38
% 1.18/1.38 % % ------ Current options:
% 1.18/1.38
% 1.18/1.38 % ------ Input Options
% 1.18/1.38
% 1.18/1.38 % --out_options all
% 1.18/1.38 % --tptp_safe_out true
% 1.18/1.38 % --problem_path ""
% 1.18/1.38 % --include_path ""
% 1.18/1.38 % --clausifier .//eprover
% 1.18/1.38 % --clausifier_options --tstp-format
% 1.18/1.38 % --stdin false
% 1.18/1.38 % --dbg_backtrace false
% 1.18/1.38 % --dbg_dump_prop_clauses false
% 1.18/1.38 % --dbg_dump_prop_clauses_file -
% 1.18/1.38 % --dbg_out_stat false
% 1.18/1.38
% 1.18/1.38 % ------ General Options
% 1.18/1.38
% 1.18/1.38 % --fof false
% 1.18/1.38 % --time_out_real 150.
% 1.18/1.38 % --time_out_prep_mult 0.2
% 1.18/1.38 % --time_out_virtual -1.
% 1.18/1.38 % --schedule none
% 1.18/1.38 % --ground_splitting input
% 1.18/1.38 % --splitting_nvd 16
% 1.18/1.38 % --non_eq_to_eq false
% 1.18/1.38 % --prep_gs_sim true
% 1.18/1.38 % --prep_unflatten false
% 1.18/1.38 % --prep_res_sim true
% 1.18/1.38 % --prep_upred true
% 1.18/1.38 % --res_sim_input true
% 1.18/1.38 % --clause_weak_htbl true
% 1.18/1.38 % --gc_record_bc_elim false
% 1.18/1.38 % --symbol_type_check false
% 1.18/1.38 % --clausify_out false
% 1.18/1.38 % --large_theory_mode false
% 1.18/1.38 % --prep_sem_filter none
% 1.18/1.38 % --prep_sem_filter_out false
% 1.18/1.38 % --preprocessed_out false
% 1.18/1.38 % --sub_typing false
% 1.18/1.38 % --brand_transform false
% 1.18/1.38 % --pure_diseq_elim true
% 1.18/1.38 % --min_unsat_core false
% 1.18/1.38 % --pred_elim true
% 1.18/1.38 % --add_important_lit false
% 1.18/1.38 % --soft_assumptions false
% 1.18/1.38 % --reset_solvers false
% 1.18/1.38 % --bc_imp_inh []
% 1.18/1.38 % --conj_cone_tolerance 1.5
% 1.18/1.38 % --prolific_symb_bound 500
% 1.18/1.38 % --lt_threshold 2000
% 1.18/1.38
% 1.18/1.38 % ------ SAT Options
% 1.18/1.38
% 1.18/1.38 % --sat_mode false
% 1.18/1.38 % --sat_fm_restart_options ""
% 1.18/1.38 % --sat_gr_def false
% 1.18/1.38 % --sat_epr_types true
% 1.18/1.38 % --sat_non_cyclic_types false
% 1.18/1.38 % --sat_finite_models false
% 1.18/1.38 % --sat_fm_lemmas false
% 1.18/1.38 % --sat_fm_prep false
% 1.18/1.38 % --sat_fm_uc_incr true
% 1.18/1.38 % --sat_out_model small
% 1.18/1.38 % --sat_out_clauses false
% 1.18/1.38
% 1.18/1.38 % ------ QBF Options
% 1.18/1.38
% 1.18/1.38 % --qbf_mode false
% 1.18/1.38 % --qbf_elim_univ true
% 1.18/1.38 % --qbf_sk_in true
% 1.18/1.38 % --qbf_pred_elim true
% 1.18/1.38 % --qbf_split 32
% 1.18/1.38
% 1.18/1.38 % ------ BMC1 Options
% 1.18/1.38
% 1.18/1.38 % --bmc1_incremental false
% 1.18/1.38 % --bmc1_axioms reachable_all
% 1.18/1.38 % --bmc1_min_bound 0
% 1.18/1.38 % --bmc1_max_bound -1
% 1.18/1.38 % --bmc1_max_bound_default -1
% 1.18/1.38 % --bmc1_symbol_reachability true
% 1.18/1.38 % --bmc1_property_lemmas false
% 1.18/1.38 % --bmc1_k_induction false
% 1.18/1.38 % --bmc1_non_equiv_states false
% 1.18/1.38 % --bmc1_deadlock false
% 1.18/1.38 % --bmc1_ucm false
% 1.18/1.38 % --bmc1_add_unsat_core none
% 1.18/1.38 % --bmc1_unsat_core_children false
% 1.18/1.38 % --bmc1_unsat_core_extrapolate_axioms false
% 1.18/1.38 % --bmc1_out_stat full
% 1.18/1.38 % --bmc1_ground_init false
% 1.18/1.38 % --bmc1_pre_inst_next_state false
% 1.18/1.38 % --bmc1_pre_inst_state false
% 1.18/1.38 % --bmc1_pre_inst_reach_state false
% 1.18/1.38 % --bmc1_out_unsat_core false
% 1.18/1.38 % --bmc1_aig_witness_out false
% 1.18/1.38 % --bmc1_verbose false
% 1.18/1.38 % --bmc1_dump_clauses_tptp false
% 1.18/1.38 % --bmc1_dump_unsat_core_tptp false
% 1.18/1.38 % --bmc1_dump_file -
% 1.18/1.38 % --bmc1_ucm_expand_uc_limit 128
% 1.18/1.38 % --bmc1_ucm_n_expand_iterations 6
% 1.18/1.38 % --bmc1_ucm_extend_mode 1
% 1.18/1.38 % --bmc1_ucm_init_mode 2
% 1.18/1.38 % --bmc1_ucm_cone_mode none
% 1.18/1.38 % --bmc1_ucm_reduced_relation_type 0
% 1.18/1.38 % --bmc1_ucm_relax_model 4
% 1.18/1.38 % --bmc1_ucm_full_tr_after_sat true
% 1.18/1.38 % --bmc1_ucm_expand_neg_assumptions false
% 1.18/1.38 % --bmc1_ucm_layered_model none
% 1.18/1.38 % --bmc1_ucm_max_lemma_size 10
% 1.18/1.38
% 1.18/1.38 % ------ AIG Options
% 1.18/1.38
% 1.18/1.38 % --aig_mode false
% 1.18/1.38
% 1.18/1.38 % ------ Instantiation Options
% 1.18/1.38
% 1.18/1.38 % --instantiation_flag true
% 1.18/1.38 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.18/1.38 % --inst_solver_per_active 750
% 1.18/1.38 % --inst_solver_calls_frac 0.5
% 1.18/1.38 % --inst_passive_queue_type priority_queues
% 1.18/1.38 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.18/1.38 % --inst_passive_queues_freq [25;2]
% 1.18/1.38 % --inst_dismatching true
% 1.18/1.38 % --inst_eager_unprocessed_to_passive true
% 1.84/2.09 % --inst_prop_sim_given true
% 1.84/2.09 % --inst_prop_sim_new false
% 1.84/2.09 % --inst_orphan_elimination true
% 1.84/2.09 % --inst_learning_loop_flag true
% 1.84/2.09 % --inst_learning_start 3000
% 1.84/2.09 % --inst_learning_factor 2
% 1.84/2.09 % --inst_start_prop_sim_after_learn 3
% 1.84/2.09 % --inst_sel_renew solver
% 1.84/2.09 % --inst_lit_activity_flag true
% 1.84/2.09 % --inst_out_proof true
% 1.84/2.09
% 1.84/2.09 % ------ Resolution Options
% 1.84/2.09
% 1.84/2.09 % --resolution_flag true
% 1.84/2.09 % --res_lit_sel kbo_max
% 1.84/2.09 % --res_to_prop_solver none
% 1.84/2.09 % --res_prop_simpl_new false
% 1.84/2.09 % --res_prop_simpl_given false
% 1.84/2.09 % --res_passive_queue_type priority_queues
% 1.84/2.09 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.84/2.09 % --res_passive_queues_freq [15;5]
% 1.84/2.09 % --res_forward_subs full
% 1.84/2.09 % --res_backward_subs full
% 1.84/2.09 % --res_forward_subs_resolution true
% 1.84/2.09 % --res_backward_subs_resolution true
% 1.84/2.09 % --res_orphan_elimination false
% 1.84/2.09 % --res_time_limit 1000.
% 1.84/2.09 % --res_out_proof true
% 1.84/2.09 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_83ca49.s
% 1.84/2.09 % --modulo true
% 1.84/2.09
% 1.84/2.09 % ------ Combination Options
% 1.84/2.09
% 1.84/2.09 % --comb_res_mult 1000
% 1.84/2.09 % --comb_inst_mult 300
% 1.84/2.09 % ------
% 1.84/2.09
% 1.84/2.09
% 1.84/2.09
% 1.84/2.09 % ------ Proving...
% 1.84/2.09 % warning: shown sat in sat incomplete mode
% 1.84/2.09 %
% 1.84/2.09
% 1.84/2.09
% 1.84/2.09 ------ Building Model...Done
% 1.84/2.09
% 1.84/2.09 %------ The model is defined over ground terms (initial term algebra).
% 1.84/2.09 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.84/2.09 %------ where \phi is a formula over the term algebra.
% 1.84/2.09 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.84/2.09 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.84/2.09 %------ See help for --sat_out_model for different model outputs.
% 1.84/2.09 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.84/2.09 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.84/2.09
% 1.84/2.09
% 1.84/2.09
% 1.84/2.09
% 1.84/2.09 %------ Negative definition of c1_1
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 (! [X0] :
% 1.84/2.09 ( ~(c1_1(X0)) <=>
% 1.84/2.09 (
% 1.84/2.09 (
% 1.84/2.09 ( X0=a60 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a98 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a117 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 )
% 1.84/2.09 )
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of c2_1
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 (! [X0] :
% 1.84/2.09 ( c2_1(X0) <=>
% 1.84/2.09 (
% 1.84/2.09 (
% 1.84/2.09 ( X0=a55 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a57 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a58 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a59 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a61 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a69 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a71 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a73 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a74 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a104 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a116 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a66 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a87 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 )
% 1.84/2.09 )
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of c3_1
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 (! [X0] :
% 1.84/2.09 ( c3_1(X0) <=>
% 1.84/2.09 (
% 1.84/2.09 (
% 1.84/2.09 ( X0=a55 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a57 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a58 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a59 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a61 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a69 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a71 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a73 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a74 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a79 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a82 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a83 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a104 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a116 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a66 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a87 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a96 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 )
% 1.84/2.09 )
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of ndr1_0
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( ndr1_0 <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Negative definition of c0_1
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 (! [X0] :
% 1.84/2.09 ( ~(c0_1(X0)) <=>
% 1.84/2.09 (
% 1.84/2.09 (
% 1.84/2.09 ( X0=a55 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a57 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a58 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a59 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a61 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a69 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a71 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a73 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a74 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a104 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a116 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a66 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 |
% 1.84/2.09 (
% 1.84/2.09 ( X0=a87 )
% 1.84/2.09 )
% 1.84/2.09
% 1.84/2.09 )
% 1.84/2.09 )
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp0
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp0 <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp15
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp15 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp10
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp10 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp11
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp11 <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp2
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp2 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp17
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp17 <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp20
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp20 <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp14
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp14 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp13
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp13 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp3
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp3 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp4
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp4 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp6
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp6 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp5
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp5 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp7
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp7 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp22
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp22 <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp27
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp27 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp28
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp28 <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp12
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp12 <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp16
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp16 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp26
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp26 <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp21
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp21 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp1
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp1 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp19
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp19 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp18
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp18 <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp9
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp9 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp8
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp8 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp23
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp23 <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp24
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp24 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp25
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp25 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of hskp29
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( hskp29 <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP0_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP0_iProver_split <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP1_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP1_iProver_split <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP2_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP2_iProver_split <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP3_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP3_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP4_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP4_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP5_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP5_iProver_split <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP6_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP6_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP7_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP7_iProver_split <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP8_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP8_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP9_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP9_iProver_split <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP10_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP10_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP13_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP13_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP14_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP14_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP15_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP15_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP16_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP16_iProver_split <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP17_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP17_iProver_split <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP19_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP19_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP20_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP20_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP22_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP22_iProver_split <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP23_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP23_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP24_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP24_iProver_split <=>
% 1.84/2.09 $true
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09 %------ Positive definition of sP25_iProver_split
% 1.84/2.09 fof(lit_def,axiom,
% 1.84/2.09 ( sP25_iProver_split <=>
% 1.84/2.09 $false
% 1.84/2.09 )
% 1.84/2.09 ).
% 1.84/2.09
% 1.84/2.09
% 1.84/2.09
% 1.84/2.09 % ------ Statistics
% 1.84/2.09
% 1.84/2.09 % ------ General
% 1.84/2.09
% 1.84/2.09 % num_of_input_clauses: 168
% 1.84/2.09 % num_of_input_neg_conjectures: 168
% 1.84/2.09 % num_of_splits: 148
% 1.84/2.09 % num_of_split_atoms: 29
% 1.84/2.09 % num_of_sem_filtered_clauses: 0
% 1.84/2.09 % num_of_subtypes: 0
% 1.84/2.09 % monotx_restored_types: 0
% 1.84/2.09 % sat_num_of_epr_types: 0
% 1.84/2.09 % sat_num_of_non_cyclic_types: 0
% 1.84/2.09 % sat_guarded_non_collapsed_types: 0
% 1.84/2.09 % is_epr: 1
% 1.84/2.09 % is_horn: 0
% 1.84/2.09 % has_eq: 0
% 1.84/2.09 % num_pure_diseq_elim: 0
% 1.84/2.09 % simp_replaced_by: 0
% 1.84/2.09 % res_preprocessed: 484
% 1.84/2.09 % prep_upred: 0
% 1.84/2.09 % prep_unflattend: 0
% 1.84/2.09 % pred_elim_cands: 29
% 1.84/2.09 % pred_elim: 7
% 1.84/2.09 % pred_elim_cl: 7
% 1.84/2.09 % pred_elim_cycles: 29
% 1.84/2.09 % forced_gc_time: 0
% 1.84/2.09 % gc_basic_clause_elim: 0
% 1.84/2.09 % parsing_time: 0.002
% 1.84/2.09 % sem_filter_time: 0.
% 1.84/2.09 % pred_elim_time: 0.015
% 1.84/2.09 % out_proof_time: 0.
% 1.84/2.09 % monotx_time: 0.
% 1.84/2.09 % subtype_inf_time: 0.
% 1.84/2.09 % unif_index_cands_time: 0.002
% 1.84/2.09 % unif_index_add_time: 0.002
% 1.84/2.09 % total_time: 0.745
% 1.84/2.09 % num_of_symbols: 119
% 1.84/2.09 % num_of_terms: 426
% 1.84/2.09
% 1.84/2.09 % ------ Propositional Solver
% 1.84/2.09
% 1.84/2.09 % prop_solver_calls: 11
% 1.84/2.09 % prop_fast_solver_calls: 2577
% 1.84/2.09 % prop_num_of_clauses: 795
% 1.84/2.09 % prop_preprocess_simplified: 3262
% 1.84/2.09 % prop_fo_subsumed: 143
% 1.84/2.09 % prop_solver_time: 0.
% 1.84/2.09 % prop_fast_solver_time: 0.001
% 1.84/2.09 % prop_unsat_core_time: 0.
% 1.84/2.09
% 1.84/2.09 % ------ QBF
% 1.84/2.09
% 1.84/2.09 % qbf_q_res: 0
% 1.84/2.09 % qbf_num_tautologies: 0
% 1.84/2.09 % qbf_prep_cycles: 0
% 1.84/2.09
% 1.84/2.09 % ------ BMC1
% 1.84/2.09
% 1.84/2.09 % bmc1_current_bound: -1
% 1.84/2.09 % bmc1_last_solved_bound: -1
% 1.84/2.09 % bmc1_unsat_core_size: -1
% 1.84/2.09 % bmc1_unsat_core_parents_size: -1
% 1.84/2.09 % bmc1_merge_next_fun: 0
% 1.84/2.09 % bmc1_unsat_core_clauses_time: 0.
% 1.84/2.09
% 1.84/2.09 % ------ Instantiation
% 1.84/2.09
% 1.84/2.09 % inst_num_of_clauses: 490
% 1.84/2.09 % inst_num_in_passive: 0
% 1.84/2.09 % inst_num_in_active: 490
% 1.84/2.09 % inst_num_in_unprocessed: 0
% 1.84/2.09 % inst_num_of_loops: 673
% 1.84/2.09 % inst_num_of_learning_restarts: 0
% 1.84/2.09 % inst_num_moves_active_passive: 173
% 1.84/2.09 % inst_lit_activity: 71
% 1.84/2.09 % inst_lit_activity_moves: 0
% 1.84/2.09 % inst_num_tautologies: 0
% 1.84/2.09 % inst_num_prop_implied: 0
% 1.84/2.09 % inst_num_existing_simplified: 0
% 1.84/2.09 % inst_num_eq_res_simplified: 0
% 1.84/2.09 % inst_num_child_elim: 0
% 1.84/2.09 % inst_num_of_dismatching_blockings: 0
% 1.84/2.09 % inst_num_of_non_proper_insts: 489
% 1.84/2.09 % inst_num_of_duplicates: 28
% 1.84/2.09 % inst_inst_num_from_inst_to_res: 0
% 1.84/2.09 % inst_dismatching_checking_time: 0.
% 1.84/2.09
% 1.84/2.09 % ------ Resolution
% 1.84/2.09
% 1.84/2.09 % res_num_of_clauses: 17830
% 1.84/2.09 % res_num_in_passive: 16388
% 1.84/2.09 % res_num_in_active: 2005
% 1.84/2.09 % res_num_of_loops: 3000
% 1.84/2.09 % res_forward_subset_subsumed: 3752
% 1.84/2.09 % res_backward_subset_subsumed: 660
% 1.84/2.09 % res_forward_subsumed: 749
% 1.84/2.09 % res_backward_subsumed: 120
% 1.84/2.09 % res_forward_subsumption_resolution: 606
% 1.84/2.09 % res_backward_subsumption_resolution: 64
% 1.84/2.09 % res_clause_to_clause_subsumption: 1539
% 1.84/2.09 % res_orphan_elimination: 0
% 1.84/2.09 % res_tautology_del: 4470
% 1.84/2.09 % res_num_eq_res_simplified: 0
% 1.84/2.09 % res_num_sel_changes: 0
% 1.84/2.09 % res_moves_from_active_to_pass: 0
% 1.84/2.09
% 1.84/2.09 % Status Unknown
% 1.84/2.09 % Last status :
% 1.84/2.09 % SZS status Unknown
%------------------------------------------------------------------------------