TSTP Solution File: MGT062+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT062+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n024.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 : Sun Jul 17 22:14:06 EDT 2022
% Result : Unknown 0.96s 1.22s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT062+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 09:26:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.18/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.18/0.39 % FOF problem with conjecture
% 0.18/0.39 % 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_a0252d.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_35e2ed.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_fba5d4 | grep -v "SZS"
% 0.18/0.41
% 0.18/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.18/0.41
% 0.18/0.41 %
% 0.18/0.41 % ------ iProver source info
% 0.18/0.41
% 0.18/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.18/0.41 % git: non_committed_changes: true
% 0.18/0.41 % git: last_make_outside_of_git: true
% 0.18/0.41
% 0.18/0.41 %
% 0.18/0.41 % ------ Input Options
% 0.18/0.41
% 0.18/0.41 % --out_options all
% 0.18/0.41 % --tptp_safe_out true
% 0.18/0.41 % --problem_path ""
% 0.18/0.41 % --include_path ""
% 0.18/0.41 % --clausifier .//eprover
% 0.18/0.41 % --clausifier_options --tstp-format
% 0.18/0.41 % --stdin false
% 0.18/0.41 % --dbg_backtrace false
% 0.18/0.41 % --dbg_dump_prop_clauses false
% 0.18/0.41 % --dbg_dump_prop_clauses_file -
% 0.18/0.41 % --dbg_out_stat false
% 0.18/0.41
% 0.18/0.41 % ------ General Options
% 0.18/0.41
% 0.18/0.41 % --fof false
% 0.18/0.41 % --time_out_real 150.
% 0.18/0.41 % --time_out_prep_mult 0.2
% 0.18/0.41 % --time_out_virtual -1.
% 0.18/0.41 % --schedule none
% 0.18/0.41 % --ground_splitting input
% 0.18/0.41 % --splitting_nvd 16
% 0.18/0.41 % --non_eq_to_eq false
% 0.18/0.41 % --prep_gs_sim true
% 0.18/0.41 % --prep_unflatten false
% 0.18/0.41 % --prep_res_sim true
% 0.18/0.41 % --prep_upred true
% 0.18/0.41 % --res_sim_input true
% 0.18/0.41 % --clause_weak_htbl true
% 0.18/0.41 % --gc_record_bc_elim false
% 0.18/0.41 % --symbol_type_check false
% 0.18/0.41 % --clausify_out false
% 0.18/0.41 % --large_theory_mode false
% 0.18/0.41 % --prep_sem_filter none
% 0.18/0.41 % --prep_sem_filter_out false
% 0.18/0.41 % --preprocessed_out false
% 0.18/0.41 % --sub_typing false
% 0.18/0.41 % --brand_transform false
% 0.18/0.41 % --pure_diseq_elim true
% 0.18/0.41 % --min_unsat_core false
% 0.18/0.41 % --pred_elim true
% 0.18/0.41 % --add_important_lit false
% 0.18/0.41 % --soft_assumptions false
% 0.18/0.41 % --reset_solvers false
% 0.18/0.41 % --bc_imp_inh []
% 0.18/0.41 % --conj_cone_tolerance 1.5
% 0.18/0.41 % --prolific_symb_bound 500
% 0.18/0.41 % --lt_threshold 2000
% 0.18/0.41
% 0.18/0.41 % ------ SAT Options
% 0.18/0.41
% 0.18/0.41 % --sat_mode false
% 0.18/0.41 % --sat_fm_restart_options ""
% 0.18/0.41 % --sat_gr_def false
% 0.18/0.41 % --sat_epr_types true
% 0.18/0.41 % --sat_non_cyclic_types false
% 0.18/0.41 % --sat_finite_models false
% 0.18/0.41 % --sat_fm_lemmas false
% 0.18/0.41 % --sat_fm_prep false
% 0.18/0.41 % --sat_fm_uc_incr true
% 0.18/0.41 % --sat_out_model small
% 0.18/0.41 % --sat_out_clauses false
% 0.18/0.41
% 0.18/0.41 % ------ QBF Options
% 0.18/0.41
% 0.18/0.41 % --qbf_mode false
% 0.18/0.41 % --qbf_elim_univ true
% 0.18/0.41 % --qbf_sk_in true
% 0.18/0.41 % --qbf_pred_elim true
% 0.18/0.41 % --qbf_split 32
% 0.18/0.41
% 0.18/0.41 % ------ BMC1 Options
% 0.18/0.41
% 0.18/0.41 % --bmc1_incremental false
% 0.18/0.41 % --bmc1_axioms reachable_all
% 0.18/0.41 % --bmc1_min_bound 0
% 0.18/0.41 % --bmc1_max_bound -1
% 0.18/0.41 % --bmc1_max_bound_default -1
% 0.18/0.41 % --bmc1_symbol_reachability true
% 0.18/0.41 % --bmc1_property_lemmas false
% 0.18/0.41 % --bmc1_k_induction false
% 0.18/0.41 % --bmc1_non_equiv_states false
% 0.18/0.41 % --bmc1_deadlock false
% 0.18/0.41 % --bmc1_ucm false
% 0.18/0.41 % --bmc1_add_unsat_core none
% 0.18/0.41 % --bmc1_unsat_core_children false
% 0.18/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.41 % --bmc1_out_stat full
% 0.18/0.41 % --bmc1_ground_init false
% 0.18/0.41 % --bmc1_pre_inst_next_state false
% 0.18/0.41 % --bmc1_pre_inst_state false
% 0.18/0.41 % --bmc1_pre_inst_reach_state false
% 0.18/0.41 % --bmc1_out_unsat_core false
% 0.18/0.41 % --bmc1_aig_witness_out false
% 0.18/0.41 % --bmc1_verbose false
% 0.18/0.41 % --bmc1_dump_clauses_tptp false
% 0.18/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.42 % --bmc1_dump_file -
% 0.18/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.42 % --bmc1_ucm_extend_mode 1
% 0.18/0.42 % --bmc1_ucm_init_mode 2
% 0.18/0.42 % --bmc1_ucm_cone_mode none
% 0.18/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.42 % --bmc1_ucm_relax_model 4
% 0.18/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.42 % --bmc1_ucm_layered_model none
% 0.18/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.42
% 0.18/0.42 % ------ AIG Options
% 0.18/0.42
% 0.18/0.42 % --aig_mode false
% 0.18/0.42
% 0.18/0.42 % ------ Instantiation Options
% 0.18/0.42
% 0.18/0.42 % --instantiation_flag true
% 0.18/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.42 % --inst_solver_per_active 750
% 0.18/0.42 % --inst_solver_calls_frac 0.5
% 0.18/0.42 % --inst_passive_queue_type priority_queues
% 0.18/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.42 % --inst_passive_queues_freq [25;2]
% 0.18/0.42 % --inst_dismatching true
% 0.18/0.42 % --inst_eager_unprocessed_to_passive true
% 0.18/0.42 % --inst_prop_sim_given true
% 0.18/0.42 % --inst_prop_sim_new false
% 0.18/0.42 % --inst_orphan_elimination true
% 0.18/0.42 % --inst_learning_loop_flag true
% 0.18/0.42 % --inst_learning_start 3000
% 0.18/0.42 % --inst_learning_factor 2
% 0.18/0.42 % --inst_start_prop_sim_after_learn 3
% 0.18/0.42 % --inst_sel_renew solver
% 0.18/0.42 % --inst_lit_activity_flag true
% 0.18/0.42 % --inst_out_proof true
% 0.18/0.42
% 0.18/0.42 % ------ Resolution Options
% 0.18/0.42
% 0.18/0.42 % --resolution_flag true
% 0.18/0.42 % --res_lit_sel kbo_max
% 0.18/0.42 % --res_to_prop_solver none
% 0.18/0.42 % --res_prop_simpl_new false
% 0.18/0.42 % --res_prop_simpl_given false
% 0.18/0.42 % --res_passive_queue_type priority_queues
% 0.18/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.42 % --res_passive_queues_freq [15;5]
% 0.18/0.42 % --res_forward_subs full
% 0.18/0.42 % --res_backward_subs full
% 0.18/0.42 % --res_forward_subs_resolution true
% 0.18/0.42 % --res_backward_subs_resolution true
% 0.18/0.42 % --res_orphan_elimination false
% 0.18/0.42 % --res_time_limit 1000.
% 0.18/0.42 % --res_out_proof true
% 0.18/0.42 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0252d.s
% 0.18/0.42 % --modulo true
% 0.18/0.42
% 0.18/0.42 % ------ Combination Options
% 0.18/0.42
% 0.18/0.42 % --comb_res_mult 1000
% 0.18/0.42 % --comb_inst_mult 300
% 0.18/0.42 % ------
% 0.18/0.42
% 0.18/0.42 % ------ Parsing...% successful
% 0.18/0.42
% 0.18/0.42 % ------ 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.18/0.42
% 0.18/0.42 % ------ Proving...
% 0.18/0.42 % ------ Problem Properties
% 0.18/0.42
% 0.18/0.42 %
% 0.18/0.42 % EPR false
% 0.18/0.42 % Horn false
% 0.18/0.42 % Has equality true
% 0.18/0.42
% 0.18/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 % % ------ Current options:
% 0.18/0.42
% 0.18/0.42 % ------ Input Options
% 0.18/0.42
% 0.18/0.42 % --out_options all
% 0.18/0.42 % --tptp_safe_out true
% 0.18/0.42 % --problem_path ""
% 0.18/0.42 % --include_path ""
% 0.18/0.42 % --clausifier .//eprover
% 0.18/0.42 % --clausifier_options --tstp-format
% 0.18/0.42 % --stdin false
% 0.18/0.42 % --dbg_backtrace false
% 0.18/0.42 % --dbg_dump_prop_clauses false
% 0.18/0.42 % --dbg_dump_prop_clauses_file -
% 0.18/0.42 % --dbg_out_stat false
% 0.18/0.42
% 0.18/0.42 % ------ General Options
% 0.18/0.42
% 0.18/0.42 % --fof false
% 0.18/0.42 % --time_out_real 150.
% 0.18/0.42 % --time_out_prep_mult 0.2
% 0.18/0.42 % --time_out_virtual -1.
% 0.18/0.42 % --schedule none
% 0.18/0.42 % --ground_splitting input
% 0.18/0.42 % --splitting_nvd 16
% 0.18/0.42 % --non_eq_to_eq false
% 0.18/0.42 % --prep_gs_sim true
% 0.18/0.42 % --prep_unflatten false
% 0.18/0.42 % --prep_res_sim true
% 0.18/0.42 % --prep_upred true
% 0.18/0.42 % --res_sim_input true
% 0.18/0.42 % --clause_weak_htbl true
% 0.18/0.42 % --gc_record_bc_elim false
% 0.18/0.42 % --symbol_type_check false
% 0.18/0.42 % --clausify_out false
% 0.18/0.42 % --large_theory_mode false
% 0.18/0.42 % --prep_sem_filter none
% 0.18/0.42 % --prep_sem_filter_out false
% 0.18/0.42 % --preprocessed_out false
% 0.18/0.42 % --sub_typing false
% 0.18/0.42 % --brand_transform false
% 0.18/0.42 % --pure_diseq_elim true
% 0.18/0.42 % --min_unsat_core false
% 0.18/0.42 % --pred_elim true
% 0.18/0.42 % --add_important_lit false
% 0.18/0.42 % --soft_assumptions false
% 0.18/0.42 % --reset_solvers false
% 0.18/0.42 % --bc_imp_inh []
% 0.18/0.42 % --conj_cone_tolerance 1.5
% 0.18/0.42 % --prolific_symb_bound 500
% 0.18/0.42 % --lt_threshold 2000
% 0.18/0.42
% 0.18/0.42 % ------ SAT Options
% 0.18/0.42
% 0.18/0.42 % --sat_mode false
% 0.18/0.42 % --sat_fm_restart_options ""
% 0.18/0.42 % --sat_gr_def false
% 0.18/0.42 % --sat_epr_types true
% 0.18/0.42 % --sat_non_cyclic_types false
% 0.18/0.42 % --sat_finite_models false
% 0.18/0.42 % --sat_fm_lemmas false
% 0.18/0.42 % --sat_fm_prep false
% 0.18/0.42 % --sat_fm_uc_incr true
% 0.18/0.42 % --sat_out_model small
% 0.18/0.42 % --sat_out_clauses false
% 0.18/0.42
% 0.18/0.42 % ------ QBF Options
% 0.18/0.42
% 0.18/0.42 % --qbf_mode false
% 0.18/0.42 % --qbf_elim_univ true
% 0.18/0.42 % --qbf_sk_in true
% 0.18/0.42 % --qbf_pred_elim true
% 0.18/0.42 % --qbf_split 32
% 0.18/0.42
% 0.18/0.42 % ------ BMC1 Options
% 0.18/0.42
% 0.18/0.42 % --bmc1_incremental false
% 0.18/0.42 % --bmc1_axioms reachable_all
% 0.18/0.42 % --bmc1_min_bound 0
% 0.18/0.42 % --bmc1_max_bound -1
% 0.18/0.42 % --bmc1_max_bound_default -1
% 0.18/0.42 % --bmc1_symbol_reachability true
% 0.18/0.42 % --bmc1_property_lemmas false
% 0.18/0.42 % --bmc1_k_induction false
% 0.18/0.42 % --bmc1_non_equiv_states false
% 0.18/0.42 % --bmc1_deadlock false
% 0.18/0.42 % --bmc1_ucm false
% 0.18/0.42 % --bmc1_add_unsat_core none
% 0.18/0.42 % --bmc1_unsat_core_children false
% 0.18/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.42 % --bmc1_out_stat full
% 0.18/0.42 % --bmc1_ground_init false
% 0.18/0.42 % --bmc1_pre_inst_next_state false
% 0.18/0.42 % --bmc1_pre_inst_state false
% 0.18/0.42 % --bmc1_pre_inst_reach_state false
% 0.18/0.42 % --bmc1_out_unsat_core false
% 0.18/0.42 % --bmc1_aig_witness_out false
% 0.18/0.42 % --bmc1_verbose false
% 0.18/0.42 % --bmc1_dump_clauses_tptp false
% 0.18/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.42 % --bmc1_dump_file -
% 0.18/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.42 % --bmc1_ucm_extend_mode 1
% 0.18/0.42 % --bmc1_ucm_init_mode 2
% 0.18/0.42 % --bmc1_ucm_cone_mode none
% 0.18/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.42 % --bmc1_ucm_relax_model 4
% 0.18/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.42 % --bmc1_ucm_layered_model none
% 0.18/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.42
% 0.18/0.42 % ------ AIG Options
% 0.18/0.42
% 0.18/0.42 % --aig_mode false
% 0.18/0.42
% 0.18/0.42 % ------ Instantiation Options
% 0.18/0.42
% 0.18/0.42 % --instantiation_flag true
% 0.18/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.42 % --inst_solver_per_active 750
% 0.18/0.42 % --inst_solver_calls_frac 0.5
% 0.18/0.42 % --inst_passive_queue_type priority_queues
% 0.18/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.42 % --inst_passive_queues_freq [25;2]
% 0.18/0.42 % --inst_dismatching true
% 0.18/0.42 % --inst_eager_unprocessed_to_passive true
% 0.18/0.42 % --inst_prop_sim_given true
% 0.74/0.94 % --inst_prop_sim_new false
% 0.74/0.94 % --inst_orphan_elimination true
% 0.74/0.94 % --inst_learning_loop_flag true
% 0.74/0.94 % --inst_learning_start 3000
% 0.74/0.94 % --inst_learning_factor 2
% 0.74/0.94 % --inst_start_prop_sim_after_learn 3
% 0.74/0.94 % --inst_sel_renew solver
% 0.74/0.94 % --inst_lit_activity_flag true
% 0.74/0.94 % --inst_out_proof true
% 0.74/0.94
% 0.74/0.94 % ------ Resolution Options
% 0.74/0.94
% 0.74/0.94 % --resolution_flag true
% 0.74/0.94 % --res_lit_sel kbo_max
% 0.74/0.94 % --res_to_prop_solver none
% 0.74/0.94 % --res_prop_simpl_new false
% 0.74/0.94 % --res_prop_simpl_given false
% 0.74/0.94 % --res_passive_queue_type priority_queues
% 0.74/0.94 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.74/0.94 % --res_passive_queues_freq [15;5]
% 0.74/0.94 % --res_forward_subs full
% 0.74/0.94 % --res_backward_subs full
% 0.74/0.94 % --res_forward_subs_resolution true
% 0.74/0.94 % --res_backward_subs_resolution true
% 0.74/0.94 % --res_orphan_elimination false
% 0.74/0.94 % --res_time_limit 1000.
% 0.74/0.94 % --res_out_proof true
% 0.74/0.94 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0252d.s
% 0.74/0.94 % --modulo true
% 0.74/0.94
% 0.74/0.94 % ------ Combination Options
% 0.74/0.94
% 0.74/0.94 % --comb_res_mult 1000
% 0.74/0.94 % --comb_inst_mult 300
% 0.74/0.94 % ------
% 0.74/0.94
% 0.74/0.94
% 0.74/0.94
% 0.74/0.94 % ------ Proving...
% 0.74/0.94 % warning: shown sat in sat incomplete mode
% 0.74/0.94 %
% 0.74/0.94
% 0.74/0.94
% 0.74/0.94 ------ Building Model...Done
% 0.74/0.94
% 0.74/0.94 %------ The model is defined over ground terms (initial term algebra).
% 0.74/0.94 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 0.74/0.94 %------ where \phi is a formula over the term algebra.
% 0.74/0.94 %------ If we have equality in the problem then it is also defined as a predicate above,
% 0.74/0.94 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 0.74/0.94 %------ See help for --sat_out_model for different model outputs.
% 0.74/0.94 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 0.74/0.94 %------ where the first argument stands for the sort ($i in the unsorted case)
% 0.74/0.94
% 0.74/0.94
% 0.74/0.94
% 0.74/0.94
% 0.74/0.94 %------ Negative definition of equality_sorted
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0,X0,X1] :
% 0.74/0.94 ( ~(equality_sorted(X0,X0,X1)) <=>
% 0.74/0.94 (
% 0.74/0.94 (
% 0.74/0.94 ( X0=$i & X0=age(sk3_esk1_0,sk3_esk4_0) & X1=zero )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 ? [X2] :
% 0.74/0.94 (
% 0.74/0.94 ( X0=$i & X0=age(sk3_esk1_0,X2) & X1=zero )
% 0.74/0.94 &
% 0.74/0.94 ( X2!=sk3_esk2_0 )
% 0.74/0.94 &
% 0.74/0.94 ( X2!=sk3_esk4_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Positive definition of greater
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0,X1] :
% 0.74/0.94 ( greater(X0,X1) <=>
% 0.74/0.94 (
% 0.74/0.94 (
% 0.74/0.94 ( X0=sigma & X1=zero )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=mod2 & X1=mod1 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=tau & X1=zero )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=age(sk3_esk1_0,sk3_esk4_0) )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=zero )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=tau )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=age(sk3_esk1_0,sk3_esk4_0) )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=age(sk3_esk1_0,X1) )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=age(sk3_esk1_0,sk3_esk4_0) & X1=zero )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=age(sk3_esk1_0,sk3_esk4_0) & X1=sigma )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 ? [X2] :
% 0.74/0.94 (
% 0.74/0.94 ( X0=age(sk3_esk1_0,X2) )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=zero )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=sigma )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=sigma | X2!=sk3_esk2_0 )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=tau )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=tau | X2!=sk3_esk4_0 )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=age(sk3_esk1_0,sk3_esk4_0) )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=age(sk3_esk1_0,sk3_esk4_0) | X2!=sk3_esk4_0 )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=age(sk3_esk1_0,X1) )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=age(sk3_esk1_0,X2) | X2!=sk3_esk4_0 )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=age(sk3_esk1_0,X3) | X2!=sk3_esk4_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 ? [X2] :
% 0.74/0.94 (
% 0.74/0.94 ( X0=age(sk3_esk1_0,X2) & X1=zero )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 ? [X2] :
% 0.74/0.94 (
% 0.74/0.94 ( X0=age(sk3_esk1_0,X2) & X1=sigma )
% 0.74/0.94 &
% 0.74/0.94 ( X2!=sk3_esk2_0 )
% 0.74/0.94 &
% 0.74/0.94 ( X2!=sk3_esk4_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Positive definition of organization
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0] :
% 0.74/0.94 ( organization(X0) <=>
% 0.74/0.94 (
% 0.74/0.94 (
% 0.74/0.94 ( X0=sk3_esk1_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Positive definition of dissimilar
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0,X1,X2] :
% 0.74/0.94 ( dissimilar(X0,X1,X2) <=>
% 0.74/0.94 (
% 0.74/0.94 (
% 0.74/0.94 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 0.74/0.94 &
% 0.74/0.94 ( X2!=sk3_esk2_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 & X2=sk3_esk4_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=sk3_esk1_0 & X2=sk3_esk2_0 )
% 0.74/0.94 &
% 0.74/0.94 ( X1!=sk3_esk2_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Positive definition of smaller
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0,X1] :
% 0.74/0.94 ( smaller(X0,X1) <=>
% 0.74/0.94 (
% 0.74/0.94 (
% 0.74/0.94 ( X0=zero & X1=sigma )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=zero & X1=tau )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=zero & X1=age(sk3_esk1_0,sk3_esk4_0) )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 ? [X2] :
% 0.74/0.94 (
% 0.74/0.94 ( X0=zero & X1=age(sk3_esk1_0,X2) )
% 0.74/0.94 &
% 0.74/0.94 ( X2!=sk3_esk4_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=sigma & X1=age(sk3_esk1_0,sk3_esk4_0) )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 ? [X2] :
% 0.74/0.94 (
% 0.74/0.94 ( X0=sigma & X1=age(sk3_esk1_0,X2) )
% 0.74/0.94 &
% 0.74/0.94 ( X2!=sk3_esk2_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=mod1 & X1=mod2 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X1=age(sk3_esk1_0,sk3_esk4_0) )
% 0.74/0.94 &
% 0.74/0.94 ( X0!=tau )
% 0.74/0.94 &
% 0.74/0.94 ( X0!=age(sk3_esk1_0,sk3_esk4_0) )
% 0.74/0.94 &
% 0.74/0.94 ( X0!=age(sk3_esk1_0,X0) )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 ? [X2] :
% 0.74/0.94 (
% 0.74/0.94 ( X1=age(sk3_esk1_0,X2) )
% 0.74/0.94 &
% 0.74/0.94 ( X0!=sigma | X2!=sk3_esk2_0 )
% 0.74/0.94 &
% 0.74/0.94 ( X0!=tau )
% 0.74/0.94 &
% 0.74/0.94 ( X0!=tau | X2!=sk3_esk4_0 )
% 0.74/0.94 &
% 0.74/0.94 ( X0!=age(sk3_esk1_0,sk3_esk4_0) )
% 0.74/0.94 &
% 0.74/0.94 ( X0!=age(sk3_esk1_0,sk3_esk4_0) | X2!=sk3_esk4_0 )
% 0.74/0.94 &
% 0.74/0.94 ( X0!=age(sk3_esk1_0,X0) )
% 0.74/0.94 &
% 0.74/0.94 ( X0!=age(sk3_esk1_0,X2) | X2!=sk3_esk4_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Positive definition of smaller_or_equal
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0,X1] :
% 0.74/0.94 ( smaller_or_equal(X0,X1) <=>
% 0.74/0.94 (
% 0.74/0.94 (
% 0.74/0.94 ( X0!=age(sk3_esk1_0,X0) | X1!=zero )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=age(sk3_esk1_0,sk3_esk3_0) & X1=sigma )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 |
% 0.74/0.94 (
% 0.74/0.94 ( X0=age(sk3_esk1_0,sk3_esk2_0) & X1=zero )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Negative definition of greater_or_equal
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0,X1] :
% 0.74/0.94 ( ~(greater_or_equal(X0,X1)) <=>
% 0.74/0.94 $false
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Positive definition of has_immunity
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0,X1] :
% 0.74/0.94 ( has_immunity(X0,X1) <=>
% 0.74/0.94 $false
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Positive definition of has_endowment
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0] :
% 0.74/0.94 ( has_endowment(X0) <=>
% 0.74/0.94 $false
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Negative definition of epred1_2
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0,X1] :
% 0.74/0.94 ( ~(epred1_2(X0,X1)) <=>
% 0.74/0.94 (
% 0.74/0.94 (
% 0.74/0.94 ( X0!=sk3_esk1_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Positive definition of is_aligned
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0,X1] :
% 0.74/0.94 ( is_aligned(X0,X1) <=>
% 0.74/0.94 (
% 0.74/0.94 (
% 0.74/0.94 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 0.74/0.94 )
% 0.74/0.94
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Negative definition of robust_position
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0] :
% 0.74/0.94 ( ~(robust_position(X0)) <=>
% 0.74/0.94 $false
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94 %------ Positive definition of positional_advantage
% 0.74/0.94 fof(lit_def,axiom,
% 0.74/0.94 (! [X0,X1] :
% 0.74/0.94 ( positional_advantage(X0,X1) <=>
% 0.74/0.94 $false
% 0.74/0.94 )
% 0.74/0.94 )
% 0.74/0.94 ).
% 0.74/0.94
% 0.74/0.94
% 0.74/0.94
% 0.74/0.94 % ------ Statistics
% 0.74/0.94
% 0.74/0.94 % ------ General
% 0.74/0.94
% 0.74/0.94 % num_of_input_clauses: 52
% 0.74/0.94 % num_of_input_neg_conjectures: 10
% 0.74/0.94 % num_of_splits: 0
% 0.74/0.94 % num_of_split_atoms: 0
% 0.74/0.94 % num_of_sem_filtered_clauses: 0
% 0.74/0.94 % num_of_subtypes: 0
% 0.74/0.94 % monotx_restored_types: 0
% 0.74/0.94 % sat_num_of_epr_types: 0
% 0.74/0.94 % sat_num_of_non_cyclic_types: 0
% 0.74/0.94 % sat_guarded_non_collapsed_types: 0
% 0.74/0.94 % is_epr: 0
% 0.74/0.94 % is_horn: 0
% 0.74/0.94 % has_eq: 1
% 0.74/0.94 % num_pure_diseq_elim: 0
% 0.74/0.94 % simp_replaced_by: 0
% 0.74/0.94 % res_preprocessed: 20
% 0.74/0.94 % prep_upred: 0
% 0.74/0.94 % prep_unflattend: 0
% 0.74/0.94 % pred_elim_cands: 0
% 0.74/0.94 % pred_elim: 0
% 0.74/0.94 % pred_elim_cl: 0
% 0.74/0.94 % pred_elim_cycles: 0
% 0.74/0.94 % forced_gc_time: 0
% 0.74/0.94 % gc_basic_clause_elim: 0
% 0.74/0.94 % parsing_time: 0.002
% 0.74/0.94 % sem_filter_time: 0.
% 0.74/0.94 % pred_elim_time: 0.
% 0.74/0.94 % out_proof_time: 0.
% 0.74/0.94 % monotx_time: 0.
% 0.74/0.94 % subtype_inf_time: 0.
% 0.74/0.94 % unif_index_cands_time: 0.001
% 0.74/0.94 % unif_index_add_time: 0.001
% 0.74/0.94 % total_time: 0.548
% 0.74/0.94 % num_of_symbols: 53
% 0.74/0.94 % num_of_terms: 1354
% 0.74/0.94
% 0.74/0.94 % ------ Propositional Solver
% 0.74/0.94
% 0.74/0.94 % prop_solver_calls: 11
% 0.74/0.94 % prop_fast_solver_calls: 33
% 0.74/0.94 % prop_num_of_clauses: 266
% 0.74/0.94 % prop_preprocess_simplified: 573
% 0.74/0.94 % prop_fo_subsumed: 0
% 0.74/0.94 % prop_solver_time: 0.
% 0.74/0.94 % prop_fast_solver_time: 0.
% 0.74/0.94 % prop_unsat_core_time: 0.
% 0.74/0.94
% 0.74/0.94 % ------ QBF
% 0.74/0.94
% 0.74/0.94 % qbf_q_res: 0
% 0.74/0.94 % qbf_num_tautologies: 0
% 0.74/0.94 % qbf_prep_cycles: 0
% 0.74/0.94
% 0.74/0.94 % ------ BMC1
% 0.74/0.94
% 0.74/0.94 % bmc1_current_bound: -1
% 0.74/0.94 % bmc1_last_solved_bound: -1
% 0.74/0.94 % bmc1_unsat_core_size: -1
% 0.74/0.94 % bmc1_unsat_core_parents_size: -1
% 0.74/0.94 % bmc1_merge_next_fun: 0
% 0.74/0.94 % bmc1_unsat_core_clauses_time: 0.
% 0.74/0.94
% 0.74/0.94 % ------ Instantiation
% 0.74/0.94
% 0.74/0.94 % inst_num_of_clauses: 200
% 0.74/0.94 % inst_num_in_passive: 0
% 0.74/0.94 % inst_num_in_active: 196
% 0.74/0.94 % inst_num_in_unprocessed: 0
% 0.74/0.94 % inst_num_of_loops: 235
% 0.74/0.94 % inst_num_of_learning_restarts: 0
% 0.74/0.94 % inst_num_moves_active_passive: 26
% 0.74/0.94 % inst_lit_activity: 22
% 0.74/0.94 % inst_lit_activity_moves: 0
% 0.74/0.94 % inst_num_tautologies: 4
% 0.74/0.94 % inst_num_prop_implied: 0
% 0.74/0.94 % inst_num_existing_simplified: 0
% 0.74/0.94 % inst_num_eq_res_simplified: 0
% 0.74/0.94 % inst_num_child_elim: 0
% 0.74/0.94 % inst_num_of_dismatching_blockings: 28
% 0.74/0.94 % inst_num_of_non_proper_insts: 276
% 0.74/0.94 % inst_num_of_duplicates: 137
% 0.74/0.94 % inst_inst_num_from_inst_to_res: 0
% 0.74/0.94 % inst_dismatching_checking_time: 0.
% 0.74/0.94
% 0.74/0.94 % ------ Resolution
% 0.74/0.95
% 0.74/0.95 % res_num_of_clauses: 1297
% 0.74/0.95 % res_num_in_passive: 571
% 0.74/0.95 % res_num_in_active: 695
% 0.74/0.95 % res_num_of_loops: 1000
% 0.74/0.95 % res_forward_subset_subsumed: 646
% 0.74/0.95 % res_backward_subset_subsumed: 0
% 0.74/0.95 % res_forward_subsumed: 337
% 0.74/0.95 % res_backward_subsumed: 0
% 0.74/0.95 % res_forward_subsumption_resolution: 9
% 0.74/0.95 % res_backward_subsumption_resolution: 0
% 0.74/0.95 % res_clause_to_clause_subsumption: 46249
% 0.74/0.95 % res_orphan_elimination: 0
% 0.74/0.95 % res_tautology_del: 16
% 0.74/0.95 % res_num_eq_res_simplified: 0
% 0.74/0.95 % res_num_sel_changes: 0
% 0.74/0.95 % res_moves_from_active_to_pass: 0
% 0.74/0.95
% 0.74/0.95 % Status Unknown
% 0.78/0.99 % Orienting using strategy ClausalAll
% 0.78/0.99 % FOF problem with conjecture
% 0.78/0.99 % 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_a0252d.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_35e2ed.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_76e2ac | grep -v "SZS"
% 0.78/1.00
% 0.78/1.00 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.78/1.00
% 0.78/1.00 %
% 0.78/1.00 % ------ iProver source info
% 0.78/1.00
% 0.78/1.00 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.78/1.00 % git: non_committed_changes: true
% 0.78/1.00 % git: last_make_outside_of_git: true
% 0.78/1.00
% 0.78/1.00 %
% 0.78/1.00 % ------ Input Options
% 0.78/1.00
% 0.78/1.00 % --out_options all
% 0.78/1.00 % --tptp_safe_out true
% 0.78/1.00 % --problem_path ""
% 0.78/1.00 % --include_path ""
% 0.78/1.00 % --clausifier .//eprover
% 0.78/1.00 % --clausifier_options --tstp-format
% 0.78/1.00 % --stdin false
% 0.78/1.00 % --dbg_backtrace false
% 0.78/1.00 % --dbg_dump_prop_clauses false
% 0.78/1.00 % --dbg_dump_prop_clauses_file -
% 0.78/1.00 % --dbg_out_stat false
% 0.78/1.00
% 0.78/1.00 % ------ General Options
% 0.78/1.00
% 0.78/1.00 % --fof false
% 0.78/1.00 % --time_out_real 150.
% 0.78/1.00 % --time_out_prep_mult 0.2
% 0.78/1.00 % --time_out_virtual -1.
% 0.78/1.00 % --schedule none
% 0.78/1.00 % --ground_splitting input
% 0.78/1.00 % --splitting_nvd 16
% 0.78/1.00 % --non_eq_to_eq false
% 0.78/1.00 % --prep_gs_sim true
% 0.78/1.00 % --prep_unflatten false
% 0.78/1.00 % --prep_res_sim true
% 0.78/1.00 % --prep_upred true
% 0.78/1.00 % --res_sim_input true
% 0.78/1.00 % --clause_weak_htbl true
% 0.78/1.00 % --gc_record_bc_elim false
% 0.78/1.00 % --symbol_type_check false
% 0.78/1.00 % --clausify_out false
% 0.78/1.00 % --large_theory_mode false
% 0.78/1.00 % --prep_sem_filter none
% 0.78/1.00 % --prep_sem_filter_out false
% 0.78/1.00 % --preprocessed_out false
% 0.78/1.00 % --sub_typing false
% 0.78/1.00 % --brand_transform false
% 0.78/1.00 % --pure_diseq_elim true
% 0.78/1.00 % --min_unsat_core false
% 0.78/1.00 % --pred_elim true
% 0.78/1.00 % --add_important_lit false
% 0.78/1.00 % --soft_assumptions false
% 0.78/1.00 % --reset_solvers false
% 0.78/1.00 % --bc_imp_inh []
% 0.78/1.00 % --conj_cone_tolerance 1.5
% 0.78/1.00 % --prolific_symb_bound 500
% 0.78/1.00 % --lt_threshold 2000
% 0.78/1.00
% 0.78/1.00 % ------ SAT Options
% 0.78/1.00
% 0.78/1.00 % --sat_mode false
% 0.78/1.00 % --sat_fm_restart_options ""
% 0.78/1.00 % --sat_gr_def false
% 0.78/1.00 % --sat_epr_types true
% 0.78/1.00 % --sat_non_cyclic_types false
% 0.78/1.00 % --sat_finite_models false
% 0.78/1.00 % --sat_fm_lemmas false
% 0.78/1.00 % --sat_fm_prep false
% 0.78/1.00 % --sat_fm_uc_incr true
% 0.78/1.00 % --sat_out_model small
% 0.78/1.00 % --sat_out_clauses false
% 0.78/1.00
% 0.78/1.00 % ------ QBF Options
% 0.78/1.00
% 0.78/1.00 % --qbf_mode false
% 0.78/1.00 % --qbf_elim_univ true
% 0.78/1.00 % --qbf_sk_in true
% 0.78/1.00 % --qbf_pred_elim true
% 0.78/1.00 % --qbf_split 32
% 0.78/1.00
% 0.78/1.00 % ------ BMC1 Options
% 0.78/1.00
% 0.78/1.00 % --bmc1_incremental false
% 0.78/1.00 % --bmc1_axioms reachable_all
% 0.78/1.00 % --bmc1_min_bound 0
% 0.78/1.00 % --bmc1_max_bound -1
% 0.78/1.00 % --bmc1_max_bound_default -1
% 0.78/1.00 % --bmc1_symbol_reachability true
% 0.78/1.00 % --bmc1_property_lemmas false
% 0.78/1.00 % --bmc1_k_induction false
% 0.78/1.00 % --bmc1_non_equiv_states false
% 0.78/1.00 % --bmc1_deadlock false
% 0.78/1.00 % --bmc1_ucm false
% 0.78/1.00 % --bmc1_add_unsat_core none
% 0.78/1.00 % --bmc1_unsat_core_children false
% 0.78/1.00 % --bmc1_unsat_core_extrapolate_axioms false
% 0.78/1.00 % --bmc1_out_stat full
% 0.78/1.00 % --bmc1_ground_init false
% 0.78/1.00 % --bmc1_pre_inst_next_state false
% 0.78/1.00 % --bmc1_pre_inst_state false
% 0.78/1.00 % --bmc1_pre_inst_reach_state false
% 0.78/1.00 % --bmc1_out_unsat_core false
% 0.78/1.00 % --bmc1_aig_witness_out false
% 0.78/1.00 % --bmc1_verbose false
% 0.78/1.00 % --bmc1_dump_clauses_tptp false
% 0.78/1.01 % --bmc1_dump_unsat_core_tptp false
% 0.78/1.01 % --bmc1_dump_file -
% 0.78/1.01 % --bmc1_ucm_expand_uc_limit 128
% 0.78/1.01 % --bmc1_ucm_n_expand_iterations 6
% 0.78/1.01 % --bmc1_ucm_extend_mode 1
% 0.78/1.01 % --bmc1_ucm_init_mode 2
% 0.78/1.01 % --bmc1_ucm_cone_mode none
% 0.78/1.01 % --bmc1_ucm_reduced_relation_type 0
% 0.78/1.01 % --bmc1_ucm_relax_model 4
% 0.78/1.01 % --bmc1_ucm_full_tr_after_sat true
% 0.78/1.01 % --bmc1_ucm_expand_neg_assumptions false
% 0.78/1.01 % --bmc1_ucm_layered_model none
% 0.78/1.01 % --bmc1_ucm_max_lemma_size 10
% 0.78/1.01
% 0.78/1.01 % ------ AIG Options
% 0.78/1.01
% 0.78/1.01 % --aig_mode false
% 0.78/1.01
% 0.78/1.01 % ------ Instantiation Options
% 0.78/1.01
% 0.78/1.01 % --instantiation_flag true
% 0.78/1.01 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.78/1.01 % --inst_solver_per_active 750
% 0.78/1.01 % --inst_solver_calls_frac 0.5
% 0.78/1.01 % --inst_passive_queue_type priority_queues
% 0.78/1.01 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.78/1.01 % --inst_passive_queues_freq [25;2]
% 0.78/1.01 % --inst_dismatching true
% 0.78/1.01 % --inst_eager_unprocessed_to_passive true
% 0.78/1.01 % --inst_prop_sim_given true
% 0.78/1.01 % --inst_prop_sim_new false
% 0.78/1.01 % --inst_orphan_elimination true
% 0.78/1.01 % --inst_learning_loop_flag true
% 0.78/1.01 % --inst_learning_start 3000
% 0.78/1.01 % --inst_learning_factor 2
% 0.78/1.01 % --inst_start_prop_sim_after_learn 3
% 0.78/1.01 % --inst_sel_renew solver
% 0.78/1.01 % --inst_lit_activity_flag true
% 0.78/1.01 % --inst_out_proof true
% 0.78/1.01
% 0.78/1.01 % ------ Resolution Options
% 0.78/1.01
% 0.78/1.01 % --resolution_flag true
% 0.78/1.01 % --res_lit_sel kbo_max
% 0.78/1.01 % --res_to_prop_solver none
% 0.78/1.01 % --res_prop_simpl_new false
% 0.78/1.01 % --res_prop_simpl_given false
% 0.78/1.01 % --res_passive_queue_type priority_queues
% 0.78/1.01 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.78/1.01 % --res_passive_queues_freq [15;5]
% 0.78/1.01 % --res_forward_subs full
% 0.78/1.01 % --res_backward_subs full
% 0.78/1.01 % --res_forward_subs_resolution true
% 0.78/1.01 % --res_backward_subs_resolution true
% 0.78/1.01 % --res_orphan_elimination false
% 0.78/1.01 % --res_time_limit 1000.
% 0.78/1.01 % --res_out_proof true
% 0.78/1.01 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0252d.s
% 0.78/1.01 % --modulo true
% 0.78/1.01
% 0.78/1.01 % ------ Combination Options
% 0.78/1.01
% 0.78/1.01 % --comb_res_mult 1000
% 0.78/1.01 % --comb_inst_mult 300
% 0.78/1.01 % ------
% 0.78/1.01
% 0.78/1.01 % ------ Parsing...% successful
% 0.78/1.01
% 0.78/1.01 % ------ 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.78/1.01
% 0.78/1.01 % ------ Proving...
% 0.78/1.01 % ------ Problem Properties
% 0.78/1.01
% 0.78/1.01 %
% 0.78/1.01 % EPR false
% 0.78/1.01 % Horn false
% 0.78/1.01 % Has equality true
% 0.78/1.01
% 0.78/1.01 % % ------ Input Options Time Limit: Unbounded
% 0.78/1.01
% 0.78/1.01
% 0.78/1.01 % % ------ Current options:
% 0.78/1.01
% 0.78/1.01 % ------ Input Options
% 0.78/1.01
% 0.78/1.01 % --out_options all
% 0.78/1.01 % --tptp_safe_out true
% 0.78/1.01 % --problem_path ""
% 0.78/1.01 % --include_path ""
% 0.78/1.01 % --clausifier .//eprover
% 0.78/1.01 % --clausifier_options --tstp-format
% 0.78/1.01 % --stdin false
% 0.78/1.01 % --dbg_backtrace false
% 0.78/1.01 % --dbg_dump_prop_clauses false
% 0.78/1.01 % --dbg_dump_prop_clauses_file -
% 0.78/1.01 % --dbg_out_stat false
% 0.78/1.01
% 0.78/1.01 % ------ General Options
% 0.78/1.01
% 0.78/1.01 % --fof false
% 0.78/1.01 % --time_out_real 150.
% 0.78/1.01 % --time_out_prep_mult 0.2
% 0.78/1.01 % --time_out_virtual -1.
% 0.78/1.01 % --schedule none
% 0.78/1.01 % --ground_splitting input
% 0.78/1.01 % --splitting_nvd 16
% 0.78/1.01 % --non_eq_to_eq false
% 0.78/1.01 % --prep_gs_sim true
% 0.78/1.01 % --prep_unflatten false
% 0.78/1.01 % --prep_res_sim true
% 0.78/1.01 % --prep_upred true
% 0.78/1.01 % --res_sim_input true
% 0.78/1.01 % --clause_weak_htbl true
% 0.78/1.01 % --gc_record_bc_elim false
% 0.78/1.01 % --symbol_type_check false
% 0.78/1.01 % --clausify_out false
% 0.78/1.01 % --large_theory_mode false
% 0.78/1.01 % --prep_sem_filter none
% 0.78/1.01 % --prep_sem_filter_out false
% 0.78/1.01 % --preprocessed_out false
% 0.78/1.01 % --sub_typing false
% 0.78/1.01 % --brand_transform false
% 0.78/1.01 % --pure_diseq_elim true
% 0.78/1.01 % --min_unsat_core false
% 0.78/1.01 % --pred_elim true
% 0.78/1.01 % --add_important_lit false
% 0.78/1.01 % --soft_assumptions false
% 0.78/1.01 % --reset_solvers false
% 0.78/1.01 % --bc_imp_inh []
% 0.78/1.01 % --conj_cone_tolerance 1.5
% 0.78/1.01 % --prolific_symb_bound 500
% 0.78/1.01 % --lt_threshold 2000
% 0.78/1.01
% 0.78/1.01 % ------ SAT Options
% 0.78/1.01
% 0.78/1.01 % --sat_mode false
% 0.78/1.01 % --sat_fm_restart_options ""
% 0.78/1.01 % --sat_gr_def false
% 0.78/1.01 % --sat_epr_types true
% 0.78/1.01 % --sat_non_cyclic_types false
% 0.78/1.01 % --sat_finite_models false
% 0.78/1.01 % --sat_fm_lemmas false
% 0.78/1.01 % --sat_fm_prep false
% 0.78/1.01 % --sat_fm_uc_incr true
% 0.78/1.01 % --sat_out_model small
% 0.78/1.01 % --sat_out_clauses false
% 0.78/1.01
% 0.78/1.01 % ------ QBF Options
% 0.78/1.01
% 0.78/1.01 % --qbf_mode false
% 0.78/1.01 % --qbf_elim_univ true
% 0.78/1.01 % --qbf_sk_in true
% 0.78/1.01 % --qbf_pred_elim true
% 0.78/1.01 % --qbf_split 32
% 0.78/1.01
% 0.78/1.01 % ------ BMC1 Options
% 0.78/1.01
% 0.78/1.01 % --bmc1_incremental false
% 0.78/1.01 % --bmc1_axioms reachable_all
% 0.78/1.01 % --bmc1_min_bound 0
% 0.78/1.01 % --bmc1_max_bound -1
% 0.78/1.01 % --bmc1_max_bound_default -1
% 0.78/1.01 % --bmc1_symbol_reachability true
% 0.78/1.01 % --bmc1_property_lemmas false
% 0.78/1.01 % --bmc1_k_induction false
% 0.78/1.01 % --bmc1_non_equiv_states false
% 0.78/1.01 % --bmc1_deadlock false
% 0.78/1.01 % --bmc1_ucm false
% 0.78/1.01 % --bmc1_add_unsat_core none
% 0.78/1.01 % --bmc1_unsat_core_children false
% 0.78/1.01 % --bmc1_unsat_core_extrapolate_axioms false
% 0.78/1.01 % --bmc1_out_stat full
% 0.78/1.01 % --bmc1_ground_init false
% 0.78/1.01 % --bmc1_pre_inst_next_state false
% 0.78/1.01 % --bmc1_pre_inst_state false
% 0.78/1.01 % --bmc1_pre_inst_reach_state false
% 0.78/1.01 % --bmc1_out_unsat_core false
% 0.78/1.01 % --bmc1_aig_witness_out false
% 0.78/1.01 % --bmc1_verbose false
% 0.78/1.01 % --bmc1_dump_clauses_tptp false
% 0.78/1.01 % --bmc1_dump_unsat_core_tptp false
% 0.78/1.01 % --bmc1_dump_file -
% 0.78/1.01 % --bmc1_ucm_expand_uc_limit 128
% 0.78/1.01 % --bmc1_ucm_n_expand_iterations 6
% 0.78/1.01 % --bmc1_ucm_extend_mode 1
% 0.78/1.01 % --bmc1_ucm_init_mode 2
% 0.78/1.01 % --bmc1_ucm_cone_mode none
% 0.78/1.01 % --bmc1_ucm_reduced_relation_type 0
% 0.78/1.01 % --bmc1_ucm_relax_model 4
% 0.78/1.01 % --bmc1_ucm_full_tr_after_sat true
% 0.78/1.01 % --bmc1_ucm_expand_neg_assumptions false
% 0.78/1.01 % --bmc1_ucm_layered_model none
% 0.78/1.01 % --bmc1_ucm_max_lemma_size 10
% 0.78/1.01
% 0.78/1.01 % ------ AIG Options
% 0.78/1.01
% 0.78/1.01 % --aig_mode false
% 0.78/1.01
% 0.78/1.01 % ------ Instantiation Options
% 0.78/1.01
% 0.78/1.01 % --instantiation_flag true
% 0.78/1.01 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.78/1.01 % --inst_solver_per_active 750
% 0.78/1.01 % --inst_solver_calls_frac 0.5
% 0.78/1.01 % --inst_passive_queue_type priority_queues
% 0.78/1.01 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.78/1.01 % --inst_passive_queues_freq [25;2]
% 0.78/1.01 % --inst_dismatching true
% 0.78/1.01 % --inst_eager_unprocessed_to_passive true
% 0.78/1.01 % --inst_prop_sim_given true
% 0.96/1.22 % --inst_prop_sim_new false
% 0.96/1.22 % --inst_orphan_elimination true
% 0.96/1.22 % --inst_learning_loop_flag true
% 0.96/1.22 % --inst_learning_start 3000
% 0.96/1.22 % --inst_learning_factor 2
% 0.96/1.22 % --inst_start_prop_sim_after_learn 3
% 0.96/1.22 % --inst_sel_renew solver
% 0.96/1.22 % --inst_lit_activity_flag true
% 0.96/1.22 % --inst_out_proof true
% 0.96/1.22
% 0.96/1.22 % ------ Resolution Options
% 0.96/1.22
% 0.96/1.22 % --resolution_flag true
% 0.96/1.22 % --res_lit_sel kbo_max
% 0.96/1.22 % --res_to_prop_solver none
% 0.96/1.22 % --res_prop_simpl_new false
% 0.96/1.22 % --res_prop_simpl_given false
% 0.96/1.22 % --res_passive_queue_type priority_queues
% 0.96/1.22 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.96/1.22 % --res_passive_queues_freq [15;5]
% 0.96/1.22 % --res_forward_subs full
% 0.96/1.22 % --res_backward_subs full
% 0.96/1.22 % --res_forward_subs_resolution true
% 0.96/1.22 % --res_backward_subs_resolution true
% 0.96/1.22 % --res_orphan_elimination false
% 0.96/1.22 % --res_time_limit 1000.
% 0.96/1.22 % --res_out_proof true
% 0.96/1.22 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0252d.s
% 0.96/1.22 % --modulo true
% 0.96/1.22
% 0.96/1.22 % ------ Combination Options
% 0.96/1.22
% 0.96/1.22 % --comb_res_mult 1000
% 0.96/1.22 % --comb_inst_mult 300
% 0.96/1.22 % ------
% 0.96/1.22
% 0.96/1.22
% 0.96/1.22
% 0.96/1.22 % ------ Proving...
% 0.96/1.22 % warning: shown sat in sat incomplete mode
% 0.96/1.22 %
% 0.96/1.22
% 0.96/1.22
% 0.96/1.22 ------ Building Model...Done
% 0.96/1.22
% 0.96/1.22 %------ The model is defined over ground terms (initial term algebra).
% 0.96/1.22 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 0.96/1.22 %------ where \phi is a formula over the term algebra.
% 0.96/1.22 %------ If we have equality in the problem then it is also defined as a predicate above,
% 0.96/1.22 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 0.96/1.22 %------ See help for --sat_out_model for different model outputs.
% 0.96/1.22 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 0.96/1.22 %------ where the first argument stands for the sort ($i in the unsorted case)
% 0.96/1.22
% 0.96/1.22
% 0.96/1.22
% 0.96/1.22
% 0.96/1.22 %------ Negative definition of equality_sorted
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0,X0,X1] :
% 0.96/1.22 ( ~(equality_sorted(X0,X0,X1)) <=>
% 0.96/1.22 (
% 0.96/1.22 (
% 0.96/1.22 ( X0=$i & X0=age(sk2_esk1_0,sk2_esk4_0) & X1=zero )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 ? [X2] :
% 0.96/1.22 (
% 0.96/1.22 ( X0=$i & X0=age(sk2_esk1_0,X2) & X1=zero )
% 0.96/1.22 &
% 0.96/1.22 ( X2!=sk2_esk2_0 )
% 0.96/1.22 &
% 0.96/1.22 ( X2!=sk2_esk4_0 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Positive definition of greater
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0,X1] :
% 0.96/1.22 ( greater(X0,X1) <=>
% 0.96/1.22 (
% 0.96/1.22 (
% 0.96/1.22 ( X0=mod2 & X1=mod1 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=tau & X1=zero )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=sigma & X1=zero )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=age(sk2_esk1_0,sk2_esk4_0) & X1=zero )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=age(sk2_esk1_0,sk2_esk4_0) & X1=sigma )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 ? [X2] :
% 0.96/1.22 (
% 0.96/1.22 ( X0=age(sk2_esk1_0,X2) & X1=zero )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X1=zero )
% 0.96/1.22 &
% 0.96/1.22 ( X0!=mod1 )
% 0.96/1.22 &
% 0.96/1.22 ( X0!=zero )
% 0.96/1.22 &
% 0.96/1.22 ( X0!=tau )
% 0.96/1.22 &
% 0.96/1.22 ( X0!=sigma )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Negative definition of smaller_or_equal
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0,X1] :
% 0.96/1.22 ( ~(smaller_or_equal(X0,X1)) <=>
% 0.96/1.22 (
% 0.96/1.22 ? [X2] :
% 0.96/1.22 (
% 0.96/1.22 ( X0=age(sk2_esk1_0,X2) & X1=zero )
% 0.96/1.22 &
% 0.96/1.22 ( X2!=sk2_esk2_0 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Negative definition of greater_or_equal
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0,X1] :
% 0.96/1.22 ( ~(greater_or_equal(X0,X1)) <=>
% 0.96/1.22 $false
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Positive definition of smaller
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0,X1] :
% 0.96/1.22 ( smaller(X0,X1) <=>
% 0.96/1.22 (
% 0.96/1.22 (
% 0.96/1.22 ( X0=mod1 & X1=mod2 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=zero )
% 0.96/1.22 &
% 0.96/1.22 ( X1!=mod1 )
% 0.96/1.22 &
% 0.96/1.22 ( X1!=zero )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=zero & X1=tau )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=zero & X1=sigma )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=sigma & X1=age(sk2_esk1_0,sk2_esk4_0) )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Positive definition of organization
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0] :
% 0.96/1.22 ( organization(X0) <=>
% 0.96/1.22 (
% 0.96/1.22 (
% 0.96/1.22 ( X0=sk2_esk1_0 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Positive definition of has_immunity
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0,X1] :
% 0.96/1.22 ( has_immunity(X0,X1) <=>
% 0.96/1.22 $false
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Positive definition of has_endowment
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0] :
% 0.96/1.22 ( has_endowment(X0) <=>
% 0.96/1.22 $false
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Positive definition of epred1_2
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0,X1] :
% 0.96/1.22 ( epred1_2(X0,X1) <=>
% 0.96/1.22 (
% 0.96/1.22 (
% 0.96/1.22 ( X0=sk2_esk1_0 )
% 0.96/1.22 &
% 0.96/1.22 ( X1!=sk2_esk4_0 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Positive definition of is_aligned
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0,X1] :
% 0.96/1.22 ( is_aligned(X0,X1) <=>
% 0.96/1.22 (
% 0.96/1.22 (
% 0.96/1.22 ( X0=sk2_esk1_0 )
% 0.96/1.22 &
% 0.96/1.22 ( X1!=sk2_esk4_0 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Positive definition of positional_advantage
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0,X1] :
% 0.96/1.22 ( positional_advantage(X0,X1) <=>
% 0.96/1.22 $false
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Negative definition of robust_position
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0] :
% 0.96/1.22 ( ~(robust_position(X0)) <=>
% 0.96/1.22 $false
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22 %------ Positive definition of dissimilar
% 0.96/1.22 fof(lit_def,axiom,
% 0.96/1.22 (! [X0,X1,X2] :
% 0.96/1.22 ( dissimilar(X0,X1,X2) <=>
% 0.96/1.22 (
% 0.96/1.22 (
% 0.96/1.22 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 & X2=sk2_esk4_0 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 0.96/1.22 &
% 0.96/1.22 ( X2!=sk2_esk2_0 )
% 0.96/1.22 &
% 0.96/1.22 ( X2!=sk2_esk4_0 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 & X2=sk2_esk2_0 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 |
% 0.96/1.22 (
% 0.96/1.22 ( X0=sk2_esk1_0 & X2=sk2_esk4_0 )
% 0.96/1.22 &
% 0.96/1.22 ( X1!=sk2_esk2_0 )
% 0.96/1.22 &
% 0.96/1.22 ( X1!=sk2_esk4_0 )
% 0.96/1.22 )
% 0.96/1.22
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 )
% 0.96/1.22 ).
% 0.96/1.22
% 0.96/1.22
% 0.96/1.22
% 0.96/1.22 % ------ Statistics
% 0.96/1.22
% 0.96/1.22 % ------ General
% 0.96/1.22
% 0.96/1.22 % num_of_input_clauses: 107
% 0.96/1.22 % num_of_input_neg_conjectures: 10
% 0.96/1.22 % num_of_splits: 0
% 0.96/1.22 % num_of_split_atoms: 0
% 0.96/1.22 % num_of_sem_filtered_clauses: 0
% 0.96/1.22 % num_of_subtypes: 0
% 0.96/1.22 % monotx_restored_types: 0
% 0.96/1.22 % sat_num_of_epr_types: 0
% 0.96/1.22 % sat_num_of_non_cyclic_types: 0
% 0.96/1.22 % sat_guarded_non_collapsed_types: 0
% 0.96/1.22 % is_epr: 0
% 0.96/1.22 % is_horn: 0
% 0.96/1.22 % has_eq: 1
% 0.96/1.22 % num_pure_diseq_elim: 0
% 0.96/1.22 % simp_replaced_by: 0
% 0.96/1.22 % res_preprocessed: 20
% 0.96/1.22 % prep_upred: 0
% 0.96/1.22 % prep_unflattend: 0
% 0.96/1.22 % pred_elim_cands: 0
% 0.96/1.22 % pred_elim: 0
% 0.96/1.22 % pred_elim_cl: 0
% 0.96/1.22 % pred_elim_cycles: 0
% 0.96/1.22 % forced_gc_time: 0
% 0.96/1.22 % gc_basic_clause_elim: 0
% 0.96/1.22 % parsing_time: 0.003
% 0.96/1.22 % sem_filter_time: 0.
% 0.96/1.22 % pred_elim_time: 0.
% 0.96/1.22 % out_proof_time: 0.
% 0.96/1.22 % monotx_time: 0.
% 0.96/1.22 % subtype_inf_time: 0.
% 0.96/1.22 % unif_index_cands_time: 0.
% 0.96/1.22 % unif_index_add_time: 0.
% 0.96/1.22 % total_time: 0.228
% 0.96/1.22 % num_of_symbols: 53
% 0.96/1.22 % num_of_terms: 831
% 0.96/1.22
% 0.96/1.22 % ------ Propositional Solver
% 0.96/1.22
% 0.96/1.22 % prop_solver_calls: 12
% 0.96/1.22 % prop_fast_solver_calls: 33
% 0.96/1.22 % prop_num_of_clauses: 228
% 0.96/1.22 % prop_preprocess_simplified: 865
% 0.96/1.22 % prop_fo_subsumed: 0
% 0.96/1.22 % prop_solver_time: 0.
% 0.96/1.22 % prop_fast_solver_time: 0.
% 0.96/1.22 % prop_unsat_core_time: 0.
% 0.96/1.22
% 0.96/1.22 % ------ QBF
% 0.96/1.22
% 0.96/1.22 % qbf_q_res: 0
% 0.96/1.22 % qbf_num_tautologies: 0
% 0.96/1.22 % qbf_prep_cycles: 0
% 0.96/1.22
% 0.96/1.22 % ------ BMC1
% 0.96/1.22
% 0.96/1.22 % bmc1_current_bound: -1
% 0.96/1.22 % bmc1_last_solved_bound: -1
% 0.96/1.22 % bmc1_unsat_core_size: -1
% 0.96/1.22 % bmc1_unsat_core_parents_size: -1
% 0.96/1.22 % bmc1_merge_next_fun: 0
% 0.96/1.22 % bmc1_unsat_core_clauses_time: 0.
% 0.96/1.22
% 0.96/1.22 % ------ Instantiation
% 0.96/1.22
% 0.96/1.22 % inst_num_of_clauses: 241
% 0.96/1.22 % inst_num_in_passive: 0
% 0.96/1.22 % inst_num_in_active: 234
% 0.96/1.22 % inst_num_in_unprocessed: 0
% 0.96/1.22 % inst_num_of_loops: 299
% 0.96/1.22 % inst_num_of_learning_restarts: 0
% 0.96/1.22 % inst_num_moves_active_passive: 44
% 0.96/1.22 % inst_lit_activity: 28
% 0.96/1.22 % inst_lit_activity_moves: 0
% 0.96/1.22 % inst_num_tautologies: 7
% 0.96/1.22 % inst_num_prop_implied: 0
% 0.96/1.22 % inst_num_existing_simplified: 0
% 0.96/1.22 % inst_num_eq_res_simplified: 0
% 0.96/1.22 % inst_num_child_elim: 0
% 0.96/1.22 % inst_num_of_dismatching_blockings: 41
% 0.96/1.22 % inst_num_of_non_proper_insts: 344
% 0.96/1.22 % inst_num_of_duplicates: 177
% 0.96/1.22 % inst_inst_num_from_inst_to_res: 0
% 0.96/1.22 % inst_dismatching_checking_time: 0.
% 0.96/1.22
% 0.96/1.22 % ------ Resolution
% 0.96/1.22
% 0.96/1.22 % res_num_of_clauses: 1862
% 0.96/1.22 % res_num_in_passive: 1443
% 0.96/1.22 % res_num_in_active: 348
% 0.96/1.22 % res_num_of_loops: 1000
% 0.96/1.22 % res_forward_subset_subsumed: 2474
% 0.96/1.22 % res_backward_subset_subsumed: 30
% 0.96/1.22 % res_forward_subsumed: 675
% 0.96/1.22 % res_backward_subsumed: 11
% 0.96/1.22 % res_forward_subsumption_resolution: 14
% 0.96/1.22 % res_backward_subsumption_resolution: 0
% 0.96/1.22 % res_clause_to_clause_subsumption: 12750
% 0.96/1.22 % res_orphan_elimination: 0
% 0.96/1.22 % res_tautology_del: 64
% 0.96/1.22 % res_num_eq_res_simplified: 0
% 0.96/1.22 % res_num_sel_changes: 0
% 0.96/1.22 % res_moves_from_active_to_pass: 0
% 0.96/1.22
% 0.96/1.22 % Status Unknown
% 0.96/1.22 % Last status :
% 0.96/1.22 % SZS status Unknown
%------------------------------------------------------------------------------