TSTP Solution File: SYN539+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN539+1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 07:29:44 EDT 2022
% Result : Unknown 4.17s 4.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN539+1 : TPTP v8.1.0. Released v2.1.0.
% 0.07/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 08:52:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.19/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.42 % FOF problem with conjecture
% 0.19/0.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d714cd.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6d604f.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_b6a78a | 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.45/0.66 % --bmc1_dump_unsat_core_tptp false
% 0.45/0.66 % --bmc1_dump_file -
% 0.45/0.66 % --bmc1_ucm_expand_uc_limit 128
% 0.45/0.66 % --bmc1_ucm_n_expand_iterations 6
% 0.45/0.66 % --bmc1_ucm_extend_mode 1
% 0.45/0.66 % --bmc1_ucm_init_mode 2
% 0.45/0.66 % --bmc1_ucm_cone_mode none
% 0.45/0.66 % --bmc1_ucm_reduced_relation_type 0
% 0.45/0.66 % --bmc1_ucm_relax_model 4
% 0.45/0.66 % --bmc1_ucm_full_tr_after_sat true
% 0.45/0.66 % --bmc1_ucm_expand_neg_assumptions false
% 0.45/0.66 % --bmc1_ucm_layered_model none
% 0.45/0.66 % --bmc1_ucm_max_lemma_size 10
% 0.45/0.66
% 0.45/0.66 % ------ AIG Options
% 0.45/0.66
% 0.45/0.66 % --aig_mode false
% 0.45/0.66
% 0.45/0.66 % ------ Instantiation Options
% 0.45/0.66
% 0.45/0.66 % --instantiation_flag true
% 0.45/0.66 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.45/0.66 % --inst_solver_per_active 750
% 0.45/0.66 % --inst_solver_calls_frac 0.5
% 0.45/0.66 % --inst_passive_queue_type priority_queues
% 0.45/0.66 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.45/0.66 % --inst_passive_queues_freq [25;2]
% 0.45/0.66 % --inst_dismatching true
% 0.45/0.66 % --inst_eager_unprocessed_to_passive true
% 0.45/0.66 % --inst_prop_sim_given true
% 0.45/0.66 % --inst_prop_sim_new false
% 0.45/0.66 % --inst_orphan_elimination true
% 0.45/0.66 % --inst_learning_loop_flag true
% 0.45/0.66 % --inst_learning_start 3000
% 0.45/0.66 % --inst_learning_factor 2
% 0.45/0.66 % --inst_start_prop_sim_after_learn 3
% 0.45/0.66 % --inst_sel_renew solver
% 0.45/0.66 % --inst_lit_activity_flag true
% 0.45/0.66 % --inst_out_proof true
% 0.45/0.66
% 0.45/0.66 % ------ Resolution Options
% 0.45/0.66
% 0.45/0.66 % --resolution_flag true
% 0.45/0.66 % --res_lit_sel kbo_max
% 0.45/0.66 % --res_to_prop_solver none
% 0.45/0.66 % --res_prop_simpl_new false
% 0.45/0.66 % --res_prop_simpl_given false
% 0.45/0.66 % --res_passive_queue_type priority_queues
% 0.45/0.66 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.45/0.66 % --res_passive_queues_freq [15;5]
% 0.45/0.66 % --res_forward_subs full
% 0.45/0.66 % --res_backward_subs full
% 0.45/0.66 % --res_forward_subs_resolution true
% 0.45/0.66 % --res_backward_subs_resolution true
% 0.45/0.66 % --res_orphan_elimination false
% 0.45/0.66 % --res_time_limit 1000.
% 0.45/0.66 % --res_out_proof true
% 0.45/0.66 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d714cd.s
% 0.45/0.66 % --modulo true
% 0.45/0.66
% 0.45/0.66 % ------ Combination Options
% 0.45/0.66
% 0.45/0.66 % --comb_res_mult 1000
% 0.45/0.66 % --comb_inst_mult 300
% 0.45/0.66 % ------
% 0.45/0.66
% 0.45/0.66 % ------ Parsing...% successful
% 0.45/0.66
% 0.45/0.66 % ------ Preprocessing... gs_s sp: 798 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe:64:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.45/0.66
% 0.45/0.66 % ------ Proving...
% 0.45/0.66 % ------ Problem Properties
% 0.45/0.66
% 0.45/0.66 %
% 0.45/0.66 % EPR true
% 0.45/0.66 % Horn false
% 0.45/0.66 % Has equality false
% 0.45/0.66
% 0.45/0.66 % % ------ Input Options Time Limit: Unbounded
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 % % ------ Current options:
% 0.45/0.66
% 0.45/0.66 % ------ Input Options
% 0.45/0.66
% 0.45/0.66 % --out_options all
% 0.45/0.66 % --tptp_safe_out true
% 0.45/0.66 % --problem_path ""
% 0.45/0.66 % --include_path ""
% 0.45/0.66 % --clausifier .//eprover
% 0.45/0.66 % --clausifier_options --tstp-format
% 0.45/0.66 % --stdin false
% 0.45/0.66 % --dbg_backtrace false
% 0.45/0.66 % --dbg_dump_prop_clauses false
% 0.45/0.66 % --dbg_dump_prop_clauses_file -
% 0.45/0.66 % --dbg_out_stat false
% 0.45/0.66
% 0.45/0.66 % ------ General Options
% 0.45/0.66
% 0.45/0.66 % --fof false
% 0.45/0.66 % --time_out_real 150.
% 0.45/0.66 % --time_out_prep_mult 0.2
% 0.45/0.66 % --time_out_virtual -1.
% 0.45/0.66 % --schedule none
% 0.45/0.66 % --ground_splitting input
% 0.45/0.66 % --splitting_nvd 16
% 0.45/0.66 % --non_eq_to_eq false
% 0.45/0.66 % --prep_gs_sim true
% 0.45/0.66 % --prep_unflatten false
% 0.45/0.66 % --prep_res_sim true
% 0.45/0.66 % --prep_upred true
% 0.45/0.66 % --res_sim_input true
% 0.45/0.66 % --clause_weak_htbl true
% 0.45/0.66 % --gc_record_bc_elim false
% 0.45/0.66 % --symbol_type_check false
% 0.45/0.66 % --clausify_out false
% 0.45/0.66 % --large_theory_mode false
% 0.45/0.66 % --prep_sem_filter none
% 0.45/0.66 % --prep_sem_filter_out false
% 0.45/0.66 % --preprocessed_out false
% 0.45/0.66 % --sub_typing false
% 0.45/0.66 % --brand_transform false
% 0.45/0.66 % --pure_diseq_elim true
% 0.45/0.66 % --min_unsat_core false
% 0.45/0.66 % --pred_elim true
% 0.45/0.66 % --add_important_lit false
% 0.45/0.66 % --soft_assumptions false
% 0.45/0.66 % --reset_solvers false
% 0.45/0.66 % --bc_imp_inh []
% 0.45/0.66 % --conj_cone_tolerance 1.5
% 0.45/0.66 % --prolific_symb_bound 500
% 0.45/0.66 % --lt_threshold 2000
% 0.45/0.66
% 0.45/0.66 % ------ SAT Options
% 0.45/0.66
% 0.45/0.66 % --sat_mode false
% 0.45/0.66 % --sat_fm_restart_options ""
% 0.45/0.66 % --sat_gr_def false
% 0.45/0.66 % --sat_epr_types true
% 0.45/0.66 % --sat_non_cyclic_types false
% 0.45/0.66 % --sat_finite_models false
% 0.45/0.66 % --sat_fm_lemmas false
% 0.45/0.66 % --sat_fm_prep false
% 0.45/0.66 % --sat_fm_uc_incr true
% 0.45/0.66 % --sat_out_model small
% 0.45/0.66 % --sat_out_clauses false
% 0.45/0.66
% 0.45/0.66 % ------ QBF Options
% 0.45/0.66
% 0.45/0.66 % --qbf_mode false
% 0.45/0.66 % --qbf_elim_univ true
% 0.45/0.66 % --qbf_sk_in true
% 0.45/0.66 % --qbf_pred_elim true
% 0.45/0.66 % --qbf_split 32
% 0.45/0.66
% 0.45/0.66 % ------ BMC1 Options
% 0.45/0.66
% 0.45/0.66 % --bmc1_incremental false
% 0.45/0.66 % --bmc1_axioms reachable_all
% 0.45/0.66 % --bmc1_min_bound 0
% 0.45/0.66 % --bmc1_max_bound -1
% 0.45/0.66 % --bmc1_max_bound_default -1
% 0.45/0.66 % --bmc1_symbol_reachability true
% 0.45/0.66 % --bmc1_property_lemmas false
% 0.45/0.66 % --bmc1_k_induction false
% 0.45/0.66 % --bmc1_non_equiv_states false
% 0.45/0.66 % --bmc1_deadlock false
% 0.45/0.66 % --bmc1_ucm false
% 0.45/0.66 % --bmc1_add_unsat_core none
% 0.45/0.66 % --bmc1_unsat_core_children false
% 0.45/0.66 % --bmc1_unsat_core_extrapolate_axioms false
% 0.45/0.66 % --bmc1_out_stat full
% 0.45/0.66 % --bmc1_ground_init false
% 0.45/0.66 % --bmc1_pre_inst_next_state false
% 0.45/0.66 % --bmc1_pre_inst_state false
% 0.45/0.66 % --bmc1_pre_inst_reach_state false
% 0.45/0.66 % --bmc1_out_unsat_core false
% 0.45/0.66 % --bmc1_aig_witness_out false
% 0.45/0.66 % --bmc1_verbose false
% 0.45/0.66 % --bmc1_dump_clauses_tptp false
% 0.45/0.66 % --bmc1_dump_unsat_core_tptp false
% 0.45/0.66 % --bmc1_dump_file -
% 0.45/0.66 % --bmc1_ucm_expand_uc_limit 128
% 0.45/0.66 % --bmc1_ucm_n_expand_iterations 6
% 0.45/0.66 % --bmc1_ucm_extend_mode 1
% 0.45/0.66 % --bmc1_ucm_init_mode 2
% 0.45/0.66 % --bmc1_ucm_cone_mode none
% 0.45/0.66 % --bmc1_ucm_reduced_relation_type 0
% 0.45/0.66 % --bmc1_ucm_relax_model 4
% 0.45/0.66 % --bmc1_ucm_full_tr_after_sat true
% 0.45/0.66 % --bmc1_ucm_expand_neg_assumptions false
% 0.45/0.66 % --bmc1_ucm_layered_model none
% 0.45/0.66 % --bmc1_ucm_max_lemma_size 10
% 0.45/0.66
% 0.45/0.66 % ------ AIG Options
% 0.45/0.66
% 0.45/0.66 % --aig_mode false
% 0.45/0.66
% 0.45/0.66 % ------ Instantiation Options
% 0.45/0.66
% 0.45/0.66 % --instantiation_flag true
% 0.45/0.66 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.45/0.66 % --inst_solver_per_active 750
% 0.45/0.66 % --inst_solver_calls_frac 0.5
% 0.45/0.66 % --inst_passive_queue_type priority_queues
% 0.45/0.66 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.45/0.66 % --inst_passive_queues_freq [25;2]
% 0.45/0.66 % --inst_dismatching true
% 0.45/0.66 % --inst_eager_unprocessed_to_passive true
% 2.17/2.40 % --inst_prop_sim_given true
% 2.17/2.40 % --inst_prop_sim_new false
% 2.17/2.40 % --inst_orphan_elimination true
% 2.17/2.40 % --inst_learning_loop_flag true
% 2.17/2.40 % --inst_learning_start 3000
% 2.17/2.40 % --inst_learning_factor 2
% 2.17/2.40 % --inst_start_prop_sim_after_learn 3
% 2.17/2.40 % --inst_sel_renew solver
% 2.17/2.40 % --inst_lit_activity_flag true
% 2.17/2.40 % --inst_out_proof true
% 2.17/2.40
% 2.17/2.40 % ------ Resolution Options
% 2.17/2.40
% 2.17/2.40 % --resolution_flag true
% 2.17/2.40 % --res_lit_sel kbo_max
% 2.17/2.40 % --res_to_prop_solver none
% 2.17/2.40 % --res_prop_simpl_new false
% 2.17/2.40 % --res_prop_simpl_given false
% 2.17/2.40 % --res_passive_queue_type priority_queues
% 2.17/2.40 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.17/2.40 % --res_passive_queues_freq [15;5]
% 2.17/2.40 % --res_forward_subs full
% 2.17/2.40 % --res_backward_subs full
% 2.17/2.40 % --res_forward_subs_resolution true
% 2.17/2.40 % --res_backward_subs_resolution true
% 2.17/2.40 % --res_orphan_elimination false
% 2.17/2.40 % --res_time_limit 1000.
% 2.17/2.40 % --res_out_proof true
% 2.17/2.40 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d714cd.s
% 2.17/2.40 % --modulo true
% 2.17/2.40
% 2.17/2.40 % ------ Combination Options
% 2.17/2.40
% 2.17/2.40 % --comb_res_mult 1000
% 2.17/2.40 % --comb_inst_mult 300
% 2.17/2.40 % ------
% 2.17/2.40
% 2.17/2.40
% 2.17/2.40
% 2.17/2.40 % ------ Proving...
% 2.17/2.40 % warning: shown sat in sat incomplete mode
% 2.17/2.40 %
% 2.17/2.40
% 2.17/2.40
% 2.17/2.40 ------ Building Model...Done
% 2.17/2.40
% 2.17/2.40 %------ The model is defined over ground terms (initial term algebra).
% 2.17/2.40 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.17/2.40 %------ where \phi is a formula over the term algebra.
% 2.17/2.40 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.17/2.40 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.17/2.40 %------ See help for --sat_out_model for different model outputs.
% 2.17/2.40 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.17/2.40 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.17/2.40
% 2.17/2.40
% 2.17/2.40
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c5_2
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 (! [X0,X1] :
% 2.17/2.40 ( c5_2(X0,X1) <=>
% 2.17/2.40 (
% 2.17/2.40 (
% 2.17/2.40 ( X0=a588 & X1=a591 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c2_2
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 (! [X0,X1] :
% 2.17/2.40 ( c2_2(X0,X1) <=>
% 2.17/2.40 (
% 2.17/2.40 (
% 2.17/2.40 ( X0=a588 & X1=a589 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X0=a588 & X1=a590 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c3_2
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 (! [X0,X1] :
% 2.17/2.40 ( c3_2(X0,X1) <=>
% 2.17/2.40 (
% 2.17/2.40 (
% 2.17/2.40 ( X0=a588 & X1=a589 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c2_0
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( c2_0 <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Negative definition of ndr1_1
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 (! [X0] :
% 2.17/2.40 ( ~(ndr1_1(X0)) <=>
% 2.17/2.40 (
% 2.17/2.40 (
% 2.17/2.40 ( X0=a633 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X0=a593 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X0=a594 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X0=a605 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X0=a616 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X0=a587 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of ndr1_0
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( ndr1_0 <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c3_1
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 (! [X0] :
% 2.17/2.40 ( c3_1(X0) <=>
% 2.17/2.40 (
% 2.17/2.40 (
% 2.17/2.40 ( X0=a587 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Negative definition of c1_2
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 (! [X0,X1] :
% 2.17/2.40 ( ~(c1_2(X0,X1)) <=>
% 2.17/2.40 (
% 2.17/2.40 (
% 2.17/2.40 ( X0=a588 & X1=a591 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X1=a617 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c4_2
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 (! [X0,X1] :
% 2.17/2.40 ( c4_2(X0,X1) <=>
% 2.17/2.40 (
% 2.17/2.40 (
% 2.17/2.40 ( X1=a621 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c5_1
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 (! [X0] :
% 2.17/2.40 ( c5_1(X0) <=>
% 2.17/2.40 (
% 2.17/2.40 (
% 2.17/2.40 ( X0=a587 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c1_1
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 (! [X0] :
% 2.17/2.40 ( c1_1(X0) <=>
% 2.17/2.40 (
% 2.17/2.40 (
% 2.17/2.40 ( X0=a594 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X0=a616 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Negative definition of c2_1
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 (! [X0] :
% 2.17/2.40 ( ~(c2_1(X0)) <=>
% 2.17/2.40 (
% 2.17/2.40 (
% 2.17/2.40 ( X0=a633 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X0=a593 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X0=a605 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X0=a637 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 |
% 2.17/2.40 (
% 2.17/2.40 ( X0=a616 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c3_0
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( c3_0 <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c5_0
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( c5_0 <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c4_1
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 (! [X0] :
% 2.17/2.40 ( c4_1(X0) <=>
% 2.17/2.40 (
% 2.17/2.40 (
% 2.17/2.40 ( X0=a594 )
% 2.17/2.40 )
% 2.17/2.40
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c4_0
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( c4_0 <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of c1_0
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( c1_0 <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of epred1_0
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( epred1_0 <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP0_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP0_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP4_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP4_iProver_split <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP5_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP5_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP14_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP14_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP25_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP25_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP26_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP26_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP27_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP27_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP28_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP28_iProver_split <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP29_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP29_iProver_split <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP30_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP30_iProver_split <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP31_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP31_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP35_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP35_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP36_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP36_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP37_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP37_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP38_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP38_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP39_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP39_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP41_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP41_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP45_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP45_iProver_split <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP46_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP46_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP47_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP47_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP48_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP48_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP49_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP49_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP50_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP50_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP53_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP53_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP54_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP54_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP55_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP55_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP56_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP56_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP57_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP57_iProver_split <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP66_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP66_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP67_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP67_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP72_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP72_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP75_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP75_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP76_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP76_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP77_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP77_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP79_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP79_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP80_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP80_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP85_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP85_iProver_split <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP87_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP87_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP89_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP89_iProver_split <=>
% 2.17/2.40 $true
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP90_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP90_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP91_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP91_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40 %------ Positive definition of sP95_iProver_split
% 2.17/2.40 fof(lit_def,axiom,
% 2.17/2.40 ( sP95_iProver_split <=>
% 2.17/2.40 $false
% 2.17/2.40 )
% 2.17/2.40 ).
% 2.17/2.40
% 2.17/2.40
% 2.17/2.40
% 2.17/2.40 % ------ Statistics
% 2.17/2.40
% 2.17/2.40 % ------ General
% 2.17/2.40
% 2.17/2.40 % num_of_input_clauses: 363
% 2.17/2.40 % num_of_input_neg_conjectures: 315
% 2.17/2.40 % num_of_splits: 798
% 2.17/2.40 % num_of_split_atoms: 144
% 2.17/2.40 % num_of_sem_filtered_clauses: 0
% 2.17/2.40 % num_of_subtypes: 0
% 2.17/2.40 % monotx_restored_types: 0
% 2.17/2.40 % sat_num_of_epr_types: 0
% 2.17/2.40 % sat_num_of_non_cyclic_types: 0
% 2.17/2.40 % sat_guarded_non_collapsed_types: 0
% 2.17/2.40 % is_epr: 1
% 2.17/2.40 % is_horn: 0
% 2.17/2.40 % has_eq: 0
% 2.17/2.40 % num_pure_diseq_elim: 0
% 2.17/2.40 % simp_replaced_by: 0
% 2.17/2.40 % res_preprocessed: 1382
% 2.17/2.40 % prep_upred: 0
% 2.17/2.40 % prep_unflattend: 0
% 2.17/2.40 % pred_elim_cands: 143
% 2.17/2.40 % pred_elim: 101
% 2.17/2.40 % pred_elim_cl: 168
% 2.17/2.40 % pred_elim_cycles: 159
% 2.17/2.40 % forced_gc_time: 0
% 2.17/2.40 % gc_basic_clause_elim: 0
% 2.17/2.40 % parsing_time: 0.017
% 2.17/2.40 % sem_filter_time: 0.
% 2.17/2.40 % pred_elim_time: 0.111
% 2.17/2.40 % out_proof_time: 0.
% 2.17/2.40 % monotx_time: 0.
% 2.17/2.40 % subtype_inf_time: 0.
% 2.17/2.40 % unif_index_cands_time: 0.003
% 2.17/2.40 % unif_index_add_time: 0.002
% 2.17/2.40 % total_time: 1.977
% 2.17/2.40 % num_of_symbols: 240
% 2.17/2.40 % num_of_terms: 2332
% 2.17/2.40
% 2.17/2.40 % ------ Propositional Solver
% 2.17/2.40
% 2.17/2.40 % prop_solver_calls: 5
% 2.17/2.40 % prop_fast_solver_calls: 10832
% 2.17/2.40 % prop_num_of_clauses: 1799
% 2.17/2.40 % prop_preprocess_simplified: 10067
% 2.17/2.40 % prop_fo_subsumed: 790
% 2.17/2.40 % prop_solver_time: 0.
% 2.17/2.40 % prop_fast_solver_time: 0.012
% 2.17/2.40 % prop_unsat_core_time: 0.
% 2.17/2.40
% 2.17/2.40 % ------ QBF
% 2.17/2.40
% 2.17/2.40 % qbf_q_res: 0
% 2.17/2.40 % qbf_num_tautologies: 0
% 2.17/2.40 % qbf_prep_cycles: 0
% 2.17/2.40
% 2.17/2.40 % ------ BMC1
% 2.17/2.40
% 2.17/2.40 % bmc1_current_bound: -1
% 2.17/2.40 % bmc1_last_solved_bound: -1
% 2.17/2.40 % bmc1_unsat_core_size: -1
% 2.17/2.40 % bmc1_unsat_core_parents_size: -1
% 2.17/2.40 % bmc1_merge_next_fun: 0
% 2.17/2.40 % bmc1_unsat_core_clauses_time: 0.
% 2.17/2.40
% 2.17/2.40 % ------ Instantiation
% 2.17/2.40
% 2.17/2.40 % inst_num_of_clauses: 356
% 2.17/2.40 % inst_num_in_passive: 0
% 2.17/2.40 % inst_num_in_active: 356
% 2.17/2.40 % inst_num_in_unprocessed: 0
% 2.17/2.40 % inst_num_of_loops: 402
% 2.17/2.40 % inst_num_of_learning_restarts: 0
% 2.17/2.40 % inst_num_moves_active_passive: 39
% 2.17/2.40 % inst_lit_activity: 26
% 2.17/2.40 % inst_lit_activity_moves: 0
% 2.17/2.40 % inst_num_tautologies: 0
% 2.17/2.40 % inst_num_prop_implied: 0
% 2.17/2.40 % inst_num_existing_simplified: 0
% 2.17/2.40 % inst_num_eq_res_simplified: 0
% 2.17/2.40 % inst_num_child_elim: 0
% 2.17/2.40 % inst_num_of_dismatching_blockings: 0
% 2.17/2.40 % inst_num_of_non_proper_insts: 88
% 2.17/2.40 % inst_num_of_duplicates: 4
% 2.17/2.40 % inst_inst_num_from_inst_to_res: 0
% 2.17/2.40 % inst_dismatching_checking_time: 0.
% 2.17/2.40
% 2.17/2.40 % ------ Resolution
% 2.17/2.40
% 2.17/2.40 % res_num_of_clauses: 9156
% 2.17/2.40 % res_num_in_passive: 7724
% 2.17/2.40 % res_num_in_active: 1414
% 2.17/2.40 % res_num_of_loops: 2000
% 2.17/2.40 % res_forward_subset_subsumed: 1452
% 2.17/2.40 % res_backward_subset_subsumed: 5
% 2.17/2.40 % res_forward_subsumed: 499
% 2.17/2.40 % res_backward_subsumed: 82
% 2.17/2.40 % res_forward_subsumption_resolution: 701
% 2.17/2.40 % res_backward_subsumption_resolution: 4
% 2.17/2.40 % res_clause_to_clause_subsumption: 5563
% 2.17/2.40 % res_orphan_elimination: 0
% 2.17/2.40 % res_tautology_del: 6717
% 2.17/2.40 % res_num_eq_res_simplified: 0
% 2.17/2.40 % res_num_sel_changes: 0
% 2.17/2.40 % res_moves_from_active_to_pass: 0
% 2.17/2.40
% 2.17/2.40 % Status Unknown
% 2.25/2.47 % Orienting using strategy ClausalAll
% 2.25/2.47 % FOF problem with conjecture
% 2.25/2.47 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d714cd.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6d604f.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_6dbde6 | grep -v "SZS"
% 2.25/2.48
% 2.25/2.48 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 2.25/2.48
% 2.25/2.48 %
% 2.25/2.48 % ------ iProver source info
% 2.25/2.48
% 2.25/2.48 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 2.25/2.48 % git: non_committed_changes: true
% 2.25/2.48 % git: last_make_outside_of_git: true
% 2.25/2.48
% 2.25/2.48 %
% 2.25/2.48 % ------ Input Options
% 2.25/2.48
% 2.25/2.48 % --out_options all
% 2.25/2.48 % --tptp_safe_out true
% 2.25/2.48 % --problem_path ""
% 2.25/2.48 % --include_path ""
% 2.25/2.48 % --clausifier .//eprover
% 2.25/2.48 % --clausifier_options --tstp-format
% 2.25/2.48 % --stdin false
% 2.25/2.48 % --dbg_backtrace false
% 2.25/2.48 % --dbg_dump_prop_clauses false
% 2.25/2.48 % --dbg_dump_prop_clauses_file -
% 2.25/2.48 % --dbg_out_stat false
% 2.25/2.48
% 2.25/2.48 % ------ General Options
% 2.25/2.48
% 2.25/2.48 % --fof false
% 2.25/2.48 % --time_out_real 150.
% 2.25/2.48 % --time_out_prep_mult 0.2
% 2.25/2.48 % --time_out_virtual -1.
% 2.25/2.48 % --schedule none
% 2.25/2.48 % --ground_splitting input
% 2.25/2.48 % --splitting_nvd 16
% 2.25/2.48 % --non_eq_to_eq false
% 2.25/2.48 % --prep_gs_sim true
% 2.25/2.48 % --prep_unflatten false
% 2.25/2.48 % --prep_res_sim true
% 2.25/2.48 % --prep_upred true
% 2.25/2.48 % --res_sim_input true
% 2.25/2.48 % --clause_weak_htbl true
% 2.25/2.48 % --gc_record_bc_elim false
% 2.25/2.48 % --symbol_type_check false
% 2.25/2.48 % --clausify_out false
% 2.25/2.48 % --large_theory_mode false
% 2.25/2.48 % --prep_sem_filter none
% 2.25/2.48 % --prep_sem_filter_out false
% 2.25/2.48 % --preprocessed_out false
% 2.25/2.48 % --sub_typing false
% 2.25/2.48 % --brand_transform false
% 2.25/2.48 % --pure_diseq_elim true
% 2.25/2.48 % --min_unsat_core false
% 2.25/2.48 % --pred_elim true
% 2.25/2.48 % --add_important_lit false
% 2.25/2.48 % --soft_assumptions false
% 2.25/2.48 % --reset_solvers false
% 2.25/2.48 % --bc_imp_inh []
% 2.25/2.48 % --conj_cone_tolerance 1.5
% 2.25/2.48 % --prolific_symb_bound 500
% 2.25/2.48 % --lt_threshold 2000
% 2.25/2.48
% 2.25/2.48 % ------ SAT Options
% 2.25/2.48
% 2.25/2.48 % --sat_mode false
% 2.25/2.48 % --sat_fm_restart_options ""
% 2.25/2.48 % --sat_gr_def false
% 2.25/2.48 % --sat_epr_types true
% 2.25/2.48 % --sat_non_cyclic_types false
% 2.25/2.48 % --sat_finite_models false
% 2.25/2.48 % --sat_fm_lemmas false
% 2.25/2.48 % --sat_fm_prep false
% 2.25/2.48 % --sat_fm_uc_incr true
% 2.25/2.48 % --sat_out_model small
% 2.25/2.48 % --sat_out_clauses false
% 2.25/2.48
% 2.25/2.48 % ------ QBF Options
% 2.25/2.48
% 2.25/2.48 % --qbf_mode false
% 2.25/2.48 % --qbf_elim_univ true
% 2.25/2.48 % --qbf_sk_in true
% 2.25/2.48 % --qbf_pred_elim true
% 2.25/2.48 % --qbf_split 32
% 2.25/2.48
% 2.25/2.48 % ------ BMC1 Options
% 2.25/2.48
% 2.25/2.48 % --bmc1_incremental false
% 2.25/2.48 % --bmc1_axioms reachable_all
% 2.25/2.48 % --bmc1_min_bound 0
% 2.25/2.48 % --bmc1_max_bound -1
% 2.25/2.48 % --bmc1_max_bound_default -1
% 2.25/2.48 % --bmc1_symbol_reachability true
% 2.25/2.48 % --bmc1_property_lemmas false
% 2.25/2.48 % --bmc1_k_induction false
% 2.25/2.48 % --bmc1_non_equiv_states false
% 2.25/2.48 % --bmc1_deadlock false
% 2.25/2.48 % --bmc1_ucm false
% 2.25/2.48 % --bmc1_add_unsat_core none
% 2.25/2.48 % --bmc1_unsat_core_children false
% 2.25/2.48 % --bmc1_unsat_core_extrapolate_axioms false
% 2.25/2.48 % --bmc1_out_stat full
% 2.25/2.48 % --bmc1_ground_init false
% 2.25/2.48 % --bmc1_pre_inst_next_state false
% 2.25/2.48 % --bmc1_pre_inst_state false
% 2.25/2.48 % --bmc1_pre_inst_reach_state false
% 2.25/2.48 % --bmc1_out_unsat_core false
% 2.25/2.48 % --bmc1_aig_witness_out false
% 2.25/2.48 % --bmc1_verbose false
% 2.25/2.48 % --bmc1_dump_clauses_tptp false
% 2.32/2.61 % --bmc1_dump_unsat_core_tptp false
% 2.32/2.61 % --bmc1_dump_file -
% 2.32/2.61 % --bmc1_ucm_expand_uc_limit 128
% 2.32/2.61 % --bmc1_ucm_n_expand_iterations 6
% 2.32/2.61 % --bmc1_ucm_extend_mode 1
% 2.32/2.61 % --bmc1_ucm_init_mode 2
% 2.32/2.61 % --bmc1_ucm_cone_mode none
% 2.32/2.61 % --bmc1_ucm_reduced_relation_type 0
% 2.32/2.61 % --bmc1_ucm_relax_model 4
% 2.32/2.61 % --bmc1_ucm_full_tr_after_sat true
% 2.32/2.61 % --bmc1_ucm_expand_neg_assumptions false
% 2.32/2.61 % --bmc1_ucm_layered_model none
% 2.32/2.61 % --bmc1_ucm_max_lemma_size 10
% 2.32/2.61
% 2.32/2.61 % ------ AIG Options
% 2.32/2.61
% 2.32/2.61 % --aig_mode false
% 2.32/2.61
% 2.32/2.61 % ------ Instantiation Options
% 2.32/2.61
% 2.32/2.61 % --instantiation_flag true
% 2.32/2.61 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.32/2.61 % --inst_solver_per_active 750
% 2.32/2.61 % --inst_solver_calls_frac 0.5
% 2.32/2.61 % --inst_passive_queue_type priority_queues
% 2.32/2.61 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.32/2.61 % --inst_passive_queues_freq [25;2]
% 2.32/2.61 % --inst_dismatching true
% 2.32/2.61 % --inst_eager_unprocessed_to_passive true
% 2.32/2.61 % --inst_prop_sim_given true
% 2.32/2.61 % --inst_prop_sim_new false
% 2.32/2.61 % --inst_orphan_elimination true
% 2.32/2.61 % --inst_learning_loop_flag true
% 2.32/2.61 % --inst_learning_start 3000
% 2.32/2.61 % --inst_learning_factor 2
% 2.32/2.61 % --inst_start_prop_sim_after_learn 3
% 2.32/2.61 % --inst_sel_renew solver
% 2.32/2.61 % --inst_lit_activity_flag true
% 2.32/2.61 % --inst_out_proof true
% 2.32/2.61
% 2.32/2.61 % ------ Resolution Options
% 2.32/2.61
% 2.32/2.61 % --resolution_flag true
% 2.32/2.61 % --res_lit_sel kbo_max
% 2.32/2.61 % --res_to_prop_solver none
% 2.32/2.61 % --res_prop_simpl_new false
% 2.32/2.61 % --res_prop_simpl_given false
% 2.32/2.61 % --res_passive_queue_type priority_queues
% 2.32/2.61 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.32/2.61 % --res_passive_queues_freq [15;5]
% 2.32/2.61 % --res_forward_subs full
% 2.32/2.61 % --res_backward_subs full
% 2.32/2.61 % --res_forward_subs_resolution true
% 2.32/2.61 % --res_backward_subs_resolution true
% 2.32/2.61 % --res_orphan_elimination false
% 2.32/2.61 % --res_time_limit 1000.
% 2.32/2.61 % --res_out_proof true
% 2.32/2.61 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d714cd.s
% 2.32/2.61 % --modulo true
% 2.32/2.61
% 2.32/2.61 % ------ Combination Options
% 2.32/2.61
% 2.32/2.61 % --comb_res_mult 1000
% 2.32/2.61 % --comb_inst_mult 300
% 2.32/2.61 % ------
% 2.32/2.61
% 2.32/2.61 % ------ Parsing...% successful
% 2.32/2.61
% 2.32/2.61 % ------ Preprocessing... gs_s sp: 798 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe:64:0s pe_e snvd_s sp: 0 0s snvd_e %
% 2.32/2.61
% 2.32/2.61 % ------ Proving...
% 2.32/2.61 % ------ Problem Properties
% 2.32/2.61
% 2.32/2.61 %
% 2.32/2.61 % EPR true
% 2.32/2.61 % Horn false
% 2.32/2.61 % Has equality false
% 2.32/2.61
% 2.32/2.61 % % ------ Input Options Time Limit: Unbounded
% 2.32/2.61
% 2.32/2.61
% 2.32/2.61 % % ------ Current options:
% 2.32/2.61
% 2.32/2.61 % ------ Input Options
% 2.32/2.61
% 2.32/2.61 % --out_options all
% 2.32/2.61 % --tptp_safe_out true
% 2.32/2.61 % --problem_path ""
% 2.32/2.61 % --include_path ""
% 2.32/2.61 % --clausifier .//eprover
% 2.32/2.61 % --clausifier_options --tstp-format
% 2.32/2.61 % --stdin false
% 2.32/2.61 % --dbg_backtrace false
% 2.32/2.61 % --dbg_dump_prop_clauses false
% 2.32/2.61 % --dbg_dump_prop_clauses_file -
% 2.32/2.61 % --dbg_out_stat false
% 2.32/2.61
% 2.32/2.61 % ------ General Options
% 2.32/2.61
% 2.32/2.61 % --fof false
% 2.32/2.61 % --time_out_real 150.
% 2.32/2.61 % --time_out_prep_mult 0.2
% 2.32/2.61 % --time_out_virtual -1.
% 2.32/2.61 % --schedule none
% 2.32/2.61 % --ground_splitting input
% 2.32/2.61 % --splitting_nvd 16
% 2.32/2.61 % --non_eq_to_eq false
% 2.32/2.61 % --prep_gs_sim true
% 2.32/2.61 % --prep_unflatten false
% 2.32/2.61 % --prep_res_sim true
% 2.32/2.61 % --prep_upred true
% 2.32/2.61 % --res_sim_input true
% 2.32/2.61 % --clause_weak_htbl true
% 2.32/2.61 % --gc_record_bc_elim false
% 2.32/2.61 % --symbol_type_check false
% 2.32/2.61 % --clausify_out false
% 2.32/2.61 % --large_theory_mode false
% 2.32/2.61 % --prep_sem_filter none
% 2.32/2.61 % --prep_sem_filter_out false
% 2.32/2.61 % --preprocessed_out false
% 2.32/2.61 % --sub_typing false
% 2.32/2.61 % --brand_transform false
% 2.32/2.61 % --pure_diseq_elim true
% 2.32/2.61 % --min_unsat_core false
% 2.32/2.61 % --pred_elim true
% 2.32/2.61 % --add_important_lit false
% 2.32/2.61 % --soft_assumptions false
% 2.32/2.61 % --reset_solvers false
% 2.32/2.61 % --bc_imp_inh []
% 2.32/2.61 % --conj_cone_tolerance 1.5
% 2.32/2.61 % --prolific_symb_bound 500
% 2.32/2.61 % --lt_threshold 2000
% 2.32/2.61
% 2.32/2.61 % ------ SAT Options
% 2.32/2.61
% 2.32/2.61 % --sat_mode false
% 2.32/2.61 % --sat_fm_restart_options ""
% 2.32/2.61 % --sat_gr_def false
% 2.32/2.61 % --sat_epr_types true
% 2.32/2.61 % --sat_non_cyclic_types false
% 2.32/2.61 % --sat_finite_models false
% 2.32/2.61 % --sat_fm_lemmas false
% 2.32/2.61 % --sat_fm_prep false
% 2.32/2.61 % --sat_fm_uc_incr true
% 2.32/2.61 % --sat_out_model small
% 2.32/2.61 % --sat_out_clauses false
% 2.32/2.61
% 2.32/2.61 % ------ QBF Options
% 2.32/2.61
% 2.32/2.61 % --qbf_mode false
% 2.32/2.61 % --qbf_elim_univ true
% 2.32/2.61 % --qbf_sk_in true
% 2.32/2.61 % --qbf_pred_elim true
% 2.32/2.61 % --qbf_split 32
% 2.32/2.61
% 2.32/2.61 % ------ BMC1 Options
% 2.32/2.61
% 2.32/2.61 % --bmc1_incremental false
% 2.32/2.61 % --bmc1_axioms reachable_all
% 2.32/2.61 % --bmc1_min_bound 0
% 2.32/2.61 % --bmc1_max_bound -1
% 2.32/2.61 % --bmc1_max_bound_default -1
% 2.32/2.61 % --bmc1_symbol_reachability true
% 2.32/2.61 % --bmc1_property_lemmas false
% 2.32/2.61 % --bmc1_k_induction false
% 2.32/2.61 % --bmc1_non_equiv_states false
% 2.32/2.61 % --bmc1_deadlock false
% 2.32/2.61 % --bmc1_ucm false
% 2.32/2.61 % --bmc1_add_unsat_core none
% 2.32/2.61 % --bmc1_unsat_core_children false
% 2.32/2.61 % --bmc1_unsat_core_extrapolate_axioms false
% 2.32/2.61 % --bmc1_out_stat full
% 2.32/2.61 % --bmc1_ground_init false
% 2.32/2.61 % --bmc1_pre_inst_next_state false
% 2.32/2.61 % --bmc1_pre_inst_state false
% 2.32/2.61 % --bmc1_pre_inst_reach_state false
% 2.32/2.61 % --bmc1_out_unsat_core false
% 2.32/2.61 % --bmc1_aig_witness_out false
% 2.32/2.61 % --bmc1_verbose false
% 2.32/2.61 % --bmc1_dump_clauses_tptp false
% 2.32/2.61 % --bmc1_dump_unsat_core_tptp false
% 2.32/2.61 % --bmc1_dump_file -
% 2.32/2.61 % --bmc1_ucm_expand_uc_limit 128
% 2.32/2.61 % --bmc1_ucm_n_expand_iterations 6
% 2.32/2.61 % --bmc1_ucm_extend_mode 1
% 2.32/2.61 % --bmc1_ucm_init_mode 2
% 2.32/2.61 % --bmc1_ucm_cone_mode none
% 2.32/2.61 % --bmc1_ucm_reduced_relation_type 0
% 2.32/2.61 % --bmc1_ucm_relax_model 4
% 2.32/2.61 % --bmc1_ucm_full_tr_after_sat true
% 2.32/2.61 % --bmc1_ucm_expand_neg_assumptions false
% 2.32/2.61 % --bmc1_ucm_layered_model none
% 2.32/2.61 % --bmc1_ucm_max_lemma_size 10
% 2.32/2.61
% 2.32/2.61 % ------ AIG Options
% 2.32/2.61
% 2.32/2.61 % --aig_mode false
% 2.32/2.61
% 2.32/2.61 % ------ Instantiation Options
% 2.32/2.61
% 2.32/2.61 % --instantiation_flag true
% 2.32/2.61 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.32/2.61 % --inst_solver_per_active 750
% 2.32/2.61 % --inst_solver_calls_frac 0.5
% 2.32/2.61 % --inst_passive_queue_type priority_queues
% 2.32/2.61 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.32/2.61 % --inst_passive_queues_freq [25;2]
% 2.32/2.61 % --inst_dismatching true
% 2.32/2.61 % --inst_eager_unprocessed_to_passive true
% 4.07/4.32 % --inst_prop_sim_given true
% 4.07/4.32 % --inst_prop_sim_new false
% 4.07/4.32 % --inst_orphan_elimination true
% 4.07/4.32 % --inst_learning_loop_flag true
% 4.07/4.32 % --inst_learning_start 3000
% 4.07/4.32 % --inst_learning_factor 2
% 4.07/4.32 % --inst_start_prop_sim_after_learn 3
% 4.07/4.32 % --inst_sel_renew solver
% 4.07/4.32 % --inst_lit_activity_flag true
% 4.07/4.32 % --inst_out_proof true
% 4.07/4.32
% 4.07/4.32 % ------ Resolution Options
% 4.07/4.32
% 4.07/4.32 % --resolution_flag true
% 4.07/4.32 % --res_lit_sel kbo_max
% 4.07/4.32 % --res_to_prop_solver none
% 4.07/4.32 % --res_prop_simpl_new false
% 4.07/4.32 % --res_prop_simpl_given false
% 4.07/4.32 % --res_passive_queue_type priority_queues
% 4.07/4.32 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.07/4.32 % --res_passive_queues_freq [15;5]
% 4.07/4.32 % --res_forward_subs full
% 4.07/4.32 % --res_backward_subs full
% 4.07/4.32 % --res_forward_subs_resolution true
% 4.07/4.32 % --res_backward_subs_resolution true
% 4.07/4.32 % --res_orphan_elimination false
% 4.07/4.32 % --res_time_limit 1000.
% 4.07/4.32 % --res_out_proof true
% 4.07/4.32 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d714cd.s
% 4.07/4.32 % --modulo true
% 4.07/4.32
% 4.07/4.32 % ------ Combination Options
% 4.07/4.32
% 4.07/4.32 % --comb_res_mult 1000
% 4.07/4.32 % --comb_inst_mult 300
% 4.07/4.32 % ------
% 4.07/4.32
% 4.07/4.32
% 4.07/4.32
% 4.07/4.32 % ------ Proving...
% 4.07/4.32 % warning: shown sat in sat incomplete mode
% 4.07/4.32 %
% 4.07/4.32
% 4.07/4.32
% 4.07/4.32 ------ Building Model...Done
% 4.07/4.32
% 4.07/4.32 %------ The model is defined over ground terms (initial term algebra).
% 4.07/4.32 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 4.07/4.32 %------ where \phi is a formula over the term algebra.
% 4.07/4.32 %------ If we have equality in the problem then it is also defined as a predicate above,
% 4.07/4.32 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 4.07/4.32 %------ See help for --sat_out_model for different model outputs.
% 4.07/4.32 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 4.07/4.32 %------ where the first argument stands for the sort ($i in the unsorted case)
% 4.07/4.32
% 4.07/4.32
% 4.07/4.32
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c5_2
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 (! [X0,X1] :
% 4.07/4.32 ( c5_2(X0,X1) <=>
% 4.07/4.32 (
% 4.07/4.32 (
% 4.07/4.32 ( X0=a588 & X1=a591 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c2_2
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 (! [X0,X1] :
% 4.07/4.32 ( c2_2(X0,X1) <=>
% 4.07/4.32 (
% 4.07/4.32 (
% 4.07/4.32 ( X0=a588 & X1=a589 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X0=a588 & X1=a590 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c3_2
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 (! [X0,X1] :
% 4.07/4.32 ( c3_2(X0,X1) <=>
% 4.07/4.32 (
% 4.07/4.32 (
% 4.07/4.32 ( X0=a588 & X1=a589 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c2_0
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 ( c2_0 <=>
% 4.07/4.32 $true
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Negative definition of ndr1_1
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 (! [X0] :
% 4.07/4.32 ( ~(ndr1_1(X0)) <=>
% 4.07/4.32 (
% 4.07/4.32 (
% 4.07/4.32 ( X0=a633 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X0=a593 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X0=a594 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X0=a605 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X0=a616 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X0=a587 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of ndr1_0
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 ( ndr1_0 <=>
% 4.07/4.32 $true
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c3_1
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 (! [X0] :
% 4.07/4.32 ( c3_1(X0) <=>
% 4.07/4.32 (
% 4.07/4.32 (
% 4.07/4.32 ( X0=a587 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Negative definition of c1_2
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 (! [X0,X1] :
% 4.07/4.32 ( ~(c1_2(X0,X1)) <=>
% 4.07/4.32 (
% 4.07/4.32 (
% 4.07/4.32 ( X0=a588 & X1=a591 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X1=a617 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c4_2
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 (! [X0,X1] :
% 4.07/4.32 ( c4_2(X0,X1) <=>
% 4.07/4.32 (
% 4.07/4.32 (
% 4.07/4.32 ( X1=a621 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c5_1
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 (! [X0] :
% 4.07/4.32 ( c5_1(X0) <=>
% 4.07/4.32 (
% 4.07/4.32 (
% 4.07/4.32 ( X0=a587 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c1_1
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 (! [X0] :
% 4.07/4.32 ( c1_1(X0) <=>
% 4.07/4.32 (
% 4.07/4.32 (
% 4.07/4.32 ( X0=a594 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X0=a616 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Negative definition of c2_1
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 (! [X0] :
% 4.07/4.32 ( ~(c2_1(X0)) <=>
% 4.07/4.32 (
% 4.07/4.32 (
% 4.07/4.32 ( X0=a633 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X0=a593 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X0=a605 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X0=a637 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 |
% 4.07/4.32 (
% 4.07/4.32 ( X0=a616 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c3_0
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 ( c3_0 <=>
% 4.07/4.32 $false
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c5_0
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 ( c5_0 <=>
% 4.07/4.32 $true
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c4_1
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 (! [X0] :
% 4.07/4.32 ( c4_1(X0) <=>
% 4.07/4.32 (
% 4.07/4.32 (
% 4.07/4.32 ( X0=a594 )
% 4.07/4.32 )
% 4.07/4.32
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c4_0
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 ( c4_0 <=>
% 4.07/4.32 $false
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of c1_0
% 4.07/4.32 fof(lit_def,axiom,
% 4.07/4.32 ( c1_0 <=>
% 4.07/4.32 $true
% 4.07/4.32 )
% 4.07/4.32 ).
% 4.07/4.32
% 4.07/4.32 %------ Positive definition of epred1_0
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( epred1_0 <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP0_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP0_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP4_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP4_iProver_split <=>
% 4.17/4.33 $true
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP5_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP5_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP14_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP14_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP25_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP25_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP26_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP26_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP27_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP27_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP28_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP28_iProver_split <=>
% 4.17/4.33 $true
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP29_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP29_iProver_split <=>
% 4.17/4.33 $true
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP30_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP30_iProver_split <=>
% 4.17/4.33 $true
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP31_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP31_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP35_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP35_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP36_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP36_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP37_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP37_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP38_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP38_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP39_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP39_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP41_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP41_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP45_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP45_iProver_split <=>
% 4.17/4.33 $true
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP46_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP46_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP47_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP47_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP48_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP48_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP49_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP49_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP50_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP50_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP53_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP53_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP54_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP54_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP55_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP55_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP56_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP56_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP57_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP57_iProver_split <=>
% 4.17/4.33 $true
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP66_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP66_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP67_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP67_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP72_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP72_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP75_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP75_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP76_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP76_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP77_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP77_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP79_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP79_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP80_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP80_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP85_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP85_iProver_split <=>
% 4.17/4.33 $true
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP87_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP87_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP89_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP89_iProver_split <=>
% 4.17/4.33 $true
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP90_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP90_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP91_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP91_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33 %------ Positive definition of sP95_iProver_split
% 4.17/4.33 fof(lit_def,axiom,
% 4.17/4.33 ( sP95_iProver_split <=>
% 4.17/4.33 $false
% 4.17/4.33 )
% 4.17/4.33 ).
% 4.17/4.33
% 4.17/4.33
% 4.17/4.33
% 4.17/4.33 % ------ Statistics
% 4.17/4.33
% 4.17/4.33 % ------ General
% 4.17/4.33
% 4.17/4.33 % num_of_input_clauses: 363
% 4.17/4.33 % num_of_input_neg_conjectures: 315
% 4.17/4.33 % num_of_splits: 798
% 4.17/4.33 % num_of_split_atoms: 144
% 4.17/4.33 % num_of_sem_filtered_clauses: 0
% 4.17/4.33 % num_of_subtypes: 0
% 4.17/4.33 % monotx_restored_types: 0
% 4.17/4.33 % sat_num_of_epr_types: 0
% 4.17/4.33 % sat_num_of_non_cyclic_types: 0
% 4.17/4.33 % sat_guarded_non_collapsed_types: 0
% 4.17/4.33 % is_epr: 1
% 4.17/4.33 % is_horn: 0
% 4.17/4.33 % has_eq: 0
% 4.17/4.33 % num_pure_diseq_elim: 0
% 4.17/4.33 % simp_replaced_by: 0
% 4.17/4.33 % res_preprocessed: 1382
% 4.17/4.33 % prep_upred: 0
% 4.17/4.33 % prep_unflattend: 0
% 4.17/4.33 % pred_elim_cands: 143
% 4.17/4.33 % pred_elim: 101
% 4.17/4.33 % pred_elim_cl: 168
% 4.17/4.33 % pred_elim_cycles: 159
% 4.17/4.33 % forced_gc_time: 0
% 4.17/4.33 % gc_basic_clause_elim: 0
% 4.17/4.33 % parsing_time: 0.008
% 4.17/4.33 % sem_filter_time: 0.
% 4.17/4.33 % pred_elim_time: 0.077
% 4.17/4.33 % out_proof_time: 0.
% 4.17/4.33 % monotx_time: 0.
% 4.17/4.33 % subtype_inf_time: 0.
% 4.17/4.33 % unif_index_cands_time: 0.002
% 4.17/4.33 % unif_index_add_time: 0.002
% 4.17/4.33 % total_time: 1.852
% 4.17/4.33 % num_of_symbols: 240
% 4.17/4.33 % num_of_terms: 2332
% 4.17/4.33
% 4.17/4.33 % ------ Propositional Solver
% 4.17/4.33
% 4.17/4.33 % prop_solver_calls: 5
% 4.17/4.33 % prop_fast_solver_calls: 10832
% 4.17/4.33 % prop_num_of_clauses: 1799
% 4.17/4.33 % prop_preprocess_simplified: 10067
% 4.17/4.33 % prop_fo_subsumed: 790
% 4.17/4.33 % prop_solver_time: 0.
% 4.17/4.33 % prop_fast_solver_time: 0.006
% 4.17/4.33 % prop_unsat_core_time: 0.
% 4.17/4.33
% 4.17/4.33 % ------ QBF
% 4.17/4.33
% 4.17/4.33 % qbf_q_res: 0
% 4.17/4.33 % qbf_num_tautologies: 0
% 4.17/4.33 % qbf_prep_cycles: 0
% 4.17/4.33
% 4.17/4.33 % ------ BMC1
% 4.17/4.33
% 4.17/4.33 % bmc1_current_bound: -1
% 4.17/4.33 % bmc1_last_solved_bound: -1
% 4.17/4.33 % bmc1_unsat_core_size: -1
% 4.17/4.33 % bmc1_unsat_core_parents_size: -1
% 4.17/4.33 % bmc1_merge_next_fun: 0
% 4.17/4.33 % bmc1_unsat_core_clauses_time: 0.
% 4.17/4.33
% 4.17/4.33 % ------ Instantiation
% 4.17/4.33
% 4.17/4.33 % inst_num_of_clauses: 356
% 4.17/4.33 % inst_num_in_passive: 0
% 4.17/4.33 % inst_num_in_active: 356
% 4.17/4.33 % inst_num_in_unprocessed: 0
% 4.17/4.33 % inst_num_of_loops: 402
% 4.17/4.33 % inst_num_of_learning_restarts: 0
% 4.17/4.33 % inst_num_moves_active_passive: 39
% 4.17/4.33 % inst_lit_activity: 26
% 4.17/4.33 % inst_lit_activity_moves: 0
% 4.17/4.33 % inst_num_tautologies: 0
% 4.17/4.33 % inst_num_prop_implied: 0
% 4.17/4.33 % inst_num_existing_simplified: 0
% 4.17/4.33 % inst_num_eq_res_simplified: 0
% 4.17/4.33 % inst_num_child_elim: 0
% 4.17/4.33 % inst_num_of_dismatching_blockings: 0
% 4.17/4.33 % inst_num_of_non_proper_insts: 88
% 4.17/4.33 % inst_num_of_duplicates: 4
% 4.17/4.33 % inst_inst_num_from_inst_to_res: 0
% 4.17/4.33 % inst_dismatching_checking_time: 0.
% 4.17/4.33
% 4.17/4.33 % ------ Resolution
% 4.17/4.33
% 4.17/4.33 % res_num_of_clauses: 9156
% 4.17/4.33 % res_num_in_passive: 7724
% 4.17/4.33 % res_num_in_active: 1414
% 4.17/4.33 % res_num_of_loops: 2000
% 4.17/4.33 % res_forward_subset_subsumed: 1452
% 4.17/4.33 % res_backward_subset_subsumed: 5
% 4.17/4.33 % res_forward_subsumed: 499
% 4.17/4.33 % res_backward_subsumed: 82
% 4.17/4.33 % res_forward_subsumption_resolution: 701
% 4.17/4.33 % res_backward_subsumption_resolution: 4
% 4.17/4.33 % res_clause_to_clause_subsumption: 5563
% 4.17/4.33 % res_orphan_elimination: 0
% 4.17/4.33 % res_tautology_del: 6717
% 4.17/4.33 % res_num_eq_res_simplified: 0
% 4.17/4.33 % res_num_sel_changes: 0
% 4.17/4.33 % res_moves_from_active_to_pass: 0
% 4.17/4.33
% 4.17/4.33 % Status Unknown
% 4.17/4.33 % Last status :
% 4.17/4.33 % SZS status Unknown
%------------------------------------------------------------------------------