TSTP Solution File: NLP196-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP196-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n012.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:12 EDT 2022
% Result : Unknown 202.30s 202.54s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NLP196-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : iprover_modulo %s %d
% 0.11/0.33 % Computer : n012.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Fri Jul 1 05:33:02 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.34 % Running in mono-core mode
% 0.18/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.18/0.40 % Orientation found
% 0.18/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_a69a25.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e221b7.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_6a6a5c | 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.52 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.52 % --bmc1_dump_file -
% 0.18/0.52 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.52 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.52 % --bmc1_ucm_extend_mode 1
% 0.18/0.52 % --bmc1_ucm_init_mode 2
% 0.18/0.52 % --bmc1_ucm_cone_mode none
% 0.18/0.52 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.52 % --bmc1_ucm_relax_model 4
% 0.18/0.52 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.52 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.52 % --bmc1_ucm_layered_model none
% 0.18/0.52 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.52
% 0.18/0.52 % ------ AIG Options
% 0.18/0.52
% 0.18/0.52 % --aig_mode false
% 0.18/0.52
% 0.18/0.52 % ------ Instantiation Options
% 0.18/0.52
% 0.18/0.52 % --instantiation_flag true
% 0.18/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.52 % --inst_solver_per_active 750
% 0.18/0.52 % --inst_solver_calls_frac 0.5
% 0.18/0.52 % --inst_passive_queue_type priority_queues
% 0.18/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.52 % --inst_passive_queues_freq [25;2]
% 0.18/0.52 % --inst_dismatching true
% 0.18/0.52 % --inst_eager_unprocessed_to_passive true
% 0.18/0.52 % --inst_prop_sim_given true
% 0.18/0.52 % --inst_prop_sim_new false
% 0.18/0.52 % --inst_orphan_elimination true
% 0.18/0.52 % --inst_learning_loop_flag true
% 0.18/0.52 % --inst_learning_start 3000
% 0.18/0.52 % --inst_learning_factor 2
% 0.18/0.52 % --inst_start_prop_sim_after_learn 3
% 0.18/0.52 % --inst_sel_renew solver
% 0.18/0.52 % --inst_lit_activity_flag true
% 0.18/0.52 % --inst_out_proof true
% 0.18/0.52
% 0.18/0.52 % ------ Resolution Options
% 0.18/0.52
% 0.18/0.52 % --resolution_flag true
% 0.18/0.52 % --res_lit_sel kbo_max
% 0.18/0.52 % --res_to_prop_solver none
% 0.18/0.52 % --res_prop_simpl_new false
% 0.18/0.52 % --res_prop_simpl_given false
% 0.18/0.52 % --res_passive_queue_type priority_queues
% 0.18/0.52 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.18/0.52 % --res_passive_queues_freq [15;5]
% 0.18/0.52 % --res_forward_subs full
% 0.18/0.52 % --res_backward_subs full
% 0.18/0.52 % --res_forward_subs_resolution true
% 0.18/0.52 % --res_backward_subs_resolution true
% 0.18/0.52 % --res_orphan_elimination false
% 0.18/0.52 % --res_time_limit 1000.
% 0.18/0.52 % --res_out_proof true
% 0.18/0.52 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a69a25.s
% 0.18/0.52 % --modulo true
% 0.18/0.52
% 0.18/0.52 % ------ Combination Options
% 0.18/0.52
% 0.18/0.52 % --comb_res_mult 1000
% 0.18/0.52 % --comb_inst_mult 300
% 0.18/0.52 % ------
% 0.18/0.52
% 0.18/0.52 % ------ Parsing...% successful
% 0.18/0.52
% 0.18/0.52 % ------ 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.18/0.52
% 0.18/0.52 % ------ Proving...
% 0.18/0.52 % ------ Problem Properties
% 0.18/0.52
% 0.18/0.52 %
% 0.18/0.52 % EPR false
% 0.18/0.52 % Horn false
% 0.18/0.52 % Has equality false
% 0.18/0.52
% 0.18/0.52 % % ------ Input Options Time Limit: Unbounded
% 0.18/0.52
% 0.18/0.52
% 0.18/0.52 % % ------ Current options:
% 0.18/0.52
% 0.18/0.52 % ------ Input Options
% 0.18/0.52
% 0.18/0.52 % --out_options all
% 0.18/0.52 % --tptp_safe_out true
% 0.18/0.52 % --problem_path ""
% 0.18/0.52 % --include_path ""
% 0.18/0.52 % --clausifier .//eprover
% 0.18/0.52 % --clausifier_options --tstp-format
% 0.18/0.52 % --stdin false
% 0.18/0.52 % --dbg_backtrace false
% 0.18/0.52 % --dbg_dump_prop_clauses false
% 0.18/0.52 % --dbg_dump_prop_clauses_file -
% 0.18/0.52 % --dbg_out_stat false
% 0.18/0.52
% 0.18/0.52 % ------ General Options
% 0.18/0.52
% 0.18/0.52 % --fof false
% 0.18/0.52 % --time_out_real 150.
% 0.18/0.52 % --time_out_prep_mult 0.2
% 0.18/0.52 % --time_out_virtual -1.
% 0.18/0.52 % --schedule none
% 0.18/0.52 % --ground_splitting input
% 0.18/0.52 % --splitting_nvd 16
% 0.18/0.52 % --non_eq_to_eq false
% 0.18/0.52 % --prep_gs_sim true
% 0.18/0.52 % --prep_unflatten false
% 0.18/0.52 % --prep_res_sim true
% 0.18/0.52 % --prep_upred true
% 0.18/0.52 % --res_sim_input true
% 0.18/0.52 % --clause_weak_htbl true
% 0.18/0.52 % --gc_record_bc_elim false
% 0.18/0.52 % --symbol_type_check false
% 0.18/0.52 % --clausify_out false
% 0.18/0.52 % --large_theory_mode false
% 0.18/0.52 % --prep_sem_filter none
% 0.18/0.52 % --prep_sem_filter_out false
% 0.18/0.52 % --preprocessed_out false
% 0.18/0.52 % --sub_typing false
% 0.18/0.52 % --brand_transform false
% 0.18/0.52 % --pure_diseq_elim true
% 0.18/0.52 % --min_unsat_core false
% 0.18/0.52 % --pred_elim true
% 0.18/0.52 % --add_important_lit false
% 0.18/0.52 % --soft_assumptions false
% 0.18/0.52 % --reset_solvers false
% 0.18/0.52 % --bc_imp_inh []
% 0.18/0.52 % --conj_cone_tolerance 1.5
% 0.18/0.52 % --prolific_symb_bound 500
% 0.18/0.52 % --lt_threshold 2000
% 0.18/0.52
% 0.18/0.52 % ------ SAT Options
% 0.18/0.52
% 0.18/0.52 % --sat_mode false
% 0.18/0.52 % --sat_fm_restart_options ""
% 0.18/0.52 % --sat_gr_def false
% 0.18/0.52 % --sat_epr_types true
% 0.18/0.52 % --sat_non_cyclic_types false
% 0.18/0.52 % --sat_finite_models false
% 0.18/0.52 % --sat_fm_lemmas false
% 0.18/0.52 % --sat_fm_prep false
% 0.18/0.52 % --sat_fm_uc_incr true
% 0.18/0.52 % --sat_out_model small
% 0.18/0.52 % --sat_out_clauses false
% 0.18/0.52
% 0.18/0.52 % ------ QBF Options
% 0.18/0.52
% 0.18/0.52 % --qbf_mode false
% 0.18/0.52 % --qbf_elim_univ true
% 0.18/0.52 % --qbf_sk_in true
% 0.18/0.52 % --qbf_pred_elim true
% 0.18/0.52 % --qbf_split 32
% 0.18/0.52
% 0.18/0.52 % ------ BMC1 Options
% 0.18/0.52
% 0.18/0.52 % --bmc1_incremental false
% 0.18/0.52 % --bmc1_axioms reachable_all
% 0.18/0.52 % --bmc1_min_bound 0
% 0.18/0.52 % --bmc1_max_bound -1
% 0.18/0.52 % --bmc1_max_bound_default -1
% 0.18/0.52 % --bmc1_symbol_reachability true
% 0.18/0.52 % --bmc1_property_lemmas false
% 0.18/0.52 % --bmc1_k_induction false
% 0.18/0.52 % --bmc1_non_equiv_states false
% 0.18/0.52 % --bmc1_deadlock false
% 0.18/0.52 % --bmc1_ucm false
% 0.18/0.52 % --bmc1_add_unsat_core none
% 0.18/0.52 % --bmc1_unsat_core_children false
% 0.18/0.52 % --bmc1_unsat_core_extrapolate_axioms false
% 0.18/0.52 % --bmc1_out_stat full
% 0.18/0.52 % --bmc1_ground_init false
% 0.18/0.52 % --bmc1_pre_inst_next_state false
% 0.18/0.52 % --bmc1_pre_inst_state false
% 0.18/0.52 % --bmc1_pre_inst_reach_state false
% 0.18/0.52 % --bmc1_out_unsat_core false
% 0.18/0.52 % --bmc1_aig_witness_out false
% 0.18/0.52 % --bmc1_verbose false
% 0.18/0.52 % --bmc1_dump_clauses_tptp false
% 0.18/0.52 % --bmc1_dump_unsat_core_tptp false
% 0.18/0.52 % --bmc1_dump_file -
% 0.18/0.52 % --bmc1_ucm_expand_uc_limit 128
% 0.18/0.52 % --bmc1_ucm_n_expand_iterations 6
% 0.18/0.52 % --bmc1_ucm_extend_mode 1
% 0.18/0.52 % --bmc1_ucm_init_mode 2
% 0.18/0.52 % --bmc1_ucm_cone_mode none
% 0.18/0.52 % --bmc1_ucm_reduced_relation_type 0
% 0.18/0.52 % --bmc1_ucm_relax_model 4
% 0.18/0.52 % --bmc1_ucm_full_tr_after_sat true
% 0.18/0.52 % --bmc1_ucm_expand_neg_assumptions false
% 0.18/0.52 % --bmc1_ucm_layered_model none
% 0.18/0.52 % --bmc1_ucm_max_lemma_size 10
% 0.18/0.52
% 0.18/0.52 % ------ AIG Options
% 0.18/0.52
% 0.18/0.52 % --aig_mode false
% 0.18/0.52
% 0.18/0.52 % ------ Instantiation Options
% 0.18/0.52
% 0.18/0.52 % --instantiation_flag true
% 0.18/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.18/0.52 % --inst_solver_per_active 750
% 0.18/0.52 % --inst_solver_calls_frac 0.5
% 0.18/0.52 % --inst_passive_queue_type priority_queues
% 0.18/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.18/0.52 % --inst_passive_queues_freq [25;2]
% 0.18/0.52 % --inst_dismatching true
% 0.18/0.52 % --inst_eager_unprocessed_to_passive true
% 101.40/101.61 % --inst_prop_sim_given true
% 101.40/101.61 % --inst_prop_sim_new false
% 101.40/101.61 % --inst_orphan_elimination true
% 101.40/101.61 % --inst_learning_loop_flag true
% 101.40/101.61 % --inst_learning_start 3000
% 101.40/101.61 % --inst_learning_factor 2
% 101.40/101.61 % --inst_start_prop_sim_after_learn 3
% 101.40/101.61 % --inst_sel_renew solver
% 101.40/101.61 % --inst_lit_activity_flag true
% 101.40/101.61 % --inst_out_proof true
% 101.40/101.61
% 101.40/101.61 % ------ Resolution Options
% 101.40/101.61
% 101.40/101.61 % --resolution_flag true
% 101.40/101.61 % --res_lit_sel kbo_max
% 101.40/101.61 % --res_to_prop_solver none
% 101.40/101.61 % --res_prop_simpl_new false
% 101.40/101.61 % --res_prop_simpl_given false
% 101.40/101.61 % --res_passive_queue_type priority_queues
% 101.40/101.61 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 101.40/101.61 % --res_passive_queues_freq [15;5]
% 101.40/101.61 % --res_forward_subs full
% 101.40/101.61 % --res_backward_subs full
% 101.40/101.61 % --res_forward_subs_resolution true
% 101.40/101.61 % --res_backward_subs_resolution true
% 101.40/101.61 % --res_orphan_elimination false
% 101.40/101.61 % --res_time_limit 1000.
% 101.40/101.61 % --res_out_proof true
% 101.40/101.61 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a69a25.s
% 101.40/101.61 % --modulo true
% 101.40/101.61
% 101.40/101.61 % ------ Combination Options
% 101.40/101.61
% 101.40/101.61 % --comb_res_mult 1000
% 101.40/101.61 % --comb_inst_mult 300
% 101.40/101.61 % ------
% 101.40/101.61
% 101.40/101.61
% 101.40/101.61
% 101.40/101.61 % ------ Proving...
% 101.40/101.61 % warning: shown sat in sat incomplete mode
% 101.40/101.61 %
% 101.40/101.61
% 101.40/101.61
% 101.40/101.61 ------ Building Model...Done
% 101.40/101.61
% 101.40/101.61 %------ The model is defined over ground terms (initial term algebra).
% 101.40/101.61 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 101.40/101.61 %------ where \phi is a formula over the term algebra.
% 101.40/101.61 %------ If we have equality in the problem then it is also defined as a predicate above,
% 101.40/101.61 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 101.40/101.61 %------ See help for --sat_out_model for different model outputs.
% 101.40/101.61 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 101.40/101.61 %------ where the first argument stands for the sort ($i in the unsorted case)
% 101.40/101.61
% 101.40/101.61
% 101.40/101.61
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of ssSkC0
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 ( ssSkC0 <=>
% 101.40/101.61 $true
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of actual_world
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0] :
% 101.40/101.61 ( ~(actual_world(X0)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of state
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( state(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc27 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of of
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1,X2] :
% 101.40/101.61 ( ~(of(X0,X1,X2)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of man
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( man(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc29 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of be
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1,X2,X3] :
% 101.40/101.61 ( ~(be(X0,X1,X2,X3)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of forename
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( forename(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc28 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of jules_forename
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( ~(jules_forename(X0,X1)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of wheel
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( wheel(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc30 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of behind
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1,X2] :
% 101.40/101.61 ( behind(X0,X1,X2) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc26 & X2=skc30 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of frontseat
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( ~(frontseat(X0,X1)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of ssSkP1
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1,X2] :
% 101.40/101.61 ( ssSkP1(X0,X1,X2) <=>
% 101.40/101.61 $true
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of ssSkP2
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1,X2] :
% 101.40/101.61 ( ssSkP2(X0,X1,X2) <=>
% 101.40/101.61 $true
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of ssSkP0
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( ssSkP0(X0,X1) <=>
% 101.40/101.61 $true
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of group
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( group(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc31 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 |
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc32 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of two
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( two(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc32 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of coat
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( coat(X0,X1) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of hollywood_placename
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( hollywood_placename(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc36 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of placename
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( ~(placename(X0,X1)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of in
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1,X2] :
% 101.40/101.61 ( in(X0,X1,X2) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc34 & X2=skc35 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of down
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1,X2] :
% 101.40/101.61 ( ~(down(X0,X1,X2)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of lonely
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( lonely(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc35 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of street
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( ~(street(X0,X1)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of city
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( ~(city(X0,X1)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of agent
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1,X2] :
% 101.40/101.61 ( ~(agent(X0,X1,X2)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of old
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( old(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc37 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of dirty
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( ~(dirty(X0,X1)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of white
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( ~(white(X0,X1)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of chevy
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( chevy(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc37 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of event
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( event(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc34 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Negative definition of present
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( ~(present(X0,X1)) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of barrel
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1] :
% 101.40/101.61 ( barrel(X0,X1) <=>
% 101.40/101.61 (
% 101.40/101.61 (
% 101.40/101.61 ( X0=skc25 & X1=skc34 )
% 101.40/101.61 )
% 101.40/101.61
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of member
% 101.40/101.61 fof(lit_def,axiom,
% 101.40/101.61 (! [X0,X1,X2] :
% 101.40/101.61 ( member(X0,X1,X2) <=>
% 101.40/101.61 $false
% 101.40/101.61 )
% 101.40/101.61 )
% 101.40/101.61 ).
% 101.40/101.61
% 101.40/101.61 %------ Positive definition of sP2_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2] :
% 101.40/101.62 ( sP2_iProver_split(X0,X1,X2) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62 %------ Positive definition of sP5_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2] :
% 101.40/101.62 ( sP5_iProver_split(X0,X1,X2) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62 %------ Positive definition of sP7_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2,X3,X4,X5] :
% 101.40/101.62 ( sP7_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62 %------ Positive definition of sP8_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2] :
% 101.40/101.62 ( sP8_iProver_split(X0,X1,X2) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62 %------ Positive definition of sP10_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2,X3,X4,X5] :
% 101.40/101.62 ( sP10_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62 %------ Positive definition of sP11_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2] :
% 101.40/101.62 ( sP11_iProver_split(X0,X1,X2) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62 %------ Positive definition of sP14_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2] :
% 101.40/101.62 ( sP14_iProver_split(X0,X1,X2) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62 %------ Positive definition of sP17_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2] :
% 101.40/101.62 ( sP17_iProver_split(X0,X1,X2) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62 %------ Positive definition of sP19_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2,X3,X4,X5] :
% 101.40/101.62 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62 %------ Positive definition of sP20_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2] :
% 101.40/101.62 ( sP20_iProver_split(X0,X1,X2) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62 %------ Positive definition of sP22_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2,X3,X4,X5] :
% 101.40/101.62 ( sP22_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62 %------ Positive definition of sP23_iProver_split
% 101.40/101.62 fof(lit_def,axiom,
% 101.40/101.62 (! [X0,X1,X2] :
% 101.40/101.62 ( sP23_iProver_split(X0,X1,X2) <=>
% 101.40/101.62 $false
% 101.40/101.62 )
% 101.40/101.62 )
% 101.40/101.62 ).
% 101.40/101.62
% 101.40/101.62
% 101.40/101.62
% 101.40/101.62 % ------ Statistics
% 101.40/101.62
% 101.40/101.62 % ------ General
% 101.40/101.62
% 101.40/101.62 % num_of_input_clauses: 92
% 101.40/101.62 % num_of_input_neg_conjectures: 92
% 101.40/101.62 % num_of_splits: 24
% 101.40/101.62 % num_of_split_atoms: 24
% 101.40/101.62 % num_of_sem_filtered_clauses: 0
% 101.40/101.62 % num_of_subtypes: 0
% 101.40/101.62 % monotx_restored_types: 0
% 101.40/101.62 % sat_num_of_epr_types: 0
% 101.40/101.62 % sat_num_of_non_cyclic_types: 0
% 101.40/101.62 % sat_guarded_non_collapsed_types: 0
% 101.40/101.62 % is_epr: 0
% 101.40/101.62 % is_horn: 0
% 101.40/101.62 % has_eq: 0
% 101.40/101.62 % num_pure_diseq_elim: 0
% 101.40/101.62 % simp_replaced_by: 0
% 101.40/101.62 % res_preprocessed: 208
% 101.40/101.62 % prep_upred: 0
% 101.40/101.62 % prep_unflattend: 0
% 101.40/101.62 % pred_elim_cands: 24
% 101.40/101.62 % pred_elim: 8
% 101.40/101.62 % pred_elim_cl: 8
% 101.40/101.62 % pred_elim_cycles: 40
% 101.40/101.62 % forced_gc_time: 0
% 101.40/101.62 % gc_basic_clause_elim: 0
% 101.40/101.62 % parsing_time: 0.003
% 101.40/101.62 % sem_filter_time: 0.
% 101.40/101.62 % pred_elim_time: 0.074
% 101.40/101.62 % out_proof_time: 0.
% 101.40/101.62 % monotx_time: 0.
% 101.40/101.62 % subtype_inf_time: 0.
% 101.40/101.62 % unif_index_cands_time: 0.048
% 101.40/101.62 % unif_index_add_time: 0.033
% 101.40/101.62 % total_time: 101.208
% 101.40/101.62 % num_of_symbols: 123
% 101.40/101.62 % num_of_terms: 31730
% 101.40/101.62
% 101.40/101.62 % ------ Propositional Solver
% 101.40/101.62
% 101.40/101.62 % prop_solver_calls: 26
% 101.40/101.62 % prop_fast_solver_calls: 2023
% 101.40/101.62 % prop_num_of_clauses: 4616
% 101.40/101.62 % prop_preprocess_simplified: 6336
% 101.40/101.62 % prop_fo_subsumed: 0
% 101.40/101.62 % prop_solver_time: 0.002
% 101.40/101.62 % prop_fast_solver_time: 0.003
% 101.40/101.62 % prop_unsat_core_time: 0.
% 101.40/101.62
% 101.40/101.62 % ------ QBF
% 101.40/101.62
% 101.40/101.62 % qbf_q_res: 0
% 101.40/101.62 % qbf_num_tautologies: 0
% 101.40/101.62 % qbf_prep_cycles: 0
% 101.40/101.62
% 101.40/101.62 % ------ BMC1
% 101.40/101.62
% 101.40/101.62 % bmc1_current_bound: -1
% 101.40/101.62 % bmc1_last_solved_bound: -1
% 101.40/101.62 % bmc1_unsat_core_size: -1
% 101.40/101.62 % bmc1_unsat_core_parents_size: -1
% 101.40/101.62 % bmc1_merge_next_fun: 0
% 101.40/101.62 % bmc1_unsat_core_clauses_time: 0.
% 101.40/101.62
% 101.40/101.62 % ------ Instantiation
% 101.40/101.62
% 101.40/101.62 % inst_num_of_clauses: 188
% 101.40/101.62 % inst_num_in_passive: 0
% 101.40/101.62 % inst_num_in_active: 188
% 101.40/101.62 % inst_num_in_unprocessed: 0
% 101.40/101.62 % inst_num_of_loops: 195
% 101.40/101.62 % inst_num_of_learning_restarts: 1
% 101.40/101.62 % inst_num_moves_active_passive: 0
% 101.40/101.62 % inst_lit_activity: 38
% 101.40/101.62 % inst_lit_activity_moves: 0
% 101.40/101.62 % inst_num_tautologies: 0
% 101.40/101.62 % inst_num_prop_implied: 0
% 101.40/101.62 % inst_num_existing_simplified: 0
% 101.40/101.62 % inst_num_eq_res_simplified: 0
% 101.40/101.62 % inst_num_child_elim: 0
% 101.40/101.62 % inst_num_of_dismatching_blockings: 0
% 101.40/101.62 % inst_num_of_non_proper_insts: 76
% 101.40/101.62 % inst_num_of_duplicates: 0
% 101.40/101.62 % inst_inst_num_from_inst_to_res: 0
% 101.40/101.62 % inst_dismatching_checking_time: 0.003
% 101.40/101.62
% 101.40/101.62 % ------ Resolution
% 101.40/101.62
% 101.40/101.62 % res_num_of_clauses: 984929
% 101.40/101.62 % res_num_in_passive: 993247
% 101.40/101.62 % res_num_in_active: 7646
% 101.40/101.62 % res_num_of_loops: 11000
% 101.40/101.62 % res_forward_subset_subsumed: 431992
% 101.40/101.62 % res_backward_subset_subsumed: 16181
% 101.40/101.62 % res_forward_subsumed: 2847
% 101.40/101.62 % res_backward_subsumed: 176
% 101.40/101.62 % res_forward_subsumption_resolution: 3792
% 101.40/101.62 % res_backward_subsumption_resolution: 6
% 101.40/101.62 % res_clause_to_clause_subsumption: 281663
% 101.40/101.62 % res_orphan_elimination: 0
% 101.40/101.62 % res_tautology_del: 4266
% 101.40/101.62 % res_num_eq_res_simplified: 0
% 101.40/101.62 % res_num_sel_changes: 0
% 101.40/101.62 % res_moves_from_active_to_pass: 0
% 101.40/101.62
% 101.40/101.62 % Status Unknown
% 101.45/101.67 % Orienting using strategy ClausalAll
% 101.45/101.67 % Orientation found
% 101.45/101.67 % 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_a69a25.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e221b7.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_d758d9 | grep -v "SZS"
% 101.50/101.68
% 101.50/101.68 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 101.50/101.68
% 101.50/101.68 %
% 101.50/101.68 % ------ iProver source info
% 101.50/101.68
% 101.50/101.68 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 101.50/101.68 % git: non_committed_changes: true
% 101.50/101.68 % git: last_make_outside_of_git: true
% 101.50/101.68
% 101.50/101.68 %
% 101.50/101.68 % ------ Input Options
% 101.50/101.68
% 101.50/101.68 % --out_options all
% 101.50/101.68 % --tptp_safe_out true
% 101.50/101.68 % --problem_path ""
% 101.50/101.68 % --include_path ""
% 101.50/101.68 % --clausifier .//eprover
% 101.50/101.68 % --clausifier_options --tstp-format
% 101.50/101.68 % --stdin false
% 101.50/101.68 % --dbg_backtrace false
% 101.50/101.68 % --dbg_dump_prop_clauses false
% 101.50/101.68 % --dbg_dump_prop_clauses_file -
% 101.50/101.68 % --dbg_out_stat false
% 101.50/101.68
% 101.50/101.68 % ------ General Options
% 101.50/101.68
% 101.50/101.68 % --fof false
% 101.50/101.68 % --time_out_real 150.
% 101.50/101.68 % --time_out_prep_mult 0.2
% 101.50/101.68 % --time_out_virtual -1.
% 101.50/101.68 % --schedule none
% 101.50/101.68 % --ground_splitting input
% 101.50/101.68 % --splitting_nvd 16
% 101.50/101.68 % --non_eq_to_eq false
% 101.50/101.68 % --prep_gs_sim true
% 101.50/101.68 % --prep_unflatten false
% 101.50/101.68 % --prep_res_sim true
% 101.50/101.68 % --prep_upred true
% 101.50/101.68 % --res_sim_input true
% 101.50/101.68 % --clause_weak_htbl true
% 101.50/101.68 % --gc_record_bc_elim false
% 101.50/101.68 % --symbol_type_check false
% 101.50/101.68 % --clausify_out false
% 101.50/101.68 % --large_theory_mode false
% 101.50/101.68 % --prep_sem_filter none
% 101.50/101.68 % --prep_sem_filter_out false
% 101.50/101.68 % --preprocessed_out false
% 101.50/101.68 % --sub_typing false
% 101.50/101.68 % --brand_transform false
% 101.50/101.68 % --pure_diseq_elim true
% 101.50/101.68 % --min_unsat_core false
% 101.50/101.68 % --pred_elim true
% 101.50/101.68 % --add_important_lit false
% 101.50/101.68 % --soft_assumptions false
% 101.50/101.68 % --reset_solvers false
% 101.50/101.68 % --bc_imp_inh []
% 101.50/101.68 % --conj_cone_tolerance 1.5
% 101.50/101.68 % --prolific_symb_bound 500
% 101.50/101.68 % --lt_threshold 2000
% 101.50/101.68
% 101.50/101.68 % ------ SAT Options
% 101.50/101.68
% 101.50/101.68 % --sat_mode false
% 101.50/101.68 % --sat_fm_restart_options ""
% 101.50/101.68 % --sat_gr_def false
% 101.50/101.68 % --sat_epr_types true
% 101.50/101.68 % --sat_non_cyclic_types false
% 101.50/101.68 % --sat_finite_models false
% 101.50/101.68 % --sat_fm_lemmas false
% 101.50/101.68 % --sat_fm_prep false
% 101.50/101.68 % --sat_fm_uc_incr true
% 101.50/101.68 % --sat_out_model small
% 101.50/101.68 % --sat_out_clauses false
% 101.50/101.68
% 101.50/101.68 % ------ QBF Options
% 101.50/101.68
% 101.50/101.68 % --qbf_mode false
% 101.50/101.68 % --qbf_elim_univ true
% 101.50/101.68 % --qbf_sk_in true
% 101.50/101.68 % --qbf_pred_elim true
% 101.50/101.68 % --qbf_split 32
% 101.50/101.68
% 101.50/101.68 % ------ BMC1 Options
% 101.50/101.68
% 101.50/101.68 % --bmc1_incremental false
% 101.50/101.68 % --bmc1_axioms reachable_all
% 101.50/101.68 % --bmc1_min_bound 0
% 101.50/101.68 % --bmc1_max_bound -1
% 101.50/101.68 % --bmc1_max_bound_default -1
% 101.50/101.68 % --bmc1_symbol_reachability true
% 101.50/101.68 % --bmc1_property_lemmas false
% 101.50/101.68 % --bmc1_k_induction false
% 101.50/101.68 % --bmc1_non_equiv_states false
% 101.50/101.68 % --bmc1_deadlock false
% 101.50/101.68 % --bmc1_ucm false
% 101.50/101.68 % --bmc1_add_unsat_core none
% 101.50/101.68 % --bmc1_unsat_core_children false
% 101.50/101.68 % --bmc1_unsat_core_extrapolate_axioms false
% 101.50/101.68 % --bmc1_out_stat full
% 101.50/101.68 % --bmc1_ground_init false
% 101.50/101.68 % --bmc1_pre_inst_next_state false
% 101.50/101.68 % --bmc1_pre_inst_state false
% 101.50/101.68 % --bmc1_pre_inst_reach_state false
% 101.50/101.68 % --bmc1_out_unsat_core false
% 101.50/101.68 % --bmc1_aig_witness_out false
% 101.50/101.68 % --bmc1_verbose false
% 101.50/101.68 % --bmc1_dump_clauses_tptp false
% 101.50/101.74 % --bmc1_dump_unsat_core_tptp false
% 101.50/101.74 % --bmc1_dump_file -
% 101.50/101.74 % --bmc1_ucm_expand_uc_limit 128
% 101.50/101.74 % --bmc1_ucm_n_expand_iterations 6
% 101.50/101.74 % --bmc1_ucm_extend_mode 1
% 101.50/101.74 % --bmc1_ucm_init_mode 2
% 101.50/101.74 % --bmc1_ucm_cone_mode none
% 101.50/101.74 % --bmc1_ucm_reduced_relation_type 0
% 101.50/101.74 % --bmc1_ucm_relax_model 4
% 101.50/101.74 % --bmc1_ucm_full_tr_after_sat true
% 101.50/101.74 % --bmc1_ucm_expand_neg_assumptions false
% 101.50/101.74 % --bmc1_ucm_layered_model none
% 101.50/101.74 % --bmc1_ucm_max_lemma_size 10
% 101.50/101.74
% 101.50/101.74 % ------ AIG Options
% 101.50/101.74
% 101.50/101.74 % --aig_mode false
% 101.50/101.74
% 101.50/101.74 % ------ Instantiation Options
% 101.50/101.74
% 101.50/101.74 % --instantiation_flag true
% 101.50/101.74 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 101.50/101.74 % --inst_solver_per_active 750
% 101.50/101.74 % --inst_solver_calls_frac 0.5
% 101.50/101.74 % --inst_passive_queue_type priority_queues
% 101.50/101.74 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 101.50/101.74 % --inst_passive_queues_freq [25;2]
% 101.50/101.74 % --inst_dismatching true
% 101.50/101.74 % --inst_eager_unprocessed_to_passive true
% 101.50/101.74 % --inst_prop_sim_given true
% 101.50/101.74 % --inst_prop_sim_new false
% 101.50/101.74 % --inst_orphan_elimination true
% 101.50/101.74 % --inst_learning_loop_flag true
% 101.50/101.74 % --inst_learning_start 3000
% 101.50/101.74 % --inst_learning_factor 2
% 101.50/101.74 % --inst_start_prop_sim_after_learn 3
% 101.50/101.74 % --inst_sel_renew solver
% 101.50/101.74 % --inst_lit_activity_flag true
% 101.50/101.74 % --inst_out_proof true
% 101.50/101.74
% 101.50/101.74 % ------ Resolution Options
% 101.50/101.74
% 101.50/101.74 % --resolution_flag true
% 101.50/101.74 % --res_lit_sel kbo_max
% 101.50/101.74 % --res_to_prop_solver none
% 101.50/101.74 % --res_prop_simpl_new false
% 101.50/101.74 % --res_prop_simpl_given false
% 101.50/101.74 % --res_passive_queue_type priority_queues
% 101.50/101.74 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 101.50/101.74 % --res_passive_queues_freq [15;5]
% 101.50/101.74 % --res_forward_subs full
% 101.50/101.74 % --res_backward_subs full
% 101.50/101.74 % --res_forward_subs_resolution true
% 101.50/101.74 % --res_backward_subs_resolution true
% 101.50/101.74 % --res_orphan_elimination false
% 101.50/101.74 % --res_time_limit 1000.
% 101.50/101.74 % --res_out_proof true
% 101.50/101.74 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a69a25.s
% 101.50/101.74 % --modulo true
% 101.50/101.74
% 101.50/101.74 % ------ Combination Options
% 101.50/101.74
% 101.50/101.74 % --comb_res_mult 1000
% 101.50/101.74 % --comb_inst_mult 300
% 101.50/101.74 % ------
% 101.50/101.74
% 101.50/101.74 % ------ Parsing...% successful
% 101.50/101.74
% 101.50/101.74 % ------ 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 %
% 101.50/101.74
% 101.50/101.74 % ------ Proving...
% 101.50/101.74 % ------ Problem Properties
% 101.50/101.74
% 101.50/101.74 %
% 101.50/101.74 % EPR false
% 101.50/101.74 % Horn false
% 101.50/101.74 % Has equality false
% 101.50/101.74
% 101.50/101.74 % % ------ Input Options Time Limit: Unbounded
% 101.50/101.74
% 101.50/101.74
% 101.50/101.74 % % ------ Current options:
% 101.50/101.74
% 101.50/101.74 % ------ Input Options
% 101.50/101.74
% 101.50/101.74 % --out_options all
% 101.50/101.74 % --tptp_safe_out true
% 101.50/101.74 % --problem_path ""
% 101.50/101.74 % --include_path ""
% 101.50/101.74 % --clausifier .//eprover
% 101.50/101.74 % --clausifier_options --tstp-format
% 101.50/101.74 % --stdin false
% 101.50/101.74 % --dbg_backtrace false
% 101.50/101.74 % --dbg_dump_prop_clauses false
% 101.50/101.74 % --dbg_dump_prop_clauses_file -
% 101.50/101.74 % --dbg_out_stat false
% 101.50/101.74
% 101.50/101.74 % ------ General Options
% 101.50/101.74
% 101.50/101.74 % --fof false
% 101.50/101.74 % --time_out_real 150.
% 101.50/101.74 % --time_out_prep_mult 0.2
% 101.50/101.74 % --time_out_virtual -1.
% 101.50/101.74 % --schedule none
% 101.50/101.74 % --ground_splitting input
% 101.50/101.74 % --splitting_nvd 16
% 101.50/101.74 % --non_eq_to_eq false
% 101.50/101.74 % --prep_gs_sim true
% 101.50/101.74 % --prep_unflatten false
% 101.50/101.74 % --prep_res_sim true
% 101.50/101.74 % --prep_upred true
% 101.50/101.74 % --res_sim_input true
% 101.50/101.74 % --clause_weak_htbl true
% 101.50/101.74 % --gc_record_bc_elim false
% 101.50/101.74 % --symbol_type_check false
% 101.50/101.74 % --clausify_out false
% 101.50/101.74 % --large_theory_mode false
% 101.50/101.74 % --prep_sem_filter none
% 101.50/101.74 % --prep_sem_filter_out false
% 101.50/101.74 % --preprocessed_out false
% 101.50/101.74 % --sub_typing false
% 101.50/101.74 % --brand_transform false
% 101.50/101.74 % --pure_diseq_elim true
% 101.50/101.74 % --min_unsat_core false
% 101.50/101.74 % --pred_elim true
% 101.50/101.74 % --add_important_lit false
% 101.50/101.74 % --soft_assumptions false
% 101.50/101.74 % --reset_solvers false
% 101.50/101.74 % --bc_imp_inh []
% 101.50/101.74 % --conj_cone_tolerance 1.5
% 101.50/101.74 % --prolific_symb_bound 500
% 101.50/101.74 % --lt_threshold 2000
% 101.50/101.74
% 101.50/101.74 % ------ SAT Options
% 101.50/101.74
% 101.50/101.74 % --sat_mode false
% 101.50/101.74 % --sat_fm_restart_options ""
% 101.50/101.74 % --sat_gr_def false
% 101.50/101.74 % --sat_epr_types true
% 101.50/101.74 % --sat_non_cyclic_types false
% 101.50/101.74 % --sat_finite_models false
% 101.50/101.74 % --sat_fm_lemmas false
% 101.50/101.74 % --sat_fm_prep false
% 101.50/101.74 % --sat_fm_uc_incr true
% 101.50/101.74 % --sat_out_model small
% 101.50/101.74 % --sat_out_clauses false
% 101.50/101.74
% 101.50/101.74 % ------ QBF Options
% 101.50/101.74
% 101.50/101.74 % --qbf_mode false
% 101.50/101.74 % --qbf_elim_univ true
% 101.50/101.74 % --qbf_sk_in true
% 101.50/101.74 % --qbf_pred_elim true
% 101.50/101.74 % --qbf_split 32
% 101.50/101.74
% 101.50/101.74 % ------ BMC1 Options
% 101.50/101.74
% 101.50/101.74 % --bmc1_incremental false
% 101.50/101.74 % --bmc1_axioms reachable_all
% 101.50/101.74 % --bmc1_min_bound 0
% 101.50/101.74 % --bmc1_max_bound -1
% 101.50/101.74 % --bmc1_max_bound_default -1
% 101.50/101.74 % --bmc1_symbol_reachability true
% 101.50/101.74 % --bmc1_property_lemmas false
% 101.50/101.74 % --bmc1_k_induction false
% 101.50/101.74 % --bmc1_non_equiv_states false
% 101.50/101.74 % --bmc1_deadlock false
% 101.50/101.74 % --bmc1_ucm false
% 101.50/101.74 % --bmc1_add_unsat_core none
% 101.50/101.74 % --bmc1_unsat_core_children false
% 101.50/101.74 % --bmc1_unsat_core_extrapolate_axioms false
% 101.50/101.74 % --bmc1_out_stat full
% 101.50/101.74 % --bmc1_ground_init false
% 101.50/101.74 % --bmc1_pre_inst_next_state false
% 101.50/101.74 % --bmc1_pre_inst_state false
% 101.50/101.74 % --bmc1_pre_inst_reach_state false
% 101.50/101.74 % --bmc1_out_unsat_core false
% 101.50/101.74 % --bmc1_aig_witness_out false
% 101.50/101.74 % --bmc1_verbose false
% 101.50/101.74 % --bmc1_dump_clauses_tptp false
% 101.50/101.74 % --bmc1_dump_unsat_core_tptp false
% 101.50/101.74 % --bmc1_dump_file -
% 101.50/101.74 % --bmc1_ucm_expand_uc_limit 128
% 101.50/101.74 % --bmc1_ucm_n_expand_iterations 6
% 101.50/101.74 % --bmc1_ucm_extend_mode 1
% 101.50/101.74 % --bmc1_ucm_init_mode 2
% 101.50/101.74 % --bmc1_ucm_cone_mode none
% 101.50/101.74 % --bmc1_ucm_reduced_relation_type 0
% 101.50/101.74 % --bmc1_ucm_relax_model 4
% 101.50/101.74 % --bmc1_ucm_full_tr_after_sat true
% 101.50/101.74 % --bmc1_ucm_expand_neg_assumptions false
% 101.50/101.74 % --bmc1_ucm_layered_model none
% 101.50/101.74 % --bmc1_ucm_max_lemma_size 10
% 101.50/101.74
% 101.50/101.74 % ------ AIG Options
% 101.50/101.74
% 101.50/101.74 % --aig_mode false
% 101.50/101.74
% 101.50/101.74 % ------ Instantiation Options
% 101.50/101.74
% 101.50/101.74 % --instantiation_flag true
% 101.50/101.74 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 101.50/101.74 % --inst_solver_per_active 750
% 101.50/101.74 % --inst_solver_calls_frac 0.5
% 101.50/101.74 % --inst_passive_queue_type priority_queues
% 101.50/101.74 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 101.50/101.74 % --inst_passive_queues_freq [25;2]
% 101.50/101.74 % --inst_dismatching true
% 101.50/101.74 % --inst_eager_unprocessed_to_passive true
% 202.30/202.53 % --inst_prop_sim_given true
% 202.30/202.53 % --inst_prop_sim_new false
% 202.30/202.53 % --inst_orphan_elimination true
% 202.30/202.53 % --inst_learning_loop_flag true
% 202.30/202.53 % --inst_learning_start 3000
% 202.30/202.53 % --inst_learning_factor 2
% 202.30/202.53 % --inst_start_prop_sim_after_learn 3
% 202.30/202.53 % --inst_sel_renew solver
% 202.30/202.53 % --inst_lit_activity_flag true
% 202.30/202.53 % --inst_out_proof true
% 202.30/202.53
% 202.30/202.53 % ------ Resolution Options
% 202.30/202.53
% 202.30/202.53 % --resolution_flag true
% 202.30/202.53 % --res_lit_sel kbo_max
% 202.30/202.53 % --res_to_prop_solver none
% 202.30/202.53 % --res_prop_simpl_new false
% 202.30/202.53 % --res_prop_simpl_given false
% 202.30/202.53 % --res_passive_queue_type priority_queues
% 202.30/202.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 202.30/202.53 % --res_passive_queues_freq [15;5]
% 202.30/202.53 % --res_forward_subs full
% 202.30/202.53 % --res_backward_subs full
% 202.30/202.53 % --res_forward_subs_resolution true
% 202.30/202.53 % --res_backward_subs_resolution true
% 202.30/202.53 % --res_orphan_elimination false
% 202.30/202.53 % --res_time_limit 1000.
% 202.30/202.53 % --res_out_proof true
% 202.30/202.53 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a69a25.s
% 202.30/202.53 % --modulo true
% 202.30/202.53
% 202.30/202.53 % ------ Combination Options
% 202.30/202.53
% 202.30/202.53 % --comb_res_mult 1000
% 202.30/202.53 % --comb_inst_mult 300
% 202.30/202.53 % ------
% 202.30/202.53
% 202.30/202.53
% 202.30/202.53
% 202.30/202.53 % ------ Proving...
% 202.30/202.53 % warning: shown sat in sat incomplete mode
% 202.30/202.53 %
% 202.30/202.53
% 202.30/202.53
% 202.30/202.53 ------ Building Model...Done
% 202.30/202.53
% 202.30/202.53 %------ The model is defined over ground terms (initial term algebra).
% 202.30/202.53 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 202.30/202.53 %------ where \phi is a formula over the term algebra.
% 202.30/202.53 %------ If we have equality in the problem then it is also defined as a predicate above,
% 202.30/202.53 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 202.30/202.53 %------ See help for --sat_out_model for different model outputs.
% 202.30/202.53 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 202.30/202.53 %------ where the first argument stands for the sort ($i in the unsorted case)
% 202.30/202.53
% 202.30/202.53
% 202.30/202.53
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of ssSkC0
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 ( ssSkC0 <=>
% 202.30/202.53 $true
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of actual_world
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0] :
% 202.30/202.53 ( ~(actual_world(X0)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of state
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( state(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc27 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of of
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( ~(of(X0,X1,X2)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of man
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( man(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc29 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of be
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2,X3] :
% 202.30/202.53 ( ~(be(X0,X1,X2,X3)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of forename
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( forename(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc28 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of jules_forename
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( ~(jules_forename(X0,X1)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of wheel
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( wheel(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc30 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of behind
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( behind(X0,X1,X2) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc26 & X2=skc30 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of frontseat
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( ~(frontseat(X0,X1)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of ssSkP1
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( ssSkP1(X0,X1,X2) <=>
% 202.30/202.53 $true
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of ssSkP2
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( ssSkP2(X0,X1,X2) <=>
% 202.30/202.53 $true
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of ssSkP0
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( ssSkP0(X0,X1) <=>
% 202.30/202.53 $true
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of group
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( group(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc31 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 |
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc32 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of two
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( two(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc32 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of coat
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( coat(X0,X1) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of hollywood_placename
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( hollywood_placename(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc36 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of placename
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( ~(placename(X0,X1)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of in
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( in(X0,X1,X2) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc34 & X2=skc35 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of down
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( ~(down(X0,X1,X2)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of lonely
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( lonely(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc35 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of street
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( ~(street(X0,X1)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of city
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( ~(city(X0,X1)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of agent
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( ~(agent(X0,X1,X2)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of old
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( old(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc37 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of dirty
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( ~(dirty(X0,X1)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of white
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( ~(white(X0,X1)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of chevy
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( chevy(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc37 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of event
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( event(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc34 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Negative definition of present
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( ~(present(X0,X1)) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of barrel
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1] :
% 202.30/202.53 ( barrel(X0,X1) <=>
% 202.30/202.53 (
% 202.30/202.53 (
% 202.30/202.53 ( X0=skc25 & X1=skc34 )
% 202.30/202.53 )
% 202.30/202.53
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of member
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( member(X0,X1,X2) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP2_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( sP2_iProver_split(X0,X1,X2) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP5_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( sP5_iProver_split(X0,X1,X2) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP7_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2,X3,X4,X5] :
% 202.30/202.53 ( sP7_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP8_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( sP8_iProver_split(X0,X1,X2) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP10_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2,X3,X4,X5] :
% 202.30/202.53 ( sP10_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP11_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( sP11_iProver_split(X0,X1,X2) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP14_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( sP14_iProver_split(X0,X1,X2) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP17_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( sP17_iProver_split(X0,X1,X2) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP19_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2,X3,X4,X5] :
% 202.30/202.53 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP20_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( sP20_iProver_split(X0,X1,X2) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP22_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2,X3,X4,X5] :
% 202.30/202.53 ( sP22_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53 %------ Positive definition of sP23_iProver_split
% 202.30/202.53 fof(lit_def,axiom,
% 202.30/202.53 (! [X0,X1,X2] :
% 202.30/202.53 ( sP23_iProver_split(X0,X1,X2) <=>
% 202.30/202.53 $false
% 202.30/202.53 )
% 202.30/202.53 )
% 202.30/202.53 ).
% 202.30/202.53
% 202.30/202.53
% 202.30/202.53
% 202.30/202.53 % ------ Statistics
% 202.30/202.53
% 202.30/202.53 % ------ General
% 202.30/202.53
% 202.30/202.53 % num_of_input_clauses: 92
% 202.30/202.53 % num_of_input_neg_conjectures: 92
% 202.30/202.53 % num_of_splits: 24
% 202.30/202.53 % num_of_split_atoms: 24
% 202.30/202.53 % num_of_sem_filtered_clauses: 0
% 202.30/202.53 % num_of_subtypes: 0
% 202.30/202.53 % monotx_restored_types: 0
% 202.30/202.53 % sat_num_of_epr_types: 0
% 202.30/202.53 % sat_num_of_non_cyclic_types: 0
% 202.30/202.53 % sat_guarded_non_collapsed_types: 0
% 202.30/202.53 % is_epr: 0
% 202.30/202.53 % is_horn: 0
% 202.30/202.53 % has_eq: 0
% 202.30/202.53 % num_pure_diseq_elim: 0
% 202.30/202.53 % simp_replaced_by: 0
% 202.30/202.53 % res_preprocessed: 208
% 202.30/202.53 % prep_upred: 0
% 202.30/202.53 % prep_unflattend: 0
% 202.30/202.53 % pred_elim_cands: 24
% 202.30/202.53 % pred_elim: 8
% 202.30/202.53 % pred_elim_cl: 8
% 202.30/202.53 % pred_elim_cycles: 40
% 202.30/202.53 % forced_gc_time: 0
% 202.30/202.53 % gc_basic_clause_elim: 0
% 202.30/202.53 % parsing_time: 0.002
% 202.30/202.53 % sem_filter_time: 0.
% 202.30/202.53 % pred_elim_time: 0.045
% 202.30/202.53 % out_proof_time: 0.
% 202.30/202.53 % monotx_time: 0.
% 202.30/202.53 % subtype_inf_time: 0.
% 202.30/202.53 % unif_index_cands_time: 0.049
% 202.30/202.53 % unif_index_add_time: 0.032
% 202.30/202.53 % total_time: 100.857
% 202.30/202.53 % num_of_symbols: 123
% 202.30/202.53 % num_of_terms: 31730
% 202.30/202.53
% 202.30/202.53 % ------ Propositional Solver
% 202.30/202.53
% 202.30/202.53 % prop_solver_calls: 26
% 202.30/202.53 % prop_fast_solver_calls: 2023
% 202.30/202.53 % prop_num_of_clauses: 4616
% 202.30/202.53 % prop_preprocess_simplified: 6336
% 202.30/202.53 % prop_fo_subsumed: 0
% 202.30/202.53 % prop_solver_time: 0.002
% 202.30/202.53 % prop_fast_solver_time: 0.001
% 202.30/202.53 % prop_unsat_core_time: 0.
% 202.30/202.53
% 202.30/202.53 % ------ QBF
% 202.30/202.53
% 202.30/202.53 % qbf_q_res: 0
% 202.30/202.54 % qbf_num_tautologies: 0
% 202.30/202.54 % qbf_prep_cycles: 0
% 202.30/202.54
% 202.30/202.54 % ------ BMC1
% 202.30/202.54
% 202.30/202.54 % bmc1_current_bound: -1
% 202.30/202.54 % bmc1_last_solved_bound: -1
% 202.30/202.54 % bmc1_unsat_core_size: -1
% 202.30/202.54 % bmc1_unsat_core_parents_size: -1
% 202.30/202.54 % bmc1_merge_next_fun: 0
% 202.30/202.54 % bmc1_unsat_core_clauses_time: 0.
% 202.30/202.54
% 202.30/202.54 % ------ Instantiation
% 202.30/202.54
% 202.30/202.54 % inst_num_of_clauses: 188
% 202.30/202.54 % inst_num_in_passive: 0
% 202.30/202.54 % inst_num_in_active: 188
% 202.30/202.54 % inst_num_in_unprocessed: 0
% 202.30/202.54 % inst_num_of_loops: 195
% 202.30/202.54 % inst_num_of_learning_restarts: 1
% 202.30/202.54 % inst_num_moves_active_passive: 0
% 202.30/202.54 % inst_lit_activity: 38
% 202.30/202.54 % inst_lit_activity_moves: 0
% 202.30/202.54 % inst_num_tautologies: 0
% 202.30/202.54 % inst_num_prop_implied: 0
% 202.30/202.54 % inst_num_existing_simplified: 0
% 202.30/202.54 % inst_num_eq_res_simplified: 0
% 202.30/202.54 % inst_num_child_elim: 0
% 202.30/202.54 % inst_num_of_dismatching_blockings: 0
% 202.30/202.54 % inst_num_of_non_proper_insts: 76
% 202.30/202.54 % inst_num_of_duplicates: 0
% 202.30/202.54 % inst_inst_num_from_inst_to_res: 0
% 202.30/202.54 % inst_dismatching_checking_time: 0.003
% 202.30/202.54
% 202.30/202.54 % ------ Resolution
% 202.30/202.54
% 202.30/202.54 % res_num_of_clauses: 984929
% 202.30/202.54 % res_num_in_passive: 993247
% 202.30/202.54 % res_num_in_active: 7646
% 202.30/202.54 % res_num_of_loops: 11000
% 202.30/202.54 % res_forward_subset_subsumed: 431992
% 202.30/202.54 % res_backward_subset_subsumed: 16181
% 202.30/202.54 % res_forward_subsumed: 2847
% 202.30/202.54 % res_backward_subsumed: 176
% 202.30/202.54 % res_forward_subsumption_resolution: 3792
% 202.30/202.54 % res_backward_subsumption_resolution: 6
% 202.30/202.54 % res_clause_to_clause_subsumption: 281663
% 202.30/202.54 % res_orphan_elimination: 0
% 202.30/202.54 % res_tautology_del: 4266
% 202.30/202.54 % res_num_eq_res_simplified: 0
% 202.30/202.54 % res_num_sel_changes: 0
% 202.30/202.54 % res_moves_from_active_to_pass: 0
% 202.30/202.54
% 202.30/202.54 % Status Unknown
% 202.30/202.54 % Last status :
% 202.30/202.54 % SZS status Unknown
%------------------------------------------------------------------------------