TSTP Solution File: NLP192+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP192+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n015.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:09 EDT 2022
% Result : Unknown 5.61s 5.83s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP192+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 08:06:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.44 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.44 % FOF problem with conjecture
% 0.20/0.44 % 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_680576.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e1a563.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_01c085 | grep -v "SZS"
% 0.20/0.46
% 0.20/0.46 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.46
% 0.20/0.46 %
% 0.20/0.46 % ------ iProver source info
% 0.20/0.46
% 0.20/0.46 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.46 % git: non_committed_changes: true
% 0.20/0.46 % git: last_make_outside_of_git: true
% 0.20/0.46
% 0.20/0.46 %
% 0.20/0.46 % ------ Input Options
% 0.20/0.46
% 0.20/0.46 % --out_options all
% 0.20/0.46 % --tptp_safe_out true
% 0.20/0.46 % --problem_path ""
% 0.20/0.46 % --include_path ""
% 0.20/0.46 % --clausifier .//eprover
% 0.20/0.46 % --clausifier_options --tstp-format
% 0.20/0.46 % --stdin false
% 0.20/0.46 % --dbg_backtrace false
% 0.20/0.46 % --dbg_dump_prop_clauses false
% 0.20/0.46 % --dbg_dump_prop_clauses_file -
% 0.20/0.46 % --dbg_out_stat false
% 0.20/0.46
% 0.20/0.46 % ------ General Options
% 0.20/0.46
% 0.20/0.46 % --fof false
% 0.20/0.46 % --time_out_real 150.
% 0.20/0.46 % --time_out_prep_mult 0.2
% 0.20/0.46 % --time_out_virtual -1.
% 0.20/0.46 % --schedule none
% 0.20/0.46 % --ground_splitting input
% 0.20/0.46 % --splitting_nvd 16
% 0.20/0.46 % --non_eq_to_eq false
% 0.20/0.46 % --prep_gs_sim true
% 0.20/0.46 % --prep_unflatten false
% 0.20/0.46 % --prep_res_sim true
% 0.20/0.46 % --prep_upred true
% 0.20/0.46 % --res_sim_input true
% 0.20/0.46 % --clause_weak_htbl true
% 0.20/0.46 % --gc_record_bc_elim false
% 0.20/0.46 % --symbol_type_check false
% 0.20/0.46 % --clausify_out false
% 0.20/0.46 % --large_theory_mode false
% 0.20/0.46 % --prep_sem_filter none
% 0.20/0.46 % --prep_sem_filter_out false
% 0.20/0.46 % --preprocessed_out false
% 0.20/0.46 % --sub_typing false
% 0.20/0.46 % --brand_transform false
% 0.20/0.46 % --pure_diseq_elim true
% 0.20/0.46 % --min_unsat_core false
% 0.20/0.46 % --pred_elim true
% 0.20/0.46 % --add_important_lit false
% 0.20/0.46 % --soft_assumptions false
% 0.20/0.46 % --reset_solvers false
% 0.20/0.46 % --bc_imp_inh []
% 0.20/0.46 % --conj_cone_tolerance 1.5
% 0.20/0.46 % --prolific_symb_bound 500
% 0.20/0.46 % --lt_threshold 2000
% 0.20/0.46
% 0.20/0.46 % ------ SAT Options
% 0.20/0.46
% 0.20/0.46 % --sat_mode false
% 0.20/0.46 % --sat_fm_restart_options ""
% 0.20/0.46 % --sat_gr_def false
% 0.20/0.46 % --sat_epr_types true
% 0.20/0.46 % --sat_non_cyclic_types false
% 0.20/0.46 % --sat_finite_models false
% 0.20/0.46 % --sat_fm_lemmas false
% 0.20/0.46 % --sat_fm_prep false
% 0.20/0.46 % --sat_fm_uc_incr true
% 0.20/0.46 % --sat_out_model small
% 0.20/0.46 % --sat_out_clauses false
% 0.20/0.46
% 0.20/0.46 % ------ QBF Options
% 0.20/0.46
% 0.20/0.46 % --qbf_mode false
% 0.20/0.46 % --qbf_elim_univ true
% 0.20/0.46 % --qbf_sk_in true
% 0.20/0.46 % --qbf_pred_elim true
% 0.20/0.46 % --qbf_split 32
% 0.20/0.46
% 0.20/0.46 % ------ BMC1 Options
% 0.20/0.46
% 0.20/0.46 % --bmc1_incremental false
% 0.20/0.46 % --bmc1_axioms reachable_all
% 0.20/0.46 % --bmc1_min_bound 0
% 0.20/0.46 % --bmc1_max_bound -1
% 0.20/0.46 % --bmc1_max_bound_default -1
% 0.20/0.46 % --bmc1_symbol_reachability true
% 0.20/0.46 % --bmc1_property_lemmas false
% 0.20/0.46 % --bmc1_k_induction false
% 0.20/0.46 % --bmc1_non_equiv_states false
% 0.20/0.46 % --bmc1_deadlock false
% 0.20/0.46 % --bmc1_ucm false
% 0.20/0.46 % --bmc1_add_unsat_core none
% 0.20/0.46 % --bmc1_unsat_core_children false
% 0.20/0.46 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.46 % --bmc1_out_stat full
% 0.20/0.46 % --bmc1_ground_init false
% 0.20/0.46 % --bmc1_pre_inst_next_state false
% 0.20/0.46 % --bmc1_pre_inst_state false
% 0.20/0.46 % --bmc1_pre_inst_reach_state false
% 0.20/0.46 % --bmc1_out_unsat_core false
% 0.20/0.46 % --bmc1_aig_witness_out false
% 0.20/0.46 % --bmc1_verbose false
% 0.20/0.46 % --bmc1_dump_clauses_tptp false
% 1.36/1.53 % --bmc1_dump_unsat_core_tptp false
% 1.36/1.53 % --bmc1_dump_file -
% 1.36/1.53 % --bmc1_ucm_expand_uc_limit 128
% 1.36/1.53 % --bmc1_ucm_n_expand_iterations 6
% 1.36/1.53 % --bmc1_ucm_extend_mode 1
% 1.36/1.53 % --bmc1_ucm_init_mode 2
% 1.36/1.53 % --bmc1_ucm_cone_mode none
% 1.36/1.53 % --bmc1_ucm_reduced_relation_type 0
% 1.36/1.53 % --bmc1_ucm_relax_model 4
% 1.36/1.53 % --bmc1_ucm_full_tr_after_sat true
% 1.36/1.53 % --bmc1_ucm_expand_neg_assumptions false
% 1.36/1.53 % --bmc1_ucm_layered_model none
% 1.36/1.53 % --bmc1_ucm_max_lemma_size 10
% 1.36/1.53
% 1.36/1.53 % ------ AIG Options
% 1.36/1.53
% 1.36/1.53 % --aig_mode false
% 1.36/1.53
% 1.36/1.53 % ------ Instantiation Options
% 1.36/1.53
% 1.36/1.53 % --instantiation_flag true
% 1.36/1.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.36/1.53 % --inst_solver_per_active 750
% 1.36/1.53 % --inst_solver_calls_frac 0.5
% 1.36/1.53 % --inst_passive_queue_type priority_queues
% 1.36/1.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.36/1.53 % --inst_passive_queues_freq [25;2]
% 1.36/1.53 % --inst_dismatching true
% 1.36/1.53 % --inst_eager_unprocessed_to_passive true
% 1.36/1.53 % --inst_prop_sim_given true
% 1.36/1.53 % --inst_prop_sim_new false
% 1.36/1.53 % --inst_orphan_elimination true
% 1.36/1.53 % --inst_learning_loop_flag true
% 1.36/1.53 % --inst_learning_start 3000
% 1.36/1.53 % --inst_learning_factor 2
% 1.36/1.53 % --inst_start_prop_sim_after_learn 3
% 1.36/1.53 % --inst_sel_renew solver
% 1.36/1.53 % --inst_lit_activity_flag true
% 1.36/1.53 % --inst_out_proof true
% 1.36/1.53
% 1.36/1.53 % ------ Resolution Options
% 1.36/1.53
% 1.36/1.53 % --resolution_flag true
% 1.36/1.53 % --res_lit_sel kbo_max
% 1.36/1.53 % --res_to_prop_solver none
% 1.36/1.53 % --res_prop_simpl_new false
% 1.36/1.53 % --res_prop_simpl_given false
% 1.36/1.53 % --res_passive_queue_type priority_queues
% 1.36/1.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.36/1.53 % --res_passive_queues_freq [15;5]
% 1.36/1.53 % --res_forward_subs full
% 1.36/1.53 % --res_backward_subs full
% 1.36/1.53 % --res_forward_subs_resolution true
% 1.36/1.53 % --res_backward_subs_resolution true
% 1.36/1.53 % --res_orphan_elimination false
% 1.36/1.53 % --res_time_limit 1000.
% 1.36/1.53 % --res_out_proof true
% 1.36/1.53 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_680576.s
% 1.36/1.53 % --modulo true
% 1.36/1.53
% 1.36/1.53 % ------ Combination Options
% 1.36/1.53
% 1.36/1.53 % --comb_res_mult 1000
% 1.36/1.53 % --comb_inst_mult 300
% 1.36/1.53 % ------
% 1.36/1.53
% 1.36/1.53 % ------ Parsing...% successful
% 1.36/1.53
% 1.36/1.53 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 144 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe_e snvd_s sp: 0 0s snvd_e %
% 1.36/1.53
% 1.36/1.53 % ------ Proving...
% 1.36/1.53 % ------ Problem Properties
% 1.36/1.53
% 1.36/1.53 %
% 1.36/1.53 % EPR false
% 1.36/1.53 % Horn false
% 1.36/1.53 % Has equality false
% 1.36/1.53
% 1.36/1.53 % % ------ Input Options Time Limit: Unbounded
% 1.36/1.53
% 1.36/1.53
% 1.36/1.53 % % ------ Current options:
% 1.36/1.53
% 1.36/1.53 % ------ Input Options
% 1.36/1.53
% 1.36/1.53 % --out_options all
% 1.36/1.53 % --tptp_safe_out true
% 1.36/1.53 % --problem_path ""
% 1.36/1.53 % --include_path ""
% 1.36/1.53 % --clausifier .//eprover
% 1.36/1.53 % --clausifier_options --tstp-format
% 1.36/1.53 % --stdin false
% 1.36/1.53 % --dbg_backtrace false
% 1.36/1.53 % --dbg_dump_prop_clauses false
% 1.36/1.53 % --dbg_dump_prop_clauses_file -
% 1.36/1.53 % --dbg_out_stat false
% 1.36/1.53
% 1.36/1.53 % ------ General Options
% 1.36/1.53
% 1.36/1.53 % --fof false
% 1.36/1.53 % --time_out_real 150.
% 1.36/1.53 % --time_out_prep_mult 0.2
% 1.36/1.53 % --time_out_virtual -1.
% 1.36/1.53 % --schedule none
% 1.36/1.53 % --ground_splitting input
% 1.36/1.53 % --splitting_nvd 16
% 1.36/1.53 % --non_eq_to_eq false
% 1.36/1.53 % --prep_gs_sim true
% 1.36/1.53 % --prep_unflatten false
% 1.36/1.53 % --prep_res_sim true
% 1.36/1.53 % --prep_upred true
% 1.36/1.53 % --res_sim_input true
% 1.36/1.53 % --clause_weak_htbl true
% 1.36/1.53 % --gc_record_bc_elim false
% 1.36/1.53 % --symbol_type_check false
% 1.36/1.53 % --clausify_out false
% 1.36/1.53 % --large_theory_mode false
% 1.36/1.53 % --prep_sem_filter none
% 1.36/1.53 % --prep_sem_filter_out false
% 1.36/1.53 % --preprocessed_out false
% 1.36/1.53 % --sub_typing false
% 1.36/1.53 % --brand_transform false
% 1.36/1.53 % --pure_diseq_elim true
% 1.36/1.53 % --min_unsat_core false
% 1.36/1.53 % --pred_elim true
% 1.36/1.53 % --add_important_lit false
% 1.36/1.53 % --soft_assumptions false
% 1.36/1.53 % --reset_solvers false
% 1.36/1.53 % --bc_imp_inh []
% 1.36/1.53 % --conj_cone_tolerance 1.5
% 1.36/1.53 % --prolific_symb_bound 500
% 1.36/1.53 % --lt_threshold 2000
% 1.36/1.53
% 1.36/1.53 % ------ SAT Options
% 1.36/1.53
% 1.36/1.53 % --sat_mode false
% 1.36/1.53 % --sat_fm_restart_options ""
% 1.36/1.53 % --sat_gr_def false
% 1.36/1.53 % --sat_epr_types true
% 1.36/1.53 % --sat_non_cyclic_types false
% 1.36/1.53 % --sat_finite_models false
% 1.36/1.53 % --sat_fm_lemmas false
% 1.36/1.53 % --sat_fm_prep false
% 1.36/1.53 % --sat_fm_uc_incr true
% 1.36/1.53 % --sat_out_model small
% 1.36/1.53 % --sat_out_clauses false
% 1.36/1.53
% 1.36/1.53 % ------ QBF Options
% 1.36/1.53
% 1.36/1.53 % --qbf_mode false
% 1.36/1.53 % --qbf_elim_univ true
% 1.36/1.53 % --qbf_sk_in true
% 1.36/1.53 % --qbf_pred_elim true
% 1.36/1.53 % --qbf_split 32
% 1.36/1.53
% 1.36/1.53 % ------ BMC1 Options
% 1.36/1.53
% 1.36/1.53 % --bmc1_incremental false
% 1.36/1.53 % --bmc1_axioms reachable_all
% 1.36/1.53 % --bmc1_min_bound 0
% 1.36/1.53 % --bmc1_max_bound -1
% 1.36/1.53 % --bmc1_max_bound_default -1
% 1.36/1.53 % --bmc1_symbol_reachability true
% 1.36/1.53 % --bmc1_property_lemmas false
% 1.36/1.53 % --bmc1_k_induction false
% 1.36/1.53 % --bmc1_non_equiv_states false
% 1.36/1.53 % --bmc1_deadlock false
% 1.36/1.53 % --bmc1_ucm false
% 1.36/1.53 % --bmc1_add_unsat_core none
% 1.36/1.53 % --bmc1_unsat_core_children false
% 1.36/1.53 % --bmc1_unsat_core_extrapolate_axioms false
% 1.36/1.53 % --bmc1_out_stat full
% 1.36/1.53 % --bmc1_ground_init false
% 1.36/1.53 % --bmc1_pre_inst_next_state false
% 1.36/1.53 % --bmc1_pre_inst_state false
% 1.36/1.53 % --bmc1_pre_inst_reach_state false
% 1.36/1.53 % --bmc1_out_unsat_core false
% 1.36/1.53 % --bmc1_aig_witness_out false
% 1.36/1.53 % --bmc1_verbose false
% 1.36/1.53 % --bmc1_dump_clauses_tptp false
% 1.36/1.53 % --bmc1_dump_unsat_core_tptp false
% 1.36/1.53 % --bmc1_dump_file -
% 1.36/1.53 % --bmc1_ucm_expand_uc_limit 128
% 1.36/1.53 % --bmc1_ucm_n_expand_iterations 6
% 1.36/1.53 % --bmc1_ucm_extend_mode 1
% 1.36/1.53 % --bmc1_ucm_init_mode 2
% 1.36/1.53 % --bmc1_ucm_cone_mode none
% 1.36/1.53 % --bmc1_ucm_reduced_relation_type 0
% 1.36/1.53 % --bmc1_ucm_relax_model 4
% 1.36/1.53 % --bmc1_ucm_full_tr_after_sat true
% 1.36/1.53 % --bmc1_ucm_expand_neg_assumptions false
% 1.36/1.53 % --bmc1_ucm_layered_model none
% 1.36/1.53 % --bmc1_ucm_max_lemma_size 10
% 1.36/1.53
% 1.36/1.53 % ------ AIG Options
% 1.36/1.53
% 1.36/1.53 % --aig_mode false
% 1.36/1.53
% 1.36/1.53 % ------ Instantiation Options
% 1.36/1.53
% 1.36/1.53 % --instantiation_flag true
% 1.36/1.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.36/1.53 % --inst_solver_per_active 750
% 1.36/1.53 % --inst_solver_calls_frac 0.5
% 1.36/1.53 % --inst_passive_queue_type priority_queues
% 1.36/1.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.36/1.53 % --inst_passive_queues_freq [25;2]
% 1.36/1.53 % --inst_dismatching true
% 1.36/1.53 % --inst_eager_unprocessed_to_passive true
% 2.98/3.16 % --inst_prop_sim_given true
% 2.98/3.16 % --inst_prop_sim_new false
% 2.98/3.16 % --inst_orphan_elimination true
% 2.98/3.16 % --inst_learning_loop_flag true
% 2.98/3.16 % --inst_learning_start 3000
% 2.98/3.16 % --inst_learning_factor 2
% 2.98/3.16 % --inst_start_prop_sim_after_learn 3
% 2.98/3.16 % --inst_sel_renew solver
% 2.98/3.16 % --inst_lit_activity_flag true
% 2.98/3.16 % --inst_out_proof true
% 2.98/3.16
% 2.98/3.16 % ------ Resolution Options
% 2.98/3.16
% 2.98/3.16 % --resolution_flag true
% 2.98/3.16 % --res_lit_sel kbo_max
% 2.98/3.16 % --res_to_prop_solver none
% 2.98/3.16 % --res_prop_simpl_new false
% 2.98/3.16 % --res_prop_simpl_given false
% 2.98/3.16 % --res_passive_queue_type priority_queues
% 2.98/3.16 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.98/3.16 % --res_passive_queues_freq [15;5]
% 2.98/3.16 % --res_forward_subs full
% 2.98/3.16 % --res_backward_subs full
% 2.98/3.16 % --res_forward_subs_resolution true
% 2.98/3.16 % --res_backward_subs_resolution true
% 2.98/3.16 % --res_orphan_elimination false
% 2.98/3.16 % --res_time_limit 1000.
% 2.98/3.16 % --res_out_proof true
% 2.98/3.16 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_680576.s
% 2.98/3.16 % --modulo true
% 2.98/3.16
% 2.98/3.16 % ------ Combination Options
% 2.98/3.16
% 2.98/3.16 % --comb_res_mult 1000
% 2.98/3.16 % --comb_inst_mult 300
% 2.98/3.16 % ------
% 2.98/3.16
% 2.98/3.16
% 2.98/3.16
% 2.98/3.16 % ------ Proving...
% 2.98/3.16 % warning: shown sat in sat incomplete mode
% 2.98/3.16 %
% 2.98/3.16
% 2.98/3.16
% 2.98/3.16 ------ Building Model...Done
% 2.98/3.16
% 2.98/3.16 %------ The model is defined over ground terms (initial term algebra).
% 2.98/3.16 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.98/3.16 %------ where \phi is a formula over the term algebra.
% 2.98/3.16 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.98/3.16 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.98/3.16 %------ See help for --sat_out_model for different model outputs.
% 2.98/3.16 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.98/3.16 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.98/3.16
% 2.98/3.16
% 2.98/3.16
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of epred2_0
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 ( epred2_0 <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of actual_world
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0] :
% 2.98/3.16 ( ~(actual_world(X0)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of of
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2] :
% 2.98/3.16 ( ~(of(X0,X1,X2)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of man
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( man(X0,X1) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of jules_forename
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( jules_forename(X0,X1) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of forename
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( ~(forename(X0,X1)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of wheel
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( wheel(X0,X1) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of frontseat
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( ~(frontseat(X0,X1)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of chevy
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( ~(chevy(X0,X1)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of white
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( ~(white(X0,X1)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of dirty
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( ~(dirty(X0,X1)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of old
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( ~(old(X0,X1)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of city
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( city(X0,X1) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of hollywood_placename
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( ~(hollywood_placename(X0,X1)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of placename
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( ~(placename(X0,X1)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of street
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( street(X0,X1) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of lonely
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( lonely(X0,X1) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of event
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( event(X0,X1) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of agent
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2] :
% 2.98/3.16 ( agent(X0,X1,X2) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 & X2=sk3_esk5_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of present
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( ~(present(X0,X1)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of barrel
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( ~(barrel(X0,X1)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of down
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2] :
% 2.98/3.16 ( ~(down(X0,X1,X2)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of in
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2] :
% 2.98/3.16 ( ~(in(X0,X1,X2)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of be
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3] :
% 2.98/3.16 ( be(X0,X1,X2,X3) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk14_0 & X2=sk3_esk2_0 & X3=sk3_esk15_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of state
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( state(X0,X1) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk14_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of two
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( two(X0,X1) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk9_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of group
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( group(X0,X1) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk9_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 |
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk12_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of wear
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( wear(X0,X1) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of nonreflexive
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1] :
% 2.98/3.16 ( nonreflexive(X0,X1) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of behind
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2] :
% 2.98/3.16 ( behind(X0,X1,X2) <=>
% 2.98/3.16 (
% 2.98/3.16 (
% 2.98/3.16 ( X0=sk3_esk1_0 & X1=sk3_esk15_0 & X2=sk3_esk5_0 )
% 2.98/3.16 )
% 2.98/3.16
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of epred1_0
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 ( epred1_0 <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of member
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2] :
% 2.98/3.16 ( member(X0,X1,X2) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP0_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP3_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP6_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP9_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP12_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP15_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP18_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP18_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP21_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP24_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP24_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP27_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP27_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP30_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP33_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP33_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP36_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP36_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP38_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP38_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP39_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP39_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP41_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP42_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP42_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP45_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP45_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP48_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP48_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP50_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 2.98/3.16 ( sP50_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP51_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP51_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP53_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 2.98/3.16 ( sP53_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP54_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP54_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP56_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP56_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP57_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP57_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP59_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP59_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP60_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP60_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP63_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP63_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP66_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP66_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP68_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP68_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP69_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP69_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP71_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP71_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP72_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP72_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP75_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP75_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP78_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP78_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP81_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP81_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP84_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP84_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP87_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP87_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP90_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP90_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP93_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP93_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP96_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP96_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP99_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP99_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP102_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP102_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP105_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP105_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP108_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP108_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP110_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP110_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP111_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP111_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP113_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP113_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP114_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP114_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP116_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP116_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Negative definition of sP117_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( ~(sP117_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP119_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP119_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP120_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP120_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP122_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 2.98/3.16 ( sP122_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP123_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP123_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP125_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 2.98/3.16 ( sP125_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP126_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP126_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP128_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP128_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP129_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP129_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP131_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 2.98/3.16 ( sP131_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP132_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP132_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP133_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
% 2.98/3.16 ( sP133_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP135_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP135_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP136_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
% 2.98/3.16 ( sP136_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=>
% 2.98/3.16 $false
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP138_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP138_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16 %------ Positive definition of sP141_iProver_split
% 2.98/3.16 fof(lit_def,axiom,
% 2.98/3.16 (! [X0,X1,X2,X3,X4,X5,X6] :
% 2.98/3.16 ( sP141_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 2.98/3.16 $true
% 2.98/3.16 )
% 2.98/3.16 )
% 2.98/3.16 ).
% 2.98/3.16
% 2.98/3.16
% 2.98/3.16
% 2.98/3.16 % ------ Statistics
% 2.98/3.16
% 2.98/3.16 % ------ General
% 2.98/3.16
% 2.98/3.16 % num_of_input_clauses: 135
% 2.98/3.16 % num_of_input_neg_conjectures: 1
% 2.98/3.16 % num_of_splits: 144
% 2.98/3.16 % num_of_split_atoms: 144
% 2.98/3.16 % num_of_sem_filtered_clauses: 0
% 2.98/3.16 % num_of_subtypes: 0
% 2.98/3.16 % monotx_restored_types: 0
% 2.98/3.16 % sat_num_of_epr_types: 0
% 2.98/3.16 % sat_num_of_non_cyclic_types: 0
% 2.98/3.16 % sat_guarded_non_collapsed_types: 0
% 2.98/3.16 % is_epr: 0
% 2.98/3.16 % is_horn: 0
% 2.98/3.16 % has_eq: 0
% 2.98/3.16 % num_pure_diseq_elim: 0
% 2.98/3.16 % simp_replaced_by: 0
% 2.98/3.16 % res_preprocessed: 280
% 2.98/3.16 % prep_upred: 0
% 2.98/3.16 % prep_unflattend: 0
% 2.98/3.16 % pred_elim_cands: 180
% 2.98/3.16 % pred_elim: 58
% 2.98/3.16 % pred_elim_cl: 24
% 2.98/3.16 % pred_elim_cycles: 288
% 2.98/3.16 % forced_gc_time: 0
% 2.98/3.16 % gc_basic_clause_elim: 0
% 2.98/3.16 % parsing_time: 0.028
% 2.98/3.16 % sem_filter_time: 0.
% 2.98/3.16 % pred_elim_time: 0.932
% 2.98/3.16 % out_proof_time: 0.
% 2.98/3.16 % monotx_time: 0.
% 2.98/3.16 % subtype_inf_time: 0.
% 2.98/3.16 % unif_index_cands_time: 0.003
% 2.98/3.16 % unif_index_add_time: 0.005
% 2.98/3.16 % total_time: 2.711
% 2.98/3.16 % num_of_symbols: 247
% 2.98/3.16 % num_of_terms: 12010
% 2.98/3.16
% 2.98/3.16 % ------ Propositional Solver
% 2.98/3.16
% 2.98/3.16 % prop_solver_calls: 3
% 2.98/3.16 % prop_fast_solver_calls: 19149
% 2.98/3.16 % prop_num_of_clauses: 2659
% 2.98/3.16 % prop_preprocess_simplified: 6864
% 2.98/3.16 % prop_fo_subsumed: 160
% 2.98/3.16 % prop_solver_time: 0.
% 2.98/3.16 % prop_fast_solver_time: 0.033
% 2.98/3.16 % prop_unsat_core_time: 0.
% 2.98/3.16
% 2.98/3.16 % ------ QBF
% 2.98/3.16
% 2.98/3.16 % qbf_q_res: 0
% 2.98/3.16 % qbf_num_tautologies: 0
% 2.98/3.16 % qbf_prep_cycles: 0
% 2.98/3.16
% 2.98/3.16 % ------ BMC1
% 2.98/3.16
% 2.98/3.16 % bmc1_current_bound: -1
% 2.98/3.16 % bmc1_last_solved_bound: -1
% 2.98/3.16 % bmc1_unsat_core_size: -1
% 2.98/3.16 % bmc1_unsat_core_parents_size: -1
% 2.98/3.16 % bmc1_merge_next_fun: 0
% 2.98/3.16 % bmc1_unsat_core_clauses_time: 0.
% 2.98/3.16
% 2.98/3.16 % ------ Instantiation
% 2.98/3.16
% 2.98/3.16 % inst_num_of_clauses: 413
% 2.98/3.16 % inst_num_in_passive: 0
% 2.98/3.16 % inst_num_in_active: 413
% 2.98/3.16 % inst_num_in_unprocessed: 0
% 2.98/3.16 % inst_num_of_loops: 423
% 2.98/3.16 % inst_num_of_learning_restarts: 0
% 2.98/3.16 % inst_num_moves_active_passive: 0
% 2.98/3.16 % inst_lit_activity: 101
% 2.98/3.16 % inst_lit_activity_moves: 0
% 2.98/3.16 % inst_num_tautologies: 0
% 2.98/3.16 % inst_num_prop_implied: 0
% 2.98/3.16 % inst_num_existing_simplified: 0
% 2.98/3.16 % inst_num_eq_res_simplified: 0
% 2.98/3.16 % inst_num_child_elim: 0
% 2.98/3.16 % inst_num_of_dismatching_blockings: 0
% 2.98/3.16 % inst_num_of_non_proper_insts: 158
% 2.98/3.16 % inst_num_of_duplicates: 0
% 2.98/3.16 % inst_inst_num_from_inst_to_res: 0
% 2.98/3.16 % inst_dismatching_checking_time: 0.
% 2.98/3.16
% 2.98/3.16 % ------ Resolution
% 2.98/3.16
% 2.98/3.16 % res_num_of_clauses: 2799
% 2.98/3.16 % res_num_in_passive: 946
% 2.98/3.16 % res_num_in_active: 1853
% 2.98/3.16 % res_num_of_loops: 2000
% 2.98/3.16 % res_forward_subset_subsumed: 381
% 2.98/3.16 % res_backward_subset_subsumed: 2
% 2.98/3.16 % res_forward_subsumed: 0
% 2.98/3.16 % res_backward_subsumed: 0
% 2.98/3.16 % res_forward_subsumption_resolution: 1527
% 2.98/3.16 % res_backward_subsumption_resolution: 0
% 2.98/3.16 % res_clause_to_clause_subsumption: 8782
% 2.98/3.16 % res_orphan_elimination: 0
% 2.98/3.16 % res_tautology_del: 24
% 2.98/3.16 % res_num_eq_res_simplified: 0
% 2.98/3.16 % res_num_sel_changes: 0
% 2.98/3.16 % res_moves_from_active_to_pass: 0
% 2.98/3.16
% 2.98/3.16 % Status Unknown
% 3.01/3.24 % Orienting using strategy ClausalAll
% 3.01/3.24 % FOF problem with conjecture
% 3.01/3.24 % 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_680576.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e1a563.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_83b660 | grep -v "SZS"
% 3.09/3.26
% 3.09/3.26 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 3.09/3.26
% 3.09/3.26 %
% 3.09/3.26 % ------ iProver source info
% 3.09/3.26
% 3.09/3.26 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 3.09/3.26 % git: non_committed_changes: true
% 3.09/3.26 % git: last_make_outside_of_git: true
% 3.09/3.26
% 3.09/3.26 %
% 3.09/3.26 % ------ Input Options
% 3.09/3.26
% 3.09/3.26 % --out_options all
% 3.09/3.26 % --tptp_safe_out true
% 3.09/3.26 % --problem_path ""
% 3.09/3.26 % --include_path ""
% 3.09/3.26 % --clausifier .//eprover
% 3.09/3.26 % --clausifier_options --tstp-format
% 3.09/3.26 % --stdin false
% 3.09/3.26 % --dbg_backtrace false
% 3.09/3.26 % --dbg_dump_prop_clauses false
% 3.09/3.26 % --dbg_dump_prop_clauses_file -
% 3.09/3.26 % --dbg_out_stat false
% 3.09/3.26
% 3.09/3.26 % ------ General Options
% 3.09/3.26
% 3.09/3.26 % --fof false
% 3.09/3.26 % --time_out_real 150.
% 3.09/3.26 % --time_out_prep_mult 0.2
% 3.09/3.26 % --time_out_virtual -1.
% 3.09/3.26 % --schedule none
% 3.09/3.26 % --ground_splitting input
% 3.09/3.26 % --splitting_nvd 16
% 3.09/3.26 % --non_eq_to_eq false
% 3.09/3.26 % --prep_gs_sim true
% 3.09/3.26 % --prep_unflatten false
% 3.09/3.26 % --prep_res_sim true
% 3.09/3.26 % --prep_upred true
% 3.09/3.26 % --res_sim_input true
% 3.09/3.26 % --clause_weak_htbl true
% 3.09/3.26 % --gc_record_bc_elim false
% 3.09/3.26 % --symbol_type_check false
% 3.09/3.26 % --clausify_out false
% 3.09/3.26 % --large_theory_mode false
% 3.09/3.26 % --prep_sem_filter none
% 3.09/3.26 % --prep_sem_filter_out false
% 3.09/3.26 % --preprocessed_out false
% 3.09/3.26 % --sub_typing false
% 3.09/3.26 % --brand_transform false
% 3.09/3.26 % --pure_diseq_elim true
% 3.09/3.26 % --min_unsat_core false
% 3.09/3.26 % --pred_elim true
% 3.09/3.26 % --add_important_lit false
% 3.09/3.26 % --soft_assumptions false
% 3.09/3.26 % --reset_solvers false
% 3.09/3.26 % --bc_imp_inh []
% 3.09/3.26 % --conj_cone_tolerance 1.5
% 3.09/3.26 % --prolific_symb_bound 500
% 3.09/3.26 % --lt_threshold 2000
% 3.09/3.26
% 3.09/3.26 % ------ SAT Options
% 3.09/3.26
% 3.09/3.26 % --sat_mode false
% 3.09/3.26 % --sat_fm_restart_options ""
% 3.09/3.26 % --sat_gr_def false
% 3.09/3.26 % --sat_epr_types true
% 3.09/3.26 % --sat_non_cyclic_types false
% 3.09/3.26 % --sat_finite_models false
% 3.09/3.26 % --sat_fm_lemmas false
% 3.09/3.26 % --sat_fm_prep false
% 3.09/3.26 % --sat_fm_uc_incr true
% 3.09/3.26 % --sat_out_model small
% 3.09/3.26 % --sat_out_clauses false
% 3.09/3.26
% 3.09/3.26 % ------ QBF Options
% 3.09/3.26
% 3.09/3.26 % --qbf_mode false
% 3.09/3.26 % --qbf_elim_univ true
% 3.09/3.26 % --qbf_sk_in true
% 3.09/3.26 % --qbf_pred_elim true
% 3.09/3.26 % --qbf_split 32
% 3.09/3.26
% 3.09/3.26 % ------ BMC1 Options
% 3.09/3.26
% 3.09/3.26 % --bmc1_incremental false
% 3.09/3.26 % --bmc1_axioms reachable_all
% 3.09/3.26 % --bmc1_min_bound 0
% 3.09/3.26 % --bmc1_max_bound -1
% 3.09/3.26 % --bmc1_max_bound_default -1
% 3.09/3.26 % --bmc1_symbol_reachability true
% 3.09/3.26 % --bmc1_property_lemmas false
% 3.09/3.26 % --bmc1_k_induction false
% 3.09/3.26 % --bmc1_non_equiv_states false
% 3.09/3.26 % --bmc1_deadlock false
% 3.09/3.26 % --bmc1_ucm false
% 3.09/3.26 % --bmc1_add_unsat_core none
% 3.09/3.26 % --bmc1_unsat_core_children false
% 3.09/3.26 % --bmc1_unsat_core_extrapolate_axioms false
% 3.09/3.26 % --bmc1_out_stat full
% 3.09/3.26 % --bmc1_ground_init false
% 3.09/3.26 % --bmc1_pre_inst_next_state false
% 3.09/3.26 % --bmc1_pre_inst_state false
% 3.09/3.26 % --bmc1_pre_inst_reach_state false
% 3.09/3.26 % --bmc1_out_unsat_core false
% 3.09/3.26 % --bmc1_aig_witness_out false
% 3.09/3.26 % --bmc1_verbose false
% 3.09/3.26 % --bmc1_dump_clauses_tptp false
% 4.01/4.18 % --bmc1_dump_unsat_core_tptp false
% 4.01/4.18 % --bmc1_dump_file -
% 4.01/4.18 % --bmc1_ucm_expand_uc_limit 128
% 4.01/4.18 % --bmc1_ucm_n_expand_iterations 6
% 4.01/4.18 % --bmc1_ucm_extend_mode 1
% 4.01/4.18 % --bmc1_ucm_init_mode 2
% 4.01/4.18 % --bmc1_ucm_cone_mode none
% 4.01/4.18 % --bmc1_ucm_reduced_relation_type 0
% 4.01/4.18 % --bmc1_ucm_relax_model 4
% 4.01/4.18 % --bmc1_ucm_full_tr_after_sat true
% 4.01/4.18 % --bmc1_ucm_expand_neg_assumptions false
% 4.01/4.18 % --bmc1_ucm_layered_model none
% 4.01/4.18 % --bmc1_ucm_max_lemma_size 10
% 4.01/4.18
% 4.01/4.18 % ------ AIG Options
% 4.01/4.18
% 4.01/4.18 % --aig_mode false
% 4.01/4.18
% 4.01/4.18 % ------ Instantiation Options
% 4.01/4.18
% 4.01/4.18 % --instantiation_flag true
% 4.01/4.18 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 4.01/4.18 % --inst_solver_per_active 750
% 4.01/4.18 % --inst_solver_calls_frac 0.5
% 4.01/4.18 % --inst_passive_queue_type priority_queues
% 4.01/4.18 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 4.01/4.18 % --inst_passive_queues_freq [25;2]
% 4.01/4.18 % --inst_dismatching true
% 4.01/4.18 % --inst_eager_unprocessed_to_passive true
% 4.01/4.18 % --inst_prop_sim_given true
% 4.01/4.18 % --inst_prop_sim_new false
% 4.01/4.18 % --inst_orphan_elimination true
% 4.01/4.18 % --inst_learning_loop_flag true
% 4.01/4.18 % --inst_learning_start 3000
% 4.01/4.18 % --inst_learning_factor 2
% 4.01/4.18 % --inst_start_prop_sim_after_learn 3
% 4.01/4.18 % --inst_sel_renew solver
% 4.01/4.18 % --inst_lit_activity_flag true
% 4.01/4.18 % --inst_out_proof true
% 4.01/4.18
% 4.01/4.18 % ------ Resolution Options
% 4.01/4.18
% 4.01/4.18 % --resolution_flag true
% 4.01/4.18 % --res_lit_sel kbo_max
% 4.01/4.18 % --res_to_prop_solver none
% 4.01/4.18 % --res_prop_simpl_new false
% 4.01/4.18 % --res_prop_simpl_given false
% 4.01/4.18 % --res_passive_queue_type priority_queues
% 4.01/4.18 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.01/4.18 % --res_passive_queues_freq [15;5]
% 4.01/4.18 % --res_forward_subs full
% 4.01/4.18 % --res_backward_subs full
% 4.01/4.18 % --res_forward_subs_resolution true
% 4.01/4.18 % --res_backward_subs_resolution true
% 4.01/4.18 % --res_orphan_elimination false
% 4.01/4.18 % --res_time_limit 1000.
% 4.01/4.18 % --res_out_proof true
% 4.01/4.18 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_680576.s
% 4.01/4.18 % --modulo true
% 4.01/4.18
% 4.01/4.18 % ------ Combination Options
% 4.01/4.18
% 4.01/4.18 % --comb_res_mult 1000
% 4.01/4.18 % --comb_inst_mult 300
% 4.01/4.18 % ------
% 4.01/4.18
% 4.01/4.18 % ------ Parsing...% successful
% 4.01/4.18
% 4.01/4.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 144 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe_e snvd_s sp: 0 0s snvd_e %
% 4.01/4.18
% 4.01/4.18 % ------ Proving...
% 4.01/4.18 % ------ Problem Properties
% 4.01/4.18
% 4.01/4.18 %
% 4.01/4.18 % EPR false
% 4.01/4.18 % Horn false
% 4.01/4.18 % Has equality false
% 4.01/4.18
% 4.01/4.18 % % ------ Input Options Time Limit: Unbounded
% 4.01/4.18
% 4.01/4.18
% 4.01/4.18 % % ------ Current options:
% 4.01/4.18
% 4.01/4.18 % ------ Input Options
% 4.01/4.18
% 4.01/4.18 % --out_options all
% 4.01/4.18 % --tptp_safe_out true
% 4.01/4.18 % --problem_path ""
% 4.01/4.18 % --include_path ""
% 4.01/4.18 % --clausifier .//eprover
% 4.01/4.18 % --clausifier_options --tstp-format
% 4.01/4.18 % --stdin false
% 4.01/4.18 % --dbg_backtrace false
% 4.01/4.18 % --dbg_dump_prop_clauses false
% 4.01/4.18 % --dbg_dump_prop_clauses_file -
% 4.01/4.18 % --dbg_out_stat false
% 4.01/4.18
% 4.01/4.18 % ------ General Options
% 4.01/4.18
% 4.01/4.18 % --fof false
% 4.01/4.18 % --time_out_real 150.
% 4.01/4.18 % --time_out_prep_mult 0.2
% 4.01/4.18 % --time_out_virtual -1.
% 4.01/4.18 % --schedule none
% 4.01/4.18 % --ground_splitting input
% 4.01/4.18 % --splitting_nvd 16
% 4.01/4.18 % --non_eq_to_eq false
% 4.01/4.18 % --prep_gs_sim true
% 4.01/4.18 % --prep_unflatten false
% 4.01/4.18 % --prep_res_sim true
% 4.01/4.18 % --prep_upred true
% 4.01/4.18 % --res_sim_input true
% 4.01/4.18 % --clause_weak_htbl true
% 4.01/4.18 % --gc_record_bc_elim false
% 4.01/4.18 % --symbol_type_check false
% 4.01/4.18 % --clausify_out false
% 4.01/4.18 % --large_theory_mode false
% 4.01/4.18 % --prep_sem_filter none
% 4.01/4.18 % --prep_sem_filter_out false
% 4.01/4.18 % --preprocessed_out false
% 4.01/4.18 % --sub_typing false
% 4.01/4.18 % --brand_transform false
% 4.01/4.18 % --pure_diseq_elim true
% 4.01/4.18 % --min_unsat_core false
% 4.01/4.18 % --pred_elim true
% 4.01/4.18 % --add_important_lit false
% 4.01/4.18 % --soft_assumptions false
% 4.01/4.18 % --reset_solvers false
% 4.01/4.18 % --bc_imp_inh []
% 4.01/4.18 % --conj_cone_tolerance 1.5
% 4.01/4.18 % --prolific_symb_bound 500
% 4.01/4.18 % --lt_threshold 2000
% 4.01/4.18
% 4.01/4.18 % ------ SAT Options
% 4.01/4.18
% 4.01/4.18 % --sat_mode false
% 4.01/4.18 % --sat_fm_restart_options ""
% 4.01/4.18 % --sat_gr_def false
% 4.01/4.18 % --sat_epr_types true
% 4.01/4.18 % --sat_non_cyclic_types false
% 4.01/4.18 % --sat_finite_models false
% 4.01/4.18 % --sat_fm_lemmas false
% 4.01/4.18 % --sat_fm_prep false
% 4.01/4.18 % --sat_fm_uc_incr true
% 4.01/4.18 % --sat_out_model small
% 4.01/4.18 % --sat_out_clauses false
% 4.01/4.18
% 4.01/4.18 % ------ QBF Options
% 4.01/4.18
% 4.01/4.18 % --qbf_mode false
% 4.01/4.18 % --qbf_elim_univ true
% 4.01/4.18 % --qbf_sk_in true
% 4.01/4.18 % --qbf_pred_elim true
% 4.01/4.18 % --qbf_split 32
% 4.01/4.18
% 4.01/4.18 % ------ BMC1 Options
% 4.01/4.18
% 4.01/4.18 % --bmc1_incremental false
% 4.01/4.18 % --bmc1_axioms reachable_all
% 4.01/4.18 % --bmc1_min_bound 0
% 4.01/4.18 % --bmc1_max_bound -1
% 4.01/4.18 % --bmc1_max_bound_default -1
% 4.01/4.18 % --bmc1_symbol_reachability true
% 4.01/4.18 % --bmc1_property_lemmas false
% 4.01/4.18 % --bmc1_k_induction false
% 4.01/4.18 % --bmc1_non_equiv_states false
% 4.01/4.18 % --bmc1_deadlock false
% 4.01/4.18 % --bmc1_ucm false
% 4.01/4.18 % --bmc1_add_unsat_core none
% 4.01/4.18 % --bmc1_unsat_core_children false
% 4.01/4.18 % --bmc1_unsat_core_extrapolate_axioms false
% 4.01/4.18 % --bmc1_out_stat full
% 4.01/4.18 % --bmc1_ground_init false
% 4.01/4.18 % --bmc1_pre_inst_next_state false
% 4.01/4.18 % --bmc1_pre_inst_state false
% 4.01/4.18 % --bmc1_pre_inst_reach_state false
% 4.01/4.18 % --bmc1_out_unsat_core false
% 4.01/4.18 % --bmc1_aig_witness_out false
% 4.01/4.18 % --bmc1_verbose false
% 4.01/4.18 % --bmc1_dump_clauses_tptp false
% 4.01/4.18 % --bmc1_dump_unsat_core_tptp false
% 4.01/4.18 % --bmc1_dump_file -
% 4.01/4.18 % --bmc1_ucm_expand_uc_limit 128
% 4.01/4.19 % --bmc1_ucm_n_expand_iterations 6
% 4.01/4.19 % --bmc1_ucm_extend_mode 1
% 4.01/4.19 % --bmc1_ucm_init_mode 2
% 4.01/4.19 % --bmc1_ucm_cone_mode none
% 4.01/4.19 % --bmc1_ucm_reduced_relation_type 0
% 4.01/4.19 % --bmc1_ucm_relax_model 4
% 4.01/4.19 % --bmc1_ucm_full_tr_after_sat true
% 4.01/4.19 % --bmc1_ucm_expand_neg_assumptions false
% 4.01/4.19 % --bmc1_ucm_layered_model none
% 4.01/4.19 % --bmc1_ucm_max_lemma_size 10
% 4.01/4.19
% 4.01/4.19 % ------ AIG Options
% 4.01/4.19
% 4.01/4.19 % --aig_mode false
% 4.01/4.19
% 4.01/4.19 % ------ Instantiation Options
% 4.01/4.19
% 4.01/4.19 % --instantiation_flag true
% 4.01/4.19 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 4.01/4.19 % --inst_solver_per_active 750
% 4.01/4.19 % --inst_solver_calls_frac 0.5
% 4.01/4.19 % --inst_passive_queue_type priority_queues
% 4.01/4.19 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 4.01/4.19 % --inst_passive_queues_freq [25;2]
% 4.01/4.19 % --inst_dismatching true
% 4.01/4.19 % --inst_eager_unprocessed_to_passive true
% 5.61/5.82 % --inst_prop_sim_given true
% 5.61/5.82 % --inst_prop_sim_new false
% 5.61/5.82 % --inst_orphan_elimination true
% 5.61/5.82 % --inst_learning_loop_flag true
% 5.61/5.82 % --inst_learning_start 3000
% 5.61/5.82 % --inst_learning_factor 2
% 5.61/5.82 % --inst_start_prop_sim_after_learn 3
% 5.61/5.82 % --inst_sel_renew solver
% 5.61/5.82 % --inst_lit_activity_flag true
% 5.61/5.82 % --inst_out_proof true
% 5.61/5.82
% 5.61/5.82 % ------ Resolution Options
% 5.61/5.82
% 5.61/5.82 % --resolution_flag true
% 5.61/5.82 % --res_lit_sel kbo_max
% 5.61/5.82 % --res_to_prop_solver none
% 5.61/5.82 % --res_prop_simpl_new false
% 5.61/5.82 % --res_prop_simpl_given false
% 5.61/5.82 % --res_passive_queue_type priority_queues
% 5.61/5.82 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 5.61/5.82 % --res_passive_queues_freq [15;5]
% 5.61/5.82 % --res_forward_subs full
% 5.61/5.82 % --res_backward_subs full
% 5.61/5.82 % --res_forward_subs_resolution true
% 5.61/5.82 % --res_backward_subs_resolution true
% 5.61/5.82 % --res_orphan_elimination false
% 5.61/5.82 % --res_time_limit 1000.
% 5.61/5.82 % --res_out_proof true
% 5.61/5.82 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_680576.s
% 5.61/5.82 % --modulo true
% 5.61/5.82
% 5.61/5.82 % ------ Combination Options
% 5.61/5.82
% 5.61/5.82 % --comb_res_mult 1000
% 5.61/5.82 % --comb_inst_mult 300
% 5.61/5.82 % ------
% 5.61/5.82
% 5.61/5.82
% 5.61/5.82
% 5.61/5.82 % ------ Proving...
% 5.61/5.82 % warning: shown sat in sat incomplete mode
% 5.61/5.82 %
% 5.61/5.82
% 5.61/5.82
% 5.61/5.82 ------ Building Model...Done
% 5.61/5.82
% 5.61/5.82 %------ The model is defined over ground terms (initial term algebra).
% 5.61/5.82 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 5.61/5.82 %------ where \phi is a formula over the term algebra.
% 5.61/5.82 %------ If we have equality in the problem then it is also defined as a predicate above,
% 5.61/5.82 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 5.61/5.82 %------ See help for --sat_out_model for different model outputs.
% 5.61/5.82 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 5.61/5.82 %------ where the first argument stands for the sort ($i in the unsorted case)
% 5.61/5.82
% 5.61/5.82
% 5.61/5.82
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of epred2_0
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 ( epred2_0 <=>
% 5.61/5.82 $true
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of actual_world
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0] :
% 5.61/5.82 ( ~(actual_world(X0)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of of
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2] :
% 5.61/5.82 ( ~(of(X0,X1,X2)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of man
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( man(X0,X1) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of jules_forename
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( jules_forename(X0,X1) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of forename
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( ~(forename(X0,X1)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of wheel
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( wheel(X0,X1) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of frontseat
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( ~(frontseat(X0,X1)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of chevy
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( ~(chevy(X0,X1)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of white
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( ~(white(X0,X1)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of dirty
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( ~(dirty(X0,X1)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of old
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( ~(old(X0,X1)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of city
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( city(X0,X1) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of hollywood_placename
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( ~(hollywood_placename(X0,X1)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of placename
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( ~(placename(X0,X1)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of street
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( street(X0,X1) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of lonely
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( lonely(X0,X1) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of event
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( event(X0,X1) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of agent
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2] :
% 5.61/5.82 ( agent(X0,X1,X2) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 & X2=sk2_esk5_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of present
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( ~(present(X0,X1)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of barrel
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( ~(barrel(X0,X1)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of down
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2] :
% 5.61/5.82 ( ~(down(X0,X1,X2)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Negative definition of in
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2] :
% 5.61/5.82 ( ~(in(X0,X1,X2)) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of be
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2,X3] :
% 5.61/5.82 ( be(X0,X1,X2,X3) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk14_0 & X2=sk2_esk2_0 & X3=sk2_esk15_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of state
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( state(X0,X1) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk14_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of two
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( two(X0,X1) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk9_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of group
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( group(X0,X1) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk9_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 |
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk12_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of wear
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( wear(X0,X1) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of nonreflexive
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1] :
% 5.61/5.82 ( nonreflexive(X0,X1) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of behind
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2] :
% 5.61/5.82 ( behind(X0,X1,X2) <=>
% 5.61/5.82 (
% 5.61/5.82 (
% 5.61/5.82 ( X0=sk2_esk1_0 & X1=sk2_esk15_0 & X2=sk2_esk5_0 )
% 5.61/5.82 )
% 5.61/5.82
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of epred1_0
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 ( epred1_0 <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of member
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2] :
% 5.61/5.82 ( member(X0,X1,X2) <=>
% 5.61/5.82 $false
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of sP0_iProver_split
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.82 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.82 $true
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of sP3_iProver_split
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.82 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.82 $true
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of sP6_iProver_split
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.82 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.82 $true
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of sP9_iProver_split
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.82 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.82 $true
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of sP12_iProver_split
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.82 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.82 $true
% 5.61/5.82 )
% 5.61/5.82 )
% 5.61/5.82 ).
% 5.61/5.82
% 5.61/5.82 %------ Positive definition of sP15_iProver_split
% 5.61/5.82 fof(lit_def,axiom,
% 5.61/5.82 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP18_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP18_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP21_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP24_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP24_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP27_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP27_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP30_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP33_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP33_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP36_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP36_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP38_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP38_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP39_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP39_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP41_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP42_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP42_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP45_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP45_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP48_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP48_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP50_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 5.61/5.83 ( sP50_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP51_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP51_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP53_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 5.61/5.83 ( sP53_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP54_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP54_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP56_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP56_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP57_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP57_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP59_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP59_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP60_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP60_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP63_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP63_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP66_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP66_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP68_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP68_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP69_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP69_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP71_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP71_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP72_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP72_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP75_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP75_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP78_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP78_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP81_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP81_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP84_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP84_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP87_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP87_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP90_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP90_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP93_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP93_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP96_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP96_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP99_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP99_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP102_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP102_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP105_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP105_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP108_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP108_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP110_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP110_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP111_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP111_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP113_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP113_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP114_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP114_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP116_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP116_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Negative definition of sP117_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( ~(sP117_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP119_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP119_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP120_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP120_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP122_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 5.61/5.83 ( sP122_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP123_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP123_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP125_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 5.61/5.83 ( sP125_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP126_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP126_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP128_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP128_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP129_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP129_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP131_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 5.61/5.83 ( sP131_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP132_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP132_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP133_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
% 5.61/5.83 ( sP133_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP135_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP135_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP136_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
% 5.61/5.83 ( sP136_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=>
% 5.61/5.83 $false
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP138_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP138_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83 %------ Positive definition of sP141_iProver_split
% 5.61/5.83 fof(lit_def,axiom,
% 5.61/5.83 (! [X0,X1,X2,X3,X4,X5,X6] :
% 5.61/5.83 ( sP141_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 5.61/5.83 $true
% 5.61/5.83 )
% 5.61/5.83 )
% 5.61/5.83 ).
% 5.61/5.83
% 5.61/5.83
% 5.61/5.83
% 5.61/5.83 % ------ Statistics
% 5.61/5.83
% 5.61/5.83 % ------ General
% 5.61/5.83
% 5.61/5.83 % num_of_input_clauses: 135
% 5.61/5.83 % num_of_input_neg_conjectures: 1
% 5.61/5.83 % num_of_splits: 144
% 5.61/5.83 % num_of_split_atoms: 144
% 5.61/5.83 % num_of_sem_filtered_clauses: 0
% 5.61/5.83 % num_of_subtypes: 0
% 5.61/5.83 % monotx_restored_types: 0
% 5.61/5.83 % sat_num_of_epr_types: 0
% 5.61/5.83 % sat_num_of_non_cyclic_types: 0
% 5.61/5.83 % sat_guarded_non_collapsed_types: 0
% 5.61/5.83 % is_epr: 0
% 5.61/5.83 % is_horn: 0
% 5.61/5.83 % has_eq: 0
% 5.61/5.83 % num_pure_diseq_elim: 0
% 5.61/5.83 % simp_replaced_by: 0
% 5.61/5.83 % res_preprocessed: 280
% 5.61/5.83 % prep_upred: 0
% 5.61/5.83 % prep_unflattend: 0
% 5.61/5.83 % pred_elim_cands: 180
% 5.61/5.83 % pred_elim: 58
% 5.61/5.83 % pred_elim_cl: 24
% 5.61/5.83 % pred_elim_cycles: 288
% 5.61/5.83 % forced_gc_time: 0
% 5.61/5.83 % gc_basic_clause_elim: 0
% 5.61/5.83 % parsing_time: 0.015
% 5.61/5.83 % sem_filter_time: 0.
% 5.61/5.83 % pred_elim_time: 0.847
% 5.61/5.83 % out_proof_time: 0.
% 5.61/5.83 % monotx_time: 0.
% 5.61/5.83 % subtype_inf_time: 0.
% 5.61/5.83 % unif_index_cands_time: 0.003
% 5.61/5.83 % unif_index_add_time: 0.005
% 5.61/5.83 % total_time: 2.578
% 5.61/5.83 % num_of_symbols: 247
% 5.61/5.83 % num_of_terms: 12010
% 5.61/5.83
% 5.61/5.83 % ------ Propositional Solver
% 5.61/5.83
% 5.61/5.83 % prop_solver_calls: 3
% 5.61/5.83 % prop_fast_solver_calls: 19149
% 5.61/5.83 % prop_num_of_clauses: 2659
% 5.61/5.83 % prop_preprocess_simplified: 6864
% 5.61/5.83 % prop_fo_subsumed: 160
% 5.61/5.83 % prop_solver_time: 0.
% 5.61/5.83 % prop_fast_solver_time: 0.027
% 5.61/5.83 % prop_unsat_core_time: 0.
% 5.61/5.83
% 5.61/5.83 % ------ QBF
% 5.61/5.83
% 5.61/5.83 % qbf_q_res: 0
% 5.61/5.83 % qbf_num_tautologies: 0
% 5.61/5.83 % qbf_prep_cycles: 0
% 5.61/5.83
% 5.61/5.83 % ------ BMC1
% 5.61/5.83
% 5.61/5.83 % bmc1_current_bound: -1
% 5.61/5.83 % bmc1_last_solved_bound: -1
% 5.61/5.83 % bmc1_unsat_core_size: -1
% 5.61/5.83 % bmc1_unsat_core_parents_size: -1
% 5.61/5.83 % bmc1_merge_next_fun: 0
% 5.61/5.83 % bmc1_unsat_core_clauses_time: 0.
% 5.61/5.83
% 5.61/5.83 % ------ Instantiation
% 5.61/5.83
% 5.61/5.83 % inst_num_of_clauses: 413
% 5.61/5.83 % inst_num_in_passive: 0
% 5.61/5.83 % inst_num_in_active: 413
% 5.61/5.83 % inst_num_in_unprocessed: 0
% 5.61/5.83 % inst_num_of_loops: 423
% 5.61/5.83 % inst_num_of_learning_restarts: 0
% 5.61/5.83 % inst_num_moves_active_passive: 0
% 5.61/5.83 % inst_lit_activity: 101
% 5.61/5.83 % inst_lit_activity_moves: 0
% 5.61/5.83 % inst_num_tautologies: 0
% 5.61/5.83 % inst_num_prop_implied: 0
% 5.61/5.83 % inst_num_existing_simplified: 0
% 5.61/5.83 % inst_num_eq_res_simplified: 0
% 5.61/5.83 % inst_num_child_elim: 0
% 5.61/5.83 % inst_num_of_dismatching_blockings: 0
% 5.61/5.83 % inst_num_of_non_proper_insts: 158
% 5.61/5.83 % inst_num_of_duplicates: 0
% 5.61/5.83 % inst_inst_num_from_inst_to_res: 0
% 5.61/5.83 % inst_dismatching_checking_time: 0.
% 5.61/5.83
% 5.61/5.83 % ------ Resolution
% 5.61/5.83
% 5.61/5.83 % res_num_of_clauses: 2799
% 5.61/5.83 % res_num_in_passive: 946
% 5.61/5.83 % res_num_in_active: 1853
% 5.61/5.83 % res_num_of_loops: 2000
% 5.61/5.83 % res_forward_subset_subsumed: 381
% 5.61/5.83 % res_backward_subset_subsumed: 2
% 5.61/5.83 % res_forward_subsumed: 0
% 5.61/5.83 % res_backward_subsumed: 0
% 5.61/5.83 % res_forward_subsumption_resolution: 1527
% 5.61/5.83 % res_backward_subsumption_resolution: 0
% 5.61/5.83 % res_clause_to_clause_subsumption: 8782
% 5.61/5.83 % res_orphan_elimination: 0
% 5.61/5.83 % res_tautology_del: 24
% 5.61/5.83 % res_num_eq_res_simplified: 0
% 5.61/5.83 % res_num_sel_changes: 0
% 5.61/5.83 % res_moves_from_active_to_pass: 0
% 5.61/5.83
% 5.61/5.83 % Status Unknown
% 5.61/5.83 % Last status :
% 5.61/5.83 % SZS status Unknown
%------------------------------------------------------------------------------