TSTP Solution File: MGT042-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT042-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n021.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:13:58 EDT 2022
% Result : Unknown 15.94s 16.14s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT042-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 10:00:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.40 % Orientation found
% 0.12/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_a2d57e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_f95664.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_6e92cc | grep -v "SZS"
% 0.18/0.42
% 0.18/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.18/0.42
% 0.18/0.42 %
% 0.18/0.42 % ------ iProver source info
% 0.18/0.42
% 0.18/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.18/0.42 % git: non_committed_changes: true
% 0.18/0.42 % git: last_make_outside_of_git: true
% 0.18/0.42
% 0.18/0.42 %
% 0.18/0.42 % ------ Input Options
% 0.18/0.42
% 0.18/0.42 % --out_options all
% 0.18/0.42 % --tptp_safe_out true
% 0.18/0.42 % --problem_path ""
% 0.18/0.42 % --include_path ""
% 0.18/0.42 % --clausifier .//eprover
% 0.18/0.42 % --clausifier_options --tstp-format
% 0.18/0.42 % --stdin false
% 0.18/0.42 % --dbg_backtrace false
% 0.18/0.42 % --dbg_dump_prop_clauses false
% 0.18/0.42 % --dbg_dump_prop_clauses_file -
% 0.18/0.42 % --dbg_out_stat false
% 0.18/0.42
% 0.18/0.42 % ------ General Options
% 0.18/0.42
% 0.18/0.42 % --fof false
% 0.18/0.42 % --time_out_real 150.
% 0.18/0.42 % --time_out_prep_mult 0.2
% 0.18/0.42 % --time_out_virtual -1.
% 0.18/0.42 % --schedule none
% 0.18/0.42 % --ground_splitting input
% 0.18/0.42 % --splitting_nvd 16
% 0.18/0.42 % --non_eq_to_eq false
% 0.18/0.42 % --prep_gs_sim true
% 0.18/0.42 % --prep_unflatten false
% 0.18/0.42 % --prep_res_sim true
% 0.18/0.42 % --prep_upred true
% 0.18/0.42 % --res_sim_input true
% 0.18/0.42 % --clause_weak_htbl true
% 0.18/0.42 % --gc_record_bc_elim false
% 0.18/0.42 % --symbol_type_check false
% 0.18/0.42 % --clausify_out false
% 0.18/0.42 % --large_theory_mode false
% 0.18/0.42 % --prep_sem_filter none
% 0.18/0.42 % --prep_sem_filter_out false
% 0.18/0.42 % --preprocessed_out false
% 0.18/0.42 % --sub_typing false
% 0.18/0.42 % --brand_transform false
% 0.18/0.42 % --pure_diseq_elim true
% 0.18/0.42 % --min_unsat_core false
% 0.18/0.42 % --pred_elim true
% 0.18/0.42 % --add_important_lit false
% 0.18/0.42 % --soft_assumptions false
% 0.18/0.42 % --reset_solvers false
% 0.18/0.42 % --bc_imp_inh []
% 0.18/0.42 % --conj_cone_tolerance 1.5
% 0.18/0.42 % --prolific_symb_bound 500
% 0.18/0.42 % --lt_threshold 2000
% 0.18/0.42
% 0.18/0.42 % ------ SAT Options
% 0.18/0.42
% 0.18/0.42 % --sat_mode false
% 0.18/0.42 % --sat_fm_restart_options ""
% 0.18/0.42 % --sat_gr_def false
% 0.18/0.42 % --sat_epr_types true
% 0.18/0.42 % --sat_non_cyclic_types false
% 0.18/0.42 % --sat_finite_models false
% 0.18/0.42 % --sat_fm_lemmas false
% 0.18/0.42 % --sat_fm_prep false
% 0.18/0.42 % --sat_fm_uc_incr true
% 0.18/0.42 % --sat_out_model small
% 0.18/0.42 % --sat_out_clauses false
% 0.18/0.42
% 0.18/0.42 % ------ QBF Options
% 0.18/0.42
% 0.18/0.42 % --qbf_mode false
% 0.18/0.42 % --qbf_elim_univ true
% 0.18/0.42 % --qbf_sk_in true
% 0.18/0.42 % --qbf_pred_elim true
% 0.18/0.42 % --qbf_split 32
% 0.18/0.42
% 0.18/0.42 % ------ BMC1 Options
% 0.18/0.42
% 0.18/0.42 % --bmc1_incremental false
% 0.18/0.42 % --bmc1_axioms reachable_all
% 0.18/0.42 % --bmc1_min_bound 0
% 0.18/0.42 % --bmc1_max_bound -1
% 0.18/0.42 % --bmc1_max_bound_default -1
% 0.18/0.42 % --bmc1_symbol_reachability true
% 0.18/0.42 % --bmc1_property_lemmas false
% 0.18/0.42 % --bmc1_k_induction false
% 0.18/0.42 % --bmc1_non_equiv_states false
% 0.18/0.42 % --bmc1_deadlock false
% 0.18/0.42 % --bmc1_ucm false
% 0.18/0.42 % --bmc1_add_unsat_core none
% 0.18/0.42 % --bmc1_unsat_core_children false
% 0.18/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.42 % --bmc1_out_stat full
% 0.18/0.42 % --bmc1_ground_init false
% 0.18/0.42 % --bmc1_pre_inst_next_state false
% 0.18/0.42 % --bmc1_pre_inst_state false
% 0.18/0.42 % --bmc1_pre_inst_reach_state false
% 0.18/0.42 % --bmc1_out_unsat_core false
% 0.18/0.42 % --bmc1_aig_witness_out false
% 0.18/0.42 % --bmc1_verbose false
% 0.18/0.42 % --bmc1_dump_clauses_tptp false
% 0.18/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.43 % --bmc1_dump_file -
% 0.18/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.43 % --bmc1_ucm_extend_mode 1
% 0.18/0.43 % --bmc1_ucm_init_mode 2
% 0.18/0.43 % --bmc1_ucm_cone_mode none
% 0.18/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.43 % --bmc1_ucm_relax_model 4
% 0.18/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.43 % --bmc1_ucm_layered_model none
% 0.18/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.43
% 0.18/0.43 % ------ AIG Options
% 0.18/0.43
% 0.18/0.43 % --aig_mode false
% 0.18/0.43
% 0.18/0.43 % ------ Instantiation Options
% 0.18/0.43
% 0.18/0.43 % --instantiation_flag true
% 0.18/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.43 % --inst_solver_per_active 750
% 0.18/0.43 % --inst_solver_calls_frac 0.5
% 0.18/0.43 % --inst_passive_queue_type priority_queues
% 0.18/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.43 % --inst_passive_queues_freq [25;2]
% 0.18/0.43 % --inst_dismatching true
% 0.18/0.43 % --inst_eager_unprocessed_to_passive true
% 0.18/0.43 % --inst_prop_sim_given true
% 0.18/0.43 % --inst_prop_sim_new false
% 0.18/0.43 % --inst_orphan_elimination true
% 0.18/0.43 % --inst_learning_loop_flag true
% 0.18/0.43 % --inst_learning_start 3000
% 0.18/0.43 % --inst_learning_factor 2
% 0.18/0.43 % --inst_start_prop_sim_after_learn 3
% 0.18/0.43 % --inst_sel_renew solver
% 0.18/0.43 % --inst_lit_activity_flag true
% 0.18/0.43 % --inst_out_proof true
% 0.18/0.43
% 0.18/0.43 % ------ Resolution Options
% 0.18/0.43
% 0.18/0.43 % --resolution_flag true
% 0.18/0.43 % --res_lit_sel kbo_max
% 0.18/0.43 % --res_to_prop_solver none
% 0.18/0.43 % --res_prop_simpl_new false
% 0.18/0.43 % --res_prop_simpl_given false
% 0.18/0.43 % --res_passive_queue_type priority_queues
% 0.18/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.43 % --res_passive_queues_freq [15;5]
% 0.18/0.43 % --res_forward_subs full
% 0.18/0.43 % --res_backward_subs full
% 0.18/0.43 % --res_forward_subs_resolution true
% 0.18/0.43 % --res_backward_subs_resolution true
% 0.18/0.43 % --res_orphan_elimination false
% 0.18/0.43 % --res_time_limit 1000.
% 0.18/0.43 % --res_out_proof true
% 0.18/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a2d57e.s
% 0.18/0.43 % --modulo true
% 0.18/0.43
% 0.18/0.43 % ------ Combination Options
% 0.18/0.43
% 0.18/0.43 % --comb_res_mult 1000
% 0.18/0.43 % --comb_inst_mult 300
% 0.18/0.43 % ------
% 0.18/0.43
% 0.18/0.43 % ------ Parsing...% successful
% 0.18/0.43
% 0.18/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.18/0.43
% 0.18/0.43 % ------ Proving...
% 0.18/0.43 % ------ Problem Properties
% 0.18/0.43
% 0.18/0.43 %
% 0.18/0.43 % EPR false
% 0.18/0.43 % Horn false
% 0.18/0.43 % Has equality true
% 0.18/0.43
% 0.18/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 % % ------ Current options:
% 0.18/0.43
% 0.18/0.43 % ------ Input Options
% 0.18/0.43
% 0.18/0.43 % --out_options all
% 0.18/0.43 % --tptp_safe_out true
% 0.18/0.43 % --problem_path ""
% 0.18/0.43 % --include_path ""
% 0.18/0.43 % --clausifier .//eprover
% 0.18/0.43 % --clausifier_options --tstp-format
% 0.18/0.43 % --stdin false
% 0.18/0.43 % --dbg_backtrace false
% 0.18/0.43 % --dbg_dump_prop_clauses false
% 0.18/0.43 % --dbg_dump_prop_clauses_file -
% 0.18/0.43 % --dbg_out_stat false
% 0.18/0.43
% 0.18/0.43 % ------ General Options
% 0.18/0.43
% 0.18/0.43 % --fof false
% 0.18/0.43 % --time_out_real 150.
% 0.18/0.43 % --time_out_prep_mult 0.2
% 0.18/0.43 % --time_out_virtual -1.
% 0.18/0.43 % --schedule none
% 0.18/0.43 % --ground_splitting input
% 0.18/0.43 % --splitting_nvd 16
% 0.18/0.43 % --non_eq_to_eq false
% 0.18/0.43 % --prep_gs_sim true
% 0.18/0.43 % --prep_unflatten false
% 0.18/0.43 % --prep_res_sim true
% 0.18/0.43 % --prep_upred true
% 0.18/0.43 % --res_sim_input true
% 0.18/0.43 % --clause_weak_htbl true
% 0.18/0.43 % --gc_record_bc_elim false
% 0.18/0.43 % --symbol_type_check false
% 0.18/0.43 % --clausify_out false
% 0.18/0.43 % --large_theory_mode false
% 0.18/0.43 % --prep_sem_filter none
% 0.18/0.43 % --prep_sem_filter_out false
% 0.18/0.43 % --preprocessed_out false
% 0.18/0.43 % --sub_typing false
% 0.18/0.43 % --brand_transform false
% 0.18/0.43 % --pure_diseq_elim true
% 0.18/0.43 % --min_unsat_core false
% 0.18/0.43 % --pred_elim true
% 0.18/0.43 % --add_important_lit false
% 0.18/0.43 % --soft_assumptions false
% 0.18/0.43 % --reset_solvers false
% 0.18/0.43 % --bc_imp_inh []
% 0.18/0.43 % --conj_cone_tolerance 1.5
% 0.18/0.43 % --prolific_symb_bound 500
% 0.18/0.43 % --lt_threshold 2000
% 0.18/0.43
% 0.18/0.43 % ------ SAT Options
% 0.18/0.43
% 0.18/0.43 % --sat_mode false
% 0.18/0.43 % --sat_fm_restart_options ""
% 0.18/0.43 % --sat_gr_def false
% 0.18/0.43 % --sat_epr_types true
% 0.18/0.43 % --sat_non_cyclic_types false
% 0.18/0.43 % --sat_finite_models false
% 0.18/0.43 % --sat_fm_lemmas false
% 0.18/0.43 % --sat_fm_prep false
% 0.18/0.43 % --sat_fm_uc_incr true
% 0.18/0.43 % --sat_out_model small
% 0.18/0.43 % --sat_out_clauses false
% 0.18/0.43
% 0.18/0.43 % ------ QBF Options
% 0.18/0.43
% 0.18/0.43 % --qbf_mode false
% 0.18/0.43 % --qbf_elim_univ true
% 0.18/0.43 % --qbf_sk_in true
% 0.18/0.43 % --qbf_pred_elim true
% 0.18/0.43 % --qbf_split 32
% 0.18/0.43
% 0.18/0.43 % ------ BMC1 Options
% 0.18/0.43
% 0.18/0.43 % --bmc1_incremental false
% 0.18/0.43 % --bmc1_axioms reachable_all
% 0.18/0.43 % --bmc1_min_bound 0
% 0.18/0.43 % --bmc1_max_bound -1
% 0.18/0.43 % --bmc1_max_bound_default -1
% 0.18/0.43 % --bmc1_symbol_reachability true
% 0.18/0.43 % --bmc1_property_lemmas false
% 0.18/0.43 % --bmc1_k_induction false
% 0.18/0.43 % --bmc1_non_equiv_states false
% 0.18/0.43 % --bmc1_deadlock false
% 0.18/0.43 % --bmc1_ucm false
% 0.18/0.43 % --bmc1_add_unsat_core none
% 0.18/0.43 % --bmc1_unsat_core_children false
% 0.18/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.43 % --bmc1_out_stat full
% 0.18/0.43 % --bmc1_ground_init false
% 0.18/0.43 % --bmc1_pre_inst_next_state false
% 0.18/0.43 % --bmc1_pre_inst_state false
% 0.18/0.43 % --bmc1_pre_inst_reach_state false
% 0.18/0.43 % --bmc1_out_unsat_core false
% 0.18/0.43 % --bmc1_aig_witness_out false
% 0.18/0.43 % --bmc1_verbose false
% 0.18/0.43 % --bmc1_dump_clauses_tptp false
% 0.18/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.43 % --bmc1_dump_file -
% 0.18/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.43 % --bmc1_ucm_extend_mode 1
% 0.18/0.43 % --bmc1_ucm_init_mode 2
% 0.18/0.43 % --bmc1_ucm_cone_mode none
% 0.18/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.43 % --bmc1_ucm_relax_model 4
% 0.18/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.43 % --bmc1_ucm_layered_model none
% 0.18/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.43
% 0.18/0.43 % ------ AIG Options
% 0.18/0.43
% 0.18/0.43 % --aig_mode false
% 0.18/0.43
% 0.18/0.43 % ------ Instantiation Options
% 0.18/0.43
% 0.18/0.43 % --instantiation_flag true
% 0.18/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.43 % --inst_solver_per_active 750
% 0.18/0.43 % --inst_solver_calls_frac 0.5
% 0.18/0.43 % --inst_passive_queue_type priority_queues
% 0.18/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.43 % --inst_passive_queues_freq [25;2]
% 0.18/0.43 % --inst_dismatching true
% 0.18/0.43 % --inst_eager_unprocessed_to_passive true
% 0.18/0.43 % --inst_prop_sim_given true
% 14.49/14.69 % --inst_prop_sim_new false
% 14.49/14.69 % --inst_orphan_elimination true
% 14.49/14.69 % --inst_learning_loop_flag true
% 14.49/14.69 % --inst_learning_start 3000
% 14.49/14.69 % --inst_learning_factor 2
% 14.49/14.69 % --inst_start_prop_sim_after_learn 3
% 14.49/14.69 % --inst_sel_renew solver
% 14.49/14.69 % --inst_lit_activity_flag true
% 14.49/14.69 % --inst_out_proof true
% 14.49/14.69
% 14.49/14.69 % ------ Resolution Options
% 14.49/14.69
% 14.49/14.69 % --resolution_flag true
% 14.49/14.69 % --res_lit_sel kbo_max
% 14.49/14.69 % --res_to_prop_solver none
% 14.49/14.69 % --res_prop_simpl_new false
% 14.49/14.69 % --res_prop_simpl_given false
% 14.49/14.69 % --res_passive_queue_type priority_queues
% 14.49/14.69 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 14.49/14.69 % --res_passive_queues_freq [15;5]
% 14.49/14.69 % --res_forward_subs full
% 14.49/14.69 % --res_backward_subs full
% 14.49/14.69 % --res_forward_subs_resolution true
% 14.49/14.69 % --res_backward_subs_resolution true
% 14.49/14.69 % --res_orphan_elimination false
% 14.49/14.69 % --res_time_limit 1000.
% 14.49/14.69 % --res_out_proof true
% 14.49/14.69 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a2d57e.s
% 14.49/14.69 % --modulo true
% 14.49/14.69
% 14.49/14.69 % ------ Combination Options
% 14.49/14.69
% 14.49/14.69 % --comb_res_mult 1000
% 14.49/14.69 % --comb_inst_mult 300
% 14.49/14.69 % ------
% 14.49/14.69
% 14.49/14.69
% 14.49/14.69
% 14.49/14.69 % ------ Proving...
% 14.49/14.69 % warning: shown sat in sat incomplete mode
% 14.49/14.69 %
% 14.49/14.69
% 14.49/14.69
% 14.49/14.69 ------ Building Model...Done
% 14.49/14.69
% 14.49/14.69 %------ The model is defined over ground terms (initial term algebra).
% 14.49/14.69 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 14.49/14.69 %------ where \phi is a formula over the term algebra.
% 14.49/14.69 %------ If we have equality in the problem then it is also defined as a predicate above,
% 14.49/14.69 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 14.49/14.69 %------ See help for --sat_out_model for different model outputs.
% 14.49/14.69 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 14.49/14.69 %------ where the first argument stands for the sort ($i in the unsorted case)
% 14.49/14.69
% 14.49/14.69
% 14.49/14.69
% 14.49/14.69
% 14.49/14.69 %------ Negative definition of equality_sorted
% 14.49/14.69 fof(lit_def,axiom,
% 14.49/14.69 (! [X0,X0,X1] :
% 14.49/14.69 ( ~(equality_sorted(X0,X0,X1)) <=>
% 14.49/14.69 (
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=external_ties(sk1,sk2) & X1=external_ties(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=external_ties(sk1,sk2) & X1=external_ties(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=internal_friction(sk1,sk3) & X1=internal_friction(sk1,sk2) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=internal_friction(sk1,sk2) & X1=internal_friction(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=stock_of_knowledge(sk1,sk2) & X1=stock_of_knowledge(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=stock_of_knowledge(sk1,sk2) & X1=stock_of_knowledge(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=capability(sk1,sk3) & X1=capability(sk1,sk2) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=position(sk1,sk2) & X1=position(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=position(sk1,sk2) & X1=position(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=capability(sk1,sk2) & X1=capability(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=stock_of_knowledge(sk1,X2) & X1=stock_of_knowledge(sk1,sk3) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=$i & X0=internal_friction(sk1,X2) & X1=internal_friction(sk1,sk2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 ).
% 14.49/14.69
% 14.49/14.69 %------ Positive definition of smaller
% 14.49/14.69 fof(lit_def,axiom,
% 14.49/14.69 (! [X0,X1] :
% 14.49/14.69 ( smaller(X0,X1) <=>
% 14.49/14.69 (
% 14.49/14.69 (
% 14.49/14.69 ( X0=external_ties(sk1,sk2) & X1=external_ties(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=external_ties(sk1,sk2) & X1=external_ties(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=internal_friction(sk1,sk3) & X1=internal_friction(sk1,sk2) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=internal_friction(sk1,sk3) & X1=internal_friction(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=internal_friction(sk1,sk2) & X1=internal_friction(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=stock_of_knowledge(sk1,sk3) & X1=stock_of_knowledge(sk1,sk2) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=stock_of_knowledge(sk1,sk3) & X1=stock_of_knowledge(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=stock_of_knowledge(sk1,sk2) & X1=stock_of_knowledge(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=capability(sk1,sk3) & X1=capability(sk1,sk2) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=capability(sk1,sk3) & X1=capability(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=position(sk1,sk2) & X1=position(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=position(sk1,sk2) & X1=position(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=capability(sk1,X2) & X1=capability(sk1,sk2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 ).
% 14.49/14.69
% 14.49/14.69 %------ Negative definition of has_immunity
% 14.49/14.69 fof(lit_def,axiom,
% 14.49/14.69 (! [X0,X1] :
% 14.49/14.69 ( ~(has_immunity(X0,X1)) <=>
% 14.49/14.69 (
% 14.49/14.69 (
% 14.49/14.69 ( X0=sk1 & X1=sk3 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=sk1 & X1=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 ).
% 14.49/14.69
% 14.49/14.69 %------ Negative definition of greater_or_equal
% 14.49/14.69 fof(lit_def,axiom,
% 14.49/14.69 (! [X0,X1] :
% 14.49/14.69 ( ~(greater_or_equal(X0,X1)) <=>
% 14.49/14.69 (
% 14.49/14.69 (
% 14.49/14.69 ( X0=external_ties(sk1,sk2) & X1=external_ties(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=external_ties(sk1,sk2) & X1=external_ties(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=internal_friction(sk1,sk3) & X1=internal_friction(sk1,sk2) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=stock_of_knowledge(sk1,sk2) & X1=stock_of_knowledge(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=capability(sk1,sk3) & X1=capability(sk1,sk2) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=position(sk1,sk2) & X1=position(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=position(sk1,sk2) & X1=position(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 ).
% 14.49/14.69
% 14.49/14.69 %------ Positive definition of greater
% 14.49/14.69 fof(lit_def,axiom,
% 14.49/14.69 (! [X0,X1] :
% 14.49/14.69 ( greater(X0,X1) <=>
% 14.49/14.69 (
% 14.49/14.69 (
% 14.49/14.69 ( X0=external_ties(sk1,sk3) & X1=external_ties(sk1,sk2) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=internal_friction(sk1,sk2) & X1=internal_friction(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=stock_of_knowledge(sk1,sk2) & X1=stock_of_knowledge(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=position(sk1,sk3) & X1=position(sk1,sk2) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=capability(sk1,sk2) & X1=capability(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=capability(sk1,sk2) & X1=capability(sk1,X2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=position(sk1,X2) & X1=position(sk1,sk2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=external_ties(sk1,X2) & X1=external_ties(sk1,sk2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=capability(sk1,X2) & X1=capability(sk1,sk3) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=stock_of_knowledge(sk1,X2) & X1=stock_of_knowledge(sk1,sk3) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=stock_of_knowledge(sk1,X2) & X1=stock_of_knowledge(sk1,sk2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=internal_friction(sk1,X2) & X1=internal_friction(sk1,sk3) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=internal_friction(sk1,X2) & X1=internal_friction(sk1,sk2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 ).
% 14.49/14.69
% 14.49/14.69 %------ Negative definition of organization
% 14.49/14.69 fof(lit_def,axiom,
% 14.49/14.69 (! [X0] :
% 14.49/14.69 ( ~(organization(X0)) <=>
% 14.49/14.69 $false
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 ).
% 14.49/14.69
% 14.49/14.69 %------ Negative definition of smaller_or_equal
% 14.49/14.69 fof(lit_def,axiom,
% 14.49/14.69 (! [X0,X1] :
% 14.49/14.69 ( ~(smaller_or_equal(X0,X1)) <=>
% 14.49/14.69 (
% 14.49/14.69 (
% 14.49/14.69 ( X0=internal_friction(sk1,sk2) & X1=internal_friction(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=stock_of_knowledge(sk1,sk2) & X1=stock_of_knowledge(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 (
% 14.49/14.69 ( X0=capability(sk1,sk2) & X1=capability(sk1,sk3) )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=stock_of_knowledge(sk1,X2) & X1=stock_of_knowledge(sk1,sk3) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 |
% 14.49/14.69 ? [X2] :
% 14.49/14.69 (
% 14.49/14.69 ( X0=internal_friction(sk1,X2) & X1=internal_friction(sk1,sk2) )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk3 )
% 14.49/14.69 &
% 14.49/14.69 ( X2!=sk2 )
% 14.49/14.69 )
% 14.49/14.69
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 )
% 14.49/14.69 ).
% 14.49/14.69
% 14.49/14.69
% 14.49/14.69
% 14.49/14.69 % ------ Statistics
% 14.49/14.69
% 14.49/14.69 % ------ General
% 14.49/14.69
% 14.49/14.69 % num_of_input_clauses: 81
% 14.49/14.69 % num_of_input_neg_conjectures: 19
% 14.49/14.69 % num_of_splits: 0
% 14.49/14.69 % num_of_split_atoms: 0
% 14.49/14.69 % num_of_sem_filtered_clauses: 0
% 14.49/14.69 % num_of_subtypes: 0
% 14.49/14.69 % monotx_restored_types: 0
% 14.49/14.69 % sat_num_of_epr_types: 0
% 14.49/14.69 % sat_num_of_non_cyclic_types: 0
% 14.49/14.69 % sat_guarded_non_collapsed_types: 0
% 14.49/14.69 % is_epr: 0
% 14.49/14.69 % is_horn: 0
% 14.49/14.69 % has_eq: 1
% 14.49/14.69 % num_pure_diseq_elim: 0
% 14.49/14.69 % simp_replaced_by: 0
% 14.49/14.69 % res_preprocessed: 38
% 14.49/14.69 % prep_upred: 0
% 14.49/14.69 % prep_unflattend: 0
% 14.49/14.69 % pred_elim_cands: 0
% 14.49/14.69 % pred_elim: 0
% 14.49/14.69 % pred_elim_cl: 0
% 14.49/14.69 % pred_elim_cycles: 0
% 14.49/14.69 % forced_gc_time: 0
% 14.49/14.69 % gc_basic_clause_elim: 0
% 14.49/14.69 % parsing_time: 0.004
% 14.49/14.69 % sem_filter_time: 0.
% 14.49/14.69 % pred_elim_time: 0.
% 14.49/14.69 % out_proof_time: 0.
% 14.49/14.69 % monotx_time: 0.
% 14.49/14.69 % subtype_inf_time: 0.
% 14.49/14.69 % unif_index_cands_time: 0.008
% 14.49/14.69 % unif_index_add_time: 0.006
% 14.49/14.69 % total_time: 14.282
% 14.49/14.69 % num_of_symbols: 40
% 14.49/14.69 % num_of_terms: 2781
% 14.49/14.69
% 14.49/14.69 % ------ Propositional Solver
% 14.49/14.69
% 14.49/14.69 % prop_solver_calls: 24
% 14.49/14.69 % prop_fast_solver_calls: 99
% 14.49/14.69 % prop_num_of_clauses: 589
% 14.49/14.69 % prop_preprocess_simplified: 1307
% 14.49/14.69 % prop_fo_subsumed: 20
% 14.49/14.69 % prop_solver_time: 0.
% 14.49/14.69 % prop_fast_solver_time: 0.
% 14.49/14.69 % prop_unsat_core_time: 0.
% 14.49/14.69
% 14.49/14.69 % ------ QBF
% 14.49/14.69
% 14.49/14.69 % qbf_q_res: 0
% 14.49/14.69 % qbf_num_tautologies: 0
% 14.49/14.69 % qbf_prep_cycles: 0
% 14.49/14.69
% 14.49/14.69 % ------ BMC1
% 14.49/14.69
% 14.49/14.69 % bmc1_current_bound: -1
% 14.49/14.69 % bmc1_last_solved_bound: -1
% 14.49/14.69 % bmc1_unsat_core_size: -1
% 14.49/14.69 % bmc1_unsat_core_parents_size: -1
% 14.49/14.69 % bmc1_merge_next_fun: 0
% 14.49/14.69 % bmc1_unsat_core_clauses_time: 0.
% 14.49/14.69
% 14.49/14.69 % ------ Instantiation
% 14.49/14.69
% 14.49/14.69 % inst_num_of_clauses: 510
% 14.49/14.69 % inst_num_in_passive: 0
% 14.49/14.69 % inst_num_in_active: 465
% 14.49/14.69 % inst_num_in_unprocessed: 0
% 14.49/14.69 % inst_num_of_loops: 729
% 14.49/14.69 % inst_num_of_learning_restarts: 0
% 14.49/14.69 % inst_num_moves_active_passive: 218
% 14.49/14.69 % inst_lit_activity: 48
% 14.49/14.69 % inst_lit_activity_moves: 0
% 14.49/14.69 % inst_num_tautologies: 32
% 14.49/14.69 % inst_num_prop_implied: 0
% 14.49/14.69 % inst_num_existing_simplified: 0
% 14.49/14.69 % inst_num_eq_res_simplified: 13
% 14.49/14.69 % inst_num_child_elim: 0
% 14.49/14.69 % inst_num_of_dismatching_blockings: 223
% 14.49/14.69 % inst_num_of_non_proper_insts: 1915
% 14.49/14.69 % inst_num_of_duplicates: 958
% 14.49/14.69 % inst_inst_num_from_inst_to_res: 0
% 14.49/14.69 % inst_dismatching_checking_time: 0.
% 14.49/14.69
% 14.49/14.69 % ------ Resolution
% 14.49/14.69
% 14.49/14.69 % res_num_of_clauses: 39610
% 14.49/14.69 % res_num_in_passive: 37687
% 14.49/14.69 % res_num_in_active: 1901
% 14.49/14.69 % res_num_of_loops: 3000
% 14.49/14.69 % res_forward_subset_subsumed: 4721
% 14.49/14.69 % res_backward_subset_subsumed: 36
% 14.49/14.69 % res_forward_subsumed: 1085
% 14.49/14.69 % res_backward_subsumed: 36
% 14.49/14.69 % res_forward_subsumption_resolution: 260
% 14.49/14.69 % res_backward_subsumption_resolution: 1
% 14.49/14.69 % res_clause_to_clause_subsumption: 1068930
% 14.49/14.69 % res_orphan_elimination: 0
% 14.49/14.69 % res_tautology_del: 1152
% 14.49/14.69 % res_num_eq_res_simplified: 4
% 14.49/14.69 % res_num_sel_changes: 0
% 14.49/14.69 % res_moves_from_active_to_pass: 0
% 14.49/14.69
% 14.49/14.69 % Status Unknown
% 14.49/14.73 % Orienting using strategy ClausalAll
% 14.49/14.73 % Orientation found
% 14.49/14.73 % 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_a2d57e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_f95664.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_ae2d40 | grep -v "SZS"
% 14.49/14.76
% 14.49/14.76 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 14.49/14.76
% 14.49/14.76 %
% 14.49/14.76 % ------ iProver source info
% 14.49/14.76
% 14.49/14.76 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 14.49/14.76 % git: non_committed_changes: true
% 14.49/14.76 % git: last_make_outside_of_git: true
% 14.49/14.76
% 14.49/14.76 %
% 14.49/14.76 % ------ Input Options
% 14.49/14.76
% 14.49/14.76 % --out_options all
% 14.49/14.76 % --tptp_safe_out true
% 14.49/14.76 % --problem_path ""
% 14.49/14.76 % --include_path ""
% 14.49/14.76 % --clausifier .//eprover
% 14.49/14.76 % --clausifier_options --tstp-format
% 14.49/14.76 % --stdin false
% 14.49/14.76 % --dbg_backtrace false
% 14.49/14.76 % --dbg_dump_prop_clauses false
% 14.49/14.76 % --dbg_dump_prop_clauses_file -
% 14.49/14.76 % --dbg_out_stat false
% 14.49/14.76
% 14.49/14.76 % ------ General Options
% 14.49/14.76
% 14.49/14.76 % --fof false
% 14.49/14.76 % --time_out_real 150.
% 14.49/14.76 % --time_out_prep_mult 0.2
% 14.49/14.76 % --time_out_virtual -1.
% 14.49/14.76 % --schedule none
% 14.49/14.76 % --ground_splitting input
% 14.49/14.76 % --splitting_nvd 16
% 14.49/14.76 % --non_eq_to_eq false
% 14.49/14.76 % --prep_gs_sim true
% 14.49/14.76 % --prep_unflatten false
% 14.49/14.76 % --prep_res_sim true
% 14.49/14.76 % --prep_upred true
% 14.49/14.76 % --res_sim_input true
% 14.49/14.76 % --clause_weak_htbl true
% 14.49/14.76 % --gc_record_bc_elim false
% 14.49/14.76 % --symbol_type_check false
% 14.49/14.76 % --clausify_out false
% 14.49/14.76 % --large_theory_mode false
% 14.49/14.76 % --prep_sem_filter none
% 14.49/14.76 % --prep_sem_filter_out false
% 14.49/14.76 % --preprocessed_out false
% 14.49/14.76 % --sub_typing false
% 14.49/14.76 % --brand_transform false
% 14.49/14.76 % --pure_diseq_elim true
% 14.49/14.76 % --min_unsat_core false
% 14.49/14.76 % --pred_elim true
% 14.49/14.76 % --add_important_lit false
% 14.49/14.76 % --soft_assumptions false
% 14.49/14.76 % --reset_solvers false
% 14.49/14.76 % --bc_imp_inh []
% 14.49/14.76 % --conj_cone_tolerance 1.5
% 14.49/14.76 % --prolific_symb_bound 500
% 14.49/14.76 % --lt_threshold 2000
% 14.49/14.76
% 14.49/14.76 % ------ SAT Options
% 14.49/14.76
% 14.49/14.76 % --sat_mode false
% 14.49/14.76 % --sat_fm_restart_options ""
% 14.49/14.76 % --sat_gr_def false
% 14.49/14.76 % --sat_epr_types true
% 14.49/14.76 % --sat_non_cyclic_types false
% 14.49/14.76 % --sat_finite_models false
% 14.49/14.76 % --sat_fm_lemmas false
% 14.49/14.76 % --sat_fm_prep false
% 14.49/14.76 % --sat_fm_uc_incr true
% 14.49/14.76 % --sat_out_model small
% 14.49/14.76 % --sat_out_clauses false
% 14.49/14.76
% 14.49/14.76 % ------ QBF Options
% 14.49/14.76
% 14.49/14.76 % --qbf_mode false
% 14.49/14.76 % --qbf_elim_univ true
% 14.49/14.76 % --qbf_sk_in true
% 14.49/14.76 % --qbf_pred_elim true
% 14.49/14.76 % --qbf_split 32
% 14.49/14.76
% 14.49/14.76 % ------ BMC1 Options
% 14.49/14.76
% 14.49/14.76 % --bmc1_incremental false
% 14.49/14.76 % --bmc1_axioms reachable_all
% 14.49/14.76 % --bmc1_min_bound 0
% 14.49/14.76 % --bmc1_max_bound -1
% 14.49/14.76 % --bmc1_max_bound_default -1
% 14.49/14.76 % --bmc1_symbol_reachability true
% 14.49/14.76 % --bmc1_property_lemmas false
% 14.49/14.76 % --bmc1_k_induction false
% 14.49/14.76 % --bmc1_non_equiv_states false
% 14.49/14.76 % --bmc1_deadlock false
% 14.49/14.76 % --bmc1_ucm false
% 14.49/14.76 % --bmc1_add_unsat_core none
% 14.49/14.76 % --bmc1_unsat_core_children false
% 14.49/14.76 % --bmc1_unsat_core_extrapolate_axioms false
% 14.49/14.76 % --bmc1_out_stat full
% 14.49/14.76 % --bmc1_ground_init false
% 14.49/14.76 % --bmc1_pre_inst_next_state false
% 14.49/14.76 % --bmc1_pre_inst_state false
% 14.49/14.76 % --bmc1_pre_inst_reach_state false
% 14.49/14.76 % --bmc1_out_unsat_core false
% 14.49/14.76 % --bmc1_aig_witness_out false
% 14.49/14.76 % --bmc1_verbose false
% 14.49/14.76 % --bmc1_dump_clauses_tptp false
% 14.49/14.77 % --bmc1_dump_unsat_core_tptp false
% 14.49/14.77 % --bmc1_dump_file -
% 14.49/14.77 % --bmc1_ucm_expand_uc_limit 128
% 14.49/14.77 % --bmc1_ucm_n_expand_iterations 6
% 14.49/14.77 % --bmc1_ucm_extend_mode 1
% 14.49/14.77 % --bmc1_ucm_init_mode 2
% 14.49/14.77 % --bmc1_ucm_cone_mode none
% 14.49/14.77 % --bmc1_ucm_reduced_relation_type 0
% 14.49/14.77 % --bmc1_ucm_relax_model 4
% 14.49/14.77 % --bmc1_ucm_full_tr_after_sat true
% 14.49/14.77 % --bmc1_ucm_expand_neg_assumptions false
% 14.49/14.77 % --bmc1_ucm_layered_model none
% 14.49/14.77 % --bmc1_ucm_max_lemma_size 10
% 14.49/14.77
% 14.49/14.77 % ------ AIG Options
% 14.49/14.77
% 14.49/14.77 % --aig_mode false
% 14.49/14.77
% 14.49/14.77 % ------ Instantiation Options
% 14.49/14.77
% 14.49/14.77 % --instantiation_flag true
% 14.49/14.77 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 14.49/14.77 % --inst_solver_per_active 750
% 14.49/14.77 % --inst_solver_calls_frac 0.5
% 14.49/14.77 % --inst_passive_queue_type priority_queues
% 14.49/14.77 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 14.49/14.77 % --inst_passive_queues_freq [25;2]
% 14.49/14.77 % --inst_dismatching true
% 14.49/14.77 % --inst_eager_unprocessed_to_passive true
% 14.49/14.77 % --inst_prop_sim_given true
% 14.49/14.77 % --inst_prop_sim_new false
% 14.49/14.77 % --inst_orphan_elimination true
% 14.49/14.77 % --inst_learning_loop_flag true
% 14.49/14.77 % --inst_learning_start 3000
% 14.49/14.77 % --inst_learning_factor 2
% 14.49/14.77 % --inst_start_prop_sim_after_learn 3
% 14.49/14.77 % --inst_sel_renew solver
% 14.49/14.77 % --inst_lit_activity_flag true
% 14.49/14.77 % --inst_out_proof true
% 14.49/14.77
% 14.49/14.77 % ------ Resolution Options
% 14.49/14.77
% 14.49/14.77 % --resolution_flag true
% 14.49/14.77 % --res_lit_sel kbo_max
% 14.49/14.77 % --res_to_prop_solver none
% 14.49/14.77 % --res_prop_simpl_new false
% 14.49/14.77 % --res_prop_simpl_given false
% 14.49/14.77 % --res_passive_queue_type priority_queues
% 14.49/14.77 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 14.49/14.77 % --res_passive_queues_freq [15;5]
% 14.49/14.77 % --res_forward_subs full
% 14.49/14.77 % --res_backward_subs full
% 14.49/14.77 % --res_forward_subs_resolution true
% 14.49/14.77 % --res_backward_subs_resolution true
% 14.49/14.77 % --res_orphan_elimination false
% 14.49/14.77 % --res_time_limit 1000.
% 14.49/14.77 % --res_out_proof true
% 14.49/14.77 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a2d57e.s
% 14.49/14.77 % --modulo true
% 14.49/14.77
% 14.49/14.77 % ------ Combination Options
% 14.49/14.77
% 14.49/14.77 % --comb_res_mult 1000
% 14.49/14.77 % --comb_inst_mult 300
% 14.49/14.77 % ------
% 14.49/14.77
% 14.49/14.77 % ------ Parsing...% successful
% 14.49/14.77
% 14.49/14.77 % ------ 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 %
% 14.49/14.77
% 14.49/14.77 % ------ Proving...
% 14.49/14.77 % ------ Problem Properties
% 14.49/14.77
% 14.49/14.77 %
% 14.49/14.77 % EPR false
% 14.49/14.77 % Horn false
% 14.49/14.77 % Has equality true
% 14.49/14.77
% 14.49/14.77 % % ------ Input Options Time Limit: Unbounded
% 14.49/14.77
% 14.49/14.77
% 14.49/14.77 % % ------ Current options:
% 14.49/14.77
% 14.49/14.77 % ------ Input Options
% 14.49/14.77
% 14.49/14.77 % --out_options all
% 14.49/14.77 % --tptp_safe_out true
% 14.49/14.77 % --problem_path ""
% 14.49/14.77 % --include_path ""
% 14.49/14.77 % --clausifier .//eprover
% 14.49/14.77 % --clausifier_options --tstp-format
% 14.49/14.77 % --stdin false
% 14.49/14.77 % --dbg_backtrace false
% 14.49/14.77 % --dbg_dump_prop_clauses false
% 14.49/14.77 % --dbg_dump_prop_clauses_file -
% 14.49/14.77 % --dbg_out_stat false
% 14.49/14.77
% 14.49/14.77 % ------ General Options
% 14.49/14.77
% 14.49/14.77 % --fof false
% 14.49/14.77 % --time_out_real 150.
% 14.49/14.77 % --time_out_prep_mult 0.2
% 14.49/14.77 % --time_out_virtual -1.
% 14.49/14.77 % --schedule none
% 14.49/14.77 % --ground_splitting input
% 14.49/14.77 % --splitting_nvd 16
% 14.49/14.77 % --non_eq_to_eq false
% 14.49/14.77 % --prep_gs_sim true
% 14.49/14.77 % --prep_unflatten false
% 14.49/14.77 % --prep_res_sim true
% 14.49/14.77 % --prep_upred true
% 14.49/14.77 % --res_sim_input true
% 14.49/14.77 % --clause_weak_htbl true
% 14.49/14.77 % --gc_record_bc_elim false
% 14.49/14.77 % --symbol_type_check false
% 14.49/14.77 % --clausify_out false
% 14.49/14.77 % --large_theory_mode false
% 14.49/14.77 % --prep_sem_filter none
% 14.49/14.77 % --prep_sem_filter_out false
% 14.49/14.77 % --preprocessed_out false
% 14.49/14.77 % --sub_typing false
% 14.49/14.77 % --brand_transform false
% 14.49/14.77 % --pure_diseq_elim true
% 14.49/14.77 % --min_unsat_core false
% 14.49/14.77 % --pred_elim true
% 14.49/14.77 % --add_important_lit false
% 14.49/14.77 % --soft_assumptions false
% 14.49/14.77 % --reset_solvers false
% 14.49/14.77 % --bc_imp_inh []
% 14.49/14.77 % --conj_cone_tolerance 1.5
% 14.49/14.77 % --prolific_symb_bound 500
% 14.49/14.77 % --lt_threshold 2000
% 14.49/14.77
% 14.49/14.77 % ------ SAT Options
% 14.49/14.77
% 14.49/14.77 % --sat_mode false
% 14.49/14.77 % --sat_fm_restart_options ""
% 14.49/14.77 % --sat_gr_def false
% 14.49/14.77 % --sat_epr_types true
% 14.49/14.77 % --sat_non_cyclic_types false
% 14.49/14.77 % --sat_finite_models false
% 14.49/14.77 % --sat_fm_lemmas false
% 14.49/14.77 % --sat_fm_prep false
% 14.49/14.77 % --sat_fm_uc_incr true
% 14.49/14.77 % --sat_out_model small
% 14.49/14.77 % --sat_out_clauses false
% 14.49/14.77
% 14.49/14.77 % ------ QBF Options
% 14.49/14.77
% 14.49/14.77 % --qbf_mode false
% 14.49/14.77 % --qbf_elim_univ true
% 14.49/14.77 % --qbf_sk_in true
% 14.49/14.77 % --qbf_pred_elim true
% 14.49/14.77 % --qbf_split 32
% 14.49/14.77
% 14.49/14.77 % ------ BMC1 Options
% 14.49/14.77
% 14.49/14.77 % --bmc1_incremental false
% 14.49/14.77 % --bmc1_axioms reachable_all
% 14.49/14.77 % --bmc1_min_bound 0
% 14.49/14.77 % --bmc1_max_bound -1
% 14.49/14.77 % --bmc1_max_bound_default -1
% 14.49/14.77 % --bmc1_symbol_reachability true
% 14.49/14.77 % --bmc1_property_lemmas false
% 14.49/14.77 % --bmc1_k_induction false
% 14.49/14.77 % --bmc1_non_equiv_states false
% 14.49/14.77 % --bmc1_deadlock false
% 14.49/14.77 % --bmc1_ucm false
% 14.49/14.77 % --bmc1_add_unsat_core none
% 14.49/14.77 % --bmc1_unsat_core_children false
% 14.49/14.77 % --bmc1_unsat_core_extrapolate_axioms false
% 14.49/14.77 % --bmc1_out_stat full
% 14.49/14.77 % --bmc1_ground_init false
% 14.49/14.77 % --bmc1_pre_inst_next_state false
% 14.49/14.77 % --bmc1_pre_inst_state false
% 14.49/14.77 % --bmc1_pre_inst_reach_state false
% 14.49/14.77 % --bmc1_out_unsat_core false
% 14.49/14.77 % --bmc1_aig_witness_out false
% 14.49/14.77 % --bmc1_verbose false
% 14.49/14.77 % --bmc1_dump_clauses_tptp false
% 14.49/14.77 % --bmc1_dump_unsat_core_tptp false
% 14.49/14.77 % --bmc1_dump_file -
% 14.49/14.77 % --bmc1_ucm_expand_uc_limit 128
% 14.49/14.77 % --bmc1_ucm_n_expand_iterations 6
% 14.49/14.77 % --bmc1_ucm_extend_mode 1
% 14.49/14.77 % --bmc1_ucm_init_mode 2
% 14.49/14.77 % --bmc1_ucm_cone_mode none
% 14.49/14.77 % --bmc1_ucm_reduced_relation_type 0
% 14.49/14.77 % --bmc1_ucm_relax_model 4
% 14.49/14.77 % --bmc1_ucm_full_tr_after_sat true
% 14.49/14.77 % --bmc1_ucm_expand_neg_assumptions false
% 14.49/14.77 % --bmc1_ucm_layered_model none
% 14.49/14.77 % --bmc1_ucm_max_lemma_size 10
% 14.49/14.77
% 14.49/14.77 % ------ AIG Options
% 14.49/14.77
% 14.49/14.77 % --aig_mode false
% 14.49/14.77
% 14.49/14.77 % ------ Instantiation Options
% 14.49/14.77
% 14.49/14.77 % --instantiation_flag true
% 14.49/14.77 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 14.49/14.77 % --inst_solver_per_active 750
% 14.49/14.77 % --inst_solver_calls_frac 0.5
% 14.49/14.77 % --inst_passive_queue_type priority_queues
% 14.49/14.77 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 14.49/14.77 % --inst_passive_queues_freq [25;2]
% 14.49/14.77 % --inst_dismatching true
% 14.49/14.77 % --inst_eager_unprocessed_to_passive true
% 14.49/14.77 % --inst_prop_sim_given true
% 15.94/16.14 % --inst_prop_sim_new false
% 15.94/16.14 % --inst_orphan_elimination true
% 15.94/16.14 % --inst_learning_loop_flag true
% 15.94/16.14 % --inst_learning_start 3000
% 15.94/16.14 % --inst_learning_factor 2
% 15.94/16.14 % --inst_start_prop_sim_after_learn 3
% 15.94/16.14 % --inst_sel_renew solver
% 15.94/16.14 % --inst_lit_activity_flag true
% 15.94/16.14 % --inst_out_proof true
% 15.94/16.14
% 15.94/16.14 % ------ Resolution Options
% 15.94/16.14
% 15.94/16.14 % --resolution_flag true
% 15.94/16.14 % --res_lit_sel kbo_max
% 15.94/16.14 % --res_to_prop_solver none
% 15.94/16.14 % --res_prop_simpl_new false
% 15.94/16.14 % --res_prop_simpl_given false
% 15.94/16.14 % --res_passive_queue_type priority_queues
% 15.94/16.14 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 15.94/16.14 % --res_passive_queues_freq [15;5]
% 15.94/16.14 % --res_forward_subs full
% 15.94/16.14 % --res_backward_subs full
% 15.94/16.14 % --res_forward_subs_resolution true
% 15.94/16.14 % --res_backward_subs_resolution true
% 15.94/16.14 % --res_orphan_elimination false
% 15.94/16.14 % --res_time_limit 1000.
% 15.94/16.14 % --res_out_proof true
% 15.94/16.14 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a2d57e.s
% 15.94/16.14 % --modulo true
% 15.94/16.14
% 15.94/16.14 % ------ Combination Options
% 15.94/16.14
% 15.94/16.14 % --comb_res_mult 1000
% 15.94/16.14 % --comb_inst_mult 300
% 15.94/16.14 % ------
% 15.94/16.14
% 15.94/16.14
% 15.94/16.14
% 15.94/16.14 % ------ Proving...
% 15.94/16.14 % warning: shown sat in sat incomplete mode
% 15.94/16.14 %
% 15.94/16.14
% 15.94/16.14
% 15.94/16.14 ------ Building Model...Done
% 15.94/16.14
% 15.94/16.14 %------ The model is defined over ground terms (initial term algebra).
% 15.94/16.14 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 15.94/16.14 %------ where \phi is a formula over the term algebra.
% 15.94/16.14 %------ If we have equality in the problem then it is also defined as a predicate above,
% 15.94/16.14 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 15.94/16.14 %------ See help for --sat_out_model for different model outputs.
% 15.94/16.14 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 15.94/16.14 %------ where the first argument stands for the sort ($i in the unsorted case)
% 15.94/16.14
% 15.94/16.14
% 15.94/16.14
% 15.94/16.14
% 15.94/16.14 %------ Negative definition of equality_sorted
% 15.94/16.14 fof(lit_def,axiom,
% 15.94/16.14 (! [X0,X0,X1] :
% 15.94/16.14 ( ~(equality_sorted(X0,X0,X1)) <=>
% 15.94/16.14 (
% 15.94/16.14 (
% 15.94/16.14 ( X0=$i & X0=external_ties(sk1,sk3) & X1=external_ties(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=$i & X0=external_ties(sk1,sk2) & X1=external_ties(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=$i & X0=internal_friction(sk1,sk3) & X1=internal_friction(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=$i & X0=stock_of_knowledge(sk1,sk2) & X1=stock_of_knowledge(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=$i & X0=capability(sk1,sk3) & X1=capability(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=$i & X0=position(sk1,sk3) & X1=position(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=$i & X0=capability(sk1,sk2) & X1=capability(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=$i & X0=position(sk1,sk2) & X1=position(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 ).
% 15.94/16.14
% 15.94/16.14 %------ Negative definition of smaller_or_equal
% 15.94/16.14 fof(lit_def,axiom,
% 15.94/16.14 (! [X0,X1] :
% 15.94/16.14 ( ~(smaller_or_equal(X0,X1)) <=>
% 15.94/16.14 (
% 15.94/16.14 (
% 15.94/16.14 ( X0=external_ties(sk1,sk3) & X1=external_ties(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=stock_of_knowledge(sk1,sk2) & X1=stock_of_knowledge(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=position(sk1,sk3) & X1=position(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=capability(sk1,sk2) & X1=capability(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 ).
% 15.94/16.14
% 15.94/16.14 %------ Negative definition of greater_or_equal
% 15.94/16.14 fof(lit_def,axiom,
% 15.94/16.14 (! [X0,X1] :
% 15.94/16.14 ( ~(greater_or_equal(X0,X1)) <=>
% 15.94/16.14 (
% 15.94/16.14 (
% 15.94/16.14 ( X0=external_ties(sk1,sk2) & X1=external_ties(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=internal_friction(sk1,sk3) & X1=internal_friction(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=capability(sk1,sk3) & X1=capability(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=position(sk1,sk2) & X1=position(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 ).
% 15.94/16.14
% 15.94/16.14 %------ Positive definition of smaller
% 15.94/16.14 fof(lit_def,axiom,
% 15.94/16.14 (! [X0,X1] :
% 15.94/16.14 ( smaller(X0,X1) <=>
% 15.94/16.14 (
% 15.94/16.14 (
% 15.94/16.14 ( X0=external_ties(sk1,sk2) & X1=external_ties(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=internal_friction(sk1,sk3) & X1=internal_friction(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=stock_of_knowledge(sk1,sk3) & X1=stock_of_knowledge(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=capability(sk1,sk3) & X1=capability(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=position(sk1,sk2) & X1=position(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 ).
% 15.94/16.14
% 15.94/16.14 %------ Positive definition of greater
% 15.94/16.14 fof(lit_def,axiom,
% 15.94/16.14 (! [X0,X1] :
% 15.94/16.14 ( greater(X0,X1) <=>
% 15.94/16.14 (
% 15.94/16.14 (
% 15.94/16.14 ( X0=external_ties(sk1,sk3) & X1=external_ties(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=internal_friction(sk1,sk2) & X1=internal_friction(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=stock_of_knowledge(sk1,sk2) & X1=stock_of_knowledge(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=position(sk1,sk3) & X1=position(sk1,sk2) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=capability(sk1,sk2) & X1=capability(sk1,sk3) )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 ).
% 15.94/16.14
% 15.94/16.14 %------ Negative definition of organization
% 15.94/16.14 fof(lit_def,axiom,
% 15.94/16.14 (! [X0] :
% 15.94/16.14 ( ~(organization(X0)) <=>
% 15.94/16.14 $false
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 ).
% 15.94/16.14
% 15.94/16.14 %------ Negative definition of has_immunity
% 15.94/16.14 fof(lit_def,axiom,
% 15.94/16.14 (! [X0,X1] :
% 15.94/16.14 ( ~(has_immunity(X0,X1)) <=>
% 15.94/16.14 (
% 15.94/16.14 (
% 15.94/16.14 ( X0=sk1 & X1=sk3 )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 |
% 15.94/16.14 (
% 15.94/16.14 ( X0=sk1 & X1=sk2 )
% 15.94/16.14 )
% 15.94/16.14
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 )
% 15.94/16.14 ).
% 15.94/16.14
% 15.94/16.14
% 15.94/16.14
% 15.94/16.14 % ------ Statistics
% 15.94/16.14
% 15.94/16.14 % ------ General
% 15.94/16.14
% 15.94/16.14 % num_of_input_clauses: 81
% 15.94/16.14 % num_of_input_neg_conjectures: 19
% 15.94/16.14 % num_of_splits: 0
% 15.94/16.14 % num_of_split_atoms: 0
% 15.94/16.14 % num_of_sem_filtered_clauses: 0
% 15.94/16.14 % num_of_subtypes: 0
% 15.94/16.14 % monotx_restored_types: 0
% 15.94/16.14 % sat_num_of_epr_types: 0
% 15.94/16.14 % sat_num_of_non_cyclic_types: 0
% 15.94/16.14 % sat_guarded_non_collapsed_types: 0
% 15.94/16.14 % is_epr: 0
% 15.94/16.14 % is_horn: 0
% 15.94/16.14 % has_eq: 1
% 15.94/16.14 % num_pure_diseq_elim: 0
% 15.94/16.14 % simp_replaced_by: 0
% 15.94/16.14 % res_preprocessed: 38
% 15.94/16.14 % prep_upred: 0
% 15.94/16.14 % prep_unflattend: 0
% 15.94/16.14 % pred_elim_cands: 0
% 15.94/16.14 % pred_elim: 0
% 15.94/16.14 % pred_elim_cl: 0
% 15.94/16.14 % pred_elim_cycles: 0
% 15.94/16.14 % forced_gc_time: 0
% 15.94/16.14 % gc_basic_clause_elim: 0
% 15.94/16.14 % parsing_time: 0.005
% 15.94/16.14 % sem_filter_time: 0.
% 15.94/16.14 % pred_elim_time: 0.
% 15.94/16.14 % out_proof_time: 0.
% 15.94/16.14 % monotx_time: 0.
% 15.94/16.14 % subtype_inf_time: 0.
% 15.94/16.14 % unif_index_cands_time: 0.003
% 15.94/16.14 % unif_index_add_time: 0.003
% 15.94/16.14 % total_time: 1.403
% 15.94/16.14 % num_of_symbols: 40
% 15.94/16.14 % num_of_terms: 2523
% 15.94/16.14
% 15.94/16.14 % ------ Propositional Solver
% 15.94/16.14
% 15.94/16.14 % prop_solver_calls: 17
% 15.94/16.14 % prop_fast_solver_calls: 99
% 15.94/16.14 % prop_num_of_clauses: 334
% 15.94/16.14 % prop_preprocess_simplified: 859
% 15.94/16.14 % prop_fo_subsumed: 20
% 15.94/16.14 % prop_solver_time: 0.
% 15.94/16.14 % prop_fast_solver_time: 0.
% 15.94/16.14 % prop_unsat_core_time: 0.
% 15.94/16.14
% 15.94/16.14 % ------ QBF
% 15.94/16.14
% 15.94/16.14 % qbf_q_res: 0
% 15.94/16.14 % qbf_num_tautologies: 0
% 15.94/16.14 % qbf_prep_cycles: 0
% 15.94/16.14
% 15.94/16.14 % ------ BMC1
% 15.94/16.14
% 15.94/16.14 % bmc1_current_bound: -1
% 15.94/16.14 % bmc1_last_solved_bound: -1
% 15.94/16.14 % bmc1_unsat_core_size: -1
% 15.94/16.14 % bmc1_unsat_core_parents_size: -1
% 15.94/16.14 % bmc1_merge_next_fun: 0
% 15.94/16.14 % bmc1_unsat_core_clauses_time: 0.
% 15.94/16.14
% 15.94/16.14 % ------ Instantiation
% 15.94/16.14
% 15.94/16.14 % inst_num_of_clauses: 279
% 15.94/16.14 % inst_num_in_passive: 0
% 15.94/16.14 % inst_num_in_active: 273
% 15.94/16.14 % inst_num_in_unprocessed: 0
% 15.94/16.14 % inst_num_of_loops: 386
% 15.94/16.14 % inst_num_of_learning_restarts: 0
% 15.94/16.14 % inst_num_moves_active_passive: 103
% 15.94/16.14 % inst_lit_activity: 35
% 15.94/16.14 % inst_lit_activity_moves: 0
% 15.94/16.14 % inst_num_tautologies: 0
% 15.94/16.14 % inst_num_prop_implied: 0
% 15.94/16.14 % inst_num_existing_simplified: 0
% 15.94/16.14 % inst_num_eq_res_simplified: 6
% 15.94/16.14 % inst_num_child_elim: 0
% 15.94/16.14 % inst_num_of_dismatching_blockings: 160
% 15.94/16.14 % inst_num_of_non_proper_insts: 602
% 15.94/16.14 % inst_num_of_duplicates: 249
% 15.94/16.14 % inst_inst_num_from_inst_to_res: 0
% 15.94/16.14 % inst_dismatching_checking_time: 0.
% 15.94/16.14
% 15.94/16.14 % ------ Resolution
% 15.94/16.14
% 15.94/16.14 % res_num_of_clauses: 3674
% 15.94/16.14 % res_num_in_passive: 2792
% 15.94/16.14 % res_num_in_active: 1043
% 15.94/16.14 % res_num_of_loops: 2000
% 15.94/16.14 % res_forward_subset_subsumed: 2741
% 15.94/16.14 % res_backward_subset_subsumed: 606
% 15.94/16.14 % res_forward_subsumed: 629
% 15.94/16.14 % res_backward_subsumed: 239
% 15.94/16.14 % res_forward_subsumption_resolution: 74
% 15.94/16.14 % res_backward_subsumption_resolution: 9
% 15.94/16.14 % res_clause_to_clause_subsumption: 158185
% 15.94/16.14 % res_orphan_elimination: 0
% 15.94/16.14 % res_tautology_del: 12
% 15.94/16.14 % res_num_eq_res_simplified: 0
% 15.94/16.14 % res_num_sel_changes: 0
% 15.94/16.14 % res_moves_from_active_to_pass: 0
% 15.94/16.14
% 15.94/16.14 % Status Unknown
% 15.94/16.14 % Last status :
% 15.94/16.14 % SZS status Unknown
%------------------------------------------------------------------------------