TSTP Solution File: SYN418-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN418-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n014.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:37 EDT 2022
% Result : Unknown 3.30s 3.47s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN418-1 : TPTP v8.1.0. Released v2.1.0.
% 0.13/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 23:06:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.35 % Running in mono-core mode
% 0.20/0.47 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.47 % Orientation found
% 0.20/0.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_bdfb41.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_cea855.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_91fde1 | grep -v "SZS"
% 0.20/0.49
% 0.20/0.49 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % ------ iProver source info
% 0.20/0.49
% 0.20/0.49 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.49 % git: non_committed_changes: true
% 0.20/0.49 % git: last_make_outside_of_git: true
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % ------ Input Options
% 0.20/0.49
% 0.20/0.49 % --out_options all
% 0.20/0.49 % --tptp_safe_out true
% 0.20/0.49 % --problem_path ""
% 0.20/0.49 % --include_path ""
% 0.20/0.49 % --clausifier .//eprover
% 0.20/0.49 % --clausifier_options --tstp-format
% 0.20/0.49 % --stdin false
% 0.20/0.49 % --dbg_backtrace false
% 0.20/0.49 % --dbg_dump_prop_clauses false
% 0.20/0.49 % --dbg_dump_prop_clauses_file -
% 0.20/0.49 % --dbg_out_stat false
% 0.20/0.49
% 0.20/0.49 % ------ General Options
% 0.20/0.49
% 0.20/0.49 % --fof false
% 0.20/0.49 % --time_out_real 150.
% 0.20/0.49 % --time_out_prep_mult 0.2
% 0.20/0.49 % --time_out_virtual -1.
% 0.20/0.49 % --schedule none
% 0.20/0.49 % --ground_splitting input
% 0.20/0.49 % --splitting_nvd 16
% 0.20/0.49 % --non_eq_to_eq false
% 0.20/0.49 % --prep_gs_sim true
% 0.20/0.49 % --prep_unflatten false
% 0.20/0.49 % --prep_res_sim true
% 0.20/0.49 % --prep_upred true
% 0.20/0.49 % --res_sim_input true
% 0.20/0.49 % --clause_weak_htbl true
% 0.20/0.49 % --gc_record_bc_elim false
% 0.20/0.49 % --symbol_type_check false
% 0.20/0.49 % --clausify_out false
% 0.20/0.49 % --large_theory_mode false
% 0.20/0.49 % --prep_sem_filter none
% 0.20/0.49 % --prep_sem_filter_out false
% 0.20/0.49 % --preprocessed_out false
% 0.20/0.49 % --sub_typing false
% 0.20/0.49 % --brand_transform false
% 0.20/0.49 % --pure_diseq_elim true
% 0.20/0.49 % --min_unsat_core false
% 0.20/0.49 % --pred_elim true
% 0.20/0.49 % --add_important_lit false
% 0.20/0.49 % --soft_assumptions false
% 0.20/0.49 % --reset_solvers false
% 0.20/0.49 % --bc_imp_inh []
% 0.20/0.49 % --conj_cone_tolerance 1.5
% 0.20/0.49 % --prolific_symb_bound 500
% 0.20/0.49 % --lt_threshold 2000
% 0.20/0.49
% 0.20/0.49 % ------ SAT Options
% 0.20/0.49
% 0.20/0.49 % --sat_mode false
% 0.20/0.49 % --sat_fm_restart_options ""
% 0.20/0.49 % --sat_gr_def false
% 0.20/0.49 % --sat_epr_types true
% 0.20/0.49 % --sat_non_cyclic_types false
% 0.20/0.49 % --sat_finite_models false
% 0.20/0.49 % --sat_fm_lemmas false
% 0.20/0.49 % --sat_fm_prep false
% 0.20/0.49 % --sat_fm_uc_incr true
% 0.20/0.49 % --sat_out_model small
% 0.20/0.49 % --sat_out_clauses false
% 0.20/0.49
% 0.20/0.49 % ------ QBF Options
% 0.20/0.49
% 0.20/0.49 % --qbf_mode false
% 0.20/0.49 % --qbf_elim_univ true
% 0.20/0.49 % --qbf_sk_in true
% 0.20/0.49 % --qbf_pred_elim true
% 0.20/0.49 % --qbf_split 32
% 0.20/0.49
% 0.20/0.49 % ------ BMC1 Options
% 0.20/0.49
% 0.20/0.49 % --bmc1_incremental false
% 0.20/0.49 % --bmc1_axioms reachable_all
% 0.20/0.49 % --bmc1_min_bound 0
% 0.20/0.49 % --bmc1_max_bound -1
% 0.20/0.49 % --bmc1_max_bound_default -1
% 0.20/0.49 % --bmc1_symbol_reachability true
% 0.20/0.49 % --bmc1_property_lemmas false
% 0.20/0.49 % --bmc1_k_induction false
% 0.20/0.49 % --bmc1_non_equiv_states false
% 0.20/0.49 % --bmc1_deadlock false
% 0.20/0.49 % --bmc1_ucm false
% 0.20/0.49 % --bmc1_add_unsat_core none
% 0.20/0.49 % --bmc1_unsat_core_children false
% 0.20/0.49 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.49 % --bmc1_out_stat full
% 0.20/0.49 % --bmc1_ground_init false
% 0.20/0.49 % --bmc1_pre_inst_next_state false
% 0.20/0.49 % --bmc1_pre_inst_state false
% 0.20/0.49 % --bmc1_pre_inst_reach_state false
% 0.20/0.49 % --bmc1_out_unsat_core false
% 0.20/0.49 % --bmc1_aig_witness_out false
% 0.20/0.49 % --bmc1_verbose false
% 0.20/0.49 % --bmc1_dump_clauses_tptp false
% 0.55/0.75 % --bmc1_dump_unsat_core_tptp false
% 0.55/0.75 % --bmc1_dump_file -
% 0.55/0.75 % --bmc1_ucm_expand_uc_limit 128
% 0.55/0.75 % --bmc1_ucm_n_expand_iterations 6
% 0.55/0.75 % --bmc1_ucm_extend_mode 1
% 0.55/0.75 % --bmc1_ucm_init_mode 2
% 0.55/0.75 % --bmc1_ucm_cone_mode none
% 0.55/0.75 % --bmc1_ucm_reduced_relation_type 0
% 0.55/0.75 % --bmc1_ucm_relax_model 4
% 0.55/0.75 % --bmc1_ucm_full_tr_after_sat true
% 0.55/0.75 % --bmc1_ucm_expand_neg_assumptions false
% 0.55/0.75 % --bmc1_ucm_layered_model none
% 0.55/0.75 % --bmc1_ucm_max_lemma_size 10
% 0.55/0.75
% 0.55/0.75 % ------ AIG Options
% 0.55/0.75
% 0.55/0.75 % --aig_mode false
% 0.55/0.75
% 0.55/0.75 % ------ Instantiation Options
% 0.55/0.75
% 0.55/0.75 % --instantiation_flag true
% 0.55/0.75 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.55/0.75 % --inst_solver_per_active 750
% 0.55/0.75 % --inst_solver_calls_frac 0.5
% 0.55/0.75 % --inst_passive_queue_type priority_queues
% 0.55/0.75 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.55/0.75 % --inst_passive_queues_freq [25;2]
% 0.55/0.75 % --inst_dismatching true
% 0.55/0.75 % --inst_eager_unprocessed_to_passive true
% 0.55/0.75 % --inst_prop_sim_given true
% 0.55/0.75 % --inst_prop_sim_new false
% 0.55/0.75 % --inst_orphan_elimination true
% 0.55/0.75 % --inst_learning_loop_flag true
% 0.55/0.75 % --inst_learning_start 3000
% 0.55/0.75 % --inst_learning_factor 2
% 0.55/0.75 % --inst_start_prop_sim_after_learn 3
% 0.55/0.75 % --inst_sel_renew solver
% 0.55/0.75 % --inst_lit_activity_flag true
% 0.55/0.75 % --inst_out_proof true
% 0.55/0.75
% 0.55/0.75 % ------ Resolution Options
% 0.55/0.75
% 0.55/0.75 % --resolution_flag true
% 0.55/0.75 % --res_lit_sel kbo_max
% 0.55/0.75 % --res_to_prop_solver none
% 0.55/0.75 % --res_prop_simpl_new false
% 0.55/0.75 % --res_prop_simpl_given false
% 0.55/0.75 % --res_passive_queue_type priority_queues
% 0.55/0.75 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.55/0.75 % --res_passive_queues_freq [15;5]
% 0.55/0.75 % --res_forward_subs full
% 0.55/0.75 % --res_backward_subs full
% 0.55/0.75 % --res_forward_subs_resolution true
% 0.55/0.75 % --res_backward_subs_resolution true
% 0.55/0.75 % --res_orphan_elimination false
% 0.55/0.75 % --res_time_limit 1000.
% 0.55/0.75 % --res_out_proof true
% 0.55/0.75 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_bdfb41.s
% 0.55/0.75 % --modulo true
% 0.55/0.75
% 0.55/0.75 % ------ Combination Options
% 0.55/0.75
% 0.55/0.75 % --comb_res_mult 1000
% 0.55/0.75 % --comb_inst_mult 300
% 0.55/0.75 % ------
% 0.55/0.75
% 0.55/0.75 % ------ Parsing...% successful
% 0.55/0.75
% 0.55/0.75 % ------ Preprocessing... gs_s sp: 468 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:128:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.55/0.75
% 0.55/0.75 % ------ Proving...
% 0.55/0.75 % ------ Problem Properties
% 0.55/0.75
% 0.55/0.75 %
% 0.55/0.75 % EPR true
% 0.55/0.75 % Horn false
% 0.55/0.75 % Has equality false
% 0.55/0.75
% 0.55/0.75 % % ------ Input Options Time Limit: Unbounded
% 0.55/0.75
% 0.55/0.75
% 0.55/0.75 % % ------ Current options:
% 0.55/0.75
% 0.55/0.75 % ------ Input Options
% 0.55/0.75
% 0.55/0.75 % --out_options all
% 0.55/0.75 % --tptp_safe_out true
% 0.55/0.75 % --problem_path ""
% 0.55/0.75 % --include_path ""
% 0.55/0.75 % --clausifier .//eprover
% 0.55/0.75 % --clausifier_options --tstp-format
% 0.55/0.75 % --stdin false
% 0.55/0.75 % --dbg_backtrace false
% 0.55/0.75 % --dbg_dump_prop_clauses false
% 0.55/0.75 % --dbg_dump_prop_clauses_file -
% 0.55/0.75 % --dbg_out_stat false
% 0.55/0.75
% 0.55/0.75 % ------ General Options
% 0.55/0.75
% 0.55/0.75 % --fof false
% 0.55/0.75 % --time_out_real 150.
% 0.55/0.75 % --time_out_prep_mult 0.2
% 0.55/0.75 % --time_out_virtual -1.
% 0.55/0.75 % --schedule none
% 0.55/0.75 % --ground_splitting input
% 0.55/0.75 % --splitting_nvd 16
% 0.55/0.75 % --non_eq_to_eq false
% 0.55/0.75 % --prep_gs_sim true
% 0.55/0.75 % --prep_unflatten false
% 0.55/0.75 % --prep_res_sim true
% 0.55/0.75 % --prep_upred true
% 0.55/0.75 % --res_sim_input true
% 0.55/0.75 % --clause_weak_htbl true
% 0.55/0.75 % --gc_record_bc_elim false
% 0.55/0.75 % --symbol_type_check false
% 0.55/0.75 % --clausify_out false
% 0.55/0.75 % --large_theory_mode false
% 0.55/0.75 % --prep_sem_filter none
% 0.55/0.75 % --prep_sem_filter_out false
% 0.55/0.75 % --preprocessed_out false
% 0.55/0.75 % --sub_typing false
% 0.55/0.75 % --brand_transform false
% 0.55/0.75 % --pure_diseq_elim true
% 0.55/0.75 % --min_unsat_core false
% 0.55/0.75 % --pred_elim true
% 0.55/0.75 % --add_important_lit false
% 0.55/0.75 % --soft_assumptions false
% 0.55/0.75 % --reset_solvers false
% 0.55/0.75 % --bc_imp_inh []
% 0.55/0.75 % --conj_cone_tolerance 1.5
% 0.55/0.75 % --prolific_symb_bound 500
% 0.55/0.75 % --lt_threshold 2000
% 0.55/0.75
% 0.55/0.75 % ------ SAT Options
% 0.55/0.75
% 0.55/0.75 % --sat_mode false
% 0.55/0.75 % --sat_fm_restart_options ""
% 0.55/0.75 % --sat_gr_def false
% 0.55/0.75 % --sat_epr_types true
% 0.55/0.75 % --sat_non_cyclic_types false
% 0.55/0.75 % --sat_finite_models false
% 0.55/0.75 % --sat_fm_lemmas false
% 0.55/0.75 % --sat_fm_prep false
% 0.55/0.75 % --sat_fm_uc_incr true
% 0.55/0.75 % --sat_out_model small
% 0.55/0.75 % --sat_out_clauses false
% 0.55/0.75
% 0.55/0.75 % ------ QBF Options
% 0.55/0.75
% 0.55/0.75 % --qbf_mode false
% 0.55/0.75 % --qbf_elim_univ true
% 0.55/0.75 % --qbf_sk_in true
% 0.55/0.75 % --qbf_pred_elim true
% 0.55/0.75 % --qbf_split 32
% 0.55/0.75
% 0.55/0.75 % ------ BMC1 Options
% 0.55/0.75
% 0.55/0.75 % --bmc1_incremental false
% 0.55/0.75 % --bmc1_axioms reachable_all
% 0.55/0.75 % --bmc1_min_bound 0
% 0.55/0.75 % --bmc1_max_bound -1
% 0.55/0.75 % --bmc1_max_bound_default -1
% 0.55/0.75 % --bmc1_symbol_reachability true
% 0.55/0.75 % --bmc1_property_lemmas false
% 0.55/0.75 % --bmc1_k_induction false
% 0.55/0.75 % --bmc1_non_equiv_states false
% 0.55/0.75 % --bmc1_deadlock false
% 0.55/0.75 % --bmc1_ucm false
% 0.55/0.75 % --bmc1_add_unsat_core none
% 0.55/0.75 % --bmc1_unsat_core_children false
% 0.55/0.75 % --bmc1_unsat_core_extrapolate_axioms false
% 0.55/0.75 % --bmc1_out_stat full
% 0.55/0.75 % --bmc1_ground_init false
% 0.55/0.75 % --bmc1_pre_inst_next_state false
% 0.55/0.75 % --bmc1_pre_inst_state false
% 0.55/0.75 % --bmc1_pre_inst_reach_state false
% 0.55/0.75 % --bmc1_out_unsat_core false
% 0.55/0.75 % --bmc1_aig_witness_out false
% 0.55/0.75 % --bmc1_verbose false
% 0.55/0.75 % --bmc1_dump_clauses_tptp false
% 0.55/0.75 % --bmc1_dump_unsat_core_tptp false
% 0.55/0.75 % --bmc1_dump_file -
% 0.55/0.75 % --bmc1_ucm_expand_uc_limit 128
% 0.55/0.75 % --bmc1_ucm_n_expand_iterations 6
% 0.55/0.75 % --bmc1_ucm_extend_mode 1
% 0.55/0.75 % --bmc1_ucm_init_mode 2
% 0.55/0.75 % --bmc1_ucm_cone_mode none
% 0.55/0.75 % --bmc1_ucm_reduced_relation_type 0
% 0.55/0.75 % --bmc1_ucm_relax_model 4
% 0.55/0.75 % --bmc1_ucm_full_tr_after_sat true
% 0.55/0.75 % --bmc1_ucm_expand_neg_assumptions false
% 0.55/0.75 % --bmc1_ucm_layered_model none
% 0.55/0.75 % --bmc1_ucm_max_lemma_size 10
% 0.55/0.75
% 0.55/0.75 % ------ AIG Options
% 0.55/0.75
% 0.55/0.75 % --aig_mode false
% 0.55/0.75
% 0.55/0.75 % ------ Instantiation Options
% 0.55/0.75
% 0.55/0.75 % --instantiation_flag true
% 0.55/0.75 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.55/0.75 % --inst_solver_per_active 750
% 0.55/0.75 % --inst_solver_calls_frac 0.5
% 0.55/0.75 % --inst_passive_queue_type priority_queues
% 0.55/0.75 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.55/0.75 % --inst_passive_queues_freq [25;2]
% 0.55/0.75 % --inst_dismatching true
% 1.82/2.01 % --inst_eager_unprocessed_to_passive true
% 1.82/2.01 % --inst_prop_sim_given true
% 1.82/2.01 % --inst_prop_sim_new false
% 1.82/2.01 % --inst_orphan_elimination true
% 1.82/2.01 % --inst_learning_loop_flag true
% 1.82/2.01 % --inst_learning_start 3000
% 1.82/2.01 % --inst_learning_factor 2
% 1.82/2.01 % --inst_start_prop_sim_after_learn 3
% 1.82/2.01 % --inst_sel_renew solver
% 1.82/2.01 % --inst_lit_activity_flag true
% 1.82/2.01 % --inst_out_proof true
% 1.82/2.01
% 1.82/2.01 % ------ Resolution Options
% 1.82/2.01
% 1.82/2.01 % --resolution_flag true
% 1.82/2.01 % --res_lit_sel kbo_max
% 1.82/2.01 % --res_to_prop_solver none
% 1.82/2.01 % --res_prop_simpl_new false
% 1.82/2.01 % --res_prop_simpl_given false
% 1.82/2.01 % --res_passive_queue_type priority_queues
% 1.82/2.01 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.82/2.01 % --res_passive_queues_freq [15;5]
% 1.82/2.01 % --res_forward_subs full
% 1.82/2.01 % --res_backward_subs full
% 1.82/2.01 % --res_forward_subs_resolution true
% 1.82/2.01 % --res_backward_subs_resolution true
% 1.82/2.01 % --res_orphan_elimination false
% 1.82/2.01 % --res_time_limit 1000.
% 1.82/2.01 % --res_out_proof true
% 1.82/2.01 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_bdfb41.s
% 1.82/2.01 % --modulo true
% 1.82/2.01
% 1.82/2.01 % ------ Combination Options
% 1.82/2.01
% 1.82/2.01 % --comb_res_mult 1000
% 1.82/2.01 % --comb_inst_mult 300
% 1.82/2.01 % ------
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01 % ------ Proving...
% 1.82/2.01 % warning: shown sat in sat incomplete mode
% 1.82/2.01 %
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01 ------ Building Model...Done
% 1.82/2.01
% 1.82/2.01 %------ The model is defined over ground terms (initial term algebra).
% 1.82/2.01 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.82/2.01 %------ where \phi is a formula over the term algebra.
% 1.82/2.01 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.82/2.01 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.82/2.01 %------ See help for --sat_out_model for different model outputs.
% 1.82/2.01 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.82/2.01 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c5_1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( c5_1(X0) <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c2_2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0,X1] :
% 1.82/2.01 ( c2_2(X0,X1) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a114 & X1=a115 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a9 & X1=a10 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a19 & X1=a20 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a19 & X1=a21 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c1_2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0,X1] :
% 1.82/2.01 ( c1_2(X0,X1) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a66 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c10_1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( c10_1(X0) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a119 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a6 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c1_1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( c1_1(X0) <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c10_2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0,X1] :
% 1.82/2.01 ( c10_2(X0,X1) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a33 & X1=a34 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c3_2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0,X1] :
% 1.82/2.01 ( c3_2(X0,X1) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a45 & X1=a47 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Negative definition of c7_2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0,X1] :
% 1.82/2.01 ( ~(c7_2(X0,X1)) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a37 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a93 & X1=a94 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Negative definition of ndr1_1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( ~(ndr1_1(X0)) <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c5_2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0,X1] :
% 1.82/2.01 ( c5_2(X0,X1) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a9 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a119 & X1=a120 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c8_2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0,X1] :
% 1.82/2.01 ( c8_2(X0,X1) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a29 & X1=a30 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a95 & X1=a96 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a35 & X1=a36 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ndr1_0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ndr1_0 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c4_2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0,X1] :
% 1.82/2.01 ( c4_2(X0,X1) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a71 & X1=a72 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a37 & X1=a38 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a93 & X1=a94 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a90 & X1=a91 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a105 & X1=a106 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c2_1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( c2_1(X0) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a35 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c8_1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( c8_1(X0) <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c5_0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( c5_0 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c6_2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0,X1] :
% 1.82/2.01 ( c6_2(X0,X1) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a37 & X1=a38 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a1 & X1=a2 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a105 & X1=a107 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c3_1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( c3_1(X0) <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c9_2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0,X1] :
% 1.82/2.01 ( c9_2(X0,X1) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a19 & X1=a20 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a45 & X1=a48 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c4_1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( c4_1(X0) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a66 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a95 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c9_1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( c9_1(X0) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a29 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a1 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c7_1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( c7_1(X0) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a19 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a105 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC2 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c6_0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( c6_0 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c10_0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( c10_0 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC9
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC9 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC8
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC8 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c3_0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( c3_0 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Negative definition of c6_1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( ~(c6_1(X0)) <=>
% 1.82/2.01 (
% 1.82/2.01 (
% 1.82/2.01 ( X0=a119 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a6 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a55 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 |
% 1.82/2.01 (
% 1.82/2.01 ( X0=a121 )
% 1.82/2.01 )
% 1.82/2.01
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC27
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC27 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c8_0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( c8_0 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c2_0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( c2_0 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c9_0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( c9_0 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC10
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC10 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c4_0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( c4_0 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC19
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC19 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC3
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC3 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC17
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC17 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c1_0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( c1_0 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC16
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC16 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC14
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC14 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkP2
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( ssSkP2(X0) <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of c7_0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( c7_0 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC23
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC23 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC12
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC12 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC4
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC4 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC18
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC18 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC21
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC21 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC13
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC13 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC6
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC6 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkP3
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( ssSkP3(X0) <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC22
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC22 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC30
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC30 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC11
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC11 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkP0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( ssSkP0(X0) <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC20
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC20 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkP4
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( ssSkP4(X0) <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC28
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC28 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC15
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC15 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkP7
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( ssSkP7(X0) <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkP6
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( ssSkP6(X0) <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC24
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC24 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkP5
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( ssSkP5(X0) <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC29
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC29 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkP1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 (! [X0] :
% 1.82/2.01 ( ssSkP1(X0) <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC0
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC0 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC5
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC5 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC7
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC7 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC1
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC1 <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of ssSkC26
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( ssSkC26 <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP0_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP0_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP2_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP2_iProver_split <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP3_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP3_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP32_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP32_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP36_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP36_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP37_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP37_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP44_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP44_iProver_split <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP46_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP46_iProver_split <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP100_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP100_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP108_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP108_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP112_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP112_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP115_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP115_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP139_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP139_iProver_split <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP141_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP141_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP147_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP147_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP161_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP161_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP167_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP167_iProver_split <=>
% 1.82/2.01 $true
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP169_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP169_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP172_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP172_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP174_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP174_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01 %------ Positive definition of sP175_iProver_split
% 1.82/2.01 fof(lit_def,axiom,
% 1.82/2.01 ( sP175_iProver_split <=>
% 1.82/2.01 $false
% 1.82/2.01 )
% 1.82/2.01 ).
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01 % ------ Statistics
% 1.82/2.01
% 1.82/2.01 % ------ General
% 1.82/2.01
% 1.82/2.01 % num_of_input_clauses: 504
% 1.82/2.01 % num_of_input_neg_conjectures: 504
% 1.82/2.01 % num_of_splits: 468
% 1.82/2.01 % num_of_split_atoms: 176
% 1.82/2.01 % num_of_sem_filtered_clauses: 0
% 1.82/2.01 % num_of_subtypes: 0
% 1.82/2.01 % monotx_restored_types: 0
% 1.82/2.01 % sat_num_of_epr_types: 0
% 1.82/2.01 % sat_num_of_non_cyclic_types: 0
% 1.82/2.01 % sat_guarded_non_collapsed_types: 0
% 1.82/2.01 % is_epr: 1
% 1.82/2.01 % is_horn: 0
% 1.82/2.01 % has_eq: 0
% 1.82/2.01 % num_pure_diseq_elim: 0
% 1.82/2.01 % simp_replaced_by: 0
% 1.82/2.01 % res_preprocessed: 1476
% 1.82/2.01 % prep_upred: 0
% 1.82/2.01 % prep_unflattend: 0
% 1.82/2.01 % pred_elim_cands: 176
% 1.82/2.01 % pred_elim: 155
% 1.82/2.01 % pred_elim_cl: 160
% 1.82/2.01 % pred_elim_cycles: 176
% 1.82/2.01 % forced_gc_time: 0
% 1.82/2.01 % gc_basic_clause_elim: 0
% 1.82/2.01 % parsing_time: 0.016
% 1.82/2.01 % sem_filter_time: 0.
% 1.82/2.01 % pred_elim_time: 0.133
% 1.82/2.01 % out_proof_time: 0.
% 1.82/2.01 % monotx_time: 0.
% 1.82/2.01 % subtype_inf_time: 0.
% 1.82/2.01 % unif_index_cands_time: 0.005
% 1.82/2.01 % unif_index_add_time: 0.004
% 1.82/2.01 % total_time: 1.532
% 1.82/2.01 % num_of_symbols: 418
% 1.82/2.01 % num_of_terms: 11942
% 1.82/2.01
% 1.82/2.01 % ------ Propositional Solver
% 1.82/2.01
% 1.82/2.01 % prop_solver_calls: 4
% 1.82/2.01 % prop_fast_solver_calls: 10090
% 1.82/2.01 % prop_num_of_clauses: 1939
% 1.82/2.01 % prop_preprocess_simplified: 10272
% 1.82/2.01 % prop_fo_subsumed: 535
% 1.82/2.01 % prop_solver_time: 0.
% 1.82/2.01 % prop_fast_solver_time: 0.011
% 1.82/2.01 % prop_unsat_core_time: 0.
% 1.82/2.01
% 1.82/2.01 % ------ QBF
% 1.82/2.01
% 1.82/2.01 % qbf_q_res: 0
% 1.82/2.01 % qbf_num_tautologies: 0
% 1.82/2.01 % qbf_prep_cycles: 0
% 1.82/2.01
% 1.82/2.01 % ------ BMC1
% 1.82/2.01
% 1.82/2.01 % bmc1_current_bound: -1
% 1.82/2.01 % bmc1_last_solved_bound: -1
% 1.82/2.01 % bmc1_unsat_core_size: -1
% 1.82/2.01 % bmc1_unsat_core_parents_size: -1
% 1.82/2.01 % bmc1_merge_next_fun: 0
% 1.82/2.01 % bmc1_unsat_core_clauses_time: 0.
% 1.82/2.01
% 1.82/2.01 % ------ Instantiation
% 1.82/2.01
% 1.82/2.01 % inst_num_of_clauses: 556
% 1.82/2.01 % inst_num_in_passive: 0
% 1.82/2.01 % inst_num_in_active: 556
% 1.82/2.01 % inst_num_in_unprocessed: 0
% 1.82/2.01 % inst_num_of_loops: 583
% 1.82/2.01 % inst_num_of_learning_restarts: 0
% 1.82/2.01 % inst_num_moves_active_passive: 23
% 1.82/2.01 % inst_lit_activity: 60
% 1.82/2.01 % inst_lit_activity_moves: 0
% 1.82/2.01 % inst_num_tautologies: 0
% 1.82/2.01 % inst_num_prop_implied: 0
% 1.82/2.01 % inst_num_existing_simplified: 0
% 1.82/2.01 % inst_num_eq_res_simplified: 0
% 1.82/2.01 % inst_num_child_elim: 0
% 1.82/2.01 % inst_num_of_dismatching_blockings: 0
% 1.82/2.01 % inst_num_of_non_proper_insts: 38
% 1.82/2.01 % inst_num_of_duplicates: 0
% 1.82/2.01 % inst_inst_num_from_inst_to_res: 0
% 1.82/2.01 % inst_dismatching_checking_time: 0.
% 1.82/2.01
% 1.82/2.01 % ------ Resolution
% 1.82/2.01
% 1.82/2.01 % res_num_of_clauses: 9057
% 1.82/2.01 % res_num_in_passive: 7435
% 1.82/2.01 % res_num_in_active: 1621
% 1.82/2.01 % res_num_of_loops: 2000
% 1.82/2.01 % res_forward_subset_subsumed: 206
% 1.82/2.01 % res_backward_subset_subsumed: 0
% 1.82/2.01 % res_forward_subsumed: 378
% 1.82/2.01 % res_backward_subsumed: 1
% 1.82/2.01 % res_forward_subsumption_resolution: 912
% 1.82/2.01 % res_backward_subsumption_resolution: 0
% 1.82/2.01 % res_clause_to_clause_subsumption: 3587
% 1.82/2.01 % res_orphan_elimination: 0
% 1.82/2.01 % res_tautology_del: 2393
% 1.82/2.01 % res_num_eq_res_simplified: 0
% 1.82/2.01 % res_num_sel_changes: 0
% 1.82/2.01 % res_moves_from_active_to_pass: 0
% 1.82/2.01
% 1.82/2.01 % Status Unknown
% 1.86/2.10 % Orienting using strategy ClausalAll
% 1.86/2.10 % Orientation found
% 1.86/2.10 % 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_bdfb41.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_cea855.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_d2e413 | grep -v "SZS"
% 1.95/2.12
% 1.95/2.12 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.95/2.12
% 1.95/2.12 %
% 1.95/2.12 % ------ iProver source info
% 1.95/2.12
% 1.95/2.12 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.95/2.12 % git: non_committed_changes: true
% 1.95/2.12 % git: last_make_outside_of_git: true
% 1.95/2.12
% 1.95/2.12 %
% 1.95/2.12 % ------ Input Options
% 1.95/2.12
% 1.95/2.12 % --out_options all
% 1.95/2.12 % --tptp_safe_out true
% 1.95/2.12 % --problem_path ""
% 1.95/2.12 % --include_path ""
% 1.95/2.12 % --clausifier .//eprover
% 1.95/2.12 % --clausifier_options --tstp-format
% 1.95/2.12 % --stdin false
% 1.95/2.12 % --dbg_backtrace false
% 1.95/2.12 % --dbg_dump_prop_clauses false
% 1.95/2.12 % --dbg_dump_prop_clauses_file -
% 1.95/2.12 % --dbg_out_stat false
% 1.95/2.12
% 1.95/2.12 % ------ General Options
% 1.95/2.12
% 1.95/2.12 % --fof false
% 1.95/2.12 % --time_out_real 150.
% 1.95/2.12 % --time_out_prep_mult 0.2
% 1.95/2.12 % --time_out_virtual -1.
% 1.95/2.12 % --schedule none
% 1.95/2.12 % --ground_splitting input
% 1.95/2.12 % --splitting_nvd 16
% 1.95/2.12 % --non_eq_to_eq false
% 1.95/2.12 % --prep_gs_sim true
% 1.95/2.12 % --prep_unflatten false
% 1.95/2.12 % --prep_res_sim true
% 1.95/2.12 % --prep_upred true
% 1.95/2.12 % --res_sim_input true
% 1.95/2.12 % --clause_weak_htbl true
% 1.95/2.12 % --gc_record_bc_elim false
% 1.95/2.12 % --symbol_type_check false
% 1.95/2.12 % --clausify_out false
% 1.95/2.12 % --large_theory_mode false
% 1.95/2.12 % --prep_sem_filter none
% 1.95/2.12 % --prep_sem_filter_out false
% 1.95/2.12 % --preprocessed_out false
% 1.95/2.12 % --sub_typing false
% 1.95/2.12 % --brand_transform false
% 1.95/2.12 % --pure_diseq_elim true
% 1.95/2.12 % --min_unsat_core false
% 1.95/2.12 % --pred_elim true
% 1.95/2.12 % --add_important_lit false
% 1.95/2.12 % --soft_assumptions false
% 1.95/2.12 % --reset_solvers false
% 1.95/2.12 % --bc_imp_inh []
% 1.95/2.12 % --conj_cone_tolerance 1.5
% 1.95/2.12 % --prolific_symb_bound 500
% 1.95/2.12 % --lt_threshold 2000
% 1.95/2.12
% 1.95/2.12 % ------ SAT Options
% 1.95/2.12
% 1.95/2.12 % --sat_mode false
% 1.95/2.12 % --sat_fm_restart_options ""
% 1.95/2.12 % --sat_gr_def false
% 1.95/2.12 % --sat_epr_types true
% 1.95/2.12 % --sat_non_cyclic_types false
% 1.95/2.12 % --sat_finite_models false
% 1.95/2.12 % --sat_fm_lemmas false
% 1.95/2.12 % --sat_fm_prep false
% 1.95/2.12 % --sat_fm_uc_incr true
% 1.95/2.12 % --sat_out_model small
% 1.95/2.12 % --sat_out_clauses false
% 1.95/2.12
% 1.95/2.12 % ------ QBF Options
% 1.95/2.12
% 1.95/2.12 % --qbf_mode false
% 1.95/2.12 % --qbf_elim_univ true
% 1.95/2.12 % --qbf_sk_in true
% 1.95/2.12 % --qbf_pred_elim true
% 1.95/2.12 % --qbf_split 32
% 1.95/2.12
% 1.95/2.12 % ------ BMC1 Options
% 1.95/2.12
% 1.95/2.12 % --bmc1_incremental false
% 1.95/2.12 % --bmc1_axioms reachable_all
% 1.95/2.12 % --bmc1_min_bound 0
% 1.95/2.12 % --bmc1_max_bound -1
% 1.95/2.12 % --bmc1_max_bound_default -1
% 1.95/2.12 % --bmc1_symbol_reachability true
% 1.95/2.12 % --bmc1_property_lemmas false
% 1.95/2.12 % --bmc1_k_induction false
% 1.95/2.12 % --bmc1_non_equiv_states false
% 1.95/2.12 % --bmc1_deadlock false
% 1.95/2.12 % --bmc1_ucm false
% 1.95/2.12 % --bmc1_add_unsat_core none
% 1.95/2.12 % --bmc1_unsat_core_children false
% 1.95/2.12 % --bmc1_unsat_core_extrapolate_axioms false
% 1.95/2.12 % --bmc1_out_stat full
% 1.95/2.12 % --bmc1_ground_init false
% 1.95/2.12 % --bmc1_pre_inst_next_state false
% 1.95/2.12 % --bmc1_pre_inst_state false
% 1.95/2.12 % --bmc1_pre_inst_reach_state false
% 1.95/2.12 % --bmc1_out_unsat_core false
% 1.95/2.12 % --bmc1_aig_witness_out false
% 1.95/2.12 % --bmc1_verbose false
% 1.95/2.12 % --bmc1_dump_clauses_tptp false
% 1.95/2.29 % --bmc1_dump_unsat_core_tptp false
% 1.95/2.29 % --bmc1_dump_file -
% 1.95/2.29 % --bmc1_ucm_expand_uc_limit 128
% 1.95/2.29 % --bmc1_ucm_n_expand_iterations 6
% 1.95/2.29 % --bmc1_ucm_extend_mode 1
% 1.95/2.29 % --bmc1_ucm_init_mode 2
% 1.95/2.29 % --bmc1_ucm_cone_mode none
% 1.95/2.29 % --bmc1_ucm_reduced_relation_type 0
% 1.95/2.29 % --bmc1_ucm_relax_model 4
% 1.95/2.29 % --bmc1_ucm_full_tr_after_sat true
% 1.95/2.29 % --bmc1_ucm_expand_neg_assumptions false
% 1.95/2.29 % --bmc1_ucm_layered_model none
% 1.95/2.29 % --bmc1_ucm_max_lemma_size 10
% 1.95/2.29
% 1.95/2.29 % ------ AIG Options
% 1.95/2.29
% 1.95/2.29 % --aig_mode false
% 1.95/2.29
% 1.95/2.29 % ------ Instantiation Options
% 1.95/2.29
% 1.95/2.29 % --instantiation_flag true
% 1.95/2.29 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.95/2.29 % --inst_solver_per_active 750
% 1.95/2.29 % --inst_solver_calls_frac 0.5
% 1.95/2.29 % --inst_passive_queue_type priority_queues
% 1.95/2.29 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.95/2.29 % --inst_passive_queues_freq [25;2]
% 1.95/2.29 % --inst_dismatching true
% 1.95/2.29 % --inst_eager_unprocessed_to_passive true
% 1.95/2.29 % --inst_prop_sim_given true
% 1.95/2.29 % --inst_prop_sim_new false
% 1.95/2.29 % --inst_orphan_elimination true
% 1.95/2.29 % --inst_learning_loop_flag true
% 1.95/2.29 % --inst_learning_start 3000
% 1.95/2.29 % --inst_learning_factor 2
% 1.95/2.29 % --inst_start_prop_sim_after_learn 3
% 1.95/2.29 % --inst_sel_renew solver
% 1.95/2.29 % --inst_lit_activity_flag true
% 1.95/2.29 % --inst_out_proof true
% 1.95/2.29
% 1.95/2.29 % ------ Resolution Options
% 1.95/2.29
% 1.95/2.29 % --resolution_flag true
% 1.95/2.29 % --res_lit_sel kbo_max
% 1.95/2.29 % --res_to_prop_solver none
% 1.95/2.29 % --res_prop_simpl_new false
% 1.95/2.29 % --res_prop_simpl_given false
% 1.95/2.29 % --res_passive_queue_type priority_queues
% 1.95/2.29 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.95/2.29 % --res_passive_queues_freq [15;5]
% 1.95/2.29 % --res_forward_subs full
% 1.95/2.29 % --res_backward_subs full
% 1.95/2.29 % --res_forward_subs_resolution true
% 1.95/2.29 % --res_backward_subs_resolution true
% 1.95/2.29 % --res_orphan_elimination false
% 1.95/2.29 % --res_time_limit 1000.
% 1.95/2.29 % --res_out_proof true
% 1.95/2.29 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_bdfb41.s
% 1.95/2.29 % --modulo true
% 1.95/2.29
% 1.95/2.29 % ------ Combination Options
% 1.95/2.29
% 1.95/2.29 % --comb_res_mult 1000
% 1.95/2.29 % --comb_inst_mult 300
% 1.95/2.29 % ------
% 1.95/2.29
% 1.95/2.29 % ------ Parsing...% successful
% 1.95/2.29
% 1.95/2.29 % ------ Preprocessing... gs_s sp: 468 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:128:0s pe_e snvd_s sp: 0 0s snvd_e %
% 1.95/2.29
% 1.95/2.29 % ------ Proving...
% 1.95/2.29 % ------ Problem Properties
% 1.95/2.29
% 1.95/2.29 %
% 1.95/2.29 % EPR true
% 1.95/2.29 % Horn false
% 1.95/2.29 % Has equality false
% 1.95/2.29
% 1.95/2.29 % % ------ Input Options Time Limit: Unbounded
% 1.95/2.29
% 1.95/2.29
% 1.95/2.29 % % ------ Current options:
% 1.95/2.29
% 1.95/2.29 % ------ Input Options
% 1.95/2.29
% 1.95/2.29 % --out_options all
% 1.95/2.29 % --tptp_safe_out true
% 1.95/2.29 % --problem_path ""
% 1.95/2.29 % --include_path ""
% 1.95/2.29 % --clausifier .//eprover
% 1.95/2.29 % --clausifier_options --tstp-format
% 1.95/2.29 % --stdin false
% 1.95/2.29 % --dbg_backtrace false
% 1.95/2.29 % --dbg_dump_prop_clauses false
% 1.95/2.29 % --dbg_dump_prop_clauses_file -
% 1.95/2.29 % --dbg_out_stat false
% 1.95/2.29
% 1.95/2.29 % ------ General Options
% 1.95/2.29
% 1.95/2.29 % --fof false
% 1.95/2.29 % --time_out_real 150.
% 1.95/2.29 % --time_out_prep_mult 0.2
% 1.95/2.29 % --time_out_virtual -1.
% 1.95/2.29 % --schedule none
% 1.95/2.29 % --ground_splitting input
% 1.95/2.29 % --splitting_nvd 16
% 1.95/2.29 % --non_eq_to_eq false
% 1.95/2.29 % --prep_gs_sim true
% 1.95/2.29 % --prep_unflatten false
% 1.95/2.29 % --prep_res_sim true
% 1.95/2.29 % --prep_upred true
% 1.95/2.29 % --res_sim_input true
% 1.95/2.29 % --clause_weak_htbl true
% 1.95/2.29 % --gc_record_bc_elim false
% 1.95/2.29 % --symbol_type_check false
% 1.95/2.29 % --clausify_out false
% 1.95/2.29 % --large_theory_mode false
% 1.95/2.29 % --prep_sem_filter none
% 1.95/2.29 % --prep_sem_filter_out false
% 1.95/2.29 % --preprocessed_out false
% 1.95/2.29 % --sub_typing false
% 1.95/2.29 % --brand_transform false
% 1.95/2.29 % --pure_diseq_elim true
% 1.95/2.29 % --min_unsat_core false
% 1.95/2.29 % --pred_elim true
% 1.95/2.29 % --add_important_lit false
% 1.95/2.29 % --soft_assumptions false
% 1.95/2.29 % --reset_solvers false
% 1.95/2.29 % --bc_imp_inh []
% 1.95/2.29 % --conj_cone_tolerance 1.5
% 1.95/2.29 % --prolific_symb_bound 500
% 1.95/2.29 % --lt_threshold 2000
% 1.95/2.29
% 1.95/2.29 % ------ SAT Options
% 1.95/2.29
% 1.95/2.29 % --sat_mode false
% 1.95/2.29 % --sat_fm_restart_options ""
% 1.95/2.29 % --sat_gr_def false
% 1.95/2.29 % --sat_epr_types true
% 1.95/2.29 % --sat_non_cyclic_types false
% 1.95/2.29 % --sat_finite_models false
% 1.95/2.29 % --sat_fm_lemmas false
% 1.95/2.29 % --sat_fm_prep false
% 1.95/2.29 % --sat_fm_uc_incr true
% 1.95/2.29 % --sat_out_model small
% 1.95/2.29 % --sat_out_clauses false
% 1.95/2.29
% 1.95/2.29 % ------ QBF Options
% 1.95/2.29
% 1.95/2.29 % --qbf_mode false
% 1.95/2.29 % --qbf_elim_univ true
% 1.95/2.29 % --qbf_sk_in true
% 1.95/2.29 % --qbf_pred_elim true
% 1.95/2.29 % --qbf_split 32
% 1.95/2.29
% 1.95/2.29 % ------ BMC1 Options
% 1.95/2.29
% 1.95/2.29 % --bmc1_incremental false
% 1.95/2.29 % --bmc1_axioms reachable_all
% 1.95/2.29 % --bmc1_min_bound 0
% 1.95/2.29 % --bmc1_max_bound -1
% 1.95/2.29 % --bmc1_max_bound_default -1
% 1.95/2.29 % --bmc1_symbol_reachability true
% 1.95/2.29 % --bmc1_property_lemmas false
% 1.95/2.29 % --bmc1_k_induction false
% 1.95/2.29 % --bmc1_non_equiv_states false
% 1.95/2.29 % --bmc1_deadlock false
% 1.95/2.29 % --bmc1_ucm false
% 1.95/2.29 % --bmc1_add_unsat_core none
% 1.95/2.29 % --bmc1_unsat_core_children false
% 1.95/2.29 % --bmc1_unsat_core_extrapolate_axioms false
% 1.95/2.29 % --bmc1_out_stat full
% 1.95/2.29 % --bmc1_ground_init false
% 1.95/2.29 % --bmc1_pre_inst_next_state false
% 1.95/2.29 % --bmc1_pre_inst_state false
% 1.95/2.29 % --bmc1_pre_inst_reach_state false
% 1.95/2.29 % --bmc1_out_unsat_core false
% 1.95/2.29 % --bmc1_aig_witness_out false
% 1.95/2.29 % --bmc1_verbose false
% 1.95/2.29 % --bmc1_dump_clauses_tptp false
% 1.95/2.29 % --bmc1_dump_unsat_core_tptp false
% 1.95/2.29 % --bmc1_dump_file -
% 1.95/2.29 % --bmc1_ucm_expand_uc_limit 128
% 1.95/2.29 % --bmc1_ucm_n_expand_iterations 6
% 1.95/2.29 % --bmc1_ucm_extend_mode 1
% 1.95/2.29 % --bmc1_ucm_init_mode 2
% 1.95/2.29 % --bmc1_ucm_cone_mode none
% 1.95/2.29 % --bmc1_ucm_reduced_relation_type 0
% 1.95/2.29 % --bmc1_ucm_relax_model 4
% 1.95/2.29 % --bmc1_ucm_full_tr_after_sat true
% 1.95/2.29 % --bmc1_ucm_expand_neg_assumptions false
% 1.95/2.29 % --bmc1_ucm_layered_model none
% 1.95/2.29 % --bmc1_ucm_max_lemma_size 10
% 1.95/2.29
% 1.95/2.29 % ------ AIG Options
% 1.95/2.29
% 1.95/2.29 % --aig_mode false
% 1.95/2.29
% 1.95/2.29 % ------ Instantiation Options
% 1.95/2.29
% 1.95/2.29 % --instantiation_flag true
% 1.95/2.29 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.95/2.29 % --inst_solver_per_active 750
% 1.95/2.29 % --inst_solver_calls_frac 0.5
% 1.95/2.29 % --inst_passive_queue_type priority_queues
% 1.95/2.29 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.95/2.29 % --inst_passive_queues_freq [25;2]
% 1.95/2.29 % --inst_dismatching true
% 3.30/3.47 % --inst_eager_unprocessed_to_passive true
% 3.30/3.47 % --inst_prop_sim_given true
% 3.30/3.47 % --inst_prop_sim_new false
% 3.30/3.47 % --inst_orphan_elimination true
% 3.30/3.47 % --inst_learning_loop_flag true
% 3.30/3.47 % --inst_learning_start 3000
% 3.30/3.47 % --inst_learning_factor 2
% 3.30/3.47 % --inst_start_prop_sim_after_learn 3
% 3.30/3.47 % --inst_sel_renew solver
% 3.30/3.47 % --inst_lit_activity_flag true
% 3.30/3.47 % --inst_out_proof true
% 3.30/3.47
% 3.30/3.47 % ------ Resolution Options
% 3.30/3.47
% 3.30/3.47 % --resolution_flag true
% 3.30/3.47 % --res_lit_sel kbo_max
% 3.30/3.47 % --res_to_prop_solver none
% 3.30/3.47 % --res_prop_simpl_new false
% 3.30/3.47 % --res_prop_simpl_given false
% 3.30/3.47 % --res_passive_queue_type priority_queues
% 3.30/3.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.30/3.47 % --res_passive_queues_freq [15;5]
% 3.30/3.47 % --res_forward_subs full
% 3.30/3.47 % --res_backward_subs full
% 3.30/3.47 % --res_forward_subs_resolution true
% 3.30/3.47 % --res_backward_subs_resolution true
% 3.30/3.47 % --res_orphan_elimination false
% 3.30/3.47 % --res_time_limit 1000.
% 3.30/3.47 % --res_out_proof true
% 3.30/3.47 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_bdfb41.s
% 3.30/3.47 % --modulo true
% 3.30/3.47
% 3.30/3.47 % ------ Combination Options
% 3.30/3.47
% 3.30/3.47 % --comb_res_mult 1000
% 3.30/3.47 % --comb_inst_mult 300
% 3.30/3.47 % ------
% 3.30/3.47
% 3.30/3.47
% 3.30/3.47
% 3.30/3.47 % ------ Proving...
% 3.30/3.47 % warning: shown sat in sat incomplete mode
% 3.30/3.47 %
% 3.30/3.47
% 3.30/3.47
% 3.30/3.47 ------ Building Model...Done
% 3.30/3.47
% 3.30/3.47 %------ The model is defined over ground terms (initial term algebra).
% 3.30/3.47 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.30/3.47 %------ where \phi is a formula over the term algebra.
% 3.30/3.47 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.30/3.47 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.30/3.47 %------ See help for --sat_out_model for different model outputs.
% 3.30/3.47 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.30/3.47 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.30/3.47
% 3.30/3.47
% 3.30/3.47
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c5_1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( c5_1(X0) <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c2_2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0,X1] :
% 3.30/3.47 ( c2_2(X0,X1) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a114 & X1=a115 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a9 & X1=a10 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a19 & X1=a20 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a19 & X1=a21 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c1_2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0,X1] :
% 3.30/3.47 ( c1_2(X0,X1) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a66 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c10_1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( c10_1(X0) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a119 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a6 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c1_1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( c1_1(X0) <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c10_2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0,X1] :
% 3.30/3.47 ( c10_2(X0,X1) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a33 & X1=a34 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c3_2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0,X1] :
% 3.30/3.47 ( c3_2(X0,X1) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a45 & X1=a47 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Negative definition of c7_2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0,X1] :
% 3.30/3.47 ( ~(c7_2(X0,X1)) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a37 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a93 & X1=a94 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Negative definition of ndr1_1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( ~(ndr1_1(X0)) <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c5_2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0,X1] :
% 3.30/3.47 ( c5_2(X0,X1) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a9 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a119 & X1=a120 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c8_2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0,X1] :
% 3.30/3.47 ( c8_2(X0,X1) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a29 & X1=a30 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a95 & X1=a96 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a35 & X1=a36 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ndr1_0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ndr1_0 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c4_2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0,X1] :
% 3.30/3.47 ( c4_2(X0,X1) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a71 & X1=a72 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a37 & X1=a38 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a93 & X1=a94 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a90 & X1=a91 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a105 & X1=a106 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c2_1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( c2_1(X0) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a35 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c8_1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( c8_1(X0) <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c5_0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( c5_0 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c6_2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0,X1] :
% 3.30/3.47 ( c6_2(X0,X1) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a37 & X1=a38 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a1 & X1=a2 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a105 & X1=a107 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c3_1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( c3_1(X0) <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c9_2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0,X1] :
% 3.30/3.47 ( c9_2(X0,X1) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a19 & X1=a20 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a45 & X1=a48 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c4_1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( c4_1(X0) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a66 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a95 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c9_1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( c9_1(X0) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a29 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a1 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c7_1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( c7_1(X0) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a19 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a105 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC2 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c6_0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( c6_0 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c10_0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( c10_0 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC9
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC9 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC8
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC8 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c3_0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( c3_0 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Negative definition of c6_1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( ~(c6_1(X0)) <=>
% 3.30/3.47 (
% 3.30/3.47 (
% 3.30/3.47 ( X0=a119 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a6 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a55 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 |
% 3.30/3.47 (
% 3.30/3.47 ( X0=a121 )
% 3.30/3.47 )
% 3.30/3.47
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC27
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC27 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c8_0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( c8_0 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c2_0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( c2_0 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c9_0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( c9_0 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC10
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC10 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c4_0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( c4_0 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC19
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC19 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC3
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC3 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC17
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC17 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c1_0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( c1_0 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC16
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC16 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC14
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC14 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkP2
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( ssSkP2(X0) <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of c7_0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( c7_0 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC23
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC23 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC12
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC12 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC4
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC4 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC18
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC18 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC21
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC21 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC13
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC13 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC6
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC6 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkP3
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( ssSkP3(X0) <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC22
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC22 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC30
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC30 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC11
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC11 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkP0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( ssSkP0(X0) <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC20
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC20 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkP4
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( ssSkP4(X0) <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC28
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC28 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC15
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC15 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkP7
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( ssSkP7(X0) <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkP6
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( ssSkP6(X0) <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC24
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC24 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkP5
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( ssSkP5(X0) <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC29
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC29 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkP1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 (! [X0] :
% 3.30/3.47 ( ssSkP1(X0) <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC0
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC0 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC5
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC5 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC7
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC7 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC1
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC1 <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of ssSkC26
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( ssSkC26 <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP0_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP0_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP2_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP2_iProver_split <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP3_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP3_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP32_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP32_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP36_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP36_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP37_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP37_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP44_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP44_iProver_split <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP46_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP46_iProver_split <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP100_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP100_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP108_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP108_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP112_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP112_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP115_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP115_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP139_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP139_iProver_split <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP141_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP141_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP147_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP147_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP161_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP161_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP167_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP167_iProver_split <=>
% 3.30/3.47 $true
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP169_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP169_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP172_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP172_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP174_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP174_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47 %------ Positive definition of sP175_iProver_split
% 3.30/3.47 fof(lit_def,axiom,
% 3.30/3.47 ( sP175_iProver_split <=>
% 3.30/3.47 $false
% 3.30/3.47 )
% 3.30/3.47 ).
% 3.30/3.47
% 3.30/3.47
% 3.30/3.47
% 3.30/3.47 % ------ Statistics
% 3.30/3.47
% 3.30/3.47 % ------ General
% 3.30/3.47
% 3.30/3.47 % num_of_input_clauses: 504
% 3.30/3.47 % num_of_input_neg_conjectures: 504
% 3.30/3.47 % num_of_splits: 468
% 3.30/3.47 % num_of_split_atoms: 176
% 3.30/3.47 % num_of_sem_filtered_clauses: 0
% 3.30/3.47 % num_of_subtypes: 0
% 3.30/3.47 % monotx_restored_types: 0
% 3.30/3.47 % sat_num_of_epr_types: 0
% 3.30/3.47 % sat_num_of_non_cyclic_types: 0
% 3.30/3.47 % sat_guarded_non_collapsed_types: 0
% 3.30/3.47 % is_epr: 1
% 3.30/3.47 % is_horn: 0
% 3.30/3.47 % has_eq: 0
% 3.30/3.47 % num_pure_diseq_elim: 0
% 3.30/3.47 % simp_replaced_by: 0
% 3.30/3.47 % res_preprocessed: 1476
% 3.30/3.47 % prep_upred: 0
% 3.30/3.47 % prep_unflattend: 0
% 3.30/3.47 % pred_elim_cands: 176
% 3.30/3.47 % pred_elim: 155
% 3.30/3.47 % pred_elim_cl: 160
% 3.30/3.47 % pred_elim_cycles: 176
% 3.30/3.47 % forced_gc_time: 0
% 3.30/3.47 % gc_basic_clause_elim: 0
% 3.30/3.47 % parsing_time: 0.008
% 3.30/3.47 % sem_filter_time: 0.
% 3.30/3.47 % pred_elim_time: 0.104
% 3.30/3.47 % out_proof_time: 0.
% 3.30/3.47 % monotx_time: 0.
% 3.30/3.47 % subtype_inf_time: 0.
% 3.30/3.47 % unif_index_cands_time: 0.004
% 3.30/3.47 % unif_index_add_time: 0.003
% 3.30/3.47 % total_time: 1.354
% 3.30/3.47 % num_of_symbols: 418
% 3.30/3.47 % num_of_terms: 11942
% 3.30/3.47
% 3.30/3.47 % ------ Propositional Solver
% 3.30/3.47
% 3.30/3.47 % prop_solver_calls: 4
% 3.30/3.47 % prop_fast_solver_calls: 10090
% 3.30/3.47 % prop_num_of_clauses: 1939
% 3.30/3.47 % prop_preprocess_simplified: 10272
% 3.30/3.47 % prop_fo_subsumed: 535
% 3.30/3.47 % prop_solver_time: 0.
% 3.30/3.47 % prop_fast_solver_time: 0.006
% 3.30/3.47 % prop_unsat_core_time: 0.
% 3.30/3.47
% 3.30/3.47 % ------ QBF
% 3.30/3.47
% 3.30/3.47 % qbf_q_res: 0
% 3.30/3.47 % qbf_num_tautologies: 0
% 3.30/3.47 % qbf_prep_cycles: 0
% 3.30/3.47
% 3.30/3.47 % ------ BMC1
% 3.30/3.47
% 3.30/3.47 % bmc1_current_bound: -1
% 3.30/3.47 % bmc1_last_solved_bound: -1
% 3.30/3.47 % bmc1_unsat_core_size: -1
% 3.30/3.47 % bmc1_unsat_core_parents_size: -1
% 3.30/3.47 % bmc1_merge_next_fun: 0
% 3.30/3.47 % bmc1_unsat_core_clauses_time: 0.
% 3.30/3.47
% 3.30/3.47 % ------ Instantiation
% 3.30/3.47
% 3.30/3.47 % inst_num_of_clauses: 556
% 3.30/3.47 % inst_num_in_passive: 0
% 3.30/3.47 % inst_num_in_active: 556
% 3.30/3.47 % inst_num_in_unprocessed: 0
% 3.30/3.47 % inst_num_of_loops: 583
% 3.30/3.47 % inst_num_of_learning_restarts: 0
% 3.30/3.47 % inst_num_moves_active_passive: 23
% 3.30/3.47 % inst_lit_activity: 60
% 3.30/3.47 % inst_lit_activity_moves: 0
% 3.30/3.47 % inst_num_tautologies: 0
% 3.30/3.47 % inst_num_prop_implied: 0
% 3.30/3.47 % inst_num_existing_simplified: 0
% 3.30/3.47 % inst_num_eq_res_simplified: 0
% 3.30/3.47 % inst_num_child_elim: 0
% 3.30/3.47 % inst_num_of_dismatching_blockings: 0
% 3.30/3.47 % inst_num_of_non_proper_insts: 38
% 3.30/3.47 % inst_num_of_duplicates: 0
% 3.30/3.47 % inst_inst_num_from_inst_to_res: 0
% 3.30/3.47 % inst_dismatching_checking_time: 0.
% 3.30/3.47
% 3.30/3.47 % ------ Resolution
% 3.30/3.47
% 3.30/3.47 % res_num_of_clauses: 9057
% 3.30/3.47 % res_num_in_passive: 7435
% 3.30/3.47 % res_num_in_active: 1621
% 3.30/3.47 % res_num_of_loops: 2000
% 3.30/3.47 % res_forward_subset_subsumed: 206
% 3.30/3.47 % res_backward_subset_subsumed: 0
% 3.30/3.47 % res_forward_subsumed: 378
% 3.30/3.47 % res_backward_subsumed: 1
% 3.30/3.47 % res_forward_subsumption_resolution: 912
% 3.30/3.47 % res_backward_subsumption_resolution: 0
% 3.30/3.47 % res_clause_to_clause_subsumption: 3587
% 3.30/3.47 % res_orphan_elimination: 0
% 3.30/3.47 % res_tautology_del: 2393
% 3.30/3.47 % res_num_eq_res_simplified: 0
% 3.30/3.47 % res_num_sel_changes: 0
% 3.30/3.47 % res_moves_from_active_to_pass: 0
% 3.30/3.47
% 3.30/3.47 % Status Unknown
% 3.30/3.47 % Last status :
% 3.30/3.47 % SZS status Unknown
%------------------------------------------------------------------------------