TSTP Solution File: NLP169-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP169-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n025.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 : Mon Jul 18 02:41:20 EDT 2022
% Result : Unknown 142.39s 142.65s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP169-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 06:10:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.34 % Running in mono-core mode
% 0.19/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.41 % Orientation found
% 0.19/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8c2741.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_c29f17.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_d4dea1 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.45 % --bmc1_dump_file -
% 0.20/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.45 % --bmc1_ucm_extend_mode 1
% 0.20/0.45 % --bmc1_ucm_init_mode 2
% 0.20/0.45 % --bmc1_ucm_cone_mode none
% 0.20/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.45 % --bmc1_ucm_relax_model 4
% 0.20/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.45 % --bmc1_ucm_layered_model none
% 0.20/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.45
% 0.20/0.45 % ------ AIG Options
% 0.20/0.45
% 0.20/0.45 % --aig_mode false
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation Options
% 0.20/0.45
% 0.20/0.45 % --instantiation_flag true
% 0.20/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.45 % --inst_solver_per_active 750
% 0.20/0.45 % --inst_solver_calls_frac 0.5
% 0.20/0.45 % --inst_passive_queue_type priority_queues
% 0.20/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.45 % --inst_passive_queues_freq [25;2]
% 0.20/0.45 % --inst_dismatching true
% 0.20/0.45 % --inst_eager_unprocessed_to_passive true
% 0.20/0.45 % --inst_prop_sim_given true
% 0.20/0.45 % --inst_prop_sim_new false
% 0.20/0.45 % --inst_orphan_elimination true
% 0.20/0.45 % --inst_learning_loop_flag true
% 0.20/0.45 % --inst_learning_start 3000
% 0.20/0.45 % --inst_learning_factor 2
% 0.20/0.45 % --inst_start_prop_sim_after_learn 3
% 0.20/0.45 % --inst_sel_renew solver
% 0.20/0.45 % --inst_lit_activity_flag true
% 0.20/0.45 % --inst_out_proof true
% 0.20/0.45
% 0.20/0.45 % ------ Resolution Options
% 0.20/0.45
% 0.20/0.45 % --resolution_flag true
% 0.20/0.45 % --res_lit_sel kbo_max
% 0.20/0.45 % --res_to_prop_solver none
% 0.20/0.45 % --res_prop_simpl_new false
% 0.20/0.45 % --res_prop_simpl_given false
% 0.20/0.45 % --res_passive_queue_type priority_queues
% 0.20/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.45 % --res_passive_queues_freq [15;5]
% 0.20/0.45 % --res_forward_subs full
% 0.20/0.45 % --res_backward_subs full
% 0.20/0.45 % --res_forward_subs_resolution true
% 0.20/0.45 % --res_backward_subs_resolution true
% 0.20/0.45 % --res_orphan_elimination false
% 0.20/0.45 % --res_time_limit 1000.
% 0.20/0.45 % --res_out_proof true
% 0.20/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8c2741.s
% 0.20/0.45 % --modulo true
% 0.20/0.45
% 0.20/0.45 % ------ Combination Options
% 0.20/0.45
% 0.20/0.45 % --comb_res_mult 1000
% 0.20/0.45 % --comb_inst_mult 300
% 0.20/0.45 % ------
% 0.20/0.45
% 0.20/0.45 % ------ Parsing...% successful
% 0.20/0.45
% 0.20/0.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.45
% 0.20/0.45 % ------ Proving...
% 0.20/0.45 % ------ Problem Properties
% 0.20/0.45
% 0.20/0.45 %
% 0.20/0.45 % EPR false
% 0.20/0.45 % Horn false
% 0.20/0.45 % Has equality false
% 0.20/0.45
% 0.20/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % % ------ Current options:
% 0.20/0.45
% 0.20/0.45 % ------ Input Options
% 0.20/0.45
% 0.20/0.45 % --out_options all
% 0.20/0.45 % --tptp_safe_out true
% 0.20/0.45 % --problem_path ""
% 0.20/0.45 % --include_path ""
% 0.20/0.45 % --clausifier .//eprover
% 0.20/0.45 % --clausifier_options --tstp-format
% 0.20/0.45 % --stdin false
% 0.20/0.45 % --dbg_backtrace false
% 0.20/0.45 % --dbg_dump_prop_clauses false
% 0.20/0.45 % --dbg_dump_prop_clauses_file -
% 0.20/0.45 % --dbg_out_stat false
% 0.20/0.45
% 0.20/0.45 % ------ General Options
% 0.20/0.45
% 0.20/0.45 % --fof false
% 0.20/0.45 % --time_out_real 150.
% 0.20/0.45 % --time_out_prep_mult 0.2
% 0.20/0.45 % --time_out_virtual -1.
% 0.20/0.45 % --schedule none
% 0.20/0.45 % --ground_splitting input
% 0.20/0.45 % --splitting_nvd 16
% 0.20/0.45 % --non_eq_to_eq false
% 0.20/0.45 % --prep_gs_sim true
% 0.20/0.45 % --prep_unflatten false
% 0.20/0.45 % --prep_res_sim true
% 0.20/0.45 % --prep_upred true
% 0.20/0.45 % --res_sim_input true
% 0.20/0.45 % --clause_weak_htbl true
% 0.20/0.45 % --gc_record_bc_elim false
% 0.20/0.45 % --symbol_type_check false
% 0.20/0.45 % --clausify_out false
% 0.20/0.45 % --large_theory_mode false
% 0.20/0.45 % --prep_sem_filter none
% 0.20/0.45 % --prep_sem_filter_out false
% 0.20/0.45 % --preprocessed_out false
% 0.20/0.45 % --sub_typing false
% 0.20/0.45 % --brand_transform false
% 0.20/0.45 % --pure_diseq_elim true
% 0.20/0.45 % --min_unsat_core false
% 0.20/0.45 % --pred_elim true
% 0.20/0.45 % --add_important_lit false
% 0.20/0.45 % --soft_assumptions false
% 0.20/0.45 % --reset_solvers false
% 0.20/0.45 % --bc_imp_inh []
% 0.20/0.45 % --conj_cone_tolerance 1.5
% 0.20/0.45 % --prolific_symb_bound 500
% 0.20/0.45 % --lt_threshold 2000
% 0.20/0.45
% 0.20/0.45 % ------ SAT Options
% 0.20/0.45
% 0.20/0.45 % --sat_mode false
% 0.20/0.45 % --sat_fm_restart_options ""
% 0.20/0.45 % --sat_gr_def false
% 0.20/0.45 % --sat_epr_types true
% 0.20/0.45 % --sat_non_cyclic_types false
% 0.20/0.45 % --sat_finite_models false
% 0.20/0.45 % --sat_fm_lemmas false
% 0.20/0.45 % --sat_fm_prep false
% 0.20/0.45 % --sat_fm_uc_incr true
% 0.20/0.45 % --sat_out_model small
% 0.20/0.45 % --sat_out_clauses false
% 0.20/0.45
% 0.20/0.45 % ------ QBF Options
% 0.20/0.45
% 0.20/0.45 % --qbf_mode false
% 0.20/0.45 % --qbf_elim_univ true
% 0.20/0.45 % --qbf_sk_in true
% 0.20/0.45 % --qbf_pred_elim true
% 0.20/0.45 % --qbf_split 32
% 0.20/0.45
% 0.20/0.45 % ------ BMC1 Options
% 0.20/0.45
% 0.20/0.45 % --bmc1_incremental false
% 0.20/0.45 % --bmc1_axioms reachable_all
% 0.20/0.45 % --bmc1_min_bound 0
% 0.20/0.45 % --bmc1_max_bound -1
% 0.20/0.45 % --bmc1_max_bound_default -1
% 0.20/0.45 % --bmc1_symbol_reachability true
% 0.20/0.45 % --bmc1_property_lemmas false
% 0.20/0.45 % --bmc1_k_induction false
% 0.20/0.45 % --bmc1_non_equiv_states false
% 0.20/0.45 % --bmc1_deadlock false
% 0.20/0.45 % --bmc1_ucm false
% 0.20/0.45 % --bmc1_add_unsat_core none
% 0.20/0.45 % --bmc1_unsat_core_children false
% 0.20/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.45 % --bmc1_out_stat full
% 0.20/0.45 % --bmc1_ground_init false
% 0.20/0.45 % --bmc1_pre_inst_next_state false
% 0.20/0.45 % --bmc1_pre_inst_state false
% 0.20/0.45 % --bmc1_pre_inst_reach_state false
% 0.20/0.45 % --bmc1_out_unsat_core false
% 0.20/0.45 % --bmc1_aig_witness_out false
% 0.20/0.45 % --bmc1_verbose false
% 0.20/0.45 % --bmc1_dump_clauses_tptp false
% 0.20/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.45 % --bmc1_dump_file -
% 0.20/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.45 % --bmc1_ucm_extend_mode 1
% 0.20/0.45 % --bmc1_ucm_init_mode 2
% 0.20/0.45 % --bmc1_ucm_cone_mode none
% 0.20/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.45 % --bmc1_ucm_relax_model 4
% 0.20/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.45 % --bmc1_ucm_layered_model none
% 0.20/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.45
% 0.20/0.45 % ------ AIG Options
% 0.20/0.45
% 0.20/0.45 % --aig_mode false
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation Options
% 0.20/0.45
% 0.20/0.45 % --instantiation_flag true
% 0.20/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.45 % --inst_solver_per_active 750
% 0.20/0.45 % --inst_solver_calls_frac 0.5
% 0.20/0.45 % --inst_passive_queue_type priority_queues
% 0.20/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.45 % --inst_passive_queues_freq [25;2]
% 0.20/0.45 % --inst_dismatching true
% 0.20/0.45 % --inst_eager_unprocessed_to_passive true
% 0.20/0.45 % --inst_prop_sim_given true
% 71.51/71.74 % --inst_prop_sim_new false
% 71.51/71.74 % --inst_orphan_elimination true
% 71.51/71.74 % --inst_learning_loop_flag true
% 71.51/71.74 % --inst_learning_start 3000
% 71.51/71.74 % --inst_learning_factor 2
% 71.51/71.74 % --inst_start_prop_sim_after_learn 3
% 71.51/71.74 % --inst_sel_renew solver
% 71.51/71.74 % --inst_lit_activity_flag true
% 71.51/71.74 % --inst_out_proof true
% 71.51/71.74
% 71.51/71.74 % ------ Resolution Options
% 71.51/71.74
% 71.51/71.74 % --resolution_flag true
% 71.51/71.74 % --res_lit_sel kbo_max
% 71.51/71.74 % --res_to_prop_solver none
% 71.51/71.74 % --res_prop_simpl_new false
% 71.51/71.74 % --res_prop_simpl_given false
% 71.51/71.74 % --res_passive_queue_type priority_queues
% 71.51/71.74 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 71.51/71.74 % --res_passive_queues_freq [15;5]
% 71.51/71.74 % --res_forward_subs full
% 71.51/71.74 % --res_backward_subs full
% 71.51/71.74 % --res_forward_subs_resolution true
% 71.51/71.74 % --res_backward_subs_resolution true
% 71.51/71.74 % --res_orphan_elimination false
% 71.51/71.74 % --res_time_limit 1000.
% 71.51/71.74 % --res_out_proof true
% 71.51/71.74 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8c2741.s
% 71.51/71.74 % --modulo true
% 71.51/71.74
% 71.51/71.74 % ------ Combination Options
% 71.51/71.74
% 71.51/71.74 % --comb_res_mult 1000
% 71.51/71.74 % --comb_inst_mult 300
% 71.51/71.74 % ------
% 71.51/71.74
% 71.51/71.74
% 71.51/71.74
% 71.51/71.74 % ------ Proving...
% 71.51/71.74 % warning: shown sat in sat incomplete mode
% 71.51/71.74 %
% 71.51/71.74
% 71.51/71.74
% 71.51/71.74 ------ Building Model...Done
% 71.51/71.74
% 71.51/71.74 %------ The model is defined over ground terms (initial term algebra).
% 71.51/71.74 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 71.51/71.74 %------ where \phi is a formula over the term algebra.
% 71.51/71.74 %------ If we have equality in the problem then it is also defined as a predicate above,
% 71.51/71.74 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 71.51/71.74 %------ See help for --sat_out_model for different model outputs.
% 71.51/71.74 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 71.51/71.74 %------ where the first argument stands for the sort ($i in the unsorted case)
% 71.51/71.74
% 71.51/71.74
% 71.51/71.74
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of ssSkC0
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 ( ssSkC0 <=>
% 71.51/71.74 $true
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of actual_world
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0] :
% 71.51/71.74 ( ~(actual_world(X0)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of group
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( group(X0,X1) <=>
% 71.51/71.74 (
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc18 & X1=skc19 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc18 & X1=skc20 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc18 & X1=skc26 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skc64 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skc65 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skc66 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of coat
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( coat(X0,X1) <=>
% 71.51/71.74 (
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf23(skc63,skc64) )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of black
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(black(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of cheap
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(cheap(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of ssSkP2
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1,X2] :
% 71.51/71.74 ( ~(ssSkP2(X0,X1,X2)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of down
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1,X2] :
% 71.51/71.74 ( ~(down(X0,X1,X2)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of lonely
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( lonely(X0,X1) <=>
% 71.51/71.74 (
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc18 & X1=skc22 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skc68 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of street
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(street(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of event
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( event(X0,X1) <=>
% 71.51/71.74 (
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc18 & X1=skc21 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skc67 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 ? [X2,X3] :
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf17(skc63,X2,X3) )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of present
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(present(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of barrel
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(barrel(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of placename
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( placename(X0,X1) <=>
% 71.51/71.74 (
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc18 & X1=skc23 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skc70 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of hollywood_placename
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(hollywood_placename(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of of
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1,X2] :
% 71.51/71.74 ( ~(of(X0,X1,X2)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of frontseat
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( frontseat(X0,X1) <=>
% 71.51/71.74 (
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc18 & X1=skc27 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skc69 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of city
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( city(X0,X1) <=>
% 71.51/71.74 (
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc18 & X1=skc24 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skc69 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of chevy
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( chevy(X0,X1) <=>
% 71.51/71.74 (
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc18 & X1=skc25 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skc69 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of white
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(white(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of dirty
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(dirty(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of old
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(old(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of agent
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1,X2] :
% 71.51/71.74 ( ~(agent(X0,X1,X2)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of in
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1,X2] :
% 71.51/71.74 ( ~(in(X0,X1,X2)) <=>
% 71.51/71.74 (
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skc67 | X2!=skc69 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skf12(skf23(skc63,skc64),skc63,X1) | X2!=X1 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skf12(skf21(skc64,skc63,X1),skc63,X2) | X2!=X2 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skf12(skf11(skc63,skc64),skc63,X1) | X2!=X1 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skf12(skf19(skc64,skc63,skc64),skc63,X1) | X2!=X1 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skf12(skf10(skc63,skc66),skc63,X1) | X2!=X1 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skf12(skf10(skc63,skc65),skc63,X1) | X2!=X1 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skf12(skf10(skc63,skc64),skc63,X1) | X2!=X1 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skf12(skf19(skc65,skc63,skc65),skc63,X1) | X2!=X1 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skf12(skf19(skc65,skc63,skc66),skc63,X1) | X2!=X1 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skf12(skf21(skc65,skc63,X1),skc63,X2) | X2!=X2 )
% 71.51/71.74 &
% 71.51/71.74 ( X1!=skf12(skf10(skc63,skc66),skc63,skc69) | X2!=skc69 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of ssSkP1
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1,X2] :
% 71.51/71.74 ( ~(ssSkP1(X0,X1,X2)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of ssSkP0
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(ssSkP0(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of two
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( two(X0,X1) <=>
% 71.51/71.74 (
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc18 & X1=skc26 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skc66 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of member
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1,X2] :
% 71.51/71.74 ( member(X0,X1,X2) <=>
% 71.51/71.74 (
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf23(skc63,skc64) & X2=skc64 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf10(skc63,skc64) & X2=skc64 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf10(skc63,skc65) & X2=skc65 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf10(skc63,skc66) & X2=skc66 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of state
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( state(X0,X1) <=>
% 71.51/71.74 (
% 71.51/71.74 ? [X2,X3] :
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf13(skc63,X2,X3) )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of be
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1,X2,X3] :
% 71.51/71.74 ( ~(be(X0,X1,X2,X3)) <=>
% 71.51/71.74 (
% 71.51/71.74 ? [X4,X5,X6,X7] :
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf13(skc63,X4,X5) & X2=skf16(X6,skc63,X7) & X3=skf12(skf23(skc63,skc64),skc63,X6) )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 ? [X4,X5,X6,X7] :
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf13(skc63,X4,X5) & X2=skf16(X6,skc63,X7) & X3=skf12(skf11(skc63,skc64),skc63,X6) )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 ? [X4,X5,X6,X7] :
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf13(skc63,X4,X5) & X2=skf16(X6,skc63,X7) & X3=skf12(skf19(skc64,skc63,skc64),skc63,X6) )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 ? [X4,X5,X6] :
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf13(skc63,X4,X5) & X2=skf16(skc69,skc63,X6) & X3=skc67 )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 ? [X4,X5,X6] :
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf13(skc63,X4,X5) & X2=skf16(skc69,skc63,X6) & X3=skf12(skf10(skc63,skc66),skc63,skc69) )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of patient
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1,X2] :
% 71.51/71.74 ( ~(patient(X0,X1,X2)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Positive definition of nonreflexive
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( nonreflexive(X0,X1) <=>
% 71.51/71.74 (
% 71.51/71.74 ? [X2,X3] :
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf17(skc63,X2,X3) )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of wear
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(wear(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of fellow
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(fellow(X0,X1)) <=>
% 71.51/71.74 (
% 71.51/71.74 ? [X2] :
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc18 & X1=skf11(skc18,X2) )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 |
% 71.51/71.74 ? [X2] :
% 71.51/71.74 (
% 71.51/71.74 ( X0=skc63 & X1=skf11(skc63,X2) )
% 71.51/71.74 )
% 71.51/71.74
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74 %------ Negative definition of young
% 71.51/71.74 fof(lit_def,axiom,
% 71.51/71.74 (! [X0,X1] :
% 71.51/71.74 ( ~(young(X0,X1)) <=>
% 71.51/71.74 $false
% 71.51/71.74 )
% 71.51/71.74 )
% 71.51/71.74 ).
% 71.51/71.74
% 71.51/71.74
% 71.51/71.74
% 71.51/71.74 % ------ Statistics
% 71.51/71.74
% 71.51/71.74 % ------ General
% 71.51/71.74
% 71.51/71.74 % num_of_input_clauses: 78
% 71.51/71.74 % num_of_input_neg_conjectures: 78
% 71.51/71.74 % num_of_splits: 0
% 71.51/71.74 % num_of_split_atoms: 0
% 71.51/71.74 % num_of_sem_filtered_clauses: 0
% 71.51/71.74 % num_of_subtypes: 0
% 71.51/71.74 % monotx_restored_types: 0
% 71.51/71.74 % sat_num_of_epr_types: 0
% 71.51/71.74 % sat_num_of_non_cyclic_types: 0
% 71.51/71.74 % sat_guarded_non_collapsed_types: 0
% 71.51/71.74 % is_epr: 0
% 71.51/71.74 % is_horn: 0
% 71.51/71.74 % has_eq: 0
% 71.51/71.74 % num_pure_diseq_elim: 0
% 71.51/71.74 % simp_replaced_by: 0
% 71.51/71.74 % res_preprocessed: 156
% 71.51/71.74 % prep_upred: 0
% 71.51/71.74 % prep_unflattend: 0
% 71.51/71.74 % pred_elim_cands: 0
% 71.51/71.74 % pred_elim: 0
% 71.51/71.74 % pred_elim_cl: 0
% 71.51/71.74 % pred_elim_cycles: 0
% 71.51/71.74 % forced_gc_time: 0
% 71.51/71.74 % gc_basic_clause_elim: 0
% 71.51/71.74 % parsing_time: 0.004
% 71.51/71.74 % sem_filter_time: 0.
% 71.51/71.74 % pred_elim_time: 0.
% 71.51/71.74 % out_proof_time: 0.
% 71.51/71.74 % monotx_time: 0.
% 71.51/71.74 % subtype_inf_time: 0.
% 71.51/71.74 % unif_index_cands_time: 0.023
% 71.51/71.74 % unif_index_add_time: 0.019
% 71.51/71.74 % total_time: 71.324
% 71.51/71.74 % num_of_symbols: 87
% 71.51/71.74 % num_of_terms: 26471
% 71.51/71.74
% 71.51/71.74 % ------ Propositional Solver
% 71.51/71.74
% 71.51/71.74 % prop_solver_calls: 24
% 71.51/71.74 % prop_fast_solver_calls: 867
% 71.51/71.74 % prop_num_of_clauses: 3231
% 71.51/71.74 % prop_preprocess_simplified: 4361
% 71.51/71.74 % prop_fo_subsumed: 0
% 71.51/71.74 % prop_solver_time: 0.001
% 71.51/71.74 % prop_fast_solver_time: 0.001
% 71.51/71.74 % prop_unsat_core_time: 0.
% 71.51/71.74
% 71.51/71.74 % ------ QBF
% 71.51/71.74
% 71.51/71.74 % qbf_q_res: 0
% 71.51/71.74 % qbf_num_tautologies: 0
% 71.51/71.74 % qbf_prep_cycles: 0
% 71.51/71.74
% 71.51/71.74 % ------ BMC1
% 71.51/71.74
% 71.51/71.74 % bmc1_current_bound: -1
% 71.51/71.74 % bmc1_last_solved_bound: -1
% 71.51/71.74 % bmc1_unsat_core_size: -1
% 71.51/71.74 % bmc1_unsat_core_parents_size: -1
% 71.51/71.74 % bmc1_merge_next_fun: 0
% 71.51/71.74 % bmc1_unsat_core_clauses_time: 0.
% 71.51/71.74
% 71.51/71.74 % ------ Instantiation
% 71.51/71.74
% 71.51/71.74 % inst_num_of_clauses: 1785
% 71.51/71.74 % inst_num_in_passive: 0
% 71.51/71.74 % inst_num_in_active: 1785
% 71.51/71.74 % inst_num_in_unprocessed: 0
% 71.51/71.74 % inst_num_of_loops: 2476
% 71.51/71.74 % inst_num_of_learning_restarts: 0
% 71.51/71.74 % inst_num_moves_active_passive: 668
% 71.51/71.74 % inst_lit_activity: 418
% 71.51/71.74 % inst_lit_activity_moves: 0
% 71.51/71.74 % inst_num_tautologies: 0
% 71.51/71.74 % inst_num_prop_implied: 0
% 71.51/71.74 % inst_num_existing_simplified: 0
% 71.51/71.74 % inst_num_eq_res_simplified: 0
% 71.51/71.74 % inst_num_child_elim: 0
% 71.51/71.74 % inst_num_of_dismatching_blockings: 141
% 71.51/71.74 % inst_num_of_non_proper_insts: 3779
% 71.51/71.74 % inst_num_of_duplicates: 542
% 71.51/71.74 % inst_inst_num_from_inst_to_res: 0
% 71.51/71.74 % inst_dismatching_checking_time: 0.001
% 71.51/71.74
% 71.51/71.74 % ------ Resolution
% 71.51/71.74
% 71.51/71.74 % res_num_of_clauses: 426696
% 71.51/71.74 % res_num_in_passive: 444873
% 71.51/71.74 % res_num_in_active: 6408
% 71.51/71.74 % res_num_of_loops: 9000
% 71.51/71.74 % res_forward_subset_subsumed: 449999
% 71.51/71.74 % res_backward_subset_subsumed: 28347
% 71.51/71.74 % res_forward_subsumed: 1799
% 71.51/71.74 % res_backward_subsumed: 91
% 71.51/71.74 % res_forward_subsumption_resolution: 7794
% 71.51/71.74 % res_backward_subsumption_resolution: 111
% 71.51/71.74 % res_clause_to_clause_subsumption: 59800
% 71.51/71.74 % res_orphan_elimination: 0
% 71.51/71.74 % res_tautology_del: 41405
% 71.51/71.74 % res_num_eq_res_simplified: 0
% 71.51/71.74 % res_num_sel_changes: 0
% 71.51/71.74 % res_moves_from_active_to_pass: 0
% 71.51/71.74
% 71.51/71.74 % Status Unknown
% 71.51/71.79 % Orienting using strategy ClausalAll
% 71.51/71.79 % Orientation found
% 71.51/71.79 % 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_8c2741.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_c29f17.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_dc588e | grep -v "SZS"
% 71.62/71.80
% 71.62/71.80 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 71.62/71.80
% 71.62/71.80 %
% 71.62/71.80 % ------ iProver source info
% 71.62/71.80
% 71.62/71.80 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 71.62/71.80 % git: non_committed_changes: true
% 71.62/71.80 % git: last_make_outside_of_git: true
% 71.62/71.80
% 71.62/71.80 %
% 71.62/71.80 % ------ Input Options
% 71.62/71.80
% 71.62/71.80 % --out_options all
% 71.62/71.80 % --tptp_safe_out true
% 71.62/71.80 % --problem_path ""
% 71.62/71.80 % --include_path ""
% 71.62/71.80 % --clausifier .//eprover
% 71.62/71.80 % --clausifier_options --tstp-format
% 71.62/71.80 % --stdin false
% 71.62/71.80 % --dbg_backtrace false
% 71.62/71.80 % --dbg_dump_prop_clauses false
% 71.62/71.80 % --dbg_dump_prop_clauses_file -
% 71.62/71.80 % --dbg_out_stat false
% 71.62/71.80
% 71.62/71.80 % ------ General Options
% 71.62/71.80
% 71.62/71.80 % --fof false
% 71.62/71.80 % --time_out_real 150.
% 71.62/71.80 % --time_out_prep_mult 0.2
% 71.62/71.80 % --time_out_virtual -1.
% 71.62/71.80 % --schedule none
% 71.62/71.80 % --ground_splitting input
% 71.62/71.80 % --splitting_nvd 16
% 71.62/71.80 % --non_eq_to_eq false
% 71.62/71.80 % --prep_gs_sim true
% 71.62/71.80 % --prep_unflatten false
% 71.62/71.80 % --prep_res_sim true
% 71.62/71.80 % --prep_upred true
% 71.62/71.80 % --res_sim_input true
% 71.62/71.80 % --clause_weak_htbl true
% 71.62/71.80 % --gc_record_bc_elim false
% 71.62/71.80 % --symbol_type_check false
% 71.62/71.80 % --clausify_out false
% 71.62/71.80 % --large_theory_mode false
% 71.62/71.80 % --prep_sem_filter none
% 71.62/71.80 % --prep_sem_filter_out false
% 71.62/71.80 % --preprocessed_out false
% 71.62/71.80 % --sub_typing false
% 71.62/71.80 % --brand_transform false
% 71.62/71.80 % --pure_diseq_elim true
% 71.62/71.80 % --min_unsat_core false
% 71.62/71.80 % --pred_elim true
% 71.62/71.80 % --add_important_lit false
% 71.62/71.80 % --soft_assumptions false
% 71.62/71.80 % --reset_solvers false
% 71.62/71.80 % --bc_imp_inh []
% 71.62/71.80 % --conj_cone_tolerance 1.5
% 71.62/71.80 % --prolific_symb_bound 500
% 71.62/71.80 % --lt_threshold 2000
% 71.62/71.80
% 71.62/71.80 % ------ SAT Options
% 71.62/71.80
% 71.62/71.80 % --sat_mode false
% 71.62/71.80 % --sat_fm_restart_options ""
% 71.62/71.80 % --sat_gr_def false
% 71.62/71.80 % --sat_epr_types true
% 71.62/71.80 % --sat_non_cyclic_types false
% 71.62/71.80 % --sat_finite_models false
% 71.62/71.80 % --sat_fm_lemmas false
% 71.62/71.80 % --sat_fm_prep false
% 71.62/71.80 % --sat_fm_uc_incr true
% 71.62/71.80 % --sat_out_model small
% 71.62/71.80 % --sat_out_clauses false
% 71.62/71.80
% 71.62/71.80 % ------ QBF Options
% 71.62/71.80
% 71.62/71.80 % --qbf_mode false
% 71.62/71.80 % --qbf_elim_univ true
% 71.62/71.80 % --qbf_sk_in true
% 71.62/71.80 % --qbf_pred_elim true
% 71.62/71.80 % --qbf_split 32
% 71.62/71.80
% 71.62/71.80 % ------ BMC1 Options
% 71.62/71.80
% 71.62/71.80 % --bmc1_incremental false
% 71.62/71.80 % --bmc1_axioms reachable_all
% 71.62/71.80 % --bmc1_min_bound 0
% 71.62/71.80 % --bmc1_max_bound -1
% 71.62/71.80 % --bmc1_max_bound_default -1
% 71.62/71.80 % --bmc1_symbol_reachability true
% 71.62/71.80 % --bmc1_property_lemmas false
% 71.62/71.80 % --bmc1_k_induction false
% 71.62/71.80 % --bmc1_non_equiv_states false
% 71.62/71.80 % --bmc1_deadlock false
% 71.62/71.80 % --bmc1_ucm false
% 71.62/71.80 % --bmc1_add_unsat_core none
% 71.62/71.80 % --bmc1_unsat_core_children false
% 71.62/71.80 % --bmc1_unsat_core_extrapolate_axioms false
% 71.62/71.80 % --bmc1_out_stat full
% 71.62/71.80 % --bmc1_ground_init false
% 71.62/71.80 % --bmc1_pre_inst_next_state false
% 71.62/71.80 % --bmc1_pre_inst_state false
% 71.62/71.80 % --bmc1_pre_inst_reach_state false
% 71.62/71.80 % --bmc1_out_unsat_core false
% 71.62/71.80 % --bmc1_aig_witness_out false
% 71.62/71.80 % --bmc1_verbose false
% 71.62/71.80 % --bmc1_dump_clauses_tptp false
% 71.62/71.81 % --bmc1_dump_unsat_core_tptp false
% 71.62/71.81 % --bmc1_dump_file -
% 71.62/71.81 % --bmc1_ucm_expand_uc_limit 128
% 71.62/71.81 % --bmc1_ucm_n_expand_iterations 6
% 71.62/71.81 % --bmc1_ucm_extend_mode 1
% 71.62/71.81 % --bmc1_ucm_init_mode 2
% 71.62/71.81 % --bmc1_ucm_cone_mode none
% 71.62/71.81 % --bmc1_ucm_reduced_relation_type 0
% 71.62/71.81 % --bmc1_ucm_relax_model 4
% 71.62/71.81 % --bmc1_ucm_full_tr_after_sat true
% 71.62/71.81 % --bmc1_ucm_expand_neg_assumptions false
% 71.62/71.81 % --bmc1_ucm_layered_model none
% 71.62/71.81 % --bmc1_ucm_max_lemma_size 10
% 71.62/71.81
% 71.62/71.81 % ------ AIG Options
% 71.62/71.81
% 71.62/71.81 % --aig_mode false
% 71.62/71.81
% 71.62/71.81 % ------ Instantiation Options
% 71.62/71.81
% 71.62/71.81 % --instantiation_flag true
% 71.62/71.81 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 71.62/71.81 % --inst_solver_per_active 750
% 71.62/71.81 % --inst_solver_calls_frac 0.5
% 71.62/71.81 % --inst_passive_queue_type priority_queues
% 71.62/71.81 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 71.62/71.81 % --inst_passive_queues_freq [25;2]
% 71.62/71.81 % --inst_dismatching true
% 71.62/71.81 % --inst_eager_unprocessed_to_passive true
% 71.62/71.81 % --inst_prop_sim_given true
% 71.62/71.81 % --inst_prop_sim_new false
% 71.62/71.81 % --inst_orphan_elimination true
% 71.62/71.81 % --inst_learning_loop_flag true
% 71.62/71.81 % --inst_learning_start 3000
% 71.62/71.81 % --inst_learning_factor 2
% 71.62/71.81 % --inst_start_prop_sim_after_learn 3
% 71.62/71.81 % --inst_sel_renew solver
% 71.62/71.81 % --inst_lit_activity_flag true
% 71.62/71.81 % --inst_out_proof true
% 71.62/71.81
% 71.62/71.81 % ------ Resolution Options
% 71.62/71.81
% 71.62/71.81 % --resolution_flag true
% 71.62/71.81 % --res_lit_sel kbo_max
% 71.62/71.81 % --res_to_prop_solver none
% 71.62/71.81 % --res_prop_simpl_new false
% 71.62/71.81 % --res_prop_simpl_given false
% 71.62/71.81 % --res_passive_queue_type priority_queues
% 71.62/71.81 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 71.62/71.81 % --res_passive_queues_freq [15;5]
% 71.62/71.81 % --res_forward_subs full
% 71.62/71.81 % --res_backward_subs full
% 71.62/71.81 % --res_forward_subs_resolution true
% 71.62/71.81 % --res_backward_subs_resolution true
% 71.62/71.81 % --res_orphan_elimination false
% 71.62/71.81 % --res_time_limit 1000.
% 71.62/71.81 % --res_out_proof true
% 71.62/71.81 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8c2741.s
% 71.62/71.81 % --modulo true
% 71.62/71.81
% 71.62/71.81 % ------ Combination Options
% 71.62/71.81
% 71.62/71.81 % --comb_res_mult 1000
% 71.62/71.81 % --comb_inst_mult 300
% 71.62/71.81 % ------
% 71.62/71.81
% 71.62/71.81 % ------ Parsing...% successful
% 71.62/71.81
% 71.62/71.81 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 71.62/71.81
% 71.62/71.81 % ------ Proving...
% 71.62/71.81 % ------ Problem Properties
% 71.62/71.81
% 71.62/71.81 %
% 71.62/71.81 % EPR false
% 71.62/71.81 % Horn false
% 71.62/71.81 % Has equality false
% 71.62/71.81
% 71.62/71.81 % % ------ Input Options Time Limit: Unbounded
% 71.62/71.81
% 71.62/71.81
% 71.62/71.81 % % ------ Current options:
% 71.62/71.81
% 71.62/71.81 % ------ Input Options
% 71.62/71.81
% 71.62/71.81 % --out_options all
% 71.62/71.81 % --tptp_safe_out true
% 71.62/71.81 % --problem_path ""
% 71.62/71.81 % --include_path ""
% 71.62/71.81 % --clausifier .//eprover
% 71.62/71.81 % --clausifier_options --tstp-format
% 71.62/71.81 % --stdin false
% 71.62/71.81 % --dbg_backtrace false
% 71.62/71.81 % --dbg_dump_prop_clauses false
% 71.62/71.81 % --dbg_dump_prop_clauses_file -
% 71.62/71.81 % --dbg_out_stat false
% 71.62/71.81
% 71.62/71.81 % ------ General Options
% 71.62/71.81
% 71.62/71.81 % --fof false
% 71.62/71.81 % --time_out_real 150.
% 71.62/71.81 % --time_out_prep_mult 0.2
% 71.62/71.81 % --time_out_virtual -1.
% 71.62/71.81 % --schedule none
% 71.62/71.81 % --ground_splitting input
% 71.62/71.81 % --splitting_nvd 16
% 71.62/71.81 % --non_eq_to_eq false
% 71.62/71.81 % --prep_gs_sim true
% 71.62/71.81 % --prep_unflatten false
% 71.62/71.81 % --prep_res_sim true
% 71.62/71.81 % --prep_upred true
% 71.62/71.81 % --res_sim_input true
% 71.62/71.81 % --clause_weak_htbl true
% 71.62/71.81 % --gc_record_bc_elim false
% 71.62/71.81 % --symbol_type_check false
% 71.62/71.81 % --clausify_out false
% 71.62/71.81 % --large_theory_mode false
% 71.62/71.81 % --prep_sem_filter none
% 71.62/71.81 % --prep_sem_filter_out false
% 71.62/71.81 % --preprocessed_out false
% 71.62/71.81 % --sub_typing false
% 71.62/71.81 % --brand_transform false
% 71.62/71.81 % --pure_diseq_elim true
% 71.62/71.81 % --min_unsat_core false
% 71.62/71.81 % --pred_elim true
% 71.62/71.81 % --add_important_lit false
% 71.62/71.81 % --soft_assumptions false
% 71.62/71.81 % --reset_solvers false
% 71.62/71.81 % --bc_imp_inh []
% 71.62/71.81 % --conj_cone_tolerance 1.5
% 71.62/71.81 % --prolific_symb_bound 500
% 71.62/71.81 % --lt_threshold 2000
% 71.62/71.81
% 71.62/71.81 % ------ SAT Options
% 71.62/71.81
% 71.62/71.81 % --sat_mode false
% 71.62/71.81 % --sat_fm_restart_options ""
% 71.62/71.81 % --sat_gr_def false
% 71.62/71.81 % --sat_epr_types true
% 71.62/71.81 % --sat_non_cyclic_types false
% 71.62/71.81 % --sat_finite_models false
% 71.62/71.81 % --sat_fm_lemmas false
% 71.62/71.81 % --sat_fm_prep false
% 71.62/71.81 % --sat_fm_uc_incr true
% 71.62/71.81 % --sat_out_model small
% 71.62/71.81 % --sat_out_clauses false
% 71.62/71.81
% 71.62/71.81 % ------ QBF Options
% 71.62/71.81
% 71.62/71.81 % --qbf_mode false
% 71.62/71.81 % --qbf_elim_univ true
% 71.62/71.81 % --qbf_sk_in true
% 71.62/71.81 % --qbf_pred_elim true
% 71.62/71.81 % --qbf_split 32
% 71.62/71.81
% 71.62/71.81 % ------ BMC1 Options
% 71.62/71.81
% 71.62/71.81 % --bmc1_incremental false
% 71.62/71.81 % --bmc1_axioms reachable_all
% 71.62/71.81 % --bmc1_min_bound 0
% 71.62/71.81 % --bmc1_max_bound -1
% 71.62/71.81 % --bmc1_max_bound_default -1
% 71.62/71.81 % --bmc1_symbol_reachability true
% 71.62/71.81 % --bmc1_property_lemmas false
% 71.62/71.81 % --bmc1_k_induction false
% 71.62/71.81 % --bmc1_non_equiv_states false
% 71.62/71.81 % --bmc1_deadlock false
% 71.62/71.81 % --bmc1_ucm false
% 71.62/71.81 % --bmc1_add_unsat_core none
% 71.62/71.81 % --bmc1_unsat_core_children false
% 71.62/71.81 % --bmc1_unsat_core_extrapolate_axioms false
% 71.62/71.81 % --bmc1_out_stat full
% 71.62/71.81 % --bmc1_ground_init false
% 71.62/71.81 % --bmc1_pre_inst_next_state false
% 71.62/71.81 % --bmc1_pre_inst_state false
% 71.62/71.81 % --bmc1_pre_inst_reach_state false
% 71.62/71.81 % --bmc1_out_unsat_core false
% 71.62/71.81 % --bmc1_aig_witness_out false
% 71.62/71.81 % --bmc1_verbose false
% 71.62/71.81 % --bmc1_dump_clauses_tptp false
% 71.62/71.81 % --bmc1_dump_unsat_core_tptp false
% 71.62/71.81 % --bmc1_dump_file -
% 71.62/71.81 % --bmc1_ucm_expand_uc_limit 128
% 71.62/71.81 % --bmc1_ucm_n_expand_iterations 6
% 71.62/71.81 % --bmc1_ucm_extend_mode 1
% 71.62/71.81 % --bmc1_ucm_init_mode 2
% 71.62/71.81 % --bmc1_ucm_cone_mode none
% 71.62/71.81 % --bmc1_ucm_reduced_relation_type 0
% 71.62/71.81 % --bmc1_ucm_relax_model 4
% 71.62/71.81 % --bmc1_ucm_full_tr_after_sat true
% 71.62/71.81 % --bmc1_ucm_expand_neg_assumptions false
% 71.62/71.81 % --bmc1_ucm_layered_model none
% 71.62/71.81 % --bmc1_ucm_max_lemma_size 10
% 71.62/71.81
% 71.62/71.81 % ------ AIG Options
% 71.62/71.81
% 71.62/71.81 % --aig_mode false
% 71.62/71.81
% 71.62/71.81 % ------ Instantiation Options
% 71.62/71.81
% 71.62/71.81 % --instantiation_flag true
% 71.62/71.81 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 71.62/71.81 % --inst_solver_per_active 750
% 71.62/71.81 % --inst_solver_calls_frac 0.5
% 71.62/71.81 % --inst_passive_queue_type priority_queues
% 71.62/71.81 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 71.62/71.81 % --inst_passive_queues_freq [25;2]
% 71.62/71.81 % --inst_dismatching true
% 71.62/71.81 % --inst_eager_unprocessed_to_passive true
% 71.62/71.81 % --inst_prop_sim_given true
% 142.39/142.65 % --inst_prop_sim_new false
% 142.39/142.65 % --inst_orphan_elimination true
% 142.39/142.65 % --inst_learning_loop_flag true
% 142.39/142.65 % --inst_learning_start 3000
% 142.39/142.65 % --inst_learning_factor 2
% 142.39/142.65 % --inst_start_prop_sim_after_learn 3
% 142.39/142.65 % --inst_sel_renew solver
% 142.39/142.65 % --inst_lit_activity_flag true
% 142.39/142.65 % --inst_out_proof true
% 142.39/142.65
% 142.39/142.65 % ------ Resolution Options
% 142.39/142.65
% 142.39/142.65 % --resolution_flag true
% 142.39/142.65 % --res_lit_sel kbo_max
% 142.39/142.65 % --res_to_prop_solver none
% 142.39/142.65 % --res_prop_simpl_new false
% 142.39/142.65 % --res_prop_simpl_given false
% 142.39/142.65 % --res_passive_queue_type priority_queues
% 142.39/142.65 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 142.39/142.65 % --res_passive_queues_freq [15;5]
% 142.39/142.65 % --res_forward_subs full
% 142.39/142.65 % --res_backward_subs full
% 142.39/142.65 % --res_forward_subs_resolution true
% 142.39/142.65 % --res_backward_subs_resolution true
% 142.39/142.65 % --res_orphan_elimination false
% 142.39/142.65 % --res_time_limit 1000.
% 142.39/142.65 % --res_out_proof true
% 142.39/142.65 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8c2741.s
% 142.39/142.65 % --modulo true
% 142.39/142.65
% 142.39/142.65 % ------ Combination Options
% 142.39/142.65
% 142.39/142.65 % --comb_res_mult 1000
% 142.39/142.65 % --comb_inst_mult 300
% 142.39/142.65 % ------
% 142.39/142.65
% 142.39/142.65
% 142.39/142.65
% 142.39/142.65 % ------ Proving...
% 142.39/142.65 % warning: shown sat in sat incomplete mode
% 142.39/142.65 %
% 142.39/142.65
% 142.39/142.65
% 142.39/142.65 ------ Building Model...Done
% 142.39/142.65
% 142.39/142.65 %------ The model is defined over ground terms (initial term algebra).
% 142.39/142.65 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 142.39/142.65 %------ where \phi is a formula over the term algebra.
% 142.39/142.65 %------ If we have equality in the problem then it is also defined as a predicate above,
% 142.39/142.65 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 142.39/142.65 %------ See help for --sat_out_model for different model outputs.
% 142.39/142.65 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 142.39/142.65 %------ where the first argument stands for the sort ($i in the unsorted case)
% 142.39/142.65
% 142.39/142.65
% 142.39/142.65
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of ssSkC0
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 ( ssSkC0 <=>
% 142.39/142.65 $true
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of actual_world
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0] :
% 142.39/142.65 ( ~(actual_world(X0)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of group
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( group(X0,X1) <=>
% 142.39/142.65 (
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc18 & X1=skc19 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc18 & X1=skc20 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc18 & X1=skc26 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skc64 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skc65 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skc66 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of coat
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( coat(X0,X1) <=>
% 142.39/142.65 (
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf23(skc63,skc64) )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of black
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(black(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of cheap
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(cheap(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of ssSkP2
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1,X2] :
% 142.39/142.65 ( ~(ssSkP2(X0,X1,X2)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of down
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1,X2] :
% 142.39/142.65 ( ~(down(X0,X1,X2)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of lonely
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( lonely(X0,X1) <=>
% 142.39/142.65 (
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc18 & X1=skc22 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skc68 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of street
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(street(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of event
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( event(X0,X1) <=>
% 142.39/142.65 (
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc18 & X1=skc21 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skc67 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 ? [X2,X3] :
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf17(skc63,X2,X3) )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of present
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(present(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of barrel
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(barrel(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of placename
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( placename(X0,X1) <=>
% 142.39/142.65 (
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc18 & X1=skc23 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skc70 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of hollywood_placename
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(hollywood_placename(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of of
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1,X2] :
% 142.39/142.65 ( ~(of(X0,X1,X2)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of frontseat
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( frontseat(X0,X1) <=>
% 142.39/142.65 (
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc18 & X1=skc27 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skc69 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of city
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( city(X0,X1) <=>
% 142.39/142.65 (
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc18 & X1=skc24 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skc69 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of chevy
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( chevy(X0,X1) <=>
% 142.39/142.65 (
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc18 & X1=skc25 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skc69 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of white
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(white(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of dirty
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(dirty(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of old
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(old(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of agent
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1,X2] :
% 142.39/142.65 ( ~(agent(X0,X1,X2)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of in
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1,X2] :
% 142.39/142.65 ( ~(in(X0,X1,X2)) <=>
% 142.39/142.65 (
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skc67 | X2!=skc69 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skf12(skf23(skc63,skc64),skc63,X1) | X2!=X1 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skf12(skf21(skc64,skc63,X1),skc63,X2) | X2!=X2 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skf12(skf11(skc63,skc64),skc63,X1) | X2!=X1 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skf12(skf19(skc64,skc63,skc64),skc63,X1) | X2!=X1 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skf12(skf10(skc63,skc66),skc63,X1) | X2!=X1 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skf12(skf10(skc63,skc65),skc63,X1) | X2!=X1 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skf12(skf10(skc63,skc64),skc63,X1) | X2!=X1 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skf12(skf19(skc65,skc63,skc65),skc63,X1) | X2!=X1 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skf12(skf19(skc65,skc63,skc66),skc63,X1) | X2!=X1 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skf12(skf21(skc65,skc63,X1),skc63,X2) | X2!=X2 )
% 142.39/142.65 &
% 142.39/142.65 ( X1!=skf12(skf10(skc63,skc66),skc63,skc69) | X2!=skc69 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of ssSkP1
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1,X2] :
% 142.39/142.65 ( ~(ssSkP1(X0,X1,X2)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of ssSkP0
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(ssSkP0(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of two
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( two(X0,X1) <=>
% 142.39/142.65 (
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc18 & X1=skc26 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skc66 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of member
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1,X2] :
% 142.39/142.65 ( member(X0,X1,X2) <=>
% 142.39/142.65 (
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf23(skc63,skc64) & X2=skc64 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf10(skc63,skc64) & X2=skc64 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf10(skc63,skc65) & X2=skc65 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf10(skc63,skc66) & X2=skc66 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of state
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( state(X0,X1) <=>
% 142.39/142.65 (
% 142.39/142.65 ? [X2,X3] :
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf13(skc63,X2,X3) )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of be
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1,X2,X3] :
% 142.39/142.65 ( ~(be(X0,X1,X2,X3)) <=>
% 142.39/142.65 (
% 142.39/142.65 ? [X4,X5,X6,X7] :
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf13(skc63,X4,X5) & X2=skf16(X6,skc63,X7) & X3=skf12(skf23(skc63,skc64),skc63,X6) )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 ? [X4,X5,X6,X7] :
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf13(skc63,X4,X5) & X2=skf16(X6,skc63,X7) & X3=skf12(skf11(skc63,skc64),skc63,X6) )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 ? [X4,X5,X6,X7] :
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf13(skc63,X4,X5) & X2=skf16(X6,skc63,X7) & X3=skf12(skf19(skc64,skc63,skc64),skc63,X6) )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 ? [X4,X5,X6] :
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf13(skc63,X4,X5) & X2=skf16(skc69,skc63,X6) & X3=skc67 )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 ? [X4,X5,X6] :
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf13(skc63,X4,X5) & X2=skf16(skc69,skc63,X6) & X3=skf12(skf10(skc63,skc66),skc63,skc69) )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of patient
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1,X2] :
% 142.39/142.65 ( ~(patient(X0,X1,X2)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Positive definition of nonreflexive
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( nonreflexive(X0,X1) <=>
% 142.39/142.65 (
% 142.39/142.65 ? [X2,X3] :
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf17(skc63,X2,X3) )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of wear
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(wear(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of fellow
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(fellow(X0,X1)) <=>
% 142.39/142.65 (
% 142.39/142.65 ? [X2] :
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc18 & X1=skf11(skc18,X2) )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 |
% 142.39/142.65 ? [X2] :
% 142.39/142.65 (
% 142.39/142.65 ( X0=skc63 & X1=skf11(skc63,X2) )
% 142.39/142.65 )
% 142.39/142.65
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65 %------ Negative definition of young
% 142.39/142.65 fof(lit_def,axiom,
% 142.39/142.65 (! [X0,X1] :
% 142.39/142.65 ( ~(young(X0,X1)) <=>
% 142.39/142.65 $false
% 142.39/142.65 )
% 142.39/142.65 )
% 142.39/142.65 ).
% 142.39/142.65
% 142.39/142.65
% 142.39/142.65
% 142.39/142.65 % ------ Statistics
% 142.39/142.65
% 142.39/142.65 % ------ General
% 142.39/142.65
% 142.39/142.65 % num_of_input_clauses: 78
% 142.39/142.65 % num_of_input_neg_conjectures: 78
% 142.39/142.65 % num_of_splits: 0
% 142.39/142.65 % num_of_split_atoms: 0
% 142.39/142.65 % num_of_sem_filtered_clauses: 0
% 142.39/142.65 % num_of_subtypes: 0
% 142.39/142.65 % monotx_restored_types: 0
% 142.39/142.65 % sat_num_of_epr_types: 0
% 142.39/142.65 % sat_num_of_non_cyclic_types: 0
% 142.39/142.65 % sat_guarded_non_collapsed_types: 0
% 142.39/142.65 % is_epr: 0
% 142.39/142.65 % is_horn: 0
% 142.39/142.65 % has_eq: 0
% 142.39/142.65 % num_pure_diseq_elim: 0
% 142.39/142.65 % simp_replaced_by: 0
% 142.39/142.65 % res_preprocessed: 156
% 142.39/142.65 % prep_upred: 0
% 142.39/142.65 % prep_unflattend: 0
% 142.39/142.65 % pred_elim_cands: 0
% 142.39/142.65 % pred_elim: 0
% 142.39/142.65 % pred_elim_cl: 0
% 142.39/142.65 % pred_elim_cycles: 0
% 142.39/142.65 % forced_gc_time: 0
% 142.39/142.65 % gc_basic_clause_elim: 0
% 142.39/142.65 % parsing_time: 0.001
% 142.39/142.65 % sem_filter_time: 0.
% 142.39/142.65 % pred_elim_time: 0.
% 142.39/142.65 % out_proof_time: 0.
% 142.39/142.65 % monotx_time: 0.
% 142.39/142.65 % subtype_inf_time: 0.
% 142.39/142.65 % unif_index_cands_time: 0.022
% 142.39/142.65 % unif_index_add_time: 0.019
% 142.39/142.65 % total_time: 70.854
% 142.39/142.65 % num_of_symbols: 87
% 142.39/142.65 % num_of_terms: 26471
% 142.39/142.65
% 142.39/142.65 % ------ Propositional Solver
% 142.39/142.65
% 142.39/142.65 % prop_solver_calls: 24
% 142.39/142.65 % prop_fast_solver_calls: 867
% 142.39/142.65 % prop_num_of_clauses: 3231
% 142.39/142.65 % prop_preprocess_simplified: 4361
% 142.39/142.65 % prop_fo_subsumed: 0
% 142.39/142.65 % prop_solver_time: 0.001
% 142.39/142.65 % prop_fast_solver_time: 0.
% 142.39/142.65 % prop_unsat_core_time: 0.
% 142.39/142.65
% 142.39/142.65 % ------ QBF
% 142.39/142.65
% 142.39/142.65 % qbf_q_res: 0
% 142.39/142.65 % qbf_num_tautologies: 0
% 142.39/142.65 % qbf_prep_cycles: 0
% 142.39/142.65
% 142.39/142.65 % ------ BMC1
% 142.39/142.65
% 142.39/142.65 % bmc1_current_bound: -1
% 142.39/142.65 % bmc1_last_solved_bound: -1
% 142.39/142.65 % bmc1_unsat_core_size: -1
% 142.39/142.65 % bmc1_unsat_core_parents_size: -1
% 142.39/142.65 % bmc1_merge_next_fun: 0
% 142.39/142.65 % bmc1_unsat_core_clauses_time: 0.
% 142.39/142.65
% 142.39/142.65 % ------ Instantiation
% 142.39/142.65
% 142.39/142.65 % inst_num_of_clauses: 1785
% 142.39/142.65 % inst_num_in_passive: 0
% 142.39/142.65 % inst_num_in_active: 1785
% 142.39/142.65 % inst_num_in_unprocessed: 0
% 142.39/142.65 % inst_num_of_loops: 2476
% 142.39/142.65 % inst_num_of_learning_restarts: 0
% 142.39/142.65 % inst_num_moves_active_passive: 668
% 142.39/142.65 % inst_lit_activity: 418
% 142.39/142.65 % inst_lit_activity_moves: 0
% 142.39/142.65 % inst_num_tautologies: 0
% 142.39/142.65 % inst_num_prop_implied: 0
% 142.39/142.65 % inst_num_existing_simplified: 0
% 142.39/142.65 % inst_num_eq_res_simplified: 0
% 142.39/142.65 % inst_num_child_elim: 0
% 142.39/142.65 % inst_num_of_dismatching_blockings: 141
% 142.39/142.65 % inst_num_of_non_proper_insts: 3779
% 142.39/142.65 % inst_num_of_duplicates: 542
% 142.39/142.65 % inst_inst_num_from_inst_to_res: 0
% 142.39/142.65 % inst_dismatching_checking_time: 0.001
% 142.39/142.65
% 142.39/142.65 % ------ Resolution
% 142.39/142.65
% 142.39/142.65 % res_num_of_clauses: 426696
% 142.39/142.65 % res_num_in_passive: 444873
% 142.39/142.65 % res_num_in_active: 6408
% 142.39/142.65 % res_num_of_loops: 9000
% 142.39/142.65 % res_forward_subset_subsumed: 449999
% 142.39/142.65 % res_backward_subset_subsumed: 28347
% 142.39/142.65 % res_forward_subsumed: 1799
% 142.39/142.65 % res_backward_subsumed: 91
% 142.39/142.65 % res_forward_subsumption_resolution: 7794
% 142.39/142.65 % res_backward_subsumption_resolution: 111
% 142.39/142.65 % res_clause_to_clause_subsumption: 59800
% 142.39/142.65 % res_orphan_elimination: 0
% 142.39/142.65 % res_tautology_del: 41405
% 142.39/142.65 % res_num_eq_res_simplified: 0
% 142.39/142.65 % res_num_sel_changes: 0
% 142.39/142.65 % res_moves_from_active_to_pass: 0
% 142.39/142.65
% 142.39/142.65 % Status Unknown
% 142.39/142.65 % Last status :
% 142.39/142.65 % SZS status Unknown
%------------------------------------------------------------------------------