TSTP Solution File: MGT058-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT058-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n019.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:04 EDT 2022
% Result : Unknown 4.41s 4.60s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT058-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n019.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:10:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % Orientation found
% 0.20/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8811a9.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_c5be31.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_a455ee | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 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.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8811a9.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44 % ------ Parsing...% successful
% 0.20/0.44
% 0.20/0.44 % ------ 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.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 % ------ Problem Properties
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % EPR false
% 0.20/0.44 % Horn false
% 0.20/0.44 % Has equality true
% 0.20/0.44
% 0.20/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % % ------ Current options:
% 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.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8811a9.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 % warning: shown sat in sat incomplete mode
% 0.20/0.44 %
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 cnf(c_55,plain,
% 0.20/0.44 ( smaller(X0,X1) | X0 = X1 | greater(X0,X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_112_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_308,plain,
% 0.20/0.44 ( smaller(X0,X1) | X0 = X1 | greater(X0,X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_55]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_309,plain,
% 0.20/0.44 ( greater(X0,X1) | smaller(X0,X1) | X0 = X1 ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_308]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_44,plain,
% 0.20/0.44 ( ~ greater_or_equal(X0,X1) | greater(X0,X1) | X0 = X1 ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_107_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_286,plain,
% 0.20/0.44 ( ~ greater_or_equal(X0,X1) | greater(X0,X1) | X0 = X1 ),
% 0.20/0.44 inference(copy,[status(esa)],[c_44]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_287,plain,
% 0.20/0.44 ( greater(X0,X1) | ~ greater_or_equal(X0,X1) | X0 = X1 ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_286]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_27,plain,
% 0.20/0.44 ( positional_advantage(X0,sk2(X0))
% 0.20/0.44 | greater(age(X0,sk2(X0)),tau)
% 0.20/0.44 | robust_position(X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_101_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_252,plain,
% 0.20/0.44 ( positional_advantage(X0,sk2(X0))
% 0.20/0.44 | greater(age(X0,sk2(X0)),tau)
% 0.20/0.44 | robust_position(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_27]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_253,plain,
% 0.20/0.44 ( greater(age(X0,sk2(X0)),tau)
% 0.20/0.44 | robust_position(X0)
% 0.20/0.44 | positional_advantage(X0,sk2(X0)) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_252]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_24,plain,
% 0.20/0.44 ( smaller_or_equal(age(X0,sk1(X0)),sigma)
% 0.20/0.44 | positional_advantage(X0,sk1(X0))
% 0.20/0.44 | fragile_position(X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_100_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_246,plain,
% 0.20/0.44 ( smaller_or_equal(age(X0,sk1(X0)),sigma)
% 0.20/0.44 | positional_advantage(X0,sk1(X0))
% 0.20/0.44 | fragile_position(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_24]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_247,plain,
% 0.20/0.44 ( fragile_position(X0)
% 0.20/0.44 | smaller_or_equal(age(X0,sk1(X0)),sigma)
% 0.20/0.44 | positional_advantage(X0,sk1(X0)) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_246]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_21,plain,
% 0.20/0.44 ( ~ robust_position(X0)
% 0.20/0.44 | ~ greater(age(X0,X1),tau)
% 0.20/0.44 | positional_advantage(X0,X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_99_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_240,plain,
% 0.20/0.44 ( ~ robust_position(X0)
% 0.20/0.44 | ~ greater(age(X0,X1),tau)
% 0.20/0.44 | positional_advantage(X0,X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_21]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_241,plain,
% 0.20/0.44 ( ~ greater(age(X0,X1),tau)
% 0.20/0.44 | ~ robust_position(X0)
% 0.20/0.44 | positional_advantage(X0,X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_240]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_15,plain,
% 0.20/0.44 ( ~ positional_advantage(X0,sk2(X0))
% 0.20/0.44 | smaller_or_equal(age(X0,sk2(X0)),tau)
% 0.20/0.44 | robust_position(X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_97_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_228,plain,
% 0.20/0.44 ( ~ positional_advantage(X0,sk2(X0))
% 0.20/0.44 | smaller_or_equal(age(X0,sk2(X0)),tau)
% 0.20/0.44 | robust_position(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_229,plain,
% 0.20/0.44 ( smaller_or_equal(age(X0,sk2(X0)),tau)
% 0.20/0.44 | robust_position(X0)
% 0.20/0.44 | ~ positional_advantage(X0,sk2(X0)) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_228]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_9,plain,
% 0.20/0.44 ( ~ robust_position(X0)
% 0.20/0.44 | ~ smaller_or_equal(age(X0,X1),tau)
% 0.20/0.44 | ~ positional_advantage(X0,X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_95_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_216,plain,
% 0.20/0.44 ( ~ robust_position(X0)
% 0.20/0.44 | ~ smaller_or_equal(age(X0,X1),tau)
% 0.20/0.44 | ~ positional_advantage(X0,X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_217,plain,
% 0.20/0.44 ( ~ smaller_or_equal(age(X0,X1),tau)
% 0.20/0.44 | ~ robust_position(X0)
% 0.20/0.44 | ~ positional_advantage(X0,X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_216]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_3,plain,
% 0.20/0.44 ( smaller_or_equal(age(X0,sk2(X0)),tau)
% 0.20/0.44 | greater(age(X0,sk2(X0)),tau)
% 0.20/0.44 | robust_position(X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_93_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_204,plain,
% 0.20/0.44 ( smaller_or_equal(age(X0,sk2(X0)),tau)
% 0.20/0.44 | greater(age(X0,sk2(X0)),tau)
% 0.20/0.44 | robust_position(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_205,plain,
% 0.20/0.44 ( greater(age(X0,sk2(X0)),tau)
% 0.20/0.44 | smaller_or_equal(age(X0,sk2(X0)),tau)
% 0.20/0.44 | robust_position(X0) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_204]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_67,negated_conjecture,
% 0.20/0.44 ( organization(sk3) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_29) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_98,negated_conjecture,
% 0.20/0.44 ( organization(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_67]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_117,negated_conjecture,
% 0.20/0.44 ( organization(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_98]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_118,negated_conjecture,
% 0.20/0.44 ( organization(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_117]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_126,negated_conjecture,
% 0.20/0.44 ( organization(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_118]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_326,negated_conjecture,
% 0.20/0.44 ( organization(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_126]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_66,negated_conjecture,
% 0.20/0.44 ( fragile_position(sk3) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_28) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_96,negated_conjecture,
% 0.20/0.44 ( fragile_position(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_66]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_116,negated_conjecture,
% 0.20/0.44 ( fragile_position(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_96]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_119,negated_conjecture,
% 0.20/0.44 ( fragile_position(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_116]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_125,negated_conjecture,
% 0.20/0.44 ( fragile_position(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_119]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_324,negated_conjecture,
% 0.20/0.44 ( fragile_position(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_125]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_65,negated_conjecture,
% 0.20/0.44 ( robust_position(sk3) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_27) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_94,negated_conjecture,
% 0.20/0.44 ( robust_position(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_65]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_115,negated_conjecture,
% 0.20/0.44 ( robust_position(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_94]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_120,negated_conjecture,
% 0.20/0.44 ( robust_position(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_115]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_124,negated_conjecture,
% 0.20/0.44 ( robust_position(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_120]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_322,negated_conjecture,
% 0.20/0.44 ( robust_position(sk3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_124]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_64,negated_conjecture,
% 0.20/0.44 ( age(sk3,sk4) = zero ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_26) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_92,negated_conjecture,
% 0.20/0.44 ( age(sk3,sk4) = zero ),
% 0.20/0.44 inference(copy,[status(esa)],[c_64]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_114,negated_conjecture,
% 0.20/0.44 ( age(sk3,sk4) = zero ),
% 0.20/0.44 inference(copy,[status(esa)],[c_92]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_121,negated_conjecture,
% 0.20/0.44 ( age(sk3,sk4) = zero ),
% 0.20/0.44 inference(copy,[status(esa)],[c_114]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_129,negated_conjecture,
% 0.20/0.44 ( age(sk3,sk4) = zero ),
% 0.20/0.44 inference(copy,[status(esa)],[c_121]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_332,negated_conjecture,
% 0.20/0.44 ( age(sk3,sk4) = zero ),
% 0.20/0.45 inference(copy,[status(esa)],[c_129]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_63,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(sigma,zero) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_25) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_90,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(sigma,zero) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_63]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_113,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(sigma,zero) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_90]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_122,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(sigma,zero) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_113]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_128,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(sigma,zero) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_122]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_330,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(sigma,zero) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_128]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_62,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(tau,zero) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_24) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_88,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(tau,zero) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_62]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_112,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(tau,zero) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_88]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_123,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(tau,zero) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_112]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_127,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(tau,zero) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_123]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_328,negated_conjecture,
% 0.20/0.45 ( greater_or_equal(tau,zero) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_127]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_60,plain,
% 0.20/0.45 ( X0 != X1 | greater_or_equal(X0,X1) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_114_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_318,plain,
% 0.20/0.45 ( X0 != X1 | greater_or_equal(X0,X1) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_60]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_319,plain,
% 0.20/0.45 ( greater_or_equal(X0,X1) | X0 != X1 ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_318]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_58,plain,
% 0.20/0.45 ( X0 != X1 | smaller_or_equal(X0,X1) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_113_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_314,plain,
% 0.20/0.45 ( X0 != X1 | smaller_or_equal(X0,X1) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_58]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_315,plain,
% 0.20/0.45 ( smaller_or_equal(X0,X1) | X0 != X1 ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_314]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_53,plain,
% 0.20/0.45 ( ~ greater(X0,X1) | smaller(X1,X0) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_111_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_304,plain,
% 0.20/0.45 ( ~ greater(X0,X1) | smaller(X1,X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_53]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_51,plain,
% 0.20/0.45 ( ~ smaller(X0,X1) | greater(X1,X0) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_110_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_300,plain,
% 0.20/0.45 ( ~ smaller(X0,X1) | greater(X1,X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_51]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_301,plain,
% 0.20/0.45 ( greater(X0,X1) | ~ smaller(X1,X0) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_300]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_49,plain,
% 0.20/0.45 ( ~ greater(X0,X1) | greater_or_equal(X0,X1) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_109_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_296,plain,
% 0.20/0.45 ( ~ greater(X0,X1) | greater_or_equal(X0,X1) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_49]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_47,plain,
% 0.20/0.45 ( ~ smaller(X0,X1) | smaller_or_equal(X0,X1) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_108_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_292,plain,
% 0.20/0.45 ( ~ smaller(X0,X1) | smaller_or_equal(X0,X1) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_47]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_293,plain,
% 0.20/0.45 ( smaller_or_equal(X0,X1) | ~ smaller(X0,X1) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_292]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_41,plain,
% 0.20/0.45 ( ~ smaller_or_equal(X0,X1) | smaller(X0,X1) | X0 = X1 ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_106_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_280,plain,
% 0.20/0.45 ( ~ smaller_or_equal(X0,X1) | smaller(X0,X1) | X0 = X1 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_41]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_39,plain,
% 0.20/0.45 ( ~ greater(X0,X1) | ~ greater(X1,X0) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_105_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_276,plain,
% 0.20/0.45 ( ~ greater(X0,X1) | ~ greater(X1,X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_39]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_32,plain,
% 0.20/0.45 ( greater(X0,X1) | ~ greater(X2,X1) | ~ greater(X0,X2) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_102_2) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_262,plain,
% 0.20/0.45 ( greater(X0,X1) | ~ greater(X2,X1) | ~ greater(X0,X2) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_32]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_31,plain,
% 0.20/0.45 ( ~ greater(X0,X1) | greater(X0,X2) | ~ greater(X1,X2) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_102_1) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_260,plain,
% 0.20/0.45 ( ~ greater(X0,X1) | greater(X0,X2) | ~ greater(X1,X2) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_30,plain,
% 0.20/0.45 ( ~ greater(X0,X1) | ~ greater(X1,X2) | greater(X0,X2) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_102_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_258,plain,
% 0.20/0.45 ( ~ greater(X0,X1) | ~ greater(X1,X2) | greater(X0,X2) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_18,plain,
% 0.20/0.45 ( ~ fragile_position(X0)
% 0.20/0.45 | ~ smaller_or_equal(age(X0,X1),sigma)
% 0.20/0.45 | positional_advantage(X0,X1) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_98_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_234,plain,
% 0.20/0.45 ( ~ fragile_position(X0)
% 0.20/0.45 | ~ smaller_or_equal(age(X0,X1),sigma)
% 0.20/0.45 | positional_advantage(X0,X1) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_12,plain,
% 0.20/0.45 ( ~ positional_advantage(X0,sk1(X0))
% 0.20/0.45 | greater(age(X0,sk1(X0)),sigma)
% 0.20/0.45 | fragile_position(X0) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_96_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_222,plain,
% 0.20/0.45 ( ~ positional_advantage(X0,sk1(X0))
% 0.20/0.45 | greater(age(X0,sk1(X0)),sigma)
% 0.20/0.45 | fragile_position(X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_223,plain,
% 0.20/0.45 ( fragile_position(X0)
% 0.20/0.45 | greater(age(X0,sk1(X0)),sigma)
% 0.20/0.45 | ~ positional_advantage(X0,sk1(X0)) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_222]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_6,plain,
% 0.20/0.45 ( ~ fragile_position(X0)
% 0.20/0.45 | ~ greater(age(X0,X1),sigma)
% 0.20/0.45 | ~ positional_advantage(X0,X1) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_94_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_210,plain,
% 0.20/0.45 ( ~ fragile_position(X0)
% 0.20/0.45 | ~ greater(age(X0,X1),sigma)
% 0.20/0.45 | ~ positional_advantage(X0,X1) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_0,plain,
% 0.20/0.45 ( smaller_or_equal(age(X0,sk1(X0)),sigma)
% 0.20/0.45 | greater(age(X0,sk1(X0)),sigma)
% 0.20/0.45 | fragile_position(X0) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_c5be31.p', c_0_92_0) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_198,plain,
% 0.20/0.45 ( smaller_or_equal(age(X0,sk1(X0)),sigma)
% 0.20/0.45 | greater(age(X0,sk1(X0)),sigma)
% 0.20/0.45 | fragile_position(X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_199,plain,
% 0.20/0.45 ( fragile_position(X0)
% 0.20/0.45 | greater(age(X0,sk1(X0)),sigma)
% 0.20/0.45 | smaller_or_equal(age(X0,sk1(X0)),sigma) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_198]) ).
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % ------ Statistics
% 0.20/0.45
% 0.20/0.45 % ------ General
% 0.20/0.45
% 0.20/0.45 % num_of_input_clauses: 68
% 0.20/0.45 % num_of_input_neg_conjectures: 6
% 0.20/0.45 % num_of_splits: 0
% 0.20/0.45 % num_of_split_atoms: 0
% 0.20/0.45 % num_of_sem_filtered_clauses: 0
% 0.20/0.45 % num_of_subtypes: 0
% 0.20/0.45 % monotx_restored_types: 0
% 0.20/0.45 % sat_num_of_epr_types: 0
% 0.20/0.45 % sat_num_of_non_cyclic_types: 0
% 0.20/0.45 % sat_guarded_non_collapsed_types: 0
% 0.20/0.45 % is_epr: 0
% 0.20/0.45 % is_horn: 0
% 0.20/0.45 % has_eq: 1
% 0.20/0.45 % num_pure_diseq_elim: 0
% 0.20/0.45 % simp_replaced_by: 0
% 0.20/0.45 % res_preprocessed: 12
% 0.20/0.45 % prep_upred: 0
% 0.20/0.45 % prep_unflattend: 0
% 0.20/0.45 % pred_elim_cands: 0
% 0.20/0.45 % pred_elim: 0
% 0.20/0.45 % pred_elim_cl: 0
% 0.20/0.45 % pred_elim_cycles: 0
% 0.20/0.45 % forced_gc_time: 0
% 0.20/0.45 % gc_basic_clause_elim: 0
% 0.20/0.45 % parsing_time: 0.002
% 0.20/0.45 % sem_filter_time: 0.
% 0.20/0.45 % pred_elim_time: 0.
% 0.20/0.45 % out_proof_time: 0.
% 0.20/0.45 % monotx_time: 0.
% 0.20/0.45 % subtype_inf_time: 0.
% 0.20/0.45 % unif_index_cands_time: 0.
% 0.20/0.45 % unif_index_add_time: 0.
% 0.20/0.45 % total_time: 0.029
% 0.20/0.45 % num_of_symbols: 41
% 0.20/0.45 % num_of_terms: 113
% 0.20/0.45
% 0.20/0.45 % ------ Propositional Solver
% 0.20/0.45
% 0.20/0.45 % prop_solver_calls: 1
% 0.20/0.45 % prop_fast_solver_calls: 18
% 0.20/0.45 % prop_num_of_clauses: 50
% 0.20/0.45 % prop_preprocess_simplified: 258
% 0.20/0.45 % prop_fo_subsumed: 0
% 0.20/0.45 % prop_solver_time: 0.
% 0.20/0.45 % prop_fast_solver_time: 0.
% 0.20/0.45 % prop_unsat_core_time: 0.
% 0.20/0.45
% 0.20/0.45 % ------ QBF
% 0.20/0.45
% 0.20/0.45 % qbf_q_res: 0
% 0.20/0.45 % qbf_num_tautologies: 0
% 0.20/0.45 % qbf_prep_cycles: 0
% 0.20/0.45
% 0.20/0.45 % ------ BMC1
% 0.20/0.45
% 0.20/0.45 % bmc1_current_bound: -1
% 0.20/0.45 % bmc1_last_solved_bound: -1
% 0.20/0.45 % bmc1_unsat_core_size: -1
% 0.20/0.45 % bmc1_unsat_core_parents_size: -1
% 0.20/0.45 % bmc1_merge_next_fun: 0
% 0.20/0.45 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.45
% 0.20/0.45 % ------ Instantiation
% 0.20/0.45
% 0.20/0.45 % inst_num_of_clauses: 67
% 0.20/0.45 % inst_num_in_passive: 0
% 0.20/0.45 % inst_num_in_active: 0
% 0.20/0.45 % inst_num_in_unprocessed: 68
% 0.20/0.45 % inst_num_of_loops: 0
% 0.20/0.45 % inst_num_of_learning_restarts: 0
% 0.20/0.45 % inst_num_moves_active_passive: 0
% 0.20/0.45 % inst_lit_activity: 0
% 0.20/0.45 % inst_lit_activity_moves: 0
% 0.20/0.45 % inst_num_tautologies: 0
% 0.20/0.45 % inst_num_prop_implied: 0
% 0.20/0.45 % inst_num_existing_simplified: 0
% 0.20/0.45 % inst_num_eq_res_simplified: 0
% 0.20/0.45 % inst_num_child_elim: 0
% 0.20/0.45 % inst_num_of_dismatching_blockings: 0
% 0.20/0.45 % inst_num_of_non_proper_insts: 0
% 0.20/0.45 % inst_num_of_duplicates: 0
% 0.20/0.45 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.45 % inst_dismatching_checking_time: 0.
% 0.20/0.45
% 0.20/0.45 % ------ Resolution
% 0.20/0.45
% 0.20/0.45 % res_num_of_clauses: 75
% 0.20/0.45 % res_num_in_passive: 0
% 0.20/0.45 % res_num_in_active: 29
% 0.20/0.45 % res_num_of_loops: 7
% 0.20/0.45 % res_forward_subset_subsumed: 33
% 0.20/0.45 % res_backward_subset_subsumed: 0
% 0.20/0.45 % res_forward_subsumed: 0
% 0.20/0.45 % res_backward_subsumed: 0
% 0.20/0.45 % res_forward_subsumption_resolution: 0
% 0.20/0.45 % res_backward_subsumption_resolution: 0
% 0.20/0.45 % res_clause_to_clause_subsumption: 0
% 0.20/0.45 % res_orphan_elimination: 0
% 0.20/0.45 % res_tautology_del: 6
% 0.20/0.45 % res_num_eq_res_simplified: 0
% 0.20/0.45 % res_num_sel_changes: 0
% 0.20/0.45 % res_moves_from_active_to_pass: 0
% 0.20/0.45
% 0.20/0.45 % Status Unknown
% 0.20/0.49 % Orienting using strategy ClausalAll
% 0.20/0.49 % Orientation found
% 0.20/0.49 % 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_8811a9.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_c5be31.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_fae361 | grep -v "SZS"
% 0.20/0.51
% 0.20/0.51 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % ------ iProver source info
% 0.20/0.51
% 0.20/0.51 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.51 % git: non_committed_changes: true
% 0.20/0.51 % git: last_make_outside_of_git: true
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % ------ Input Options
% 0.20/0.51
% 0.20/0.51 % --out_options all
% 0.20/0.51 % --tptp_safe_out true
% 0.20/0.51 % --problem_path ""
% 0.20/0.51 % --include_path ""
% 0.20/0.51 % --clausifier .//eprover
% 0.20/0.51 % --clausifier_options --tstp-format
% 0.20/0.51 % --stdin false
% 0.20/0.51 % --dbg_backtrace false
% 0.20/0.51 % --dbg_dump_prop_clauses false
% 0.20/0.51 % --dbg_dump_prop_clauses_file -
% 0.20/0.51 % --dbg_out_stat false
% 0.20/0.51
% 0.20/0.51 % ------ General Options
% 0.20/0.51
% 0.20/0.51 % --fof false
% 0.20/0.51 % --time_out_real 150.
% 0.20/0.51 % --time_out_prep_mult 0.2
% 0.20/0.51 % --time_out_virtual -1.
% 0.20/0.51 % --schedule none
% 0.20/0.51 % --ground_splitting input
% 0.20/0.51 % --splitting_nvd 16
% 0.20/0.51 % --non_eq_to_eq false
% 0.20/0.51 % --prep_gs_sim true
% 0.20/0.51 % --prep_unflatten false
% 0.20/0.51 % --prep_res_sim true
% 0.20/0.51 % --prep_upred true
% 0.20/0.51 % --res_sim_input true
% 0.20/0.51 % --clause_weak_htbl true
% 0.20/0.51 % --gc_record_bc_elim false
% 0.20/0.51 % --symbol_type_check false
% 0.20/0.51 % --clausify_out false
% 0.20/0.51 % --large_theory_mode false
% 0.20/0.51 % --prep_sem_filter none
% 0.20/0.51 % --prep_sem_filter_out false
% 0.20/0.51 % --preprocessed_out false
% 0.20/0.51 % --sub_typing false
% 0.20/0.51 % --brand_transform false
% 0.20/0.51 % --pure_diseq_elim true
% 0.20/0.51 % --min_unsat_core false
% 0.20/0.51 % --pred_elim true
% 0.20/0.51 % --add_important_lit false
% 0.20/0.51 % --soft_assumptions false
% 0.20/0.51 % --reset_solvers false
% 0.20/0.51 % --bc_imp_inh []
% 0.20/0.51 % --conj_cone_tolerance 1.5
% 0.20/0.51 % --prolific_symb_bound 500
% 0.20/0.51 % --lt_threshold 2000
% 0.20/0.51
% 0.20/0.51 % ------ SAT Options
% 0.20/0.51
% 0.20/0.51 % --sat_mode false
% 0.20/0.51 % --sat_fm_restart_options ""
% 0.20/0.51 % --sat_gr_def false
% 0.20/0.51 % --sat_epr_types true
% 0.20/0.51 % --sat_non_cyclic_types false
% 0.20/0.51 % --sat_finite_models false
% 0.20/0.51 % --sat_fm_lemmas false
% 0.20/0.51 % --sat_fm_prep false
% 0.20/0.51 % --sat_fm_uc_incr true
% 0.20/0.51 % --sat_out_model small
% 0.20/0.51 % --sat_out_clauses false
% 0.20/0.51
% 0.20/0.51 % ------ QBF Options
% 0.20/0.51
% 0.20/0.51 % --qbf_mode false
% 0.20/0.51 % --qbf_elim_univ true
% 0.20/0.51 % --qbf_sk_in true
% 0.20/0.51 % --qbf_pred_elim true
% 0.20/0.51 % --qbf_split 32
% 0.20/0.51
% 0.20/0.51 % ------ BMC1 Options
% 0.20/0.51
% 0.20/0.51 % --bmc1_incremental false
% 0.20/0.51 % --bmc1_axioms reachable_all
% 0.20/0.51 % --bmc1_min_bound 0
% 0.20/0.51 % --bmc1_max_bound -1
% 0.20/0.51 % --bmc1_max_bound_default -1
% 0.20/0.51 % --bmc1_symbol_reachability true
% 0.20/0.51 % --bmc1_property_lemmas false
% 0.20/0.51 % --bmc1_k_induction false
% 0.20/0.51 % --bmc1_non_equiv_states false
% 0.20/0.51 % --bmc1_deadlock false
% 0.20/0.51 % --bmc1_ucm false
% 0.20/0.51 % --bmc1_add_unsat_core none
% 0.20/0.51 % --bmc1_unsat_core_children false
% 0.20/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.51 % --bmc1_out_stat full
% 0.20/0.51 % --bmc1_ground_init false
% 0.20/0.51 % --bmc1_pre_inst_next_state false
% 0.20/0.51 % --bmc1_pre_inst_state false
% 0.20/0.51 % --bmc1_pre_inst_reach_state false
% 0.20/0.51 % --bmc1_out_unsat_core false
% 0.20/0.51 % --bmc1_aig_witness_out false
% 0.20/0.51 % --bmc1_verbose false
% 0.20/0.51 % --bmc1_dump_clauses_tptp false
% 0.20/0.52 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.52 % --bmc1_dump_file -
% 0.20/0.52 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.52 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.52 % --bmc1_ucm_extend_mode 1
% 0.20/0.52 % --bmc1_ucm_init_mode 2
% 0.20/0.52 % --bmc1_ucm_cone_mode none
% 0.20/0.52 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.52 % --bmc1_ucm_relax_model 4
% 0.20/0.52 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.52 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.52 % --bmc1_ucm_layered_model none
% 0.20/0.52 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.52
% 0.20/0.52 % ------ AIG Options
% 0.20/0.52
% 0.20/0.52 % --aig_mode false
% 0.20/0.52
% 0.20/0.52 % ------ Instantiation Options
% 0.20/0.52
% 0.20/0.52 % --instantiation_flag true
% 0.20/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.52 % --inst_solver_per_active 750
% 0.20/0.52 % --inst_solver_calls_frac 0.5
% 0.20/0.52 % --inst_passive_queue_type priority_queues
% 0.20/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.52 % --inst_passive_queues_freq [25;2]
% 0.20/0.52 % --inst_dismatching true
% 0.20/0.52 % --inst_eager_unprocessed_to_passive true
% 0.20/0.52 % --inst_prop_sim_given true
% 0.20/0.52 % --inst_prop_sim_new false
% 0.20/0.52 % --inst_orphan_elimination true
% 0.20/0.52 % --inst_learning_loop_flag true
% 0.20/0.52 % --inst_learning_start 3000
% 0.20/0.52 % --inst_learning_factor 2
% 0.20/0.52 % --inst_start_prop_sim_after_learn 3
% 0.20/0.52 % --inst_sel_renew solver
% 0.20/0.52 % --inst_lit_activity_flag true
% 0.20/0.52 % --inst_out_proof true
% 0.20/0.52
% 0.20/0.52 % ------ Resolution Options
% 0.20/0.52
% 0.20/0.52 % --resolution_flag true
% 0.20/0.52 % --res_lit_sel kbo_max
% 0.20/0.52 % --res_to_prop_solver none
% 0.20/0.52 % --res_prop_simpl_new false
% 0.20/0.52 % --res_prop_simpl_given false
% 0.20/0.52 % --res_passive_queue_type priority_queues
% 0.20/0.52 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.52 % --res_passive_queues_freq [15;5]
% 0.20/0.52 % --res_forward_subs full
% 0.20/0.52 % --res_backward_subs full
% 0.20/0.52 % --res_forward_subs_resolution true
% 0.20/0.52 % --res_backward_subs_resolution true
% 0.20/0.52 % --res_orphan_elimination false
% 0.20/0.52 % --res_time_limit 1000.
% 0.20/0.52 % --res_out_proof true
% 0.20/0.52 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8811a9.s
% 0.20/0.52 % --modulo true
% 0.20/0.52
% 0.20/0.52 % ------ Combination Options
% 0.20/0.52
% 0.20/0.52 % --comb_res_mult 1000
% 0.20/0.52 % --comb_inst_mult 300
% 0.20/0.52 % ------
% 0.20/0.52
% 0.20/0.52 % ------ Parsing...% successful
% 0.20/0.52
% 0.20/0.52 % ------ 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.52
% 0.20/0.52 % ------ Proving...
% 0.20/0.52 % ------ Problem Properties
% 0.20/0.52
% 0.20/0.52 %
% 0.20/0.52 % EPR false
% 0.20/0.52 % Horn false
% 0.20/0.52 % Has equality true
% 0.20/0.52
% 0.20/0.52 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 % % ------ Current options:
% 0.20/0.52
% 0.20/0.52 % ------ Input Options
% 0.20/0.52
% 0.20/0.52 % --out_options all
% 0.20/0.52 % --tptp_safe_out true
% 0.20/0.52 % --problem_path ""
% 0.20/0.52 % --include_path ""
% 0.20/0.52 % --clausifier .//eprover
% 0.20/0.52 % --clausifier_options --tstp-format
% 0.20/0.52 % --stdin false
% 0.20/0.52 % --dbg_backtrace false
% 0.20/0.52 % --dbg_dump_prop_clauses false
% 0.20/0.52 % --dbg_dump_prop_clauses_file -
% 0.20/0.52 % --dbg_out_stat false
% 0.20/0.52
% 0.20/0.52 % ------ General Options
% 0.20/0.52
% 0.20/0.52 % --fof false
% 0.20/0.52 % --time_out_real 150.
% 0.20/0.52 % --time_out_prep_mult 0.2
% 0.20/0.52 % --time_out_virtual -1.
% 0.20/0.52 % --schedule none
% 0.20/0.52 % --ground_splitting input
% 0.20/0.52 % --splitting_nvd 16
% 0.20/0.52 % --non_eq_to_eq false
% 0.20/0.52 % --prep_gs_sim true
% 0.20/0.52 % --prep_unflatten false
% 0.20/0.52 % --prep_res_sim true
% 0.20/0.52 % --prep_upred true
% 0.20/0.52 % --res_sim_input true
% 0.20/0.52 % --clause_weak_htbl true
% 0.20/0.52 % --gc_record_bc_elim false
% 0.20/0.52 % --symbol_type_check false
% 0.20/0.52 % --clausify_out false
% 0.20/0.52 % --large_theory_mode false
% 0.20/0.52 % --prep_sem_filter none
% 0.20/0.52 % --prep_sem_filter_out false
% 0.20/0.52 % --preprocessed_out false
% 0.20/0.52 % --sub_typing false
% 0.20/0.52 % --brand_transform false
% 0.20/0.52 % --pure_diseq_elim true
% 0.20/0.52 % --min_unsat_core false
% 0.20/0.52 % --pred_elim true
% 0.20/0.52 % --add_important_lit false
% 0.20/0.52 % --soft_assumptions false
% 0.20/0.52 % --reset_solvers false
% 0.20/0.52 % --bc_imp_inh []
% 0.20/0.52 % --conj_cone_tolerance 1.5
% 0.20/0.52 % --prolific_symb_bound 500
% 0.20/0.52 % --lt_threshold 2000
% 0.20/0.52
% 0.20/0.52 % ------ SAT Options
% 0.20/0.52
% 0.20/0.52 % --sat_mode false
% 0.20/0.52 % --sat_fm_restart_options ""
% 0.20/0.52 % --sat_gr_def false
% 0.20/0.52 % --sat_epr_types true
% 0.20/0.52 % --sat_non_cyclic_types false
% 0.20/0.52 % --sat_finite_models false
% 0.20/0.52 % --sat_fm_lemmas false
% 0.20/0.52 % --sat_fm_prep false
% 0.20/0.52 % --sat_fm_uc_incr true
% 0.20/0.52 % --sat_out_model small
% 0.20/0.52 % --sat_out_clauses false
% 0.20/0.52
% 0.20/0.52 % ------ QBF Options
% 0.20/0.52
% 0.20/0.52 % --qbf_mode false
% 0.20/0.52 % --qbf_elim_univ true
% 0.20/0.52 % --qbf_sk_in true
% 0.20/0.52 % --qbf_pred_elim true
% 0.20/0.52 % --qbf_split 32
% 0.20/0.52
% 0.20/0.52 % ------ BMC1 Options
% 0.20/0.52
% 0.20/0.52 % --bmc1_incremental false
% 0.20/0.52 % --bmc1_axioms reachable_all
% 0.20/0.52 % --bmc1_min_bound 0
% 0.20/0.52 % --bmc1_max_bound -1
% 0.20/0.52 % --bmc1_max_bound_default -1
% 0.20/0.52 % --bmc1_symbol_reachability true
% 0.20/0.52 % --bmc1_property_lemmas false
% 0.20/0.52 % --bmc1_k_induction false
% 0.20/0.52 % --bmc1_non_equiv_states false
% 0.20/0.52 % --bmc1_deadlock false
% 0.20/0.52 % --bmc1_ucm false
% 0.20/0.52 % --bmc1_add_unsat_core none
% 0.20/0.52 % --bmc1_unsat_core_children false
% 0.20/0.52 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.52 % --bmc1_out_stat full
% 0.20/0.52 % --bmc1_ground_init false
% 0.20/0.52 % --bmc1_pre_inst_next_state false
% 0.20/0.52 % --bmc1_pre_inst_state false
% 0.20/0.52 % --bmc1_pre_inst_reach_state false
% 0.20/0.52 % --bmc1_out_unsat_core false
% 0.20/0.52 % --bmc1_aig_witness_out false
% 0.20/0.52 % --bmc1_verbose false
% 0.20/0.52 % --bmc1_dump_clauses_tptp false
% 0.20/0.52 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.52 % --bmc1_dump_file -
% 0.20/0.52 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.52 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.52 % --bmc1_ucm_extend_mode 1
% 0.20/0.52 % --bmc1_ucm_init_mode 2
% 0.20/0.52 % --bmc1_ucm_cone_mode none
% 0.20/0.52 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.52 % --bmc1_ucm_relax_model 4
% 0.20/0.52 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.52 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.52 % --bmc1_ucm_layered_model none
% 0.20/0.52 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.52
% 0.20/0.52 % ------ AIG Options
% 0.20/0.52
% 0.20/0.52 % --aig_mode false
% 0.20/0.52
% 0.20/0.52 % ------ Instantiation Options
% 0.20/0.52
% 0.20/0.52 % --instantiation_flag true
% 0.20/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.52 % --inst_solver_per_active 750
% 0.20/0.52 % --inst_solver_calls_frac 0.5
% 0.20/0.52 % --inst_passive_queue_type priority_queues
% 0.20/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.52 % --inst_passive_queues_freq [25;2]
% 0.20/0.52 % --inst_dismatching true
% 0.20/0.52 % --inst_eager_unprocessed_to_passive true
% 0.20/0.52 % --inst_prop_sim_given true
% 4.41/4.60 % --inst_prop_sim_new false
% 4.41/4.60 % --inst_orphan_elimination true
% 4.41/4.60 % --inst_learning_loop_flag true
% 4.41/4.60 % --inst_learning_start 3000
% 4.41/4.60 % --inst_learning_factor 2
% 4.41/4.60 % --inst_start_prop_sim_after_learn 3
% 4.41/4.60 % --inst_sel_renew solver
% 4.41/4.60 % --inst_lit_activity_flag true
% 4.41/4.60 % --inst_out_proof true
% 4.41/4.60
% 4.41/4.60 % ------ Resolution Options
% 4.41/4.60
% 4.41/4.60 % --resolution_flag true
% 4.41/4.60 % --res_lit_sel kbo_max
% 4.41/4.60 % --res_to_prop_solver none
% 4.41/4.60 % --res_prop_simpl_new false
% 4.41/4.60 % --res_prop_simpl_given false
% 4.41/4.60 % --res_passive_queue_type priority_queues
% 4.41/4.60 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.41/4.60 % --res_passive_queues_freq [15;5]
% 4.41/4.60 % --res_forward_subs full
% 4.41/4.60 % --res_backward_subs full
% 4.41/4.60 % --res_forward_subs_resolution true
% 4.41/4.60 % --res_backward_subs_resolution true
% 4.41/4.60 % --res_orphan_elimination false
% 4.41/4.60 % --res_time_limit 1000.
% 4.41/4.60 % --res_out_proof true
% 4.41/4.60 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8811a9.s
% 4.41/4.60 % --modulo true
% 4.41/4.60
% 4.41/4.60 % ------ Combination Options
% 4.41/4.60
% 4.41/4.60 % --comb_res_mult 1000
% 4.41/4.60 % --comb_inst_mult 300
% 4.41/4.60 % ------
% 4.41/4.60
% 4.41/4.60
% 4.41/4.60
% 4.41/4.60 % ------ Proving...
% 4.41/4.60 % warning: shown sat in sat incomplete mode
% 4.41/4.60 %
% 4.41/4.60
% 4.41/4.60
% 4.41/4.60 ------ Building Model...Done
% 4.41/4.60
% 4.41/4.60 %------ The model is defined over ground terms (initial term algebra).
% 4.41/4.60 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 4.41/4.60 %------ where \phi is a formula over the term algebra.
% 4.41/4.60 %------ If we have equality in the problem then it is also defined as a predicate above,
% 4.41/4.60 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 4.41/4.60 %------ See help for --sat_out_model for different model outputs.
% 4.41/4.60 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 4.41/4.60 %------ where the first argument stands for the sort ($i in the unsorted case)
% 4.41/4.60
% 4.41/4.60
% 4.41/4.60
% 4.41/4.60
% 4.41/4.60 %------ Negative definition of equality_sorted
% 4.41/4.60 fof(lit_def,axiom,
% 4.41/4.60 (! [X0,X0,X1] :
% 4.41/4.60 ( ~(equality_sorted(X0,X0,X1)) <=>
% 4.41/4.60 (
% 4.41/4.60 (
% 4.41/4.60 ( X0=$i & X0=age(sk3,sk1(sk3)) & X1=sigma )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=$i & X0=age(sk3,sk1(sk3)) & X1=tau )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=$i & X0=age(sk3,sk2(sk3)) & X1=sigma )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=$i & X0=age(sk3,sk2(sk3)) & X1=tau )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 ? [X2] :
% 4.41/4.60 (
% 4.41/4.60 ( X0=$i & X0=age(sk3,X2) & X1=sigma )
% 4.41/4.60 &
% 4.41/4.60 ( X2!=sk1(sk3) )
% 4.41/4.60 &
% 4.41/4.60 ( X2!=sk2(sk3) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 ).
% 4.41/4.60
% 4.41/4.60 %------ Negative definition of smaller_or_equal
% 4.41/4.60 fof(lit_def,axiom,
% 4.41/4.60 (! [X0,X1] :
% 4.41/4.60 ( ~(smaller_or_equal(X0,X1)) <=>
% 4.41/4.60 (
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,sk1(sk3)) & X1=sigma )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,sk2(sk3)) & X1=sigma )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 ? [X2] :
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,X2) & X1=sigma )
% 4.41/4.60 &
% 4.41/4.60 ( X2!=sk1(sk3) )
% 4.41/4.60 &
% 4.41/4.60 ( X2!=sk2(sk3) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 ).
% 4.41/4.60
% 4.41/4.60 %------ Negative definition of greater_or_equal
% 4.41/4.60 fof(lit_def,axiom,
% 4.41/4.60 (! [X0,X1] :
% 4.41/4.60 ( ~(greater_or_equal(X0,X1)) <=>
% 4.41/4.60 (
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,sk1(sk3)) & X1=tau )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,sk2(sk3)) & X1=tau )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 ).
% 4.41/4.60
% 4.41/4.60 %------ Positive definition of smaller
% 4.41/4.60 fof(lit_def,axiom,
% 4.41/4.60 (! [X0,X1] :
% 4.41/4.60 ( smaller(X0,X1) <=>
% 4.41/4.60 (
% 4.41/4.60 (
% 4.41/4.60 ( X0=sigma & X1=age(sk3,sk1(sk3)) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=sigma & X1=age(sk3,sk2(sk3)) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 ? [X2] :
% 4.41/4.60 (
% 4.41/4.60 ( X0=sigma & X1=age(sk3,X2) )
% 4.41/4.60 &
% 4.41/4.60 ( X2!=sk2(sk3) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,sk1(sk3)) & X1=tau )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,sk2(sk3)) & X1=tau )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X1=tau )
% 4.41/4.60 &
% 4.41/4.60 ( X0!=tau )
% 4.41/4.60 &
% 4.41/4.60 ( X0!=age(sk3,X0) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 ? [X2] :
% 4.41/4.60 (
% 4.41/4.60 ( X1=age(sk3,X2) )
% 4.41/4.60 &
% 4.41/4.60 ( X0!=sigma | X2!=sk2(sk3) )
% 4.41/4.60 &
% 4.41/4.60 ( X0!=tau )
% 4.41/4.60 &
% 4.41/4.60 ( X0!=tau | X2!=sk1(sk3) )
% 4.41/4.60 &
% 4.41/4.60 ( X0!=tau | X2!=sk2(sk3) )
% 4.41/4.60 &
% 4.41/4.60 ( X0!=age(sk3,X0) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 ).
% 4.41/4.60
% 4.41/4.60 %------ Positive definition of greater
% 4.41/4.60 fof(lit_def,axiom,
% 4.41/4.60 (! [X0,X1] :
% 4.41/4.60 ( greater(X0,X1) <=>
% 4.41/4.60 (
% 4.41/4.60 (
% 4.41/4.60 ( X0=tau )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=tau )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,sk1(sk3)) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,sk2(sk3)) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,X1) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=tau & X1=sigma )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=tau & X1=age(sk3,sk1(sk3)) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=tau & X1=age(sk3,sk2(sk3)) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,sk1(sk3)) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=tau )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,sk1(sk3)) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,X1) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,sk1(sk3)) & X1=sigma )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,sk2(sk3)) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=tau )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,sk2(sk3)) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,X1) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,sk2(sk3)) & X1=sigma )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 ? [X2] :
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,X2) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=sigma | X2!=sk1(sk3) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=sigma | X2!=sk2(sk3) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=tau )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=tau | X2!=sk1(sk3) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=tau | X2!=sk2(sk3) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,sk2(sk3)) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,X1) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,X2) | X2!=sk1(sk3) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,X3) | X2!=sk1(sk3) )
% 4.41/4.60 &
% 4.41/4.60 ( X1!=age(sk3,X3) | X2!=sk2(sk3) )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 |
% 4.41/4.60 ? [X2] :
% 4.41/4.60 (
% 4.41/4.60 ( X0=age(sk3,X2) & X1=sigma )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 ).
% 4.41/4.60
% 4.41/4.60 %------ Positive definition of positional_advantage
% 4.41/4.60 fof(lit_def,axiom,
% 4.41/4.60 (! [X0,X1] :
% 4.41/4.60 ( positional_advantage(X0,X1) <=>
% 4.41/4.60 $false
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 ).
% 4.41/4.60
% 4.41/4.60 %------ Positive definition of fragile_position
% 4.41/4.60 fof(lit_def,axiom,
% 4.41/4.60 (! [X0] :
% 4.41/4.60 ( fragile_position(X0) <=>
% 4.41/4.60 (
% 4.41/4.60 (
% 4.41/4.60 ( X0=sk3 )
% 4.41/4.60 )
% 4.41/4.60
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 ).
% 4.41/4.60
% 4.41/4.60 %------ Negative definition of robust_position
% 4.41/4.60 fof(lit_def,axiom,
% 4.41/4.60 (! [X0] :
% 4.41/4.60 ( ~(robust_position(X0)) <=>
% 4.41/4.60 $false
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 ).
% 4.41/4.60
% 4.41/4.60 %------ Negative definition of organization
% 4.41/4.60 fof(lit_def,axiom,
% 4.41/4.60 (! [X0] :
% 4.41/4.60 ( ~(organization(X0)) <=>
% 4.41/4.60 $false
% 4.41/4.60 )
% 4.41/4.60 )
% 4.41/4.60 ).
% 4.41/4.60
% 4.41/4.60
% 4.41/4.60
% 4.41/4.60 % ------ Statistics
% 4.41/4.60
% 4.41/4.60 % ------ General
% 4.41/4.60
% 4.41/4.60 % num_of_input_clauses: 68
% 4.41/4.60 % num_of_input_neg_conjectures: 6
% 4.41/4.60 % num_of_splits: 0
% 4.41/4.60 % num_of_split_atoms: 0
% 4.41/4.60 % num_of_sem_filtered_clauses: 0
% 4.41/4.60 % num_of_subtypes: 0
% 4.41/4.60 % monotx_restored_types: 0
% 4.41/4.60 % sat_num_of_epr_types: 0
% 4.41/4.60 % sat_num_of_non_cyclic_types: 0
% 4.41/4.60 % sat_guarded_non_collapsed_types: 0
% 4.41/4.60 % is_epr: 0
% 4.41/4.60 % is_horn: 0
% 4.41/4.60 % has_eq: 1
% 4.41/4.60 % num_pure_diseq_elim: 0
% 4.41/4.60 % simp_replaced_by: 0
% 4.41/4.60 % res_preprocessed: 12
% 4.41/4.60 % prep_upred: 0
% 4.41/4.60 % prep_unflattend: 0
% 4.41/4.60 % pred_elim_cands: 0
% 4.41/4.60 % pred_elim: 0
% 4.41/4.60 % pred_elim_cl: 0
% 4.41/4.60 % pred_elim_cycles: 0
% 4.41/4.60 % forced_gc_time: 0
% 4.41/4.60 % gc_basic_clause_elim: 0
% 4.41/4.60 % parsing_time: 0.003
% 4.41/4.60 % sem_filter_time: 0.
% 4.41/4.60 % pred_elim_time: 0.
% 4.41/4.60 % out_proof_time: 0.
% 4.41/4.60 % monotx_time: 0.
% 4.41/4.60 % subtype_inf_time: 0.
% 4.41/4.60 % unif_index_cands_time: 0.001
% 4.41/4.60 % unif_index_add_time: 0.001
% 4.41/4.60 % total_time: 4.102
% 4.41/4.60 % num_of_symbols: 41
% 4.41/4.60 % num_of_terms: 911
% 4.41/4.60
% 4.41/4.60 % ------ Propositional Solver
% 4.41/4.60
% 4.41/4.60 % prop_solver_calls: 13
% 4.41/4.60 % prop_fast_solver_calls: 18
% 4.41/4.60 % prop_num_of_clauses: 269
% 4.41/4.60 % prop_preprocess_simplified: 747
% 4.41/4.60 % prop_fo_subsumed: 0
% 4.41/4.60 % prop_solver_time: 0.
% 4.41/4.60 % prop_fast_solver_time: 0.
% 4.41/4.60 % prop_unsat_core_time: 0.
% 4.41/4.60
% 4.41/4.60 % ------ QBF
% 4.41/4.60
% 4.41/4.60 % qbf_q_res: 0
% 4.41/4.60 % qbf_num_tautologies: 0
% 4.41/4.60 % qbf_prep_cycles: 0
% 4.41/4.60
% 4.41/4.60 % ------ BMC1
% 4.41/4.60
% 4.41/4.60 % bmc1_current_bound: -1
% 4.41/4.60 % bmc1_last_solved_bound: -1
% 4.41/4.60 % bmc1_unsat_core_size: -1
% 4.41/4.60 % bmc1_unsat_core_parents_size: -1
% 4.41/4.60 % bmc1_merge_next_fun: 0
% 4.41/4.60 % bmc1_unsat_core_clauses_time: 0.
% 4.41/4.60
% 4.41/4.60 % ------ Instantiation
% 4.41/4.60
% 4.41/4.60 % inst_num_of_clauses: 254
% 4.41/4.60 % inst_num_in_passive: 0
% 4.41/4.60 % inst_num_in_active: 237
% 4.41/4.60 % inst_num_in_unprocessed: 0
% 4.41/4.60 % inst_num_of_loops: 414
% 4.41/4.60 % inst_num_of_learning_restarts: 0
% 4.41/4.60 % inst_num_moves_active_passive: 146
% 4.41/4.60 % inst_lit_activity: 46
% 4.41/4.60 % inst_lit_activity_moves: 0
% 4.41/4.60 % inst_num_tautologies: 17
% 4.41/4.60 % inst_num_prop_implied: 0
% 4.41/4.60 % inst_num_existing_simplified: 0
% 4.41/4.60 % inst_num_eq_res_simplified: 0
% 4.41/4.60 % inst_num_child_elim: 0
% 4.41/4.60 % inst_num_of_dismatching_blockings: 158
% 4.41/4.60 % inst_num_of_non_proper_insts: 841
% 4.41/4.60 % inst_num_of_duplicates: 543
% 4.41/4.60 % inst_inst_num_from_inst_to_res: 0
% 4.41/4.60 % inst_dismatching_checking_time: 0.
% 4.41/4.60
% 4.41/4.60 % ------ Resolution
% 4.41/4.60
% 4.41/4.60 % res_num_of_clauses: 750
% 4.41/4.60 % res_num_in_passive: 35
% 4.41/4.60 % res_num_in_active: 670
% 4.41/4.60 % res_num_of_loops: 2000
% 4.41/4.60 % res_forward_subset_subsumed: 1114
% 4.41/4.60 % res_backward_subset_subsumed: 0
% 4.41/4.60 % res_forward_subsumed: 1353
% 4.41/4.60 % res_backward_subsumed: 0
% 4.41/4.60 % res_forward_subsumption_resolution: 2
% 4.41/4.60 % res_backward_subsumption_resolution: 0
% 4.41/4.60 % res_clause_to_clause_subsumption: 180861
% 4.41/4.60 % res_orphan_elimination: 0
% 4.41/4.60 % res_tautology_del: 6
% 4.41/4.60 % res_num_eq_res_simplified: 0
% 4.41/4.60 % res_num_sel_changes: 0
% 4.41/4.60 % res_moves_from_active_to_pass: 0
% 4.41/4.60
% 4.41/4.60 % Status Unknown
% 4.41/4.60 % Last status :
% 4.41/4.60 % SZS status Unknown
%------------------------------------------------------------------------------