TSTP Solution File: NLP194-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP194-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n007.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 : Mon Jul 18 02:42:10 EDT 2022
% Result : Unknown 4.47s 4.63s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NLP194-1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n007.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 : Fri Jul 1 02:42:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.35 % Running in mono-core mode
% 0.20/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.42 % Orientation found
% 0.20/0.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ddd501.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_180583.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_4e14f8 | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.39/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.39/0.56 % --bmc1_dump_file -
% 0.39/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.39/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.39/0.56 % --bmc1_ucm_extend_mode 1
% 0.39/0.56 % --bmc1_ucm_init_mode 2
% 0.39/0.56 % --bmc1_ucm_cone_mode none
% 0.39/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.39/0.56 % --bmc1_ucm_relax_model 4
% 0.39/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.39/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.39/0.56 % --bmc1_ucm_layered_model none
% 0.39/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.39/0.56
% 0.39/0.56 % ------ AIG Options
% 0.39/0.56
% 0.39/0.56 % --aig_mode false
% 0.39/0.56
% 0.39/0.56 % ------ Instantiation Options
% 0.39/0.56
% 0.39/0.56 % --instantiation_flag true
% 0.39/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.39/0.56 % --inst_solver_per_active 750
% 0.39/0.56 % --inst_solver_calls_frac 0.5
% 0.39/0.56 % --inst_passive_queue_type priority_queues
% 0.39/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.39/0.56 % --inst_passive_queues_freq [25;2]
% 0.39/0.56 % --inst_dismatching true
% 0.39/0.56 % --inst_eager_unprocessed_to_passive true
% 0.39/0.56 % --inst_prop_sim_given true
% 0.39/0.56 % --inst_prop_sim_new false
% 0.39/0.56 % --inst_orphan_elimination true
% 0.39/0.56 % --inst_learning_loop_flag true
% 0.39/0.56 % --inst_learning_start 3000
% 0.39/0.56 % --inst_learning_factor 2
% 0.39/0.56 % --inst_start_prop_sim_after_learn 3
% 0.39/0.56 % --inst_sel_renew solver
% 0.39/0.56 % --inst_lit_activity_flag true
% 0.39/0.56 % --inst_out_proof true
% 0.39/0.56
% 0.39/0.56 % ------ Resolution Options
% 0.39/0.56
% 0.39/0.56 % --resolution_flag true
% 0.39/0.56 % --res_lit_sel kbo_max
% 0.39/0.56 % --res_to_prop_solver none
% 0.39/0.56 % --res_prop_simpl_new false
% 0.39/0.56 % --res_prop_simpl_given false
% 0.39/0.56 % --res_passive_queue_type priority_queues
% 0.39/0.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.39/0.56 % --res_passive_queues_freq [15;5]
% 0.39/0.56 % --res_forward_subs full
% 0.39/0.56 % --res_backward_subs full
% 0.39/0.56 % --res_forward_subs_resolution true
% 0.39/0.56 % --res_backward_subs_resolution true
% 0.39/0.56 % --res_orphan_elimination false
% 0.39/0.56 % --res_time_limit 1000.
% 0.39/0.56 % --res_out_proof true
% 0.39/0.56 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ddd501.s
% 0.39/0.56 % --modulo true
% 0.39/0.56
% 0.39/0.56 % ------ Combination Options
% 0.39/0.56
% 0.39/0.56 % --comb_res_mult 1000
% 0.39/0.56 % --comb_inst_mult 300
% 0.39/0.56 % ------
% 0.39/0.56
% 0.39/0.56 % ------ Parsing...% successful
% 0.39/0.56
% 0.39/0.56 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 24 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.39/0.56
% 0.39/0.56 % ------ Proving...
% 0.39/0.56 % ------ Problem Properties
% 0.39/0.56
% 0.39/0.56 %
% 0.39/0.56 % EPR false
% 0.39/0.56 % Horn false
% 0.39/0.56 % Has equality false
% 0.39/0.56
% 0.39/0.56 % % ------ Input Options Time Limit: Unbounded
% 0.39/0.56
% 0.39/0.56
% 0.39/0.56 % % ------ Current options:
% 0.39/0.56
% 0.39/0.56 % ------ Input Options
% 0.39/0.56
% 0.39/0.56 % --out_options all
% 0.39/0.56 % --tptp_safe_out true
% 0.39/0.56 % --problem_path ""
% 0.39/0.56 % --include_path ""
% 0.39/0.56 % --clausifier .//eprover
% 0.39/0.56 % --clausifier_options --tstp-format
% 0.39/0.56 % --stdin false
% 0.39/0.56 % --dbg_backtrace false
% 0.39/0.56 % --dbg_dump_prop_clauses false
% 0.39/0.56 % --dbg_dump_prop_clauses_file -
% 0.39/0.56 % --dbg_out_stat false
% 0.39/0.56
% 0.39/0.56 % ------ General Options
% 0.39/0.56
% 0.39/0.56 % --fof false
% 0.39/0.56 % --time_out_real 150.
% 0.39/0.56 % --time_out_prep_mult 0.2
% 0.39/0.56 % --time_out_virtual -1.
% 0.39/0.56 % --schedule none
% 0.39/0.56 % --ground_splitting input
% 0.39/0.56 % --splitting_nvd 16
% 0.39/0.56 % --non_eq_to_eq false
% 0.39/0.56 % --prep_gs_sim true
% 0.39/0.56 % --prep_unflatten false
% 0.39/0.56 % --prep_res_sim true
% 0.39/0.56 % --prep_upred true
% 0.39/0.56 % --res_sim_input true
% 0.39/0.56 % --clause_weak_htbl true
% 0.39/0.56 % --gc_record_bc_elim false
% 0.39/0.56 % --symbol_type_check false
% 0.39/0.56 % --clausify_out false
% 0.39/0.56 % --large_theory_mode false
% 0.39/0.56 % --prep_sem_filter none
% 0.39/0.56 % --prep_sem_filter_out false
% 0.39/0.56 % --preprocessed_out false
% 0.39/0.56 % --sub_typing false
% 0.39/0.56 % --brand_transform false
% 0.39/0.56 % --pure_diseq_elim true
% 0.39/0.56 % --min_unsat_core false
% 0.39/0.56 % --pred_elim true
% 0.39/0.56 % --add_important_lit false
% 0.39/0.56 % --soft_assumptions false
% 0.39/0.56 % --reset_solvers false
% 0.39/0.56 % --bc_imp_inh []
% 0.39/0.56 % --conj_cone_tolerance 1.5
% 0.39/0.56 % --prolific_symb_bound 500
% 0.39/0.56 % --lt_threshold 2000
% 0.39/0.56
% 0.39/0.56 % ------ SAT Options
% 0.39/0.56
% 0.39/0.56 % --sat_mode false
% 0.39/0.56 % --sat_fm_restart_options ""
% 0.39/0.56 % --sat_gr_def false
% 0.39/0.56 % --sat_epr_types true
% 0.39/0.56 % --sat_non_cyclic_types false
% 0.39/0.56 % --sat_finite_models false
% 0.39/0.56 % --sat_fm_lemmas false
% 0.39/0.56 % --sat_fm_prep false
% 0.39/0.56 % --sat_fm_uc_incr true
% 0.39/0.56 % --sat_out_model small
% 0.39/0.56 % --sat_out_clauses false
% 0.39/0.56
% 0.39/0.56 % ------ QBF Options
% 0.39/0.56
% 0.39/0.56 % --qbf_mode false
% 0.39/0.56 % --qbf_elim_univ true
% 0.39/0.56 % --qbf_sk_in true
% 0.39/0.56 % --qbf_pred_elim true
% 0.39/0.56 % --qbf_split 32
% 0.39/0.56
% 0.39/0.56 % ------ BMC1 Options
% 0.39/0.56
% 0.39/0.56 % --bmc1_incremental false
% 0.39/0.56 % --bmc1_axioms reachable_all
% 0.39/0.56 % --bmc1_min_bound 0
% 0.39/0.56 % --bmc1_max_bound -1
% 0.39/0.56 % --bmc1_max_bound_default -1
% 0.39/0.56 % --bmc1_symbol_reachability true
% 0.39/0.56 % --bmc1_property_lemmas false
% 0.39/0.56 % --bmc1_k_induction false
% 0.39/0.56 % --bmc1_non_equiv_states false
% 0.39/0.56 % --bmc1_deadlock false
% 0.39/0.56 % --bmc1_ucm false
% 0.39/0.56 % --bmc1_add_unsat_core none
% 0.39/0.56 % --bmc1_unsat_core_children false
% 0.39/0.56 % --bmc1_unsat_core_extrapolate_axioms false
% 0.39/0.56 % --bmc1_out_stat full
% 0.39/0.56 % --bmc1_ground_init false
% 0.39/0.56 % --bmc1_pre_inst_next_state false
% 0.39/0.56 % --bmc1_pre_inst_state false
% 0.39/0.56 % --bmc1_pre_inst_reach_state false
% 0.39/0.56 % --bmc1_out_unsat_core false
% 0.39/0.56 % --bmc1_aig_witness_out false
% 0.39/0.56 % --bmc1_verbose false
% 0.39/0.56 % --bmc1_dump_clauses_tptp false
% 0.39/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.39/0.56 % --bmc1_dump_file -
% 0.39/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.39/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.39/0.56 % --bmc1_ucm_extend_mode 1
% 0.39/0.56 % --bmc1_ucm_init_mode 2
% 0.39/0.56 % --bmc1_ucm_cone_mode none
% 0.39/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.39/0.56 % --bmc1_ucm_relax_model 4
% 0.39/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.39/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.39/0.56 % --bmc1_ucm_layered_model none
% 0.39/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.39/0.56
% 0.39/0.56 % ------ AIG Options
% 0.39/0.56
% 0.39/0.56 % --aig_mode false
% 0.39/0.56
% 0.39/0.56 % ------ Instantiation Options
% 0.39/0.56
% 0.39/0.56 % --instantiation_flag true
% 0.39/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.39/0.56 % --inst_solver_per_active 750
% 0.39/0.56 % --inst_solver_calls_frac 0.5
% 0.39/0.56 % --inst_passive_queue_type priority_queues
% 0.39/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.39/0.56 % --inst_passive_queues_freq [25;2]
% 0.39/0.56 % --inst_dismatching true
% 0.39/0.56 % --inst_eager_unprocessed_to_passive true
% 2.34/2.58 % --inst_prop_sim_given true
% 2.34/2.58 % --inst_prop_sim_new false
% 2.34/2.58 % --inst_orphan_elimination true
% 2.34/2.58 % --inst_learning_loop_flag true
% 2.34/2.58 % --inst_learning_start 3000
% 2.34/2.58 % --inst_learning_factor 2
% 2.34/2.58 % --inst_start_prop_sim_after_learn 3
% 2.34/2.58 % --inst_sel_renew solver
% 2.34/2.58 % --inst_lit_activity_flag true
% 2.34/2.58 % --inst_out_proof true
% 2.34/2.58
% 2.34/2.58 % ------ Resolution Options
% 2.34/2.58
% 2.34/2.58 % --resolution_flag true
% 2.34/2.58 % --res_lit_sel kbo_max
% 2.34/2.58 % --res_to_prop_solver none
% 2.34/2.58 % --res_prop_simpl_new false
% 2.34/2.58 % --res_prop_simpl_given false
% 2.34/2.58 % --res_passive_queue_type priority_queues
% 2.34/2.58 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.34/2.58 % --res_passive_queues_freq [15;5]
% 2.34/2.58 % --res_forward_subs full
% 2.34/2.58 % --res_backward_subs full
% 2.34/2.58 % --res_forward_subs_resolution true
% 2.34/2.58 % --res_backward_subs_resolution true
% 2.34/2.58 % --res_orphan_elimination false
% 2.34/2.58 % --res_time_limit 1000.
% 2.34/2.58 % --res_out_proof true
% 2.34/2.58 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ddd501.s
% 2.34/2.58 % --modulo true
% 2.34/2.58
% 2.34/2.58 % ------ Combination Options
% 2.34/2.58
% 2.34/2.58 % --comb_res_mult 1000
% 2.34/2.58 % --comb_inst_mult 300
% 2.34/2.58 % ------
% 2.34/2.58
% 2.34/2.58
% 2.34/2.58
% 2.34/2.58 % ------ Proving...
% 2.34/2.58 % warning: shown sat in sat incomplete mode
% 2.34/2.58 %
% 2.34/2.58
% 2.34/2.58
% 2.34/2.58 ------ Building Model...Done
% 2.34/2.58
% 2.34/2.58 %------ The model is defined over ground terms (initial term algebra).
% 2.34/2.58 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.34/2.58 %------ where \phi is a formula over the term algebra.
% 2.34/2.58 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.34/2.58 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.34/2.58 %------ See help for --sat_out_model for different model outputs.
% 2.34/2.58 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.34/2.58 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.34/2.58
% 2.34/2.58
% 2.34/2.58
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of ssSkC0
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 ( ssSkC0 <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of actual_world
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0] :
% 2.34/2.58 ( ~(actual_world(X0)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of state
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( state(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc73 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of of
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( ~(of(X0,X1,X2)) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X2=skc78 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of man
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( man(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc75 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of be
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2,X3] :
% 2.34/2.58 ( ~(be(X0,X1,X2,X3)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of forename
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( forename(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc74 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of jules_forename
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( ~(jules_forename(X0,X1)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of wheel
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( wheel(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc78 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of frontseat
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( frontseat(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc78 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of ssSkP1
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( ssSkP1(X0,X1,X2) <=>
% 2.34/2.58 $true
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of behind
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( ~(behind(X0,X1,X2)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of ssSkP2
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( ~(ssSkP2(X0,X1,X2)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of ssSkP0
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( ~(ssSkP0(X0,X1)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of group
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( group(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc76 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 |
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc77 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of two
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( two(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc77 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of coat
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( coat(X0,X1) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of hollywood_placename
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( hollywood_placename(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc81 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of placename
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( ~(placename(X0,X1)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of in
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( in(X0,X1,X2) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc79 & X2=skc80 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of down
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( ~(down(X0,X1,X2)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of lonely
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( lonely(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc80 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of street
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( ~(street(X0,X1)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of city
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( ~(city(X0,X1)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of agent
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( ~(agent(X0,X1,X2)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of old
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( old(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc82 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of dirty
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( ~(dirty(X0,X1)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of white
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( ~(white(X0,X1)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of chevy
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( chevy(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc82 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of event
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( event(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc79 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Negative definition of present
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( ~(present(X0,X1)) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of barrel
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( barrel(X0,X1) <=>
% 2.34/2.58 (
% 2.34/2.58 (
% 2.34/2.58 ( X0=skc71 & X1=skc79 )
% 2.34/2.58 )
% 2.34/2.58
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of member
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( member(X0,X1,X2) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of fellow
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1] :
% 2.34/2.58 ( fellow(X0,X1) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP2_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( sP2_iProver_split(X0,X1,X2) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP5_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( sP5_iProver_split(X0,X1,X2) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP7_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2,X3,X4,X5] :
% 2.34/2.58 ( sP7_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP8_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( sP8_iProver_split(X0,X1,X2) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP10_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2,X3,X4,X5] :
% 2.34/2.58 ( sP10_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP11_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( sP11_iProver_split(X0,X1,X2) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP14_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( sP14_iProver_split(X0,X1,X2) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP17_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( sP17_iProver_split(X0,X1,X2) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP19_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2,X3,X4,X5] :
% 2.34/2.58 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP20_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( sP20_iProver_split(X0,X1,X2) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP22_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2,X3,X4,X5] :
% 2.34/2.58 ( sP22_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58 %------ Positive definition of sP23_iProver_split
% 2.34/2.58 fof(lit_def,axiom,
% 2.34/2.58 (! [X0,X1,X2] :
% 2.34/2.58 ( sP23_iProver_split(X0,X1,X2) <=>
% 2.34/2.58 $false
% 2.34/2.58 )
% 2.34/2.58 )
% 2.34/2.58 ).
% 2.34/2.58
% 2.34/2.58
% 2.34/2.58
% 2.34/2.58 % ------ Statistics
% 2.34/2.58
% 2.34/2.58 % ------ General
% 2.34/2.58
% 2.34/2.58 % num_of_input_clauses: 92
% 2.34/2.58 % num_of_input_neg_conjectures: 92
% 2.34/2.58 % num_of_splits: 24
% 2.34/2.58 % num_of_split_atoms: 24
% 2.34/2.58 % num_of_sem_filtered_clauses: 0
% 2.34/2.58 % num_of_subtypes: 0
% 2.34/2.58 % monotx_restored_types: 0
% 2.34/2.58 % sat_num_of_epr_types: 0
% 2.34/2.58 % sat_num_of_non_cyclic_types: 0
% 2.34/2.58 % sat_guarded_non_collapsed_types: 0
% 2.34/2.58 % is_epr: 0
% 2.34/2.58 % is_horn: 0
% 2.34/2.58 % has_eq: 0
% 2.34/2.58 % num_pure_diseq_elim: 0
% 2.34/2.58 % simp_replaced_by: 0
% 2.34/2.58 % res_preprocessed: 208
% 2.34/2.58 % prep_upred: 0
% 2.34/2.58 % prep_unflattend: 0
% 2.34/2.58 % pred_elim_cands: 24
% 2.34/2.58 % pred_elim: 8
% 2.34/2.58 % pred_elim_cl: 8
% 2.34/2.58 % pred_elim_cycles: 40
% 2.34/2.58 % forced_gc_time: 0
% 2.34/2.58 % gc_basic_clause_elim: 0
% 2.34/2.58 % parsing_time: 0.003
% 2.34/2.58 % sem_filter_time: 0.
% 2.34/2.58 % pred_elim_time: 0.09
% 2.34/2.58 % out_proof_time: 0.
% 2.34/2.58 % monotx_time: 0.
% 2.34/2.58 % subtype_inf_time: 0.
% 2.34/2.58 % unif_index_cands_time: 0.004
% 2.34/2.58 % unif_index_add_time: 0.002
% 2.34/2.58 % total_time: 2.155
% 2.34/2.58 % num_of_symbols: 122
% 2.34/2.58 % num_of_terms: 6398
% 2.34/2.58
% 2.34/2.58 % ------ Propositional Solver
% 2.34/2.58
% 2.34/2.58 % prop_solver_calls: 5
% 2.34/2.58 % prop_fast_solver_calls: 2023
% 2.34/2.58 % prop_num_of_clauses: 465
% 2.34/2.58 % prop_preprocess_simplified: 1857
% 2.34/2.58 % prop_fo_subsumed: 0
% 2.34/2.58 % prop_solver_time: 0.
% 2.34/2.58 % prop_fast_solver_time: 0.003
% 2.34/2.58 % prop_unsat_core_time: 0.
% 2.34/2.58
% 2.34/2.58 % ------ QBF
% 2.34/2.58
% 2.34/2.58 % qbf_q_res: 0
% 2.34/2.58 % qbf_num_tautologies: 0
% 2.34/2.58 % qbf_prep_cycles: 0
% 2.34/2.58
% 2.34/2.58 % ------ BMC1
% 2.34/2.58
% 2.34/2.58 % bmc1_current_bound: -1
% 2.34/2.58 % bmc1_last_solved_bound: -1
% 2.34/2.58 % bmc1_unsat_core_size: -1
% 2.34/2.58 % bmc1_unsat_core_parents_size: -1
% 2.34/2.58 % bmc1_merge_next_fun: 0
% 2.34/2.58 % bmc1_unsat_core_clauses_time: 0.
% 2.34/2.58
% 2.34/2.58 % ------ Instantiation
% 2.34/2.58
% 2.34/2.58 % inst_num_of_clauses: 217
% 2.34/2.58 % inst_num_in_passive: 0
% 2.34/2.58 % inst_num_in_active: 217
% 2.34/2.58 % inst_num_in_unprocessed: 0
% 2.34/2.58 % inst_num_of_loops: 235
% 2.34/2.58 % inst_num_of_learning_restarts: 0
% 2.34/2.58 % inst_num_moves_active_passive: 8
% 2.34/2.58 % inst_lit_activity: 38
% 2.34/2.58 % inst_lit_activity_moves: 0
% 2.34/2.58 % inst_num_tautologies: 0
% 2.34/2.58 % inst_num_prop_implied: 0
% 2.34/2.58 % inst_num_existing_simplified: 0
% 2.34/2.58 % inst_num_eq_res_simplified: 0
% 2.34/2.58 % inst_num_child_elim: 0
% 2.34/2.58 % inst_num_of_dismatching_blockings: 0
% 2.34/2.58 % inst_num_of_non_proper_insts: 114
% 2.34/2.58 % inst_num_of_duplicates: 0
% 2.34/2.58 % inst_inst_num_from_inst_to_res: 0
% 2.34/2.58 % inst_dismatching_checking_time: 0.
% 2.34/2.58
% 2.34/2.58 % ------ Resolution
% 2.34/2.58
% 2.34/2.58 % res_num_of_clauses: 21103
% 2.34/2.58 % res_num_in_passive: 20207
% 2.34/2.58 % res_num_in_active: 896
% 2.34/2.58 % res_num_of_loops: 1000
% 2.34/2.58 % res_forward_subset_subsumed: 18348
% 2.34/2.58 % res_backward_subset_subsumed: 0
% 2.34/2.58 % res_forward_subsumed: 98
% 2.34/2.58 % res_backward_subsumed: 6
% 2.34/2.58 % res_forward_subsumption_resolution: 120
% 2.34/2.58 % res_backward_subsumption_resolution: 0
% 2.34/2.58 % res_clause_to_clause_subsumption: 742
% 2.34/2.58 % res_orphan_elimination: 0
% 2.34/2.58 % res_tautology_del: 432
% 2.34/2.58 % res_num_eq_res_simplified: 0
% 2.34/2.58 % res_num_sel_changes: 0
% 2.34/2.58 % res_moves_from_active_to_pass: 0
% 2.34/2.58
% 2.34/2.58 % Status Unknown
% 2.43/2.63 % Orienting using strategy ClausalAll
% 2.43/2.63 % Orientation found
% 2.43/2.63 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ddd501.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_180583.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_30f7bb | grep -v "SZS"
% 2.43/2.65
% 2.43/2.65 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 2.43/2.65
% 2.43/2.65 %
% 2.43/2.65 % ------ iProver source info
% 2.43/2.65
% 2.43/2.65 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 2.43/2.65 % git: non_committed_changes: true
% 2.43/2.65 % git: last_make_outside_of_git: true
% 2.43/2.65
% 2.43/2.65 %
% 2.43/2.65 % ------ Input Options
% 2.43/2.65
% 2.43/2.65 % --out_options all
% 2.43/2.65 % --tptp_safe_out true
% 2.43/2.65 % --problem_path ""
% 2.43/2.65 % --include_path ""
% 2.43/2.65 % --clausifier .//eprover
% 2.43/2.65 % --clausifier_options --tstp-format
% 2.43/2.65 % --stdin false
% 2.43/2.65 % --dbg_backtrace false
% 2.43/2.65 % --dbg_dump_prop_clauses false
% 2.43/2.65 % --dbg_dump_prop_clauses_file -
% 2.43/2.65 % --dbg_out_stat false
% 2.43/2.65
% 2.43/2.65 % ------ General Options
% 2.43/2.65
% 2.43/2.65 % --fof false
% 2.43/2.65 % --time_out_real 150.
% 2.43/2.65 % --time_out_prep_mult 0.2
% 2.43/2.65 % --time_out_virtual -1.
% 2.43/2.65 % --schedule none
% 2.43/2.65 % --ground_splitting input
% 2.43/2.65 % --splitting_nvd 16
% 2.43/2.65 % --non_eq_to_eq false
% 2.43/2.65 % --prep_gs_sim true
% 2.43/2.65 % --prep_unflatten false
% 2.43/2.65 % --prep_res_sim true
% 2.43/2.65 % --prep_upred true
% 2.43/2.65 % --res_sim_input true
% 2.43/2.65 % --clause_weak_htbl true
% 2.43/2.65 % --gc_record_bc_elim false
% 2.43/2.65 % --symbol_type_check false
% 2.43/2.65 % --clausify_out false
% 2.43/2.65 % --large_theory_mode false
% 2.43/2.65 % --prep_sem_filter none
% 2.43/2.65 % --prep_sem_filter_out false
% 2.43/2.65 % --preprocessed_out false
% 2.43/2.65 % --sub_typing false
% 2.43/2.65 % --brand_transform false
% 2.43/2.65 % --pure_diseq_elim true
% 2.43/2.65 % --min_unsat_core false
% 2.43/2.65 % --pred_elim true
% 2.43/2.65 % --add_important_lit false
% 2.43/2.65 % --soft_assumptions false
% 2.43/2.65 % --reset_solvers false
% 2.43/2.65 % --bc_imp_inh []
% 2.43/2.65 % --conj_cone_tolerance 1.5
% 2.43/2.65 % --prolific_symb_bound 500
% 2.43/2.65 % --lt_threshold 2000
% 2.43/2.65
% 2.43/2.65 % ------ SAT Options
% 2.43/2.65
% 2.43/2.65 % --sat_mode false
% 2.43/2.65 % --sat_fm_restart_options ""
% 2.43/2.65 % --sat_gr_def false
% 2.43/2.65 % --sat_epr_types true
% 2.43/2.65 % --sat_non_cyclic_types false
% 2.43/2.65 % --sat_finite_models false
% 2.43/2.65 % --sat_fm_lemmas false
% 2.43/2.65 % --sat_fm_prep false
% 2.43/2.65 % --sat_fm_uc_incr true
% 2.43/2.65 % --sat_out_model small
% 2.43/2.65 % --sat_out_clauses false
% 2.43/2.65
% 2.43/2.65 % ------ QBF Options
% 2.43/2.65
% 2.43/2.65 % --qbf_mode false
% 2.43/2.65 % --qbf_elim_univ true
% 2.43/2.65 % --qbf_sk_in true
% 2.43/2.65 % --qbf_pred_elim true
% 2.43/2.65 % --qbf_split 32
% 2.43/2.65
% 2.43/2.65 % ------ BMC1 Options
% 2.43/2.65
% 2.43/2.65 % --bmc1_incremental false
% 2.43/2.65 % --bmc1_axioms reachable_all
% 2.43/2.65 % --bmc1_min_bound 0
% 2.43/2.65 % --bmc1_max_bound -1
% 2.43/2.65 % --bmc1_max_bound_default -1
% 2.43/2.65 % --bmc1_symbol_reachability true
% 2.43/2.65 % --bmc1_property_lemmas false
% 2.43/2.65 % --bmc1_k_induction false
% 2.43/2.65 % --bmc1_non_equiv_states false
% 2.43/2.65 % --bmc1_deadlock false
% 2.43/2.65 % --bmc1_ucm false
% 2.43/2.65 % --bmc1_add_unsat_core none
% 2.43/2.65 % --bmc1_unsat_core_children false
% 2.43/2.65 % --bmc1_unsat_core_extrapolate_axioms false
% 2.43/2.65 % --bmc1_out_stat full
% 2.43/2.65 % --bmc1_ground_init false
% 2.43/2.65 % --bmc1_pre_inst_next_state false
% 2.43/2.65 % --bmc1_pre_inst_state false
% 2.43/2.65 % --bmc1_pre_inst_reach_state false
% 2.43/2.65 % --bmc1_out_unsat_core false
% 2.43/2.65 % --bmc1_aig_witness_out false
% 2.43/2.65 % --bmc1_verbose false
% 2.43/2.65 % --bmc1_dump_clauses_tptp false
% 2.48/2.71 % --bmc1_dump_unsat_core_tptp false
% 2.48/2.71 % --bmc1_dump_file -
% 2.48/2.71 % --bmc1_ucm_expand_uc_limit 128
% 2.48/2.71 % --bmc1_ucm_n_expand_iterations 6
% 2.48/2.71 % --bmc1_ucm_extend_mode 1
% 2.48/2.71 % --bmc1_ucm_init_mode 2
% 2.48/2.71 % --bmc1_ucm_cone_mode none
% 2.48/2.71 % --bmc1_ucm_reduced_relation_type 0
% 2.48/2.71 % --bmc1_ucm_relax_model 4
% 2.48/2.71 % --bmc1_ucm_full_tr_after_sat true
% 2.48/2.71 % --bmc1_ucm_expand_neg_assumptions false
% 2.48/2.71 % --bmc1_ucm_layered_model none
% 2.48/2.71 % --bmc1_ucm_max_lemma_size 10
% 2.48/2.71
% 2.48/2.71 % ------ AIG Options
% 2.48/2.71
% 2.48/2.71 % --aig_mode false
% 2.48/2.71
% 2.48/2.71 % ------ Instantiation Options
% 2.48/2.71
% 2.48/2.71 % --instantiation_flag true
% 2.48/2.71 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.48/2.71 % --inst_solver_per_active 750
% 2.48/2.71 % --inst_solver_calls_frac 0.5
% 2.48/2.71 % --inst_passive_queue_type priority_queues
% 2.48/2.71 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.48/2.71 % --inst_passive_queues_freq [25;2]
% 2.48/2.71 % --inst_dismatching true
% 2.48/2.71 % --inst_eager_unprocessed_to_passive true
% 2.48/2.71 % --inst_prop_sim_given true
% 2.48/2.71 % --inst_prop_sim_new false
% 2.48/2.71 % --inst_orphan_elimination true
% 2.48/2.71 % --inst_learning_loop_flag true
% 2.48/2.71 % --inst_learning_start 3000
% 2.48/2.71 % --inst_learning_factor 2
% 2.48/2.71 % --inst_start_prop_sim_after_learn 3
% 2.48/2.71 % --inst_sel_renew solver
% 2.48/2.71 % --inst_lit_activity_flag true
% 2.48/2.71 % --inst_out_proof true
% 2.48/2.71
% 2.48/2.71 % ------ Resolution Options
% 2.48/2.71
% 2.48/2.71 % --resolution_flag true
% 2.48/2.71 % --res_lit_sel kbo_max
% 2.48/2.71 % --res_to_prop_solver none
% 2.48/2.71 % --res_prop_simpl_new false
% 2.48/2.71 % --res_prop_simpl_given false
% 2.48/2.71 % --res_passive_queue_type priority_queues
% 2.48/2.71 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.48/2.71 % --res_passive_queues_freq [15;5]
% 2.48/2.71 % --res_forward_subs full
% 2.48/2.71 % --res_backward_subs full
% 2.48/2.71 % --res_forward_subs_resolution true
% 2.48/2.71 % --res_backward_subs_resolution true
% 2.48/2.71 % --res_orphan_elimination false
% 2.48/2.71 % --res_time_limit 1000.
% 2.48/2.71 % --res_out_proof true
% 2.48/2.71 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ddd501.s
% 2.48/2.71 % --modulo true
% 2.48/2.71
% 2.48/2.71 % ------ Combination Options
% 2.48/2.71
% 2.48/2.71 % --comb_res_mult 1000
% 2.48/2.71 % --comb_inst_mult 300
% 2.48/2.71 % ------
% 2.48/2.71
% 2.48/2.71 % ------ Parsing...% successful
% 2.48/2.71
% 2.48/2.71 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 24 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 2.48/2.71
% 2.48/2.71 % ------ Proving...
% 2.48/2.71 % ------ Problem Properties
% 2.48/2.71
% 2.48/2.71 %
% 2.48/2.71 % EPR false
% 2.48/2.71 % Horn false
% 2.48/2.71 % Has equality false
% 2.48/2.71
% 2.48/2.71 % % ------ Input Options Time Limit: Unbounded
% 2.48/2.71
% 2.48/2.71
% 2.48/2.71 % % ------ Current options:
% 2.48/2.71
% 2.48/2.71 % ------ Input Options
% 2.48/2.71
% 2.48/2.71 % --out_options all
% 2.48/2.71 % --tptp_safe_out true
% 2.48/2.71 % --problem_path ""
% 2.48/2.71 % --include_path ""
% 2.48/2.71 % --clausifier .//eprover
% 2.48/2.71 % --clausifier_options --tstp-format
% 2.48/2.71 % --stdin false
% 2.48/2.71 % --dbg_backtrace false
% 2.48/2.71 % --dbg_dump_prop_clauses false
% 2.48/2.71 % --dbg_dump_prop_clauses_file -
% 2.48/2.71 % --dbg_out_stat false
% 2.48/2.71
% 2.48/2.71 % ------ General Options
% 2.48/2.71
% 2.48/2.71 % --fof false
% 2.48/2.71 % --time_out_real 150.
% 2.48/2.71 % --time_out_prep_mult 0.2
% 2.48/2.71 % --time_out_virtual -1.
% 2.48/2.71 % --schedule none
% 2.48/2.71 % --ground_splitting input
% 2.48/2.71 % --splitting_nvd 16
% 2.48/2.71 % --non_eq_to_eq false
% 2.48/2.71 % --prep_gs_sim true
% 2.48/2.71 % --prep_unflatten false
% 2.48/2.71 % --prep_res_sim true
% 2.48/2.71 % --prep_upred true
% 2.48/2.71 % --res_sim_input true
% 2.48/2.71 % --clause_weak_htbl true
% 2.48/2.71 % --gc_record_bc_elim false
% 2.48/2.71 % --symbol_type_check false
% 2.48/2.71 % --clausify_out false
% 2.48/2.71 % --large_theory_mode false
% 2.48/2.71 % --prep_sem_filter none
% 2.48/2.71 % --prep_sem_filter_out false
% 2.48/2.71 % --preprocessed_out false
% 2.48/2.71 % --sub_typing false
% 2.48/2.71 % --brand_transform false
% 2.48/2.71 % --pure_diseq_elim true
% 2.48/2.71 % --min_unsat_core false
% 2.48/2.71 % --pred_elim true
% 2.48/2.71 % --add_important_lit false
% 2.48/2.71 % --soft_assumptions false
% 2.48/2.71 % --reset_solvers false
% 2.48/2.71 % --bc_imp_inh []
% 2.48/2.71 % --conj_cone_tolerance 1.5
% 2.48/2.71 % --prolific_symb_bound 500
% 2.48/2.71 % --lt_threshold 2000
% 2.48/2.71
% 2.48/2.71 % ------ SAT Options
% 2.48/2.71
% 2.48/2.71 % --sat_mode false
% 2.48/2.71 % --sat_fm_restart_options ""
% 2.48/2.71 % --sat_gr_def false
% 2.48/2.71 % --sat_epr_types true
% 2.48/2.71 % --sat_non_cyclic_types false
% 2.48/2.71 % --sat_finite_models false
% 2.48/2.71 % --sat_fm_lemmas false
% 2.48/2.71 % --sat_fm_prep false
% 2.48/2.71 % --sat_fm_uc_incr true
% 2.48/2.71 % --sat_out_model small
% 2.48/2.71 % --sat_out_clauses false
% 2.48/2.71
% 2.48/2.71 % ------ QBF Options
% 2.48/2.71
% 2.48/2.71 % --qbf_mode false
% 2.48/2.71 % --qbf_elim_univ true
% 2.48/2.71 % --qbf_sk_in true
% 2.48/2.71 % --qbf_pred_elim true
% 2.48/2.71 % --qbf_split 32
% 2.48/2.71
% 2.48/2.71 % ------ BMC1 Options
% 2.48/2.71
% 2.48/2.71 % --bmc1_incremental false
% 2.48/2.71 % --bmc1_axioms reachable_all
% 2.48/2.71 % --bmc1_min_bound 0
% 2.48/2.71 % --bmc1_max_bound -1
% 2.48/2.71 % --bmc1_max_bound_default -1
% 2.48/2.71 % --bmc1_symbol_reachability true
% 2.48/2.71 % --bmc1_property_lemmas false
% 2.48/2.71 % --bmc1_k_induction false
% 2.48/2.71 % --bmc1_non_equiv_states false
% 2.48/2.71 % --bmc1_deadlock false
% 2.48/2.71 % --bmc1_ucm false
% 2.48/2.71 % --bmc1_add_unsat_core none
% 2.48/2.71 % --bmc1_unsat_core_children false
% 2.48/2.71 % --bmc1_unsat_core_extrapolate_axioms false
% 2.48/2.71 % --bmc1_out_stat full
% 2.48/2.71 % --bmc1_ground_init false
% 2.48/2.71 % --bmc1_pre_inst_next_state false
% 2.48/2.71 % --bmc1_pre_inst_state false
% 2.48/2.71 % --bmc1_pre_inst_reach_state false
% 2.48/2.71 % --bmc1_out_unsat_core false
% 2.48/2.71 % --bmc1_aig_witness_out false
% 2.48/2.71 % --bmc1_verbose false
% 2.48/2.71 % --bmc1_dump_clauses_tptp false
% 2.48/2.71 % --bmc1_dump_unsat_core_tptp false
% 2.48/2.71 % --bmc1_dump_file -
% 2.48/2.71 % --bmc1_ucm_expand_uc_limit 128
% 2.48/2.71 % --bmc1_ucm_n_expand_iterations 6
% 2.48/2.71 % --bmc1_ucm_extend_mode 1
% 2.48/2.71 % --bmc1_ucm_init_mode 2
% 2.48/2.71 % --bmc1_ucm_cone_mode none
% 2.48/2.71 % --bmc1_ucm_reduced_relation_type 0
% 2.48/2.71 % --bmc1_ucm_relax_model 4
% 2.48/2.71 % --bmc1_ucm_full_tr_after_sat true
% 2.48/2.71 % --bmc1_ucm_expand_neg_assumptions false
% 2.48/2.71 % --bmc1_ucm_layered_model none
% 2.48/2.71 % --bmc1_ucm_max_lemma_size 10
% 2.48/2.71
% 2.48/2.71 % ------ AIG Options
% 2.48/2.71
% 2.48/2.71 % --aig_mode false
% 2.48/2.71
% 2.48/2.71 % ------ Instantiation Options
% 2.48/2.71
% 2.48/2.71 % --instantiation_flag true
% 2.48/2.71 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.48/2.71 % --inst_solver_per_active 750
% 2.48/2.71 % --inst_solver_calls_frac 0.5
% 2.48/2.71 % --inst_passive_queue_type priority_queues
% 2.48/2.71 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.48/2.71 % --inst_passive_queues_freq [25;2]
% 2.48/2.71 % --inst_dismatching true
% 2.48/2.71 % --inst_eager_unprocessed_to_passive true
% 4.47/4.63 % --inst_prop_sim_given true
% 4.47/4.63 % --inst_prop_sim_new false
% 4.47/4.63 % --inst_orphan_elimination true
% 4.47/4.63 % --inst_learning_loop_flag true
% 4.47/4.63 % --inst_learning_start 3000
% 4.47/4.63 % --inst_learning_factor 2
% 4.47/4.63 % --inst_start_prop_sim_after_learn 3
% 4.47/4.63 % --inst_sel_renew solver
% 4.47/4.63 % --inst_lit_activity_flag true
% 4.47/4.63 % --inst_out_proof true
% 4.47/4.63
% 4.47/4.63 % ------ Resolution Options
% 4.47/4.63
% 4.47/4.63 % --resolution_flag true
% 4.47/4.63 % --res_lit_sel kbo_max
% 4.47/4.63 % --res_to_prop_solver none
% 4.47/4.63 % --res_prop_simpl_new false
% 4.47/4.63 % --res_prop_simpl_given false
% 4.47/4.63 % --res_passive_queue_type priority_queues
% 4.47/4.63 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.47/4.63 % --res_passive_queues_freq [15;5]
% 4.47/4.63 % --res_forward_subs full
% 4.47/4.63 % --res_backward_subs full
% 4.47/4.63 % --res_forward_subs_resolution true
% 4.47/4.63 % --res_backward_subs_resolution true
% 4.47/4.63 % --res_orphan_elimination false
% 4.47/4.63 % --res_time_limit 1000.
% 4.47/4.63 % --res_out_proof true
% 4.47/4.63 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ddd501.s
% 4.47/4.63 % --modulo true
% 4.47/4.63
% 4.47/4.63 % ------ Combination Options
% 4.47/4.63
% 4.47/4.63 % --comb_res_mult 1000
% 4.47/4.63 % --comb_inst_mult 300
% 4.47/4.63 % ------
% 4.47/4.63
% 4.47/4.63
% 4.47/4.63
% 4.47/4.63 % ------ Proving...
% 4.47/4.63 % warning: shown sat in sat incomplete mode
% 4.47/4.63 %
% 4.47/4.63
% 4.47/4.63
% 4.47/4.63 ------ Building Model...Done
% 4.47/4.63
% 4.47/4.63 %------ The model is defined over ground terms (initial term algebra).
% 4.47/4.63 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 4.47/4.63 %------ where \phi is a formula over the term algebra.
% 4.47/4.63 %------ If we have equality in the problem then it is also defined as a predicate above,
% 4.47/4.63 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 4.47/4.63 %------ See help for --sat_out_model for different model outputs.
% 4.47/4.63 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 4.47/4.63 %------ where the first argument stands for the sort ($i in the unsorted case)
% 4.47/4.63
% 4.47/4.63
% 4.47/4.63
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of ssSkC0
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 ( ssSkC0 <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of actual_world
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0] :
% 4.47/4.63 ( ~(actual_world(X0)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of state
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( state(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc73 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of of
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( ~(of(X0,X1,X2)) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X2=skc78 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of man
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( man(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc75 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of be
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2,X3] :
% 4.47/4.63 ( ~(be(X0,X1,X2,X3)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of forename
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( forename(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc74 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of jules_forename
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( ~(jules_forename(X0,X1)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of wheel
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( wheel(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc78 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of frontseat
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( frontseat(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc78 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of ssSkP1
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( ssSkP1(X0,X1,X2) <=>
% 4.47/4.63 $true
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of behind
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( ~(behind(X0,X1,X2)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of ssSkP2
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( ~(ssSkP2(X0,X1,X2)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of ssSkP0
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( ~(ssSkP0(X0,X1)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of group
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( group(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc76 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 |
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc77 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of two
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( two(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc77 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of coat
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( coat(X0,X1) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of hollywood_placename
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( hollywood_placename(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc81 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of placename
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( ~(placename(X0,X1)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of in
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( in(X0,X1,X2) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc79 & X2=skc80 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of down
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( ~(down(X0,X1,X2)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of lonely
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( lonely(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc80 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of street
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( ~(street(X0,X1)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of city
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( ~(city(X0,X1)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of agent
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( ~(agent(X0,X1,X2)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of old
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( old(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc82 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of dirty
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( ~(dirty(X0,X1)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of white
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( ~(white(X0,X1)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of chevy
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( chevy(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc82 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of event
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( event(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc79 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Negative definition of present
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( ~(present(X0,X1)) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of barrel
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( barrel(X0,X1) <=>
% 4.47/4.63 (
% 4.47/4.63 (
% 4.47/4.63 ( X0=skc71 & X1=skc79 )
% 4.47/4.63 )
% 4.47/4.63
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of member
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( member(X0,X1,X2) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of fellow
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1] :
% 4.47/4.63 ( fellow(X0,X1) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP2_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( sP2_iProver_split(X0,X1,X2) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP5_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( sP5_iProver_split(X0,X1,X2) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP7_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2,X3,X4,X5] :
% 4.47/4.63 ( sP7_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP8_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( sP8_iProver_split(X0,X1,X2) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP10_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2,X3,X4,X5] :
% 4.47/4.63 ( sP10_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP11_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( sP11_iProver_split(X0,X1,X2) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP14_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( sP14_iProver_split(X0,X1,X2) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP17_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( sP17_iProver_split(X0,X1,X2) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP19_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2,X3,X4,X5] :
% 4.47/4.63 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP20_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( sP20_iProver_split(X0,X1,X2) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP22_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2,X3,X4,X5] :
% 4.47/4.63 ( sP22_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63 %------ Positive definition of sP23_iProver_split
% 4.47/4.63 fof(lit_def,axiom,
% 4.47/4.63 (! [X0,X1,X2] :
% 4.47/4.63 ( sP23_iProver_split(X0,X1,X2) <=>
% 4.47/4.63 $false
% 4.47/4.63 )
% 4.47/4.63 )
% 4.47/4.63 ).
% 4.47/4.63
% 4.47/4.63
% 4.47/4.63
% 4.47/4.63 % ------ Statistics
% 4.47/4.63
% 4.47/4.63 % ------ General
% 4.47/4.63
% 4.47/4.63 % num_of_input_clauses: 92
% 4.47/4.63 % num_of_input_neg_conjectures: 92
% 4.47/4.63 % num_of_splits: 24
% 4.47/4.63 % num_of_split_atoms: 24
% 4.47/4.63 % num_of_sem_filtered_clauses: 0
% 4.47/4.63 % num_of_subtypes: 0
% 4.47/4.63 % monotx_restored_types: 0
% 4.47/4.63 % sat_num_of_epr_types: 0
% 4.47/4.63 % sat_num_of_non_cyclic_types: 0
% 4.47/4.63 % sat_guarded_non_collapsed_types: 0
% 4.47/4.63 % is_epr: 0
% 4.47/4.63 % is_horn: 0
% 4.47/4.63 % has_eq: 0
% 4.47/4.63 % num_pure_diseq_elim: 0
% 4.47/4.63 % simp_replaced_by: 0
% 4.47/4.63 % res_preprocessed: 208
% 4.47/4.63 % prep_upred: 0
% 4.47/4.63 % prep_unflattend: 0
% 4.47/4.63 % pred_elim_cands: 24
% 4.47/4.63 % pred_elim: 8
% 4.47/4.63 % pred_elim_cl: 8
% 4.47/4.63 % pred_elim_cycles: 40
% 4.47/4.63 % forced_gc_time: 0
% 4.47/4.63 % gc_basic_clause_elim: 0
% 4.47/4.63 % parsing_time: 0.002
% 4.47/4.63 % sem_filter_time: 0.
% 4.47/4.63 % pred_elim_time: 0.05
% 4.47/4.63 % out_proof_time: 0.
% 4.47/4.63 % monotx_time: 0.
% 4.47/4.63 % subtype_inf_time: 0.
% 4.47/4.63 % unif_index_cands_time: 0.003
% 4.47/4.63 % unif_index_add_time: 0.002
% 4.47/4.63 % total_time: 1.995
% 4.47/4.63 % num_of_symbols: 122
% 4.47/4.63 % num_of_terms: 6398
% 4.47/4.63
% 4.47/4.63 % ------ Propositional Solver
% 4.47/4.63
% 4.47/4.63 % prop_solver_calls: 5
% 4.47/4.63 % prop_fast_solver_calls: 2023
% 4.47/4.63 % prop_num_of_clauses: 465
% 4.47/4.63 % prop_preprocess_simplified: 1857
% 4.47/4.63 % prop_fo_subsumed: 0
% 4.47/4.63 % prop_solver_time: 0.
% 4.47/4.63 % prop_fast_solver_time: 0.002
% 4.47/4.63 % prop_unsat_core_time: 0.
% 4.47/4.63
% 4.47/4.63 % ------ QBF
% 4.47/4.63
% 4.47/4.63 % qbf_q_res: 0
% 4.47/4.63 % qbf_num_tautologies: 0
% 4.47/4.63 % qbf_prep_cycles: 0
% 4.47/4.63
% 4.47/4.63 % ------ BMC1
% 4.47/4.63
% 4.47/4.63 % bmc1_current_bound: -1
% 4.47/4.63 % bmc1_last_solved_bound: -1
% 4.47/4.63 % bmc1_unsat_core_size: -1
% 4.47/4.63 % bmc1_unsat_core_parents_size: -1
% 4.47/4.63 % bmc1_merge_next_fun: 0
% 4.47/4.63 % bmc1_unsat_core_clauses_time: 0.
% 4.47/4.63
% 4.47/4.63 % ------ Instantiation
% 4.47/4.63
% 4.47/4.63 % inst_num_of_clauses: 217
% 4.47/4.63 % inst_num_in_passive: 0
% 4.47/4.63 % inst_num_in_active: 217
% 4.47/4.63 % inst_num_in_unprocessed: 0
% 4.47/4.63 % inst_num_of_loops: 235
% 4.47/4.63 % inst_num_of_learning_restarts: 0
% 4.47/4.63 % inst_num_moves_active_passive: 8
% 4.47/4.63 % inst_lit_activity: 38
% 4.47/4.63 % inst_lit_activity_moves: 0
% 4.47/4.63 % inst_num_tautologies: 0
% 4.47/4.63 % inst_num_prop_implied: 0
% 4.47/4.63 % inst_num_existing_simplified: 0
% 4.47/4.63 % inst_num_eq_res_simplified: 0
% 4.47/4.63 % inst_num_child_elim: 0
% 4.47/4.63 % inst_num_of_dismatching_blockings: 0
% 4.47/4.63 % inst_num_of_non_proper_insts: 114
% 4.47/4.63 % inst_num_of_duplicates: 0
% 4.47/4.63 % inst_inst_num_from_inst_to_res: 0
% 4.47/4.63 % inst_dismatching_checking_time: 0.
% 4.47/4.63
% 4.47/4.63 % ------ Resolution
% 4.47/4.63
% 4.47/4.63 % res_num_of_clauses: 21103
% 4.47/4.63 % res_num_in_passive: 20207
% 4.47/4.63 % res_num_in_active: 896
% 4.47/4.63 % res_num_of_loops: 1000
% 4.47/4.63 % res_forward_subset_subsumed: 18348
% 4.47/4.63 % res_backward_subset_subsumed: 0
% 4.47/4.63 % res_forward_subsumed: 98
% 4.47/4.63 % res_backward_subsumed: 6
% 4.47/4.63 % res_forward_subsumption_resolution: 120
% 4.47/4.63 % res_backward_subsumption_resolution: 0
% 4.47/4.63 % res_clause_to_clause_subsumption: 742
% 4.47/4.63 % res_orphan_elimination: 0
% 4.47/4.63 % res_tautology_del: 432
% 4.47/4.63 % res_num_eq_res_simplified: 0
% 4.47/4.63 % res_num_sel_changes: 0
% 4.47/4.63 % res_moves_from_active_to_pass: 0
% 4.47/4.63
% 4.47/4.63 % Status Unknown
% 4.47/4.63 % Last status :
% 4.47/4.63 % SZS status Unknown
%------------------------------------------------------------------------------