TSTP Solution File: SYN422-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN422-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n023.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:40 EDT 2022
% Result : Unknown 11.11s 11.28s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN422-1 : TPTP v8.1.0. Released v2.1.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n023.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 00:46:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.46 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.46 % Orientation found
% 0.20/0.46 % 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_01060a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_af9742.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_0010da | grep -v "SZS"
% 0.20/0.48
% 0.20/0.48 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.48
% 0.20/0.48 %
% 0.20/0.48 % ------ iProver source info
% 0.20/0.48
% 0.20/0.48 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.48 % git: non_committed_changes: true
% 0.20/0.48 % git: last_make_outside_of_git: true
% 0.20/0.48
% 0.20/0.48 %
% 0.20/0.48 % ------ Input Options
% 0.20/0.48
% 0.20/0.48 % --out_options all
% 0.20/0.48 % --tptp_safe_out true
% 0.20/0.48 % --problem_path ""
% 0.20/0.48 % --include_path ""
% 0.20/0.48 % --clausifier .//eprover
% 0.20/0.48 % --clausifier_options --tstp-format
% 0.20/0.48 % --stdin false
% 0.20/0.48 % --dbg_backtrace false
% 0.20/0.48 % --dbg_dump_prop_clauses false
% 0.20/0.48 % --dbg_dump_prop_clauses_file -
% 0.20/0.48 % --dbg_out_stat false
% 0.20/0.48
% 0.20/0.48 % ------ General Options
% 0.20/0.48
% 0.20/0.48 % --fof false
% 0.20/0.48 % --time_out_real 150.
% 0.20/0.48 % --time_out_prep_mult 0.2
% 0.20/0.48 % --time_out_virtual -1.
% 0.20/0.48 % --schedule none
% 0.20/0.48 % --ground_splitting input
% 0.20/0.48 % --splitting_nvd 16
% 0.20/0.48 % --non_eq_to_eq false
% 0.20/0.48 % --prep_gs_sim true
% 0.20/0.48 % --prep_unflatten false
% 0.20/0.48 % --prep_res_sim true
% 0.20/0.48 % --prep_upred true
% 0.20/0.48 % --res_sim_input true
% 0.20/0.48 % --clause_weak_htbl true
% 0.20/0.48 % --gc_record_bc_elim false
% 0.20/0.48 % --symbol_type_check false
% 0.20/0.48 % --clausify_out false
% 0.20/0.48 % --large_theory_mode false
% 0.20/0.48 % --prep_sem_filter none
% 0.20/0.48 % --prep_sem_filter_out false
% 0.20/0.48 % --preprocessed_out false
% 0.20/0.48 % --sub_typing false
% 0.20/0.48 % --brand_transform false
% 0.20/0.48 % --pure_diseq_elim true
% 0.20/0.48 % --min_unsat_core false
% 0.20/0.48 % --pred_elim true
% 0.20/0.48 % --add_important_lit false
% 0.20/0.48 % --soft_assumptions false
% 0.20/0.48 % --reset_solvers false
% 0.20/0.48 % --bc_imp_inh []
% 0.20/0.48 % --conj_cone_tolerance 1.5
% 0.20/0.48 % --prolific_symb_bound 500
% 0.20/0.48 % --lt_threshold 2000
% 0.20/0.48
% 0.20/0.48 % ------ SAT Options
% 0.20/0.48
% 0.20/0.48 % --sat_mode false
% 0.20/0.48 % --sat_fm_restart_options ""
% 0.20/0.48 % --sat_gr_def false
% 0.20/0.48 % --sat_epr_types true
% 0.20/0.48 % --sat_non_cyclic_types false
% 0.20/0.48 % --sat_finite_models false
% 0.20/0.48 % --sat_fm_lemmas false
% 0.20/0.48 % --sat_fm_prep false
% 0.20/0.48 % --sat_fm_uc_incr true
% 0.20/0.48 % --sat_out_model small
% 0.20/0.48 % --sat_out_clauses false
% 0.20/0.48
% 0.20/0.48 % ------ QBF Options
% 0.20/0.48
% 0.20/0.48 % --qbf_mode false
% 0.20/0.48 % --qbf_elim_univ true
% 0.20/0.48 % --qbf_sk_in true
% 0.20/0.48 % --qbf_pred_elim true
% 0.20/0.48 % --qbf_split 32
% 0.20/0.48
% 0.20/0.48 % ------ BMC1 Options
% 0.20/0.48
% 0.20/0.48 % --bmc1_incremental false
% 0.20/0.48 % --bmc1_axioms reachable_all
% 0.20/0.48 % --bmc1_min_bound 0
% 0.20/0.48 % --bmc1_max_bound -1
% 0.20/0.48 % --bmc1_max_bound_default -1
% 0.20/0.48 % --bmc1_symbol_reachability true
% 0.20/0.48 % --bmc1_property_lemmas false
% 0.20/0.48 % --bmc1_k_induction false
% 0.20/0.48 % --bmc1_non_equiv_states false
% 0.20/0.48 % --bmc1_deadlock false
% 0.20/0.48 % --bmc1_ucm false
% 0.20/0.48 % --bmc1_add_unsat_core none
% 0.20/0.48 % --bmc1_unsat_core_children false
% 0.20/0.48 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.48 % --bmc1_out_stat full
% 0.20/0.48 % --bmc1_ground_init false
% 0.20/0.48 % --bmc1_pre_inst_next_state false
% 0.20/0.48 % --bmc1_pre_inst_state false
% 0.20/0.48 % --bmc1_pre_inst_reach_state false
% 0.20/0.48 % --bmc1_out_unsat_core false
% 0.20/0.48 % --bmc1_aig_witness_out false
% 0.20/0.48 % --bmc1_verbose false
% 0.20/0.48 % --bmc1_dump_clauses_tptp false
% 0.59/0.76 % --bmc1_dump_unsat_core_tptp false
% 0.59/0.76 % --bmc1_dump_file -
% 0.59/0.76 % --bmc1_ucm_expand_uc_limit 128
% 0.59/0.76 % --bmc1_ucm_n_expand_iterations 6
% 0.59/0.76 % --bmc1_ucm_extend_mode 1
% 0.59/0.76 % --bmc1_ucm_init_mode 2
% 0.59/0.76 % --bmc1_ucm_cone_mode none
% 0.59/0.76 % --bmc1_ucm_reduced_relation_type 0
% 0.59/0.76 % --bmc1_ucm_relax_model 4
% 0.59/0.76 % --bmc1_ucm_full_tr_after_sat true
% 0.59/0.76 % --bmc1_ucm_expand_neg_assumptions false
% 0.59/0.76 % --bmc1_ucm_layered_model none
% 0.59/0.76 % --bmc1_ucm_max_lemma_size 10
% 0.59/0.76
% 0.59/0.76 % ------ AIG Options
% 0.59/0.76
% 0.59/0.76 % --aig_mode false
% 0.59/0.76
% 0.59/0.76 % ------ Instantiation Options
% 0.59/0.76
% 0.59/0.76 % --instantiation_flag true
% 0.59/0.76 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.59/0.76 % --inst_solver_per_active 750
% 0.59/0.76 % --inst_solver_calls_frac 0.5
% 0.59/0.76 % --inst_passive_queue_type priority_queues
% 0.59/0.76 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.59/0.76 % --inst_passive_queues_freq [25;2]
% 0.59/0.76 % --inst_dismatching true
% 0.59/0.76 % --inst_eager_unprocessed_to_passive true
% 0.59/0.76 % --inst_prop_sim_given true
% 0.59/0.76 % --inst_prop_sim_new false
% 0.59/0.76 % --inst_orphan_elimination true
% 0.59/0.76 % --inst_learning_loop_flag true
% 0.59/0.76 % --inst_learning_start 3000
% 0.59/0.76 % --inst_learning_factor 2
% 0.59/0.76 % --inst_start_prop_sim_after_learn 3
% 0.59/0.76 % --inst_sel_renew solver
% 0.59/0.76 % --inst_lit_activity_flag true
% 0.59/0.76 % --inst_out_proof true
% 0.59/0.76
% 0.59/0.76 % ------ Resolution Options
% 0.59/0.76
% 0.59/0.76 % --resolution_flag true
% 0.59/0.76 % --res_lit_sel kbo_max
% 0.59/0.76 % --res_to_prop_solver none
% 0.59/0.76 % --res_prop_simpl_new false
% 0.59/0.76 % --res_prop_simpl_given false
% 0.59/0.76 % --res_passive_queue_type priority_queues
% 0.59/0.76 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.59/0.76 % --res_passive_queues_freq [15;5]
% 0.59/0.76 % --res_forward_subs full
% 0.59/0.76 % --res_backward_subs full
% 0.59/0.76 % --res_forward_subs_resolution true
% 0.59/0.76 % --res_backward_subs_resolution true
% 0.59/0.76 % --res_orphan_elimination false
% 0.59/0.76 % --res_time_limit 1000.
% 0.59/0.76 % --res_out_proof true
% 0.59/0.76 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_01060a.s
% 0.59/0.76 % --modulo true
% 0.59/0.76
% 0.59/0.76 % ------ Combination Options
% 0.59/0.76
% 0.59/0.76 % --comb_res_mult 1000
% 0.59/0.76 % --comb_inst_mult 300
% 0.59/0.76 % ------
% 0.59/0.76
% 0.59/0.76 % ------ Parsing...% successful
% 0.59/0.76
% 0.59/0.76 % ------ Preprocessing... gs_s sp: 508 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.59/0.76
% 0.59/0.76 % ------ Proving...
% 0.59/0.76 % ------ Problem Properties
% 0.59/0.76
% 0.59/0.76 %
% 0.59/0.76 % EPR true
% 0.59/0.76 % Horn false
% 0.59/0.76 % Has equality false
% 0.59/0.76
% 0.59/0.76 % % ------ Input Options Time Limit: Unbounded
% 0.59/0.76
% 0.59/0.76
% 0.59/0.76 % % ------ Current options:
% 0.59/0.76
% 0.59/0.76 % ------ Input Options
% 0.59/0.76
% 0.59/0.76 % --out_options all
% 0.59/0.76 % --tptp_safe_out true
% 0.59/0.76 % --problem_path ""
% 0.59/0.76 % --include_path ""
% 0.59/0.76 % --clausifier .//eprover
% 0.59/0.76 % --clausifier_options --tstp-format
% 0.59/0.76 % --stdin false
% 0.59/0.76 % --dbg_backtrace false
% 0.59/0.76 % --dbg_dump_prop_clauses false
% 0.59/0.76 % --dbg_dump_prop_clauses_file -
% 0.59/0.76 % --dbg_out_stat false
% 0.59/0.76
% 0.59/0.76 % ------ General Options
% 0.59/0.76
% 0.59/0.76 % --fof false
% 0.59/0.76 % --time_out_real 150.
% 0.59/0.76 % --time_out_prep_mult 0.2
% 0.59/0.76 % --time_out_virtual -1.
% 0.59/0.76 % --schedule none
% 0.59/0.76 % --ground_splitting input
% 0.59/0.76 % --splitting_nvd 16
% 0.59/0.76 % --non_eq_to_eq false
% 0.59/0.76 % --prep_gs_sim true
% 0.59/0.76 % --prep_unflatten false
% 0.59/0.76 % --prep_res_sim true
% 0.59/0.76 % --prep_upred true
% 0.59/0.76 % --res_sim_input true
% 0.59/0.76 % --clause_weak_htbl true
% 0.59/0.76 % --gc_record_bc_elim false
% 0.59/0.76 % --symbol_type_check false
% 0.59/0.76 % --clausify_out false
% 0.59/0.76 % --large_theory_mode false
% 0.59/0.76 % --prep_sem_filter none
% 0.59/0.76 % --prep_sem_filter_out false
% 0.59/0.76 % --preprocessed_out false
% 0.59/0.76 % --sub_typing false
% 0.59/0.76 % --brand_transform false
% 0.59/0.76 % --pure_diseq_elim true
% 0.59/0.76 % --min_unsat_core false
% 0.59/0.76 % --pred_elim true
% 0.59/0.76 % --add_important_lit false
% 0.59/0.76 % --soft_assumptions false
% 0.59/0.76 % --reset_solvers false
% 0.59/0.76 % --bc_imp_inh []
% 0.59/0.76 % --conj_cone_tolerance 1.5
% 0.59/0.76 % --prolific_symb_bound 500
% 0.59/0.76 % --lt_threshold 2000
% 0.59/0.76
% 0.59/0.76 % ------ SAT Options
% 0.59/0.76
% 0.59/0.76 % --sat_mode false
% 0.59/0.76 % --sat_fm_restart_options ""
% 0.59/0.76 % --sat_gr_def false
% 0.59/0.76 % --sat_epr_types true
% 0.59/0.76 % --sat_non_cyclic_types false
% 0.59/0.76 % --sat_finite_models false
% 0.59/0.76 % --sat_fm_lemmas false
% 0.59/0.76 % --sat_fm_prep false
% 0.59/0.76 % --sat_fm_uc_incr true
% 0.59/0.76 % --sat_out_model small
% 0.59/0.76 % --sat_out_clauses false
% 0.59/0.76
% 0.59/0.76 % ------ QBF Options
% 0.59/0.76
% 0.59/0.76 % --qbf_mode false
% 0.59/0.76 % --qbf_elim_univ true
% 0.59/0.76 % --qbf_sk_in true
% 0.59/0.76 % --qbf_pred_elim true
% 0.59/0.76 % --qbf_split 32
% 0.59/0.76
% 0.59/0.76 % ------ BMC1 Options
% 0.59/0.76
% 0.59/0.76 % --bmc1_incremental false
% 0.59/0.76 % --bmc1_axioms reachable_all
% 0.59/0.76 % --bmc1_min_bound 0
% 0.59/0.76 % --bmc1_max_bound -1
% 0.59/0.76 % --bmc1_max_bound_default -1
% 0.59/0.76 % --bmc1_symbol_reachability true
% 0.59/0.76 % --bmc1_property_lemmas false
% 0.59/0.76 % --bmc1_k_induction false
% 0.59/0.76 % --bmc1_non_equiv_states false
% 0.59/0.76 % --bmc1_deadlock false
% 0.59/0.76 % --bmc1_ucm false
% 0.59/0.76 % --bmc1_add_unsat_core none
% 0.59/0.76 % --bmc1_unsat_core_children false
% 0.59/0.76 % --bmc1_unsat_core_extrapolate_axioms false
% 0.59/0.76 % --bmc1_out_stat full
% 0.59/0.76 % --bmc1_ground_init false
% 0.59/0.76 % --bmc1_pre_inst_next_state false
% 0.59/0.76 % --bmc1_pre_inst_state false
% 0.59/0.76 % --bmc1_pre_inst_reach_state false
% 0.59/0.76 % --bmc1_out_unsat_core false
% 0.59/0.76 % --bmc1_aig_witness_out false
% 0.59/0.76 % --bmc1_verbose false
% 0.59/0.76 % --bmc1_dump_clauses_tptp false
% 0.59/0.76 % --bmc1_dump_unsat_core_tptp false
% 0.59/0.76 % --bmc1_dump_file -
% 0.59/0.76 % --bmc1_ucm_expand_uc_limit 128
% 0.59/0.76 % --bmc1_ucm_n_expand_iterations 6
% 0.59/0.76 % --bmc1_ucm_extend_mode 1
% 0.59/0.76 % --bmc1_ucm_init_mode 2
% 0.59/0.76 % --bmc1_ucm_cone_mode none
% 0.59/0.76 % --bmc1_ucm_reduced_relation_type 0
% 0.59/0.76 % --bmc1_ucm_relax_model 4
% 0.59/0.76 % --bmc1_ucm_full_tr_after_sat true
% 0.59/0.76 % --bmc1_ucm_expand_neg_assumptions false
% 0.59/0.76 % --bmc1_ucm_layered_model none
% 0.59/0.76 % --bmc1_ucm_max_lemma_size 10
% 0.59/0.76
% 0.59/0.76 % ------ AIG Options
% 0.59/0.76
% 0.59/0.76 % --aig_mode false
% 0.59/0.76
% 0.59/0.76 % ------ Instantiation Options
% 0.59/0.76
% 0.59/0.76 % --instantiation_flag true
% 0.59/0.76 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.59/0.76 % --inst_solver_per_active 750
% 0.59/0.76 % --inst_solver_calls_frac 0.5
% 0.59/0.76 % --inst_passive_queue_type priority_queues
% 0.59/0.76 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.59/0.76 % --inst_passive_queues_freq [25;2]
% 0.59/0.76 % --inst_dismatching true
% 5.68/5.87 % --inst_eager_unprocessed_to_passive true
% 5.68/5.87 % --inst_prop_sim_given true
% 5.68/5.87 % --inst_prop_sim_new false
% 5.68/5.87 % --inst_orphan_elimination true
% 5.68/5.87 % --inst_learning_loop_flag true
% 5.68/5.87 % --inst_learning_start 3000
% 5.68/5.87 % --inst_learning_factor 2
% 5.68/5.87 % --inst_start_prop_sim_after_learn 3
% 5.68/5.87 % --inst_sel_renew solver
% 5.68/5.87 % --inst_lit_activity_flag true
% 5.68/5.87 % --inst_out_proof true
% 5.68/5.87
% 5.68/5.87 % ------ Resolution Options
% 5.68/5.87
% 5.68/5.87 % --resolution_flag true
% 5.68/5.87 % --res_lit_sel kbo_max
% 5.68/5.87 % --res_to_prop_solver none
% 5.68/5.87 % --res_prop_simpl_new false
% 5.68/5.87 % --res_prop_simpl_given false
% 5.68/5.87 % --res_passive_queue_type priority_queues
% 5.68/5.87 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 5.68/5.87 % --res_passive_queues_freq [15;5]
% 5.68/5.87 % --res_forward_subs full
% 5.68/5.87 % --res_backward_subs full
% 5.68/5.87 % --res_forward_subs_resolution true
% 5.68/5.87 % --res_backward_subs_resolution true
% 5.68/5.87 % --res_orphan_elimination false
% 5.68/5.87 % --res_time_limit 1000.
% 5.68/5.87 % --res_out_proof true
% 5.68/5.87 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_01060a.s
% 5.68/5.87 % --modulo true
% 5.68/5.87
% 5.68/5.87 % ------ Combination Options
% 5.68/5.87
% 5.68/5.87 % --comb_res_mult 1000
% 5.68/5.87 % --comb_inst_mult 300
% 5.68/5.87 % ------
% 5.68/5.87
% 5.68/5.87
% 5.68/5.87
% 5.68/5.87 % ------ Proving...
% 5.68/5.87 % warning: shown sat in sat incomplete mode
% 5.68/5.87 %
% 5.68/5.87
% 5.68/5.87
% 5.68/5.87 ------ Building Model...Done
% 5.68/5.87
% 5.68/5.87 %------ The model is defined over ground terms (initial term algebra).
% 5.68/5.87 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 5.68/5.87 %------ where \phi is a formula over the term algebra.
% 5.68/5.87 %------ If we have equality in the problem then it is also defined as a predicate above,
% 5.68/5.87 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 5.68/5.87 %------ See help for --sat_out_model for different model outputs.
% 5.68/5.87 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 5.68/5.87 %------ where the first argument stands for the sort ($i in the unsorted case)
% 5.68/5.87
% 5.68/5.87
% 5.68/5.87
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c9_0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( c9_0 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c6_2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0,X1] :
% 5.68/5.87 ( c6_2(X0,X1) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a655 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a759 & X1=a684 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a669 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a669 & X1=a749 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a622 & X1=a623 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a656 & X1=a657 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X1=a684 )
% 5.68/5.87 &
% 5.68/5.87 ( X0!=a709 )
% 5.68/5.87 &
% 5.68/5.87 ( X0!=a733 )
% 5.68/5.87 &
% 5.68/5.87 ( X0!=a759 )
% 5.68/5.87 &
% 5.68/5.87 ( X0!=a707 )
% 5.68/5.87 &
% 5.68/5.87 ( X0!=a670 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Negative definition of c1_2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0,X1] :
% 5.68/5.87 ( ~(c1_2(X0,X1)) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a639 & X1=a640 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a759 & X1=a760 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a756 )
% 5.68/5.87 &
% 5.68/5.87 ( X1!=a684 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a686 & X1=a687 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a741 & X1=a742 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c9_2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0,X1] :
% 5.68/5.87 ( c9_2(X0,X1) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a709 & X1=a710 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a633 & X1=a634 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Negative definition of c7_2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0,X1] :
% 5.68/5.87 ( ~(c7_2(X0,X1)) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a690 & X1=a752 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a690 & X1=a718 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X1=a752 )
% 5.68/5.87 &
% 5.68/5.87 ( X0!=a690 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X1=a718 )
% 5.68/5.87 &
% 5.68/5.87 ( X0!=a690 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c4_2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0,X1] :
% 5.68/5.87 ( c4_2(X0,X1) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a669 )
% 5.68/5.87 &
% 5.68/5.87 ( X1!=a726 )
% 5.68/5.87 &
% 5.68/5.87 ( X1!=a752 )
% 5.68/5.87 &
% 5.68/5.87 ( X1!=a712 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a686 & X1=a687 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a686 & X1=a688 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Negative definition of ndr1_1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ~(ndr1_1(X0)) <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c3_2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0,X1] :
% 5.68/5.87 ( c3_2(X0,X1) <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ndr1_0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ndr1_0 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c5_1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( c5_1(X0) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a617 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a660 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c10_2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0,X1] :
% 5.68/5.87 ( c10_2(X0,X1) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a741 & X1=a742 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c5_2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0,X1] :
% 5.68/5.87 ( c5_2(X0,X1) <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Negative definition of c8_1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ~(c8_1(X0)) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a639 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a709 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a633 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a733 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a759 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a707 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a622 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a609 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a670 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c5_0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( c5_0 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c7_1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( c7_1(X0) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a658 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a663 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a656 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Negative definition of c2_2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0,X1] :
% 5.68/5.87 ( ~(c2_2(X0,X1)) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a733 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c8_2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0,X1] :
% 5.68/5.87 ( c8_2(X0,X1) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a639 & X1=a640 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X1=a712 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c3_0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( c3_0 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c3_1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( c3_1(X0) <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Negative definition of c4_1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ~(c4_1(X0)) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a733 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkP0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ssSkP0(X0) <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c2_0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( c2_0 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c10_1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( c10_1(X0) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a633 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c2_1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( c2_1(X0) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a690 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a655 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a698 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c1_0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( c1_0 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Negative definition of c1_1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ~(c1_1(X0)) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a696 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a721 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC19
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC19 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC9
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC9 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c8_0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( c8_0 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC0 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c9_1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( c9_1(X0) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a698 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a617 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a670 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c4_0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( c4_0 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c7_0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( c7_0 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c6_1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( c6_1(X0) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a756 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkP7
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ssSkP7(X0) <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c10_0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( c10_0 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC26
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC26 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of c6_0
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( c6_0 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC12
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC12 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC32
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC32 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Negative definition of ssSkP11
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ~(ssSkP11(X0)) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a669 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC6
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC6 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC22
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC22 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC31
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC31 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC33
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC33 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC25
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC25 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC15
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC15 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC7
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC7 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC20
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC20 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC2 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC18
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC18 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC28
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC28 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC17
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC17 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC10
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC10 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC13
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC13 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC14
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC14 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC21
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC21 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC3
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC3 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkP4
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ssSkP4(X0) <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC34
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC34 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC1 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkP3
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ssSkP3(X0) <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkP2
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ssSkP2(X0) <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkP5
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ssSkP5(X0) <=>
% 5.68/5.87 (
% 5.68/5.87 (
% 5.68/5.87 ( X0=a709 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a733 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a707 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 |
% 5.68/5.87 (
% 5.68/5.87 ( X0=a670 )
% 5.68/5.87 )
% 5.68/5.87
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC11
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC11 <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkP1
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ssSkP1(X0) <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC5
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC5 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC23
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC23 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Negative definition of ssSkP9
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ~(ssSkP9(X0)) <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC4
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC4 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC24
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC24 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkP6
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 (! [X0] :
% 5.68/5.87 ( ssSkP6(X0) <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC8
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC8 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC27
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC27 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC29
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC29 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC16
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC16 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of ssSkC35
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( ssSkC35 <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP6_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP6_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP23_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP23_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP49_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP49_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP104_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP104_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP106_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP106_iProver_split <=>
% 5.68/5.87 $true
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP107_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP107_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP109_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP109_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP112_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP112_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP119_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP119_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP146_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP146_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP153_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP153_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP163_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP163_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP168_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP168_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP169_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP169_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP174_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP174_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP181_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP181_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP183_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP183_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP186_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP186_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87 %------ Positive definition of sP192_iProver_split
% 5.68/5.87 fof(lit_def,axiom,
% 5.68/5.87 ( sP192_iProver_split <=>
% 5.68/5.87 $false
% 5.68/5.87 )
% 5.68/5.87 ).
% 5.68/5.87
% 5.68/5.87
% 5.68/5.87
% 5.68/5.87 % ------ Statistics
% 5.68/5.87
% 5.68/5.87 % ------ General
% 5.68/5.87
% 5.68/5.87 % num_of_input_clauses: 529
% 5.68/5.87 % num_of_input_neg_conjectures: 529
% 5.68/5.87 % num_of_splits: 508
% 5.68/5.87 % num_of_split_atoms: 195
% 5.68/5.87 % num_of_sem_filtered_clauses: 0
% 5.68/5.87 % num_of_subtypes: 0
% 5.68/5.87 % monotx_restored_types: 0
% 5.68/5.87 % sat_num_of_epr_types: 0
% 5.68/5.87 % sat_num_of_non_cyclic_types: 0
% 5.68/5.87 % sat_guarded_non_collapsed_types: 0
% 5.68/5.87 % is_epr: 1
% 5.68/5.87 % is_horn: 0
% 5.68/5.87 % has_eq: 0
% 5.68/5.87 % num_pure_diseq_elim: 0
% 5.68/5.87 % simp_replaced_by: 0
% 5.68/5.87 % res_preprocessed: 1566
% 5.68/5.87 % prep_upred: 0
% 5.68/5.87 % prep_unflattend: 0
% 5.68/5.87 % pred_elim_cands: 195
% 5.68/5.87 % pred_elim: 176
% 5.68/5.87 % pred_elim_cl: 184
% 5.68/5.87 % pred_elim_cycles: 195
% 5.68/5.87 % forced_gc_time: 0
% 5.68/5.87 % gc_basic_clause_elim: 0
% 5.68/5.87 % parsing_time: 0.02
% 5.68/5.87 % sem_filter_time: 0.
% 5.68/5.87 % pred_elim_time: 0.15
% 5.68/5.87 % out_proof_time: 0.
% 5.68/5.87 % monotx_time: 0.
% 5.68/5.87 % subtype_inf_time: 0.
% 5.68/5.87 % unif_index_cands_time: 0.011
% 5.68/5.87 % unif_index_add_time: 0.007
% 5.68/5.87 % total_time: 5.407
% 5.68/5.87 % num_of_symbols: 452
% 5.68/5.87 % num_of_terms: 18698
% 5.68/5.87
% 5.68/5.87 % ------ Propositional Solver
% 5.68/5.87
% 5.68/5.87 % prop_solver_calls: 7
% 5.68/5.87 % prop_fast_solver_calls: 11222
% 5.68/5.87 % prop_num_of_clauses: 2457
% 5.68/5.87 % prop_preprocess_simplified: 11432
% 5.68/5.87 % prop_fo_subsumed: 669
% 5.68/5.87 % prop_solver_time: 0.
% 5.68/5.87 % prop_fast_solver_time: 0.013
% 5.68/5.87 % prop_unsat_core_time: 0.
% 5.68/5.87
% 5.68/5.87 % ------ QBF
% 5.68/5.87
% 5.68/5.87 % qbf_q_res: 0
% 5.68/5.87 % qbf_num_tautologies: 0
% 5.68/5.87 % qbf_prep_cycles: 0
% 5.68/5.87
% 5.68/5.87 % ------ BMC1
% 5.68/5.87
% 5.68/5.87 % bmc1_current_bound: -1
% 5.68/5.87 % bmc1_last_solved_bound: -1
% 5.68/5.87 % bmc1_unsat_core_size: -1
% 5.68/5.87 % bmc1_unsat_core_parents_size: -1
% 5.68/5.87 % bmc1_merge_next_fun: 0
% 5.68/5.87 % bmc1_unsat_core_clauses_time: 0.
% 5.68/5.87
% 5.68/5.87 % ------ Instantiation
% 5.68/5.87
% 5.68/5.87 % inst_num_of_clauses: 853
% 5.68/5.87 % inst_num_in_passive: 0
% 5.68/5.87 % inst_num_in_active: 853
% 5.68/5.87 % inst_num_in_unprocessed: 0
% 5.68/5.87 % inst_num_of_loops: 970
% 5.68/5.87 % inst_num_of_learning_restarts: 0
% 5.68/5.87 % inst_num_moves_active_passive: 110
% 5.68/5.87 % inst_lit_activity: 246
% 5.68/5.88 % inst_lit_activity_moves: 0
% 5.68/5.88 % inst_num_tautologies: 0
% 5.68/5.88 % inst_num_prop_implied: 0
% 5.68/5.88 % inst_num_existing_simplified: 0
% 5.68/5.88 % inst_num_eq_res_simplified: 0
% 5.68/5.88 % inst_num_child_elim: 0
% 5.68/5.88 % inst_num_of_dismatching_blockings: 2
% 5.68/5.88 % inst_num_of_non_proper_insts: 160
% 5.68/5.88 % inst_num_of_duplicates: 17
% 5.68/5.88 % inst_inst_num_from_inst_to_res: 0
% 5.68/5.88 % inst_dismatching_checking_time: 0.
% 5.68/5.88
% 5.68/5.88 % ------ Resolution
% 5.68/5.88
% 5.68/5.88 % res_num_of_clauses: 39395
% 5.68/5.88 % res_num_in_passive: 36567
% 5.68/5.88 % res_num_in_active: 2811
% 5.68/5.88 % res_num_of_loops: 4000
% 5.68/5.88 % res_forward_subset_subsumed: 944
% 5.68/5.88 % res_backward_subset_subsumed: 1
% 5.68/5.88 % res_forward_subsumed: 1091
% 5.68/5.88 % res_backward_subsumed: 7
% 5.68/5.88 % res_forward_subsumption_resolution: 1920
% 5.68/5.88 % res_backward_subsumption_resolution: 80
% 5.68/5.88 % res_clause_to_clause_subsumption: 11264
% 5.68/5.88 % res_orphan_elimination: 0
% 5.68/5.88 % res_tautology_del: 16197
% 5.68/5.88 % res_num_eq_res_simplified: 0
% 5.68/5.88 % res_num_sel_changes: 0
% 5.68/5.88 % res_moves_from_active_to_pass: 0
% 5.68/5.88
% 5.68/5.88 % Status Unknown
% 5.73/5.97 % Orienting using strategy ClausalAll
% 5.73/5.97 % Orientation found
% 5.73/5.97 % 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_01060a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_af9742.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_6d92c7 | grep -v "SZS"
% 5.73/5.98
% 5.73/5.98 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 5.73/5.98
% 5.73/5.98 %
% 5.73/5.98 % ------ iProver source info
% 5.73/5.98
% 5.73/5.98 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 5.73/5.98 % git: non_committed_changes: true
% 5.73/5.98 % git: last_make_outside_of_git: true
% 5.73/5.98
% 5.73/5.98 %
% 5.73/5.98 % ------ Input Options
% 5.73/5.98
% 5.73/5.98 % --out_options all
% 5.73/5.98 % --tptp_safe_out true
% 5.73/5.98 % --problem_path ""
% 5.73/5.98 % --include_path ""
% 5.73/5.98 % --clausifier .//eprover
% 5.73/5.98 % --clausifier_options --tstp-format
% 5.73/5.98 % --stdin false
% 5.73/5.98 % --dbg_backtrace false
% 5.73/5.98 % --dbg_dump_prop_clauses false
% 5.73/5.98 % --dbg_dump_prop_clauses_file -
% 5.73/5.98 % --dbg_out_stat false
% 5.73/5.98
% 5.73/5.98 % ------ General Options
% 5.73/5.98
% 5.73/5.98 % --fof false
% 5.73/5.98 % --time_out_real 150.
% 5.73/5.98 % --time_out_prep_mult 0.2
% 5.73/5.98 % --time_out_virtual -1.
% 5.73/5.98 % --schedule none
% 5.73/5.98 % --ground_splitting input
% 5.73/5.98 % --splitting_nvd 16
% 5.73/5.98 % --non_eq_to_eq false
% 5.73/5.98 % --prep_gs_sim true
% 5.73/5.98 % --prep_unflatten false
% 5.73/5.98 % --prep_res_sim true
% 5.73/5.98 % --prep_upred true
% 5.73/5.98 % --res_sim_input true
% 5.73/5.98 % --clause_weak_htbl true
% 5.73/5.98 % --gc_record_bc_elim false
% 5.73/5.98 % --symbol_type_check false
% 5.73/5.98 % --clausify_out false
% 5.73/5.98 % --large_theory_mode false
% 5.73/5.98 % --prep_sem_filter none
% 5.73/5.98 % --prep_sem_filter_out false
% 5.73/5.98 % --preprocessed_out false
% 5.73/5.98 % --sub_typing false
% 5.73/5.98 % --brand_transform false
% 5.73/5.98 % --pure_diseq_elim true
% 5.73/5.98 % --min_unsat_core false
% 5.73/5.98 % --pred_elim true
% 5.73/5.98 % --add_important_lit false
% 5.73/5.98 % --soft_assumptions false
% 5.73/5.98 % --reset_solvers false
% 5.73/5.98 % --bc_imp_inh []
% 5.73/5.98 % --conj_cone_tolerance 1.5
% 5.73/5.98 % --prolific_symb_bound 500
% 5.73/5.98 % --lt_threshold 2000
% 5.73/5.98
% 5.73/5.98 % ------ SAT Options
% 5.73/5.98
% 5.73/5.98 % --sat_mode false
% 5.73/5.98 % --sat_fm_restart_options ""
% 5.73/5.98 % --sat_gr_def false
% 5.73/5.98 % --sat_epr_types true
% 5.73/5.98 % --sat_non_cyclic_types false
% 5.73/5.98 % --sat_finite_models false
% 5.73/5.98 % --sat_fm_lemmas false
% 5.73/5.98 % --sat_fm_prep false
% 5.73/5.98 % --sat_fm_uc_incr true
% 5.73/5.98 % --sat_out_model small
% 5.73/5.98 % --sat_out_clauses false
% 5.73/5.98
% 5.73/5.98 % ------ QBF Options
% 5.73/5.98
% 5.73/5.98 % --qbf_mode false
% 5.73/5.98 % --qbf_elim_univ true
% 5.73/5.98 % --qbf_sk_in true
% 5.73/5.98 % --qbf_pred_elim true
% 5.73/5.98 % --qbf_split 32
% 5.73/5.98
% 5.73/5.98 % ------ BMC1 Options
% 5.73/5.98
% 5.73/5.98 % --bmc1_incremental false
% 5.73/5.98 % --bmc1_axioms reachable_all
% 5.73/5.98 % --bmc1_min_bound 0
% 5.73/5.98 % --bmc1_max_bound -1
% 5.73/5.98 % --bmc1_max_bound_default -1
% 5.73/5.98 % --bmc1_symbol_reachability true
% 5.73/5.98 % --bmc1_property_lemmas false
% 5.73/5.98 % --bmc1_k_induction false
% 5.73/5.98 % --bmc1_non_equiv_states false
% 5.73/5.98 % --bmc1_deadlock false
% 5.73/5.98 % --bmc1_ucm false
% 5.73/5.98 % --bmc1_add_unsat_core none
% 5.73/5.98 % --bmc1_unsat_core_children false
% 5.73/5.98 % --bmc1_unsat_core_extrapolate_axioms false
% 5.73/5.98 % --bmc1_out_stat full
% 5.73/5.98 % --bmc1_ground_init false
% 5.73/5.98 % --bmc1_pre_inst_next_state false
% 5.73/5.98 % --bmc1_pre_inst_state false
% 5.73/5.98 % --bmc1_pre_inst_reach_state false
% 5.73/5.98 % --bmc1_out_unsat_core false
% 5.73/5.98 % --bmc1_aig_witness_out false
% 5.73/5.98 % --bmc1_verbose false
% 5.73/5.98 % --bmc1_dump_clauses_tptp false
% 5.83/6.15 % --bmc1_dump_unsat_core_tptp false
% 5.83/6.15 % --bmc1_dump_file -
% 5.83/6.15 % --bmc1_ucm_expand_uc_limit 128
% 5.83/6.15 % --bmc1_ucm_n_expand_iterations 6
% 5.83/6.15 % --bmc1_ucm_extend_mode 1
% 5.83/6.15 % --bmc1_ucm_init_mode 2
% 5.83/6.15 % --bmc1_ucm_cone_mode none
% 5.83/6.15 % --bmc1_ucm_reduced_relation_type 0
% 5.83/6.15 % --bmc1_ucm_relax_model 4
% 5.83/6.15 % --bmc1_ucm_full_tr_after_sat true
% 5.83/6.15 % --bmc1_ucm_expand_neg_assumptions false
% 5.83/6.15 % --bmc1_ucm_layered_model none
% 5.83/6.15 % --bmc1_ucm_max_lemma_size 10
% 5.83/6.15
% 5.83/6.15 % ------ AIG Options
% 5.83/6.15
% 5.83/6.15 % --aig_mode false
% 5.83/6.15
% 5.83/6.15 % ------ Instantiation Options
% 5.83/6.15
% 5.83/6.15 % --instantiation_flag true
% 5.83/6.15 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 5.83/6.15 % --inst_solver_per_active 750
% 5.83/6.15 % --inst_solver_calls_frac 0.5
% 5.83/6.15 % --inst_passive_queue_type priority_queues
% 5.83/6.15 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 5.83/6.15 % --inst_passive_queues_freq [25;2]
% 5.83/6.15 % --inst_dismatching true
% 5.83/6.15 % --inst_eager_unprocessed_to_passive true
% 5.83/6.15 % --inst_prop_sim_given true
% 5.83/6.15 % --inst_prop_sim_new false
% 5.83/6.15 % --inst_orphan_elimination true
% 5.83/6.15 % --inst_learning_loop_flag true
% 5.83/6.15 % --inst_learning_start 3000
% 5.83/6.15 % --inst_learning_factor 2
% 5.83/6.15 % --inst_start_prop_sim_after_learn 3
% 5.83/6.15 % --inst_sel_renew solver
% 5.83/6.15 % --inst_lit_activity_flag true
% 5.83/6.15 % --inst_out_proof true
% 5.83/6.15
% 5.83/6.15 % ------ Resolution Options
% 5.83/6.15
% 5.83/6.15 % --resolution_flag true
% 5.83/6.15 % --res_lit_sel kbo_max
% 5.83/6.15 % --res_to_prop_solver none
% 5.83/6.15 % --res_prop_simpl_new false
% 5.83/6.15 % --res_prop_simpl_given false
% 5.83/6.15 % --res_passive_queue_type priority_queues
% 5.83/6.15 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 5.83/6.15 % --res_passive_queues_freq [15;5]
% 5.83/6.15 % --res_forward_subs full
% 5.83/6.15 % --res_backward_subs full
% 5.83/6.15 % --res_forward_subs_resolution true
% 5.83/6.15 % --res_backward_subs_resolution true
% 5.83/6.15 % --res_orphan_elimination false
% 5.83/6.15 % --res_time_limit 1000.
% 5.83/6.15 % --res_out_proof true
% 5.83/6.15 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_01060a.s
% 5.83/6.15 % --modulo true
% 5.83/6.15
% 5.83/6.15 % ------ Combination Options
% 5.83/6.15
% 5.83/6.15 % --comb_res_mult 1000
% 5.83/6.15 % --comb_inst_mult 300
% 5.83/6.15 % ------
% 5.83/6.15
% 5.83/6.15 % ------ Parsing...% successful
% 5.83/6.15
% 5.83/6.15 % ------ Preprocessing... gs_s sp: 508 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 %
% 5.83/6.15
% 5.83/6.15 % ------ Proving...
% 5.83/6.15 % ------ Problem Properties
% 5.83/6.15
% 5.83/6.15 %
% 5.83/6.15 % EPR true
% 5.83/6.15 % Horn false
% 5.83/6.15 % Has equality false
% 5.83/6.15
% 5.83/6.15 % % ------ Input Options Time Limit: Unbounded
% 5.83/6.15
% 5.83/6.15
% 5.83/6.15 % % ------ Current options:
% 5.83/6.15
% 5.83/6.15 % ------ Input Options
% 5.83/6.15
% 5.83/6.15 % --out_options all
% 5.83/6.15 % --tptp_safe_out true
% 5.83/6.15 % --problem_path ""
% 5.83/6.15 % --include_path ""
% 5.83/6.15 % --clausifier .//eprover
% 5.83/6.15 % --clausifier_options --tstp-format
% 5.83/6.15 % --stdin false
% 5.83/6.15 % --dbg_backtrace false
% 5.83/6.15 % --dbg_dump_prop_clauses false
% 5.83/6.15 % --dbg_dump_prop_clauses_file -
% 5.83/6.15 % --dbg_out_stat false
% 5.83/6.15
% 5.83/6.15 % ------ General Options
% 5.83/6.15
% 5.83/6.15 % --fof false
% 5.83/6.15 % --time_out_real 150.
% 5.83/6.15 % --time_out_prep_mult 0.2
% 5.83/6.15 % --time_out_virtual -1.
% 5.83/6.15 % --schedule none
% 5.83/6.15 % --ground_splitting input
% 5.83/6.15 % --splitting_nvd 16
% 5.83/6.15 % --non_eq_to_eq false
% 5.83/6.15 % --prep_gs_sim true
% 5.83/6.15 % --prep_unflatten false
% 5.83/6.15 % --prep_res_sim true
% 5.83/6.15 % --prep_upred true
% 5.83/6.15 % --res_sim_input true
% 5.83/6.15 % --clause_weak_htbl true
% 5.83/6.15 % --gc_record_bc_elim false
% 5.83/6.15 % --symbol_type_check false
% 5.83/6.15 % --clausify_out false
% 5.83/6.15 % --large_theory_mode false
% 5.83/6.15 % --prep_sem_filter none
% 5.83/6.15 % --prep_sem_filter_out false
% 5.83/6.15 % --preprocessed_out false
% 5.83/6.15 % --sub_typing false
% 5.83/6.15 % --brand_transform false
% 5.83/6.15 % --pure_diseq_elim true
% 5.83/6.15 % --min_unsat_core false
% 5.83/6.15 % --pred_elim true
% 5.83/6.15 % --add_important_lit false
% 5.83/6.15 % --soft_assumptions false
% 5.83/6.15 % --reset_solvers false
% 5.83/6.15 % --bc_imp_inh []
% 5.83/6.15 % --conj_cone_tolerance 1.5
% 5.83/6.15 % --prolific_symb_bound 500
% 5.83/6.15 % --lt_threshold 2000
% 5.83/6.15
% 5.83/6.15 % ------ SAT Options
% 5.83/6.15
% 5.83/6.15 % --sat_mode false
% 5.83/6.15 % --sat_fm_restart_options ""
% 5.83/6.15 % --sat_gr_def false
% 5.83/6.15 % --sat_epr_types true
% 5.83/6.15 % --sat_non_cyclic_types false
% 5.83/6.15 % --sat_finite_models false
% 5.83/6.15 % --sat_fm_lemmas false
% 5.83/6.15 % --sat_fm_prep false
% 5.83/6.15 % --sat_fm_uc_incr true
% 5.83/6.15 % --sat_out_model small
% 5.83/6.15 % --sat_out_clauses false
% 5.83/6.15
% 5.83/6.15 % ------ QBF Options
% 5.83/6.15
% 5.83/6.15 % --qbf_mode false
% 5.83/6.15 % --qbf_elim_univ true
% 5.83/6.15 % --qbf_sk_in true
% 5.83/6.15 % --qbf_pred_elim true
% 5.83/6.15 % --qbf_split 32
% 5.83/6.15
% 5.83/6.15 % ------ BMC1 Options
% 5.83/6.15
% 5.83/6.15 % --bmc1_incremental false
% 5.83/6.15 % --bmc1_axioms reachable_all
% 5.83/6.15 % --bmc1_min_bound 0
% 5.83/6.15 % --bmc1_max_bound -1
% 5.83/6.15 % --bmc1_max_bound_default -1
% 5.83/6.15 % --bmc1_symbol_reachability true
% 5.83/6.15 % --bmc1_property_lemmas false
% 5.83/6.15 % --bmc1_k_induction false
% 5.83/6.15 % --bmc1_non_equiv_states false
% 5.83/6.15 % --bmc1_deadlock false
% 5.83/6.15 % --bmc1_ucm false
% 5.83/6.15 % --bmc1_add_unsat_core none
% 5.83/6.15 % --bmc1_unsat_core_children false
% 5.83/6.15 % --bmc1_unsat_core_extrapolate_axioms false
% 5.83/6.15 % --bmc1_out_stat full
% 5.83/6.15 % --bmc1_ground_init false
% 5.83/6.15 % --bmc1_pre_inst_next_state false
% 5.83/6.15 % --bmc1_pre_inst_state false
% 5.83/6.15 % --bmc1_pre_inst_reach_state false
% 5.83/6.15 % --bmc1_out_unsat_core false
% 5.83/6.15 % --bmc1_aig_witness_out false
% 5.83/6.15 % --bmc1_verbose false
% 5.83/6.15 % --bmc1_dump_clauses_tptp false
% 5.83/6.15 % --bmc1_dump_unsat_core_tptp false
% 5.83/6.15 % --bmc1_dump_file -
% 5.83/6.15 % --bmc1_ucm_expand_uc_limit 128
% 5.83/6.15 % --bmc1_ucm_n_expand_iterations 6
% 5.83/6.15 % --bmc1_ucm_extend_mode 1
% 5.83/6.15 % --bmc1_ucm_init_mode 2
% 5.83/6.15 % --bmc1_ucm_cone_mode none
% 5.83/6.15 % --bmc1_ucm_reduced_relation_type 0
% 5.83/6.15 % --bmc1_ucm_relax_model 4
% 5.83/6.15 % --bmc1_ucm_full_tr_after_sat true
% 5.83/6.15 % --bmc1_ucm_expand_neg_assumptions false
% 5.83/6.15 % --bmc1_ucm_layered_model none
% 5.83/6.15 % --bmc1_ucm_max_lemma_size 10
% 5.83/6.15
% 5.83/6.15 % ------ AIG Options
% 5.83/6.15
% 5.83/6.15 % --aig_mode false
% 5.83/6.15
% 5.83/6.15 % ------ Instantiation Options
% 5.83/6.15
% 5.83/6.15 % --instantiation_flag true
% 5.83/6.15 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 5.83/6.15 % --inst_solver_per_active 750
% 5.83/6.15 % --inst_solver_calls_frac 0.5
% 5.83/6.15 % --inst_passive_queue_type priority_queues
% 5.83/6.15 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 5.83/6.15 % --inst_passive_queues_freq [25;2]
% 5.83/6.15 % --inst_dismatching true
% 11.11/11.28 % --inst_eager_unprocessed_to_passive true
% 11.11/11.28 % --inst_prop_sim_given true
% 11.11/11.28 % --inst_prop_sim_new false
% 11.11/11.28 % --inst_orphan_elimination true
% 11.11/11.28 % --inst_learning_loop_flag true
% 11.11/11.28 % --inst_learning_start 3000
% 11.11/11.28 % --inst_learning_factor 2
% 11.11/11.28 % --inst_start_prop_sim_after_learn 3
% 11.11/11.28 % --inst_sel_renew solver
% 11.11/11.28 % --inst_lit_activity_flag true
% 11.11/11.28 % --inst_out_proof true
% 11.11/11.28
% 11.11/11.28 % ------ Resolution Options
% 11.11/11.28
% 11.11/11.28 % --resolution_flag true
% 11.11/11.28 % --res_lit_sel kbo_max
% 11.11/11.28 % --res_to_prop_solver none
% 11.11/11.28 % --res_prop_simpl_new false
% 11.11/11.28 % --res_prop_simpl_given false
% 11.11/11.28 % --res_passive_queue_type priority_queues
% 11.11/11.28 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 11.11/11.28 % --res_passive_queues_freq [15;5]
% 11.11/11.28 % --res_forward_subs full
% 11.11/11.28 % --res_backward_subs full
% 11.11/11.28 % --res_forward_subs_resolution true
% 11.11/11.28 % --res_backward_subs_resolution true
% 11.11/11.28 % --res_orphan_elimination false
% 11.11/11.28 % --res_time_limit 1000.
% 11.11/11.28 % --res_out_proof true
% 11.11/11.28 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_01060a.s
% 11.11/11.28 % --modulo true
% 11.11/11.28
% 11.11/11.28 % ------ Combination Options
% 11.11/11.28
% 11.11/11.28 % --comb_res_mult 1000
% 11.11/11.28 % --comb_inst_mult 300
% 11.11/11.28 % ------
% 11.11/11.28
% 11.11/11.28
% 11.11/11.28
% 11.11/11.28 % ------ Proving...
% 11.11/11.28 % warning: shown sat in sat incomplete mode
% 11.11/11.28 %
% 11.11/11.28
% 11.11/11.28
% 11.11/11.28 ------ Building Model...Done
% 11.11/11.28
% 11.11/11.28 %------ The model is defined over ground terms (initial term algebra).
% 11.11/11.28 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 11.11/11.28 %------ where \phi is a formula over the term algebra.
% 11.11/11.28 %------ If we have equality in the problem then it is also defined as a predicate above,
% 11.11/11.28 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 11.11/11.28 %------ See help for --sat_out_model for different model outputs.
% 11.11/11.28 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 11.11/11.28 %------ where the first argument stands for the sort ($i in the unsorted case)
% 11.11/11.28
% 11.11/11.28
% 11.11/11.28
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c9_0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( c9_0 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c6_2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0,X1] :
% 11.11/11.28 ( c6_2(X0,X1) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a655 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a759 & X1=a684 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a669 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a669 & X1=a749 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a622 & X1=a623 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a656 & X1=a657 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X1=a684 )
% 11.11/11.28 &
% 11.11/11.28 ( X0!=a709 )
% 11.11/11.28 &
% 11.11/11.28 ( X0!=a733 )
% 11.11/11.28 &
% 11.11/11.28 ( X0!=a759 )
% 11.11/11.28 &
% 11.11/11.28 ( X0!=a707 )
% 11.11/11.28 &
% 11.11/11.28 ( X0!=a670 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Negative definition of c1_2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0,X1] :
% 11.11/11.28 ( ~(c1_2(X0,X1)) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a639 & X1=a640 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a759 & X1=a760 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a756 )
% 11.11/11.28 &
% 11.11/11.28 ( X1!=a684 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a686 & X1=a687 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a741 & X1=a742 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c9_2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0,X1] :
% 11.11/11.28 ( c9_2(X0,X1) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a709 & X1=a710 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a633 & X1=a634 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Negative definition of c7_2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0,X1] :
% 11.11/11.28 ( ~(c7_2(X0,X1)) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a690 & X1=a752 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a690 & X1=a718 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X1=a752 )
% 11.11/11.28 &
% 11.11/11.28 ( X0!=a690 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X1=a718 )
% 11.11/11.28 &
% 11.11/11.28 ( X0!=a690 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c4_2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0,X1] :
% 11.11/11.28 ( c4_2(X0,X1) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a669 )
% 11.11/11.28 &
% 11.11/11.28 ( X1!=a726 )
% 11.11/11.28 &
% 11.11/11.28 ( X1!=a752 )
% 11.11/11.28 &
% 11.11/11.28 ( X1!=a712 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a686 & X1=a687 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a686 & X1=a688 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Negative definition of ndr1_1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ~(ndr1_1(X0)) <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c3_2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0,X1] :
% 11.11/11.28 ( c3_2(X0,X1) <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ndr1_0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ndr1_0 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c5_1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( c5_1(X0) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a617 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a660 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c10_2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0,X1] :
% 11.11/11.28 ( c10_2(X0,X1) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a741 & X1=a742 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c5_2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0,X1] :
% 11.11/11.28 ( c5_2(X0,X1) <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Negative definition of c8_1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ~(c8_1(X0)) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a639 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a709 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a633 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a733 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a759 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a707 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a622 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a609 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a670 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c5_0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( c5_0 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c7_1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( c7_1(X0) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a658 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a663 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a656 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Negative definition of c2_2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0,X1] :
% 11.11/11.28 ( ~(c2_2(X0,X1)) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a733 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c8_2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0,X1] :
% 11.11/11.28 ( c8_2(X0,X1) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a639 & X1=a640 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X1=a712 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c3_0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( c3_0 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c3_1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( c3_1(X0) <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Negative definition of c4_1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ~(c4_1(X0)) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a733 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkP0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ssSkP0(X0) <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c2_0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( c2_0 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c10_1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( c10_1(X0) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a633 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c2_1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( c2_1(X0) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a690 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a655 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a698 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c1_0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( c1_0 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Negative definition of c1_1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ~(c1_1(X0)) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a696 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a721 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC19
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC19 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC9
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC9 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c8_0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( c8_0 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC0 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c9_1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( c9_1(X0) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a698 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a617 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a670 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c4_0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( c4_0 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c7_0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( c7_0 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c6_1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( c6_1(X0) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a756 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkP7
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ssSkP7(X0) <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c10_0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( c10_0 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC26
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC26 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of c6_0
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( c6_0 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC12
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC12 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC32
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC32 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Negative definition of ssSkP11
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ~(ssSkP11(X0)) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a669 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC6
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC6 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC22
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC22 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC31
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC31 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC33
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC33 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC25
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC25 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC15
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC15 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC7
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC7 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC20
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC20 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC2 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC18
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC18 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC28
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC28 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC17
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC17 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC10
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC10 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC13
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC13 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC14
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC14 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC21
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC21 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC3
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC3 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkP4
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ssSkP4(X0) <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC34
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC34 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC1 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkP3
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ssSkP3(X0) <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkP2
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ssSkP2(X0) <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkP5
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ssSkP5(X0) <=>
% 11.11/11.28 (
% 11.11/11.28 (
% 11.11/11.28 ( X0=a709 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a733 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a707 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 |
% 11.11/11.28 (
% 11.11/11.28 ( X0=a670 )
% 11.11/11.28 )
% 11.11/11.28
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC11
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC11 <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkP1
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ssSkP1(X0) <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC5
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC5 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC23
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC23 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Negative definition of ssSkP9
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ~(ssSkP9(X0)) <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC4
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC4 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC24
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC24 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkP6
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 (! [X0] :
% 11.11/11.28 ( ssSkP6(X0) <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC8
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC8 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC27
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC27 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC29
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC29 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC16
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC16 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of ssSkC35
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( ssSkC35 <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP6_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP6_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP23_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP23_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP49_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP49_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP104_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP104_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP106_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP106_iProver_split <=>
% 11.11/11.28 $true
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP107_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP107_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP109_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP109_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP112_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP112_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP119_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP119_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP146_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP146_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP153_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP153_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP163_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP163_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP168_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP168_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP169_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP169_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP174_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP174_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP181_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP181_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP183_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP183_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP186_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP186_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28 %------ Positive definition of sP192_iProver_split
% 11.11/11.28 fof(lit_def,axiom,
% 11.11/11.28 ( sP192_iProver_split <=>
% 11.11/11.28 $false
% 11.11/11.28 )
% 11.11/11.28 ).
% 11.11/11.28
% 11.11/11.28
% 11.11/11.28
% 11.11/11.28 % ------ Statistics
% 11.11/11.28
% 11.11/11.28 % ------ General
% 11.11/11.28
% 11.11/11.28 % num_of_input_clauses: 529
% 11.11/11.28 % num_of_input_neg_conjectures: 529
% 11.11/11.28 % num_of_splits: 508
% 11.11/11.28 % num_of_split_atoms: 195
% 11.11/11.28 % num_of_sem_filtered_clauses: 0
% 11.11/11.28 % num_of_subtypes: 0
% 11.11/11.28 % monotx_restored_types: 0
% 11.11/11.28 % sat_num_of_epr_types: 0
% 11.11/11.28 % sat_num_of_non_cyclic_types: 0
% 11.11/11.28 % sat_guarded_non_collapsed_types: 0
% 11.11/11.28 % is_epr: 1
% 11.11/11.28 % is_horn: 0
% 11.11/11.28 % has_eq: 0
% 11.11/11.28 % num_pure_diseq_elim: 0
% 11.11/11.28 % simp_replaced_by: 0
% 11.11/11.28 % res_preprocessed: 1566
% 11.11/11.28 % prep_upred: 0
% 11.11/11.28 % prep_unflattend: 0
% 11.11/11.28 % pred_elim_cands: 195
% 11.11/11.28 % pred_elim: 176
% 11.11/11.28 % pred_elim_cl: 184
% 11.11/11.28 % pred_elim_cycles: 195
% 11.11/11.28 % forced_gc_time: 0
% 11.11/11.28 % gc_basic_clause_elim: 0
% 11.11/11.28 % parsing_time: 0.009
% 11.11/11.28 % sem_filter_time: 0.
% 11.11/11.28 % pred_elim_time: 0.105
% 11.11/11.28 % out_proof_time: 0.
% 11.11/11.28 % monotx_time: 0.
% 11.11/11.28 % subtype_inf_time: 0.
% 11.11/11.28 % unif_index_cands_time: 0.011
% 11.11/11.28 % unif_index_add_time: 0.006
% 11.11/11.28 % total_time: 5.307
% 11.11/11.28 % num_of_symbols: 452
% 11.11/11.28 % num_of_terms: 18698
% 11.11/11.28
% 11.11/11.28 % ------ Propositional Solver
% 11.11/11.28
% 11.11/11.28 % prop_solver_calls: 7
% 11.11/11.28 % prop_fast_solver_calls: 11222
% 11.11/11.28 % prop_num_of_clauses: 2457
% 11.11/11.28 % prop_preprocess_simplified: 11432
% 11.11/11.28 % prop_fo_subsumed: 669
% 11.11/11.28 % prop_solver_time: 0.001
% 11.11/11.28 % prop_fast_solver_time: 0.007
% 11.11/11.28 % prop_unsat_core_time: 0.
% 11.11/11.28
% 11.11/11.28 % ------ QBF
% 11.11/11.28
% 11.11/11.28 % qbf_q_res: 0
% 11.11/11.28 % qbf_num_tautologies: 0
% 11.11/11.28 % qbf_prep_cycles: 0
% 11.11/11.28
% 11.11/11.28 % ------ BMC1
% 11.11/11.28
% 11.11/11.28 % bmc1_current_bound: -1
% 11.11/11.28 % bmc1_last_solved_bound: -1
% 11.11/11.28 % bmc1_unsat_core_size: -1
% 11.11/11.28 % bmc1_unsat_core_parents_size: -1
% 11.11/11.28 % bmc1_merge_next_fun: 0
% 11.11/11.28 % bmc1_unsat_core_clauses_time: 0.
% 11.11/11.28
% 11.11/11.28 % ------ Instantiation
% 11.11/11.28
% 11.11/11.28 % inst_num_of_clauses: 853
% 11.11/11.28 % inst_num_in_passive: 0
% 11.11/11.28 % inst_num_in_active: 853
% 11.11/11.28 % inst_num_in_unprocessed: 0
% 11.11/11.28 % inst_num_of_loops: 970
% 11.11/11.28 % inst_num_of_learning_restarts: 0
% 11.11/11.28 % inst_num_moves_active_passive: 110
% 11.11/11.28 % inst_lit_activity: 246
% 11.11/11.28 % inst_lit_activity_moves: 0
% 11.11/11.28 % inst_num_tautologies: 0
% 11.11/11.28 % inst_num_prop_implied: 0
% 11.11/11.28 % inst_num_existing_simplified: 0
% 11.11/11.28 % inst_num_eq_res_simplified: 0
% 11.11/11.28 % inst_num_child_elim: 0
% 11.11/11.28 % inst_num_of_dismatching_blockings: 2
% 11.11/11.28 % inst_num_of_non_proper_insts: 160
% 11.11/11.28 % inst_num_of_duplicates: 17
% 11.11/11.28 % inst_inst_num_from_inst_to_res: 0
% 11.11/11.28 % inst_dismatching_checking_time: 0.
% 11.11/11.28
% 11.11/11.28 % ------ Resolution
% 11.11/11.28
% 11.11/11.28 % res_num_of_clauses: 39395
% 11.11/11.28 % res_num_in_passive: 36567
% 11.11/11.28 % res_num_in_active: 2811
% 11.11/11.28 % res_num_of_loops: 4000
% 11.11/11.28 % res_forward_subset_subsumed: 944
% 11.11/11.28 % res_backward_subset_subsumed: 1
% 11.11/11.28 % res_forward_subsumed: 1091
% 11.11/11.28 % res_backward_subsumed: 7
% 11.11/11.28 % res_forward_subsumption_resolution: 1920
% 11.11/11.28 % res_backward_subsumption_resolution: 80
% 11.11/11.28 % res_clause_to_clause_subsumption: 11264
% 11.11/11.28 % res_orphan_elimination: 0
% 11.11/11.28 % res_tautology_del: 16197
% 11.11/11.28 % res_num_eq_res_simplified: 0
% 11.11/11.28 % res_num_sel_changes: 0
% 11.11/11.28 % res_moves_from_active_to_pass: 0
% 11.11/11.28
% 11.11/11.28 % Status Unknown
% 11.11/11.28 % Last status :
% 11.11/11.28 % SZS status Unknown
%------------------------------------------------------------------------------