TSTP Solution File: NLP164+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP164+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n017.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:17 EDT 2022
% Result : Unknown 64.46s 64.70s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP164+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 30 21:50:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/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/sandbox/tmp/iprover_proof_f16470.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_af8462.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_7ff799 | 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.81 % --bmc1_dump_unsat_core_tptp false
% 0.60/0.81 % --bmc1_dump_file -
% 0.60/0.81 % --bmc1_ucm_expand_uc_limit 128
% 0.60/0.81 % --bmc1_ucm_n_expand_iterations 6
% 0.60/0.81 % --bmc1_ucm_extend_mode 1
% 0.60/0.81 % --bmc1_ucm_init_mode 2
% 0.60/0.81 % --bmc1_ucm_cone_mode none
% 0.60/0.81 % --bmc1_ucm_reduced_relation_type 0
% 0.60/0.81 % --bmc1_ucm_relax_model 4
% 0.60/0.81 % --bmc1_ucm_full_tr_after_sat true
% 0.60/0.81 % --bmc1_ucm_expand_neg_assumptions false
% 0.60/0.81 % --bmc1_ucm_layered_model none
% 0.60/0.81 % --bmc1_ucm_max_lemma_size 10
% 0.60/0.81
% 0.60/0.81 % ------ AIG Options
% 0.60/0.81
% 0.60/0.81 % --aig_mode false
% 0.60/0.81
% 0.60/0.81 % ------ Instantiation Options
% 0.60/0.81
% 0.60/0.81 % --instantiation_flag true
% 0.60/0.81 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.60/0.81 % --inst_solver_per_active 750
% 0.60/0.81 % --inst_solver_calls_frac 0.5
% 0.60/0.81 % --inst_passive_queue_type priority_queues
% 0.60/0.81 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.60/0.81 % --inst_passive_queues_freq [25;2]
% 0.60/0.81 % --inst_dismatching true
% 0.60/0.81 % --inst_eager_unprocessed_to_passive true
% 0.60/0.81 % --inst_prop_sim_given true
% 0.60/0.81 % --inst_prop_sim_new false
% 0.60/0.81 % --inst_orphan_elimination true
% 0.60/0.81 % --inst_learning_loop_flag true
% 0.60/0.81 % --inst_learning_start 3000
% 0.60/0.81 % --inst_learning_factor 2
% 0.60/0.81 % --inst_start_prop_sim_after_learn 3
% 0.60/0.81 % --inst_sel_renew solver
% 0.60/0.81 % --inst_lit_activity_flag true
% 0.60/0.81 % --inst_out_proof true
% 0.60/0.81
% 0.60/0.81 % ------ Resolution Options
% 0.60/0.81
% 0.60/0.81 % --resolution_flag true
% 0.60/0.81 % --res_lit_sel kbo_max
% 0.60/0.81 % --res_to_prop_solver none
% 0.60/0.81 % --res_prop_simpl_new false
% 0.60/0.81 % --res_prop_simpl_given false
% 0.60/0.81 % --res_passive_queue_type priority_queues
% 0.60/0.81 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.60/0.81 % --res_passive_queues_freq [15;5]
% 0.60/0.81 % --res_forward_subs full
% 0.60/0.81 % --res_backward_subs full
% 0.60/0.81 % --res_forward_subs_resolution true
% 0.60/0.81 % --res_backward_subs_resolution true
% 0.60/0.81 % --res_orphan_elimination false
% 0.60/0.81 % --res_time_limit 1000.
% 0.60/0.81 % --res_out_proof true
% 0.60/0.81 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f16470.s
% 0.60/0.81 % --modulo true
% 0.60/0.81
% 0.60/0.81 % ------ Combination Options
% 0.60/0.81
% 0.60/0.81 % --comb_res_mult 1000
% 0.60/0.81 % --comb_inst_mult 300
% 0.60/0.81 % ------
% 0.60/0.81
% 0.60/0.81 % ------ Parsing...% successful
% 0.60/0.81
% 0.60/0.81 % ------ 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:16:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.60/0.81
% 0.60/0.81 % ------ Proving...
% 0.60/0.81 % ------ Problem Properties
% 0.60/0.81
% 0.60/0.81 %
% 0.60/0.81 % EPR false
% 0.60/0.81 % Horn false
% 0.60/0.81 % Has equality false
% 0.60/0.81
% 0.60/0.81 % % ------ Input Options Time Limit: Unbounded
% 0.60/0.81
% 0.60/0.81
% 0.60/0.81 % % ------ Current options:
% 0.60/0.81
% 0.60/0.81 % ------ Input Options
% 0.60/0.81
% 0.60/0.81 % --out_options all
% 0.60/0.81 % --tptp_safe_out true
% 0.60/0.81 % --problem_path ""
% 0.60/0.81 % --include_path ""
% 0.60/0.81 % --clausifier .//eprover
% 0.60/0.81 % --clausifier_options --tstp-format
% 0.60/0.81 % --stdin false
% 0.60/0.81 % --dbg_backtrace false
% 0.60/0.81 % --dbg_dump_prop_clauses false
% 0.60/0.81 % --dbg_dump_prop_clauses_file -
% 0.60/0.81 % --dbg_out_stat false
% 0.60/0.81
% 0.60/0.81 % ------ General Options
% 0.60/0.81
% 0.60/0.81 % --fof false
% 0.60/0.81 % --time_out_real 150.
% 0.60/0.81 % --time_out_prep_mult 0.2
% 0.60/0.81 % --time_out_virtual -1.
% 0.60/0.81 % --schedule none
% 0.60/0.81 % --ground_splitting input
% 0.60/0.81 % --splitting_nvd 16
% 0.60/0.81 % --non_eq_to_eq false
% 0.60/0.81 % --prep_gs_sim true
% 0.60/0.81 % --prep_unflatten false
% 0.60/0.81 % --prep_res_sim true
% 0.60/0.81 % --prep_upred true
% 0.60/0.81 % --res_sim_input true
% 0.60/0.81 % --clause_weak_htbl true
% 0.60/0.81 % --gc_record_bc_elim false
% 0.60/0.81 % --symbol_type_check false
% 0.60/0.81 % --clausify_out false
% 0.60/0.81 % --large_theory_mode false
% 0.60/0.81 % --prep_sem_filter none
% 0.60/0.81 % --prep_sem_filter_out false
% 0.60/0.81 % --preprocessed_out false
% 0.60/0.81 % --sub_typing false
% 0.60/0.81 % --brand_transform false
% 0.60/0.81 % --pure_diseq_elim true
% 0.60/0.81 % --min_unsat_core false
% 0.60/0.81 % --pred_elim true
% 0.60/0.81 % --add_important_lit false
% 0.60/0.81 % --soft_assumptions false
% 0.60/0.81 % --reset_solvers false
% 0.60/0.81 % --bc_imp_inh []
% 0.60/0.81 % --conj_cone_tolerance 1.5
% 0.60/0.81 % --prolific_symb_bound 500
% 0.60/0.81 % --lt_threshold 2000
% 0.60/0.81
% 0.60/0.81 % ------ SAT Options
% 0.60/0.81
% 0.60/0.81 % --sat_mode false
% 0.60/0.81 % --sat_fm_restart_options ""
% 0.60/0.81 % --sat_gr_def false
% 0.60/0.81 % --sat_epr_types true
% 0.60/0.81 % --sat_non_cyclic_types false
% 0.60/0.81 % --sat_finite_models false
% 0.60/0.81 % --sat_fm_lemmas false
% 0.60/0.81 % --sat_fm_prep false
% 0.60/0.81 % --sat_fm_uc_incr true
% 0.60/0.81 % --sat_out_model small
% 0.60/0.81 % --sat_out_clauses false
% 0.60/0.81
% 0.60/0.81 % ------ QBF Options
% 0.60/0.81
% 0.60/0.81 % --qbf_mode false
% 0.60/0.81 % --qbf_elim_univ true
% 0.60/0.81 % --qbf_sk_in true
% 0.60/0.81 % --qbf_pred_elim true
% 0.60/0.81 % --qbf_split 32
% 0.60/0.81
% 0.60/0.81 % ------ BMC1 Options
% 0.60/0.81
% 0.60/0.81 % --bmc1_incremental false
% 0.60/0.81 % --bmc1_axioms reachable_all
% 0.60/0.81 % --bmc1_min_bound 0
% 0.60/0.81 % --bmc1_max_bound -1
% 0.60/0.81 % --bmc1_max_bound_default -1
% 0.60/0.81 % --bmc1_symbol_reachability true
% 0.60/0.81 % --bmc1_property_lemmas false
% 0.60/0.81 % --bmc1_k_induction false
% 0.60/0.81 % --bmc1_non_equiv_states false
% 0.60/0.81 % --bmc1_deadlock false
% 0.60/0.81 % --bmc1_ucm false
% 0.60/0.81 % --bmc1_add_unsat_core none
% 0.60/0.81 % --bmc1_unsat_core_children false
% 0.60/0.81 % --bmc1_unsat_core_extrapolate_axioms false
% 0.60/0.81 % --bmc1_out_stat full
% 0.60/0.81 % --bmc1_ground_init false
% 0.60/0.81 % --bmc1_pre_inst_next_state false
% 0.60/0.81 % --bmc1_pre_inst_state false
% 0.60/0.81 % --bmc1_pre_inst_reach_state false
% 0.60/0.81 % --bmc1_out_unsat_core false
% 0.60/0.81 % --bmc1_aig_witness_out false
% 0.60/0.81 % --bmc1_verbose false
% 0.60/0.81 % --bmc1_dump_clauses_tptp false
% 0.60/0.81 % --bmc1_dump_unsat_core_tptp false
% 0.60/0.81 % --bmc1_dump_file -
% 0.60/0.81 % --bmc1_ucm_expand_uc_limit 128
% 0.60/0.81 % --bmc1_ucm_n_expand_iterations 6
% 0.60/0.81 % --bmc1_ucm_extend_mode 1
% 0.60/0.81 % --bmc1_ucm_init_mode 2
% 0.60/0.81 % --bmc1_ucm_cone_mode none
% 0.60/0.81 % --bmc1_ucm_reduced_relation_type 0
% 0.60/0.81 % --bmc1_ucm_relax_model 4
% 0.60/0.81 % --bmc1_ucm_full_tr_after_sat true
% 0.60/0.81 % --bmc1_ucm_expand_neg_assumptions false
% 0.60/0.81 % --bmc1_ucm_layered_model none
% 0.60/0.81 % --bmc1_ucm_max_lemma_size 10
% 0.60/0.81
% 0.60/0.81 % ------ AIG Options
% 0.60/0.81
% 0.60/0.81 % --aig_mode false
% 0.60/0.81
% 0.60/0.81 % ------ Instantiation Options
% 0.60/0.81
% 0.60/0.81 % --instantiation_flag true
% 0.60/0.81 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.60/0.81 % --inst_solver_per_active 750
% 0.60/0.81 % --inst_solver_calls_frac 0.5
% 0.60/0.81 % --inst_passive_queue_type priority_queues
% 0.60/0.81 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.60/0.81 % --inst_passive_queues_freq [25;2]
% 0.60/0.81 % --inst_dismatching true
% 0.60/0.81 % --inst_eager_unprocessed_to_passive true
% 32.43/32.63 % --inst_prop_sim_given true
% 32.43/32.63 % --inst_prop_sim_new false
% 32.43/32.63 % --inst_orphan_elimination true
% 32.43/32.63 % --inst_learning_loop_flag true
% 32.43/32.63 % --inst_learning_start 3000
% 32.43/32.63 % --inst_learning_factor 2
% 32.43/32.63 % --inst_start_prop_sim_after_learn 3
% 32.43/32.63 % --inst_sel_renew solver
% 32.43/32.63 % --inst_lit_activity_flag true
% 32.43/32.63 % --inst_out_proof true
% 32.43/32.63
% 32.43/32.63 % ------ Resolution Options
% 32.43/32.63
% 32.43/32.63 % --resolution_flag true
% 32.43/32.63 % --res_lit_sel kbo_max
% 32.43/32.63 % --res_to_prop_solver none
% 32.43/32.63 % --res_prop_simpl_new false
% 32.43/32.63 % --res_prop_simpl_given false
% 32.43/32.63 % --res_passive_queue_type priority_queues
% 32.43/32.63 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 32.43/32.63 % --res_passive_queues_freq [15;5]
% 32.43/32.63 % --res_forward_subs full
% 32.43/32.63 % --res_backward_subs full
% 32.43/32.63 % --res_forward_subs_resolution true
% 32.43/32.63 % --res_backward_subs_resolution true
% 32.43/32.63 % --res_orphan_elimination false
% 32.43/32.63 % --res_time_limit 1000.
% 32.43/32.63 % --res_out_proof true
% 32.43/32.63 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f16470.s
% 32.43/32.63 % --modulo true
% 32.43/32.63
% 32.43/32.63 % ------ Combination Options
% 32.43/32.63
% 32.43/32.63 % --comb_res_mult 1000
% 32.43/32.63 % --comb_inst_mult 300
% 32.43/32.63 % ------
% 32.43/32.63
% 32.43/32.63
% 32.43/32.63
% 32.43/32.63 % ------ Proving...
% 32.43/32.63 % warning: shown sat in sat incomplete mode
% 32.43/32.63 %
% 32.43/32.63
% 32.43/32.63
% 32.43/32.63 ------ Building Model...Done
% 32.43/32.63
% 32.43/32.63 %------ The model is defined over ground terms (initial term algebra).
% 32.43/32.63 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 32.43/32.63 %------ where \phi is a formula over the term algebra.
% 32.43/32.63 %------ If we have equality in the problem then it is also defined as a predicate above,
% 32.43/32.63 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 32.43/32.63 %------ See help for --sat_out_model for different model outputs.
% 32.43/32.63 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 32.43/32.63 %------ where the first argument stands for the sort ($i in the unsorted case)
% 32.43/32.63
% 32.43/32.63
% 32.43/32.63
% 32.43/32.63
% 32.43/32.63 %------ Positive definition of epred2_0
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 ( epred2_0 <=>
% 32.43/32.63 $true
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Negative definition of actual_world
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0] :
% 32.43/32.63 ( ~(actual_world(X0)) <=>
% 32.43/32.63 $false
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Positive definition of group
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( group(X0,X1) <=>
% 32.43/32.63 (
% 32.43/32.63 (
% 32.43/32.63 ( X0=sk3_esk1_0 & X1=sk3_esk9_0 )
% 32.43/32.63 )
% 32.43/32.63
% 32.43/32.63 |
% 32.43/32.63 (
% 32.43/32.63 ( X0=sk3_esk1_0 & X1=sk3_esk12_0 )
% 32.43/32.63 )
% 32.43/32.63
% 32.43/32.63 |
% 32.43/32.63 (
% 32.43/32.63 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 32.43/32.63 )
% 32.43/32.63
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Positive definition of frontseat
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( frontseat(X0,X1) <=>
% 32.43/32.63 (
% 32.43/32.63 (
% 32.43/32.63 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 32.43/32.63 )
% 32.43/32.63
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Negative definition of of
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1,X2] :
% 32.43/32.63 ( ~(of(X0,X1,X2)) <=>
% 32.43/32.63 $false
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Negative definition of city
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( ~(city(X0,X1)) <=>
% 32.43/32.63 $false
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Negative definition of hollywood_placename
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( ~(hollywood_placename(X0,X1)) <=>
% 32.43/32.63 $false
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Negative definition of placename
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( ~(placename(X0,X1)) <=>
% 32.43/32.63 $false
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Positive definition of chevy
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( chevy(X0,X1) <=>
% 32.43/32.63 (
% 32.43/32.63 (
% 32.43/32.63 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 )
% 32.43/32.63 )
% 32.43/32.63
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Negative definition of white
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( ~(white(X0,X1)) <=>
% 32.43/32.63 $false
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Negative definition of dirty
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( ~(dirty(X0,X1)) <=>
% 32.43/32.63 $false
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Negative definition of old
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( ~(old(X0,X1)) <=>
% 32.43/32.63 $false
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Negative definition of street
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( ~(street(X0,X1)) <=>
% 32.43/32.63 $false
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Negative definition of lonely
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( ~(lonely(X0,X1)) <=>
% 32.43/32.63 $false
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Positive definition of event
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1] :
% 32.43/32.63 ( event(X0,X1) <=>
% 32.43/32.63 (
% 32.43/32.63 (
% 32.43/32.63 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 )
% 32.43/32.63 )
% 32.43/32.63
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Negative definition of agent
% 32.43/32.63 fof(lit_def,axiom,
% 32.43/32.63 (! [X0,X1,X2] :
% 32.43/32.63 ( ~(agent(X0,X1,X2)) <=>
% 32.43/32.63 $false
% 32.43/32.63 )
% 32.43/32.63 )
% 32.43/32.63 ).
% 32.43/32.63
% 32.43/32.63 %------ Positive definition of present
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1] :
% 32.43/32.64 ( present(X0,X1) <=>
% 32.43/32.64 (
% 32.43/32.64 (
% 32.43/32.64 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 )
% 32.43/32.64 )
% 32.43/32.64
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Negative definition of barrel
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1] :
% 32.43/32.64 ( ~(barrel(X0,X1)) <=>
% 32.43/32.64 $false
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Negative definition of down
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2] :
% 32.43/32.64 ( ~(down(X0,X1,X2)) <=>
% 32.43/32.64 $false
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Negative definition of in
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2] :
% 32.43/32.64 ( ~(in(X0,X1,X2)) <=>
% 32.43/32.64 $false
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of two
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1] :
% 32.43/32.64 ( two(X0,X1) <=>
% 32.43/32.64 (
% 32.43/32.64 (
% 32.43/32.64 ( X0=sk3_esk1_0 & X1=sk3_esk9_0 )
% 32.43/32.64 )
% 32.43/32.64
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of wear
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1] :
% 32.43/32.64 ( wear(X0,X1) <=>
% 32.43/32.64 $false
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of nonreflexive
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1] :
% 32.43/32.64 ( nonreflexive(X0,X1) <=>
% 32.43/32.64 $false
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of member
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2] :
% 32.43/32.64 ( member(X0,X1,X2) <=>
% 32.43/32.64 $false
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of epred1_0
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 ( epred1_0 <=>
% 32.43/32.64 $false
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP0_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP3_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP5_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 32.43/32.64 ( sP5_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 32.43/32.64 $false
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP6_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP8_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 32.43/32.64 ( sP8_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 32.43/32.64 $false
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP9_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP12_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP14_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP14_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP16_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP16_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP19_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP22_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP22_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP25_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP25_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP27_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP27_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP29_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 32.43/32.64 ( sP29_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 32.43/32.64 $false
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP30_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP33_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP33_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP35_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP35_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $false
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP36_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP36_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP39_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP39_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP41_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP43_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP43_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP46_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP46_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP49_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP49_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64 %------ Positive definition of sP52_iProver_split
% 32.43/32.64 fof(lit_def,axiom,
% 32.43/32.64 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 32.43/32.64 ( sP52_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 32.43/32.64 $true
% 32.43/32.64 )
% 32.43/32.64 )
% 32.43/32.64 ).
% 32.43/32.64
% 32.43/32.64
% 32.43/32.64
% 32.43/32.64 % ------ Statistics
% 32.43/32.64
% 32.43/32.64 % ------ General
% 32.43/32.64
% 32.43/32.64 % num_of_input_clauses: 121
% 32.43/32.64 % num_of_input_neg_conjectures: 1
% 32.43/32.64 % num_of_splits: 54
% 32.43/32.64 % num_of_split_atoms: 54
% 32.43/32.64 % num_of_sem_filtered_clauses: 0
% 32.43/32.64 % num_of_subtypes: 0
% 32.43/32.64 % monotx_restored_types: 0
% 32.43/32.64 % sat_num_of_epr_types: 0
% 32.43/32.64 % sat_num_of_non_cyclic_types: 0
% 32.43/32.64 % sat_guarded_non_collapsed_types: 0
% 32.43/32.64 % is_epr: 0
% 32.43/32.64 % is_horn: 0
% 32.43/32.64 % has_eq: 0
% 32.43/32.64 % num_pure_diseq_elim: 0
% 32.43/32.64 % simp_replaced_by: 0
% 32.43/32.64 % res_preprocessed: 176
% 32.43/32.64 % prep_upred: 0
% 32.43/32.64 % prep_unflattend: 0
% 32.43/32.64 % pred_elim_cands: 85
% 32.43/32.64 % pred_elim: 17
% 32.43/32.64 % pred_elim_cl: 17
% 32.43/32.64 % pred_elim_cycles: 80
% 32.43/32.64 % forced_gc_time: 0
% 32.43/32.64 % gc_basic_clause_elim: 0
% 32.43/32.64 % parsing_time: 0.027
% 32.43/32.64 % sem_filter_time: 0.
% 32.43/32.64 % pred_elim_time: 0.25
% 32.43/32.64 % out_proof_time: 0.
% 32.43/32.64 % monotx_time: 0.
% 32.43/32.64 % subtype_inf_time: 0.
% 32.43/32.64 % unif_index_cands_time: 0.021
% 32.43/32.64 % unif_index_add_time: 0.024
% 32.43/32.64 % total_time: 32.197
% 32.43/32.64 % num_of_symbols: 147
% 32.43/32.64 % num_of_terms: 29233
% 32.43/32.64
% 32.43/32.64 % ------ Propositional Solver
% 32.43/32.64
% 32.43/32.64 % prop_solver_calls: 20
% 32.43/32.64 % prop_fast_solver_calls: 6937
% 32.43/32.64 % prop_num_of_clauses: 8902
% 32.43/32.64 % prop_preprocess_simplified: 11033
% 32.43/32.64 % prop_fo_subsumed: 112
% 32.43/32.64 % prop_solver_time: 0.001
% 32.43/32.64 % prop_fast_solver_time: 0.015
% 32.43/32.64 % prop_unsat_core_time: 0.
% 32.43/32.64
% 32.43/32.64 % ------ QBF
% 32.43/32.64
% 32.43/32.64 % qbf_q_res: 0
% 32.43/32.64 % qbf_num_tautologies: 0
% 32.43/32.64 % qbf_prep_cycles: 0
% 32.43/32.64
% 32.43/32.64 % ------ BMC1
% 32.43/32.64
% 32.43/32.64 % bmc1_current_bound: -1
% 32.43/32.64 % bmc1_last_solved_bound: -1
% 32.43/32.64 % bmc1_unsat_core_size: -1
% 32.43/32.64 % bmc1_unsat_core_parents_size: -1
% 32.43/32.64 % bmc1_merge_next_fun: 0
% 32.43/32.64 % bmc1_unsat_core_clauses_time: 0.
% 32.43/32.64
% 32.43/32.64 % ------ Instantiation
% 32.43/32.64
% 32.43/32.64 % inst_num_of_clauses: 1256
% 32.43/32.64 % inst_num_in_passive: 0
% 32.43/32.64 % inst_num_in_active: 1256
% 32.43/32.64 % inst_num_in_unprocessed: 0
% 32.43/32.64 % inst_num_of_loops: 1260
% 32.43/32.64 % inst_num_of_learning_restarts: 1
% 32.43/32.64 % inst_num_moves_active_passive: 0
% 32.43/32.64 % inst_lit_activity: 397
% 32.43/32.64 % inst_lit_activity_moves: 0
% 32.43/32.64 % inst_num_tautologies: 0
% 32.43/32.64 % inst_num_prop_implied: 0
% 32.43/32.64 % inst_num_existing_simplified: 0
% 32.43/32.64 % inst_num_eq_res_simplified: 0
% 32.43/32.64 % inst_num_child_elim: 0
% 32.43/32.64 % inst_num_of_dismatching_blockings: 0
% 32.43/32.64 % inst_num_of_non_proper_insts: 1098
% 32.43/32.64 % inst_num_of_duplicates: 0
% 32.43/32.64 % inst_inst_num_from_inst_to_res: 0
% 32.43/32.64 % inst_dismatching_checking_time: 0.003
% 32.43/32.64
% 32.43/32.64 % ------ Resolution
% 32.43/32.64
% 32.43/32.64 % res_num_of_clauses: 40006
% 32.43/32.64 % res_num_in_passive: 28063
% 32.43/32.64 % res_num_in_active: 11986
% 32.43/32.64 % res_num_of_loops: 15000
% 32.43/32.64 % res_forward_subset_subsumed: 30066
% 32.43/32.64 % res_backward_subset_subsumed: 428
% 32.43/32.64 % res_forward_subsumed: 0
% 32.43/32.64 % res_backward_subsumed: 0
% 32.43/32.64 % res_forward_subsumption_resolution: 15965
% 32.43/32.64 % res_backward_subsumption_resolution: 32
% 32.43/32.64 % res_clause_to_clause_subsumption: 62877
% 32.43/32.64 % res_orphan_elimination: 0
% 32.43/32.64 % res_tautology_del: 14701
% 32.43/32.64 % res_num_eq_res_simplified: 0
% 32.43/32.64 % res_num_sel_changes: 0
% 32.43/32.64 % res_moves_from_active_to_pass: 0
% 32.43/32.64
% 32.43/32.64 % Status Unknown
% 32.48/32.71 % Orienting using strategy ClausalAll
% 32.48/32.71 % FOF problem with conjecture
% 32.48/32.71 % 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_f16470.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_af8462.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_c4f2ab | grep -v "SZS"
% 32.48/32.72
% 32.48/32.72 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 32.48/32.72
% 32.48/32.72 %
% 32.48/32.72 % ------ iProver source info
% 32.48/32.72
% 32.48/32.72 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 32.48/32.72 % git: non_committed_changes: true
% 32.48/32.72 % git: last_make_outside_of_git: true
% 32.48/32.72
% 32.48/32.72 %
% 32.48/32.72 % ------ Input Options
% 32.48/32.72
% 32.48/32.72 % --out_options all
% 32.48/32.72 % --tptp_safe_out true
% 32.48/32.72 % --problem_path ""
% 32.48/32.72 % --include_path ""
% 32.48/32.72 % --clausifier .//eprover
% 32.48/32.72 % --clausifier_options --tstp-format
% 32.48/32.72 % --stdin false
% 32.48/32.72 % --dbg_backtrace false
% 32.48/32.72 % --dbg_dump_prop_clauses false
% 32.48/32.72 % --dbg_dump_prop_clauses_file -
% 32.48/32.72 % --dbg_out_stat false
% 32.48/32.72
% 32.48/32.72 % ------ General Options
% 32.48/32.72
% 32.48/32.72 % --fof false
% 32.48/32.72 % --time_out_real 150.
% 32.48/32.72 % --time_out_prep_mult 0.2
% 32.48/32.72 % --time_out_virtual -1.
% 32.48/32.72 % --schedule none
% 32.48/32.72 % --ground_splitting input
% 32.48/32.72 % --splitting_nvd 16
% 32.48/32.72 % --non_eq_to_eq false
% 32.48/32.72 % --prep_gs_sim true
% 32.48/32.72 % --prep_unflatten false
% 32.48/32.72 % --prep_res_sim true
% 32.48/32.72 % --prep_upred true
% 32.48/32.72 % --res_sim_input true
% 32.48/32.72 % --clause_weak_htbl true
% 32.48/32.72 % --gc_record_bc_elim false
% 32.48/32.72 % --symbol_type_check false
% 32.48/32.72 % --clausify_out false
% 32.48/32.72 % --large_theory_mode false
% 32.48/32.72 % --prep_sem_filter none
% 32.48/32.72 % --prep_sem_filter_out false
% 32.48/32.72 % --preprocessed_out false
% 32.48/32.72 % --sub_typing false
% 32.48/32.72 % --brand_transform false
% 32.48/32.72 % --pure_diseq_elim true
% 32.48/32.72 % --min_unsat_core false
% 32.48/32.72 % --pred_elim true
% 32.48/32.72 % --add_important_lit false
% 32.48/32.72 % --soft_assumptions false
% 32.48/32.72 % --reset_solvers false
% 32.48/32.72 % --bc_imp_inh []
% 32.48/32.72 % --conj_cone_tolerance 1.5
% 32.48/32.72 % --prolific_symb_bound 500
% 32.48/32.72 % --lt_threshold 2000
% 32.48/32.72
% 32.48/32.72 % ------ SAT Options
% 32.48/32.72
% 32.48/32.72 % --sat_mode false
% 32.48/32.72 % --sat_fm_restart_options ""
% 32.48/32.72 % --sat_gr_def false
% 32.48/32.72 % --sat_epr_types true
% 32.48/32.72 % --sat_non_cyclic_types false
% 32.48/32.72 % --sat_finite_models false
% 32.48/32.72 % --sat_fm_lemmas false
% 32.48/32.72 % --sat_fm_prep false
% 32.48/32.72 % --sat_fm_uc_incr true
% 32.48/32.72 % --sat_out_model small
% 32.48/32.72 % --sat_out_clauses false
% 32.48/32.72
% 32.48/32.72 % ------ QBF Options
% 32.48/32.72
% 32.48/32.72 % --qbf_mode false
% 32.48/32.72 % --qbf_elim_univ true
% 32.48/32.72 % --qbf_sk_in true
% 32.48/32.72 % --qbf_pred_elim true
% 32.48/32.72 % --qbf_split 32
% 32.48/32.72
% 32.48/32.72 % ------ BMC1 Options
% 32.48/32.72
% 32.48/32.72 % --bmc1_incremental false
% 32.48/32.72 % --bmc1_axioms reachable_all
% 32.48/32.72 % --bmc1_min_bound 0
% 32.48/32.72 % --bmc1_max_bound -1
% 32.48/32.72 % --bmc1_max_bound_default -1
% 32.48/32.72 % --bmc1_symbol_reachability true
% 32.48/32.72 % --bmc1_property_lemmas false
% 32.48/32.72 % --bmc1_k_induction false
% 32.48/32.72 % --bmc1_non_equiv_states false
% 32.48/32.72 % --bmc1_deadlock false
% 32.48/32.72 % --bmc1_ucm false
% 32.48/32.72 % --bmc1_add_unsat_core none
% 32.48/32.72 % --bmc1_unsat_core_children false
% 32.48/32.72 % --bmc1_unsat_core_extrapolate_axioms false
% 32.48/32.72 % --bmc1_out_stat full
% 32.48/32.72 % --bmc1_ground_init false
% 32.48/32.72 % --bmc1_pre_inst_next_state false
% 32.48/32.72 % --bmc1_pre_inst_state false
% 32.48/32.72 % --bmc1_pre_inst_reach_state false
% 32.48/32.72 % --bmc1_out_unsat_core false
% 32.48/32.72 % --bmc1_aig_witness_out false
% 32.48/32.72 % --bmc1_verbose false
% 32.48/32.72 % --bmc1_dump_clauses_tptp false
% 32.75/32.95 % --bmc1_dump_unsat_core_tptp false
% 32.75/32.95 % --bmc1_dump_file -
% 32.75/32.95 % --bmc1_ucm_expand_uc_limit 128
% 32.75/32.95 % --bmc1_ucm_n_expand_iterations 6
% 32.75/32.95 % --bmc1_ucm_extend_mode 1
% 32.75/32.95 % --bmc1_ucm_init_mode 2
% 32.75/32.95 % --bmc1_ucm_cone_mode none
% 32.75/32.95 % --bmc1_ucm_reduced_relation_type 0
% 32.75/32.95 % --bmc1_ucm_relax_model 4
% 32.75/32.95 % --bmc1_ucm_full_tr_after_sat true
% 32.75/32.95 % --bmc1_ucm_expand_neg_assumptions false
% 32.75/32.95 % --bmc1_ucm_layered_model none
% 32.75/32.95 % --bmc1_ucm_max_lemma_size 10
% 32.75/32.95
% 32.75/32.95 % ------ AIG Options
% 32.75/32.95
% 32.75/32.95 % --aig_mode false
% 32.75/32.95
% 32.75/32.95 % ------ Instantiation Options
% 32.75/32.95
% 32.75/32.95 % --instantiation_flag true
% 32.75/32.95 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 32.75/32.95 % --inst_solver_per_active 750
% 32.75/32.95 % --inst_solver_calls_frac 0.5
% 32.75/32.95 % --inst_passive_queue_type priority_queues
% 32.75/32.95 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 32.75/32.95 % --inst_passive_queues_freq [25;2]
% 32.75/32.95 % --inst_dismatching true
% 32.75/32.95 % --inst_eager_unprocessed_to_passive true
% 32.75/32.95 % --inst_prop_sim_given true
% 32.75/32.95 % --inst_prop_sim_new false
% 32.75/32.95 % --inst_orphan_elimination true
% 32.75/32.95 % --inst_learning_loop_flag true
% 32.75/32.95 % --inst_learning_start 3000
% 32.75/32.95 % --inst_learning_factor 2
% 32.75/32.95 % --inst_start_prop_sim_after_learn 3
% 32.75/32.95 % --inst_sel_renew solver
% 32.75/32.95 % --inst_lit_activity_flag true
% 32.75/32.95 % --inst_out_proof true
% 32.75/32.95
% 32.75/32.95 % ------ Resolution Options
% 32.75/32.95
% 32.75/32.95 % --resolution_flag true
% 32.75/32.95 % --res_lit_sel kbo_max
% 32.75/32.95 % --res_to_prop_solver none
% 32.75/32.95 % --res_prop_simpl_new false
% 32.75/32.95 % --res_prop_simpl_given false
% 32.75/32.95 % --res_passive_queue_type priority_queues
% 32.75/32.95 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 32.75/32.95 % --res_passive_queues_freq [15;5]
% 32.75/32.95 % --res_forward_subs full
% 32.75/32.95 % --res_backward_subs full
% 32.75/32.95 % --res_forward_subs_resolution true
% 32.75/32.95 % --res_backward_subs_resolution true
% 32.75/32.95 % --res_orphan_elimination false
% 32.75/32.95 % --res_time_limit 1000.
% 32.75/32.95 % --res_out_proof true
% 32.75/32.95 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f16470.s
% 32.75/32.95 % --modulo true
% 32.75/32.95
% 32.75/32.95 % ------ Combination Options
% 32.75/32.95
% 32.75/32.95 % --comb_res_mult 1000
% 32.75/32.95 % --comb_inst_mult 300
% 32.75/32.95 % ------
% 32.75/32.95
% 32.75/32.95 % ------ Parsing...% successful
% 32.75/32.95
% 32.75/32.95 % ------ 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:16:0s pe_e snvd_s sp: 0 0s snvd_e %
% 32.75/32.95
% 32.75/32.95 % ------ Proving...
% 32.75/32.95 % ------ Problem Properties
% 32.75/32.95
% 32.75/32.95 %
% 32.75/32.95 % EPR false
% 32.75/32.95 % Horn false
% 32.75/32.95 % Has equality false
% 32.75/32.95
% 32.75/32.95 % % ------ Input Options Time Limit: Unbounded
% 32.75/32.95
% 32.75/32.95
% 32.75/32.95 % % ------ Current options:
% 32.75/32.95
% 32.75/32.95 % ------ Input Options
% 32.75/32.95
% 32.75/32.95 % --out_options all
% 32.75/32.95 % --tptp_safe_out true
% 32.75/32.95 % --problem_path ""
% 32.75/32.95 % --include_path ""
% 32.75/32.95 % --clausifier .//eprover
% 32.75/32.95 % --clausifier_options --tstp-format
% 32.75/32.95 % --stdin false
% 32.75/32.95 % --dbg_backtrace false
% 32.75/32.95 % --dbg_dump_prop_clauses false
% 32.75/32.95 % --dbg_dump_prop_clauses_file -
% 32.75/32.95 % --dbg_out_stat false
% 32.75/32.95
% 32.75/32.95 % ------ General Options
% 32.75/32.95
% 32.75/32.95 % --fof false
% 32.75/32.95 % --time_out_real 150.
% 32.75/32.95 % --time_out_prep_mult 0.2
% 32.75/32.95 % --time_out_virtual -1.
% 32.75/32.95 % --schedule none
% 32.75/32.95 % --ground_splitting input
% 32.75/32.95 % --splitting_nvd 16
% 32.75/32.95 % --non_eq_to_eq false
% 32.75/32.95 % --prep_gs_sim true
% 32.75/32.95 % --prep_unflatten false
% 32.75/32.95 % --prep_res_sim true
% 32.75/32.95 % --prep_upred true
% 32.75/32.95 % --res_sim_input true
% 32.75/32.95 % --clause_weak_htbl true
% 32.75/32.95 % --gc_record_bc_elim false
% 32.75/32.95 % --symbol_type_check false
% 32.75/32.95 % --clausify_out false
% 32.75/32.95 % --large_theory_mode false
% 32.75/32.95 % --prep_sem_filter none
% 32.75/32.95 % --prep_sem_filter_out false
% 32.75/32.95 % --preprocessed_out false
% 32.75/32.95 % --sub_typing false
% 32.75/32.95 % --brand_transform false
% 32.75/32.95 % --pure_diseq_elim true
% 32.75/32.95 % --min_unsat_core false
% 32.75/32.95 % --pred_elim true
% 32.75/32.95 % --add_important_lit false
% 32.75/32.95 % --soft_assumptions false
% 32.75/32.95 % --reset_solvers false
% 32.75/32.95 % --bc_imp_inh []
% 32.75/32.95 % --conj_cone_tolerance 1.5
% 32.75/32.95 % --prolific_symb_bound 500
% 32.75/32.95 % --lt_threshold 2000
% 32.75/32.95
% 32.75/32.95 % ------ SAT Options
% 32.75/32.95
% 32.75/32.95 % --sat_mode false
% 32.75/32.95 % --sat_fm_restart_options ""
% 32.75/32.95 % --sat_gr_def false
% 32.75/32.95 % --sat_epr_types true
% 32.75/32.95 % --sat_non_cyclic_types false
% 32.75/32.95 % --sat_finite_models false
% 32.75/32.95 % --sat_fm_lemmas false
% 32.75/32.95 % --sat_fm_prep false
% 32.75/32.95 % --sat_fm_uc_incr true
% 32.75/32.95 % --sat_out_model small
% 32.75/32.95 % --sat_out_clauses false
% 32.75/32.95
% 32.75/32.95 % ------ QBF Options
% 32.75/32.95
% 32.75/32.95 % --qbf_mode false
% 32.75/32.95 % --qbf_elim_univ true
% 32.75/32.95 % --qbf_sk_in true
% 32.75/32.95 % --qbf_pred_elim true
% 32.75/32.95 % --qbf_split 32
% 32.75/32.95
% 32.75/32.95 % ------ BMC1 Options
% 32.75/32.95
% 32.75/32.95 % --bmc1_incremental false
% 32.75/32.95 % --bmc1_axioms reachable_all
% 32.75/32.95 % --bmc1_min_bound 0
% 32.75/32.95 % --bmc1_max_bound -1
% 32.75/32.95 % --bmc1_max_bound_default -1
% 32.75/32.95 % --bmc1_symbol_reachability true
% 32.75/32.95 % --bmc1_property_lemmas false
% 32.75/32.95 % --bmc1_k_induction false
% 32.75/32.95 % --bmc1_non_equiv_states false
% 32.75/32.95 % --bmc1_deadlock false
% 32.75/32.95 % --bmc1_ucm false
% 32.75/32.95 % --bmc1_add_unsat_core none
% 32.75/32.95 % --bmc1_unsat_core_children false
% 32.75/32.95 % --bmc1_unsat_core_extrapolate_axioms false
% 32.75/32.95 % --bmc1_out_stat full
% 32.75/32.95 % --bmc1_ground_init false
% 32.75/32.95 % --bmc1_pre_inst_next_state false
% 32.75/32.95 % --bmc1_pre_inst_state false
% 32.75/32.95 % --bmc1_pre_inst_reach_state false
% 32.75/32.95 % --bmc1_out_unsat_core false
% 32.75/32.95 % --bmc1_aig_witness_out false
% 32.75/32.95 % --bmc1_verbose false
% 32.75/32.95 % --bmc1_dump_clauses_tptp false
% 32.75/32.95 % --bmc1_dump_unsat_core_tptp false
% 32.75/32.95 % --bmc1_dump_file -
% 32.75/32.95 % --bmc1_ucm_expand_uc_limit 128
% 32.75/32.95 % --bmc1_ucm_n_expand_iterations 6
% 32.75/32.95 % --bmc1_ucm_extend_mode 1
% 32.75/32.95 % --bmc1_ucm_init_mode 2
% 32.75/32.95 % --bmc1_ucm_cone_mode none
% 32.75/32.95 % --bmc1_ucm_reduced_relation_type 0
% 32.75/32.95 % --bmc1_ucm_relax_model 4
% 32.75/32.95 % --bmc1_ucm_full_tr_after_sat true
% 32.75/32.95 % --bmc1_ucm_expand_neg_assumptions false
% 32.75/32.95 % --bmc1_ucm_layered_model none
% 32.75/32.95 % --bmc1_ucm_max_lemma_size 10
% 32.75/32.95
% 32.75/32.95 % ------ AIG Options
% 32.75/32.95
% 32.75/32.95 % --aig_mode false
% 32.75/32.95
% 32.75/32.95 % ------ Instantiation Options
% 32.75/32.95
% 32.75/32.95 % --instantiation_flag true
% 32.75/32.95 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 32.75/32.95 % --inst_solver_per_active 750
% 32.75/32.95 % --inst_solver_calls_frac 0.5
% 32.75/32.95 % --inst_passive_queue_type priority_queues
% 32.75/32.95 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 32.75/32.95 % --inst_passive_queues_freq [25;2]
% 32.75/32.95 % --inst_dismatching true
% 32.75/32.95 % --inst_eager_unprocessed_to_passive true
% 64.46/64.70 % --inst_prop_sim_given true
% 64.46/64.70 % --inst_prop_sim_new false
% 64.46/64.70 % --inst_orphan_elimination true
% 64.46/64.70 % --inst_learning_loop_flag true
% 64.46/64.70 % --inst_learning_start 3000
% 64.46/64.70 % --inst_learning_factor 2
% 64.46/64.70 % --inst_start_prop_sim_after_learn 3
% 64.46/64.70 % --inst_sel_renew solver
% 64.46/64.70 % --inst_lit_activity_flag true
% 64.46/64.70 % --inst_out_proof true
% 64.46/64.70
% 64.46/64.70 % ------ Resolution Options
% 64.46/64.70
% 64.46/64.70 % --resolution_flag true
% 64.46/64.70 % --res_lit_sel kbo_max
% 64.46/64.70 % --res_to_prop_solver none
% 64.46/64.70 % --res_prop_simpl_new false
% 64.46/64.70 % --res_prop_simpl_given false
% 64.46/64.70 % --res_passive_queue_type priority_queues
% 64.46/64.70 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 64.46/64.70 % --res_passive_queues_freq [15;5]
% 64.46/64.70 % --res_forward_subs full
% 64.46/64.70 % --res_backward_subs full
% 64.46/64.70 % --res_forward_subs_resolution true
% 64.46/64.70 % --res_backward_subs_resolution true
% 64.46/64.70 % --res_orphan_elimination false
% 64.46/64.70 % --res_time_limit 1000.
% 64.46/64.70 % --res_out_proof true
% 64.46/64.70 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f16470.s
% 64.46/64.70 % --modulo true
% 64.46/64.70
% 64.46/64.70 % ------ Combination Options
% 64.46/64.70
% 64.46/64.70 % --comb_res_mult 1000
% 64.46/64.70 % --comb_inst_mult 300
% 64.46/64.70 % ------
% 64.46/64.70
% 64.46/64.70
% 64.46/64.70
% 64.46/64.70 % ------ Proving...
% 64.46/64.70 % warning: shown sat in sat incomplete mode
% 64.46/64.70 %
% 64.46/64.70
% 64.46/64.70
% 64.46/64.70 ------ Building Model...Done
% 64.46/64.70
% 64.46/64.70 %------ The model is defined over ground terms (initial term algebra).
% 64.46/64.70 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 64.46/64.70 %------ where \phi is a formula over the term algebra.
% 64.46/64.70 %------ If we have equality in the problem then it is also defined as a predicate above,
% 64.46/64.70 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 64.46/64.70 %------ See help for --sat_out_model for different model outputs.
% 64.46/64.70 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 64.46/64.70 %------ where the first argument stands for the sort ($i in the unsorted case)
% 64.46/64.70
% 64.46/64.70
% 64.46/64.70
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of epred2_0
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 ( epred2_0 <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of actual_world
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0] :
% 64.46/64.70 ( ~(actual_world(X0)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of group
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( group(X0,X1) <=>
% 64.46/64.70 (
% 64.46/64.70 (
% 64.46/64.70 ( X0=sk2_esk1_0 & X1=sk2_esk9_0 )
% 64.46/64.70 )
% 64.46/64.70
% 64.46/64.70 |
% 64.46/64.70 (
% 64.46/64.70 ( X0=sk2_esk1_0 & X1=sk2_esk12_0 )
% 64.46/64.70 )
% 64.46/64.70
% 64.46/64.70 |
% 64.46/64.70 (
% 64.46/64.70 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 64.46/64.70 )
% 64.46/64.70
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of frontseat
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( frontseat(X0,X1) <=>
% 64.46/64.70 (
% 64.46/64.70 (
% 64.46/64.70 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 64.46/64.70 )
% 64.46/64.70
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of of
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2] :
% 64.46/64.70 ( ~(of(X0,X1,X2)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of city
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( ~(city(X0,X1)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of hollywood_placename
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( ~(hollywood_placename(X0,X1)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of placename
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( ~(placename(X0,X1)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of chevy
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( chevy(X0,X1) <=>
% 64.46/64.70 (
% 64.46/64.70 (
% 64.46/64.70 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 )
% 64.46/64.70 )
% 64.46/64.70
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of white
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( ~(white(X0,X1)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of dirty
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( ~(dirty(X0,X1)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of old
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( ~(old(X0,X1)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of street
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( ~(street(X0,X1)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of lonely
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( ~(lonely(X0,X1)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of event
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( event(X0,X1) <=>
% 64.46/64.70 (
% 64.46/64.70 (
% 64.46/64.70 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 )
% 64.46/64.70 )
% 64.46/64.70
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of agent
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2] :
% 64.46/64.70 ( ~(agent(X0,X1,X2)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of present
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( present(X0,X1) <=>
% 64.46/64.70 (
% 64.46/64.70 (
% 64.46/64.70 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 )
% 64.46/64.70 )
% 64.46/64.70
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of barrel
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( ~(barrel(X0,X1)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of down
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2] :
% 64.46/64.70 ( ~(down(X0,X1,X2)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Negative definition of in
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2] :
% 64.46/64.70 ( ~(in(X0,X1,X2)) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of two
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( two(X0,X1) <=>
% 64.46/64.70 (
% 64.46/64.70 (
% 64.46/64.70 ( X0=sk2_esk1_0 & X1=sk2_esk9_0 )
% 64.46/64.70 )
% 64.46/64.70
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of wear
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( wear(X0,X1) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of nonreflexive
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1] :
% 64.46/64.70 ( nonreflexive(X0,X1) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of member
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2] :
% 64.46/64.70 ( member(X0,X1,X2) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of epred1_0
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 ( epred1_0 <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP0_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP3_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP5_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 64.46/64.70 ( sP5_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP6_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP8_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 64.46/64.70 ( sP8_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP9_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP12_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP14_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP14_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP16_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP16_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP19_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP22_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP22_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP25_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP25_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP27_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP27_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP29_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 64.46/64.70 ( sP29_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP30_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP33_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP33_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP35_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP35_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $false
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP36_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP36_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP39_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP39_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP41_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP43_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP43_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP46_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP46_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP49_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP49_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70 %------ Positive definition of sP52_iProver_split
% 64.46/64.70 fof(lit_def,axiom,
% 64.46/64.70 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
% 64.46/64.70 ( sP52_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=>
% 64.46/64.70 $true
% 64.46/64.70 )
% 64.46/64.70 )
% 64.46/64.70 ).
% 64.46/64.70
% 64.46/64.70
% 64.46/64.70
% 64.46/64.70 % ------ Statistics
% 64.46/64.70
% 64.46/64.70 % ------ General
% 64.46/64.70
% 64.46/64.70 % num_of_input_clauses: 121
% 64.46/64.70 % num_of_input_neg_conjectures: 1
% 64.46/64.70 % num_of_splits: 54
% 64.46/64.70 % num_of_split_atoms: 54
% 64.46/64.70 % num_of_sem_filtered_clauses: 0
% 64.46/64.70 % num_of_subtypes: 0
% 64.46/64.70 % monotx_restored_types: 0
% 64.46/64.70 % sat_num_of_epr_types: 0
% 64.46/64.70 % sat_num_of_non_cyclic_types: 0
% 64.46/64.70 % sat_guarded_non_collapsed_types: 0
% 64.46/64.70 % is_epr: 0
% 64.46/64.70 % is_horn: 0
% 64.46/64.70 % has_eq: 0
% 64.46/64.70 % num_pure_diseq_elim: 0
% 64.46/64.70 % simp_replaced_by: 0
% 64.46/64.70 % res_preprocessed: 176
% 64.46/64.70 % prep_upred: 0
% 64.46/64.70 % prep_unflattend: 0
% 64.46/64.70 % pred_elim_cands: 85
% 64.46/64.70 % pred_elim: 17
% 64.46/64.70 % pred_elim_cl: 17
% 64.46/64.70 % pred_elim_cycles: 80
% 64.46/64.70 % forced_gc_time: 0
% 64.46/64.70 % gc_basic_clause_elim: 0
% 64.46/64.70 % parsing_time: 0.012
% 64.46/64.70 % sem_filter_time: 0.
% 64.46/64.70 % pred_elim_time: 0.176
% 64.46/64.70 % out_proof_time: 0.
% 64.46/64.70 % monotx_time: 0.
% 64.46/64.70 % subtype_inf_time: 0.
% 64.46/64.70 % unif_index_cands_time: 0.021
% 64.46/64.70 % unif_index_add_time: 0.024
% 64.46/64.70 % total_time: 31.983
% 64.46/64.70 % num_of_symbols: 147
% 64.46/64.70 % num_of_terms: 29233
% 64.46/64.70
% 64.46/64.70 % ------ Propositional Solver
% 64.46/64.70
% 64.46/64.70 % prop_solver_calls: 20
% 64.46/64.70 % prop_fast_solver_calls: 6937
% 64.46/64.70 % prop_num_of_clauses: 8902
% 64.46/64.70 % prop_preprocess_simplified: 11033
% 64.46/64.70 % prop_fo_subsumed: 112
% 64.46/64.70 % prop_solver_time: 0.001
% 64.46/64.70 % prop_fast_solver_time: 0.008
% 64.46/64.70 % prop_unsat_core_time: 0.
% 64.46/64.70
% 64.46/64.70 % ------ QBF
% 64.46/64.70
% 64.46/64.70 % qbf_q_res: 0
% 64.46/64.70 % qbf_num_tautologies: 0
% 64.46/64.70 % qbf_prep_cycles: 0
% 64.46/64.70
% 64.46/64.70 % ------ BMC1
% 64.46/64.70
% 64.46/64.70 % bmc1_current_bound: -1
% 64.46/64.70 % bmc1_last_solved_bound: -1
% 64.46/64.70 % bmc1_unsat_core_size: -1
% 64.46/64.70 % bmc1_unsat_core_parents_size: -1
% 64.46/64.70 % bmc1_merge_next_fun: 0
% 64.46/64.70 % bmc1_unsat_core_clauses_time: 0.
% 64.46/64.70
% 64.46/64.70 % ------ Instantiation
% 64.46/64.70
% 64.46/64.70 % inst_num_of_clauses: 1256
% 64.46/64.70 % inst_num_in_passive: 0
% 64.46/64.70 % inst_num_in_active: 1256
% 64.46/64.70 % inst_num_in_unprocessed: 0
% 64.46/64.70 % inst_num_of_loops: 1260
% 64.46/64.70 % inst_num_of_learning_restarts: 1
% 64.46/64.70 % inst_num_moves_active_passive: 0
% 64.46/64.70 % inst_lit_activity: 397
% 64.46/64.70 % inst_lit_activity_moves: 0
% 64.46/64.70 % inst_num_tautologies: 0
% 64.46/64.70 % inst_num_prop_implied: 0
% 64.46/64.70 % inst_num_existing_simplified: 0
% 64.46/64.70 % inst_num_eq_res_simplified: 0
% 64.46/64.70 % inst_num_child_elim: 0
% 64.46/64.70 % inst_num_of_dismatching_blockings: 0
% 64.46/64.70 % inst_num_of_non_proper_insts: 1098
% 64.46/64.70 % inst_num_of_duplicates: 0
% 64.46/64.70 % inst_inst_num_from_inst_to_res: 0
% 64.46/64.70 % inst_dismatching_checking_time: 0.003
% 64.46/64.70
% 64.46/64.70 % ------ Resolution
% 64.46/64.70
% 64.46/64.70 % res_num_of_clauses: 40006
% 64.46/64.70 % res_num_in_passive: 28063
% 64.46/64.70 % res_num_in_active: 11986
% 64.46/64.70 % res_num_of_loops: 15000
% 64.46/64.70 % res_forward_subset_subsumed: 30066
% 64.46/64.70 % res_backward_subset_subsumed: 428
% 64.46/64.70 % res_forward_subsumed: 0
% 64.46/64.70 % res_backward_subsumed: 0
% 64.46/64.70 % res_forward_subsumption_resolution: 15965
% 64.46/64.70 % res_backward_subsumption_resolution: 32
% 64.46/64.70 % res_clause_to_clause_subsumption: 62877
% 64.46/64.70 % res_orphan_elimination: 0
% 64.46/64.70 % res_tautology_del: 14701
% 64.46/64.70 % res_num_eq_res_simplified: 0
% 64.46/64.70 % res_num_sel_changes: 0
% 64.46/64.70 % res_moves_from_active_to_pass: 0
% 64.46/64.70
% 64.46/64.70 % Status Unknown
% 64.46/64.70 % Last status :
% 64.46/64.70 % SZS status Unknown
%------------------------------------------------------------------------------