TSTP Solution File: NLP161+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP161+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n007.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:15 EDT 2022
% Result : Unknown 22.46s 22.65s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP161+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n007.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 : Thu Jun 30 16:36:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.43 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.43 % FOF problem with conjecture
% 0.20/0.43 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_43b39a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_28f6d1.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_05110d | grep -v "SZS"
% 0.20/0.45
% 0.20/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.45
% 0.20/0.45 %
% 0.20/0.45 % ------ iProver source info
% 0.20/0.45
% 0.20/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.45 % git: non_committed_changes: true
% 0.20/0.45 % git: last_make_outside_of_git: true
% 0.20/0.45
% 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.60/0.82 % --bmc1_dump_unsat_core_tptp false
% 0.60/0.82 % --bmc1_dump_file -
% 0.60/0.82 % --bmc1_ucm_expand_uc_limit 128
% 0.60/0.82 % --bmc1_ucm_n_expand_iterations 6
% 0.60/0.82 % --bmc1_ucm_extend_mode 1
% 0.60/0.82 % --bmc1_ucm_init_mode 2
% 0.60/0.82 % --bmc1_ucm_cone_mode none
% 0.60/0.82 % --bmc1_ucm_reduced_relation_type 0
% 0.60/0.82 % --bmc1_ucm_relax_model 4
% 0.60/0.82 % --bmc1_ucm_full_tr_after_sat true
% 0.60/0.82 % --bmc1_ucm_expand_neg_assumptions false
% 0.60/0.82 % --bmc1_ucm_layered_model none
% 0.60/0.82 % --bmc1_ucm_max_lemma_size 10
% 0.60/0.82
% 0.60/0.82 % ------ AIG Options
% 0.60/0.82
% 0.60/0.82 % --aig_mode false
% 0.60/0.82
% 0.60/0.82 % ------ Instantiation Options
% 0.60/0.82
% 0.60/0.82 % --instantiation_flag true
% 0.60/0.82 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.60/0.82 % --inst_solver_per_active 750
% 0.60/0.82 % --inst_solver_calls_frac 0.5
% 0.60/0.82 % --inst_passive_queue_type priority_queues
% 0.60/0.82 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.60/0.82 % --inst_passive_queues_freq [25;2]
% 0.60/0.82 % --inst_dismatching true
% 0.60/0.82 % --inst_eager_unprocessed_to_passive true
% 0.60/0.82 % --inst_prop_sim_given true
% 0.60/0.82 % --inst_prop_sim_new false
% 0.60/0.82 % --inst_orphan_elimination true
% 0.60/0.82 % --inst_learning_loop_flag true
% 0.60/0.82 % --inst_learning_start 3000
% 0.60/0.82 % --inst_learning_factor 2
% 0.60/0.82 % --inst_start_prop_sim_after_learn 3
% 0.60/0.82 % --inst_sel_renew solver
% 0.60/0.82 % --inst_lit_activity_flag true
% 0.60/0.82 % --inst_out_proof true
% 0.60/0.82
% 0.60/0.82 % ------ Resolution Options
% 0.60/0.82
% 0.60/0.82 % --resolution_flag true
% 0.60/0.82 % --res_lit_sel kbo_max
% 0.60/0.82 % --res_to_prop_solver none
% 0.60/0.82 % --res_prop_simpl_new false
% 0.60/0.82 % --res_prop_simpl_given false
% 0.60/0.82 % --res_passive_queue_type priority_queues
% 0.60/0.82 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.60/0.82 % --res_passive_queues_freq [15;5]
% 0.60/0.82 % --res_forward_subs full
% 0.60/0.82 % --res_backward_subs full
% 0.60/0.82 % --res_forward_subs_resolution true
% 0.60/0.82 % --res_backward_subs_resolution true
% 0.60/0.82 % --res_orphan_elimination false
% 0.60/0.82 % --res_time_limit 1000.
% 0.60/0.82 % --res_out_proof true
% 0.60/0.82 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_43b39a.s
% 0.60/0.82 % --modulo true
% 0.60/0.82
% 0.60/0.82 % ------ Combination Options
% 0.60/0.82
% 0.60/0.82 % --comb_res_mult 1000
% 0.60/0.82 % --comb_inst_mult 300
% 0.60/0.82 % ------
% 0.60/0.82
% 0.60/0.82 % ------ Parsing...% successful
% 0.60/0.82
% 0.60/0.82 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 54 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.60/0.82
% 0.60/0.82 % ------ Proving...
% 0.60/0.82 % ------ Problem Properties
% 0.60/0.82
% 0.60/0.82 %
% 0.60/0.82 % EPR false
% 0.60/0.82 % Horn false
% 0.60/0.82 % Has equality false
% 0.60/0.82
% 0.60/0.82 % % ------ Input Options Time Limit: Unbounded
% 0.60/0.82
% 0.60/0.82
% 0.60/0.82 % % ------ Current options:
% 0.60/0.82
% 0.60/0.82 % ------ Input Options
% 0.60/0.82
% 0.60/0.82 % --out_options all
% 0.60/0.82 % --tptp_safe_out true
% 0.60/0.82 % --problem_path ""
% 0.60/0.82 % --include_path ""
% 0.60/0.82 % --clausifier .//eprover
% 0.60/0.82 % --clausifier_options --tstp-format
% 0.60/0.82 % --stdin false
% 0.60/0.82 % --dbg_backtrace false
% 0.60/0.82 % --dbg_dump_prop_clauses false
% 0.60/0.82 % --dbg_dump_prop_clauses_file -
% 0.60/0.82 % --dbg_out_stat false
% 0.60/0.82
% 0.60/0.82 % ------ General Options
% 0.60/0.82
% 0.60/0.82 % --fof false
% 0.60/0.82 % --time_out_real 150.
% 0.60/0.82 % --time_out_prep_mult 0.2
% 0.60/0.82 % --time_out_virtual -1.
% 0.60/0.82 % --schedule none
% 0.60/0.82 % --ground_splitting input
% 0.60/0.82 % --splitting_nvd 16
% 0.60/0.82 % --non_eq_to_eq false
% 0.60/0.82 % --prep_gs_sim true
% 0.60/0.82 % --prep_unflatten false
% 0.60/0.82 % --prep_res_sim true
% 0.60/0.82 % --prep_upred true
% 0.60/0.82 % --res_sim_input true
% 0.60/0.82 % --clause_weak_htbl true
% 0.60/0.82 % --gc_record_bc_elim false
% 0.60/0.82 % --symbol_type_check false
% 0.60/0.82 % --clausify_out false
% 0.60/0.82 % --large_theory_mode false
% 0.60/0.82 % --prep_sem_filter none
% 0.60/0.82 % --prep_sem_filter_out false
% 0.60/0.82 % --preprocessed_out false
% 0.60/0.82 % --sub_typing false
% 0.60/0.82 % --brand_transform false
% 0.60/0.82 % --pure_diseq_elim true
% 0.60/0.82 % --min_unsat_core false
% 0.60/0.82 % --pred_elim true
% 0.60/0.82 % --add_important_lit false
% 0.60/0.82 % --soft_assumptions false
% 0.60/0.82 % --reset_solvers false
% 0.60/0.82 % --bc_imp_inh []
% 0.60/0.82 % --conj_cone_tolerance 1.5
% 0.60/0.82 % --prolific_symb_bound 500
% 0.60/0.82 % --lt_threshold 2000
% 0.60/0.82
% 0.60/0.82 % ------ SAT Options
% 0.60/0.82
% 0.60/0.82 % --sat_mode false
% 0.60/0.82 % --sat_fm_restart_options ""
% 0.60/0.82 % --sat_gr_def false
% 0.60/0.82 % --sat_epr_types true
% 0.60/0.82 % --sat_non_cyclic_types false
% 0.60/0.82 % --sat_finite_models false
% 0.60/0.82 % --sat_fm_lemmas false
% 0.60/0.82 % --sat_fm_prep false
% 0.60/0.82 % --sat_fm_uc_incr true
% 0.60/0.82 % --sat_out_model small
% 0.60/0.82 % --sat_out_clauses false
% 0.60/0.82
% 0.60/0.82 % ------ QBF Options
% 0.60/0.82
% 0.60/0.82 % --qbf_mode false
% 0.60/0.82 % --qbf_elim_univ true
% 0.60/0.82 % --qbf_sk_in true
% 0.60/0.82 % --qbf_pred_elim true
% 0.60/0.82 % --qbf_split 32
% 0.60/0.82
% 0.60/0.82 % ------ BMC1 Options
% 0.60/0.82
% 0.60/0.82 % --bmc1_incremental false
% 0.60/0.82 % --bmc1_axioms reachable_all
% 0.60/0.82 % --bmc1_min_bound 0
% 0.60/0.82 % --bmc1_max_bound -1
% 0.60/0.82 % --bmc1_max_bound_default -1
% 0.60/0.82 % --bmc1_symbol_reachability true
% 0.60/0.82 % --bmc1_property_lemmas false
% 0.60/0.82 % --bmc1_k_induction false
% 0.60/0.82 % --bmc1_non_equiv_states false
% 0.60/0.82 % --bmc1_deadlock false
% 0.60/0.82 % --bmc1_ucm false
% 0.60/0.82 % --bmc1_add_unsat_core none
% 0.60/0.82 % --bmc1_unsat_core_children false
% 0.60/0.82 % --bmc1_unsat_core_extrapolate_axioms false
% 0.60/0.82 % --bmc1_out_stat full
% 0.60/0.82 % --bmc1_ground_init false
% 0.60/0.82 % --bmc1_pre_inst_next_state false
% 0.60/0.82 % --bmc1_pre_inst_state false
% 0.60/0.82 % --bmc1_pre_inst_reach_state false
% 0.60/0.82 % --bmc1_out_unsat_core false
% 0.60/0.82 % --bmc1_aig_witness_out false
% 0.60/0.82 % --bmc1_verbose false
% 0.60/0.82 % --bmc1_dump_clauses_tptp false
% 0.60/0.82 % --bmc1_dump_unsat_core_tptp false
% 0.60/0.82 % --bmc1_dump_file -
% 0.60/0.82 % --bmc1_ucm_expand_uc_limit 128
% 0.60/0.82 % --bmc1_ucm_n_expand_iterations 6
% 0.60/0.82 % --bmc1_ucm_extend_mode 1
% 0.60/0.82 % --bmc1_ucm_init_mode 2
% 0.60/0.82 % --bmc1_ucm_cone_mode none
% 0.60/0.82 % --bmc1_ucm_reduced_relation_type 0
% 0.60/0.82 % --bmc1_ucm_relax_model 4
% 0.60/0.82 % --bmc1_ucm_full_tr_after_sat true
% 0.60/0.82 % --bmc1_ucm_expand_neg_assumptions false
% 0.60/0.82 % --bmc1_ucm_layered_model none
% 0.60/0.82 % --bmc1_ucm_max_lemma_size 10
% 0.60/0.82
% 0.60/0.82 % ------ AIG Options
% 0.60/0.82
% 0.60/0.82 % --aig_mode false
% 0.60/0.82
% 0.60/0.82 % ------ Instantiation Options
% 0.60/0.82
% 0.60/0.82 % --instantiation_flag true
% 0.60/0.82 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.60/0.82 % --inst_solver_per_active 750
% 0.60/0.82 % --inst_solver_calls_frac 0.5
% 0.60/0.82 % --inst_passive_queue_type priority_queues
% 0.60/0.82 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.60/0.82 % --inst_passive_queues_freq [25;2]
% 0.60/0.82 % --inst_dismatching true
% 0.60/0.82 % --inst_eager_unprocessed_to_passive true
% 11.20/11.39 % --inst_prop_sim_given true
% 11.20/11.39 % --inst_prop_sim_new false
% 11.20/11.39 % --inst_orphan_elimination true
% 11.20/11.39 % --inst_learning_loop_flag true
% 11.20/11.39 % --inst_learning_start 3000
% 11.20/11.39 % --inst_learning_factor 2
% 11.20/11.39 % --inst_start_prop_sim_after_learn 3
% 11.20/11.39 % --inst_sel_renew solver
% 11.20/11.39 % --inst_lit_activity_flag true
% 11.20/11.39 % --inst_out_proof true
% 11.20/11.39
% 11.20/11.39 % ------ Resolution Options
% 11.20/11.39
% 11.20/11.39 % --resolution_flag true
% 11.20/11.39 % --res_lit_sel kbo_max
% 11.20/11.39 % --res_to_prop_solver none
% 11.20/11.39 % --res_prop_simpl_new false
% 11.20/11.39 % --res_prop_simpl_given false
% 11.20/11.39 % --res_passive_queue_type priority_queues
% 11.20/11.39 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 11.20/11.39 % --res_passive_queues_freq [15;5]
% 11.20/11.39 % --res_forward_subs full
% 11.20/11.39 % --res_backward_subs full
% 11.20/11.39 % --res_forward_subs_resolution true
% 11.20/11.39 % --res_backward_subs_resolution true
% 11.20/11.39 % --res_orphan_elimination false
% 11.20/11.39 % --res_time_limit 1000.
% 11.20/11.39 % --res_out_proof true
% 11.20/11.39 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_43b39a.s
% 11.20/11.39 % --modulo true
% 11.20/11.39
% 11.20/11.39 % ------ Combination Options
% 11.20/11.39
% 11.20/11.39 % --comb_res_mult 1000
% 11.20/11.39 % --comb_inst_mult 300
% 11.20/11.39 % ------
% 11.20/11.39
% 11.20/11.39
% 11.20/11.39
% 11.20/11.39 % ------ Proving...
% 11.20/11.39 % warning: shown sat in sat incomplete mode
% 11.20/11.39 %
% 11.20/11.39
% 11.20/11.39
% 11.20/11.39 ------ Building Model...Done
% 11.20/11.39
% 11.20/11.39 %------ The model is defined over ground terms (initial term algebra).
% 11.20/11.39 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 11.20/11.39 %------ where \phi is a formula over the term algebra.
% 11.20/11.39 %------ If we have equality in the problem then it is also defined as a predicate above,
% 11.20/11.39 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 11.20/11.39 %------ See help for --sat_out_model for different model outputs.
% 11.20/11.39 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 11.20/11.39 %------ where the first argument stands for the sort ($i in the unsorted case)
% 11.20/11.39
% 11.20/11.39
% 11.20/11.39
% 11.20/11.39
% 11.20/11.39 %------ Positive definition of epred2_0
% 11.20/11.39 fof(lit_def,axiom,
% 11.20/11.39 ( epred2_0 <=>
% 11.20/11.39 $true
% 11.20/11.39 )
% 11.20/11.39 ).
% 11.20/11.39
% 11.20/11.39 %------ Positive definition of actual_world
% 11.20/11.39 fof(lit_def,axiom,
% 11.20/11.39 (! [X0] :
% 11.20/11.39 ( actual_world(X0) <=>
% 11.20/11.39 (
% 11.20/11.39 (
% 11.20/11.39 ( X0=sk3_esk1_0 )
% 11.20/11.39 )
% 11.20/11.39
% 11.20/11.39 )
% 11.20/11.39 )
% 11.20/11.39 )
% 11.20/11.39 ).
% 11.20/11.39
% 11.20/11.39 %------ Positive definition of group
% 11.20/11.39 fof(lit_def,axiom,
% 11.20/11.39 (! [X0,X1] :
% 11.20/11.39 ( group(X0,X1) <=>
% 11.20/11.39 (
% 11.20/11.39 (
% 11.20/11.39 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 )
% 11.20/11.39 )
% 11.20/11.39
% 11.20/11.39 |
% 11.20/11.39 (
% 11.20/11.39 ( X0=sk3_esk1_0 & X1=sk3_esk11_0 )
% 11.20/11.39 )
% 11.20/11.39
% 11.20/11.39 |
% 11.20/11.39 (
% 11.20/11.39 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 11.20/11.39 )
% 11.20/11.39
% 11.20/11.39 )
% 11.20/11.39 )
% 11.20/11.39 )
% 11.20/11.39 ).
% 11.20/11.39
% 11.20/11.39 %------ Positive definition of frontseat
% 11.20/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( frontseat(X0,X1) <=>
% 11.22/11.39 (
% 11.22/11.39 (
% 11.22/11.39 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 )
% 11.22/11.39 )
% 11.22/11.39
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of of
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2] :
% 11.22/11.39 ( ~(of(X0,X1,X2)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of city
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( city(X0,X1) <=>
% 11.22/11.39 (
% 11.22/11.39 (
% 11.22/11.39 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 11.22/11.39 )
% 11.22/11.39
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of hollywood_placename
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( ~(hollywood_placename(X0,X1)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of placename
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( ~(placename(X0,X1)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of chevy
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( ~(chevy(X0,X1)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of white
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( ~(white(X0,X1)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of dirty
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( ~(dirty(X0,X1)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of old
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( ~(old(X0,X1)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of street
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( ~(street(X0,X1)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of lonely
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( ~(lonely(X0,X1)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of event
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( event(X0,X1) <=>
% 11.22/11.39 (
% 11.22/11.39 (
% 11.22/11.39 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 )
% 11.22/11.39 )
% 11.22/11.39
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of agent
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2] :
% 11.22/11.39 ( ~(agent(X0,X1,X2)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of present
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( present(X0,X1) <=>
% 11.22/11.39 (
% 11.22/11.39 (
% 11.22/11.39 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 )
% 11.22/11.39 )
% 11.22/11.39
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of barrel
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( ~(barrel(X0,X1)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of down
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2] :
% 11.22/11.39 ( ~(down(X0,X1,X2)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Negative definition of in
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2] :
% 11.22/11.39 ( ~(in(X0,X1,X2)) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of two
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( two(X0,X1) <=>
% 11.22/11.39 (
% 11.22/11.39 (
% 11.22/11.39 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 )
% 11.22/11.39 )
% 11.22/11.39
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of wear
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( wear(X0,X1) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of nonreflexive
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1] :
% 11.22/11.39 ( nonreflexive(X0,X1) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of epred1_0
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 ( epred1_0 <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of member
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2] :
% 11.22/11.39 ( member(X0,X1,X2) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP0_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 11.22/11.39 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP3_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP5_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 11.22/11.39 ( sP5_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP6_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 11.22/11.39 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP8_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP8_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP9_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP12_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 11.22/11.39 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP14_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP14_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP15_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP17_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP17_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP18_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 11.22/11.39 ( sP18_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP21_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP23_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 11.22/11.39 ( sP23_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 11.22/11.39 $false
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP24_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 11.22/11.39 ( sP24_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP26_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 11.22/11.39 ( sP26_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP28_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP28_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP30_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP32_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 11.22/11.39 ( sP32_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP35_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP35_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP38_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 11.22/11.39 ( sP38_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP41_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP44_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 11.22/11.39 ( sP44_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP47_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP47_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP50_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 11.22/11.39 ( sP50_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39 %------ Positive definition of sP52_iProver_split
% 11.22/11.39 fof(lit_def,axiom,
% 11.22/11.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 11.22/11.39 ( sP52_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 11.22/11.39 $true
% 11.22/11.39 )
% 11.22/11.39 )
% 11.22/11.39 ).
% 11.22/11.39
% 11.22/11.39
% 11.22/11.39
% 11.22/11.39 % ------ Statistics
% 11.22/11.39
% 11.22/11.39 % ------ General
% 11.22/11.39
% 11.22/11.39 % num_of_input_clauses: 121
% 11.22/11.39 % num_of_input_neg_conjectures: 1
% 11.22/11.39 % num_of_splits: 54
% 11.22/11.39 % num_of_split_atoms: 54
% 11.22/11.39 % num_of_sem_filtered_clauses: 0
% 11.22/11.39 % num_of_subtypes: 0
% 11.22/11.39 % monotx_restored_types: 0
% 11.22/11.39 % sat_num_of_epr_types: 0
% 11.22/11.39 % sat_num_of_non_cyclic_types: 0
% 11.22/11.39 % sat_guarded_non_collapsed_types: 0
% 11.22/11.39 % is_epr: 0
% 11.22/11.39 % is_horn: 0
% 11.22/11.39 % has_eq: 0
% 11.22/11.39 % num_pure_diseq_elim: 0
% 11.22/11.39 % simp_replaced_by: 0
% 11.22/11.39 % res_preprocessed: 176
% 11.22/11.39 % prep_upred: 0
% 11.22/11.39 % prep_unflattend: 0
% 11.22/11.39 % pred_elim_cands: 85
% 11.22/11.39 % pred_elim: 15
% 11.22/11.39 % pred_elim_cl: 15
% 11.22/11.39 % pred_elim_cycles: 80
% 11.22/11.39 % forced_gc_time: 0
% 11.22/11.39 % gc_basic_clause_elim: 0
% 11.22/11.39 % parsing_time: 0.023
% 11.22/11.39 % sem_filter_time: 0.
% 11.22/11.39 % pred_elim_time: 0.291
% 11.22/11.39 % out_proof_time: 0.
% 11.22/11.39 % monotx_time: 0.
% 11.22/11.39 % subtype_inf_time: 0.
% 11.22/11.39 % unif_index_cands_time: 0.008
% 11.22/11.39 % unif_index_add_time: 0.009
% 11.22/11.39 % total_time: 10.952
% 11.22/11.39 % num_of_symbols: 146
% 11.22/11.39 % num_of_terms: 17113
% 11.22/11.39
% 11.22/11.39 % ------ Propositional Solver
% 11.22/11.39
% 11.22/11.39 % prop_solver_calls: 7
% 11.22/11.39 % prop_fast_solver_calls: 6904
% 11.22/11.39 % prop_num_of_clauses: 3003
% 11.22/11.39 % prop_preprocess_simplified: 4880
% 11.22/11.39 % prop_fo_subsumed: 112
% 11.22/11.39 % prop_solver_time: 0.
% 11.22/11.39 % prop_fast_solver_time: 0.013
% 11.22/11.39 % prop_unsat_core_time: 0.
% 11.22/11.39
% 11.22/11.39 % ------ QBF
% 11.22/11.39
% 11.22/11.39 % qbf_q_res: 0
% 11.22/11.39 % qbf_num_tautologies: 0
% 11.22/11.39 % qbf_prep_cycles: 0
% 11.22/11.39
% 11.22/11.39 % ------ BMC1
% 11.22/11.39
% 11.22/11.39 % bmc1_current_bound: -1
% 11.22/11.39 % bmc1_last_solved_bound: -1
% 11.22/11.39 % bmc1_unsat_core_size: -1
% 11.22/11.39 % bmc1_unsat_core_parents_size: -1
% 11.22/11.39 % bmc1_merge_next_fun: 0
% 11.22/11.39 % bmc1_unsat_core_clauses_time: 0.
% 11.22/11.39
% 11.22/11.39 % ------ Instantiation
% 11.22/11.39
% 11.22/11.39 % inst_num_of_clauses: 1284
% 11.22/11.39 % inst_num_in_passive: 0
% 11.22/11.39 % inst_num_in_active: 1284
% 11.22/11.39 % inst_num_in_unprocessed: 0
% 11.22/11.39 % inst_num_of_loops: 1290
% 11.22/11.39 % inst_num_of_learning_restarts: 0
% 11.22/11.39 % inst_num_moves_active_passive: 0
% 11.22/11.39 % inst_lit_activity: 397
% 11.22/11.39 % inst_lit_activity_moves: 0
% 11.22/11.39 % inst_num_tautologies: 0
% 11.22/11.39 % inst_num_prop_implied: 0
% 11.22/11.39 % inst_num_existing_simplified: 0
% 11.22/11.39 % inst_num_eq_res_simplified: 0
% 11.22/11.39 % inst_num_child_elim: 0
% 11.22/11.39 % inst_num_of_dismatching_blockings: 0
% 11.22/11.39 % inst_num_of_non_proper_insts: 1124
% 11.22/11.39 % inst_num_of_duplicates: 0
% 11.22/11.39 % inst_inst_num_from_inst_to_res: 0
% 11.22/11.39 % inst_dismatching_checking_time: 0.
% 11.22/11.39
% 11.22/11.39 % ------ Resolution
% 11.22/11.39
% 11.22/11.39 % res_num_of_clauses: 17434
% 11.22/11.39 % res_num_in_passive: 13046
% 11.22/11.39 % res_num_in_active: 4396
% 11.22/11.39 % res_num_of_loops: 5000
% 11.22/11.39 % res_forward_subset_subsumed: 3326
% 11.22/11.39 % res_backward_subset_subsumed: 44
% 11.22/11.39 % res_forward_subsumed: 0
% 11.22/11.39 % res_backward_subsumed: 0
% 11.22/11.39 % res_forward_subsumption_resolution: 2734
% 11.22/11.39 % res_backward_subsumption_resolution: 0
% 11.22/11.39 % res_clause_to_clause_subsumption: 11212
% 11.22/11.39 % res_orphan_elimination: 0
% 11.22/11.39 % res_tautology_del: 6179
% 11.22/11.39 % res_num_eq_res_simplified: 0
% 11.22/11.39 % res_num_sel_changes: 0
% 11.22/11.39 % res_moves_from_active_to_pass: 0
% 11.22/11.39
% 11.22/11.39 % Status Unknown
% 11.24/11.46 % Orienting using strategy ClausalAll
% 11.24/11.46 % FOF problem with conjecture
% 11.24/11.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/sandbox2/tmp/iprover_proof_43b39a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_28f6d1.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_e9c378 | grep -v "SZS"
% 11.24/11.48
% 11.24/11.48 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 11.24/11.48
% 11.24/11.48 %
% 11.24/11.48 % ------ iProver source info
% 11.24/11.48
% 11.24/11.48 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 11.24/11.48 % git: non_committed_changes: true
% 11.24/11.48 % git: last_make_outside_of_git: true
% 11.24/11.48
% 11.24/11.48 %
% 11.24/11.48 % ------ Input Options
% 11.24/11.48
% 11.24/11.48 % --out_options all
% 11.24/11.48 % --tptp_safe_out true
% 11.24/11.48 % --problem_path ""
% 11.24/11.48 % --include_path ""
% 11.24/11.48 % --clausifier .//eprover
% 11.24/11.48 % --clausifier_options --tstp-format
% 11.24/11.48 % --stdin false
% 11.24/11.48 % --dbg_backtrace false
% 11.24/11.48 % --dbg_dump_prop_clauses false
% 11.24/11.48 % --dbg_dump_prop_clauses_file -
% 11.24/11.48 % --dbg_out_stat false
% 11.24/11.48
% 11.24/11.48 % ------ General Options
% 11.24/11.48
% 11.24/11.48 % --fof false
% 11.24/11.48 % --time_out_real 150.
% 11.24/11.48 % --time_out_prep_mult 0.2
% 11.24/11.48 % --time_out_virtual -1.
% 11.24/11.48 % --schedule none
% 11.24/11.48 % --ground_splitting input
% 11.24/11.48 % --splitting_nvd 16
% 11.24/11.48 % --non_eq_to_eq false
% 11.24/11.48 % --prep_gs_sim true
% 11.24/11.48 % --prep_unflatten false
% 11.24/11.48 % --prep_res_sim true
% 11.24/11.48 % --prep_upred true
% 11.24/11.48 % --res_sim_input true
% 11.24/11.48 % --clause_weak_htbl true
% 11.24/11.48 % --gc_record_bc_elim false
% 11.24/11.48 % --symbol_type_check false
% 11.24/11.48 % --clausify_out false
% 11.24/11.48 % --large_theory_mode false
% 11.24/11.48 % --prep_sem_filter none
% 11.24/11.48 % --prep_sem_filter_out false
% 11.24/11.48 % --preprocessed_out false
% 11.24/11.48 % --sub_typing false
% 11.24/11.48 % --brand_transform false
% 11.24/11.48 % --pure_diseq_elim true
% 11.24/11.48 % --min_unsat_core false
% 11.24/11.48 % --pred_elim true
% 11.24/11.48 % --add_important_lit false
% 11.24/11.48 % --soft_assumptions false
% 11.24/11.48 % --reset_solvers false
% 11.24/11.48 % --bc_imp_inh []
% 11.24/11.48 % --conj_cone_tolerance 1.5
% 11.24/11.48 % --prolific_symb_bound 500
% 11.24/11.48 % --lt_threshold 2000
% 11.24/11.48
% 11.24/11.48 % ------ SAT Options
% 11.24/11.48
% 11.24/11.48 % --sat_mode false
% 11.24/11.48 % --sat_fm_restart_options ""
% 11.24/11.48 % --sat_gr_def false
% 11.24/11.48 % --sat_epr_types true
% 11.24/11.48 % --sat_non_cyclic_types false
% 11.24/11.48 % --sat_finite_models false
% 11.24/11.48 % --sat_fm_lemmas false
% 11.24/11.48 % --sat_fm_prep false
% 11.24/11.48 % --sat_fm_uc_incr true
% 11.24/11.48 % --sat_out_model small
% 11.24/11.48 % --sat_out_clauses false
% 11.24/11.48
% 11.24/11.48 % ------ QBF Options
% 11.24/11.48
% 11.24/11.48 % --qbf_mode false
% 11.24/11.48 % --qbf_elim_univ true
% 11.24/11.48 % --qbf_sk_in true
% 11.24/11.48 % --qbf_pred_elim true
% 11.24/11.48 % --qbf_split 32
% 11.24/11.48
% 11.24/11.48 % ------ BMC1 Options
% 11.24/11.48
% 11.24/11.48 % --bmc1_incremental false
% 11.24/11.48 % --bmc1_axioms reachable_all
% 11.24/11.48 % --bmc1_min_bound 0
% 11.24/11.48 % --bmc1_max_bound -1
% 11.24/11.48 % --bmc1_max_bound_default -1
% 11.24/11.48 % --bmc1_symbol_reachability true
% 11.24/11.48 % --bmc1_property_lemmas false
% 11.24/11.48 % --bmc1_k_induction false
% 11.24/11.48 % --bmc1_non_equiv_states false
% 11.24/11.48 % --bmc1_deadlock false
% 11.24/11.48 % --bmc1_ucm false
% 11.24/11.48 % --bmc1_add_unsat_core none
% 11.24/11.48 % --bmc1_unsat_core_children false
% 11.24/11.48 % --bmc1_unsat_core_extrapolate_axioms false
% 11.24/11.48 % --bmc1_out_stat full
% 11.24/11.48 % --bmc1_ground_init false
% 11.24/11.48 % --bmc1_pre_inst_next_state false
% 11.24/11.48 % --bmc1_pre_inst_state false
% 11.24/11.48 % --bmc1_pre_inst_reach_state false
% 11.24/11.48 % --bmc1_out_unsat_core false
% 11.24/11.48 % --bmc1_aig_witness_out false
% 11.24/11.48 % --bmc1_verbose false
% 11.24/11.48 % --bmc1_dump_clauses_tptp false
% 11.66/11.84 % --bmc1_dump_unsat_core_tptp false
% 11.66/11.84 % --bmc1_dump_file -
% 11.66/11.84 % --bmc1_ucm_expand_uc_limit 128
% 11.66/11.84 % --bmc1_ucm_n_expand_iterations 6
% 11.66/11.84 % --bmc1_ucm_extend_mode 1
% 11.66/11.84 % --bmc1_ucm_init_mode 2
% 11.66/11.84 % --bmc1_ucm_cone_mode none
% 11.66/11.84 % --bmc1_ucm_reduced_relation_type 0
% 11.66/11.84 % --bmc1_ucm_relax_model 4
% 11.66/11.84 % --bmc1_ucm_full_tr_after_sat true
% 11.66/11.84 % --bmc1_ucm_expand_neg_assumptions false
% 11.66/11.84 % --bmc1_ucm_layered_model none
% 11.66/11.84 % --bmc1_ucm_max_lemma_size 10
% 11.66/11.84
% 11.66/11.84 % ------ AIG Options
% 11.66/11.84
% 11.66/11.84 % --aig_mode false
% 11.66/11.84
% 11.66/11.84 % ------ Instantiation Options
% 11.66/11.84
% 11.66/11.84 % --instantiation_flag true
% 11.66/11.84 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 11.66/11.84 % --inst_solver_per_active 750
% 11.66/11.84 % --inst_solver_calls_frac 0.5
% 11.66/11.84 % --inst_passive_queue_type priority_queues
% 11.66/11.84 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 11.66/11.84 % --inst_passive_queues_freq [25;2]
% 11.66/11.84 % --inst_dismatching true
% 11.66/11.84 % --inst_eager_unprocessed_to_passive true
% 11.66/11.84 % --inst_prop_sim_given true
% 11.66/11.84 % --inst_prop_sim_new false
% 11.66/11.84 % --inst_orphan_elimination true
% 11.66/11.84 % --inst_learning_loop_flag true
% 11.66/11.84 % --inst_learning_start 3000
% 11.66/11.84 % --inst_learning_factor 2
% 11.66/11.84 % --inst_start_prop_sim_after_learn 3
% 11.66/11.84 % --inst_sel_renew solver
% 11.66/11.84 % --inst_lit_activity_flag true
% 11.66/11.84 % --inst_out_proof true
% 11.66/11.84
% 11.66/11.84 % ------ Resolution Options
% 11.66/11.84
% 11.66/11.84 % --resolution_flag true
% 11.66/11.84 % --res_lit_sel kbo_max
% 11.66/11.84 % --res_to_prop_solver none
% 11.66/11.84 % --res_prop_simpl_new false
% 11.66/11.84 % --res_prop_simpl_given false
% 11.66/11.84 % --res_passive_queue_type priority_queues
% 11.66/11.84 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 11.66/11.84 % --res_passive_queues_freq [15;5]
% 11.66/11.84 % --res_forward_subs full
% 11.66/11.84 % --res_backward_subs full
% 11.66/11.84 % --res_forward_subs_resolution true
% 11.66/11.84 % --res_backward_subs_resolution true
% 11.66/11.84 % --res_orphan_elimination false
% 11.66/11.84 % --res_time_limit 1000.
% 11.66/11.84 % --res_out_proof true
% 11.66/11.84 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_43b39a.s
% 11.66/11.84 % --modulo true
% 11.66/11.84
% 11.66/11.84 % ------ Combination Options
% 11.66/11.84
% 11.66/11.84 % --comb_res_mult 1000
% 11.66/11.84 % --comb_inst_mult 300
% 11.66/11.84 % ------
% 11.66/11.84
% 11.66/11.84 % ------ Parsing...% successful
% 11.66/11.84
% 11.66/11.84 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 54 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 11.66/11.84
% 11.66/11.84 % ------ Proving...
% 11.66/11.84 % ------ Problem Properties
% 11.66/11.84
% 11.66/11.84 %
% 11.66/11.84 % EPR false
% 11.66/11.84 % Horn false
% 11.66/11.84 % Has equality false
% 11.66/11.84
% 11.66/11.84 % % ------ Input Options Time Limit: Unbounded
% 11.66/11.84
% 11.66/11.84
% 11.66/11.84 % % ------ Current options:
% 11.66/11.84
% 11.66/11.84 % ------ Input Options
% 11.66/11.84
% 11.66/11.84 % --out_options all
% 11.66/11.84 % --tptp_safe_out true
% 11.66/11.84 % --problem_path ""
% 11.66/11.84 % --include_path ""
% 11.66/11.84 % --clausifier .//eprover
% 11.66/11.84 % --clausifier_options --tstp-format
% 11.66/11.84 % --stdin false
% 11.66/11.84 % --dbg_backtrace false
% 11.66/11.84 % --dbg_dump_prop_clauses false
% 11.66/11.84 % --dbg_dump_prop_clauses_file -
% 11.66/11.84 % --dbg_out_stat false
% 11.66/11.84
% 11.66/11.84 % ------ General Options
% 11.66/11.84
% 11.66/11.84 % --fof false
% 11.66/11.84 % --time_out_real 150.
% 11.66/11.84 % --time_out_prep_mult 0.2
% 11.66/11.84 % --time_out_virtual -1.
% 11.66/11.84 % --schedule none
% 11.66/11.84 % --ground_splitting input
% 11.66/11.84 % --splitting_nvd 16
% 11.66/11.84 % --non_eq_to_eq false
% 11.66/11.84 % --prep_gs_sim true
% 11.66/11.84 % --prep_unflatten false
% 11.66/11.84 % --prep_res_sim true
% 11.66/11.84 % --prep_upred true
% 11.66/11.84 % --res_sim_input true
% 11.66/11.84 % --clause_weak_htbl true
% 11.66/11.84 % --gc_record_bc_elim false
% 11.66/11.84 % --symbol_type_check false
% 11.66/11.84 % --clausify_out false
% 11.66/11.84 % --large_theory_mode false
% 11.66/11.84 % --prep_sem_filter none
% 11.66/11.84 % --prep_sem_filter_out false
% 11.66/11.84 % --preprocessed_out false
% 11.66/11.84 % --sub_typing false
% 11.66/11.84 % --brand_transform false
% 11.66/11.84 % --pure_diseq_elim true
% 11.66/11.84 % --min_unsat_core false
% 11.66/11.84 % --pred_elim true
% 11.66/11.84 % --add_important_lit false
% 11.66/11.84 % --soft_assumptions false
% 11.66/11.84 % --reset_solvers false
% 11.66/11.84 % --bc_imp_inh []
% 11.66/11.84 % --conj_cone_tolerance 1.5
% 11.66/11.84 % --prolific_symb_bound 500
% 11.66/11.84 % --lt_threshold 2000
% 11.66/11.84
% 11.66/11.84 % ------ SAT Options
% 11.66/11.84
% 11.66/11.84 % --sat_mode false
% 11.66/11.84 % --sat_fm_restart_options ""
% 11.66/11.84 % --sat_gr_def false
% 11.66/11.84 % --sat_epr_types true
% 11.66/11.84 % --sat_non_cyclic_types false
% 11.66/11.84 % --sat_finite_models false
% 11.66/11.84 % --sat_fm_lemmas false
% 11.66/11.84 % --sat_fm_prep false
% 11.66/11.84 % --sat_fm_uc_incr true
% 11.66/11.84 % --sat_out_model small
% 11.66/11.84 % --sat_out_clauses false
% 11.66/11.84
% 11.66/11.84 % ------ QBF Options
% 11.66/11.84
% 11.66/11.84 % --qbf_mode false
% 11.66/11.84 % --qbf_elim_univ true
% 11.66/11.84 % --qbf_sk_in true
% 11.66/11.84 % --qbf_pred_elim true
% 11.66/11.84 % --qbf_split 32
% 11.66/11.84
% 11.66/11.84 % ------ BMC1 Options
% 11.66/11.84
% 11.66/11.84 % --bmc1_incremental false
% 11.66/11.84 % --bmc1_axioms reachable_all
% 11.66/11.84 % --bmc1_min_bound 0
% 11.66/11.84 % --bmc1_max_bound -1
% 11.66/11.84 % --bmc1_max_bound_default -1
% 11.66/11.84 % --bmc1_symbol_reachability true
% 11.66/11.84 % --bmc1_property_lemmas false
% 11.66/11.84 % --bmc1_k_induction false
% 11.66/11.84 % --bmc1_non_equiv_states false
% 11.66/11.84 % --bmc1_deadlock false
% 11.66/11.84 % --bmc1_ucm false
% 11.66/11.84 % --bmc1_add_unsat_core none
% 11.66/11.84 % --bmc1_unsat_core_children false
% 11.66/11.84 % --bmc1_unsat_core_extrapolate_axioms false
% 11.66/11.84 % --bmc1_out_stat full
% 11.66/11.84 % --bmc1_ground_init false
% 11.66/11.84 % --bmc1_pre_inst_next_state false
% 11.66/11.84 % --bmc1_pre_inst_state false
% 11.66/11.84 % --bmc1_pre_inst_reach_state false
% 11.66/11.84 % --bmc1_out_unsat_core false
% 11.66/11.84 % --bmc1_aig_witness_out false
% 11.66/11.84 % --bmc1_verbose false
% 11.66/11.84 % --bmc1_dump_clauses_tptp false
% 11.66/11.84 % --bmc1_dump_unsat_core_tptp false
% 11.66/11.84 % --bmc1_dump_file -
% 11.66/11.84 % --bmc1_ucm_expand_uc_limit 128
% 11.66/11.84 % --bmc1_ucm_n_expand_iterations 6
% 11.66/11.84 % --bmc1_ucm_extend_mode 1
% 11.66/11.84 % --bmc1_ucm_init_mode 2
% 11.66/11.84 % --bmc1_ucm_cone_mode none
% 11.66/11.84 % --bmc1_ucm_reduced_relation_type 0
% 11.66/11.84 % --bmc1_ucm_relax_model 4
% 11.66/11.84 % --bmc1_ucm_full_tr_after_sat true
% 11.66/11.84 % --bmc1_ucm_expand_neg_assumptions false
% 11.66/11.84 % --bmc1_ucm_layered_model none
% 11.66/11.84 % --bmc1_ucm_max_lemma_size 10
% 11.66/11.84
% 11.66/11.84 % ------ AIG Options
% 11.66/11.84
% 11.66/11.84 % --aig_mode false
% 11.66/11.84
% 11.66/11.84 % ------ Instantiation Options
% 11.66/11.84
% 11.66/11.84 % --instantiation_flag true
% 11.66/11.84 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 11.66/11.84 % --inst_solver_per_active 750
% 11.66/11.84 % --inst_solver_calls_frac 0.5
% 11.66/11.84 % --inst_passive_queue_type priority_queues
% 11.66/11.84 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 11.66/11.84 % --inst_passive_queues_freq [25;2]
% 11.66/11.84 % --inst_dismatching true
% 11.66/11.84 % --inst_eager_unprocessed_to_passive true
% 22.46/22.65 % --inst_prop_sim_given true
% 22.46/22.65 % --inst_prop_sim_new false
% 22.46/22.65 % --inst_orphan_elimination true
% 22.46/22.65 % --inst_learning_loop_flag true
% 22.46/22.65 % --inst_learning_start 3000
% 22.46/22.65 % --inst_learning_factor 2
% 22.46/22.65 % --inst_start_prop_sim_after_learn 3
% 22.46/22.65 % --inst_sel_renew solver
% 22.46/22.65 % --inst_lit_activity_flag true
% 22.46/22.65 % --inst_out_proof true
% 22.46/22.65
% 22.46/22.65 % ------ Resolution Options
% 22.46/22.65
% 22.46/22.65 % --resolution_flag true
% 22.46/22.65 % --res_lit_sel kbo_max
% 22.46/22.65 % --res_to_prop_solver none
% 22.46/22.65 % --res_prop_simpl_new false
% 22.46/22.65 % --res_prop_simpl_given false
% 22.46/22.65 % --res_passive_queue_type priority_queues
% 22.46/22.65 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 22.46/22.65 % --res_passive_queues_freq [15;5]
% 22.46/22.65 % --res_forward_subs full
% 22.46/22.65 % --res_backward_subs full
% 22.46/22.65 % --res_forward_subs_resolution true
% 22.46/22.65 % --res_backward_subs_resolution true
% 22.46/22.65 % --res_orphan_elimination false
% 22.46/22.65 % --res_time_limit 1000.
% 22.46/22.65 % --res_out_proof true
% 22.46/22.65 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_43b39a.s
% 22.46/22.65 % --modulo true
% 22.46/22.65
% 22.46/22.65 % ------ Combination Options
% 22.46/22.65
% 22.46/22.65 % --comb_res_mult 1000
% 22.46/22.65 % --comb_inst_mult 300
% 22.46/22.65 % ------
% 22.46/22.65
% 22.46/22.65
% 22.46/22.65
% 22.46/22.65 % ------ Proving...
% 22.46/22.65 % warning: shown sat in sat incomplete mode
% 22.46/22.65 %
% 22.46/22.65
% 22.46/22.65
% 22.46/22.65 ------ Building Model...Done
% 22.46/22.65
% 22.46/22.65 %------ The model is defined over ground terms (initial term algebra).
% 22.46/22.65 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 22.46/22.65 %------ where \phi is a formula over the term algebra.
% 22.46/22.65 %------ If we have equality in the problem then it is also defined as a predicate above,
% 22.46/22.65 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 22.46/22.65 %------ See help for --sat_out_model for different model outputs.
% 22.46/22.65 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 22.46/22.65 %------ where the first argument stands for the sort ($i in the unsorted case)
% 22.46/22.65
% 22.46/22.65
% 22.46/22.65
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of epred2_0
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 ( epred2_0 <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of actual_world
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0] :
% 22.46/22.65 ( actual_world(X0) <=>
% 22.46/22.65 (
% 22.46/22.65 (
% 22.46/22.65 ( X0=sk2_esk1_0 )
% 22.46/22.65 )
% 22.46/22.65
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of group
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( group(X0,X1) <=>
% 22.46/22.65 (
% 22.46/22.65 (
% 22.46/22.65 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 )
% 22.46/22.65 )
% 22.46/22.65
% 22.46/22.65 |
% 22.46/22.65 (
% 22.46/22.65 ( X0=sk2_esk1_0 & X1=sk2_esk11_0 )
% 22.46/22.65 )
% 22.46/22.65
% 22.46/22.65 |
% 22.46/22.65 (
% 22.46/22.65 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 22.46/22.65 )
% 22.46/22.65
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of frontseat
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( frontseat(X0,X1) <=>
% 22.46/22.65 (
% 22.46/22.65 (
% 22.46/22.65 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 )
% 22.46/22.65 )
% 22.46/22.65
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of of
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2] :
% 22.46/22.65 ( ~(of(X0,X1,X2)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of city
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( city(X0,X1) <=>
% 22.46/22.65 (
% 22.46/22.65 (
% 22.46/22.65 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 22.46/22.65 )
% 22.46/22.65
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of hollywood_placename
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( ~(hollywood_placename(X0,X1)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of placename
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( ~(placename(X0,X1)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of chevy
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( ~(chevy(X0,X1)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of white
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( ~(white(X0,X1)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of dirty
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( ~(dirty(X0,X1)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of old
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( ~(old(X0,X1)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of street
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( ~(street(X0,X1)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of lonely
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( ~(lonely(X0,X1)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of event
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( event(X0,X1) <=>
% 22.46/22.65 (
% 22.46/22.65 (
% 22.46/22.65 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 )
% 22.46/22.65 )
% 22.46/22.65
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of agent
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2] :
% 22.46/22.65 ( ~(agent(X0,X1,X2)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of present
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( present(X0,X1) <=>
% 22.46/22.65 (
% 22.46/22.65 (
% 22.46/22.65 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 )
% 22.46/22.65 )
% 22.46/22.65
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of barrel
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( ~(barrel(X0,X1)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of down
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2] :
% 22.46/22.65 ( ~(down(X0,X1,X2)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Negative definition of in
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2] :
% 22.46/22.65 ( ~(in(X0,X1,X2)) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of two
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( two(X0,X1) <=>
% 22.46/22.65 (
% 22.46/22.65 (
% 22.46/22.65 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 )
% 22.46/22.65 )
% 22.46/22.65
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of wear
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( wear(X0,X1) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of nonreflexive
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1] :
% 22.46/22.65 ( nonreflexive(X0,X1) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of epred1_0
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 ( epred1_0 <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of member
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2] :
% 22.46/22.65 ( member(X0,X1,X2) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP0_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 22.46/22.65 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP3_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP5_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 22.46/22.65 ( sP5_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP6_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 22.46/22.65 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP8_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP8_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP9_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP12_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 22.46/22.65 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP14_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP14_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP15_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP17_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP17_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP18_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 22.46/22.65 ( sP18_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP21_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP23_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 22.46/22.65 ( sP23_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 22.46/22.65 $false
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP24_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 22.46/22.65 ( sP24_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP26_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 22.46/22.65 ( sP26_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP28_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP28_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP30_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP32_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 22.46/22.65 ( sP32_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP35_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP35_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP38_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 22.46/22.65 ( sP38_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP41_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP44_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 22.46/22.65 ( sP44_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP47_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP47_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP50_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 22.46/22.65 ( sP50_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65 %------ Positive definition of sP52_iProver_split
% 22.46/22.65 fof(lit_def,axiom,
% 22.46/22.65 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 22.46/22.65 ( sP52_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 22.46/22.65 $true
% 22.46/22.65 )
% 22.46/22.65 )
% 22.46/22.65 ).
% 22.46/22.65
% 22.46/22.65
% 22.46/22.65
% 22.46/22.65 % ------ Statistics
% 22.46/22.65
% 22.46/22.65 % ------ General
% 22.46/22.65
% 22.46/22.65 % num_of_input_clauses: 121
% 22.46/22.65 % num_of_input_neg_conjectures: 1
% 22.46/22.65 % num_of_splits: 54
% 22.46/22.65 % num_of_split_atoms: 54
% 22.46/22.65 % num_of_sem_filtered_clauses: 0
% 22.46/22.65 % num_of_subtypes: 0
% 22.46/22.65 % monotx_restored_types: 0
% 22.46/22.65 % sat_num_of_epr_types: 0
% 22.46/22.65 % sat_num_of_non_cyclic_types: 0
% 22.46/22.65 % sat_guarded_non_collapsed_types: 0
% 22.46/22.65 % is_epr: 0
% 22.46/22.65 % is_horn: 0
% 22.46/22.65 % has_eq: 0
% 22.46/22.65 % num_pure_diseq_elim: 0
% 22.46/22.65 % simp_replaced_by: 0
% 22.46/22.65 % res_preprocessed: 176
% 22.46/22.65 % prep_upred: 0
% 22.46/22.65 % prep_unflattend: 0
% 22.46/22.65 % pred_elim_cands: 85
% 22.46/22.65 % pred_elim: 15
% 22.46/22.65 % pred_elim_cl: 15
% 22.46/22.65 % pred_elim_cycles: 80
% 22.46/22.65 % forced_gc_time: 0
% 22.46/22.65 % gc_basic_clause_elim: 0
% 22.46/22.65 % parsing_time: 0.024
% 22.46/22.65 % sem_filter_time: 0.
% 22.46/22.65 % pred_elim_time: 0.248
% 22.46/22.65 % out_proof_time: 0.
% 22.46/22.65 % monotx_time: 0.
% 22.46/22.65 % subtype_inf_time: 0.
% 22.46/22.65 % unif_index_cands_time: 0.008
% 22.46/22.65 % unif_index_add_time: 0.01
% 22.46/22.65 % total_time: 11.182
% 22.46/22.65 % num_of_symbols: 146
% 22.46/22.65 % num_of_terms: 17113
% 22.46/22.65
% 22.46/22.65 % ------ Propositional Solver
% 22.46/22.65
% 22.46/22.65 % prop_solver_calls: 7
% 22.46/22.65 % prop_fast_solver_calls: 6904
% 22.46/22.65 % prop_num_of_clauses: 3003
% 22.46/22.65 % prop_preprocess_simplified: 4880
% 22.46/22.65 % prop_fo_subsumed: 112
% 22.46/22.65 % prop_solver_time: 0.
% 22.46/22.65 % prop_fast_solver_time: 0.016
% 22.46/22.65 % prop_unsat_core_time: 0.
% 22.46/22.65
% 22.46/22.65 % ------ QBF
% 22.46/22.65
% 22.46/22.65 % qbf_q_res: 0
% 22.46/22.65 % qbf_num_tautologies: 0
% 22.46/22.65 % qbf_prep_cycles: 0
% 22.46/22.65
% 22.46/22.65 % ------ BMC1
% 22.46/22.65
% 22.46/22.65 % bmc1_current_bound: -1
% 22.46/22.65 % bmc1_last_solved_bound: -1
% 22.46/22.65 % bmc1_unsat_core_size: -1
% 22.46/22.65 % bmc1_unsat_core_parents_size: -1
% 22.46/22.65 % bmc1_merge_next_fun: 0
% 22.46/22.65 % bmc1_unsat_core_clauses_time: 0.
% 22.46/22.65
% 22.46/22.65 % ------ Instantiation
% 22.46/22.65
% 22.46/22.65 % inst_num_of_clauses: 1284
% 22.46/22.65 % inst_num_in_passive: 0
% 22.46/22.65 % inst_num_in_active: 1284
% 22.46/22.65 % inst_num_in_unprocessed: 0
% 22.46/22.65 % inst_num_of_loops: 1290
% 22.46/22.65 % inst_num_of_learning_restarts: 0
% 22.46/22.65 % inst_num_moves_active_passive: 0
% 22.46/22.65 % inst_lit_activity: 397
% 22.46/22.65 % inst_lit_activity_moves: 0
% 22.46/22.65 % inst_num_tautologies: 0
% 22.46/22.65 % inst_num_prop_implied: 0
% 22.46/22.65 % inst_num_existing_simplified: 0
% 22.46/22.65 % inst_num_eq_res_simplified: 0
% 22.46/22.65 % inst_num_child_elim: 0
% 22.46/22.65 % inst_num_of_dismatching_blockings: 0
% 22.46/22.65 % inst_num_of_non_proper_insts: 1124
% 22.46/22.65 % inst_num_of_duplicates: 0
% 22.46/22.65 % inst_inst_num_from_inst_to_res: 0
% 22.46/22.65 % inst_dismatching_checking_time: 0.
% 22.46/22.65
% 22.46/22.65 % ------ Resolution
% 22.46/22.65
% 22.46/22.65 % res_num_of_clauses: 17434
% 22.46/22.65 % res_num_in_passive: 13046
% 22.46/22.65 % res_num_in_active: 4396
% 22.46/22.65 % res_num_of_loops: 5000
% 22.46/22.65 % res_forward_subset_subsumed: 3326
% 22.46/22.65 % res_backward_subset_subsumed: 44
% 22.46/22.65 % res_forward_subsumed: 0
% 22.46/22.65 % res_backward_subsumed: 0
% 22.46/22.65 % res_forward_subsumption_resolution: 2734
% 22.46/22.65 % res_backward_subsumption_resolution: 0
% 22.46/22.65 % res_clause_to_clause_subsumption: 11212
% 22.46/22.65 % res_orphan_elimination: 0
% 22.46/22.65 % res_tautology_del: 6179
% 22.46/22.65 % res_num_eq_res_simplified: 0
% 22.46/22.65 % res_num_sel_changes: 0
% 22.46/22.65 % res_moves_from_active_to_pass: 0
% 22.46/22.65
% 22.46/22.65 % Status Unknown
% 22.46/22.65 % Last status :
% 22.46/22.65 % SZS status Unknown
%------------------------------------------------------------------------------