TSTP Solution File: TOP007-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : TOP007-1 : TPTP v8.1.0. Released v1.0.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 : Thu Jul 21 21:26:57 EDT 2022
% Result : Unknown 240.16s 240.44s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : TOP007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 07:34:09 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.19/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.42 % Orientation found
% 0.19/0.42 % 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_42637f.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_4714f7.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_210558 | grep -v "SZS"
% 0.19/0.44
% 0.19/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.44
% 0.19/0.44 %
% 0.19/0.44 % ------ iProver source info
% 0.19/0.44
% 0.19/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.44 % git: non_committed_changes: true
% 0.19/0.44 % git: last_make_outside_of_git: true
% 0.19/0.44
% 0.19/0.44 %
% 0.19/0.44 % ------ Input Options
% 0.19/0.44
% 0.19/0.44 % --out_options all
% 0.19/0.44 % --tptp_safe_out true
% 0.19/0.44 % --problem_path ""
% 0.19/0.44 % --include_path ""
% 0.19/0.44 % --clausifier .//eprover
% 0.19/0.44 % --clausifier_options --tstp-format
% 0.19/0.44 % --stdin false
% 0.19/0.44 % --dbg_backtrace false
% 0.19/0.44 % --dbg_dump_prop_clauses false
% 0.19/0.44 % --dbg_dump_prop_clauses_file -
% 0.19/0.44 % --dbg_out_stat false
% 0.19/0.44
% 0.19/0.44 % ------ General Options
% 0.19/0.44
% 0.19/0.44 % --fof false
% 0.19/0.44 % --time_out_real 150.
% 0.19/0.44 % --time_out_prep_mult 0.2
% 0.19/0.44 % --time_out_virtual -1.
% 0.19/0.44 % --schedule none
% 0.19/0.44 % --ground_splitting input
% 0.19/0.44 % --splitting_nvd 16
% 0.19/0.44 % --non_eq_to_eq false
% 0.19/0.44 % --prep_gs_sim true
% 0.19/0.44 % --prep_unflatten false
% 0.19/0.44 % --prep_res_sim true
% 0.19/0.44 % --prep_upred true
% 0.19/0.44 % --res_sim_input true
% 0.19/0.44 % --clause_weak_htbl true
% 0.19/0.44 % --gc_record_bc_elim false
% 0.19/0.44 % --symbol_type_check false
% 0.19/0.44 % --clausify_out false
% 0.19/0.44 % --large_theory_mode false
% 0.19/0.44 % --prep_sem_filter none
% 0.19/0.44 % --prep_sem_filter_out false
% 0.19/0.44 % --preprocessed_out false
% 0.19/0.44 % --sub_typing false
% 0.19/0.44 % --brand_transform false
% 0.19/0.44 % --pure_diseq_elim true
% 0.19/0.44 % --min_unsat_core false
% 0.19/0.44 % --pred_elim true
% 0.19/0.44 % --add_important_lit false
% 0.19/0.44 % --soft_assumptions false
% 0.19/0.44 % --reset_solvers false
% 0.19/0.44 % --bc_imp_inh []
% 0.19/0.44 % --conj_cone_tolerance 1.5
% 0.19/0.44 % --prolific_symb_bound 500
% 0.19/0.44 % --lt_threshold 2000
% 0.19/0.44
% 0.19/0.44 % ------ SAT Options
% 0.19/0.44
% 0.19/0.44 % --sat_mode false
% 0.19/0.44 % --sat_fm_restart_options ""
% 0.19/0.44 % --sat_gr_def false
% 0.19/0.44 % --sat_epr_types true
% 0.19/0.44 % --sat_non_cyclic_types false
% 0.19/0.44 % --sat_finite_models false
% 0.19/0.44 % --sat_fm_lemmas false
% 0.19/0.44 % --sat_fm_prep false
% 0.19/0.44 % --sat_fm_uc_incr true
% 0.19/0.44 % --sat_out_model small
% 0.19/0.44 % --sat_out_clauses false
% 0.19/0.44
% 0.19/0.44 % ------ QBF Options
% 0.19/0.44
% 0.19/0.44 % --qbf_mode false
% 0.19/0.44 % --qbf_elim_univ true
% 0.19/0.44 % --qbf_sk_in true
% 0.19/0.44 % --qbf_pred_elim true
% 0.19/0.44 % --qbf_split 32
% 0.19/0.44
% 0.19/0.44 % ------ BMC1 Options
% 0.19/0.44
% 0.19/0.44 % --bmc1_incremental false
% 0.19/0.44 % --bmc1_axioms reachable_all
% 0.19/0.44 % --bmc1_min_bound 0
% 0.19/0.44 % --bmc1_max_bound -1
% 0.19/0.44 % --bmc1_max_bound_default -1
% 0.19/0.44 % --bmc1_symbol_reachability true
% 0.19/0.44 % --bmc1_property_lemmas false
% 0.19/0.44 % --bmc1_k_induction false
% 0.19/0.44 % --bmc1_non_equiv_states false
% 0.19/0.44 % --bmc1_deadlock false
% 0.19/0.44 % --bmc1_ucm false
% 0.19/0.44 % --bmc1_add_unsat_core none
% 0.19/0.44 % --bmc1_unsat_core_children false
% 0.19/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.44 % --bmc1_out_stat full
% 0.19/0.44 % --bmc1_ground_init false
% 0.19/0.44 % --bmc1_pre_inst_next_state false
% 0.19/0.44 % --bmc1_pre_inst_state false
% 0.19/0.44 % --bmc1_pre_inst_reach_state false
% 0.19/0.44 % --bmc1_out_unsat_core false
% 0.19/0.44 % --bmc1_aig_witness_out false
% 0.19/0.44 % --bmc1_verbose false
% 0.19/0.44 % --bmc1_dump_clauses_tptp false
% 0.19/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.48 % --bmc1_dump_file -
% 0.19/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.48 % --bmc1_ucm_extend_mode 1
% 0.19/0.48 % --bmc1_ucm_init_mode 2
% 0.19/0.48 % --bmc1_ucm_cone_mode none
% 0.19/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.48 % --bmc1_ucm_relax_model 4
% 0.19/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.48 % --bmc1_ucm_layered_model none
% 0.19/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.48
% 0.19/0.48 % ------ AIG Options
% 0.19/0.48
% 0.19/0.48 % --aig_mode false
% 0.19/0.48
% 0.19/0.48 % ------ Instantiation Options
% 0.19/0.48
% 0.19/0.48 % --instantiation_flag true
% 0.19/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.48 % --inst_solver_per_active 750
% 0.19/0.48 % --inst_solver_calls_frac 0.5
% 0.19/0.48 % --inst_passive_queue_type priority_queues
% 0.19/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.48 % --inst_passive_queues_freq [25;2]
% 0.19/0.48 % --inst_dismatching true
% 0.19/0.48 % --inst_eager_unprocessed_to_passive true
% 0.19/0.48 % --inst_prop_sim_given true
% 0.19/0.48 % --inst_prop_sim_new false
% 0.19/0.48 % --inst_orphan_elimination true
% 0.19/0.48 % --inst_learning_loop_flag true
% 0.19/0.48 % --inst_learning_start 3000
% 0.19/0.48 % --inst_learning_factor 2
% 0.19/0.48 % --inst_start_prop_sim_after_learn 3
% 0.19/0.48 % --inst_sel_renew solver
% 0.19/0.48 % --inst_lit_activity_flag true
% 0.19/0.48 % --inst_out_proof true
% 0.19/0.48
% 0.19/0.48 % ------ Resolution Options
% 0.19/0.48
% 0.19/0.48 % --resolution_flag true
% 0.19/0.48 % --res_lit_sel kbo_max
% 0.19/0.48 % --res_to_prop_solver none
% 0.19/0.48 % --res_prop_simpl_new false
% 0.19/0.48 % --res_prop_simpl_given false
% 0.19/0.48 % --res_passive_queue_type priority_queues
% 0.19/0.48 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.48 % --res_passive_queues_freq [15;5]
% 0.19/0.48 % --res_forward_subs full
% 0.19/0.48 % --res_backward_subs full
% 0.19/0.48 % --res_forward_subs_resolution true
% 0.19/0.48 % --res_backward_subs_resolution true
% 0.19/0.48 % --res_orphan_elimination false
% 0.19/0.48 % --res_time_limit 1000.
% 0.19/0.48 % --res_out_proof true
% 0.19/0.48 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_42637f.s
% 0.19/0.48 % --modulo true
% 0.19/0.48
% 0.19/0.48 % ------ Combination Options
% 0.19/0.48
% 0.19/0.48 % --comb_res_mult 1000
% 0.19/0.48 % --comb_inst_mult 300
% 0.19/0.48 % ------
% 0.19/0.48
% 0.19/0.48 % ------ Parsing...% successful
% 0.19/0.48
% 0.19/0.48 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.19/0.48
% 0.19/0.48 % ------ Proving...
% 0.19/0.48 % ------ Problem Properties
% 0.19/0.48
% 0.19/0.48 %
% 0.19/0.48 % EPR false
% 0.19/0.48 % Horn false
% 0.19/0.48 % Has equality false
% 0.19/0.48
% 0.19/0.48 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 % % ------ Current options:
% 0.19/0.48
% 0.19/0.48 % ------ Input Options
% 0.19/0.48
% 0.19/0.48 % --out_options all
% 0.19/0.48 % --tptp_safe_out true
% 0.19/0.48 % --problem_path ""
% 0.19/0.48 % --include_path ""
% 0.19/0.48 % --clausifier .//eprover
% 0.19/0.48 % --clausifier_options --tstp-format
% 0.19/0.48 % --stdin false
% 0.19/0.48 % --dbg_backtrace false
% 0.19/0.48 % --dbg_dump_prop_clauses false
% 0.19/0.48 % --dbg_dump_prop_clauses_file -
% 0.19/0.48 % --dbg_out_stat false
% 0.19/0.48
% 0.19/0.48 % ------ General Options
% 0.19/0.48
% 0.19/0.48 % --fof false
% 0.19/0.48 % --time_out_real 150.
% 0.19/0.48 % --time_out_prep_mult 0.2
% 0.19/0.48 % --time_out_virtual -1.
% 0.19/0.48 % --schedule none
% 0.19/0.48 % --ground_splitting input
% 0.19/0.48 % --splitting_nvd 16
% 0.19/0.48 % --non_eq_to_eq false
% 0.19/0.48 % --prep_gs_sim true
% 0.19/0.48 % --prep_unflatten false
% 0.19/0.48 % --prep_res_sim true
% 0.19/0.48 % --prep_upred true
% 0.19/0.48 % --res_sim_input true
% 0.19/0.48 % --clause_weak_htbl true
% 0.19/0.48 % --gc_record_bc_elim false
% 0.19/0.48 % --symbol_type_check false
% 0.19/0.48 % --clausify_out false
% 0.19/0.48 % --large_theory_mode false
% 0.19/0.48 % --prep_sem_filter none
% 0.19/0.48 % --prep_sem_filter_out false
% 0.19/0.48 % --preprocessed_out false
% 0.19/0.48 % --sub_typing false
% 0.19/0.48 % --brand_transform false
% 0.19/0.48 % --pure_diseq_elim true
% 0.19/0.48 % --min_unsat_core false
% 0.19/0.48 % --pred_elim true
% 0.19/0.48 % --add_important_lit false
% 0.19/0.48 % --soft_assumptions false
% 0.19/0.48 % --reset_solvers false
% 0.19/0.48 % --bc_imp_inh []
% 0.19/0.48 % --conj_cone_tolerance 1.5
% 0.19/0.48 % --prolific_symb_bound 500
% 0.19/0.48 % --lt_threshold 2000
% 0.19/0.48
% 0.19/0.48 % ------ SAT Options
% 0.19/0.48
% 0.19/0.48 % --sat_mode false
% 0.19/0.48 % --sat_fm_restart_options ""
% 0.19/0.48 % --sat_gr_def false
% 0.19/0.48 % --sat_epr_types true
% 0.19/0.48 % --sat_non_cyclic_types false
% 0.19/0.48 % --sat_finite_models false
% 0.19/0.48 % --sat_fm_lemmas false
% 0.19/0.48 % --sat_fm_prep false
% 0.19/0.48 % --sat_fm_uc_incr true
% 0.19/0.48 % --sat_out_model small
% 0.19/0.48 % --sat_out_clauses false
% 0.19/0.48
% 0.19/0.48 % ------ QBF Options
% 0.19/0.48
% 0.19/0.48 % --qbf_mode false
% 0.19/0.48 % --qbf_elim_univ true
% 0.19/0.48 % --qbf_sk_in true
% 0.19/0.48 % --qbf_pred_elim true
% 0.19/0.48 % --qbf_split 32
% 0.19/0.48
% 0.19/0.48 % ------ BMC1 Options
% 0.19/0.48
% 0.19/0.48 % --bmc1_incremental false
% 0.19/0.48 % --bmc1_axioms reachable_all
% 0.19/0.48 % --bmc1_min_bound 0
% 0.19/0.48 % --bmc1_max_bound -1
% 0.19/0.48 % --bmc1_max_bound_default -1
% 0.19/0.48 % --bmc1_symbol_reachability true
% 0.19/0.48 % --bmc1_property_lemmas false
% 0.19/0.48 % --bmc1_k_induction false
% 0.19/0.48 % --bmc1_non_equiv_states false
% 0.19/0.48 % --bmc1_deadlock false
% 0.19/0.48 % --bmc1_ucm false
% 0.19/0.48 % --bmc1_add_unsat_core none
% 0.19/0.48 % --bmc1_unsat_core_children false
% 0.19/0.48 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.48 % --bmc1_out_stat full
% 0.19/0.48 % --bmc1_ground_init false
% 0.19/0.48 % --bmc1_pre_inst_next_state false
% 0.19/0.48 % --bmc1_pre_inst_state false
% 0.19/0.48 % --bmc1_pre_inst_reach_state false
% 0.19/0.48 % --bmc1_out_unsat_core false
% 0.19/0.48 % --bmc1_aig_witness_out false
% 0.19/0.48 % --bmc1_verbose false
% 0.19/0.48 % --bmc1_dump_clauses_tptp false
% 0.19/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.48 % --bmc1_dump_file -
% 0.19/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.48 % --bmc1_ucm_extend_mode 1
% 0.19/0.48 % --bmc1_ucm_init_mode 2
% 0.19/0.48 % --bmc1_ucm_cone_mode none
% 0.19/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.48 % --bmc1_ucm_relax_model 4
% 0.19/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.48 % --bmc1_ucm_layered_model none
% 0.19/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.48
% 0.19/0.48 % ------ AIG Options
% 0.19/0.48
% 0.19/0.48 % --aig_mode false
% 0.19/0.48
% 0.19/0.48 % ------ Instantiation Options
% 0.19/0.48
% 0.19/0.48 % --instantiation_flag true
% 0.19/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.48 % --inst_solver_per_active 750
% 0.19/0.48 % --inst_solver_calls_frac 0.5
% 0.19/0.48 % --inst_passive_queue_type priority_queues
% 0.19/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.48 % --inst_passive_queues_freq [25;2]
% 0.19/0.48 % --inst_dismatching true
% 0.19/0.48 % --inst_eager_unprocessed_to_passive true
% 0.19/0.48 % --inst_prop_sim_given true
% 90.13/90.35 % --inst_prop_sim_new false
% 90.13/90.35 % --inst_orphan_elimination true
% 90.13/90.35 % --inst_learning_loop_flag true
% 90.13/90.35 % --inst_learning_start 3000
% 90.13/90.35 % --inst_learning_factor 2
% 90.13/90.35 % --inst_start_prop_sim_after_learn 3
% 90.13/90.35 % --inst_sel_renew solver
% 90.13/90.35 % --inst_lit_activity_flag true
% 90.13/90.35 % --inst_out_proof true
% 90.13/90.35
% 90.13/90.35 % ------ Resolution Options
% 90.13/90.35
% 90.13/90.35 % --resolution_flag true
% 90.13/90.35 % --res_lit_sel kbo_max
% 90.13/90.35 % --res_to_prop_solver none
% 90.13/90.35 % --res_prop_simpl_new false
% 90.13/90.35 % --res_prop_simpl_given false
% 90.13/90.35 % --res_passive_queue_type priority_queues
% 90.13/90.35 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 90.13/90.35 % --res_passive_queues_freq [15;5]
% 90.13/90.35 % --res_forward_subs full
% 90.13/90.35 % --res_backward_subs full
% 90.13/90.35 % --res_forward_subs_resolution true
% 90.13/90.35 % --res_backward_subs_resolution true
% 90.13/90.35 % --res_orphan_elimination false
% 90.13/90.35 % --res_time_limit 1000.
% 90.13/90.35 % --res_out_proof true
% 90.13/90.35 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_42637f.s
% 90.13/90.35 % --modulo true
% 90.13/90.35
% 90.13/90.35 % ------ Combination Options
% 90.13/90.35
% 90.13/90.35 % --comb_res_mult 1000
% 90.13/90.35 % --comb_inst_mult 300
% 90.13/90.35 % ------
% 90.13/90.35
% 90.13/90.35
% 90.13/90.35
% 90.13/90.35 % ------ Proving...
% 90.13/90.35 % warning: shown sat in sat incomplete mode
% 90.13/90.35 %
% 90.13/90.35
% 90.13/90.35
% 90.13/90.35 ------ Building Model...Done
% 90.13/90.35
% 90.13/90.35 %------ The model is defined over ground terms (initial term algebra).
% 90.13/90.35 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 90.13/90.35 %------ where \phi is a formula over the term algebra.
% 90.13/90.35 %------ If we have equality in the problem then it is also defined as a predicate above,
% 90.13/90.35 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 90.13/90.35 %------ See help for --sat_out_model for different model outputs.
% 90.13/90.35 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 90.13/90.35 %------ where the first argument stands for the sort ($i in the unsorted case)
% 90.13/90.35
% 90.13/90.35
% 90.13/90.35
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of neighborhood
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1,X2,X3] :
% 90.13/90.35 ( neighborhood(X0,X1,X2,X3) <=>
% 90.13/90.35 $false
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of limit_point
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1,X2,X3] :
% 90.13/90.35 ( limit_point(X0,X1,X2,X3) <=>
% 90.13/90.35 (
% 90.13/90.35 ? [X4] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f11(X4,a) & X1=a & X2=cx & X3=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X1=a & X2=cx & X3=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of element_of_set
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1] :
% 90.13/90.35 ( element_of_set(X0,X1) <=>
% 90.13/90.35 (
% 90.13/90.35 ? [X2] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f11(X2,closure(a,cx,ct)) & X1=closure(a,cx,ct) )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f11(X2,closure(relative_complement_sets(a,cx),cx,ct)) & X1=closure(a,cx,ct) )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2,X3,X4,X5,X6] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f11(X2,intersection_of_members(top_of_basis(X3))) & X1=intersection_of_members(subspace_topology(X4,X5,X6)) )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2,X3] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f11(X2,intersection_of_members(top_of_basis(X3))) & X1=closure(a,cx,ct) )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2,X3,X4,X5] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f11(X2,intersection_of_members(subspace_topology(X3,X4,X5))) & X1=intersection_of_members(subspace_topology(X3,X4,X5)) )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2,X3,X4] :
% 90.13/90.35 (
% 90.13/90.35 ( X1=intersection_of_members(subspace_topology(X2,X3,X4)) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f11(X0,intersection_of_members(top_of_basis(X2))) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f11(X0,intersection_of_members(subspace_topology(X2,X3,X4))) | X2!=X2 | X3!=X3 | X4!=X4 )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X1=closure(a,cx,ct) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f11(X0,closure(a,cx,ct)) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f11(X0,closure(relative_complement_sets(a,cx),cx,ct)) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f11(X0,intersection_of_members(top_of_basis(X2))) )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of subset_sets
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1] :
% 90.13/90.35 ( subset_sets(X0,X1) <=>
% 90.13/90.35 (
% 90.13/90.35 (
% 90.13/90.35 ( X0=a & X1=cx )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f30(f11(X2,a)) & X1=a )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Negative definition of element_of_collection
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1] :
% 90.13/90.35 ( ~(element_of_collection(X0,X1)) <=>
% 90.13/90.35 (
% 90.13/90.35 (
% 90.13/90.35 ( X0!=empty_set | X1!=ct )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=union_of_members(X0) | X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=intersection_of_sets(X0,X1) | X1!=ct )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=intersection_of_sets(X0,X1) | X1!=top_of_basis(X3) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f2(X1,X0) | X1!=X1 )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f2(X0,X1) | X1!=X0 )
% 90.13/90.35 &
% 90.13/90.35 ! [X3] : ( X0!=f2(X0,X1) | X1!=top_of_basis(X3) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=a | X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=a | X1!=top_of_basis(X0) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=a | X1!=top_of_basis(X2) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=cx | X1!=ct )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=intersection_of_members(top_of_basis(X0)) | X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f2(X0,X2) | X1!=X0 )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=closure(X0,cx,ct) | X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=intersection_of_sets(X0,X2) | X1!=ct )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=closure(relative_complement_sets(a,cx),cx,ct) | X1!=top_of_basis(X0) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f2(ct,X0) | X1!=ct )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=intersection_of_sets(cx,f2(ct,X0)) | X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=intersection_of_sets(empty_set,f2(ct,X0)) | X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f2(top_of_basis(X0),X1) | X1!=top_of_basis(X0) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=intersection_of_sets(X4,X0) | X1!=ct )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=intersection_of_sets(X2,X0) | X1!=ct )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=intersection_of_sets(X1,X0) | X1!=ct )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X0=empty_set )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=union_of_members(X2) )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=union_of_members(X2) & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X0=a )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X0=a & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2,X3,X4] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=intersection_of_members(subspace_topology(X2,X3,X4)) )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2,X3,X4] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=intersection_of_members(subspace_topology(X2,X3,X4)) & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2,X3,X4,X5] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=intersection_of_members(subspace_topology(X2,X3,X4)) & X1=top_of_basis(X5) )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=intersection_of_members(top_of_basis(X2)) & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X0=union_of_members(ct) )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X0=union_of_members(ct) & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2,X3] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f2(X2,X3) & X1=ct )
% 90.13/90.35 &
% 90.13/90.35 ( X2!=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X0=closure(a,cx,ct) )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=top_of_basis(X1) )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X0=closure(a,cx,ct) & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=closure(a,cx,ct) & X1=top_of_basis(X2) )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X0=closure(relative_complement_sets(a,cx),cx,ct) & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=closure(X2,cx,ct) & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f30(f11(X2,a)) & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2,X3,X4,X5] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f2(subspace_topology(X2,X3,X4),X5) & X1=subspace_topology(X2,X3,X4) )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=relative_complement_sets(X2,cx) & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X2,X3,X4] :
% 90.13/90.35 (
% 90.13/90.35 ( X1=subspace_topology(X2,X3,X4) )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f2(subspace_topology(X0,X2,X3),X4) | X2!=X0 | X3!=X2 | X4!=X3 )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f2(subspace_topology(X0,X4,X2),X3) | X2!=X0 | X3!=X4 | X4!=X2 )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f2(subspace_topology(X2,X3,X4),X0) | X2!=X2 | X3!=X3 | X4!=X4 )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f2(subspace_topology(X2,X3,X0),X4) | X2!=X2 | X3!=X3 | X4!=X0 )
% 90.13/90.35 &
% 90.13/90.35 ( X0!=f2(subspace_topology(X2,X0,X4),X3) | X2!=X2 | X3!=X0 | X4!=X4 )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of basis
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1] :
% 90.13/90.35 ( basis(X0,X1) <=>
% 90.13/90.35 (
% 90.13/90.35 (
% 90.13/90.35 ( X0=cx & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of topological_space
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1] :
% 90.13/90.35 ( topological_space(X0,X1) <=>
% 90.13/90.35 (
% 90.13/90.35 (
% 90.13/90.35 ( X0=cx & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of equal_sets
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1] :
% 90.13/90.35 ( equal_sets(X0,X1) <=>
% 90.13/90.35 (
% 90.13/90.35 (
% 90.13/90.35 ( X0=union_of_members(ct) & X1=cx )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of disjoint_s
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1] :
% 90.13/90.35 ( disjoint_s(X0,X1) <=>
% 90.13/90.35 $false
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of hausdorff
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1] :
% 90.13/90.35 ( hausdorff(X0,X1) <=>
% 90.13/90.35 (
% 90.13/90.35 (
% 90.13/90.35 ( X0=cx & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Negative definition of open
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1,X2] :
% 90.13/90.35 ( ~(open(X0,X1,X2)) <=>
% 90.13/90.35 (
% 90.13/90.35 (
% 90.13/90.35 ( X0!=f2(ct,X0) | X1!=cx | X2!=ct )
% 90.13/90.35 &
% 90.13/90.35 ( X1!=cx | X2!=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X0=a & X1=cx & X2=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X3,X4,X5] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=intersection_of_members(subspace_topology(X3,X4,X5)) & X1=cx & X2=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X3] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=intersection_of_members(top_of_basis(X3)) & X1=cx & X2=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X0=union_of_members(ct) & X1=cx & X2=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 (
% 90.13/90.35 ( X0=closure(a,cx,ct) & X1=cx & X2=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X3] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=union_of_members(X3) & X1=cx & X2=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X3,X4] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f2(X3,X4) & X1=cx & X2=ct )
% 90.13/90.35 &
% 90.13/90.35 ( X3!=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X3] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=f30(f11(X3,a)) & X1=cx & X2=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X3] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=closure(X3,cx,ct) & X1=cx & X2=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 |
% 90.13/90.35 ? [X3] :
% 90.13/90.35 (
% 90.13/90.35 ( X0=relative_complement_sets(X3,cx) & X1=cx & X2=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of closed
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1,X2] :
% 90.13/90.35 ( closed(X0,X1,X2) <=>
% 90.13/90.35 $false
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of separation
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1,X2,X3] :
% 90.13/90.35 ( separation(X0,X1,X2,X3) <=>
% 90.13/90.35 $false
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of connected_space
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1] :
% 90.13/90.35 ( connected_space(X0,X1) <=>
% 90.13/90.35 (
% 90.13/90.35 (
% 90.13/90.35 ( X0=cx & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of subset_collections
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1] :
% 90.13/90.35 ( subset_collections(X0,X1) <=>
% 90.13/90.35 $false
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of connected_set
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1,X2] :
% 90.13/90.35 ( connected_set(X0,X1,X2) <=>
% 90.13/90.35 $false
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of compact_set
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1,X2] :
% 90.13/90.35 ( compact_set(X0,X1,X2) <=>
% 90.13/90.35 $false
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of compact_space
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1] :
% 90.13/90.35 ( compact_space(X0,X1) <=>
% 90.13/90.35 (
% 90.13/90.35 (
% 90.13/90.35 ( X0=cx & X1=ct )
% 90.13/90.35 )
% 90.13/90.35
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of open_covering
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1,X2] :
% 90.13/90.35 ( open_covering(X0,X1,X2) <=>
% 90.13/90.35 $false
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of finite
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0] :
% 90.13/90.35 ( finite(X0) <=>
% 90.13/90.35 $false
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35 %------ Positive definition of finer
% 90.13/90.35 fof(lit_def,axiom,
% 90.13/90.35 (! [X0,X1,X2] :
% 90.13/90.35 ( finer(X0,X1,X2) <=>
% 90.13/90.35 $false
% 90.13/90.35 )
% 90.13/90.35 )
% 90.13/90.35 ).
% 90.13/90.35
% 90.13/90.35
% 90.13/90.35
% 90.13/90.35 % ------ Statistics
% 90.13/90.35
% 90.13/90.35 % ------ General
% 90.13/90.35
% 90.13/90.35 % num_of_input_clauses: 341
% 90.13/90.35 % num_of_input_neg_conjectures: 5
% 90.13/90.35 % num_of_splits: 0
% 90.13/90.35 % num_of_split_atoms: 0
% 90.13/90.35 % num_of_sem_filtered_clauses: 0
% 90.13/90.35 % num_of_subtypes: 0
% 90.13/90.35 % monotx_restored_types: 0
% 90.13/90.35 % sat_num_of_epr_types: 0
% 90.13/90.35 % sat_num_of_non_cyclic_types: 0
% 90.13/90.35 % sat_guarded_non_collapsed_types: 0
% 90.13/90.35 % is_epr: 0
% 90.13/90.35 % is_horn: 0
% 90.13/90.35 % has_eq: 0
% 90.13/90.35 % num_pure_diseq_elim: 0
% 90.13/90.35 % simp_replaced_by: 0
% 90.13/90.35 % res_preprocessed: 10
% 90.13/90.35 % prep_upred: 0
% 90.13/90.35 % prep_unflattend: 0
% 90.13/90.35 % pred_elim_cands: 0
% 90.13/90.35 % pred_elim: 0
% 90.13/90.35 % pred_elim_cl: 0
% 90.13/90.35 % pred_elim_cycles: 0
% 90.13/90.35 % forced_gc_time: 0
% 90.13/90.35 % gc_basic_clause_elim: 0
% 90.13/90.35 % parsing_time: 0.017
% 90.13/90.35 % sem_filter_time: 0.
% 90.13/90.35 % pred_elim_time: 0.
% 90.13/90.35 % out_proof_time: 0.
% 90.13/90.35 % monotx_time: 0.
% 90.13/90.35 % subtype_inf_time: 0.
% 90.13/90.35 % unif_index_cands_time: 0.041
% 90.13/90.35 % unif_index_add_time: 0.045
% 90.13/90.35 % total_time: 89.924
% 90.13/90.35 % num_of_symbols: 86
% 90.13/90.35 % num_of_terms: 405729
% 90.13/90.35
% 90.13/90.35 % ------ Propositional Solver
% 90.13/90.35
% 90.13/90.35 % prop_solver_calls: 10
% 90.13/90.35 % prop_fast_solver_calls: 21
% 90.13/90.35 % prop_num_of_clauses: 1930
% 90.13/90.35 % prop_preprocess_simplified: 3637
% 90.13/90.35 % prop_fo_subsumed: 0
% 90.13/90.35 % prop_solver_time: 0.001
% 90.13/90.35 % prop_fast_solver_time: 0.
% 90.13/90.35 % prop_unsat_core_time: 0.
% 90.13/90.35
% 90.13/90.35 % ------ QBF
% 90.13/90.35
% 90.13/90.35 % qbf_q_res: 0
% 90.13/90.35 % qbf_num_tautologies: 0
% 90.13/90.35 % qbf_prep_cycles: 0
% 90.13/90.35
% 90.13/90.35 % ------ BMC1
% 90.13/90.35
% 90.13/90.35 % bmc1_current_bound: -1
% 90.13/90.35 % bmc1_last_solved_bound: -1
% 90.13/90.35 % bmc1_unsat_core_size: -1
% 90.13/90.35 % bmc1_unsat_core_parents_size: -1
% 90.13/90.35 % bmc1_merge_next_fun: 0
% 90.13/90.35 % bmc1_unsat_core_clauses_time: 0.
% 90.13/90.35
% 90.13/90.35 % ------ Instantiation
% 90.13/90.35
% 90.13/90.35 % inst_num_of_clauses: 1230
% 90.13/90.35 % inst_num_in_passive: 0
% 90.13/90.35 % inst_num_in_active: 1228
% 90.13/90.35 % inst_num_in_unprocessed: 0
% 90.13/90.35 % inst_num_of_loops: 1280
% 90.13/90.35 % inst_num_of_learning_restarts: 0
% 90.13/90.35 % inst_num_moves_active_passive: 43
% 90.13/90.35 % inst_lit_activity: 238
% 90.13/90.35 % inst_lit_activity_moves: 0
% 90.13/90.35 % inst_num_tautologies: 2
% 90.13/90.35 % inst_num_prop_implied: 0
% 90.13/90.35 % inst_num_existing_simplified: 0
% 90.13/90.35 % inst_num_eq_res_simplified: 0
% 90.13/90.35 % inst_num_child_elim: 0
% 90.13/90.35 % inst_num_of_dismatching_blockings: 1644
% 90.13/90.35 % inst_num_of_non_proper_insts: 2260
% 90.13/90.35 % inst_num_of_duplicates: 821
% 90.13/90.35 % inst_inst_num_from_inst_to_res: 0
% 90.13/90.35 % inst_dismatching_checking_time: 0.002
% 90.13/90.35
% 90.13/90.35 % ------ Resolution
% 90.13/90.35
% 90.13/90.35 % res_num_of_clauses: 176197
% 90.13/90.35 % res_num_in_passive: 171265
% 90.13/90.35 % res_num_in_active: 4667
% 90.13/90.35 % res_num_of_loops: 5000
% 90.13/90.35 % res_forward_subset_subsumed: 4703
% 90.13/90.35 % res_backward_subset_subsumed: 0
% 90.13/90.35 % res_forward_subsumed: 452
% 90.13/90.35 % res_backward_subsumed: 0
% 90.13/90.35 % res_forward_subsumption_resolution: 67
% 90.13/90.35 % res_backward_subsumption_resolution: 0
% 90.13/90.35 % res_clause_to_clause_subsumption: 1442367
% 90.13/90.35 % res_orphan_elimination: 0
% 90.13/90.35 % res_tautology_del: 4
% 90.13/90.35 % res_num_eq_res_simplified: 0
% 90.13/90.35 % res_num_sel_changes: 0
% 90.13/90.35 % res_moves_from_active_to_pass: 0
% 90.13/90.35
% 90.13/90.35 % Status Unknown
% 90.18/90.41 % Orienting using strategy ClausalAll
% 90.18/90.41 % Orientation found
% 90.18/90.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_42637f.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_4714f7.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_86eb3b | grep -v "SZS"
% 90.18/90.43
% 90.18/90.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 90.18/90.43
% 90.18/90.43 %
% 90.18/90.43 % ------ iProver source info
% 90.18/90.43
% 90.18/90.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 90.18/90.43 % git: non_committed_changes: true
% 90.18/90.43 % git: last_make_outside_of_git: true
% 90.18/90.43
% 90.18/90.43 %
% 90.18/90.43 % ------ Input Options
% 90.18/90.43
% 90.18/90.43 % --out_options all
% 90.18/90.43 % --tptp_safe_out true
% 90.18/90.43 % --problem_path ""
% 90.18/90.43 % --include_path ""
% 90.18/90.43 % --clausifier .//eprover
% 90.18/90.43 % --clausifier_options --tstp-format
% 90.18/90.43 % --stdin false
% 90.18/90.43 % --dbg_backtrace false
% 90.18/90.43 % --dbg_dump_prop_clauses false
% 90.18/90.43 % --dbg_dump_prop_clauses_file -
% 90.18/90.43 % --dbg_out_stat false
% 90.18/90.43
% 90.18/90.43 % ------ General Options
% 90.18/90.43
% 90.18/90.43 % --fof false
% 90.18/90.43 % --time_out_real 150.
% 90.18/90.43 % --time_out_prep_mult 0.2
% 90.18/90.43 % --time_out_virtual -1.
% 90.18/90.43 % --schedule none
% 90.18/90.43 % --ground_splitting input
% 90.18/90.43 % --splitting_nvd 16
% 90.18/90.43 % --non_eq_to_eq false
% 90.18/90.43 % --prep_gs_sim true
% 90.18/90.43 % --prep_unflatten false
% 90.18/90.43 % --prep_res_sim true
% 90.18/90.43 % --prep_upred true
% 90.18/90.43 % --res_sim_input true
% 90.18/90.43 % --clause_weak_htbl true
% 90.18/90.43 % --gc_record_bc_elim false
% 90.18/90.43 % --symbol_type_check false
% 90.18/90.43 % --clausify_out false
% 90.18/90.43 % --large_theory_mode false
% 90.18/90.43 % --prep_sem_filter none
% 90.18/90.43 % --prep_sem_filter_out false
% 90.18/90.43 % --preprocessed_out false
% 90.18/90.43 % --sub_typing false
% 90.18/90.43 % --brand_transform false
% 90.18/90.43 % --pure_diseq_elim true
% 90.18/90.43 % --min_unsat_core false
% 90.18/90.43 % --pred_elim true
% 90.18/90.43 % --add_important_lit false
% 90.18/90.43 % --soft_assumptions false
% 90.18/90.43 % --reset_solvers false
% 90.18/90.43 % --bc_imp_inh []
% 90.18/90.43 % --conj_cone_tolerance 1.5
% 90.18/90.43 % --prolific_symb_bound 500
% 90.18/90.43 % --lt_threshold 2000
% 90.18/90.43
% 90.18/90.43 % ------ SAT Options
% 90.18/90.43
% 90.18/90.43 % --sat_mode false
% 90.18/90.43 % --sat_fm_restart_options ""
% 90.18/90.43 % --sat_gr_def false
% 90.18/90.43 % --sat_epr_types true
% 90.18/90.43 % --sat_non_cyclic_types false
% 90.18/90.43 % --sat_finite_models false
% 90.18/90.43 % --sat_fm_lemmas false
% 90.18/90.43 % --sat_fm_prep false
% 90.18/90.43 % --sat_fm_uc_incr true
% 90.18/90.43 % --sat_out_model small
% 90.18/90.43 % --sat_out_clauses false
% 90.18/90.43
% 90.18/90.43 % ------ QBF Options
% 90.18/90.43
% 90.18/90.43 % --qbf_mode false
% 90.18/90.43 % --qbf_elim_univ true
% 90.18/90.43 % --qbf_sk_in true
% 90.18/90.43 % --qbf_pred_elim true
% 90.18/90.43 % --qbf_split 32
% 90.18/90.43
% 90.18/90.43 % ------ BMC1 Options
% 90.18/90.43
% 90.18/90.43 % --bmc1_incremental false
% 90.18/90.43 % --bmc1_axioms reachable_all
% 90.18/90.43 % --bmc1_min_bound 0
% 90.18/90.43 % --bmc1_max_bound -1
% 90.18/90.43 % --bmc1_max_bound_default -1
% 90.18/90.43 % --bmc1_symbol_reachability true
% 90.18/90.43 % --bmc1_property_lemmas false
% 90.18/90.43 % --bmc1_k_induction false
% 90.18/90.43 % --bmc1_non_equiv_states false
% 90.18/90.43 % --bmc1_deadlock false
% 90.18/90.43 % --bmc1_ucm false
% 90.18/90.43 % --bmc1_add_unsat_core none
% 90.18/90.43 % --bmc1_unsat_core_children false
% 90.18/90.43 % --bmc1_unsat_core_extrapolate_axioms false
% 90.18/90.43 % --bmc1_out_stat full
% 90.18/90.43 % --bmc1_ground_init false
% 90.18/90.43 % --bmc1_pre_inst_next_state false
% 90.18/90.43 % --bmc1_pre_inst_state false
% 90.18/90.43 % --bmc1_pre_inst_reach_state false
% 90.18/90.43 % --bmc1_out_unsat_core false
% 90.18/90.43 % --bmc1_aig_witness_out false
% 90.18/90.43 % --bmc1_verbose false
% 90.18/90.43 % --bmc1_dump_clauses_tptp false
% 90.18/90.47 % --bmc1_dump_unsat_core_tptp false
% 90.18/90.47 % --bmc1_dump_file -
% 90.18/90.47 % --bmc1_ucm_expand_uc_limit 128
% 90.18/90.47 % --bmc1_ucm_n_expand_iterations 6
% 90.18/90.47 % --bmc1_ucm_extend_mode 1
% 90.18/90.47 % --bmc1_ucm_init_mode 2
% 90.18/90.47 % --bmc1_ucm_cone_mode none
% 90.18/90.47 % --bmc1_ucm_reduced_relation_type 0
% 90.18/90.47 % --bmc1_ucm_relax_model 4
% 90.18/90.47 % --bmc1_ucm_full_tr_after_sat true
% 90.18/90.47 % --bmc1_ucm_expand_neg_assumptions false
% 90.18/90.47 % --bmc1_ucm_layered_model none
% 90.18/90.47 % --bmc1_ucm_max_lemma_size 10
% 90.18/90.47
% 90.18/90.47 % ------ AIG Options
% 90.18/90.47
% 90.18/90.47 % --aig_mode false
% 90.18/90.47
% 90.18/90.47 % ------ Instantiation Options
% 90.18/90.47
% 90.18/90.47 % --instantiation_flag true
% 90.18/90.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 90.18/90.47 % --inst_solver_per_active 750
% 90.18/90.47 % --inst_solver_calls_frac 0.5
% 90.18/90.47 % --inst_passive_queue_type priority_queues
% 90.18/90.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 90.18/90.47 % --inst_passive_queues_freq [25;2]
% 90.18/90.47 % --inst_dismatching true
% 90.18/90.47 % --inst_eager_unprocessed_to_passive true
% 90.18/90.47 % --inst_prop_sim_given true
% 90.18/90.47 % --inst_prop_sim_new false
% 90.18/90.47 % --inst_orphan_elimination true
% 90.18/90.47 % --inst_learning_loop_flag true
% 90.18/90.47 % --inst_learning_start 3000
% 90.18/90.47 % --inst_learning_factor 2
% 90.18/90.47 % --inst_start_prop_sim_after_learn 3
% 90.18/90.47 % --inst_sel_renew solver
% 90.18/90.47 % --inst_lit_activity_flag true
% 90.18/90.47 % --inst_out_proof true
% 90.18/90.47
% 90.18/90.47 % ------ Resolution Options
% 90.18/90.47
% 90.18/90.47 % --resolution_flag true
% 90.18/90.47 % --res_lit_sel kbo_max
% 90.18/90.47 % --res_to_prop_solver none
% 90.18/90.47 % --res_prop_simpl_new false
% 90.18/90.47 % --res_prop_simpl_given false
% 90.18/90.47 % --res_passive_queue_type priority_queues
% 90.18/90.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 90.18/90.47 % --res_passive_queues_freq [15;5]
% 90.18/90.47 % --res_forward_subs full
% 90.18/90.47 % --res_backward_subs full
% 90.18/90.47 % --res_forward_subs_resolution true
% 90.18/90.47 % --res_backward_subs_resolution true
% 90.18/90.47 % --res_orphan_elimination false
% 90.18/90.47 % --res_time_limit 1000.
% 90.18/90.47 % --res_out_proof true
% 90.18/90.47 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_42637f.s
% 90.18/90.47 % --modulo true
% 90.18/90.47
% 90.18/90.47 % ------ Combination Options
% 90.18/90.47
% 90.18/90.47 % --comb_res_mult 1000
% 90.18/90.47 % --comb_inst_mult 300
% 90.18/90.47 % ------
% 90.18/90.47
% 90.18/90.47 % ------ Parsing...% successful
% 90.18/90.47
% 90.18/90.47 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 90.18/90.47
% 90.18/90.47 % ------ Proving...
% 90.18/90.47 % ------ Problem Properties
% 90.18/90.47
% 90.18/90.47 %
% 90.18/90.47 % EPR false
% 90.18/90.47 % Horn false
% 90.18/90.47 % Has equality false
% 90.18/90.47
% 90.18/90.47 % % ------ Input Options Time Limit: Unbounded
% 90.18/90.47
% 90.18/90.47
% 90.18/90.47 % % ------ Current options:
% 90.18/90.47
% 90.18/90.47 % ------ Input Options
% 90.18/90.47
% 90.18/90.47 % --out_options all
% 90.18/90.47 % --tptp_safe_out true
% 90.18/90.47 % --problem_path ""
% 90.18/90.47 % --include_path ""
% 90.18/90.47 % --clausifier .//eprover
% 90.18/90.47 % --clausifier_options --tstp-format
% 90.18/90.47 % --stdin false
% 90.18/90.47 % --dbg_backtrace false
% 90.18/90.47 % --dbg_dump_prop_clauses false
% 90.18/90.47 % --dbg_dump_prop_clauses_file -
% 90.18/90.47 % --dbg_out_stat false
% 90.18/90.47
% 90.18/90.47 % ------ General Options
% 90.18/90.47
% 90.18/90.47 % --fof false
% 90.18/90.47 % --time_out_real 150.
% 90.18/90.47 % --time_out_prep_mult 0.2
% 90.18/90.47 % --time_out_virtual -1.
% 90.18/90.47 % --schedule none
% 90.18/90.47 % --ground_splitting input
% 90.18/90.47 % --splitting_nvd 16
% 90.18/90.47 % --non_eq_to_eq false
% 90.18/90.47 % --prep_gs_sim true
% 90.18/90.47 % --prep_unflatten false
% 90.18/90.47 % --prep_res_sim true
% 90.18/90.47 % --prep_upred true
% 90.18/90.47 % --res_sim_input true
% 90.18/90.47 % --clause_weak_htbl true
% 90.18/90.47 % --gc_record_bc_elim false
% 90.18/90.47 % --symbol_type_check false
% 90.18/90.47 % --clausify_out false
% 90.18/90.47 % --large_theory_mode false
% 90.18/90.47 % --prep_sem_filter none
% 90.18/90.47 % --prep_sem_filter_out false
% 90.18/90.47 % --preprocessed_out false
% 90.18/90.47 % --sub_typing false
% 90.18/90.47 % --brand_transform false
% 90.18/90.47 % --pure_diseq_elim true
% 90.18/90.47 % --min_unsat_core false
% 90.18/90.47 % --pred_elim true
% 90.18/90.47 % --add_important_lit false
% 90.18/90.47 % --soft_assumptions false
% 90.18/90.47 % --reset_solvers false
% 90.18/90.47 % --bc_imp_inh []
% 90.18/90.47 % --conj_cone_tolerance 1.5
% 90.18/90.47 % --prolific_symb_bound 500
% 90.18/90.47 % --lt_threshold 2000
% 90.18/90.47
% 90.18/90.47 % ------ SAT Options
% 90.18/90.47
% 90.18/90.47 % --sat_mode false
% 90.18/90.47 % --sat_fm_restart_options ""
% 90.18/90.47 % --sat_gr_def false
% 90.18/90.47 % --sat_epr_types true
% 90.18/90.47 % --sat_non_cyclic_types false
% 90.18/90.47 % --sat_finite_models false
% 90.18/90.47 % --sat_fm_lemmas false
% 90.18/90.47 % --sat_fm_prep false
% 90.18/90.47 % --sat_fm_uc_incr true
% 90.18/90.47 % --sat_out_model small
% 90.18/90.47 % --sat_out_clauses false
% 90.18/90.47
% 90.18/90.47 % ------ QBF Options
% 90.18/90.47
% 90.18/90.47 % --qbf_mode false
% 90.18/90.47 % --qbf_elim_univ true
% 90.18/90.47 % --qbf_sk_in true
% 90.18/90.47 % --qbf_pred_elim true
% 90.18/90.47 % --qbf_split 32
% 90.18/90.47
% 90.18/90.47 % ------ BMC1 Options
% 90.18/90.47
% 90.18/90.47 % --bmc1_incremental false
% 90.18/90.47 % --bmc1_axioms reachable_all
% 90.18/90.47 % --bmc1_min_bound 0
% 90.18/90.47 % --bmc1_max_bound -1
% 90.18/90.47 % --bmc1_max_bound_default -1
% 90.18/90.47 % --bmc1_symbol_reachability true
% 90.18/90.47 % --bmc1_property_lemmas false
% 90.18/90.47 % --bmc1_k_induction false
% 90.18/90.47 % --bmc1_non_equiv_states false
% 90.18/90.47 % --bmc1_deadlock false
% 90.18/90.47 % --bmc1_ucm false
% 90.18/90.47 % --bmc1_add_unsat_core none
% 90.18/90.47 % --bmc1_unsat_core_children false
% 90.18/90.47 % --bmc1_unsat_core_extrapolate_axioms false
% 90.18/90.47 % --bmc1_out_stat full
% 90.18/90.47 % --bmc1_ground_init false
% 90.18/90.47 % --bmc1_pre_inst_next_state false
% 90.18/90.47 % --bmc1_pre_inst_state false
% 90.18/90.47 % --bmc1_pre_inst_reach_state false
% 90.18/90.47 % --bmc1_out_unsat_core false
% 90.18/90.47 % --bmc1_aig_witness_out false
% 90.18/90.47 % --bmc1_verbose false
% 90.18/90.47 % --bmc1_dump_clauses_tptp false
% 90.18/90.47 % --bmc1_dump_unsat_core_tptp false
% 90.18/90.47 % --bmc1_dump_file -
% 90.18/90.47 % --bmc1_ucm_expand_uc_limit 128
% 90.18/90.47 % --bmc1_ucm_n_expand_iterations 6
% 90.18/90.47 % --bmc1_ucm_extend_mode 1
% 90.18/90.47 % --bmc1_ucm_init_mode 2
% 90.18/90.47 % --bmc1_ucm_cone_mode none
% 90.18/90.47 % --bmc1_ucm_reduced_relation_type 0
% 90.18/90.47 % --bmc1_ucm_relax_model 4
% 90.18/90.47 % --bmc1_ucm_full_tr_after_sat true
% 90.18/90.47 % --bmc1_ucm_expand_neg_assumptions false
% 90.18/90.47 % --bmc1_ucm_layered_model none
% 90.18/90.47 % --bmc1_ucm_max_lemma_size 10
% 90.18/90.47
% 90.18/90.47 % ------ AIG Options
% 90.18/90.47
% 90.18/90.47 % --aig_mode false
% 90.18/90.47
% 90.18/90.47 % ------ Instantiation Options
% 90.18/90.47
% 90.18/90.47 % --instantiation_flag true
% 90.18/90.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 90.18/90.47 % --inst_solver_per_active 750
% 90.18/90.47 % --inst_solver_calls_frac 0.5
% 90.18/90.47 % --inst_passive_queue_type priority_queues
% 90.18/90.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 90.18/90.47 % --inst_passive_queues_freq [25;2]
% 90.18/90.47 % --inst_dismatching true
% 90.18/90.47 % --inst_eager_unprocessed_to_passive true
% 90.18/90.47 % --inst_prop_sim_given true
% 240.16/240.43 % --inst_prop_sim_new false
% 240.16/240.43 % --inst_orphan_elimination true
% 240.16/240.43 % --inst_learning_loop_flag true
% 240.16/240.43 % --inst_learning_start 3000
% 240.16/240.43 % --inst_learning_factor 2
% 240.16/240.43 % --inst_start_prop_sim_after_learn 3
% 240.16/240.43 % --inst_sel_renew solver
% 240.16/240.43 % --inst_lit_activity_flag true
% 240.16/240.43 % --inst_out_proof true
% 240.16/240.43
% 240.16/240.43 % ------ Resolution Options
% 240.16/240.43
% 240.16/240.43 % --resolution_flag true
% 240.16/240.43 % --res_lit_sel kbo_max
% 240.16/240.43 % --res_to_prop_solver none
% 240.16/240.43 % --res_prop_simpl_new false
% 240.16/240.43 % --res_prop_simpl_given false
% 240.16/240.43 % --res_passive_queue_type priority_queues
% 240.16/240.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 240.16/240.43 % --res_passive_queues_freq [15;5]
% 240.16/240.43 % --res_forward_subs full
% 240.16/240.43 % --res_backward_subs full
% 240.16/240.43 % --res_forward_subs_resolution true
% 240.16/240.43 % --res_backward_subs_resolution true
% 240.16/240.43 % --res_orphan_elimination false
% 240.16/240.43 % --res_time_limit 1000.
% 240.16/240.43 % --res_out_proof true
% 240.16/240.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_42637f.s
% 240.16/240.43 % --modulo true
% 240.16/240.43
% 240.16/240.43 % ------ Combination Options
% 240.16/240.43
% 240.16/240.43 % --comb_res_mult 1000
% 240.16/240.43 % --comb_inst_mult 300
% 240.16/240.43 % ------
% 240.16/240.43
% 240.16/240.43
% 240.16/240.43
% 240.16/240.43 % ------ Proving...
% 240.16/240.43 %
% 240.16/240.43
% 240.16/240.43
% 240.16/240.43 % Time Out Real
% 240.16/240.43
% 240.16/240.43 % ------ Statistics
% 240.16/240.43
% 240.16/240.43 % ------ General
% 240.16/240.43
% 240.16/240.43 % num_of_input_clauses: 341
% 240.16/240.43 % num_of_input_neg_conjectures: 5
% 240.16/240.43 % num_of_splits: 0
% 240.16/240.43 % num_of_split_atoms: 0
% 240.16/240.43 % num_of_sem_filtered_clauses: 0
% 240.16/240.43 % num_of_subtypes: 0
% 240.16/240.43 % monotx_restored_types: 0
% 240.16/240.43 % sat_num_of_epr_types: 0
% 240.16/240.43 % sat_num_of_non_cyclic_types: 0
% 240.16/240.43 % sat_guarded_non_collapsed_types: 0
% 240.16/240.43 % is_epr: 0
% 240.16/240.43 % is_horn: 0
% 240.16/240.43 % has_eq: 0
% 240.16/240.43 % num_pure_diseq_elim: 0
% 240.16/240.43 % simp_replaced_by: 0
% 240.16/240.43 % res_preprocessed: 10
% 240.16/240.43 % prep_upred: 0
% 240.16/240.43 % prep_unflattend: 0
% 240.16/240.43 % pred_elim_cands: 0
% 240.16/240.43 % pred_elim: 0
% 240.16/240.43 % pred_elim_cl: 0
% 240.16/240.43 % pred_elim_cycles: 0
% 240.16/240.43 % forced_gc_time: 0
% 240.16/240.43 % gc_basic_clause_elim: 0
% 240.16/240.43 % parsing_time: 0.017
% 240.16/240.43 % sem_filter_time: 0.
% 240.16/240.43 % pred_elim_time: 0.
% 240.16/240.43 % out_proof_time: 0.
% 240.16/240.43 % monotx_time: 0.
% 240.16/240.43 % subtype_inf_time: 0.
% 240.16/240.43 % unif_index_cands_time: 0.009
% 240.16/240.43 % unif_index_add_time: 0.013
% 240.16/240.43 % total_time: 150.017
% 240.16/240.43 % num_of_symbols: 86
% 240.16/240.43 % num_of_terms: 44597
% 240.16/240.43
% 240.16/240.43 % ------ Propositional Solver
% 240.16/240.43
% 240.16/240.43 % prop_solver_calls: 2
% 240.16/240.43 % prop_fast_solver_calls: 21
% 240.16/240.43 % prop_num_of_clauses: 409
% 240.16/240.43 % prop_preprocess_simplified: 1796
% 240.16/240.43 % prop_fo_subsumed: 0
% 240.16/240.43 % prop_solver_time: 0.
% 240.16/240.43 % prop_fast_solver_time: 0.
% 240.16/240.43 % prop_unsat_core_time: 0.
% 240.16/240.43
% 240.16/240.43 % ------ QBF
% 240.16/240.43
% 240.16/240.43 % qbf_q_res: 0
% 240.16/240.43 % qbf_num_tautologies: 0
% 240.16/240.43 % qbf_prep_cycles: 0
% 240.16/240.43
% 240.16/240.43 % ------ BMC1
% 240.16/240.43
% 240.16/240.43 % bmc1_current_bound: -1
% 240.16/240.43 % bmc1_last_solved_bound: -1
% 240.16/240.43 % bmc1_unsat_core_size: -1
% 240.16/240.43 % bmc1_unsat_core_parents_size: -1
% 240.16/240.43 % bmc1_merge_next_fun: 0
% 240.16/240.43 % bmc1_unsat_core_clauses_time: 0.
% 240.16/240.43
% 240.16/240.43 % ------ Instantiation
% 240.16/240.43
% 240.16/240.43 % inst_num_of_clauses: 401
% 240.16/240.43 % inst_num_in_passive: 42
% 240.16/240.43 % inst_num_in_active: 299
% 240.16/240.43 % inst_num_in_unprocessed: 60
% 240.16/240.43 % inst_num_of_loops: 300
% 240.16/240.44 % inst_num_of_learning_restarts: 0
% 240.16/240.44 % inst_num_moves_active_passive: 0
% 240.16/240.44 % inst_lit_activity: 85
% 240.16/240.44 % inst_lit_activity_moves: 0
% 240.16/240.44 % inst_num_tautologies: 0
% 240.16/240.44 % inst_num_prop_implied: 0
% 240.16/240.44 % inst_num_existing_simplified: 0
% 240.16/240.44 % inst_num_eq_res_simplified: 0
% 240.16/240.44 % inst_num_child_elim: 0
% 240.16/240.44 % inst_num_of_dismatching_blockings: 0
% 240.16/240.44 % inst_num_of_non_proper_insts: 81
% 240.16/240.44 % inst_num_of_duplicates: 167
% 240.16/240.44 % inst_inst_num_from_inst_to_res: 0
% 240.16/240.44 % inst_dismatching_checking_time: 0.
% 240.16/240.44
% 240.16/240.44 % ------ Resolution
% 240.16/240.44
% 240.16/240.44 % res_num_of_clauses: 2361
% 240.16/240.44 % res_num_in_passive: 903
% 240.16/240.44 % res_num_in_active: 1202
% 240.16/240.44 % res_num_of_loops: 1297
% 240.16/240.44 % res_forward_subset_subsumed: 312
% 240.16/240.44 % res_backward_subset_subsumed: 0
% 240.16/240.44 % res_forward_subsumed: 208
% 240.16/240.44 % res_backward_subsumed: 6
% 240.16/240.44 % res_forward_subsumption_resolution: 527
% 240.16/240.44 % res_backward_subsumption_resolution: 0
% 240.16/240.44 % res_clause_to_clause_subsumption: 180261
% 240.16/240.44 % res_orphan_elimination: 0
% 240.16/240.44 % res_tautology_del: 104
% 240.16/240.44 % res_num_eq_res_simplified: 0
% 240.16/240.44 % res_num_sel_changes: 0
% 240.16/240.44 % res_moves_from_active_to_pass: 0
% 240.16/240.44
% 240.16/240.44 % Status Unknown
% 240.16/240.44 % Last status :
% 240.16/240.44 % SZS status Unknown
%------------------------------------------------------------------------------