TSTP Solution File: MGT064-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT064-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n027.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 3.05s 3.24s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT064-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 12:35:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.13/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.42 % Orientation found
% 0.13/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_9940ce.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_fc7e90.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_1c756b | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.46 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.46 % --bmc1_dump_file -
% 0.20/0.46 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.46 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.46 % --bmc1_ucm_extend_mode 1
% 0.20/0.46 % --bmc1_ucm_init_mode 2
% 0.20/0.46 % --bmc1_ucm_cone_mode none
% 0.20/0.46 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.46 % --bmc1_ucm_relax_model 4
% 0.20/0.46 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.46 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.46 % --bmc1_ucm_layered_model none
% 0.20/0.46 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.46
% 0.20/0.46 % ------ AIG Options
% 0.20/0.46
% 0.20/0.46 % --aig_mode false
% 0.20/0.46
% 0.20/0.46 % ------ Instantiation Options
% 0.20/0.46
% 0.20/0.46 % --instantiation_flag true
% 0.20/0.46 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.46 % --inst_solver_per_active 750
% 0.20/0.46 % --inst_solver_calls_frac 0.5
% 0.20/0.46 % --inst_passive_queue_type priority_queues
% 0.20/0.46 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.46 % --inst_passive_queues_freq [25;2]
% 0.20/0.46 % --inst_dismatching true
% 0.20/0.46 % --inst_eager_unprocessed_to_passive true
% 0.20/0.46 % --inst_prop_sim_given true
% 0.20/0.46 % --inst_prop_sim_new false
% 0.20/0.46 % --inst_orphan_elimination true
% 0.20/0.46 % --inst_learning_loop_flag true
% 0.20/0.46 % --inst_learning_start 3000
% 0.20/0.46 % --inst_learning_factor 2
% 0.20/0.46 % --inst_start_prop_sim_after_learn 3
% 0.20/0.46 % --inst_sel_renew solver
% 0.20/0.46 % --inst_lit_activity_flag true
% 0.20/0.46 % --inst_out_proof true
% 0.20/0.46
% 0.20/0.46 % ------ Resolution Options
% 0.20/0.46
% 0.20/0.46 % --resolution_flag true
% 0.20/0.46 % --res_lit_sel kbo_max
% 0.20/0.46 % --res_to_prop_solver none
% 0.20/0.46 % --res_prop_simpl_new false
% 0.20/0.46 % --res_prop_simpl_given false
% 0.20/0.46 % --res_passive_queue_type priority_queues
% 0.20/0.46 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.46 % --res_passive_queues_freq [15;5]
% 0.20/0.46 % --res_forward_subs full
% 0.20/0.46 % --res_backward_subs full
% 0.20/0.46 % --res_forward_subs_resolution true
% 0.20/0.46 % --res_backward_subs_resolution true
% 0.20/0.46 % --res_orphan_elimination false
% 0.20/0.46 % --res_time_limit 1000.
% 0.20/0.46 % --res_out_proof true
% 0.20/0.46 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_9940ce.s
% 0.20/0.46 % --modulo true
% 0.20/0.46
% 0.20/0.46 % ------ Combination Options
% 0.20/0.46
% 0.20/0.46 % --comb_res_mult 1000
% 0.20/0.46 % --comb_inst_mult 300
% 0.20/0.46 % ------
% 0.20/0.46
% 0.20/0.46 % ------ Parsing...% successful
% 0.20/0.46
% 0.20/0.46 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.46
% 0.20/0.46 % ------ Proving...
% 0.20/0.46 % ------ Problem Properties
% 0.20/0.46
% 0.20/0.46 %
% 0.20/0.46 % EPR false
% 0.20/0.46 % Horn false
% 0.20/0.46 % Has equality true
% 0.20/0.46
% 0.20/0.46 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 % % ------ Current options:
% 0.20/0.46
% 0.20/0.46 % ------ Input Options
% 0.20/0.46
% 0.20/0.46 % --out_options all
% 0.20/0.46 % --tptp_safe_out true
% 0.20/0.46 % --problem_path ""
% 0.20/0.46 % --include_path ""
% 0.20/0.46 % --clausifier .//eprover
% 0.20/0.46 % --clausifier_options --tstp-format
% 0.20/0.46 % --stdin false
% 0.20/0.46 % --dbg_backtrace false
% 0.20/0.46 % --dbg_dump_prop_clauses false
% 0.20/0.46 % --dbg_dump_prop_clauses_file -
% 0.20/0.46 % --dbg_out_stat false
% 0.20/0.46
% 0.20/0.46 % ------ General Options
% 0.20/0.46
% 0.20/0.46 % --fof false
% 0.20/0.46 % --time_out_real 150.
% 0.20/0.46 % --time_out_prep_mult 0.2
% 0.20/0.46 % --time_out_virtual -1.
% 0.20/0.46 % --schedule none
% 0.20/0.46 % --ground_splitting input
% 0.20/0.46 % --splitting_nvd 16
% 0.20/0.46 % --non_eq_to_eq false
% 0.20/0.46 % --prep_gs_sim true
% 0.20/0.46 % --prep_unflatten false
% 0.20/0.46 % --prep_res_sim true
% 0.20/0.46 % --prep_upred true
% 0.20/0.46 % --res_sim_input true
% 0.20/0.46 % --clause_weak_htbl true
% 0.20/0.46 % --gc_record_bc_elim false
% 0.20/0.46 % --symbol_type_check false
% 0.20/0.46 % --clausify_out false
% 0.20/0.46 % --large_theory_mode false
% 0.20/0.46 % --prep_sem_filter none
% 0.20/0.46 % --prep_sem_filter_out false
% 0.20/0.46 % --preprocessed_out false
% 0.20/0.46 % --sub_typing false
% 0.20/0.46 % --brand_transform false
% 0.20/0.46 % --pure_diseq_elim true
% 0.20/0.46 % --min_unsat_core false
% 0.20/0.46 % --pred_elim true
% 0.20/0.46 % --add_important_lit false
% 0.20/0.46 % --soft_assumptions false
% 0.20/0.46 % --reset_solvers false
% 0.20/0.46 % --bc_imp_inh []
% 0.20/0.46 % --conj_cone_tolerance 1.5
% 0.20/0.46 % --prolific_symb_bound 500
% 0.20/0.46 % --lt_threshold 2000
% 0.20/0.46
% 0.20/0.46 % ------ SAT Options
% 0.20/0.46
% 0.20/0.46 % --sat_mode false
% 0.20/0.46 % --sat_fm_restart_options ""
% 0.20/0.46 % --sat_gr_def false
% 0.20/0.46 % --sat_epr_types true
% 0.20/0.46 % --sat_non_cyclic_types false
% 0.20/0.46 % --sat_finite_models false
% 0.20/0.46 % --sat_fm_lemmas false
% 0.20/0.46 % --sat_fm_prep false
% 0.20/0.46 % --sat_fm_uc_incr true
% 0.20/0.46 % --sat_out_model small
% 0.20/0.46 % --sat_out_clauses false
% 0.20/0.46
% 0.20/0.46 % ------ QBF Options
% 0.20/0.46
% 0.20/0.46 % --qbf_mode false
% 0.20/0.46 % --qbf_elim_univ true
% 0.20/0.46 % --qbf_sk_in true
% 0.20/0.46 % --qbf_pred_elim true
% 0.20/0.46 % --qbf_split 32
% 0.20/0.46
% 0.20/0.46 % ------ BMC1 Options
% 0.20/0.46
% 0.20/0.46 % --bmc1_incremental false
% 0.20/0.46 % --bmc1_axioms reachable_all
% 0.20/0.46 % --bmc1_min_bound 0
% 0.20/0.46 % --bmc1_max_bound -1
% 0.20/0.46 % --bmc1_max_bound_default -1
% 0.20/0.46 % --bmc1_symbol_reachability true
% 0.20/0.46 % --bmc1_property_lemmas false
% 0.20/0.46 % --bmc1_k_induction false
% 0.20/0.46 % --bmc1_non_equiv_states false
% 0.20/0.46 % --bmc1_deadlock false
% 0.20/0.46 % --bmc1_ucm false
% 0.20/0.46 % --bmc1_add_unsat_core none
% 0.20/0.46 % --bmc1_unsat_core_children false
% 0.20/0.46 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.46 % --bmc1_out_stat full
% 0.20/0.46 % --bmc1_ground_init false
% 0.20/0.46 % --bmc1_pre_inst_next_state false
% 0.20/0.46 % --bmc1_pre_inst_state false
% 0.20/0.46 % --bmc1_pre_inst_reach_state false
% 0.20/0.46 % --bmc1_out_unsat_core false
% 0.20/0.46 % --bmc1_aig_witness_out false
% 0.20/0.46 % --bmc1_verbose false
% 0.20/0.46 % --bmc1_dump_clauses_tptp false
% 0.20/0.46 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.46 % --bmc1_dump_file -
% 0.20/0.46 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.46 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.46 % --bmc1_ucm_extend_mode 1
% 0.20/0.46 % --bmc1_ucm_init_mode 2
% 0.20/0.46 % --bmc1_ucm_cone_mode none
% 0.20/0.46 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.46 % --bmc1_ucm_relax_model 4
% 0.20/0.46 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.46 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.46 % --bmc1_ucm_layered_model none
% 0.20/0.46 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.46
% 0.20/0.46 % ------ AIG Options
% 0.20/0.46
% 0.20/0.46 % --aig_mode false
% 0.20/0.46
% 0.20/0.46 % ------ Instantiation Options
% 0.20/0.46
% 0.20/0.46 % --instantiation_flag true
% 0.20/0.46 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.46 % --inst_solver_per_active 750
% 0.20/0.46 % --inst_solver_calls_frac 0.5
% 0.20/0.46 % --inst_passive_queue_type priority_queues
% 0.20/0.46 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.46 % --inst_passive_queues_freq [25;2]
% 0.20/0.46 % --inst_dismatching true
% 0.20/0.46 % --inst_eager_unprocessed_to_passive true
% 0.20/0.46 % --inst_prop_sim_given true
% 2.12/2.32 % --inst_prop_sim_new false
% 2.12/2.32 % --inst_orphan_elimination true
% 2.12/2.32 % --inst_learning_loop_flag true
% 2.12/2.32 % --inst_learning_start 3000
% 2.12/2.32 % --inst_learning_factor 2
% 2.12/2.32 % --inst_start_prop_sim_after_learn 3
% 2.12/2.32 % --inst_sel_renew solver
% 2.12/2.32 % --inst_lit_activity_flag true
% 2.12/2.32 % --inst_out_proof true
% 2.12/2.32
% 2.12/2.32 % ------ Resolution Options
% 2.12/2.32
% 2.12/2.32 % --resolution_flag true
% 2.12/2.32 % --res_lit_sel kbo_max
% 2.12/2.32 % --res_to_prop_solver none
% 2.12/2.32 % --res_prop_simpl_new false
% 2.12/2.32 % --res_prop_simpl_given false
% 2.12/2.32 % --res_passive_queue_type priority_queues
% 2.12/2.32 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.12/2.32 % --res_passive_queues_freq [15;5]
% 2.12/2.32 % --res_forward_subs full
% 2.12/2.32 % --res_backward_subs full
% 2.12/2.32 % --res_forward_subs_resolution true
% 2.12/2.32 % --res_backward_subs_resolution true
% 2.12/2.32 % --res_orphan_elimination false
% 2.12/2.32 % --res_time_limit 1000.
% 2.12/2.32 % --res_out_proof true
% 2.12/2.32 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_9940ce.s
% 2.12/2.32 % --modulo true
% 2.12/2.32
% 2.12/2.32 % ------ Combination Options
% 2.12/2.32
% 2.12/2.32 % --comb_res_mult 1000
% 2.12/2.32 % --comb_inst_mult 300
% 2.12/2.32 % ------
% 2.12/2.32
% 2.12/2.32
% 2.12/2.32
% 2.12/2.32 % ------ Proving...
% 2.12/2.32 % warning: shown sat in sat incomplete mode
% 2.12/2.32 %
% 2.12/2.32
% 2.12/2.32
% 2.12/2.32 ------ Building Model...Done
% 2.12/2.32
% 2.12/2.32 %------ The model is defined over ground terms (initial term algebra).
% 2.12/2.32 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.12/2.32 %------ where \phi is a formula over the term algebra.
% 2.12/2.32 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.12/2.32 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.12/2.32 %------ See help for --sat_out_model for different model outputs.
% 2.12/2.32 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.12/2.32 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.12/2.32
% 2.12/2.32
% 2.12/2.32
% 2.12/2.32
% 2.12/2.32 %------ Negative definition of equality_sorted
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0,X0,X1] :
% 2.12/2.32 ( ~(equality_sorted(X0,X0,X1)) <=>
% 2.12/2.32 (
% 2.12/2.32 (
% 2.12/2.32 ( X0=$i & X0=age(sk3,sk6) & X1=tau )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 ? [X2] :
% 2.12/2.32 (
% 2.12/2.32 ( X0=$i & X0=age(sk3,X2) & X1=zero )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk4 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 ? [X2] :
% 2.12/2.32 (
% 2.12/2.32 ( X0=$i & X0=age(sk3,X2) & X1=tau )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk5 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32 %------ Positive definition of greater
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0,X1] :
% 2.12/2.32 ( greater(X0,X1) <=>
% 2.12/2.32 (
% 2.12/2.32 (
% 2.12/2.32 ( X0=sigma & X1=zero )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=sigma & X1=tau )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=tau & X1=zero )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=low & X1=very_low )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=mod1 & X1=low )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=mod1 & X1=very_low )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=mod2 & X1=low )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=mod2 & X1=mod1 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=mod2 & X1=very_low )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=high & X1=low )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=high & X1=mod1 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=high & X1=mod2 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=high & X1=very_low )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=age(sk3,sk7) & X1=zero )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=age(sk3,sk7) & X1=sigma )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=age(sk3,sk7) & X1=tau )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=age(sk3,sk6) & X1=zero )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=age(sk3,sk6) & X1=tau )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 ? [X2] :
% 2.12/2.32 (
% 2.12/2.32 ( X0=age(sk3,X2) & X1=zero )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 ? [X2] :
% 2.12/2.32 (
% 2.12/2.32 ( X0=age(sk3,X2) & X1=sigma )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk5 )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk4 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 ? [X2] :
% 2.12/2.32 (
% 2.12/2.32 ( X0=age(sk3,X2) & X1=tau )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk5 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32 %------ Negative definition of dissimilar
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0,X1,X2] :
% 2.12/2.32 ( ~(dissimilar(X0,X1,X2)) <=>
% 2.12/2.32 (
% 2.12/2.32 (
% 2.12/2.32 ( X0!=sk3 | X1!=sk5 )
% 2.12/2.32 &
% 2.12/2.32 ( X0!=sk3 | X1!=sk4 )
% 2.12/2.32 &
% 2.12/2.32 ( X0!=sk3 | X2!=sk5 )
% 2.12/2.32 &
% 2.12/2.32 ( X0!=sk3 | X2!=sk4 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=sk3 & X1=sk5 & X2=sk5 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=sk3 & X1=sk5 & X2=sk4 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=sk3 & X1=sk4 & X2=sk5 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=sk3 & X1=sk4 & X2=sk4 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32 %------ Positive definition of organization
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0] :
% 2.12/2.32 ( organization(X0) <=>
% 2.12/2.32 (
% 2.12/2.32 (
% 2.12/2.32 ( X0=sk3 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32 %------ Positive definition of is_aligned
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0,X1] :
% 2.12/2.32 ( is_aligned(X0,X1) <=>
% 2.12/2.32 (
% 2.12/2.32 (
% 2.12/2.32 ( X0=sk3 & X1=sk5 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=sk3 & X1=sk4 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32 %------ Positive definition of has_endowment
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0] :
% 2.12/2.32 ( has_endowment(X0) <=>
% 2.12/2.32 $false
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32 %------ Negative definition of smaller_or_equal
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0,X1] :
% 2.12/2.32 ( ~(smaller_or_equal(X0,X1)) <=>
% 2.12/2.32 (
% 2.12/2.32 (
% 2.12/2.32 ( X0=age(sk3,sk6) & X1=tau )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 ? [X2] :
% 2.12/2.32 (
% 2.12/2.32 ( X0=age(sk3,X2) & X1=zero )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk4 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 ? [X2] :
% 2.12/2.32 (
% 2.12/2.32 ( X0=age(sk3,X2) & X1=tau )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk5 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32 %------ Positive definition of robust_position
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0] :
% 2.12/2.32 ( robust_position(X0) <=>
% 2.12/2.32 $true
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32 %------ Positive definition of has_immunity
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0,X1] :
% 2.12/2.32 ( has_immunity(X0,X1) <=>
% 2.12/2.32 $false
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32 %------ Negative definition of positional_advantage
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0,X1] :
% 2.12/2.32 ( ~(positional_advantage(X0,X1)) <=>
% 2.12/2.32 (
% 2.12/2.32 (
% 2.12/2.32 ( X0!=sk3 )
% 2.12/2.32 &
% 2.12/2.32 ( X0!=sk3 | X1!=sk6 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=sk3 & X1=sk5 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32 %------ Positive definition of smaller
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0,X1] :
% 2.12/2.32 ( smaller(X0,X1) <=>
% 2.12/2.32 (
% 2.12/2.32 (
% 2.12/2.32 ( X0=zero & X1=sigma )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=zero & X1=tau )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=zero & X1=age(sk3,sk7) )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=zero & X1=age(sk3,sk6) )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 ? [X2] :
% 2.12/2.32 (
% 2.12/2.32 ( X0=zero & X1=age(sk3,X2) )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk7 )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk6 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=sigma & X1=age(sk3,sk7) )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 ? [X2] :
% 2.12/2.32 (
% 2.12/2.32 ( X0=sigma & X1=age(sk3,X2) )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk5 )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk4 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=tau & X1=sigma )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=tau & X1=age(sk3,sk7) )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=tau & X1=age(sk3,sk6) )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 ? [X2] :
% 2.12/2.32 (
% 2.12/2.32 ( X0=tau & X1=age(sk3,X2) )
% 2.12/2.32 &
% 2.12/2.32 ( X2!=sk5 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=low & X1=mod1 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=low & X1=mod2 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=low & X1=high )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=mod1 & X1=mod2 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=mod1 & X1=high )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=mod2 & X1=high )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=very_low & X1=low )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=very_low & X1=mod1 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=very_low & X1=mod2 )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 |
% 2.12/2.32 (
% 2.12/2.32 ( X0=very_low & X1=high )
% 2.12/2.32 )
% 2.12/2.32
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32 %------ Negative definition of greater_or_equal
% 2.12/2.32 fof(lit_def,axiom,
% 2.12/2.32 (! [X0,X1] :
% 2.12/2.32 ( ~(greater_or_equal(X0,X1)) <=>
% 2.12/2.32 $false
% 2.12/2.32 )
% 2.12/2.32 )
% 2.12/2.32 ).
% 2.12/2.32
% 2.12/2.32
% 2.12/2.32
% 2.12/2.32 % ------ Statistics
% 2.12/2.32
% 2.12/2.32 % ------ General
% 2.12/2.32
% 2.12/2.32 % num_of_input_clauses: 147
% 2.12/2.32 % num_of_input_neg_conjectures: 12
% 2.12/2.32 % num_of_splits: 0
% 2.12/2.32 % num_of_split_atoms: 0
% 2.12/2.32 % num_of_sem_filtered_clauses: 0
% 2.12/2.32 % num_of_subtypes: 0
% 2.12/2.32 % monotx_restored_types: 0
% 2.12/2.32 % sat_num_of_epr_types: 0
% 2.12/2.32 % sat_num_of_non_cyclic_types: 0
% 2.12/2.32 % sat_guarded_non_collapsed_types: 0
% 2.12/2.32 % is_epr: 0
% 2.12/2.32 % is_horn: 0
% 2.12/2.32 % has_eq: 1
% 2.12/2.32 % num_pure_diseq_elim: 0
% 2.12/2.32 % simp_replaced_by: 0
% 2.12/2.32 % res_preprocessed: 24
% 2.12/2.32 % prep_upred: 0
% 2.12/2.32 % prep_unflattend: 0
% 2.12/2.32 % pred_elim_cands: 0
% 2.12/2.32 % pred_elim: 0
% 2.12/2.32 % pred_elim_cl: 0
% 2.12/2.32 % pred_elim_cycles: 0
% 2.12/2.32 % forced_gc_time: 0
% 2.12/2.32 % gc_basic_clause_elim: 0
% 2.12/2.32 % parsing_time: 0.006
% 2.12/2.32 % sem_filter_time: 0.
% 2.12/2.32 % pred_elim_time: 0.
% 2.12/2.32 % out_proof_time: 0.
% 2.12/2.32 % monotx_time: 0.
% 2.12/2.32 % subtype_inf_time: 0.
% 2.12/2.32 % unif_index_cands_time: 0.006
% 2.12/2.32 % unif_index_add_time: 0.002
% 2.12/2.32 % total_time: 1.892
% 2.12/2.32 % num_of_symbols: 54
% 2.12/2.32 % num_of_terms: 1278
% 2.12/2.32
% 2.12/2.32 % ------ Propositional Solver
% 2.12/2.32
% 2.12/2.32 % prop_solver_calls: 12
% 2.12/2.32 % prop_fast_solver_calls: 42
% 2.12/2.32 % prop_num_of_clauses: 384
% 2.12/2.32 % prop_preprocess_simplified: 1190
% 2.12/2.32 % prop_fo_subsumed: 0
% 2.12/2.32 % prop_solver_time: 0.
% 2.12/2.32 % prop_fast_solver_time: 0.
% 2.12/2.32 % prop_unsat_core_time: 0.
% 2.12/2.32
% 2.12/2.32 % ------ QBF
% 2.12/2.32
% 2.12/2.32 % qbf_q_res: 0
% 2.12/2.32 % qbf_num_tautologies: 0
% 2.12/2.32 % qbf_prep_cycles: 0
% 2.12/2.32
% 2.12/2.32 % ------ BMC1
% 2.12/2.32
% 2.12/2.32 % bmc1_current_bound: -1
% 2.12/2.32 % bmc1_last_solved_bound: -1
% 2.12/2.32 % bmc1_unsat_core_size: -1
% 2.12/2.32 % bmc1_unsat_core_parents_size: -1
% 2.12/2.32 % bmc1_merge_next_fun: 0
% 2.12/2.32 % bmc1_unsat_core_clauses_time: 0.
% 2.12/2.32
% 2.12/2.32 % ------ Instantiation
% 2.12/2.32
% 2.12/2.32 % inst_num_of_clauses: 370
% 2.12/2.32 % inst_num_in_passive: 0
% 2.12/2.32 % inst_num_in_active: 353
% 2.12/2.32 % inst_num_in_unprocessed: 0
% 2.12/2.32 % inst_num_of_loops: 401
% 2.12/2.32 % inst_num_of_learning_restarts: 0
% 2.12/2.32 % inst_num_moves_active_passive: 18
% 2.12/2.32 % inst_lit_activity: 57
% 2.12/2.32 % inst_lit_activity_moves: 0
% 2.12/2.32 % inst_num_tautologies: 17
% 2.12/2.32 % inst_num_prop_implied: 0
% 2.12/2.32 % inst_num_existing_simplified: 0
% 2.12/2.32 % inst_num_eq_res_simplified: 0
% 2.12/2.32 % inst_num_child_elim: 0
% 2.12/2.32 % inst_num_of_dismatching_blockings: 11
% 2.12/2.32 % inst_num_of_non_proper_insts: 648
% 2.12/2.32 % inst_num_of_duplicates: 209
% 2.12/2.32 % inst_inst_num_from_inst_to_res: 0
% 2.12/2.32 % inst_dismatching_checking_time: 0.
% 2.12/2.32
% 2.12/2.32 % ------ Resolution
% 2.12/2.32
% 2.12/2.32 % res_num_of_clauses: 22988
% 2.12/2.32 % res_num_in_passive: 21929
% 2.12/2.32 % res_num_in_active: 1107
% 2.12/2.32 % res_num_of_loops: 2000
% 2.12/2.32 % res_forward_subset_subsumed: 49040
% 2.12/2.32 % res_backward_subset_subsumed: 190
% 2.12/2.32 % res_forward_subsumed: 899
% 2.12/2.32 % res_backward_subsumed: 30
% 2.12/2.32 % res_forward_subsumption_resolution: 16
% 2.12/2.32 % res_backward_subsumption_resolution: 6
% 2.12/2.32 % res_clause_to_clause_subsumption: 45678
% 2.12/2.32 % res_orphan_elimination: 0
% 2.12/2.32 % res_tautology_del: 517
% 2.12/2.32 % res_num_eq_res_simplified: 0
% 2.12/2.32 % res_num_sel_changes: 0
% 2.12/2.32 % res_moves_from_active_to_pass: 0
% 2.12/2.32
% 2.12/2.32 % Status Unknown
% 2.12/2.36 % Orienting using strategy ClausalAll
% 2.12/2.36 % Orientation found
% 2.12/2.36 % 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_9940ce.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_fc7e90.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_c419aa | grep -v "SZS"
% 2.12/2.38
% 2.12/2.38 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 2.12/2.38
% 2.12/2.38 %
% 2.12/2.38 % ------ iProver source info
% 2.12/2.38
% 2.12/2.38 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 2.12/2.38 % git: non_committed_changes: true
% 2.12/2.38 % git: last_make_outside_of_git: true
% 2.12/2.38
% 2.12/2.38 %
% 2.12/2.38 % ------ Input Options
% 2.12/2.38
% 2.12/2.38 % --out_options all
% 2.12/2.38 % --tptp_safe_out true
% 2.12/2.38 % --problem_path ""
% 2.12/2.38 % --include_path ""
% 2.12/2.38 % --clausifier .//eprover
% 2.12/2.38 % --clausifier_options --tstp-format
% 2.12/2.38 % --stdin false
% 2.12/2.38 % --dbg_backtrace false
% 2.12/2.38 % --dbg_dump_prop_clauses false
% 2.12/2.38 % --dbg_dump_prop_clauses_file -
% 2.12/2.38 % --dbg_out_stat false
% 2.12/2.38
% 2.12/2.38 % ------ General Options
% 2.12/2.38
% 2.12/2.38 % --fof false
% 2.12/2.38 % --time_out_real 150.
% 2.12/2.38 % --time_out_prep_mult 0.2
% 2.12/2.38 % --time_out_virtual -1.
% 2.12/2.38 % --schedule none
% 2.12/2.38 % --ground_splitting input
% 2.12/2.38 % --splitting_nvd 16
% 2.12/2.38 % --non_eq_to_eq false
% 2.12/2.38 % --prep_gs_sim true
% 2.12/2.38 % --prep_unflatten false
% 2.12/2.38 % --prep_res_sim true
% 2.12/2.38 % --prep_upred true
% 2.12/2.38 % --res_sim_input true
% 2.12/2.38 % --clause_weak_htbl true
% 2.12/2.38 % --gc_record_bc_elim false
% 2.12/2.38 % --symbol_type_check false
% 2.12/2.38 % --clausify_out false
% 2.12/2.38 % --large_theory_mode false
% 2.12/2.38 % --prep_sem_filter none
% 2.12/2.38 % --prep_sem_filter_out false
% 2.12/2.38 % --preprocessed_out false
% 2.12/2.38 % --sub_typing false
% 2.12/2.38 % --brand_transform false
% 2.12/2.38 % --pure_diseq_elim true
% 2.12/2.38 % --min_unsat_core false
% 2.12/2.38 % --pred_elim true
% 2.12/2.38 % --add_important_lit false
% 2.12/2.38 % --soft_assumptions false
% 2.12/2.38 % --reset_solvers false
% 2.12/2.38 % --bc_imp_inh []
% 2.12/2.38 % --conj_cone_tolerance 1.5
% 2.12/2.38 % --prolific_symb_bound 500
% 2.12/2.38 % --lt_threshold 2000
% 2.12/2.38
% 2.12/2.38 % ------ SAT Options
% 2.12/2.38
% 2.12/2.38 % --sat_mode false
% 2.12/2.38 % --sat_fm_restart_options ""
% 2.12/2.38 % --sat_gr_def false
% 2.12/2.38 % --sat_epr_types true
% 2.12/2.38 % --sat_non_cyclic_types false
% 2.12/2.38 % --sat_finite_models false
% 2.12/2.38 % --sat_fm_lemmas false
% 2.12/2.38 % --sat_fm_prep false
% 2.12/2.38 % --sat_fm_uc_incr true
% 2.12/2.38 % --sat_out_model small
% 2.12/2.38 % --sat_out_clauses false
% 2.12/2.38
% 2.12/2.38 % ------ QBF Options
% 2.12/2.38
% 2.12/2.38 % --qbf_mode false
% 2.12/2.38 % --qbf_elim_univ true
% 2.12/2.38 % --qbf_sk_in true
% 2.12/2.38 % --qbf_pred_elim true
% 2.12/2.38 % --qbf_split 32
% 2.12/2.38
% 2.12/2.38 % ------ BMC1 Options
% 2.12/2.38
% 2.12/2.38 % --bmc1_incremental false
% 2.12/2.38 % --bmc1_axioms reachable_all
% 2.12/2.38 % --bmc1_min_bound 0
% 2.12/2.38 % --bmc1_max_bound -1
% 2.12/2.38 % --bmc1_max_bound_default -1
% 2.12/2.38 % --bmc1_symbol_reachability true
% 2.12/2.38 % --bmc1_property_lemmas false
% 2.12/2.38 % --bmc1_k_induction false
% 2.12/2.38 % --bmc1_non_equiv_states false
% 2.12/2.38 % --bmc1_deadlock false
% 2.12/2.38 % --bmc1_ucm false
% 2.12/2.38 % --bmc1_add_unsat_core none
% 2.12/2.38 % --bmc1_unsat_core_children false
% 2.12/2.38 % --bmc1_unsat_core_extrapolate_axioms false
% 2.12/2.38 % --bmc1_out_stat full
% 2.12/2.38 % --bmc1_ground_init false
% 2.12/2.38 % --bmc1_pre_inst_next_state false
% 2.12/2.38 % --bmc1_pre_inst_state false
% 2.12/2.38 % --bmc1_pre_inst_reach_state false
% 2.12/2.38 % --bmc1_out_unsat_core false
% 2.12/2.38 % --bmc1_aig_witness_out false
% 2.12/2.38 % --bmc1_verbose false
% 2.12/2.38 % --bmc1_dump_clauses_tptp false
% 2.12/2.39 % --bmc1_dump_unsat_core_tptp false
% 2.12/2.39 % --bmc1_dump_file -
% 2.12/2.39 % --bmc1_ucm_expand_uc_limit 128
% 2.12/2.39 % --bmc1_ucm_n_expand_iterations 6
% 2.12/2.39 % --bmc1_ucm_extend_mode 1
% 2.12/2.39 % --bmc1_ucm_init_mode 2
% 2.12/2.39 % --bmc1_ucm_cone_mode none
% 2.12/2.39 % --bmc1_ucm_reduced_relation_type 0
% 2.12/2.39 % --bmc1_ucm_relax_model 4
% 2.12/2.39 % --bmc1_ucm_full_tr_after_sat true
% 2.12/2.39 % --bmc1_ucm_expand_neg_assumptions false
% 2.12/2.39 % --bmc1_ucm_layered_model none
% 2.12/2.39 % --bmc1_ucm_max_lemma_size 10
% 2.12/2.39
% 2.12/2.39 % ------ AIG Options
% 2.12/2.39
% 2.12/2.39 % --aig_mode false
% 2.12/2.39
% 2.12/2.39 % ------ Instantiation Options
% 2.12/2.39
% 2.12/2.39 % --instantiation_flag true
% 2.12/2.39 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.12/2.39 % --inst_solver_per_active 750
% 2.12/2.39 % --inst_solver_calls_frac 0.5
% 2.12/2.39 % --inst_passive_queue_type priority_queues
% 2.12/2.39 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.12/2.39 % --inst_passive_queues_freq [25;2]
% 2.12/2.39 % --inst_dismatching true
% 2.12/2.39 % --inst_eager_unprocessed_to_passive true
% 2.12/2.39 % --inst_prop_sim_given true
% 2.12/2.39 % --inst_prop_sim_new false
% 2.12/2.39 % --inst_orphan_elimination true
% 2.12/2.39 % --inst_learning_loop_flag true
% 2.12/2.39 % --inst_learning_start 3000
% 2.12/2.39 % --inst_learning_factor 2
% 2.12/2.39 % --inst_start_prop_sim_after_learn 3
% 2.12/2.39 % --inst_sel_renew solver
% 2.12/2.39 % --inst_lit_activity_flag true
% 2.12/2.39 % --inst_out_proof true
% 2.12/2.39
% 2.12/2.39 % ------ Resolution Options
% 2.12/2.39
% 2.12/2.39 % --resolution_flag true
% 2.12/2.39 % --res_lit_sel kbo_max
% 2.12/2.39 % --res_to_prop_solver none
% 2.12/2.39 % --res_prop_simpl_new false
% 2.12/2.39 % --res_prop_simpl_given false
% 2.12/2.39 % --res_passive_queue_type priority_queues
% 2.12/2.39 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.12/2.39 % --res_passive_queues_freq [15;5]
% 2.12/2.39 % --res_forward_subs full
% 2.12/2.39 % --res_backward_subs full
% 2.12/2.39 % --res_forward_subs_resolution true
% 2.12/2.39 % --res_backward_subs_resolution true
% 2.12/2.39 % --res_orphan_elimination false
% 2.12/2.39 % --res_time_limit 1000.
% 2.12/2.39 % --res_out_proof true
% 2.12/2.39 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_9940ce.s
% 2.12/2.39 % --modulo true
% 2.12/2.39
% 2.12/2.39 % ------ Combination Options
% 2.12/2.39
% 2.12/2.39 % --comb_res_mult 1000
% 2.12/2.39 % --comb_inst_mult 300
% 2.12/2.39 % ------
% 2.12/2.39
% 2.12/2.39 % ------ Parsing...% successful
% 2.12/2.39
% 2.12/2.39 % ------ 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 %
% 2.12/2.39
% 2.12/2.39 % ------ Proving...
% 2.12/2.39 % ------ Problem Properties
% 2.12/2.39
% 2.12/2.39 %
% 2.12/2.39 % EPR false
% 2.12/2.39 % Horn false
% 2.12/2.39 % Has equality true
% 2.12/2.39
% 2.12/2.39 % % ------ Input Options Time Limit: Unbounded
% 2.12/2.39
% 2.12/2.39
% 2.12/2.39 % % ------ Current options:
% 2.12/2.39
% 2.12/2.39 % ------ Input Options
% 2.12/2.39
% 2.12/2.39 % --out_options all
% 2.12/2.39 % --tptp_safe_out true
% 2.12/2.39 % --problem_path ""
% 2.12/2.39 % --include_path ""
% 2.12/2.39 % --clausifier .//eprover
% 2.12/2.39 % --clausifier_options --tstp-format
% 2.12/2.39 % --stdin false
% 2.12/2.39 % --dbg_backtrace false
% 2.12/2.39 % --dbg_dump_prop_clauses false
% 2.12/2.39 % --dbg_dump_prop_clauses_file -
% 2.12/2.39 % --dbg_out_stat false
% 2.12/2.39
% 2.12/2.39 % ------ General Options
% 2.12/2.39
% 2.12/2.39 % --fof false
% 2.12/2.39 % --time_out_real 150.
% 2.12/2.39 % --time_out_prep_mult 0.2
% 2.12/2.39 % --time_out_virtual -1.
% 2.12/2.39 % --schedule none
% 2.12/2.39 % --ground_splitting input
% 2.12/2.39 % --splitting_nvd 16
% 2.12/2.39 % --non_eq_to_eq false
% 2.12/2.39 % --prep_gs_sim true
% 2.12/2.39 % --prep_unflatten false
% 2.12/2.39 % --prep_res_sim true
% 2.12/2.39 % --prep_upred true
% 2.12/2.39 % --res_sim_input true
% 2.12/2.39 % --clause_weak_htbl true
% 2.12/2.39 % --gc_record_bc_elim false
% 2.12/2.39 % --symbol_type_check false
% 2.12/2.39 % --clausify_out false
% 2.12/2.39 % --large_theory_mode false
% 2.12/2.39 % --prep_sem_filter none
% 2.12/2.39 % --prep_sem_filter_out false
% 2.12/2.39 % --preprocessed_out false
% 2.12/2.39 % --sub_typing false
% 2.12/2.39 % --brand_transform false
% 2.12/2.39 % --pure_diseq_elim true
% 2.12/2.39 % --min_unsat_core false
% 2.12/2.39 % --pred_elim true
% 2.12/2.39 % --add_important_lit false
% 2.12/2.39 % --soft_assumptions false
% 2.12/2.39 % --reset_solvers false
% 2.12/2.39 % --bc_imp_inh []
% 2.12/2.39 % --conj_cone_tolerance 1.5
% 2.12/2.39 % --prolific_symb_bound 500
% 2.12/2.39 % --lt_threshold 2000
% 2.12/2.39
% 2.12/2.39 % ------ SAT Options
% 2.12/2.39
% 2.12/2.39 % --sat_mode false
% 2.12/2.39 % --sat_fm_restart_options ""
% 2.12/2.39 % --sat_gr_def false
% 2.12/2.39 % --sat_epr_types true
% 2.12/2.39 % --sat_non_cyclic_types false
% 2.12/2.39 % --sat_finite_models false
% 2.12/2.39 % --sat_fm_lemmas false
% 2.12/2.39 % --sat_fm_prep false
% 2.12/2.39 % --sat_fm_uc_incr true
% 2.12/2.39 % --sat_out_model small
% 2.12/2.39 % --sat_out_clauses false
% 2.12/2.39
% 2.12/2.39 % ------ QBF Options
% 2.12/2.39
% 2.12/2.39 % --qbf_mode false
% 2.12/2.39 % --qbf_elim_univ true
% 2.12/2.39 % --qbf_sk_in true
% 2.12/2.39 % --qbf_pred_elim true
% 2.12/2.39 % --qbf_split 32
% 2.12/2.39
% 2.12/2.39 % ------ BMC1 Options
% 2.12/2.39
% 2.12/2.39 % --bmc1_incremental false
% 2.12/2.39 % --bmc1_axioms reachable_all
% 2.12/2.39 % --bmc1_min_bound 0
% 2.12/2.39 % --bmc1_max_bound -1
% 2.12/2.39 % --bmc1_max_bound_default -1
% 2.12/2.39 % --bmc1_symbol_reachability true
% 2.12/2.39 % --bmc1_property_lemmas false
% 2.12/2.39 % --bmc1_k_induction false
% 2.12/2.39 % --bmc1_non_equiv_states false
% 2.12/2.39 % --bmc1_deadlock false
% 2.12/2.39 % --bmc1_ucm false
% 2.12/2.39 % --bmc1_add_unsat_core none
% 2.12/2.39 % --bmc1_unsat_core_children false
% 2.12/2.39 % --bmc1_unsat_core_extrapolate_axioms false
% 2.12/2.39 % --bmc1_out_stat full
% 2.12/2.39 % --bmc1_ground_init false
% 2.12/2.39 % --bmc1_pre_inst_next_state false
% 2.12/2.39 % --bmc1_pre_inst_state false
% 2.12/2.39 % --bmc1_pre_inst_reach_state false
% 2.12/2.39 % --bmc1_out_unsat_core false
% 2.12/2.39 % --bmc1_aig_witness_out false
% 2.12/2.39 % --bmc1_verbose false
% 2.12/2.39 % --bmc1_dump_clauses_tptp false
% 2.12/2.39 % --bmc1_dump_unsat_core_tptp false
% 2.12/2.39 % --bmc1_dump_file -
% 2.12/2.39 % --bmc1_ucm_expand_uc_limit 128
% 2.12/2.39 % --bmc1_ucm_n_expand_iterations 6
% 2.12/2.39 % --bmc1_ucm_extend_mode 1
% 2.12/2.39 % --bmc1_ucm_init_mode 2
% 2.12/2.39 % --bmc1_ucm_cone_mode none
% 2.12/2.39 % --bmc1_ucm_reduced_relation_type 0
% 2.12/2.39 % --bmc1_ucm_relax_model 4
% 2.12/2.39 % --bmc1_ucm_full_tr_after_sat true
% 2.12/2.39 % --bmc1_ucm_expand_neg_assumptions false
% 2.12/2.39 % --bmc1_ucm_layered_model none
% 2.12/2.39 % --bmc1_ucm_max_lemma_size 10
% 2.12/2.39
% 2.12/2.39 % ------ AIG Options
% 2.12/2.39
% 2.12/2.39 % --aig_mode false
% 2.12/2.39
% 2.12/2.39 % ------ Instantiation Options
% 2.12/2.39
% 2.12/2.39 % --instantiation_flag true
% 2.12/2.39 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.12/2.39 % --inst_solver_per_active 750
% 2.12/2.39 % --inst_solver_calls_frac 0.5
% 2.12/2.39 % --inst_passive_queue_type priority_queues
% 2.12/2.39 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.12/2.39 % --inst_passive_queues_freq [25;2]
% 2.12/2.39 % --inst_dismatching true
% 2.12/2.39 % --inst_eager_unprocessed_to_passive true
% 2.12/2.39 % --inst_prop_sim_given true
% 3.05/3.24 % --inst_prop_sim_new false
% 3.05/3.24 % --inst_orphan_elimination true
% 3.05/3.24 % --inst_learning_loop_flag true
% 3.05/3.24 % --inst_learning_start 3000
% 3.05/3.24 % --inst_learning_factor 2
% 3.05/3.24 % --inst_start_prop_sim_after_learn 3
% 3.05/3.24 % --inst_sel_renew solver
% 3.05/3.24 % --inst_lit_activity_flag true
% 3.05/3.24 % --inst_out_proof true
% 3.05/3.24
% 3.05/3.24 % ------ Resolution Options
% 3.05/3.24
% 3.05/3.24 % --resolution_flag true
% 3.05/3.24 % --res_lit_sel kbo_max
% 3.05/3.24 % --res_to_prop_solver none
% 3.05/3.24 % --res_prop_simpl_new false
% 3.05/3.24 % --res_prop_simpl_given false
% 3.05/3.24 % --res_passive_queue_type priority_queues
% 3.05/3.24 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.05/3.24 % --res_passive_queues_freq [15;5]
% 3.05/3.24 % --res_forward_subs full
% 3.05/3.24 % --res_backward_subs full
% 3.05/3.24 % --res_forward_subs_resolution true
% 3.05/3.24 % --res_backward_subs_resolution true
% 3.05/3.24 % --res_orphan_elimination false
% 3.05/3.24 % --res_time_limit 1000.
% 3.05/3.24 % --res_out_proof true
% 3.05/3.24 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_9940ce.s
% 3.05/3.24 % --modulo true
% 3.05/3.24
% 3.05/3.24 % ------ Combination Options
% 3.05/3.24
% 3.05/3.24 % --comb_res_mult 1000
% 3.05/3.24 % --comb_inst_mult 300
% 3.05/3.24 % ------
% 3.05/3.24
% 3.05/3.24
% 3.05/3.24
% 3.05/3.24 % ------ Proving...
% 3.05/3.24 % warning: shown sat in sat incomplete mode
% 3.05/3.24 %
% 3.05/3.24
% 3.05/3.24
% 3.05/3.24 ------ Building Model...Done
% 3.05/3.24
% 3.05/3.24 %------ The model is defined over ground terms (initial term algebra).
% 3.05/3.24 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.05/3.24 %------ where \phi is a formula over the term algebra.
% 3.05/3.24 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.05/3.24 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.05/3.24 %------ See help for --sat_out_model for different model outputs.
% 3.05/3.24 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.05/3.24 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.05/3.24
% 3.05/3.24
% 3.05/3.24
% 3.05/3.24
% 3.05/3.24 %------ Negative definition of equality_sorted
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0,X0,X1] :
% 3.05/3.24 ( ~(equality_sorted(X0,X0,X1)) <=>
% 3.05/3.24 (
% 3.05/3.24 (
% 3.05/3.24 ( X0=$i & X0=age(sk3,sk6) & X1=tau )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=$i & X0=age(sk3,sk4) & X1=tau )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 ? [X2] :
% 3.05/3.24 (
% 3.05/3.24 ( X0=$i & X0=age(sk3,X2) & X1=zero )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk4 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 ? [X2] :
% 3.05/3.24 (
% 3.05/3.24 ( X0=$i & X0=age(sk3,X2) & X1=tau )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk5 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24 %------ Positive definition of greater
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0,X1] :
% 3.05/3.24 ( greater(X0,X1) <=>
% 3.05/3.24 (
% 3.05/3.24 (
% 3.05/3.24 ( X0=high & X1=mod1 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=high & X1=low )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=high & X1=very_low )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=high & X1=mod2 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=mod1 & X1=low )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=mod1 & X1=very_low )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=low & X1=very_low )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=mod2 & X1=mod1 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=mod2 & X1=low )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=mod2 & X1=very_low )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=tau & X1=zero )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=sigma & X1=zero )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=sigma & X1=tau )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk7) & X1=zero )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk7) & X1=tau )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk7) & X1=sigma )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk6) & X1=zero )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk6) & X1=tau )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk4) & X1=tau )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk2(sk3)) & X1=zero )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk2(sk3)) & X1=tau )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk2(sk3)) & X1=sigma )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 ? [X2] :
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,X2) & X1=zero )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 ? [X2] :
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,X2) & X1=tau )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk5 )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk4 )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk2(sk3) )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 ? [X2] :
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,X2) & X1=sigma )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk5 )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk4 )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk2(sk3) )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24 %------ Positive definition of has_endowment
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0] :
% 3.05/3.24 ( has_endowment(X0) <=>
% 3.05/3.24 $false
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24 %------ Positive definition of organization
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0] :
% 3.05/3.24 ( organization(X0) <=>
% 3.05/3.24 (
% 3.05/3.24 (
% 3.05/3.24 ( X0=sk3 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24 %------ Positive definition of smaller_or_equal
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0,X1] :
% 3.05/3.24 ( smaller_or_equal(X0,X1) <=>
% 3.05/3.24 (
% 3.05/3.24 (
% 3.05/3.24 ( X0!=age(sk3,sk6) | X1!=tau )
% 3.05/3.24 &
% 3.05/3.24 ( X0!=age(sk3,sk4) | X1!=tau )
% 3.05/3.24 &
% 3.05/3.24 ( X0!=age(sk3,X0) | X1!=zero )
% 3.05/3.24 &
% 3.05/3.24 ( X0!=age(sk3,X0) | X1!=tau )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk6) & X1=sigma )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk5) & X1=tau )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk4) & X1=zero )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=age(sk3,sk1(sk3)) & X1=eta )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24 %------ Negative definition of greater_or_equal
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0,X1] :
% 3.05/3.24 ( ~(greater_or_equal(X0,X1)) <=>
% 3.05/3.24 $false
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24 %------ Positive definition of smaller
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0,X1] :
% 3.05/3.24 ( smaller(X0,X1) <=>
% 3.05/3.24 (
% 3.05/3.24 (
% 3.05/3.24 ( X0=mod1 & X1=high )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=mod1 & X1=mod2 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=low & X1=high )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=low & X1=mod1 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=low & X1=mod2 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=very_low & X1=high )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=very_low & X1=mod1 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=very_low & X1=low )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=very_low & X1=mod2 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=mod2 & X1=high )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=zero & X1=tau )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=zero & X1=sigma )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=zero & X1=age(sk3,sk7) )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=zero & X1=age(sk3,sk6) )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 ? [X2] :
% 3.05/3.24 (
% 3.05/3.24 ( X0=zero & X1=age(sk3,X2) )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk7 )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk6 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=tau & X1=sigma )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=tau & X1=age(sk3,sk7) )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=tau & X1=age(sk3,sk6) )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=tau & X1=age(sk3,sk4) )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=tau & X1=age(sk3,sk2(sk3)) )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 ? [X2] :
% 3.05/3.24 (
% 3.05/3.24 ( X0=tau & X1=age(sk3,X2) )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk5 )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk4 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=sigma & X1=age(sk3,sk7) )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=sigma & X1=age(sk3,sk2(sk3)) )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 ? [X2] :
% 3.05/3.24 (
% 3.05/3.24 ( X0=sigma & X1=age(sk3,X2) )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk5 )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk4 )
% 3.05/3.24 &
% 3.05/3.24 ( X2!=sk2(sk3) )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24 %------ Positive definition of has_immunity
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0,X1] :
% 3.05/3.24 ( has_immunity(X0,X1) <=>
% 3.05/3.24 $false
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24 %------ Positive definition of is_aligned
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0,X1] :
% 3.05/3.24 ( is_aligned(X0,X1) <=>
% 3.05/3.24 (
% 3.05/3.24 (
% 3.05/3.24 ( X0=sk3 & X1=sk5 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=sk3 & X1=sk4 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24 %------ Negative definition of positional_advantage
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0,X1] :
% 3.05/3.24 ( ~(positional_advantage(X0,X1)) <=>
% 3.05/3.24 (
% 3.05/3.24 (
% 3.05/3.24 ( X0!=sk3 )
% 3.05/3.24 &
% 3.05/3.24 ( X0!=sk3 | X1!=sk4 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=sk3 & X1=sk5 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X1=sk2(X0) )
% 3.05/3.24 &
% 3.05/3.24 ( X0!=sk3 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24 %------ Negative definition of robust_position
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0] :
% 3.05/3.24 ( ~(robust_position(X0)) <=>
% 3.05/3.24 $false
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24 %------ Negative definition of dissimilar
% 3.05/3.24 fof(lit_def,axiom,
% 3.05/3.24 (! [X0,X1,X2] :
% 3.05/3.24 ( ~(dissimilar(X0,X1,X2)) <=>
% 3.05/3.24 (
% 3.05/3.24 (
% 3.05/3.24 ( X0!=sk3 | X1!=sk5 )
% 3.05/3.24 &
% 3.05/3.24 ( X0!=sk3 | X1!=sk4 )
% 3.05/3.24 &
% 3.05/3.24 ( X0!=sk3 | X2!=sk5 )
% 3.05/3.24 &
% 3.05/3.24 ( X0!=sk3 | X2!=sk4 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=sk3 & X1=sk5 & X2=sk5 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=sk3 & X1=sk5 & X2=sk4 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=sk3 & X1=sk4 & X2=sk5 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 |
% 3.05/3.24 (
% 3.05/3.24 ( X0=sk3 & X1=sk4 & X2=sk4 )
% 3.05/3.24 )
% 3.05/3.24
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 )
% 3.05/3.24 ).
% 3.05/3.24
% 3.05/3.24
% 3.05/3.24
% 3.05/3.24 % ------ Statistics
% 3.05/3.24
% 3.05/3.24 % ------ General
% 3.05/3.24
% 3.05/3.24 % num_of_input_clauses: 147
% 3.05/3.24 % num_of_input_neg_conjectures: 12
% 3.05/3.24 % num_of_splits: 0
% 3.05/3.24 % num_of_split_atoms: 0
% 3.05/3.24 % num_of_sem_filtered_clauses: 0
% 3.05/3.24 % num_of_subtypes: 0
% 3.05/3.24 % monotx_restored_types: 0
% 3.05/3.24 % sat_num_of_epr_types: 0
% 3.05/3.24 % sat_num_of_non_cyclic_types: 0
% 3.05/3.24 % sat_guarded_non_collapsed_types: 0
% 3.05/3.24 % is_epr: 0
% 3.05/3.24 % is_horn: 0
% 3.05/3.24 % has_eq: 1
% 3.05/3.24 % num_pure_diseq_elim: 0
% 3.05/3.24 % simp_replaced_by: 0
% 3.05/3.24 % res_preprocessed: 24
% 3.05/3.24 % prep_upred: 0
% 3.05/3.24 % prep_unflattend: 0
% 3.05/3.24 % pred_elim_cands: 0
% 3.05/3.24 % pred_elim: 0
% 3.05/3.24 % pred_elim_cl: 0
% 3.05/3.24 % pred_elim_cycles: 0
% 3.05/3.24 % forced_gc_time: 0
% 3.05/3.24 % gc_basic_clause_elim: 0
% 3.05/3.24 % parsing_time: 0.003
% 3.05/3.24 % sem_filter_time: 0.
% 3.05/3.24 % pred_elim_time: 0.
% 3.05/3.24 % out_proof_time: 0.
% 3.05/3.24 % monotx_time: 0.
% 3.05/3.24 % subtype_inf_time: 0.
% 3.05/3.24 % unif_index_cands_time: 0.003
% 3.05/3.24 % unif_index_add_time: 0.001
% 3.05/3.24 % total_time: 0.865
% 3.05/3.24 % num_of_symbols: 54
% 3.05/3.24 % num_of_terms: 1220
% 3.05/3.24
% 3.05/3.24 % ------ Propositional Solver
% 3.05/3.24
% 3.05/3.24 % prop_solver_calls: 13
% 3.05/3.24 % prop_fast_solver_calls: 42
% 3.05/3.24 % prop_num_of_clauses: 475
% 3.05/3.24 % prop_preprocess_simplified: 1291
% 3.05/3.24 % prop_fo_subsumed: 0
% 3.05/3.24 % prop_solver_time: 0.
% 3.05/3.24 % prop_fast_solver_time: 0.
% 3.05/3.24 % prop_unsat_core_time: 0.
% 3.05/3.24
% 3.05/3.24 % ------ QBF
% 3.05/3.24
% 3.05/3.24 % qbf_q_res: 0
% 3.05/3.24 % qbf_num_tautologies: 0
% 3.05/3.24 % qbf_prep_cycles: 0
% 3.05/3.24
% 3.05/3.24 % ------ BMC1
% 3.05/3.24
% 3.05/3.24 % bmc1_current_bound: -1
% 3.05/3.24 % bmc1_last_solved_bound: -1
% 3.05/3.24 % bmc1_unsat_core_size: -1
% 3.05/3.24 % bmc1_unsat_core_parents_size: -1
% 3.05/3.24 % bmc1_merge_next_fun: 0
% 3.05/3.24 % bmc1_unsat_core_clauses_time: 0.
% 3.05/3.24
% 3.05/3.24 % ------ Instantiation
% 3.05/3.24
% 3.05/3.24 % inst_num_of_clauses: 446
% 3.05/3.24 % inst_num_in_passive: 0
% 3.05/3.24 % inst_num_in_active: 429
% 3.05/3.24 % inst_num_in_unprocessed: 0
% 3.05/3.24 % inst_num_of_loops: 514
% 3.05/3.24 % inst_num_of_learning_restarts: 0
% 3.05/3.24 % inst_num_moves_active_passive: 56
% 3.05/3.24 % inst_lit_activity: 57
% 3.05/3.24 % inst_lit_activity_moves: 0
% 3.05/3.24 % inst_num_tautologies: 17
% 3.05/3.24 % inst_num_prop_implied: 0
% 3.05/3.24 % inst_num_existing_simplified: 0
% 3.05/3.24 % inst_num_eq_res_simplified: 0
% 3.05/3.24 % inst_num_child_elim: 0
% 3.05/3.24 % inst_num_of_dismatching_blockings: 66
% 3.05/3.24 % inst_num_of_non_proper_insts: 854
% 3.05/3.24 % inst_num_of_duplicates: 277
% 3.05/3.24 % inst_inst_num_from_inst_to_res: 0
% 3.05/3.24 % inst_dismatching_checking_time: 0.
% 3.05/3.24
% 3.05/3.24 % ------ Resolution
% 3.05/3.24
% 3.05/3.24 % res_num_of_clauses: 8070
% 3.05/3.24 % res_num_in_passive: 7299
% 3.05/3.24 % res_num_in_active: 873
% 3.05/3.24 % res_num_of_loops: 2000
% 3.05/3.24 % res_forward_subset_subsumed: 24984
% 3.05/3.24 % res_backward_subset_subsumed: 452
% 3.05/3.24 % res_forward_subsumed: 1102
% 3.05/3.24 % res_backward_subsumed: 33
% 3.05/3.24 % res_forward_subsumption_resolution: 34
% 3.05/3.24 % res_backward_subsumption_resolution: 2
% 3.05/3.24 % res_clause_to_clause_subsumption: 32203
% 3.05/3.24 % res_orphan_elimination: 0
% 3.05/3.24 % res_tautology_del: 419
% 3.05/3.24 % res_num_eq_res_simplified: 0
% 3.05/3.24 % res_num_sel_changes: 0
% 3.05/3.24 % res_moves_from_active_to_pass: 0
% 3.05/3.24
% 3.05/3.24 % Status Unknown
% 3.05/3.24 % Last status :
% 3.05/3.24 % SZS status Unknown
%------------------------------------------------------------------------------