TSTP Solution File: MGT063+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT063+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n020.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 2.14s 2.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : MGT063+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 09:22:36 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.13/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.40 % FOF problem with conjecture
% 0.13/0.40 % 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_5ce578.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_b9bfb0.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_c6e9ab | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5ce578.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ 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.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn false
% 0.20/0.43 % Has equality true
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 1.31/1.47 % --inst_prop_sim_new false
% 1.31/1.47 % --inst_orphan_elimination true
% 1.31/1.47 % --inst_learning_loop_flag true
% 1.31/1.47 % --inst_learning_start 3000
% 1.31/1.47 % --inst_learning_factor 2
% 1.31/1.47 % --inst_start_prop_sim_after_learn 3
% 1.31/1.47 % --inst_sel_renew solver
% 1.31/1.47 % --inst_lit_activity_flag true
% 1.31/1.47 % --inst_out_proof true
% 1.31/1.47
% 1.31/1.47 % ------ Resolution Options
% 1.31/1.47
% 1.31/1.47 % --resolution_flag true
% 1.31/1.47 % --res_lit_sel kbo_max
% 1.31/1.47 % --res_to_prop_solver none
% 1.31/1.47 % --res_prop_simpl_new false
% 1.31/1.47 % --res_prop_simpl_given false
% 1.31/1.47 % --res_passive_queue_type priority_queues
% 1.31/1.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.31/1.47 % --res_passive_queues_freq [15;5]
% 1.31/1.47 % --res_forward_subs full
% 1.31/1.47 % --res_backward_subs full
% 1.31/1.47 % --res_forward_subs_resolution true
% 1.31/1.47 % --res_backward_subs_resolution true
% 1.31/1.47 % --res_orphan_elimination false
% 1.31/1.47 % --res_time_limit 1000.
% 1.31/1.47 % --res_out_proof true
% 1.31/1.47 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5ce578.s
% 1.31/1.47 % --modulo true
% 1.31/1.47
% 1.31/1.47 % ------ Combination Options
% 1.31/1.47
% 1.31/1.47 % --comb_res_mult 1000
% 1.31/1.47 % --comb_inst_mult 300
% 1.31/1.47 % ------
% 1.31/1.47
% 1.31/1.47
% 1.31/1.47
% 1.31/1.47 % ------ Proving...
% 1.31/1.47 % warning: shown sat in sat incomplete mode
% 1.31/1.47 %
% 1.31/1.47
% 1.31/1.47
% 1.31/1.47 ------ Building Model...Done
% 1.31/1.47
% 1.31/1.47 %------ The model is defined over ground terms (initial term algebra).
% 1.31/1.47 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.31/1.47 %------ where \phi is a formula over the term algebra.
% 1.31/1.47 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.31/1.47 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.31/1.47 %------ See help for --sat_out_model for different model outputs.
% 1.31/1.47 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.31/1.47 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.31/1.47
% 1.31/1.47
% 1.31/1.47
% 1.31/1.47
% 1.31/1.47 %------ Negative definition of equality_sorted
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0,X0,X1] :
% 1.31/1.47 ( ~(equality_sorted(X0,X0,X1)) <=>
% 1.31/1.47 (
% 1.31/1.47 ? [X2] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=$i & X0=age(sk3_esk1_0,X2) & X1=zero )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2,X3] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=$i & X0=age(X2,X3) & X1=zero )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2,X3] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=$i & X0=age(X2,X3) & X1=tau )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk2_0 )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk4_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Positive definition of greater
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0,X1] :
% 1.31/1.47 ( greater(X0,X1) <=>
% 1.31/1.47 (
% 1.31/1.47 (
% 1.31/1.47 ( X0=sigma & X1=zero )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=high & X1=mod1 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=high & X1=low )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=high & X1=very_low )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=high & X1=mod2 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=mod1 & X1=low )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=mod1 & X1=very_low )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=low & X1=very_low )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=mod2 & X1=mod1 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=mod2 & X1=low )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=mod2 & X1=very_low )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=tau & X1=zero )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=tau & X1=sigma )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(sk3_esk1_0,sk3_esk4_0) & X1=zero )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(sk3_esk1_0,sk3_esk4_0) & X1=sigma )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(sk3_esk1_0,sk3_esk5_0) & X1=zero )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(sk3_esk1_0,sk3_esk5_0) & X1=sigma )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(sk3_esk1_0,sk3_esk5_0) & X1=tau )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(sk3_esk1_0,sk3_esk5_0) & X1=age(sk3_esk1_0,sk3_esk2_0) )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(sk3_esk1_0,X2) & X1=zero )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(sk3_esk1_0,X2) & X1=sigma )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2,X3] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(X2,X3) & X1=zero )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2,X3] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(X2,X3) & X1=sigma )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2,X3] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(X2,X3) & X1=tau )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk2_0 )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk4_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Positive definition of organization
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0] :
% 1.31/1.47 ( organization(X0) <=>
% 1.31/1.47 $true
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Negative definition of dissimilar
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0,X1,X2] :
% 1.31/1.47 ( ~(dissimilar(X0,X1,X2)) <=>
% 1.31/1.47 (
% 1.31/1.47 (
% 1.31/1.47 ( X0!=sk3_esk1_0 | X1!=sk3_esk2_0 )
% 1.31/1.47 &
% 1.31/1.47 ( X0!=sk3_esk1_0 | X2!=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 & X2=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Positive definition of smaller
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0,X1] :
% 1.31/1.47 ( smaller(X0,X1) <=>
% 1.31/1.47 (
% 1.31/1.47 (
% 1.31/1.47 ( X0=zero & X1=sigma )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=zero & X1=tau )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=zero & X1=age(sk3_esk1_0,sk3_esk4_0) )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=zero & X1=age(sk3_esk1_0,sk3_esk5_0) )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2,X3] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=zero & X1=age(X2,X3) )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk2_0 )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk4_0 )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk5_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=sigma & X1=tau )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=sigma & X1=age(sk3_esk1_0,sk3_esk4_0) )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=sigma & X1=age(sk3_esk1_0,X2) )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2,X3] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=sigma & X1=age(X2,X3) )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=mod1 & X1=high )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=mod1 & X1=mod2 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=low & X1=high )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=low & X1=mod1 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=low & X1=mod2 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=very_low & X1=high )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=very_low & X1=mod1 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=very_low & X1=low )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=very_low & X1=mod2 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=mod2 & X1=high )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=tau & X1=age(sk3_esk1_0,sk3_esk5_0) )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2,X3] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=tau & X1=age(X2,X3) )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk2_0 )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk4_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(sk3_esk1_0,sk3_esk2_0) & X1=age(sk3_esk1_0,sk3_esk5_0) )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Positive definition of has_endowment
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0] :
% 1.31/1.47 ( has_endowment(X0) <=>
% 1.31/1.47 $false
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Negative definition of smaller_or_equal
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0,X1] :
% 1.31/1.47 ( ~(smaller_or_equal(X0,X1)) <=>
% 1.31/1.47 (
% 1.31/1.47 ? [X2,X3] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(X2,X3) & X1=zero )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 ? [X2,X3] :
% 1.31/1.47 (
% 1.31/1.47 ( X0=age(X2,X3) & X1=tau )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk2_0 )
% 1.31/1.47 &
% 1.31/1.47 ( X2!=sk3_esk1_0 | X3!=sk3_esk4_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Negative definition of greater_or_equal
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0,X1] :
% 1.31/1.47 ( ~(greater_or_equal(X0,X1)) <=>
% 1.31/1.47 $false
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Positive definition of has_immunity
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0,X1] :
% 1.31/1.47 ( has_immunity(X0,X1) <=>
% 1.31/1.47 $false
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Negative definition of epred1_2
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0,X1] :
% 1.31/1.47 ( ~(epred1_2(X0,X1)) <=>
% 1.31/1.47 $false
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Positive definition of is_aligned
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0,X1] :
% 1.31/1.47 ( is_aligned(X0,X1) <=>
% 1.31/1.47 (
% 1.31/1.47 (
% 1.31/1.47 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Positive definition of robust_position
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0] :
% 1.31/1.47 ( robust_position(X0) <=>
% 1.31/1.47 $true
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47 %------ Negative definition of positional_advantage
% 1.31/1.47 fof(lit_def,axiom,
% 1.31/1.47 (! [X0,X1] :
% 1.31/1.47 ( ~(positional_advantage(X0,X1)) <=>
% 1.31/1.47 (
% 1.31/1.47 (
% 1.31/1.47 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 |
% 1.31/1.47 (
% 1.31/1.47 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 )
% 1.31/1.47 )
% 1.31/1.47
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 )
% 1.31/1.47 ).
% 1.31/1.47
% 1.31/1.47
% 1.31/1.47
% 1.31/1.47 % ------ Statistics
% 1.31/1.47
% 1.31/1.47 % ------ General
% 1.31/1.47
% 1.31/1.47 % num_of_input_clauses: 66
% 1.31/1.47 % num_of_input_neg_conjectures: 12
% 1.31/1.47 % num_of_splits: 0
% 1.31/1.47 % num_of_split_atoms: 0
% 1.31/1.47 % num_of_sem_filtered_clauses: 0
% 1.31/1.47 % num_of_subtypes: 0
% 1.31/1.47 % monotx_restored_types: 0
% 1.31/1.47 % sat_num_of_epr_types: 0
% 1.31/1.47 % sat_num_of_non_cyclic_types: 0
% 1.31/1.47 % sat_guarded_non_collapsed_types: 0
% 1.31/1.47 % is_epr: 0
% 1.31/1.47 % is_horn: 0
% 1.31/1.47 % has_eq: 1
% 1.31/1.47 % num_pure_diseq_elim: 0
% 1.31/1.47 % simp_replaced_by: 0
% 1.31/1.47 % res_preprocessed: 24
% 1.31/1.47 % prep_upred: 0
% 1.31/1.47 % prep_unflattend: 0
% 1.31/1.47 % pred_elim_cands: 0
% 1.31/1.47 % pred_elim: 0
% 1.31/1.47 % pred_elim_cl: 0
% 1.31/1.47 % pred_elim_cycles: 0
% 1.31/1.47 % forced_gc_time: 0
% 1.31/1.47 % gc_basic_clause_elim: 0
% 1.31/1.47 % parsing_time: 0.002
% 1.31/1.47 % sem_filter_time: 0.
% 1.31/1.47 % pred_elim_time: 0.
% 1.31/1.47 % out_proof_time: 0.
% 1.31/1.47 % monotx_time: 0.
% 1.31/1.47 % subtype_inf_time: 0.
% 1.31/1.47 % unif_index_cands_time: 0.003
% 1.31/1.47 % unif_index_add_time: 0.002
% 1.31/1.47 % total_time: 1.066
% 1.31/1.47 % num_of_symbols: 57
% 1.31/1.47 % num_of_terms: 1669
% 1.31/1.47
% 1.31/1.47 % ------ Propositional Solver
% 1.31/1.47
% 1.31/1.47 % prop_solver_calls: 12
% 1.31/1.47 % prop_fast_solver_calls: 42
% 1.31/1.47 % prop_num_of_clauses: 316
% 1.31/1.47 % prop_preprocess_simplified: 646
% 1.31/1.47 % prop_fo_subsumed: 0
% 1.31/1.47 % prop_solver_time: 0.
% 1.31/1.47 % prop_fast_solver_time: 0.
% 1.31/1.47 % prop_unsat_core_time: 0.
% 1.31/1.47
% 1.31/1.47 % ------ QBF
% 1.31/1.47
% 1.31/1.47 % qbf_q_res: 0
% 1.31/1.47 % qbf_num_tautologies: 0
% 1.31/1.47 % qbf_prep_cycles: 0
% 1.31/1.47
% 1.31/1.47 % ------ BMC1
% 1.31/1.47
% 1.31/1.47 % bmc1_current_bound: -1
% 1.31/1.47 % bmc1_last_solved_bound: -1
% 1.31/1.47 % bmc1_unsat_core_size: -1
% 1.31/1.47 % bmc1_unsat_core_parents_size: -1
% 1.31/1.47 % bmc1_merge_next_fun: 0
% 1.31/1.47 % bmc1_unsat_core_clauses_time: 0.
% 1.31/1.47
% 1.31/1.47 % ------ Instantiation
% 1.31/1.47
% 1.31/1.47 % inst_num_of_clauses: 262
% 1.31/1.47 % inst_num_in_passive: 0
% 1.31/1.47 % inst_num_in_active: 256
% 1.31/1.47 % inst_num_in_unprocessed: 0
% 1.31/1.47 % inst_num_of_loops: 307
% 1.31/1.47 % inst_num_of_learning_restarts: 0
% 1.31/1.47 % inst_num_moves_active_passive: 33
% 1.31/1.47 % inst_lit_activity: 39
% 1.31/1.47 % inst_lit_activity_moves: 0
% 1.31/1.47 % inst_num_tautologies: 6
% 1.31/1.47 % inst_num_prop_implied: 0
% 1.31/1.47 % inst_num_existing_simplified: 0
% 1.31/1.47 % inst_num_eq_res_simplified: 0
% 1.31/1.47 % inst_num_child_elim: 0
% 1.31/1.47 % inst_num_of_dismatching_blockings: 18
% 1.31/1.47 % inst_num_of_non_proper_insts: 385
% 1.31/1.47 % inst_num_of_duplicates: 58
% 1.31/1.47 % inst_inst_num_from_inst_to_res: 0
% 1.31/1.47 % inst_dismatching_checking_time: 0.
% 1.31/1.47
% 1.31/1.47 % ------ Resolution
% 1.31/1.47
% 1.31/1.47 % res_num_of_clauses: 3761
% 1.31/1.47 % res_num_in_passive: 2152
% 1.31/1.47 % res_num_in_active: 1573
% 1.31/1.47 % res_num_of_loops: 2000
% 1.31/1.47 % res_forward_subset_subsumed: 2010
% 1.31/1.47 % res_backward_subset_subsumed: 0
% 1.31/1.47 % res_forward_subsumed: 449
% 1.31/1.47 % res_backward_subsumed: 17
% 1.31/1.47 % res_forward_subsumption_resolution: 23
% 1.31/1.47 % res_backward_subsumption_resolution: 0
% 1.31/1.47 % res_clause_to_clause_subsumption: 110631
% 1.31/1.47 % res_orphan_elimination: 0
% 1.31/1.47 % res_tautology_del: 4
% 1.31/1.47 % res_num_eq_res_simplified: 0
% 1.31/1.47 % res_num_sel_changes: 0
% 1.31/1.47 % res_moves_from_active_to_pass: 0
% 1.31/1.47
% 1.31/1.47 % Status Unknown
% 1.33/1.51 % Orienting using strategy ClausalAll
% 1.33/1.51 % FOF problem with conjecture
% 1.33/1.51 % 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_5ce578.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_b9bfb0.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_1ea887 | grep -v "SZS"
% 1.37/1.53
% 1.37/1.53 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.37/1.53
% 1.37/1.53 %
% 1.37/1.53 % ------ iProver source info
% 1.37/1.53
% 1.37/1.53 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.37/1.53 % git: non_committed_changes: true
% 1.37/1.53 % git: last_make_outside_of_git: true
% 1.37/1.53
% 1.37/1.53 %
% 1.37/1.53 % ------ Input Options
% 1.37/1.53
% 1.37/1.53 % --out_options all
% 1.37/1.53 % --tptp_safe_out true
% 1.37/1.53 % --problem_path ""
% 1.37/1.53 % --include_path ""
% 1.37/1.53 % --clausifier .//eprover
% 1.37/1.53 % --clausifier_options --tstp-format
% 1.37/1.53 % --stdin false
% 1.37/1.53 % --dbg_backtrace false
% 1.37/1.53 % --dbg_dump_prop_clauses false
% 1.37/1.53 % --dbg_dump_prop_clauses_file -
% 1.37/1.53 % --dbg_out_stat false
% 1.37/1.53
% 1.37/1.53 % ------ General Options
% 1.37/1.53
% 1.37/1.53 % --fof false
% 1.37/1.53 % --time_out_real 150.
% 1.37/1.53 % --time_out_prep_mult 0.2
% 1.37/1.53 % --time_out_virtual -1.
% 1.37/1.53 % --schedule none
% 1.37/1.53 % --ground_splitting input
% 1.37/1.53 % --splitting_nvd 16
% 1.37/1.53 % --non_eq_to_eq false
% 1.37/1.53 % --prep_gs_sim true
% 1.37/1.53 % --prep_unflatten false
% 1.37/1.53 % --prep_res_sim true
% 1.37/1.53 % --prep_upred true
% 1.37/1.53 % --res_sim_input true
% 1.37/1.53 % --clause_weak_htbl true
% 1.37/1.53 % --gc_record_bc_elim false
% 1.37/1.53 % --symbol_type_check false
% 1.37/1.53 % --clausify_out false
% 1.37/1.53 % --large_theory_mode false
% 1.37/1.53 % --prep_sem_filter none
% 1.37/1.53 % --prep_sem_filter_out false
% 1.37/1.53 % --preprocessed_out false
% 1.37/1.53 % --sub_typing false
% 1.37/1.53 % --brand_transform false
% 1.37/1.53 % --pure_diseq_elim true
% 1.37/1.53 % --min_unsat_core false
% 1.37/1.53 % --pred_elim true
% 1.37/1.53 % --add_important_lit false
% 1.37/1.53 % --soft_assumptions false
% 1.37/1.53 % --reset_solvers false
% 1.37/1.53 % --bc_imp_inh []
% 1.37/1.53 % --conj_cone_tolerance 1.5
% 1.37/1.53 % --prolific_symb_bound 500
% 1.37/1.53 % --lt_threshold 2000
% 1.37/1.53
% 1.37/1.53 % ------ SAT Options
% 1.37/1.53
% 1.37/1.53 % --sat_mode false
% 1.37/1.53 % --sat_fm_restart_options ""
% 1.37/1.53 % --sat_gr_def false
% 1.37/1.53 % --sat_epr_types true
% 1.37/1.53 % --sat_non_cyclic_types false
% 1.37/1.53 % --sat_finite_models false
% 1.37/1.53 % --sat_fm_lemmas false
% 1.37/1.53 % --sat_fm_prep false
% 1.37/1.53 % --sat_fm_uc_incr true
% 1.37/1.53 % --sat_out_model small
% 1.37/1.53 % --sat_out_clauses false
% 1.37/1.53
% 1.37/1.53 % ------ QBF Options
% 1.37/1.53
% 1.37/1.53 % --qbf_mode false
% 1.37/1.53 % --qbf_elim_univ true
% 1.37/1.53 % --qbf_sk_in true
% 1.37/1.53 % --qbf_pred_elim true
% 1.37/1.53 % --qbf_split 32
% 1.37/1.53
% 1.37/1.53 % ------ BMC1 Options
% 1.37/1.53
% 1.37/1.53 % --bmc1_incremental false
% 1.37/1.53 % --bmc1_axioms reachable_all
% 1.37/1.53 % --bmc1_min_bound 0
% 1.37/1.53 % --bmc1_max_bound -1
% 1.37/1.53 % --bmc1_max_bound_default -1
% 1.37/1.53 % --bmc1_symbol_reachability true
% 1.37/1.53 % --bmc1_property_lemmas false
% 1.37/1.53 % --bmc1_k_induction false
% 1.37/1.53 % --bmc1_non_equiv_states false
% 1.37/1.53 % --bmc1_deadlock false
% 1.37/1.53 % --bmc1_ucm false
% 1.37/1.53 % --bmc1_add_unsat_core none
% 1.37/1.53 % --bmc1_unsat_core_children false
% 1.37/1.53 % --bmc1_unsat_core_extrapolate_axioms false
% 1.37/1.53 % --bmc1_out_stat full
% 1.37/1.53 % --bmc1_ground_init false
% 1.37/1.53 % --bmc1_pre_inst_next_state false
% 1.37/1.53 % --bmc1_pre_inst_state false
% 1.37/1.53 % --bmc1_pre_inst_reach_state false
% 1.37/1.53 % --bmc1_out_unsat_core false
% 1.37/1.53 % --bmc1_aig_witness_out false
% 1.37/1.53 % --bmc1_verbose false
% 1.37/1.53 % --bmc1_dump_clauses_tptp false
% 1.37/1.53 % --bmc1_dump_unsat_core_tptp false
% 1.37/1.53 % --bmc1_dump_file -
% 1.37/1.53 % --bmc1_ucm_expand_uc_limit 128
% 1.37/1.53 % --bmc1_ucm_n_expand_iterations 6
% 1.37/1.53 % --bmc1_ucm_extend_mode 1
% 1.37/1.53 % --bmc1_ucm_init_mode 2
% 1.37/1.53 % --bmc1_ucm_cone_mode none
% 1.37/1.53 % --bmc1_ucm_reduced_relation_type 0
% 1.37/1.53 % --bmc1_ucm_relax_model 4
% 1.37/1.53 % --bmc1_ucm_full_tr_after_sat true
% 1.37/1.53 % --bmc1_ucm_expand_neg_assumptions false
% 1.37/1.53 % --bmc1_ucm_layered_model none
% 1.37/1.53 % --bmc1_ucm_max_lemma_size 10
% 1.37/1.53
% 1.37/1.53 % ------ AIG Options
% 1.37/1.53
% 1.37/1.53 % --aig_mode false
% 1.37/1.53
% 1.37/1.53 % ------ Instantiation Options
% 1.37/1.53
% 1.37/1.53 % --instantiation_flag true
% 1.37/1.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.37/1.53 % --inst_solver_per_active 750
% 1.37/1.53 % --inst_solver_calls_frac 0.5
% 1.37/1.53 % --inst_passive_queue_type priority_queues
% 1.37/1.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.37/1.53 % --inst_passive_queues_freq [25;2]
% 1.37/1.53 % --inst_dismatching true
% 1.37/1.53 % --inst_eager_unprocessed_to_passive true
% 1.37/1.53 % --inst_prop_sim_given true
% 1.37/1.53 % --inst_prop_sim_new false
% 1.37/1.53 % --inst_orphan_elimination true
% 1.37/1.53 % --inst_learning_loop_flag true
% 1.37/1.53 % --inst_learning_start 3000
% 1.37/1.53 % --inst_learning_factor 2
% 1.37/1.53 % --inst_start_prop_sim_after_learn 3
% 1.37/1.53 % --inst_sel_renew solver
% 1.37/1.53 % --inst_lit_activity_flag true
% 1.37/1.53 % --inst_out_proof true
% 1.37/1.53
% 1.37/1.53 % ------ Resolution Options
% 1.37/1.53
% 1.37/1.53 % --resolution_flag true
% 1.37/1.53 % --res_lit_sel kbo_max
% 1.37/1.53 % --res_to_prop_solver none
% 1.37/1.53 % --res_prop_simpl_new false
% 1.37/1.53 % --res_prop_simpl_given false
% 1.37/1.53 % --res_passive_queue_type priority_queues
% 1.37/1.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.37/1.53 % --res_passive_queues_freq [15;5]
% 1.37/1.53 % --res_forward_subs full
% 1.37/1.53 % --res_backward_subs full
% 1.37/1.53 % --res_forward_subs_resolution true
% 1.37/1.53 % --res_backward_subs_resolution true
% 1.37/1.53 % --res_orphan_elimination false
% 1.37/1.53 % --res_time_limit 1000.
% 1.37/1.53 % --res_out_proof true
% 1.37/1.53 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5ce578.s
% 1.37/1.53 % --modulo true
% 1.37/1.53
% 1.37/1.53 % ------ Combination Options
% 1.37/1.53
% 1.37/1.53 % --comb_res_mult 1000
% 1.37/1.53 % --comb_inst_mult 300
% 1.37/1.53 % ------
% 1.37/1.53
% 1.37/1.53 % ------ Parsing...% successful
% 1.37/1.53
% 1.37/1.53 % ------ 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 %
% 1.37/1.53
% 1.37/1.53 % ------ Proving...
% 1.37/1.53 % ------ Problem Properties
% 1.37/1.53
% 1.37/1.53 %
% 1.37/1.53 % EPR false
% 1.37/1.53 % Horn false
% 1.37/1.53 % Has equality true
% 1.37/1.53
% 1.37/1.53 % % ------ Input Options Time Limit: Unbounded
% 1.37/1.53
% 1.37/1.53
% 1.37/1.53 % % ------ Current options:
% 1.37/1.53
% 1.37/1.53 % ------ Input Options
% 1.37/1.53
% 1.37/1.53 % --out_options all
% 1.37/1.53 % --tptp_safe_out true
% 1.37/1.53 % --problem_path ""
% 1.37/1.53 % --include_path ""
% 1.37/1.53 % --clausifier .//eprover
% 1.37/1.53 % --clausifier_options --tstp-format
% 1.37/1.53 % --stdin false
% 1.37/1.53 % --dbg_backtrace false
% 1.37/1.53 % --dbg_dump_prop_clauses false
% 1.37/1.53 % --dbg_dump_prop_clauses_file -
% 1.37/1.53 % --dbg_out_stat false
% 1.37/1.53
% 1.37/1.53 % ------ General Options
% 1.37/1.53
% 1.37/1.53 % --fof false
% 1.37/1.53 % --time_out_real 150.
% 1.37/1.53 % --time_out_prep_mult 0.2
% 1.37/1.53 % --time_out_virtual -1.
% 1.37/1.53 % --schedule none
% 1.37/1.53 % --ground_splitting input
% 1.37/1.53 % --splitting_nvd 16
% 1.37/1.53 % --non_eq_to_eq false
% 1.37/1.53 % --prep_gs_sim true
% 1.37/1.53 % --prep_unflatten false
% 1.37/1.53 % --prep_res_sim true
% 1.37/1.53 % --prep_upred true
% 1.37/1.53 % --res_sim_input true
% 1.37/1.53 % --clause_weak_htbl true
% 1.37/1.53 % --gc_record_bc_elim false
% 1.37/1.53 % --symbol_type_check false
% 1.37/1.53 % --clausify_out false
% 1.37/1.53 % --large_theory_mode false
% 1.37/1.53 % --prep_sem_filter none
% 1.37/1.53 % --prep_sem_filter_out false
% 1.37/1.53 % --preprocessed_out false
% 1.37/1.53 % --sub_typing false
% 1.37/1.53 % --brand_transform false
% 1.37/1.53 % --pure_diseq_elim true
% 1.37/1.53 % --min_unsat_core false
% 1.37/1.53 % --pred_elim true
% 1.37/1.53 % --add_important_lit false
% 1.37/1.53 % --soft_assumptions false
% 1.37/1.53 % --reset_solvers false
% 1.37/1.53 % --bc_imp_inh []
% 1.37/1.53 % --conj_cone_tolerance 1.5
% 1.37/1.53 % --prolific_symb_bound 500
% 1.37/1.53 % --lt_threshold 2000
% 1.37/1.53
% 1.37/1.53 % ------ SAT Options
% 1.37/1.53
% 1.37/1.53 % --sat_mode false
% 1.37/1.53 % --sat_fm_restart_options ""
% 1.37/1.53 % --sat_gr_def false
% 1.37/1.53 % --sat_epr_types true
% 1.37/1.53 % --sat_non_cyclic_types false
% 1.37/1.53 % --sat_finite_models false
% 1.37/1.53 % --sat_fm_lemmas false
% 1.37/1.53 % --sat_fm_prep false
% 1.37/1.53 % --sat_fm_uc_incr true
% 1.37/1.53 % --sat_out_model small
% 1.37/1.53 % --sat_out_clauses false
% 1.37/1.53
% 1.37/1.53 % ------ QBF Options
% 1.37/1.53
% 1.37/1.53 % --qbf_mode false
% 1.37/1.53 % --qbf_elim_univ true
% 1.37/1.53 % --qbf_sk_in true
% 1.37/1.53 % --qbf_pred_elim true
% 1.37/1.53 % --qbf_split 32
% 1.37/1.53
% 1.37/1.53 % ------ BMC1 Options
% 1.37/1.53
% 1.37/1.53 % --bmc1_incremental false
% 1.37/1.53 % --bmc1_axioms reachable_all
% 1.37/1.53 % --bmc1_min_bound 0
% 1.37/1.53 % --bmc1_max_bound -1
% 1.37/1.53 % --bmc1_max_bound_default -1
% 1.37/1.53 % --bmc1_symbol_reachability true
% 1.37/1.53 % --bmc1_property_lemmas false
% 1.37/1.53 % --bmc1_k_induction false
% 1.37/1.53 % --bmc1_non_equiv_states false
% 1.37/1.53 % --bmc1_deadlock false
% 1.37/1.53 % --bmc1_ucm false
% 1.37/1.53 % --bmc1_add_unsat_core none
% 1.37/1.53 % --bmc1_unsat_core_children false
% 1.37/1.53 % --bmc1_unsat_core_extrapolate_axioms false
% 1.37/1.53 % --bmc1_out_stat full
% 1.37/1.53 % --bmc1_ground_init false
% 1.37/1.53 % --bmc1_pre_inst_next_state false
% 1.37/1.53 % --bmc1_pre_inst_state false
% 1.37/1.53 % --bmc1_pre_inst_reach_state false
% 1.37/1.53 % --bmc1_out_unsat_core false
% 1.37/1.53 % --bmc1_aig_witness_out false
% 1.37/1.53 % --bmc1_verbose false
% 1.37/1.53 % --bmc1_dump_clauses_tptp false
% 1.37/1.53 % --bmc1_dump_unsat_core_tptp false
% 1.37/1.53 % --bmc1_dump_file -
% 1.37/1.53 % --bmc1_ucm_expand_uc_limit 128
% 1.37/1.53 % --bmc1_ucm_n_expand_iterations 6
% 1.37/1.53 % --bmc1_ucm_extend_mode 1
% 1.37/1.53 % --bmc1_ucm_init_mode 2
% 1.37/1.53 % --bmc1_ucm_cone_mode none
% 1.37/1.53 % --bmc1_ucm_reduced_relation_type 0
% 1.37/1.53 % --bmc1_ucm_relax_model 4
% 1.37/1.53 % --bmc1_ucm_full_tr_after_sat true
% 1.37/1.53 % --bmc1_ucm_expand_neg_assumptions false
% 1.37/1.53 % --bmc1_ucm_layered_model none
% 1.37/1.53 % --bmc1_ucm_max_lemma_size 10
% 1.37/1.53
% 1.37/1.53 % ------ AIG Options
% 1.37/1.53
% 1.37/1.53 % --aig_mode false
% 1.37/1.53
% 1.37/1.53 % ------ Instantiation Options
% 1.37/1.53
% 1.37/1.53 % --instantiation_flag true
% 1.37/1.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.37/1.53 % --inst_solver_per_active 750
% 1.37/1.53 % --inst_solver_calls_frac 0.5
% 1.37/1.53 % --inst_passive_queue_type priority_queues
% 1.37/1.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.37/1.53 % --inst_passive_queues_freq [25;2]
% 1.37/1.53 % --inst_dismatching true
% 1.37/1.53 % --inst_eager_unprocessed_to_passive true
% 1.37/1.53 % --inst_prop_sim_given true
% 2.14/2.33 % --inst_prop_sim_new false
% 2.14/2.33 % --inst_orphan_elimination true
% 2.14/2.33 % --inst_learning_loop_flag true
% 2.14/2.33 % --inst_learning_start 3000
% 2.14/2.33 % --inst_learning_factor 2
% 2.14/2.33 % --inst_start_prop_sim_after_learn 3
% 2.14/2.33 % --inst_sel_renew solver
% 2.14/2.33 % --inst_lit_activity_flag true
% 2.14/2.33 % --inst_out_proof true
% 2.14/2.33
% 2.14/2.33 % ------ Resolution Options
% 2.14/2.33
% 2.14/2.33 % --resolution_flag true
% 2.14/2.33 % --res_lit_sel kbo_max
% 2.14/2.33 % --res_to_prop_solver none
% 2.14/2.33 % --res_prop_simpl_new false
% 2.14/2.33 % --res_prop_simpl_given false
% 2.14/2.33 % --res_passive_queue_type priority_queues
% 2.14/2.33 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.14/2.33 % --res_passive_queues_freq [15;5]
% 2.14/2.33 % --res_forward_subs full
% 2.14/2.33 % --res_backward_subs full
% 2.14/2.33 % --res_forward_subs_resolution true
% 2.14/2.33 % --res_backward_subs_resolution true
% 2.14/2.33 % --res_orphan_elimination false
% 2.14/2.33 % --res_time_limit 1000.
% 2.14/2.33 % --res_out_proof true
% 2.14/2.33 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5ce578.s
% 2.14/2.33 % --modulo true
% 2.14/2.33
% 2.14/2.33 % ------ Combination Options
% 2.14/2.33
% 2.14/2.33 % --comb_res_mult 1000
% 2.14/2.33 % --comb_inst_mult 300
% 2.14/2.33 % ------
% 2.14/2.33
% 2.14/2.33
% 2.14/2.33
% 2.14/2.33 % ------ Proving...
% 2.14/2.33 % warning: shown sat in sat incomplete mode
% 2.14/2.33 %
% 2.14/2.33
% 2.14/2.33
% 2.14/2.33 ------ Building Model...Done
% 2.14/2.33
% 2.14/2.33 %------ The model is defined over ground terms (initial term algebra).
% 2.14/2.33 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.14/2.33 %------ where \phi is a formula over the term algebra.
% 2.14/2.33 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.14/2.33 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.14/2.33 %------ See help for --sat_out_model for different model outputs.
% 2.14/2.33 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.14/2.33 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.14/2.33
% 2.14/2.33
% 2.14/2.33
% 2.14/2.33
% 2.14/2.33 %------ Negative definition of equality_sorted
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0,X0,X1] :
% 2.14/2.33 ( ~(equality_sorted(X0,X0,X1)) <=>
% 2.14/2.33 (
% 2.14/2.33 (
% 2.14/2.33 ( X0=$i & X0=age(sk2_esk1_0,sk2_esk5_0) & X1=tau )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 ? [X2] :
% 2.14/2.33 (
% 2.14/2.33 ( X0=$i & X0=age(sk2_esk1_0,X2) & X1=zero )
% 2.14/2.33 &
% 2.14/2.33 ( X2!=sk2_esk2_0 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Positive definition of greater
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0,X1] :
% 2.14/2.33 ( greater(X0,X1) <=>
% 2.14/2.33 (
% 2.14/2.33 (
% 2.14/2.33 ( X0=high & X1=mod1 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=high & X1=low )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=high & X1=very_low )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=high & X1=mod2 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=mod1 & X1=low )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=mod1 & X1=very_low )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=low & X1=very_low )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=mod2 & X1=mod1 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=mod2 & X1=low )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=mod2 & X1=very_low )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=tau & X1=zero )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=tau & X1=sigma )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=sigma & X1=zero )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=age(sk2_esk1_0,sk2_esk4_0) & X1=zero )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=age(sk2_esk1_0,sk2_esk4_0) & X1=sigma )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=age(sk2_esk1_0,sk2_esk5_0) & X1=zero )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=age(sk2_esk1_0,sk2_esk5_0) & X1=tau )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=age(sk2_esk1_0,sk2_esk5_0) & X1=sigma )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 ? [X2] :
% 2.14/2.33 (
% 2.14/2.33 ( X0=age(sk2_esk1_0,X2) & X1=zero )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 ? [X2] :
% 2.14/2.33 (
% 2.14/2.33 ( X0=age(sk2_esk1_0,X2) & X1=sigma )
% 2.14/2.33 &
% 2.14/2.33 ( X2!=sk2_esk2_0 )
% 2.14/2.33 &
% 2.14/2.33 ( X2!=sk2_esk4_0 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Positive definition of has_endowment
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0] :
% 2.14/2.33 ( has_endowment(X0) <=>
% 2.14/2.33 $false
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Positive definition of organization
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0] :
% 2.14/2.33 ( organization(X0) <=>
% 2.14/2.33 (
% 2.14/2.33 (
% 2.14/2.33 ( X0=sk2_esk1_0 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Negative definition of smaller_or_equal
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0,X1] :
% 2.14/2.33 ( ~(smaller_or_equal(X0,X1)) <=>
% 2.14/2.33 (
% 2.14/2.33 (
% 2.14/2.33 ( X0=age(sk2_esk1_0,sk2_esk5_0) & X1=tau )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 ? [X2] :
% 2.14/2.33 (
% 2.14/2.33 ( X0=age(sk2_esk1_0,X2) & X1=zero )
% 2.14/2.33 &
% 2.14/2.33 ( X2!=sk2_esk2_0 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Negative definition of greater_or_equal
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0,X1] :
% 2.14/2.33 ( ~(greater_or_equal(X0,X1)) <=>
% 2.14/2.33 $false
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Positive definition of smaller
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0,X1] :
% 2.14/2.33 ( smaller(X0,X1) <=>
% 2.14/2.33 (
% 2.14/2.33 (
% 2.14/2.33 ( X0=mod1 & X1=high )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=mod1 & X1=mod2 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=low & X1=high )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=low & X1=mod1 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=low & X1=mod2 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=very_low & X1=high )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=very_low & X1=mod1 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=very_low & X1=low )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=very_low & X1=mod2 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=mod2 & X1=high )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=zero & X1=tau )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=zero & X1=sigma )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=zero & X1=age(sk2_esk1_0,sk2_esk4_0) )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=zero & X1=age(sk2_esk1_0,sk2_esk5_0) )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 ? [X2] :
% 2.14/2.33 (
% 2.14/2.33 ( X0=zero & X1=age(sk2_esk1_0,X2) )
% 2.14/2.33 &
% 2.14/2.33 ( X2!=sk2_esk4_0 )
% 2.14/2.33 &
% 2.14/2.33 ( X2!=sk2_esk5_0 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=tau & X1=age(sk2_esk1_0,sk2_esk5_0) )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=sigma & X1=tau )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=sigma & X1=age(sk2_esk1_0,sk2_esk4_0) )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=sigma & X1=age(sk2_esk1_0,sk2_esk5_0) )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 ? [X2] :
% 2.14/2.33 (
% 2.14/2.33 ( X0=sigma & X1=age(sk2_esk1_0,X2) )
% 2.14/2.33 &
% 2.14/2.33 ( X2!=sk2_esk2_0 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Positive definition of has_immunity
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0,X1] :
% 2.14/2.33 ( has_immunity(X0,X1) <=>
% 2.14/2.33 $false
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Negative definition of epred1_2
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0,X1] :
% 2.14/2.33 ( ~(epred1_2(X0,X1)) <=>
% 2.14/2.33 (
% 2.14/2.33 (
% 2.14/2.33 ( X0!=sk2_esk1_0 )
% 2.14/2.33 &
% 2.14/2.33 ( X0!=sk2_esk1_0 | X1!=sk2_esk2_0 )
% 2.14/2.33 &
% 2.14/2.33 ( X0!=sk2_esk1_0 | X1!=sk2_esk5_0 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Positive definition of is_aligned
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0,X1] :
% 2.14/2.33 ( is_aligned(X0,X1) <=>
% 2.14/2.33 (
% 2.14/2.33 (
% 2.14/2.33 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Positive definition of positional_advantage
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0,X1] :
% 2.14/2.33 ( positional_advantage(X0,X1) <=>
% 2.14/2.33 (
% 2.14/2.33 (
% 2.14/2.33 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Negative definition of robust_position
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0] :
% 2.14/2.33 ( ~(robust_position(X0)) <=>
% 2.14/2.33 $false
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33 %------ Negative definition of dissimilar
% 2.14/2.33 fof(lit_def,axiom,
% 2.14/2.33 (! [X0,X1,X2] :
% 2.14/2.33 ( ~(dissimilar(X0,X1,X2)) <=>
% 2.14/2.33 (
% 2.14/2.33 (
% 2.14/2.33 ( X0!=sk2_esk1_0 | X1!=sk2_esk2_0 )
% 2.14/2.33 &
% 2.14/2.33 ( X0!=sk2_esk1_0 | X1!=sk2_esk2_0 | X2!=sk2_esk4_0 )
% 2.14/2.33 &
% 2.14/2.33 ( X0!=sk2_esk1_0 | X2!=sk2_esk2_0 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 |
% 2.14/2.33 (
% 2.14/2.33 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 & X2=sk2_esk2_0 )
% 2.14/2.33 )
% 2.14/2.33
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 )
% 2.14/2.33 ).
% 2.14/2.33
% 2.14/2.33
% 2.14/2.33
% 2.14/2.33 % ------ Statistics
% 2.14/2.33
% 2.14/2.33 % ------ General
% 2.14/2.33
% 2.14/2.33 % num_of_input_clauses: 138
% 2.14/2.33 % num_of_input_neg_conjectures: 12
% 2.14/2.33 % num_of_splits: 0
% 2.14/2.33 % num_of_split_atoms: 0
% 2.14/2.33 % num_of_sem_filtered_clauses: 0
% 2.14/2.33 % num_of_subtypes: 0
% 2.14/2.33 % monotx_restored_types: 0
% 2.14/2.33 % sat_num_of_epr_types: 0
% 2.14/2.33 % sat_num_of_non_cyclic_types: 0
% 2.14/2.33 % sat_guarded_non_collapsed_types: 0
% 2.14/2.33 % is_epr: 0
% 2.14/2.33 % is_horn: 0
% 2.14/2.33 % has_eq: 1
% 2.14/2.33 % num_pure_diseq_elim: 0
% 2.14/2.33 % simp_replaced_by: 0
% 2.14/2.33 % res_preprocessed: 24
% 2.14/2.33 % prep_upred: 0
% 2.14/2.33 % prep_unflattend: 0
% 2.14/2.33 % pred_elim_cands: 0
% 2.14/2.33 % pred_elim: 0
% 2.14/2.33 % pred_elim_cl: 0
% 2.14/2.33 % pred_elim_cycles: 0
% 2.14/2.33 % forced_gc_time: 0
% 2.14/2.33 % gc_basic_clause_elim: 0
% 2.14/2.33 % parsing_time: 0.002
% 2.14/2.33 % sem_filter_time: 0.
% 2.14/2.33 % pred_elim_time: 0.
% 2.14/2.33 % out_proof_time: 0.
% 2.14/2.33 % monotx_time: 0.
% 2.14/2.33 % subtype_inf_time: 0.
% 2.14/2.33 % unif_index_cands_time: 0.002
% 2.14/2.33 % unif_index_add_time: 0.001
% 2.14/2.33 % total_time: 0.815
% 2.14/2.33 % num_of_symbols: 57
% 2.14/2.33 % num_of_terms: 1172
% 2.14/2.33
% 2.14/2.33 % ------ Propositional Solver
% 2.14/2.33
% 2.14/2.33 % prop_solver_calls: 9
% 2.14/2.33 % prop_fast_solver_calls: 42
% 2.14/2.33 % prop_num_of_clauses: 360
% 2.14/2.33 % prop_preprocess_simplified: 1094
% 2.14/2.33 % prop_fo_subsumed: 0
% 2.14/2.33 % prop_solver_time: 0.
% 2.14/2.33 % prop_fast_solver_time: 0.
% 2.14/2.33 % prop_unsat_core_time: 0.
% 2.14/2.33
% 2.14/2.33 % ------ QBF
% 2.14/2.33
% 2.14/2.33 % qbf_q_res: 0
% 2.14/2.33 % qbf_num_tautologies: 0
% 2.14/2.33 % qbf_prep_cycles: 0
% 2.14/2.33
% 2.14/2.33 % ------ BMC1
% 2.14/2.33
% 2.14/2.33 % bmc1_current_bound: -1
% 2.14/2.33 % bmc1_last_solved_bound: -1
% 2.14/2.33 % bmc1_unsat_core_size: -1
% 2.14/2.33 % bmc1_unsat_core_parents_size: -1
% 2.14/2.33 % bmc1_merge_next_fun: 0
% 2.14/2.33 % bmc1_unsat_core_clauses_time: 0.
% 2.14/2.33
% 2.14/2.33 % ------ Instantiation
% 2.14/2.33
% 2.14/2.33 % inst_num_of_clauses: 336
% 2.14/2.33 % inst_num_in_passive: 0
% 2.14/2.33 % inst_num_in_active: 335
% 2.14/2.33 % inst_num_in_unprocessed: 0
% 2.14/2.33 % inst_num_of_loops: 374
% 2.14/2.33 % inst_num_of_learning_restarts: 0
% 2.14/2.33 % inst_num_moves_active_passive: 29
% 2.14/2.33 % inst_lit_activity: 48
% 2.14/2.33 % inst_lit_activity_moves: 0
% 2.14/2.33 % inst_num_tautologies: 1
% 2.14/2.33 % inst_num_prop_implied: 0
% 2.14/2.33 % inst_num_existing_simplified: 0
% 2.14/2.33 % inst_num_eq_res_simplified: 0
% 2.14/2.33 % inst_num_child_elim: 0
% 2.14/2.33 % inst_num_of_dismatching_blockings: 19
% 2.14/2.33 % inst_num_of_non_proper_insts: 552
% 2.14/2.33 % inst_num_of_duplicates: 203
% 2.14/2.33 % inst_inst_num_from_inst_to_res: 0
% 2.14/2.33 % inst_dismatching_checking_time: 0.
% 2.14/2.33
% 2.14/2.33 % ------ Resolution
% 2.14/2.33
% 2.14/2.33 % res_num_of_clauses: 7989
% 2.14/2.33 % res_num_in_passive: 7231
% 2.14/2.33 % res_num_in_active: 833
% 2.14/2.33 % res_num_of_loops: 2000
% 2.14/2.33 % res_forward_subset_subsumed: 23580
% 2.14/2.33 % res_backward_subset_subsumed: 329
% 2.14/2.33 % res_forward_subsumed: 1154
% 2.14/2.33 % res_backward_subsumed: 39
% 2.14/2.33 % res_forward_subsumption_resolution: 40
% 2.14/2.33 % res_backward_subsumption_resolution: 6
% 2.14/2.33 % res_clause_to_clause_subsumption: 44389
% 2.14/2.33 % res_orphan_elimination: 0
% 2.14/2.33 % res_tautology_del: 266
% 2.14/2.33 % res_num_eq_res_simplified: 0
% 2.14/2.33 % res_num_sel_changes: 0
% 2.14/2.33 % res_moves_from_active_to_pass: 0
% 2.14/2.33
% 2.14/2.33 % Status Unknown
% 2.14/2.33 % Last status :
% 2.14/2.33 % SZS status Unknown
%------------------------------------------------------------------------------