TSTP Solution File: SET108+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n004.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 : Tue Jul 19 02:10:31 EDT 2022
% Result : Theorem 0.64s 0.94s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.06/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 09:35:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % FOF problem with conjecture
% 0.20/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_4fbb47.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_f988e1.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_908464 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_4fbb47.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...%
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 35
% 0.20/0.43 % num_of_input_neg_conjectures: 0
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 0
% 0.20/0.43 % is_horn: 0
% 0.20/0.43 % has_eq: 0
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 0
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unFatal error: exception Failure("Parse error in: /export/starexec/sandbox/tmp/iprover_modulo_f988e1.p line: 38 near token: '!='")
% 0.20/0.43 if_index_add_time: 0.
% 0.20/0.43 % total_time: 0.019
% 0.20/0.43 % num_of_symbols: 57
% 0.20/0.43 % num_of_terms: 121
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 0
% 0.20/0.43 % prop_fast_solver_calls: 0
% 0.20/0.43 % prop_num_of_clauses: 0
% 0.20/0.43 % prop_preprocess_simplified: 0
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: undef
% 0.20/0.43 % inst_num_in_passive: undef
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 0
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: undef
% 0.20/0.43 % res_num_in_passive: undef
% 0.20/0.43 % res_num_in_active: 0
% 0.20/0.43 % res_num_of_loops: 0
% 0.20/0.43 % res_forward_subset_subsumed: 0
% 0.20/0.43 % res_backward_subset_subsumed: 0
% 0.20/0.43 % res_forward_subsumed: 0
% 0.20/0.43 % res_backward_subsumed: 0
% 0.20/0.43 % res_forward_subsumption_resolution: 0
% 0.20/0.43 % res_backward_subsumption_resolution: 0
% 0.20/0.43 % res_clause_to_clause_subsumption: 0
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 0
% 0.20/0.43 % res_num_eq_res_simplified: 0
% 0.20/0.43 % res_num_sel_changes: 0
% 0.20/0.43 % res_moves_from_active_to_pass: 0
% 0.20/0.43
% 0.20/0.43 % Status Unknown
% 0.20/0.48 % Orienting using strategy ClausalAll
% 0.20/0.48 % FOF problem with conjecture
% 0.20/0.48 % 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_4fbb47.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_f988e1.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_793a12 | grep -v "SZS"
% 0.20/0.50
% 0.20/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ iProver source info
% 0.20/0.50
% 0.20/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.50 % git: non_committed_changes: true
% 0.20/0.50 % git: last_make_outside_of_git: true
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.64/0.94 % --bmc1_dump_unsat_core_tptp false
% 0.64/0.94 % --bmc1_dump_file -
% 0.64/0.94 % --bmc1_ucm_expand_uc_limit 128
% 0.64/0.94 % --bmc1_ucm_n_expand_iterations 6
% 0.64/0.94 % --bmc1_ucm_extend_mode 1
% 0.64/0.94 % --bmc1_ucm_init_mode 2
% 0.64/0.94 % --bmc1_ucm_cone_mode none
% 0.64/0.94 % --bmc1_ucm_reduced_relation_type 0
% 0.64/0.94 % --bmc1_ucm_relax_model 4
% 0.64/0.94 % --bmc1_ucm_full_tr_after_sat true
% 0.64/0.94 % --bmc1_ucm_expand_neg_assumptions false
% 0.64/0.94 % --bmc1_ucm_layered_model none
% 0.64/0.94 % --bmc1_ucm_max_lemma_size 10
% 0.64/0.94
% 0.64/0.94 % ------ AIG Options
% 0.64/0.94
% 0.64/0.94 % --aig_mode false
% 0.64/0.94
% 0.64/0.94 % ------ Instantiation Options
% 0.64/0.94
% 0.64/0.94 % --instantiation_flag true
% 0.64/0.94 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.64/0.94 % --inst_solver_per_active 750
% 0.64/0.94 % --inst_solver_calls_frac 0.5
% 0.64/0.94 % --inst_passive_queue_type priority_queues
% 0.64/0.94 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.64/0.94 % --inst_passive_queues_freq [25;2]
% 0.64/0.94 % --inst_dismatching true
% 0.64/0.94 % --inst_eager_unprocessed_to_passive true
% 0.64/0.94 % --inst_prop_sim_given true
% 0.64/0.94 % --inst_prop_sim_new false
% 0.64/0.94 % --inst_orphan_elimination true
% 0.64/0.94 % --inst_learning_loop_flag true
% 0.64/0.94 % --inst_learning_start 3000
% 0.64/0.94 % --inst_learning_factor 2
% 0.64/0.94 % --inst_start_prop_sim_after_learn 3
% 0.64/0.94 % --inst_sel_renew solver
% 0.64/0.94 % --inst_lit_activity_flag true
% 0.64/0.94 % --inst_out_proof true
% 0.64/0.94
% 0.64/0.94 % ------ Resolution Options
% 0.64/0.94
% 0.64/0.94 % --resolution_flag true
% 0.64/0.94 % --res_lit_sel kbo_max
% 0.64/0.94 % --res_to_prop_solver none
% 0.64/0.94 % --res_prop_simpl_new false
% 0.64/0.94 % --res_prop_simpl_given false
% 0.64/0.94 % --res_passive_queue_type priority_queues
% 0.64/0.94 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.64/0.94 % --res_passive_queues_freq [15;5]
% 0.64/0.94 % --res_forward_subs full
% 0.64/0.94 % --res_backward_subs full
% 0.64/0.94 % --res_forward_subs_resolution true
% 0.64/0.94 % --res_backward_subs_resolution true
% 0.64/0.94 % --res_orphan_elimination false
% 0.64/0.94 % --res_time_limit 1000.
% 0.64/0.94 % --res_out_proof true
% 0.64/0.94 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_4fbb47.s
% 0.64/0.94 % --modulo true
% 0.64/0.94
% 0.64/0.94 % ------ Combination Options
% 0.64/0.94
% 0.64/0.94 % --comb_res_mult 1000
% 0.64/0.94 % --comb_inst_mult 300
% 0.64/0.94 % ------
% 0.64/0.94
% 0.64/0.94 % ------ Parsing...% successful
% 0.64/0.94
% 0.64/0.94 % ------ Preprocessing... gs_s sp: 12 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.64/0.94
% 0.64/0.94 % ------ Proving...
% 0.64/0.94 % ------ Problem Properties
% 0.64/0.94
% 0.64/0.94 %
% 0.64/0.94 % EPR false
% 0.64/0.94 % Horn false
% 0.64/0.94 % Has equality true
% 0.64/0.94
% 0.64/0.94 % % ------ Input Options Time Limit: Unbounded
% 0.64/0.94
% 0.64/0.94
% 0.64/0.94 Compiling...
% 0.64/0.94 Loading plugin: done.
% 0.64/0.94 Compiling...
% 0.64/0.94 Loading plugin: done.
% 0.64/0.94 Compiling...
% 0.64/0.94 Loading plugin: done.
% 0.64/0.94 Compiling...
% 0.64/0.94 Loading plugin: done.
% 0.64/0.94 % % ------ Current options:
% 0.64/0.94
% 0.64/0.94 % ------ Input Options
% 0.64/0.94
% 0.64/0.94 % --out_options all
% 0.64/0.94 % --tptp_safe_out true
% 0.64/0.94 % --problem_path ""
% 0.64/0.94 % --include_path ""
% 0.64/0.94 % --clausifier .//eprover
% 0.64/0.94 % --clausifier_options --tstp-format
% 0.64/0.94 % --stdin false
% 0.64/0.94 % --dbg_backtrace false
% 0.64/0.94 % --dbg_dump_prop_clauses false
% 0.64/0.94 % --dbg_dump_prop_clauses_file -
% 0.64/0.94 % --dbg_out_stat false
% 0.64/0.94
% 0.64/0.94 % ------ General Options
% 0.64/0.94
% 0.64/0.94 % --fof false
% 0.64/0.94 % --time_out_real 150.
% 0.64/0.94 % --time_out_prep_mult 0.2
% 0.64/0.94 % --time_out_virtual -1.
% 0.64/0.94 % --schedule none
% 0.64/0.94 % --ground_splitting input
% 0.64/0.94 % --splitting_nvd 16
% 0.64/0.94 % --non_eq_to_eq false
% 0.64/0.94 % --prep_gs_sim true
% 0.64/0.94 % --prep_unflatten false
% 0.64/0.94 % --prep_res_sim true
% 0.64/0.94 % --prep_upred true
% 0.64/0.94 % --res_sim_input true
% 0.64/0.94 % --clause_weak_htbl true
% 0.64/0.94 % --gc_record_bc_elim false
% 0.64/0.94 % --symbol_type_check false
% 0.64/0.94 % --clausify_out false
% 0.64/0.94 % --large_theory_mode false
% 0.64/0.94 % --prep_sem_filter none
% 0.64/0.94 % --prep_sem_filter_out false
% 0.64/0.94 % --preprocessed_out false
% 0.64/0.94 % --sub_typing false
% 0.64/0.94 % --brand_transform false
% 0.64/0.94 % --pure_diseq_elim true
% 0.64/0.94 % --min_unsat_core false
% 0.64/0.94 % --pred_elim true
% 0.64/0.94 % --add_important_lit false
% 0.64/0.94 % --soft_assumptions false
% 0.64/0.94 % --reset_solvers false
% 0.64/0.94 % --bc_imp_inh []
% 0.64/0.94 % --conj_cone_tolerance 1.5
% 0.64/0.94 % --prolific_symb_bound 500
% 0.64/0.94 % --lt_threshold 2000
% 0.64/0.94
% 0.64/0.94 % ------ SAT Options
% 0.64/0.94
% 0.64/0.94 % --sat_mode false
% 0.64/0.94 % --sat_fm_restart_options ""
% 0.64/0.94 % --sat_gr_def false
% 0.64/0.94 % --sat_epr_types true
% 0.64/0.94 % --sat_non_cyclic_types false
% 0.64/0.94 % --sat_finite_models false
% 0.64/0.94 % --sat_fm_lemmas false
% 0.64/0.94 % --sat_fm_prep false
% 0.64/0.94 % --sat_fm_uc_incr true
% 0.64/0.94 % --sat_out_model small
% 0.64/0.94 % --sat_out_clauses false
% 0.64/0.94
% 0.64/0.94 % ------ QBF Options
% 0.64/0.94
% 0.64/0.94 % --qbf_mode false
% 0.64/0.94 % --qbf_elim_univ true
% 0.64/0.94 % --qbf_sk_in true
% 0.64/0.94 % --qbf_pred_elim true
% 0.64/0.94 % --qbf_split 32
% 0.64/0.94
% 0.64/0.94 % ------ BMC1 Options
% 0.64/0.94
% 0.64/0.94 % --bmc1_incremental false
% 0.64/0.94 % --bmc1_axioms reachable_all
% 0.64/0.94 % --bmc1_min_bound 0
% 0.64/0.94 % --bmc1_max_bound -1
% 0.64/0.94 % --bmc1_max_bound_default -1
% 0.64/0.94 % --bmc1_symbol_reachability true
% 0.64/0.94 % --bmc1_property_lemmas false
% 0.64/0.94 % --bmc1_k_induction false
% 0.64/0.94 % --bmc1_non_equiv_states false
% 0.64/0.94 % --bmc1_deadlock false
% 0.64/0.94 % --bmc1_ucm false
% 0.64/0.94 % --bmc1_add_unsat_core none
% 0.64/0.94 % --bmc1_unsat_core_children false
% 0.64/0.94 % --bmc1_unsat_core_extrapolate_axioms false
% 0.64/0.94 % --bmc1_out_stat full
% 0.64/0.94 % --bmc1_ground_init false
% 0.64/0.94 % --bmc1_pre_inst_next_state false
% 0.64/0.94 % --bmc1_pre_inst_state false
% 0.64/0.94 % --bmc1_pre_inst_reach_state false
% 0.64/0.94 % --bmc1_out_unsat_core false
% 0.64/0.94 % --bmc1_aig_witness_out false
% 0.64/0.94 % --bmc1_verbose false
% 0.64/0.94 % --bmc1_dump_clauses_tptp false
% 0.64/0.94 % --bmc1_dump_unsat_core_tptp false
% 0.64/0.94 % --bmc1_dump_file -
% 0.64/0.94 % --bmc1_ucm_expand_uc_limit 128
% 0.64/0.94 % --bmc1_ucm_n_expand_iterations 6
% 0.64/0.94 % --bmc1_ucm_extend_mode 1
% 0.64/0.94 % --bmc1_ucm_init_mode 2
% 0.64/0.94 % --bmc1_ucm_cone_mode none
% 0.64/0.94 % --bmc1_ucm_reduced_relation_type 0
% 0.64/0.94 % --bmc1_ucm_relax_model 4
% 0.64/0.94 % --bmc1_ucm_full_tr_after_sat true
% 0.64/0.94 % --bmc1_ucm_expand_neg_assumptions false
% 0.64/0.94 % --bmc1_ucm_layered_model none
% 0.64/0.94 % --bmc1_ucm_max_lemma_size 10
% 0.64/0.94
% 0.64/0.94 % ------ AIG Options
% 0.64/0.94
% 0.64/0.94 % --aig_mode false
% 0.64/0.94
% 0.64/0.94 % ------ Instantiation Options
% 0.64/0.94
% 0.64/0.94 % --instantiation_flag true
% 0.64/0.94 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.64/0.94 % --inst_solver_per_active 750
% 0.64/0.94 % --inst_solver_calls_frac 0.5
% 0.64/0.94 % --inst_passive_queue_type priority_queues
% 0.64/0.94 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.64/0.94 % --inst_passive_queues_freq [25;2]
% 0.64/0.94 % --inst_dismatching true
% 0.64/0.94 % --inst_eager_unprocessed_to_passive true
% 0.64/0.94 % --inst_prop_sim_given true
% 0.64/0.94 % --inst_prop_sim_new false
% 0.64/0.94 % --inst_orphan_elimination true
% 0.64/0.94 % --inst_learning_loop_flag true
% 0.64/0.94 % --inst_learning_start 3000
% 0.64/0.94 % --inst_learning_factor 2
% 0.64/0.94 % --inst_start_prop_sim_after_learn 3
% 0.64/0.94 % --inst_sel_renew solver
% 0.64/0.94 % --inst_lit_activity_flag true
% 0.64/0.94 % --inst_out_proof true
% 0.64/0.94
% 0.64/0.94 % ------ Resolution Options
% 0.64/0.94
% 0.64/0.94 % --resolution_flag true
% 0.64/0.94 % --res_lit_sel kbo_max
% 0.64/0.94 % --res_to_prop_solver none
% 0.64/0.94 % --res_prop_simpl_new false
% 0.64/0.94 % --res_prop_simpl_given false
% 0.64/0.94 % --res_passive_queue_type priority_queues
% 0.64/0.94 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.64/0.94 % --res_passive_queues_freq [15;5]
% 0.64/0.94 % --res_forward_subs full
% 0.64/0.94 % --res_backward_subs full
% 0.64/0.94 % --res_forward_subs_resolution true
% 0.64/0.94 % --res_backward_subs_resolution true
% 0.64/0.94 % --res_orphan_elimination false
% 0.64/0.94 % --res_time_limit 1000.
% 0.64/0.94 % --res_out_proof true
% 0.64/0.94 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_4fbb47.s
% 0.64/0.94 % --modulo true
% 0.64/0.94
% 0.64/0.94 % ------ Combination Options
% 0.64/0.94
% 0.64/0.94 % --comb_res_mult 1000
% 0.64/0.94 % --comb_inst_mult 300
% 0.64/0.94 % ------
% 0.64/0.94
% 0.64/0.94
% 0.64/0.94
% 0.64/0.94 % ------ Proving...
% 0.64/0.94 %
% 0.64/0.94
% 0.64/0.94
% 0.64/0.94 % Resolution empty clause
% 0.64/0.94
% 0.64/0.94 % ------ Statistics
% 0.64/0.94
% 0.64/0.94 % ------ General
% 0.64/0.94
% 0.64/0.94 % num_of_input_clauses: 189
% 0.64/0.94 % num_of_input_neg_conjectures: 4
% 0.64/0.94 % num_of_splits: 12
% 0.64/0.94 % num_of_split_atoms: 1
% 0.64/0.94 % num_of_sem_filtered_clauses: 0
% 0.64/0.94 % num_of_subtypes: 0
% 0.64/0.94 % monotx_restored_types: 0
% 0.64/0.94 % sat_num_of_epr_types: 0
% 0.64/0.94 % sat_num_of_non_cyclic_types: 0
% 0.64/0.94 % sat_guarded_non_collapsed_types: 0
% 0.64/0.94 % is_epr: 0
% 0.64/0.94 % is_horn: 0
% 0.64/0.94 % has_eq: 1
% 0.64/0.94 % num_pure_diseq_elim: 0
% 0.64/0.94 % simp_replaced_by: 0
% 0.64/0.94 % res_preprocessed: 20
% 0.64/0.94 % prep_upred: 0
% 0.64/0.94 % prep_unflattend: 3
% 0.64/0.94 % pred_elim_cands: 1
% 0.64/0.94 % pred_elim: 1
% 0.64/0.94 % pred_elim_cl: 1
% 0.64/0.94 % pred_elim_cycles: 2
% 0.64/0.94 % forced_gc_time: 0
% 0.64/0.94 % gc_basic_clause_elim: 0
% 0.64/0.94 % parsing_time: 0.007
% 0.64/0.94 % sem_filter_time: 0.
% 0.64/0.94 % pred_elim_time: 0.
% 0.64/0.94 % out_proof_time: 0.001
% 0.64/0.94 % monotx_time: 0.
% 0.64/0.94 % subtype_inf_time: 0.
% 0.64/0.94 % unif_index_cands_time: 0.
% 0.64/0.94 % unif_index_add_time: 0.
% 0.64/0.94 % total_time: 0.456
% 0.64/0.94 % num_of_symbols: 67
% 0.64/0.94 % num_of_terms: 573
% 0.64/0.94
% 0.64/0.94 % ------ Propositional Solver
% 0.64/0.94
% 0.64/0.94 % prop_solver_calls: 1
% 0.64/0.94 % prop_fast_solver_calls: 56
% 0.64/0.94 % prop_num_of_clauses: 199
% 0.64/0.94 % prop_preprocess_simplified: 653
% 0.64/0.94 % prop_fo_subsumed: 0
% 0.64/0.94 % prop_solver_time: 0.
% 0.64/0.94 % prop_fast_solver_time: 0.
% 0.64/0.94 % prop_unsat_core_time: 0.
% 0.64/0.94
% 0.64/0.94 % ------ QBF
% 0.64/0.94
% 0.64/0.94 % qbf_q_res: 0
% 0.64/0.94 % qbf_num_tautologies: 0
% 0.64/0.94 % qbf_prep_cycles: 0
% 0.64/0.94
% 0.64/0.94 % ------ BMC1
% 0.64/0.94
% 0.64/0.94 % bmc1_current_bound: -1
% 0.64/0.94 % bmc1_last_solved_bound: -1
% 0.64/0.94 % bmc1_unsat_core_size: -1
% 0.64/0.94 % bmc1_unsat_core_parents_size: -1
% 0.64/0.94 % bmc1_merge_next_fun: 0
% 0.64/0.94 % bmc1_unsat_core_clauses_time: 0.
% 0.64/0.94
% 0.64/0.94 % ------ Instantiation
% 0.64/0.94
% 0.64/0.94 % inst_num_of_clauses: 189
% 0.64/0.94 % inst_num_in_passive: 0
% 0.64/0.94 % inst_num_in_active: 0
% 0.64/0.94 % inst_num_in_unprocessed: 189
% 0.64/0.94 % inst_num_of_loops: 0
% 0.64/0.94 % inst_num_of_learning_restarts: 0
% 0.64/0.94 % inst_num_moves_active_passive: 0
% 0.64/0.94 % inst_lit_activity: 0
% 0.64/0.94 % inst_lit_activity_moves: 0
% 0.64/0.94 % inst_num_tautologies: 0
% 0.64/0.94 % inst_num_prop_implied: 0
% 0.64/0.94 % inst_num_existing_simplified: 0
% 0.64/0.94 % inst_num_eq_res_simplified: 0
% 0.64/0.94 % inst_num_child_elim: 0
% 0.64/0.94 % inst_num_of_dismatching_blockings: 0
% 0.64/0.94 % inst_num_of_non_proper_insts: 0
% 0.64/0.94 % inst_num_of_duplicates: 0
% 0.64/0.94 % inst_inst_num_from_inst_to_res: 0
% 0.64/0.94 % inst_dismatching_checking_time: 0.
% 0.64/0.94
% 0.64/0.94 % ------ Resolution
% 0.64/0.94
% 0.64/0.94 % res_num_of_clauses: 260
% 0.64/0.94 % res_num_in_passive: 53
% 0.64/0.94 % res_num_in_active: 96
% 0.64/0.94 % res_num_of_loops: 5
% 0.64/0.94 % res_forward_subset_subsumed: 89
% 0.64/0.94 % res_backward_subset_subsumed: 0
% 0.64/0.94 % res_forward_subsumed: 0
% 0.64/0.94 % res_backward_subsumed: 0
% 0.64/0.94 % res_forward_subsumption_resolution: 2
% 0.64/0.94 % res_backward_subsumption_resolution: 0
% 0.64/0.94 % res_clause_to_clause_subsumption: 2
% 0.64/0.94 % res_orphan_elimination: 0
% 0.64/0.94 % res_tautology_del: 0
% 0.64/0.94 % res_num_eq_res_simplified: 0
% 0.64/0.94 % res_num_sel_changes: 0
% 0.64/0.94 % res_moves_from_active_to_pass: 0
% 0.64/0.94
% 0.64/0.94 % Status Unsatisfiable
% 0.64/0.94 % SZS status Theorem
% 0.64/0.94 % SZS output start CNFRefutation
% 0.64/0.94 % Axioms transformation by autotheo
% 0.64/0.94 % Orienting (remaining) axiom formulas using strategy ClausalAll
% 0.64/0.94 % CNF of (remaining) axioms:
% 0.64/0.94 % Start CNF derivation
% 0.64/0.94 fof(c_0_0, axiom, (![X3]:![X4]:![X7]:![X1]:(member(ordered_pair(ordered_pair(X3,X4),X7),flip(X1))<=>(member(ordered_pair(ordered_pair(X3,X4),X7),cross_product(cross_product(universal_class,universal_class),universal_class))&member(ordered_pair(ordered_pair(X4,X3),X7),X1)))), file('<stdin>', flip_defn)).
% 0.64/0.94 fof(c_0_1, axiom, (![X1]:![X3]:![X4]:![X7]:(member(ordered_pair(ordered_pair(X3,X4),X7),rotate(X1))<=>(member(ordered_pair(ordered_pair(X3,X4),X7),cross_product(cross_product(universal_class,universal_class),universal_class))&member(ordered_pair(ordered_pair(X4,X7),X3),X1)))), file('<stdin>', rotate_defn)).
% 0.64/0.94 fof(c_0_2, axiom, (![X6]:![X8]:![X3]:![X4]:(member(ordered_pair(X3,X4),compose(X8,X6))<=>(member(X3,universal_class)&member(X4,image(X8,image(X6,singleton(X3))))))), file('<stdin>', compose_defn2)).
% 0.64/0.94 fof(c_0_3, axiom, (![X9]:(function(X9)<=>(subclass(X9,cross_product(universal_class,universal_class))&subclass(compose(X9,inverse(X9)),identity_relation)))), file('<stdin>', function_defn)).
% 0.64/0.94 fof(c_0_4, axiom, (![X1]:![X5]:(member(X5,domain_of(X1))<=>(member(X5,universal_class)&restrict(X1,singleton(X5),universal_class)!=null_class))), file('<stdin>', domain_of)).
% 0.64/0.94 fof(c_0_5, axiom, (![X1]:![X6]:image(X6,X1)=range_of(restrict(X6,X1,universal_class))), file('<stdin>', image_defn)).
% 0.64/0.94 fof(c_0_6, axiom, (![X3]:![X4]:![X1]:![X2]:(member(ordered_pair(X3,X4),cross_product(X1,X2))<=>(member(X3,X1)&member(X4,X2)))), file('<stdin>', cross_product_defn)).
% 0.64/0.94 fof(c_0_7, axiom, (![X1]:![X6]:![X2]:restrict(X6,X1,X2)=intersection(X6,cross_product(X1,X2))), file('<stdin>', restrict_defn)).
% 0.64/0.94 fof(c_0_8, axiom, (![X1]:![X2]:![X5]:(member(X5,union(X1,X2))<=>(member(X5,X1)|member(X5,X2)))), file('<stdin>', union_defn)).
% 0.64/0.94 fof(c_0_9, axiom, (![X1]:![X2]:![X5]:(member(X5,cross_product(X1,X2))=>X5=ordered_pair(first(X5),second(X5)))), file('<stdin>', cross_product)).
% 0.64/0.94 fof(c_0_10, axiom, (![X1]:![X2]:(member(ordered_pair(X1,X2),successor_relation)<=>(member(X1,universal_class)&(member(X2,universal_class)&successor(X1)=X2)))), file('<stdin>', successor_relation_defn2)).
% 0.64/0.94 fof(c_0_11, axiom, (![X1]:![X2]:![X5]:(member(X5,intersection(X1,X2))<=>(member(X5,X1)&member(X5,X2)))), file('<stdin>', intersection)).
% 0.64/0.94 fof(c_0_12, axiom, (![X1]:(inductive(X1)<=>(member(null_class,X1)&subclass(image(successor_relation,X1),X1)))), file('<stdin>', inductive_defn)).
% 0.64/0.94 fof(c_0_13, axiom, (![X1]:subclass(flip(X1),cross_product(cross_product(universal_class,universal_class),universal_class))), file('<stdin>', flip)).
% 0.64/0.94 fof(c_0_14, axiom, (![X1]:subclass(rotate(X1),cross_product(cross_product(universal_class,universal_class),universal_class))), file('<stdin>', rotate)).
% 0.64/0.94 fof(c_0_15, axiom, (![X1]:![X2]:(member(ordered_pair(X1,X2),element_relation)<=>(member(X2,universal_class)&member(X1,X2)))), file('<stdin>', element_relation_defn)).
% 0.64/0.94 fof(c_0_16, axiom, (![X1]:![X2]:(subclass(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2)))), file('<stdin>', subclass_defn)).
% 0.64/0.94 fof(c_0_17, axiom, (![X3]:![X1]:![X2]:(member(X3,unordered_pair(X1,X2))<=>(member(X3,universal_class)&(X3=X1|X3=X2)))), file('<stdin>', unordered_pair_defn)).
% 0.64/0.94 fof(c_0_18, axiom, (![X3]:![X1]:(member(X3,sum_class(X1))<=>?[X2]:(member(X3,X2)&member(X2,X1)))), file('<stdin>', sum_class_defn)).
% 0.64/0.94 fof(c_0_19, axiom, (![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2)))), file('<stdin>', ordered_pair_defn)).
% 0.64/0.94 fof(c_0_20, axiom, (![X1]:![X2]:((member(X1,universal_class)&member(X2,universal_class))=>(first(ordered_pair(X1,X2))=X1&second(ordered_pair(X1,X2))=X2))), file('<stdin>', first_second)).
% 0.64/0.94 fof(c_0_21, axiom, (![X1]:![X2]:(disjoint(X1,X2)<=>![X3]:~((member(X3,X1)&member(X3,X2))))), file('<stdin>', disjoint_defn)).
% 0.64/0.94 fof(c_0_22, axiom, (![X1]:![X9]:((member(X1,universal_class)&function(X9))=>member(image(X9,X1),universal_class))), file('<stdin>', replacement)).
% 0.64/0.94 fof(c_0_23, axiom, (![X3]:![X1]:(member(X3,power_class(X1))<=>(member(X3,universal_class)&subclass(X3,X1)))), file('<stdin>', power_class_defn)).
% 0.64/0.94 fof(c_0_24, axiom, (![X6]:![X8]:subclass(compose(X8,X6),cross_product(universal_class,universal_class))), file('<stdin>', compose_defn1)).
% 0.64/0.94 fof(c_0_25, axiom, (![X2]:inverse(X2)=domain_of(flip(cross_product(X2,universal_class)))), file('<stdin>', inverse_defn)).
% 0.64/0.94 fof(c_0_26, axiom, (?[X9]:(function(X9)&![X2]:(member(X2,universal_class)=>(X2=null_class|member(apply(X9,X2),X2))))), file('<stdin>', choice)).
% 0.64/0.94 fof(c_0_27, axiom, (![X5]:(member(X5,identity_relation)<=>?[X1]:(member(X1,universal_class)&X5=ordered_pair(X1,X1)))), file('<stdin>', identity_relation)).
% 0.64/0.94 fof(c_0_28, axiom, (![X9]:![X2]:apply(X9,X2)=sum_class(image(X9,singleton(X2)))), file('<stdin>', apply_defn)).
% 0.64/0.94 fof(c_0_29, axiom, (![X1]:![X5]:(member(X5,complement(X1))<=>(member(X5,universal_class)&~(member(X5,X1))))), file('<stdin>', complement)).
% 0.64/0.94 fof(c_0_30, axiom, (![X1]:![X2]:(X1=X2<=>(subclass(X1,X2)&subclass(X2,X1)))), file('<stdin>', extensionality)).
% 0.64/0.94 fof(c_0_31, axiom, (![X3]:(member(X3,universal_class)=>member(power_class(X3),universal_class))), file('<stdin>', power_class)).
% 0.64/0.94 fof(c_0_32, axiom, (![X1]:(member(X1,universal_class)=>member(sum_class(X1),universal_class))), file('<stdin>', sum_class)).
% 0.64/0.94 fof(c_0_33, axiom, (![X1]:![X2]:member(unordered_pair(X1,X2),universal_class)), file('<stdin>', unordered_pair)).
% 0.64/0.94 fof(c_0_34, axiom, (subclass(successor_relation,cross_product(universal_class,universal_class))), file('<stdin>', successor_relation_defn1)).
% 0.64/0.94 fof(c_0_35, axiom, (subclass(element_relation,cross_product(universal_class,universal_class))), file('<stdin>', element_relation)).
% 0.64/0.94 fof(c_0_36, axiom, (![X1]:successor(X1)=union(X1,singleton(X1))), file('<stdin>', successor_defn)).
% 0.64/0.94 fof(c_0_37, axiom, (![X1]:(X1!=null_class=>?[X3]:(member(X3,universal_class)&(member(X3,X1)&disjoint(X3,X1))))), file('<stdin>', regularity)).
% 0.64/0.94 fof(c_0_38, axiom, (![X1]:~(member(X1,null_class))), file('<stdin>', null_class_defn)).
% 0.64/0.94 fof(c_0_39, axiom, (?[X1]:(member(X1,universal_class)&(inductive(X1)&![X2]:(inductive(X2)=>subclass(X1,X2))))), file('<stdin>', infinity)).
% 0.64/0.94 fof(c_0_40, axiom, (![X1]:singleton(X1)=unordered_pair(X1,X1)), file('<stdin>', singleton_set_defn)).
% 0.64/0.94 fof(c_0_41, axiom, (![X5]:range_of(X5)=domain_of(inverse(X5))), file('<stdin>', range_of_defn)).
% 0.64/0.94 fof(c_0_42, axiom, (![X1]:subclass(X1,universal_class)), file('<stdin>', class_elements_are_sets)).
% 0.64/0.94 fof(c_0_43, axiom, (![X3]:![X4]:![X7]:![X1]:(member(ordered_pair(ordered_pair(X3,X4),X7),flip(X1))<=>(member(ordered_pair(ordered_pair(X3,X4),X7),cross_product(cross_product(universal_class,universal_class),universal_class))&member(ordered_pair(ordered_pair(X4,X3),X7),X1)))), c_0_0).
% 0.64/0.94 fof(c_0_44, axiom, (![X1]:![X3]:![X4]:![X7]:(member(ordered_pair(ordered_pair(X3,X4),X7),rotate(X1))<=>(member(ordered_pair(ordered_pair(X3,X4),X7),cross_product(cross_product(universal_class,universal_class),universal_class))&member(ordered_pair(ordered_pair(X4,X7),X3),X1)))), c_0_1).
% 0.64/0.94 fof(c_0_45, axiom, (![X6]:![X8]:![X3]:![X4]:(member(ordered_pair(X3,X4),compose(X8,X6))<=>(member(X3,universal_class)&member(X4,image(X8,image(X6,singleton(X3))))))), c_0_2).
% 0.64/0.94 fof(c_0_46, axiom, (![X9]:(function(X9)<=>(subclass(X9,cross_product(universal_class,universal_class))&subclass(compose(X9,inverse(X9)),identity_relation)))), c_0_3).
% 0.64/0.94 fof(c_0_47, axiom, (![X1]:![X5]:(member(X5,domain_of(X1))<=>(member(X5,universal_class)&restrict(X1,singleton(X5),universal_class)!=null_class))), c_0_4).
% 0.64/0.94 fof(c_0_48, axiom, (![X1]:![X6]:image(X6,X1)=range_of(restrict(X6,X1,universal_class))), c_0_5).
% 0.64/0.94 fof(c_0_49, axiom, (![X3]:![X4]:![X1]:![X2]:(member(ordered_pair(X3,X4),cross_product(X1,X2))<=>(member(X3,X1)&member(X4,X2)))), c_0_6).
% 0.64/0.94 fof(c_0_50, axiom, (![X1]:![X6]:![X2]:restrict(X6,X1,X2)=intersection(X6,cross_product(X1,X2))), c_0_7).
% 0.64/0.94 fof(c_0_51, axiom, (![X1]:![X2]:![X5]:(member(X5,union(X1,X2))<=>(member(X5,X1)|member(X5,X2)))), c_0_8).
% 0.64/0.94 fof(c_0_52, axiom, (![X1]:![X2]:![X5]:(member(X5,cross_product(X1,X2))=>X5=ordered_pair(first(X5),second(X5)))), c_0_9).
% 0.64/0.94 fof(c_0_53, axiom, (![X1]:![X2]:(member(ordered_pair(X1,X2),successor_relation)<=>(member(X1,universal_class)&(member(X2,universal_class)&successor(X1)=X2)))), c_0_10).
% 0.64/0.94 fof(c_0_54, axiom, (![X1]:![X2]:![X5]:(member(X5,intersection(X1,X2))<=>(member(X5,X1)&member(X5,X2)))), c_0_11).
% 0.64/0.94 fof(c_0_55, axiom, (![X1]:(inductive(X1)<=>(member(null_class,X1)&subclass(image(successor_relation,X1),X1)))), c_0_12).
% 0.64/0.94 fof(c_0_56, axiom, (![X1]:subclass(flip(X1),cross_product(cross_product(universal_class,universal_class),universal_class))), c_0_13).
% 0.64/0.94 fof(c_0_57, axiom, (![X1]:subclass(rotate(X1),cross_product(cross_product(universal_class,universal_class),universal_class))), c_0_14).
% 0.64/0.94 fof(c_0_58, axiom, (![X1]:![X2]:(member(ordered_pair(X1,X2),element_relation)<=>(member(X2,universal_class)&member(X1,X2)))), c_0_15).
% 0.64/0.94 fof(c_0_59, axiom, (![X1]:![X2]:(subclass(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2)))), c_0_16).
% 0.64/0.94 fof(c_0_60, axiom, (![X3]:![X1]:![X2]:(member(X3,unordered_pair(X1,X2))<=>(member(X3,universal_class)&(X3=X1|X3=X2)))), c_0_17).
% 0.64/0.94 fof(c_0_61, axiom, (![X3]:![X1]:(member(X3,sum_class(X1))<=>?[X2]:(member(X3,X2)&member(X2,X1)))), c_0_18).
% 0.64/0.94 fof(c_0_62, axiom, (![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2)))), c_0_19).
% 0.64/0.94 fof(c_0_63, axiom, (![X1]:![X2]:((member(X1,universal_class)&member(X2,universal_class))=>(first(ordered_pair(X1,X2))=X1&second(ordered_pair(X1,X2))=X2))), c_0_20).
% 0.64/0.94 fof(c_0_64, axiom, (![X1]:![X2]:(disjoint(X1,X2)<=>![X3]:~((member(X3,X1)&member(X3,X2))))), c_0_21).
% 0.64/0.94 fof(c_0_65, axiom, (![X1]:![X9]:((member(X1,universal_class)&function(X9))=>member(image(X9,X1),universal_class))), c_0_22).
% 0.64/0.94 fof(c_0_66, axiom, (![X3]:![X1]:(member(X3,power_class(X1))<=>(member(X3,universal_class)&subclass(X3,X1)))), c_0_23).
% 0.64/0.94 fof(c_0_67, axiom, (![X6]:![X8]:subclass(compose(X8,X6),cross_product(universal_class,universal_class))), c_0_24).
% 0.64/0.94 fof(c_0_68, axiom, (![X2]:inverse(X2)=domain_of(flip(cross_product(X2,universal_class)))), c_0_25).
% 0.64/0.94 fof(c_0_69, axiom, (?[X9]:(function(X9)&![X2]:(member(X2,universal_class)=>(X2=null_class|member(apply(X9,X2),X2))))), c_0_26).
% 0.64/0.94 fof(c_0_70, axiom, (![X5]:(member(X5,identity_relation)<=>?[X1]:(member(X1,universal_class)&X5=ordered_pair(X1,X1)))), c_0_27).
% 0.64/0.94 fof(c_0_71, axiom, (![X9]:![X2]:apply(X9,X2)=sum_class(image(X9,singleton(X2)))), c_0_28).
% 0.64/0.94 fof(c_0_72, plain, (![X1]:![X5]:(member(X5,complement(X1))<=>(member(X5,universal_class)&~member(X5,X1)))), inference(fof_simplification,[status(thm)],[c_0_29])).
% 0.64/0.94 fof(c_0_73, axiom, (![X1]:![X2]:(X1=X2<=>(subclass(X1,X2)&subclass(X2,X1)))), c_0_30).
% 0.64/0.94 fof(c_0_74, axiom, (![X3]:(member(X3,universal_class)=>member(power_class(X3),universal_class))), c_0_31).
% 0.64/0.94 fof(c_0_75, axiom, (![X1]:(member(X1,universal_class)=>member(sum_class(X1),universal_class))), c_0_32).
% 0.64/0.94 fof(c_0_76, axiom, (![X1]:![X2]:member(unordered_pair(X1,X2),universal_class)), c_0_33).
% 0.64/0.94 fof(c_0_77, axiom, (subclass(successor_relation,cross_product(universal_class,universal_class))), c_0_34).
% 0.64/0.94 fof(c_0_78, axiom, (subclass(element_relation,cross_product(universal_class,universal_class))), c_0_35).
% 0.64/0.94 fof(c_0_79, axiom, (![X1]:successor(X1)=union(X1,singleton(X1))), c_0_36).
% 0.64/0.94 fof(c_0_80, axiom, (![X1]:(X1!=null_class=>?[X3]:(member(X3,universal_class)&(member(X3,X1)&disjoint(X3,X1))))), c_0_37).
% 0.64/0.94 fof(c_0_81, plain, (![X1]:~member(X1,null_class)), inference(fof_simplification,[status(thm)],[c_0_38])).
% 0.64/0.94 fof(c_0_82, axiom, (?[X1]:(member(X1,universal_class)&(inductive(X1)&![X2]:(inductive(X2)=>subclass(X1,X2))))), c_0_39).
% 0.64/0.94 fof(c_0_83, axiom, (![X1]:singleton(X1)=unordered_pair(X1,X1)), c_0_40).
% 0.64/0.94 fof(c_0_84, axiom, (![X5]:range_of(X5)=domain_of(inverse(X5))), c_0_41).
% 0.64/0.94 fof(c_0_85, axiom, (![X1]:subclass(X1,universal_class)), c_0_42).
% 0.64/0.94 fof(c_0_86, plain, (![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:(((member(ordered_pair(ordered_pair(X8,X9),X10),cross_product(cross_product(universal_class,universal_class),universal_class))|~member(ordered_pair(ordered_pair(X8,X9),X10),flip(X11)))&(member(ordered_pair(ordered_pair(X9,X8),X10),X11)|~member(ordered_pair(ordered_pair(X8,X9),X10),flip(X11))))&((~member(ordered_pair(ordered_pair(X12,X13),X14),cross_product(cross_product(universal_class,universal_class),universal_class))|~member(ordered_pair(ordered_pair(X13,X12),X14),X15))|member(ordered_pair(ordered_pair(X12,X13),X14),flip(X15))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])])])])).
% 0.64/0.94 fof(c_0_87, plain, (![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:(((member(ordered_pair(ordered_pair(X9,X10),X11),cross_product(cross_product(universal_class,universal_class),universal_class))|~member(ordered_pair(ordered_pair(X9,X10),X11),rotate(X8)))&(member(ordered_pair(ordered_pair(X10,X11),X9),X8)|~member(ordered_pair(ordered_pair(X9,X10),X11),rotate(X8))))&((~member(ordered_pair(ordered_pair(X13,X14),X15),cross_product(cross_product(universal_class,universal_class),universal_class))|~member(ordered_pair(ordered_pair(X14,X15),X13),X12))|member(ordered_pair(ordered_pair(X13,X14),X15),rotate(X12))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])])])])).
% 0.64/0.94 fof(c_0_88, plain, (![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:(((member(X11,universal_class)|~member(ordered_pair(X11,X12),compose(X10,X9)))&(member(X12,image(X10,image(X9,singleton(X11))))|~member(ordered_pair(X11,X12),compose(X10,X9))))&((~member(X15,universal_class)|~member(X16,image(X14,image(X13,singleton(X15)))))|member(ordered_pair(X15,X16),compose(X14,X13))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])])])])).
% 0.64/0.94 fof(c_0_89, plain, (![X10]:![X11]:(((subclass(X10,cross_product(universal_class,universal_class))|~function(X10))&(subclass(compose(X10,inverse(X10)),identity_relation)|~function(X10)))&((~subclass(X11,cross_product(universal_class,universal_class))|~subclass(compose(X11,inverse(X11)),identity_relation))|function(X11)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])])])])).
% 0.64/0.94 fof(c_0_90, plain, (![X6]:![X7]:![X8]:![X9]:(((member(X7,universal_class)|~member(X7,domain_of(X6)))&(restrict(X6,singleton(X7),universal_class)!=null_class|~member(X7,domain_of(X6))))&((~member(X9,universal_class)|restrict(X8,singleton(X9),universal_class)=null_class)|member(X9,domain_of(X8))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])])])])).
% 0.64/0.94 fof(c_0_91, plain, (![X7]:![X8]:image(X8,X7)=range_of(restrict(X8,X7,universal_class))), inference(variable_rename,[status(thm)],[c_0_48])).
% 0.64/0.94 fof(c_0_92, plain, (![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:(((member(X5,X7)|~member(ordered_pair(X5,X6),cross_product(X7,X8)))&(member(X6,X8)|~member(ordered_pair(X5,X6),cross_product(X7,X8))))&((~member(X9,X11)|~member(X10,X12))|member(ordered_pair(X9,X10),cross_product(X11,X12))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])])])])])).
% 0.64/0.94 fof(c_0_93, plain, (![X7]:![X8]:![X9]:restrict(X8,X7,X9)=intersection(X8,cross_product(X7,X9))), inference(variable_rename,[status(thm)],[c_0_50])).
% 0.64/0.94 fof(c_0_94, plain, (![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:((~member(X8,union(X6,X7))|(member(X8,X6)|member(X8,X7)))&((~member(X11,X9)|member(X11,union(X9,X10)))&(~member(X11,X10)|member(X11,union(X9,X10)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])])])])).
% 0.64/0.94 fof(c_0_95, plain, (![X6]:![X7]:![X8]:(~member(X8,cross_product(X6,X7))|X8=ordered_pair(first(X8),second(X8)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_52])])).
% 0.64/0.94 fof(c_0_96, plain, (![X3]:![X4]:![X5]:![X6]:(((member(X3,universal_class)|~member(ordered_pair(X3,X4),successor_relation))&((member(X4,universal_class)|~member(ordered_pair(X3,X4),successor_relation))&(successor(X3)=X4|~member(ordered_pair(X3,X4),successor_relation))))&((~member(X5,universal_class)|(~member(X6,universal_class)|successor(X5)!=X6))|member(ordered_pair(X5,X6),successor_relation)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_53])])])])])).
% 0.64/0.94 fof(c_0_97, plain, (![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:(((member(X8,X6)|~member(X8,intersection(X6,X7)))&(member(X8,X7)|~member(X8,intersection(X6,X7))))&((~member(X11,X9)|~member(X11,X10))|member(X11,intersection(X9,X10))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])])])])])).
% 0.64/0.94 fof(c_0_98, plain, (![X2]:![X3]:(((member(null_class,X2)|~inductive(X2))&(subclass(image(successor_relation,X2),X2)|~inductive(X2)))&((~member(null_class,X3)|~subclass(image(successor_relation,X3),X3))|inductive(X3)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_55])])])])])).
% 0.64/0.94 fof(c_0_99, plain, (![X2]:subclass(flip(X2),cross_product(cross_product(universal_class,universal_class),universal_class))), inference(variable_rename,[status(thm)],[c_0_56])).
% 0.64/0.94 fof(c_0_100, plain, (![X2]:subclass(rotate(X2),cross_product(cross_product(universal_class,universal_class),universal_class))), inference(variable_rename,[status(thm)],[c_0_57])).
% 0.64/0.94 fof(c_0_101, plain, (![X3]:![X4]:![X5]:![X6]:(((member(X4,universal_class)|~member(ordered_pair(X3,X4),element_relation))&(member(X3,X4)|~member(ordered_pair(X3,X4),element_relation)))&((~member(X6,universal_class)|~member(X5,X6))|member(ordered_pair(X5,X6),element_relation)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_58])])])])])).
% 0.64/0.94 fof(c_0_102, plain, (![X4]:![X5]:![X6]:![X7]:![X8]:((~subclass(X4,X5)|(~member(X6,X4)|member(X6,X5)))&((member(esk1_2(X7,X8),X7)|subclass(X7,X8))&(~member(esk1_2(X7,X8),X8)|subclass(X7,X8))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])])])])])])).
% 0.64/0.94 fof(c_0_103, plain, (![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:(((member(X4,universal_class)|~member(X4,unordered_pair(X5,X6)))&((X4=X5|X4=X6)|~member(X4,unordered_pair(X5,X6))))&(((X7!=X8|~member(X7,universal_class))|member(X7,unordered_pair(X8,X9)))&((X7!=X9|~member(X7,universal_class))|member(X7,unordered_pair(X8,X9)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])])])])])).
% 0.64/0.94 fof(c_0_104, plain, (![X4]:![X5]:![X7]:![X8]:![X9]:(((member(X4,esk3_2(X4,X5))|~member(X4,sum_class(X5)))&(member(esk3_2(X4,X5),X5)|~member(X4,sum_class(X5))))&((~member(X7,X9)|~member(X9,X8))|member(X7,sum_class(X8))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])])])])])).
% 0.64/0.94 fof(c_0_105, plain, (![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(singleton(X3),unordered_pair(X3,singleton(X4)))), inference(variable_rename,[status(thm)],[c_0_62])).
% 0.64/0.94 fof(c_0_106, plain, (![X3]:![X4]:((first(ordered_pair(X3,X4))=X3|(~member(X3,universal_class)|~member(X4,universal_class)))&(second(ordered_pair(X3,X4))=X4|(~member(X3,universal_class)|~member(X4,universal_class))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_63])])])).
% 0.64/0.94 fof(c_0_107, plain, (![X4]:![X5]:![X6]:![X7]:![X8]:((~disjoint(X4,X5)|(~member(X6,X4)|~member(X6,X5)))&((member(esk5_2(X7,X8),X7)|disjoint(X7,X8))&(member(esk5_2(X7,X8),X8)|disjoint(X7,X8))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_64])])])])])])).
% 0.64/0.94 fof(c_0_108, plain, (![X10]:![X11]:((~member(X10,universal_class)|~function(X11))|member(image(X11,X10),universal_class))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])])).
% 0.64/0.94 fof(c_0_109, plain, (![X4]:![X5]:![X6]:![X7]:(((member(X4,universal_class)|~member(X4,power_class(X5)))&(subclass(X4,X5)|~member(X4,power_class(X5))))&((~member(X6,universal_class)|~subclass(X6,X7))|member(X6,power_class(X7))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_66])])])])])).
% 0.64/0.94 fof(c_0_110, plain, (![X9]:![X10]:subclass(compose(X10,X9),cross_product(universal_class,universal_class))), inference(variable_rename,[status(thm)],[c_0_67])).
% 0.64/0.94 fof(c_0_111, plain, (![X3]:inverse(X3)=domain_of(flip(cross_product(X3,universal_class)))), inference(variable_rename,[status(thm)],[c_0_68])).
% 0.64/0.94 fof(c_0_112, plain, (![X11]:(function(esk7_0)&(~member(X11,universal_class)|(X11=null_class|member(apply(esk7_0,X11),X11))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_69])])])])).
% 0.64/0.94 fof(c_0_113, plain, (![X6]:![X8]:![X9]:(((member(esk4_1(X6),universal_class)|~member(X6,identity_relation))&(X6=ordered_pair(esk4_1(X6),esk4_1(X6))|~member(X6,identity_relation)))&((~member(X9,universal_class)|X8!=ordered_pair(X9,X9))|member(X8,identity_relation)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_70])])])])])])).
% 0.64/0.94 fof(c_0_114, plain, (![X10]:![X11]:apply(X10,X11)=sum_class(image(X10,singleton(X11)))), inference(variable_rename,[status(thm)],[c_0_71])).
% 0.64/0.94 fof(c_0_115, plain, (![X6]:![X7]:![X8]:![X9]:(((member(X7,universal_class)|~member(X7,complement(X6)))&(~member(X7,X6)|~member(X7,complement(X6))))&((~member(X9,universal_class)|member(X9,X8))|member(X9,complement(X8))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_72])])])])])).
% 0.64/0.94 fof(c_0_116, plain, (![X3]:![X4]:![X5]:![X6]:(((subclass(X3,X4)|X3!=X4)&(subclass(X4,X3)|X3!=X4))&((~subclass(X5,X6)|~subclass(X6,X5))|X5=X6))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_73])])])])])).
% 0.64/0.94 fof(c_0_117, plain, (![X4]:(~member(X4,universal_class)|member(power_class(X4),universal_class))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_74])])).
% 0.64/0.94 fof(c_0_118, plain, (![X2]:(~member(X2,universal_class)|member(sum_class(X2),universal_class))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_75])])).
% 0.64/0.94 fof(c_0_119, plain, (![X3]:![X4]:member(unordered_pair(X3,X4),universal_class)), inference(variable_rename,[status(thm)],[c_0_76])).
% 0.64/0.94 fof(c_0_120, axiom, (subclass(successor_relation,cross_product(universal_class,universal_class))), c_0_77).
% 0.64/0.94 fof(c_0_121, axiom, (subclass(element_relation,cross_product(universal_class,universal_class))), c_0_78).
% 0.64/0.94 fof(c_0_122, plain, (![X2]:successor(X2)=union(X2,singleton(X2))), inference(variable_rename,[status(thm)],[c_0_79])).
% 0.64/0.94 fof(c_0_123, plain, (![X4]:((member(esk6_1(X4),universal_class)|X4=null_class)&((member(esk6_1(X4),X4)|X4=null_class)&(disjoint(esk6_1(X4),X4)|X4=null_class)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_80])])])])).
% 0.64/0.94 fof(c_0_124, plain, (![X2]:~member(X2,null_class)), inference(variable_rename,[status(thm)],[c_0_81])).
% 0.64/0.94 fof(c_0_125, plain, (![X4]:(member(esk2_0,universal_class)&(inductive(esk2_0)&(~inductive(X4)|subclass(esk2_0,X4))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_82])])])])).
% 0.64/0.94 fof(c_0_126, plain, (![X2]:singleton(X2)=unordered_pair(X2,X2)), inference(variable_rename,[status(thm)],[c_0_83])).
% 0.64/0.94 fof(c_0_127, plain, (![X6]:range_of(X6)=domain_of(inverse(X6))), inference(variable_rename,[status(thm)],[c_0_84])).
% 0.64/0.94 fof(c_0_128, plain, (![X2]:subclass(X2,universal_class)), inference(variable_rename,[status(thm)],[c_0_85])).
% 0.64/0.94 cnf(c_0_129,plain,(member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))|~member(ordered_pair(ordered_pair(X2,X1),X3),X4)|~member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))), inference(split_conjunct,[status(thm)],[c_0_86])).
% 0.64/0.94 cnf(c_0_130,plain,(member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))|~member(ordered_pair(ordered_pair(X2,X3),X1),X4)|~member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))), inference(split_conjunct,[status(thm)],[c_0_87])).
% 0.64/0.94 cnf(c_0_131,plain,(member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))|~member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))), inference(split_conjunct,[status(thm)],[c_0_86])).
% 0.64/0.94 cnf(c_0_132,plain,(member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))|~member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))), inference(split_conjunct,[status(thm)],[c_0_87])).
% 0.64/0.94 cnf(c_0_133,plain,(member(ordered_pair(X1,X2),compose(X3,X4))|~member(X2,image(X3,image(X4,singleton(X1))))|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_88])).
% 0.64/0.94 cnf(c_0_134,plain,(member(ordered_pair(ordered_pair(X2,X1),X3),X4)|~member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))), inference(split_conjunct,[status(thm)],[c_0_86])).
% 0.64/0.94 cnf(c_0_135,plain,(member(ordered_pair(ordered_pair(X2,X3),X1),X4)|~member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))), inference(split_conjunct,[status(thm)],[c_0_87])).
% 0.64/0.94 cnf(c_0_136,plain,(member(X2,image(X3,image(X4,singleton(X1))))|~member(ordered_pair(X1,X2),compose(X3,X4))), inference(split_conjunct,[status(thm)],[c_0_88])).
% 0.64/0.94 cnf(c_0_137,plain,(function(X1)|~subclass(compose(X1,inverse(X1)),identity_relation)|~subclass(X1,cross_product(universal_class,universal_class))), inference(split_conjunct,[status(thm)],[c_0_89])).
% 0.64/0.94 cnf(c_0_138,plain,(~member(X1,domain_of(X2))|restrict(X2,singleton(X1),universal_class)!=null_class), inference(split_conjunct,[status(thm)],[c_0_90])).
% 0.64/0.94 cnf(c_0_139,plain,(image(X1,X2)=range_of(restrict(X1,X2,universal_class))), inference(split_conjunct,[status(thm)],[c_0_91])).
% 0.64/0.94 cnf(c_0_140,plain,(member(X1,X3)|~member(ordered_pair(X1,X2),cross_product(X3,X4))), inference(split_conjunct,[status(thm)],[c_0_92])).
% 0.64/0.94 cnf(c_0_141,plain,(member(X2,X4)|~member(ordered_pair(X1,X2),cross_product(X3,X4))), inference(split_conjunct,[status(thm)],[c_0_92])).
% 0.64/0.94 cnf(c_0_142,plain,(member(X1,universal_class)|~member(ordered_pair(X1,X2),compose(X3,X4))), inference(split_conjunct,[status(thm)],[c_0_88])).
% 0.64/0.94 cnf(c_0_143,plain,(member(ordered_pair(X1,X2),cross_product(X3,X4))|~member(X2,X4)|~member(X1,X3)), inference(split_conjunct,[status(thm)],[c_0_92])).
% 0.64/0.94 cnf(c_0_144,plain,(member(X1,domain_of(X2))|restrict(X2,singleton(X1),universal_class)=null_class|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_90])).
% 0.64/0.94 cnf(c_0_145,plain,(restrict(X1,X2,X3)=intersection(X1,cross_product(X2,X3))), inference(split_conjunct,[status(thm)],[c_0_93])).
% 0.64/0.94 cnf(c_0_146,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))), inference(split_conjunct,[status(thm)],[c_0_94])).
% 0.64/0.94 cnf(c_0_147,plain,(X1=ordered_pair(first(X1),second(X1))|~member(X1,cross_product(X2,X3))), inference(split_conjunct,[status(thm)],[c_0_95])).
% 0.64/0.94 cnf(c_0_148,plain,(member(ordered_pair(X1,X2),successor_relation)|successor(X1)!=X2|~member(X2,universal_class)|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_96])).
% 0.64/0.94 cnf(c_0_149,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_97])).
% 0.64/0.94 cnf(c_0_150,plain,(inductive(X1)|~subclass(image(successor_relation,X1),X1)|~member(null_class,X1)), inference(split_conjunct,[status(thm)],[c_0_98])).
% 0.64/0.94 cnf(c_0_151,plain,(subclass(flip(X1),cross_product(cross_product(universal_class,universal_class),universal_class))), inference(split_conjunct,[status(thm)],[c_0_99])).
% 0.64/0.94 cnf(c_0_152,plain,(subclass(rotate(X1),cross_product(cross_product(universal_class,universal_class),universal_class))), inference(split_conjunct,[status(thm)],[c_0_100])).
% 0.64/0.94 cnf(c_0_153,plain,(member(ordered_pair(X1,X2),element_relation)|~member(X1,X2)|~member(X2,universal_class)), inference(split_conjunct,[status(thm)],[c_0_101])).
% 0.64/0.94 cnf(c_0_154,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))), inference(split_conjunct,[status(thm)],[c_0_97])).
% 0.64/0.94 cnf(c_0_155,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))), inference(split_conjunct,[status(thm)],[c_0_97])).
% 0.64/0.94 cnf(c_0_156,plain,(subclass(X1,X2)|~member(esk1_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_102])).
% 0.64/0.94 cnf(c_0_157,plain,(member(X1,universal_class)|~member(X1,unordered_pair(X2,X3))), inference(split_conjunct,[status(thm)],[c_0_103])).
% 0.64/0.94 cnf(c_0_158,plain,(member(X1,X2)|~member(ordered_pair(X1,X2),element_relation)), inference(split_conjunct,[status(thm)],[c_0_101])).
% 0.64/0.94 cnf(c_0_159,plain,(member(X1,universal_class)|~member(ordered_pair(X1,X2),successor_relation)), inference(split_conjunct,[status(thm)],[c_0_96])).
% 0.64/0.94 cnf(c_0_160,plain,(member(X2,universal_class)|~member(ordered_pair(X1,X2),successor_relation)), inference(split_conjunct,[status(thm)],[c_0_96])).
% 0.64/0.94 cnf(c_0_161,plain,(member(X2,universal_class)|~member(ordered_pair(X1,X2),element_relation)), inference(split_conjunct,[status(thm)],[c_0_101])).
% 0.64/0.94 cnf(c_0_162,plain,(member(X1,esk3_2(X1,X2))|~member(X1,sum_class(X2))), inference(split_conjunct,[status(thm)],[c_0_104])).
% 0.64/0.94 cnf(c_0_163,plain,(member(esk3_2(X1,X2),X2)|~member(X1,sum_class(X2))), inference(split_conjunct,[status(thm)],[c_0_104])).
% 0.64/0.94 cnf(c_0_164,plain,(ordered_pair(X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2)))), inference(split_conjunct,[status(thm)],[c_0_105])).
% 0.64/0.94 cnf(c_0_165,plain,(first(ordered_pair(X2,X1))=X2|~member(X1,universal_class)|~member(X2,universal_class)), inference(split_conjunct,[status(thm)],[c_0_106])).
% 0.64/0.94 cnf(c_0_166,plain,(second(ordered_pair(X2,X1))=X1|~member(X1,universal_class)|~member(X2,universal_class)), inference(split_conjunct,[status(thm)],[c_0_106])).
% 0.64/0.94 cnf(c_0_167,plain,(~member(X1,X2)|~member(X1,X3)|~disjoint(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_107])).
% 0.64/0.94 cnf(c_0_168,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))), inference(split_conjunct,[status(thm)],[c_0_103])).
% 0.64/0.94 cnf(c_0_169,plain,(member(image(X1,X2),universal_class)|~function(X1)|~member(X2,universal_class)), inference(split_conjunct,[status(thm)],[c_0_108])).
% 0.64/0.94 cnf(c_0_170,plain,(successor(X1)=X2|~member(ordered_pair(X1,X2),successor_relation)), inference(split_conjunct,[status(thm)],[c_0_96])).
% 0.64/0.94 cnf(c_0_171,plain,(member(X1,sum_class(X2))|~member(X3,X2)|~member(X1,X3)), inference(split_conjunct,[status(thm)],[c_0_104])).
% 0.64/0.94 cnf(c_0_172,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_103])).
% 0.64/0.94 cnf(c_0_173,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X3), inference(split_conjunct,[status(thm)],[c_0_103])).
% 0.64/0.94 cnf(c_0_174,plain,(member(X1,power_class(X2))|~subclass(X1,X2)|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_109])).
% 0.64/0.94 cnf(c_0_175,plain,(member(X1,union(X2,X3))|~member(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_94])).
% 0.64/0.94 cnf(c_0_176,plain,(member(X1,union(X2,X3))|~member(X1,X3)), inference(split_conjunct,[status(thm)],[c_0_94])).
% 0.64/0.94 cnf(c_0_177,plain,(subclass(compose(X1,X2),cross_product(universal_class,universal_class))), inference(split_conjunct,[status(thm)],[c_0_110])).
% 0.64/0.94 cnf(c_0_178,plain,(inverse(X1)=domain_of(flip(cross_product(X1,universal_class)))), inference(split_conjunct,[status(thm)],[c_0_111])).
% 0.64/0.94 cnf(c_0_179,plain,(member(X1,X2)|~member(X1,X3)|~subclass(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_102])).
% 0.64/0.94 cnf(c_0_180,plain,(member(apply(esk7_0,X1),X1)|X1=null_class|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_112])).
% 0.64/0.94 cnf(c_0_181,plain,(subclass(compose(X1,inverse(X1)),identity_relation)|~function(X1)), inference(split_conjunct,[status(thm)],[c_0_89])).
% 0.64/0.94 cnf(c_0_182,plain,(member(X1,identity_relation)|X1!=ordered_pair(X2,X2)|~member(X2,universal_class)), inference(split_conjunct,[status(thm)],[c_0_113])).
% 0.64/0.94 cnf(c_0_183,plain,(apply(X1,X2)=sum_class(image(X1,singleton(X2)))), inference(split_conjunct,[status(thm)],[c_0_114])).
% 0.64/0.94 cnf(c_0_184,plain,(member(X1,complement(X2))|member(X1,X2)|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_115])).
% 0.64/0.94 cnf(c_0_185,plain,(~member(X1,complement(X2))|~member(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_115])).
% 0.64/0.94 cnf(c_0_186,plain,(disjoint(X1,X2)|member(esk5_2(X1,X2),X1)), inference(split_conjunct,[status(thm)],[c_0_107])).
% 0.64/0.94 cnf(c_0_187,plain,(disjoint(X1,X2)|member(esk5_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_107])).
% 0.64/0.94 cnf(c_0_188,plain,(subclass(X1,X2)|member(esk1_2(X1,X2),X1)), inference(split_conjunct,[status(thm)],[c_0_102])).
% 0.64/0.94 cnf(c_0_189,plain,(X1=ordered_pair(esk4_1(X1),esk4_1(X1))|~member(X1,identity_relation)), inference(split_conjunct,[status(thm)],[c_0_113])).
% 0.64/0.94 cnf(c_0_190,plain,(X1=X2|~subclass(X2,X1)|~subclass(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_116])).
% 0.64/0.94 cnf(c_0_191,plain,(subclass(X1,X2)|~member(X1,power_class(X2))), inference(split_conjunct,[status(thm)],[c_0_109])).
% 0.64/0.94 cnf(c_0_192,plain,(member(X1,universal_class)|~member(X1,power_class(X2))), inference(split_conjunct,[status(thm)],[c_0_109])).
% 0.64/0.94 cnf(c_0_193,plain,(member(X1,universal_class)|~member(X1,domain_of(X2))), inference(split_conjunct,[status(thm)],[c_0_90])).
% 0.64/0.94 cnf(c_0_194,plain,(member(X1,universal_class)|~member(X1,complement(X2))), inference(split_conjunct,[status(thm)],[c_0_115])).
% 0.64/0.94 cnf(c_0_195,plain,(subclass(image(successor_relation,X1),X1)|~inductive(X1)), inference(split_conjunct,[status(thm)],[c_0_98])).
% 0.64/0.94 cnf(c_0_196,plain,(subclass(X1,cross_product(universal_class,universal_class))|~function(X1)), inference(split_conjunct,[status(thm)],[c_0_89])).
% 0.64/0.94 cnf(c_0_197,plain,(member(esk4_1(X1),universal_class)|~member(X1,identity_relation)), inference(split_conjunct,[status(thm)],[c_0_113])).
% 0.64/0.94 cnf(c_0_198,plain,(member(power_class(X1),universal_class)|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_117])).
% 0.64/0.94 cnf(c_0_199,plain,(member(sum_class(X1),universal_class)|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_118])).
% 0.64/0.94 cnf(c_0_200,plain,(member(unordered_pair(X1,X2),universal_class)), inference(split_conjunct,[status(thm)],[c_0_119])).
% 0.64/0.94 cnf(c_0_201,plain,(subclass(successor_relation,cross_product(universal_class,universal_class))), inference(split_conjunct,[status(thm)],[c_0_120])).
% 0.64/0.94 cnf(c_0_202,plain,(subclass(element_relation,cross_product(universal_class,universal_class))), inference(split_conjunct,[status(thm)],[c_0_121])).
% 0.64/0.94 cnf(c_0_203,plain,(successor(X1)=union(X1,singleton(X1))), inference(split_conjunct,[status(thm)],[c_0_122])).
% 0.64/0.94 cnf(c_0_204,plain,(X1=null_class|member(esk6_1(X1),X1)), inference(split_conjunct,[status(thm)],[c_0_123])).
% 0.64/0.94 cnf(c_0_205,plain,(X1=null_class|disjoint(esk6_1(X1),X1)), inference(split_conjunct,[status(thm)],[c_0_123])).
% 0.64/0.94 cnf(c_0_206,plain,(X1=null_class|member(esk6_1(X1),universal_class)), inference(split_conjunct,[status(thm)],[c_0_123])).
% 0.64/0.94 cnf(c_0_207,plain,(~member(X1,null_class)), inference(split_conjunct,[status(thm)],[c_0_124])).
% 0.64/0.94 cnf(c_0_208,plain,(subclass(esk2_0,X1)|~inductive(X1)), inference(split_conjunct,[status(thm)],[c_0_125])).
% 0.64/0.94 cnf(c_0_209,plain,(member(null_class,X1)|~inductive(X1)), inference(split_conjunct,[status(thm)],[c_0_98])).
% 0.64/0.94 cnf(c_0_210,plain,(singleton(X1)=unordered_pair(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_126])).
% 0.64/0.94 cnf(c_0_211,plain,(subclass(X1,X2)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_116])).
% 0.64/0.94 cnf(c_0_212,plain,(subclass(X2,X1)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_116])).
% 0.64/0.94 cnf(c_0_213,plain,(range_of(X1)=domain_of(inverse(X1))), inference(split_conjunct,[status(thm)],[c_0_127])).
% 0.64/0.94 cnf(c_0_214,plain,(subclass(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_128])).
% 0.64/0.94 cnf(c_0_215,plain,(member(esk2_0,universal_class)), inference(split_conjunct,[status(thm)],[c_0_125])).
% 0.64/0.94 cnf(c_0_216,plain,(function(esk7_0)), inference(split_conjunct,[status(thm)],[c_0_112])).
% 0.64/0.94 cnf(c_0_217,plain,(inductive(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_125])).
% 0.64/0.94 cnf(c_0_218,plain,(member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))|~member(ordered_pair(ordered_pair(X2,X1),X3),X4)|~member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))), c_0_129, ['final']).
% 0.64/0.94 cnf(c_0_219,plain,(member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))|~member(ordered_pair(ordered_pair(X2,X3),X1),X4)|~member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))), c_0_130, ['final']).
% 0.64/0.94 cnf(c_0_220,plain,(member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))|~member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))), c_0_131, ['final']).
% 0.64/0.94 cnf(c_0_221,plain,(member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))|~member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))), c_0_132, ['final']).
% 0.64/0.94 cnf(c_0_222,plain,(member(ordered_pair(X1,X2),compose(X3,X4))|~member(X2,image(X3,image(X4,singleton(X1))))|~member(X1,universal_class)), c_0_133, ['final']).
% 0.64/0.94 cnf(c_0_223,plain,(member(ordered_pair(ordered_pair(X2,X1),X3),X4)|~member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))), c_0_134, ['final']).
% 0.64/0.94 cnf(c_0_224,plain,(member(ordered_pair(ordered_pair(X2,X3),X1),X4)|~member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))), c_0_135, ['final']).
% 0.64/0.94 cnf(c_0_225,plain,(member(X2,image(X3,image(X4,singleton(X1))))|~member(ordered_pair(X1,X2),compose(X3,X4))), c_0_136, ['final']).
% 0.64/0.94 cnf(c_0_226,plain,(function(X1)|~subclass(compose(X1,inverse(X1)),identity_relation)|~subclass(X1,cross_product(universal_class,universal_class))), c_0_137, ['final']).
% 0.64/0.94 cnf(c_0_227,plain,(~member(X1,domain_of(X2))|restrict(X2,singleton(X1),universal_class)!=null_class), c_0_138, ['final']).
% 0.64/0.94 cnf(c_0_228,plain,(range_of(restrict(X1,X2,universal_class))=image(X1,X2)), c_0_139, ['final']).
% 0.64/0.94 cnf(c_0_229,plain,(member(X1,X3)|~member(ordered_pair(X1,X2),cross_product(X3,X4))), c_0_140, ['final']).
% 0.64/0.94 cnf(c_0_230,plain,(member(X2,X4)|~member(ordered_pair(X1,X2),cross_product(X3,X4))), c_0_141, ['final']).
% 0.64/0.94 cnf(c_0_231,plain,(member(X1,universal_class)|~member(ordered_pair(X1,X2),compose(X3,X4))), c_0_142, ['final']).
% 0.64/0.94 cnf(c_0_232,plain,(member(ordered_pair(X1,X2),cross_product(X3,X4))|~member(X2,X4)|~member(X1,X3)), c_0_143, ['final']).
% 0.64/0.94 cnf(c_0_233,plain,(member(X1,domain_of(X2))|restrict(X2,singleton(X1),universal_class)=null_class|~member(X1,universal_class)), c_0_144, ['final']).
% 0.64/0.94 cnf(c_0_234,plain,(intersection(X1,cross_product(X2,X3))=restrict(X1,X2,X3)), c_0_145, ['final']).
% 0.64/0.94 cnf(c_0_235,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))), c_0_146, ['final']).
% 0.64/0.94 cnf(c_0_236,plain,(ordered_pair(first(X1),second(X1))=X1|~member(X1,cross_product(X2,X3))), c_0_147, ['final']).
% 0.64/0.94 cnf(c_0_237,plain,(member(ordered_pair(X1,X2),successor_relation)|successor(X1)!=X2|~member(X2,universal_class)|~member(X1,universal_class)), c_0_148, ['final']).
% 0.64/0.94 cnf(c_0_238,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)), c_0_149, ['final']).
% 0.64/0.94 cnf(c_0_239,plain,(inductive(X1)|~subclass(image(successor_relation,X1),X1)|~member(null_class,X1)), c_0_150, ['final']).
% 0.64/0.94 cnf(c_0_240,plain,(subclass(flip(X1),cross_product(cross_product(universal_class,universal_class),universal_class))), c_0_151, ['final']).
% 0.64/0.94 cnf(c_0_241,plain,(subclass(rotate(X1),cross_product(cross_product(universal_class,universal_class),universal_class))), c_0_152, ['final']).
% 0.64/0.94 cnf(c_0_242,plain,(member(ordered_pair(X1,X2),element_relation)|~member(X1,X2)|~member(X2,universal_class)), c_0_153, ['final']).
% 0.64/0.94 cnf(c_0_243,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))), c_0_154, ['final']).
% 0.64/0.94 cnf(c_0_244,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))), c_0_155, ['final']).
% 0.64/0.94 cnf(c_0_245,plain,(subclass(X1,X2)|~member(esk1_2(X1,X2),X2)), c_0_156, ['final']).
% 0.64/0.94 cnf(c_0_246,plain,(member(X1,universal_class)|~member(X1,unordered_pair(X2,X3))), c_0_157, ['final']).
% 0.64/0.94 cnf(c_0_247,plain,(member(X1,X2)|~member(ordered_pair(X1,X2),element_relation)), c_0_158, ['final']).
% 0.64/0.94 cnf(c_0_248,plain,(member(X1,universal_class)|~member(ordered_pair(X1,X2),successor_relation)), c_0_159, ['final']).
% 0.64/0.94 cnf(c_0_249,plain,(member(X2,universal_class)|~member(ordered_pair(X1,X2),successor_relation)), c_0_160, ['final']).
% 0.64/0.94 cnf(c_0_250,plain,(member(X2,universal_class)|~member(ordered_pair(X1,X2),element_relation)), c_0_161, ['final']).
% 0.64/0.94 cnf(c_0_251,plain,(member(X1,esk3_2(X1,X2))|~member(X1,sum_class(X2))), c_0_162, ['final']).
% 0.64/0.94 cnf(c_0_252,plain,(member(esk3_2(X1,X2),X2)|~member(X1,sum_class(X2))), c_0_163, ['final']).
% 0.64/0.94 cnf(c_0_253,plain,(unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2)))=ordered_pair(X1,X2)), c_0_164, ['final']).
% 0.64/0.94 cnf(c_0_254,plain,(first(ordered_pair(X2,X1))=X2|~member(X1,universal_class)|~member(X2,universal_class)), c_0_165, ['final']).
% 0.64/0.94 cnf(c_0_255,plain,(second(ordered_pair(X2,X1))=X1|~member(X1,universal_class)|~member(X2,universal_class)), c_0_166, ['final']).
% 0.64/0.94 cnf(c_0_256,plain,(~member(X1,X2)|~member(X1,X3)|~disjoint(X3,X2)), c_0_167, ['final']).
% 0.64/0.94 cnf(c_0_257,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))), c_0_168, ['final']).
% 0.64/0.94 cnf(c_0_258,plain,(member(image(X1,X2),universal_class)|~function(X1)|~member(X2,universal_class)), c_0_169, ['final']).
% 0.64/0.94 cnf(c_0_259,plain,(successor(X1)=X2|~member(ordered_pair(X1,X2),successor_relation)), c_0_170, ['final']).
% 0.64/0.94 cnf(c_0_260,plain,(member(X1,sum_class(X2))|~member(X3,X2)|~member(X1,X3)), c_0_171, ['final']).
% 0.64/0.94 cnf(c_0_261,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X2), c_0_172, ['final']).
% 0.64/0.94 cnf(c_0_262,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X3), c_0_173, ['final']).
% 0.64/0.94 cnf(c_0_263,plain,(member(X1,power_class(X2))|~subclass(X1,X2)|~member(X1,universal_class)), c_0_174, ['final']).
% 0.64/0.94 cnf(c_0_264,plain,(member(X1,union(X2,X3))|~member(X1,X2)), c_0_175, ['final']).
% 0.64/0.94 cnf(c_0_265,plain,(member(X1,union(X2,X3))|~member(X1,X3)), c_0_176, ['final']).
% 0.64/0.94 cnf(c_0_266,plain,(subclass(compose(X1,X2),cross_product(universal_class,universal_class))), c_0_177, ['final']).
% 0.64/0.94 cnf(c_0_267,plain,(domain_of(flip(cross_product(X1,universal_class)))=inverse(X1)), c_0_178, ['final']).
% 0.64/0.94 cnf(c_0_268,plain,(member(X1,X2)|~member(X1,X3)|~subclass(X3,X2)), c_0_179, ['final']).
% 0.64/0.94 cnf(c_0_269,plain,(member(apply(esk7_0,X1),X1)|X1=null_class|~member(X1,universal_class)), c_0_180, ['final']).
% 0.64/0.94 cnf(c_0_270,plain,(subclass(compose(X1,inverse(X1)),identity_relation)|~function(X1)), c_0_181, ['final']).
% 0.64/0.94 cnf(c_0_271,plain,(member(X1,identity_relation)|X1!=ordered_pair(X2,X2)|~member(X2,universal_class)), c_0_182, ['final']).
% 0.64/0.94 cnf(c_0_272,plain,(sum_class(image(X1,singleton(X2)))=apply(X1,X2)), c_0_183, ['final']).
% 0.64/0.94 cnf(c_0_273,plain,(member(X1,complement(X2))|member(X1,X2)|~member(X1,universal_class)), c_0_184, ['final']).
% 0.64/0.94 cnf(c_0_274,plain,(~member(X1,complement(X2))|~member(X1,X2)), c_0_185, ['final']).
% 0.64/0.94 cnf(c_0_275,plain,(disjoint(X1,X2)|member(esk5_2(X1,X2),X1)), c_0_186, ['final']).
% 0.64/0.94 cnf(c_0_276,plain,(disjoint(X1,X2)|member(esk5_2(X1,X2),X2)), c_0_187, ['final']).
% 0.64/0.94 cnf(c_0_277,plain,(subclass(X1,X2)|member(esk1_2(X1,X2),X1)), c_0_188, ['final']).
% 0.64/0.94 cnf(c_0_278,plain,(ordered_pair(esk4_1(X1),esk4_1(X1))=X1|~member(X1,identity_relation)), c_0_189, ['final']).
% 0.64/0.94 cnf(c_0_279,plain,(X1=X2|~subclass(X2,X1)|~subclass(X1,X2)), c_0_190, ['final']).
% 0.64/0.94 cnf(c_0_280,plain,(subclass(X1,X2)|~member(X1,power_class(X2))), c_0_191, ['final']).
% 0.64/0.94 cnf(c_0_281,plain,(member(X1,universal_class)|~member(X1,power_class(X2))), c_0_192, ['final']).
% 0.64/0.94 cnf(c_0_282,plain,(member(X1,universal_class)|~member(X1,domain_of(X2))), c_0_193, ['final']).
% 0.64/0.94 cnf(c_0_283,plain,(member(X1,universal_class)|~member(X1,complement(X2))), c_0_194, ['final']).
% 0.64/0.94 cnf(c_0_284,plain,(subclass(image(successor_relation,X1),X1)|~inductive(X1)), c_0_195, ['final']).
% 0.64/0.94 cnf(c_0_285,plain,(subclass(X1,cross_product(universal_class,universal_class))|~function(X1)), c_0_196, ['final']).
% 0.64/0.94 cnf(c_0_286,plain,(member(esk4_1(X1),universal_class)|~member(X1,identity_relation)), c_0_197, ['final']).
% 0.64/0.94 cnf(c_0_287,plain,(member(power_class(X1),universal_class)|~member(X1,universal_class)), c_0_198, ['final']).
% 0.64/0.94 cnf(c_0_288,plain,(member(sum_class(X1),universal_class)|~member(X1,universal_class)), c_0_199, ['final']).
% 0.64/0.94 cnf(c_0_289,plain,(member(unordered_pair(X1,X2),universal_class)), c_0_200, ['final']).
% 0.64/0.94 cnf(c_0_290,plain,(subclass(successor_relation,cross_product(universal_class,universal_class))), c_0_201, ['final']).
% 0.64/0.94 cnf(c_0_291,plain,(subclass(element_relation,cross_product(universal_class,universal_class))), c_0_202, ['final']).
% 0.64/0.94 cnf(c_0_292,plain,(union(X1,singleton(X1))=successor(X1)), c_0_203, ['final']).
% 0.64/0.94 cnf(c_0_293,plain,(X1=null_class|member(esk6_1(X1),X1)), c_0_204, ['final']).
% 0.64/0.94 cnf(c_0_294,plain,(X1=null_class|disjoint(esk6_1(X1),X1)), c_0_205, ['final']).
% 0.64/0.94 cnf(c_0_295,plain,(X1=null_class|member(esk6_1(X1),universal_class)), c_0_206, ['final']).
% 0.64/0.94 cnf(c_0_296,plain,(~member(X1,null_class)), c_0_207, ['final']).
% 0.64/0.94 cnf(c_0_297,plain,(subclass(esk2_0,X1)|~inductive(X1)), c_0_208, ['final']).
% 0.64/0.94 cnf(c_0_298,plain,(member(null_class,X1)|~inductive(X1)), c_0_209, ['final']).
% 0.64/0.94 cnf(c_0_299,plain,(unordered_pair(X1,X1)=singleton(X1)), c_0_210, ['final']).
% 0.64/0.94 cnf(c_0_300,plain,(subclass(X1,X2)|X1!=X2), c_0_211, ['final']).
% 0.64/0.94 cnf(c_0_301,plain,(subclass(X2,X1)|X1!=X2), c_0_212, ['final']).
% 0.64/0.94 cnf(c_0_302,plain,(domain_of(inverse(X1))=range_of(X1)), c_0_213, ['final']).
% 0.64/0.94 cnf(c_0_303,plain,(subclass(X1,universal_class)), c_0_214, ['final']).
% 0.64/0.94 cnf(c_0_304,plain,(member(esk2_0,universal_class)), c_0_215, ['final']).
% 0.64/0.94 cnf(c_0_305,plain,(function(esk7_0)), c_0_216, ['final']).
% 0.64/0.94 cnf(c_0_306,plain,(inductive(esk2_0)), c_0_217, ['final']).
% 0.64/0.94 % End CNF derivation
% 0.64/0.94 % Generating one_way clauses for all literals in the CNF.
% 0.64/0.94 cnf(c_0_218_0, axiom, (member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
% 0.64/0.94 |(~member(ordered_pair(ordered_pair(X2,X1),X3),X4)
% 0.64/0.94 |~member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)))), inference(literals_permutation, [status(thm)], [c_0_218])).
% 0.64/0.94 cnf(c_0_218_1, axiom, ((~member(ordered_pair(ordered_pair(X2,X1),X3),X4)
% 0.64/0.94 |member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4)))
% 0.64/0.94 |~member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))), inference(literals_permutation, [status(thm)], [c_0_218])).
% 0.64/0.94 cnf(c_0_218_2, axiom, (~member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
% 0.64/0.94 |(~member(ordered_pair(ordered_pair(X2,X1),X3),X4)
% 0.64/0.94 |member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4)))), inference(literals_permutation, [status(thm)], [c_0_218])).
% 0.64/0.94 cnf(c_0_219_0, axiom, (member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
% 0.64/0.95 |(~member(ordered_pair(ordered_pair(X2,X3),X1),X4)
% 0.64/0.95 |~member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class)))), inference(literals_permutation, [status(thm)], [c_0_219])).
% 0.64/0.95 cnf(c_0_219_1, axiom, ((~member(ordered_pair(ordered_pair(X2,X3),X1),X4)
% 0.64/0.95 |member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4)))
% 0.64/0.95 |~member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))), inference(literals_permutation, [status(thm)], [c_0_219])).
% 0.64/0.95 cnf(c_0_219_2, axiom, (~member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
% 0.64/0.95 |(~member(ordered_pair(ordered_pair(X2,X3),X1),X4)
% 0.64/0.95 |member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4)))), inference(literals_permutation, [status(thm)], [c_0_219])).
% 0.64/0.95 cnf(c_0_220_0, axiom, (member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
% 0.64/0.95 |~member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))), inference(literals_permutation, [status(thm)], [c_0_220])).
% 0.64/0.95 cnf(c_0_220_1, axiom, (~member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
% 0.64/0.95 |member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))), inference(literals_permutation, [status(thm)], [c_0_220])).
% 0.64/0.95 cnf(c_0_221_0, axiom, (member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))
% 0.64/0.95 |~member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))), inference(literals_permutation, [status(thm)], [c_0_221])).
% 0.64/0.95 cnf(c_0_221_1, axiom, (~member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
% 0.64/0.95 |member(ordered_pair(ordered_pair(X1,X2),X3),cross_product(cross_product(universal_class,universal_class),universal_class))), inference(literals_permutation, [status(thm)], [c_0_221])).
% 0.64/0.95 cnf(c_0_222_0, axiom, (member(ordered_pair(X1,X2),compose(X3,X4))
% 0.64/0.95 |(~member(X2,image(X3,image(X4,singleton(X1))))
% 0.64/0.95 |~member(X1,universal_class))), inference(literals_permutation, [status(thm)], [c_0_222])).
% 0.64/0.95 cnf(c_0_222_1, axiom, ((~member(X2,image(X3,image(X4,singleton(X1))))
% 0.64/0.95 |member(ordered_pair(X1,X2),compose(X3,X4)))
% 0.64/0.95 |~member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_222])).
% 0.64/0.95 cnf(c_0_222_2, axiom, (~member(X1,universal_class)
% 0.64/0.95 |(~member(X2,image(X3,image(X4,singleton(X1))))
% 0.64/0.95 |member(ordered_pair(X1,X2),compose(X3,X4)))), inference(literals_permutation, [status(thm)], [c_0_222])).
% 0.64/0.95 cnf(c_0_223_0, axiom, (member(ordered_pair(ordered_pair(X2,X1),X3),X4)
% 0.64/0.95 |~member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))), inference(literals_permutation, [status(thm)], [c_0_223])).
% 0.64/0.95 cnf(c_0_223_1, axiom, (~member(ordered_pair(ordered_pair(X1,X2),X3),flip(X4))
% 0.64/0.95 |member(ordered_pair(ordered_pair(X2,X1),X3),X4)), inference(literals_permutation, [status(thm)], [c_0_223])).
% 0.64/0.95 cnf(c_0_224_0, axiom, (member(ordered_pair(ordered_pair(X2,X3),X1),X4)
% 0.64/0.95 |~member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))), inference(literals_permutation, [status(thm)], [c_0_224])).
% 0.64/0.95 cnf(c_0_224_1, axiom, (~member(ordered_pair(ordered_pair(X1,X2),X3),rotate(X4))
% 0.64/0.95 |member(ordered_pair(ordered_pair(X2,X3),X1),X4)), inference(literals_permutation, [status(thm)], [c_0_224])).
% 0.64/0.95 cnf(c_0_225_0, axiom, (member(X2,image(X3,image(X4,singleton(X1))))
% 0.64/0.95 |~member(ordered_pair(X1,X2),compose(X3,X4))), inference(literals_permutation, [status(thm)], [c_0_225])).
% 0.64/0.95 cnf(c_0_225_1, axiom, (~member(ordered_pair(X1,X2),compose(X3,X4))
% 0.64/0.95 |member(X2,image(X3,image(X4,singleton(X1))))), inference(literals_permutation, [status(thm)], [c_0_225])).
% 0.64/0.95 cnf(c_0_226_0, axiom, (function(X1)
% 0.64/0.95 |(~subclass(compose(X1,inverse(X1)),identity_relation)
% 0.64/0.95 |~subclass(X1,cross_product(universal_class,universal_class)))), inference(literals_permutation, [status(thm)], [c_0_226])).
% 0.64/0.95 cnf(c_0_226_1, axiom, ((~subclass(compose(X1,inverse(X1)),identity_relation)
% 0.64/0.95 |function(X1))
% 0.64/0.95 |~subclass(X1,cross_product(universal_class,universal_class))), inference(literals_permutation, [status(thm)], [c_0_226])).
% 0.64/0.95 cnf(c_0_226_2, axiom, (~subclass(X1,cross_product(universal_class,universal_class))
% 0.64/0.95 |(~subclass(compose(X1,inverse(X1)),identity_relation)
% 0.64/0.95 |function(X1))), inference(literals_permutation, [status(thm)], [c_0_226])).
% 0.64/0.95 cnf(c_0_227_0, axiom, (~member(X1,domain_of(X2))
% 0.64/0.95 |restrict(X2,singleton(X1),universal_class)!=null_class), inference(literals_permutation, [status(thm)], [c_0_227])).
% 0.64/0.95 cnf(c_0_227_1, axiom, (restrict(X2,singleton(X1),universal_class)!=null_class
% 0.64/0.95 |~member(X1,domain_of(X2))), inference(literals_permutation, [status(thm)], [c_0_227])).
% 0.64/0.95 cnf(c_0_229_0, axiom, (member(X1,X3)
% 0.64/0.95 |~member(ordered_pair(X1,X2),cross_product(X3,X4))), inference(literals_permutation, [status(thm)], [c_0_229])).
% 0.64/0.95 cnf(c_0_229_1, axiom, (~member(ordered_pair(X1,X2),cross_product(X3,X4))
% 0.64/0.95 |member(X1,X3)), inference(literals_permutation, [status(thm)], [c_0_229])).
% 0.64/0.95 cnf(c_0_230_0, axiom, (member(X2,X4)
% 0.64/0.95 |~member(ordered_pair(X1,X2),cross_product(X3,X4))), inference(literals_permutation, [status(thm)], [c_0_230])).
% 0.64/0.95 cnf(c_0_230_1, axiom, (~member(ordered_pair(X1,X2),cross_product(X3,X4))
% 0.64/0.95 |member(X2,X4)), inference(literals_permutation, [status(thm)], [c_0_230])).
% 0.64/0.95 cnf(c_0_231_0, axiom, (member(X1,universal_class)
% 0.64/0.95 |~member(ordered_pair(X1,X2),compose(X3,X4))), inference(literals_permutation, [status(thm)], [c_0_231])).
% 0.64/0.95 cnf(c_0_231_1, axiom, (~member(ordered_pair(X1,X2),compose(X3,X4))
% 0.64/0.95 |member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_231])).
% 0.64/0.95 cnf(c_0_232_0, axiom, (member(ordered_pair(X1,X2),cross_product(X3,X4))
% 0.64/0.95 |(~member(X2,X4)
% 0.64/0.95 |~member(X1,X3))), inference(literals_permutation, [status(thm)], [c_0_232])).
% 0.64/0.95 cnf(c_0_232_1, axiom, ((~member(X2,X4)
% 0.64/0.95 |member(ordered_pair(X1,X2),cross_product(X3,X4)))
% 0.64/0.95 |~member(X1,X3)), inference(literals_permutation, [status(thm)], [c_0_232])).
% 0.64/0.95 cnf(c_0_232_2, axiom, (~member(X1,X3)
% 0.64/0.95 |(~member(X2,X4)
% 0.64/0.95 |member(ordered_pair(X1,X2),cross_product(X3,X4)))), inference(literals_permutation, [status(thm)], [c_0_232])).
% 0.64/0.95 cnf(c_0_233_0, axiom, (member(X1,domain_of(X2))
% 0.64/0.95 |(restrict(X2,singleton(X1),universal_class)=null_class
% 0.64/0.95 |~member(X1,universal_class))), inference(literals_permutation, [status(thm)], [c_0_233])).
% 0.64/0.95 cnf(c_0_233_1, axiom, ((restrict(X2,singleton(X1),universal_class)=null_class
% 0.64/0.95 |member(X1,domain_of(X2)))
% 0.64/0.95 |~member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_233])).
% 0.64/0.95 cnf(c_0_233_2, axiom, (~member(X1,universal_class)
% 0.64/0.95 |(restrict(X2,singleton(X1),universal_class)=null_class
% 0.64/0.95 |member(X1,domain_of(X2)))), inference(literals_permutation, [status(thm)], [c_0_233])).
% 0.64/0.95 cnf(c_0_235_0, axiom, (member(X1,X2)
% 0.64/0.95 |(member(X1,X3)
% 0.64/0.95 |~member(X1,union(X3,X2)))), inference(literals_permutation, [status(thm)], [c_0_235])).
% 0.64/0.95 cnf(c_0_235_1, axiom, ((member(X1,X3)
% 0.64/0.95 |member(X1,X2))
% 0.64/0.95 |~member(X1,union(X3,X2))), inference(literals_permutation, [status(thm)], [c_0_235])).
% 0.64/0.95 cnf(c_0_235_2, axiom, (~member(X1,union(X3,X2))
% 0.64/0.95 |(member(X1,X3)
% 0.64/0.95 |member(X1,X2))), inference(literals_permutation, [status(thm)], [c_0_235])).
% 0.64/0.95 cnf(c_0_236_0, axiom, (ordered_pair(first(X1),second(X1))=X1
% 0.64/0.95 |~member(X1,cross_product(X2,X3))), inference(literals_permutation, [status(thm)], [c_0_236])).
% 0.64/0.95 cnf(c_0_236_1, axiom, (~member(X1,cross_product(X2,X3))
% 0.64/0.95 |ordered_pair(first(X1),second(X1))=X1), inference(literals_permutation, [status(thm)], [c_0_236])).
% 0.64/0.95 cnf(c_0_237_0, axiom, (member(ordered_pair(X1,X2),successor_relation)
% 0.64/0.95 |(successor(X1)!=X2
% 0.64/0.95 |(~member(X2,universal_class)
% 0.64/0.95 |~member(X1,universal_class)))), inference(literals_permutation, [status(thm)], [c_0_237])).
% 0.64/0.95 cnf(c_0_237_1, axiom, ((successor(X1)!=X2
% 0.64/0.95 |member(ordered_pair(X1,X2),successor_relation))
% 0.64/0.95 |(~member(X2,universal_class)
% 0.64/0.95 |~member(X1,universal_class))), inference(literals_permutation, [status(thm)], [c_0_237])).
% 0.64/0.95 cnf(c_0_237_2, axiom, ((~member(X2,universal_class)
% 0.64/0.95 |(successor(X1)!=X2
% 0.64/0.95 |member(ordered_pair(X1,X2),successor_relation)))
% 0.64/0.95 |~member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_237])).
% 0.64/0.95 cnf(c_0_237_3, axiom, (~member(X1,universal_class)
% 0.64/0.95 |(~member(X2,universal_class)
% 0.64/0.95 |(successor(X1)!=X2
% 0.64/0.95 |member(ordered_pair(X1,X2),successor_relation)))), inference(literals_permutation, [status(thm)], [c_0_237])).
% 0.64/0.95 cnf(c_0_238_0, axiom, (member(X1,intersection(X2,X3))
% 0.64/0.95 |(~member(X1,X3)
% 0.64/0.95 |~member(X1,X2))), inference(literals_permutation, [status(thm)], [c_0_238])).
% 0.64/0.95 cnf(c_0_238_1, axiom, ((~member(X1,X3)
% 0.64/0.95 |member(X1,intersection(X2,X3)))
% 0.64/0.95 |~member(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_238])).
% 0.64/0.95 cnf(c_0_238_2, axiom, (~member(X1,X2)
% 0.64/0.95 |(~member(X1,X3)
% 0.64/0.95 |member(X1,intersection(X2,X3)))), inference(literals_permutation, [status(thm)], [c_0_238])).
% 0.64/0.95 cnf(c_0_239_0, axiom, (inductive(X1)
% 0.64/0.95 |(~subclass(image(successor_relation,X1),X1)
% 0.64/0.95 |~member(null_class,X1))), inference(literals_permutation, [status(thm)], [c_0_239])).
% 0.64/0.95 cnf(c_0_239_1, axiom, ((~subclass(image(successor_relation,X1),X1)
% 0.64/0.95 |inductive(X1))
% 0.64/0.95 |~member(null_class,X1)), inference(literals_permutation, [status(thm)], [c_0_239])).
% 0.64/0.95 cnf(c_0_239_2, axiom, (~member(null_class,X1)
% 0.64/0.95 |(~subclass(image(successor_relation,X1),X1)
% 0.64/0.95 |inductive(X1))), inference(literals_permutation, [status(thm)], [c_0_239])).
% 0.64/0.95 cnf(c_0_242_0, axiom, (member(ordered_pair(X1,X2),element_relation)
% 0.64/0.95 |(~member(X1,X2)
% 0.64/0.95 |~member(X2,universal_class))), inference(literals_permutation, [status(thm)], [c_0_242])).
% 0.64/0.95 cnf(c_0_242_1, axiom, ((~member(X1,X2)
% 0.64/0.95 |member(ordered_pair(X1,X2),element_relation))
% 0.64/0.95 |~member(X2,universal_class)), inference(literals_permutation, [status(thm)], [c_0_242])).
% 0.64/0.95 cnf(c_0_242_2, axiom, (~member(X2,universal_class)
% 0.64/0.95 |(~member(X1,X2)
% 0.64/0.95 |member(ordered_pair(X1,X2),element_relation))), inference(literals_permutation, [status(thm)], [c_0_242])).
% 0.64/0.95 cnf(c_0_243_0, axiom, (member(X1,X2)
% 0.64/0.95 |~member(X1,intersection(X2,X3))), inference(literals_permutation, [status(thm)], [c_0_243])).
% 0.64/0.95 cnf(c_0_243_1, axiom, (~member(X1,intersection(X2,X3))
% 0.64/0.95 |member(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_243])).
% 0.64/0.95 cnf(c_0_244_0, axiom, (member(X1,X3)
% 0.64/0.95 |~member(X1,intersection(X2,X3))), inference(literals_permutation, [status(thm)], [c_0_244])).
% 0.64/0.95 cnf(c_0_244_1, axiom, (~member(X1,intersection(X2,X3))
% 0.64/0.95 |member(X1,X3)), inference(literals_permutation, [status(thm)], [c_0_244])).
% 0.64/0.95 cnf(c_0_245_0, axiom, (subclass(X1,X2)
% 0.64/0.95 |~member(sk1_esk1_2(X1,X2),X2)), inference(literals_permutation, [status(thm)], [c_0_245])).
% 0.64/0.95 cnf(c_0_245_1, axiom, (~member(sk1_esk1_2(X1,X2),X2)
% 0.64/0.95 |subclass(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_245])).
% 0.64/0.95 cnf(c_0_246_0, axiom, (member(X1,universal_class)
% 0.64/0.95 |~member(X1,unordered_pair(X2,X3))), inference(literals_permutation, [status(thm)], [c_0_246])).
% 0.64/0.95 cnf(c_0_246_1, axiom, (~member(X1,unordered_pair(X2,X3))
% 0.64/0.95 |member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_246])).
% 0.64/0.95 cnf(c_0_247_0, axiom, (member(X1,X2)
% 0.64/0.95 |~member(ordered_pair(X1,X2),element_relation)), inference(literals_permutation, [status(thm)], [c_0_247])).
% 0.64/0.95 cnf(c_0_247_1, axiom, (~member(ordered_pair(X1,X2),element_relation)
% 0.64/0.95 |member(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_247])).
% 0.64/0.95 cnf(c_0_248_0, axiom, (member(X1,universal_class)
% 0.64/0.95 |~member(ordered_pair(X1,X2),successor_relation)), inference(literals_permutation, [status(thm)], [c_0_248])).
% 0.64/0.95 cnf(c_0_248_1, axiom, (~member(ordered_pair(X1,X2),successor_relation)
% 0.64/0.95 |member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_248])).
% 0.64/0.95 cnf(c_0_249_0, axiom, (member(X2,universal_class)
% 0.64/0.95 |~member(ordered_pair(X1,X2),successor_relation)), inference(literals_permutation, [status(thm)], [c_0_249])).
% 0.64/0.95 cnf(c_0_249_1, axiom, (~member(ordered_pair(X1,X2),successor_relation)
% 0.64/0.95 |member(X2,universal_class)), inference(literals_permutation, [status(thm)], [c_0_249])).
% 0.64/0.95 cnf(c_0_250_0, axiom, (member(X2,universal_class)
% 0.64/0.95 |~member(ordered_pair(X1,X2),element_relation)), inference(literals_permutation, [status(thm)], [c_0_250])).
% 0.64/0.95 cnf(c_0_250_1, axiom, (~member(ordered_pair(X1,X2),element_relation)
% 0.64/0.95 |member(X2,universal_class)), inference(literals_permutation, [status(thm)], [c_0_250])).
% 0.64/0.95 cnf(c_0_251_0, axiom, (member(X1,sk1_esk3_2(X1,X2))
% 0.64/0.95 |~member(X1,sum_class(X2))), inference(literals_permutation, [status(thm)], [c_0_251])).
% 0.64/0.95 cnf(c_0_251_1, axiom, (~member(X1,sum_class(X2))
% 0.64/0.95 |member(X1,sk1_esk3_2(X1,X2))), inference(literals_permutation, [status(thm)], [c_0_251])).
% 0.64/0.95 cnf(c_0_252_0, axiom, (member(sk1_esk3_2(X1,X2),X2)
% 0.64/0.95 |~member(X1,sum_class(X2))), inference(literals_permutation, [status(thm)], [c_0_252])).
% 0.64/0.95 cnf(c_0_252_1, axiom, (~member(X1,sum_class(X2))
% 0.64/0.95 |member(sk1_esk3_2(X1,X2),X2)), inference(literals_permutation, [status(thm)], [c_0_252])).
% 0.64/0.95 cnf(c_0_254_0, axiom, (first(ordered_pair(X2,X1))=X2
% 0.64/0.95 |(~member(X1,universal_class)
% 0.64/0.95 |~member(X2,universal_class))), inference(literals_permutation, [status(thm)], [c_0_254])).
% 0.64/0.95 cnf(c_0_254_1, axiom, ((~member(X1,universal_class)
% 0.64/0.95 |first(ordered_pair(X2,X1))=X2)
% 0.64/0.95 |~member(X2,universal_class)), inference(literals_permutation, [status(thm)], [c_0_254])).
% 0.64/0.95 cnf(c_0_254_2, axiom, (~member(X2,universal_class)
% 0.64/0.95 |(~member(X1,universal_class)
% 0.64/0.95 |first(ordered_pair(X2,X1))=X2)), inference(literals_permutation, [status(thm)], [c_0_254])).
% 0.64/0.95 cnf(c_0_255_0, axiom, (second(ordered_pair(X2,X1))=X1
% 0.64/0.95 |(~member(X1,universal_class)
% 0.64/0.95 |~member(X2,universal_class))), inference(literals_permutation, [status(thm)], [c_0_255])).
% 0.64/0.95 cnf(c_0_255_1, axiom, ((~member(X1,universal_class)
% 0.64/0.95 |second(ordered_pair(X2,X1))=X1)
% 0.64/0.95 |~member(X2,universal_class)), inference(literals_permutation, [status(thm)], [c_0_255])).
% 0.64/0.95 cnf(c_0_255_2, axiom, (~member(X2,universal_class)
% 0.64/0.95 |(~member(X1,universal_class)
% 0.64/0.95 |second(ordered_pair(X2,X1))=X1)), inference(literals_permutation, [status(thm)], [c_0_255])).
% 0.64/0.95 cnf(c_0_256_0, axiom, (~member(X1,X2)
% 0.64/0.95 |(~member(X1,X3)
% 0.64/0.95 |~disjoint(X3,X2))), inference(literals_permutation, [status(thm)], [c_0_256])).
% 0.64/0.95 cnf(c_0_256_1, axiom, ((~member(X1,X3)
% 0.64/0.95 |~member(X1,X2))
% 0.64/0.95 |~disjoint(X3,X2)), inference(literals_permutation, [status(thm)], [c_0_256])).
% 0.64/0.95 cnf(c_0_256_2, axiom, (~disjoint(X3,X2)
% 0.64/0.95 |(~member(X1,X3)
% 0.64/0.95 |~member(X1,X2))), inference(literals_permutation, [status(thm)], [c_0_256])).
% 0.64/0.95 cnf(c_0_257_0, axiom, (X1=X3
% 0.64/0.95 |(X1=X2
% 0.64/0.95 |~member(X1,unordered_pair(X2,X3)))), inference(literals_permutation, [status(thm)], [c_0_257])).
% 0.64/0.95 cnf(c_0_257_1, axiom, ((X1=X2
% 0.64/0.95 |X1=X3)
% 0.64/0.95 |~member(X1,unordered_pair(X2,X3))), inference(literals_permutation, [status(thm)], [c_0_257])).
% 0.64/0.95 cnf(c_0_257_2, axiom, (~member(X1,unordered_pair(X2,X3))
% 0.64/0.95 |(X1=X2
% 0.64/0.95 |X1=X3)), inference(literals_permutation, [status(thm)], [c_0_257])).
% 0.64/0.95 cnf(c_0_258_0, axiom, (member(image(X1,X2),universal_class)
% 0.64/0.95 |(~function(X1)
% 0.64/0.95 |~member(X2,universal_class))), inference(literals_permutation, [status(thm)], [c_0_258])).
% 0.64/0.95 cnf(c_0_258_1, axiom, ((~function(X1)
% 0.64/0.95 |member(image(X1,X2),universal_class))
% 0.64/0.95 |~member(X2,universal_class)), inference(literals_permutation, [status(thm)], [c_0_258])).
% 0.64/0.95 cnf(c_0_258_2, axiom, (~member(X2,universal_class)
% 0.64/0.95 |(~function(X1)
% 0.64/0.95 |member(image(X1,X2),universal_class))), inference(literals_permutation, [status(thm)], [c_0_258])).
% 0.64/0.95 cnf(c_0_259_0, axiom, (successor(X1)=X2
% 0.64/0.95 |~member(ordered_pair(X1,X2),successor_relation)), inference(literals_permutation, [status(thm)], [c_0_259])).
% 0.64/0.95 cnf(c_0_259_1, axiom, (~member(ordered_pair(X1,X2),successor_relation)
% 0.64/0.95 |successor(X1)=X2), inference(literals_permutation, [status(thm)], [c_0_259])).
% 0.64/0.95 cnf(c_0_260_0, axiom, (member(X1,sum_class(X2))
% 0.64/0.95 |(~member(X3,X2)
% 0.64/0.95 |~member(X1,X3))), inference(literals_permutation, [status(thm)], [c_0_260])).
% 0.64/0.95 cnf(c_0_260_1, axiom, ((~member(X3,X2)
% 0.64/0.95 |member(X1,sum_class(X2)))
% 0.64/0.95 |~member(X1,X3)), inference(literals_permutation, [status(thm)], [c_0_260])).
% 0.64/0.95 cnf(c_0_260_2, axiom, (~member(X1,X3)
% 0.64/0.95 |(~member(X3,X2)
% 0.64/0.95 |member(X1,sum_class(X2)))), inference(literals_permutation, [status(thm)], [c_0_260])).
% 0.64/0.95 cnf(c_0_261_0, axiom, (member(X1,unordered_pair(X2,X3))
% 0.64/0.95 |(~member(X1,universal_class)
% 0.64/0.95 |X1!=X2)), inference(literals_permutation, [status(thm)], [c_0_261])).
% 0.64/0.95 cnf(c_0_261_1, axiom, ((~member(X1,universal_class)
% 0.64/0.95 |member(X1,unordered_pair(X2,X3)))
% 0.64/0.95 |X1!=X2), inference(literals_permutation, [status(thm)], [c_0_261])).
% 0.64/0.95 cnf(c_0_261_2, axiom, (X1!=X2
% 0.64/0.95 |(~member(X1,universal_class)
% 0.64/0.95 |member(X1,unordered_pair(X2,X3)))), inference(literals_permutation, [status(thm)], [c_0_261])).
% 0.64/0.95 cnf(c_0_262_0, axiom, (member(X1,unordered_pair(X2,X3))
% 0.64/0.95 |(~member(X1,universal_class)
% 0.64/0.95 |X1!=X3)), inference(literals_permutation, [status(thm)], [c_0_262])).
% 0.64/0.95 cnf(c_0_262_1, axiom, ((~member(X1,universal_class)
% 0.64/0.95 |member(X1,unordered_pair(X2,X3)))
% 0.64/0.95 |X1!=X3), inference(literals_permutation, [status(thm)], [c_0_262])).
% 0.64/0.95 cnf(c_0_262_2, axiom, (X1!=X3
% 0.64/0.95 |(~member(X1,universal_class)
% 0.64/0.95 |member(X1,unordered_pair(X2,X3)))), inference(literals_permutation, [status(thm)], [c_0_262])).
% 0.64/0.95 cnf(c_0_263_0, axiom, (member(X1,power_class(X2))
% 0.64/0.95 |(~subclass(X1,X2)
% 0.64/0.95 |~member(X1,universal_class))), inference(literals_permutation, [status(thm)], [c_0_263])).
% 0.64/0.95 cnf(c_0_263_1, axiom, ((~subclass(X1,X2)
% 0.64/0.95 |member(X1,power_class(X2)))
% 0.64/0.95 |~member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_263])).
% 0.64/0.95 cnf(c_0_263_2, axiom, (~member(X1,universal_class)
% 0.64/0.95 |(~subclass(X1,X2)
% 0.64/0.95 |member(X1,power_class(X2)))), inference(literals_permutation, [status(thm)], [c_0_263])).
% 0.64/0.95 cnf(c_0_264_0, axiom, (member(X1,union(X2,X3))
% 0.64/0.95 |~member(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_264])).
% 0.64/0.95 cnf(c_0_264_1, axiom, (~member(X1,X2)
% 0.64/0.95 |member(X1,union(X2,X3))), inference(literals_permutation, [status(thm)], [c_0_264])).
% 0.64/0.95 cnf(c_0_265_0, axiom, (member(X1,union(X2,X3))
% 0.64/0.95 |~member(X1,X3)), inference(literals_permutation, [status(thm)], [c_0_265])).
% 0.64/0.95 cnf(c_0_265_1, axiom, (~member(X1,X3)
% 0.64/0.95 |member(X1,union(X2,X3))), inference(literals_permutation, [status(thm)], [c_0_265])).
% 0.64/0.95 cnf(c_0_268_0, axiom, (member(X1,X2)
% 0.64/0.95 |(~member(X1,X3)
% 0.64/0.95 |~subclass(X3,X2))), inference(literals_permutation, [status(thm)], [c_0_268])).
% 0.64/0.95 cnf(c_0_268_1, axiom, ((~member(X1,X3)
% 0.64/0.95 |member(X1,X2))
% 0.64/0.95 |~subclass(X3,X2)), inference(literals_permutation, [status(thm)], [c_0_268])).
% 0.64/0.95 cnf(c_0_268_2, axiom, (~subclass(X3,X2)
% 0.64/0.95 |(~member(X1,X3)
% 0.64/0.95 |member(X1,X2))), inference(literals_permutation, [status(thm)], [c_0_268])).
% 0.64/0.95 cnf(c_0_269_0, axiom, (member(apply(sk1_esk7_0,X1),X1)
% 0.64/0.95 |(X1=null_class
% 0.64/0.95 |~member(X1,universal_class))), inference(literals_permutation, [status(thm)], [c_0_269])).
% 0.64/0.95 cnf(c_0_269_1, axiom, ((X1=null_class
% 0.64/0.95 |member(apply(sk1_esk7_0,X1),X1))
% 0.64/0.95 |~member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_269])).
% 0.64/0.95 cnf(c_0_269_2, axiom, (~member(X1,universal_class)
% 0.64/0.95 |(X1=null_class
% 0.64/0.95 |member(apply(sk1_esk7_0,X1),X1))), inference(literals_permutation, [status(thm)], [c_0_269])).
% 0.64/0.95 cnf(c_0_270_0, axiom, (subclass(compose(X1,inverse(X1)),identity_relation)
% 0.64/0.95 |~function(X1)), inference(literals_permutation, [status(thm)], [c_0_270])).
% 0.64/0.95 cnf(c_0_270_1, axiom, (~function(X1)
% 0.64/0.95 |subclass(compose(X1,inverse(X1)),identity_relation)), inference(literals_permutation, [status(thm)], [c_0_270])).
% 0.64/0.95 cnf(c_0_271_0, axiom, (member(X1,identity_relation)
% 0.64/0.95 |(X1!=ordered_pair(X2,X2)
% 0.64/0.95 |~member(X2,universal_class))), inference(literals_permutation, [status(thm)], [c_0_271])).
% 0.64/0.95 cnf(c_0_271_1, axiom, ((X1!=ordered_pair(X2,X2)
% 0.64/0.95 |member(X1,identity_relation))
% 0.64/0.95 |~member(X2,universal_class)), inference(literals_permutation, [status(thm)], [c_0_271])).
% 0.64/0.95 cnf(c_0_271_2, axiom, (~member(X2,universal_class)
% 0.64/0.95 |(X1!=ordered_pair(X2,X2)
% 0.64/0.95 |member(X1,identity_relation))), inference(literals_permutation, [status(thm)], [c_0_271])).
% 0.64/0.95 cnf(c_0_273_0, axiom, (member(X1,complement(X2))
% 0.64/0.95 |(member(X1,X2)
% 0.64/0.95 |~member(X1,universal_class))), inference(literals_permutation, [status(thm)], [c_0_273])).
% 0.64/0.95 cnf(c_0_273_1, axiom, ((member(X1,X2)
% 0.64/0.95 |member(X1,complement(X2)))
% 0.64/0.95 |~member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_273])).
% 0.64/0.95 cnf(c_0_273_2, axiom, (~member(X1,universal_class)
% 0.64/0.95 |(member(X1,X2)
% 0.64/0.95 |member(X1,complement(X2)))), inference(literals_permutation, [status(thm)], [c_0_273])).
% 0.64/0.95 cnf(c_0_274_0, axiom, (~member(X1,complement(X2))
% 0.64/0.95 |~member(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_274])).
% 0.64/0.95 cnf(c_0_274_1, axiom, (~member(X1,X2)
% 0.64/0.95 |~member(X1,complement(X2))), inference(literals_permutation, [status(thm)], [c_0_274])).
% 0.64/0.95 cnf(c_0_275_0, axiom, (disjoint(X1,X2)
% 0.64/0.95 |member(sk1_esk5_2(X1,X2),X1)), inference(literals_permutation, [status(thm)], [c_0_275])).
% 0.64/0.95 cnf(c_0_275_1, axiom, (member(sk1_esk5_2(X1,X2),X1)
% 0.64/0.95 |disjoint(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_275])).
% 0.64/0.95 cnf(c_0_276_0, axiom, (disjoint(X1,X2)
% 0.64/0.95 |member(sk1_esk5_2(X1,X2),X2)), inference(literals_permutation, [status(thm)], [c_0_276])).
% 0.64/0.95 cnf(c_0_276_1, axiom, (member(sk1_esk5_2(X1,X2),X2)
% 0.64/0.95 |disjoint(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_276])).
% 0.64/0.95 cnf(c_0_277_0, axiom, (subclass(X1,X2)
% 0.64/0.95 |member(sk1_esk1_2(X1,X2),X1)), inference(literals_permutation, [status(thm)], [c_0_277])).
% 0.64/0.95 cnf(c_0_277_1, axiom, (member(sk1_esk1_2(X1,X2),X1)
% 0.64/0.95 |subclass(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_277])).
% 0.64/0.95 cnf(c_0_278_0, axiom, (ordered_pair(sk1_esk4_1(X1),sk1_esk4_1(X1))=X1
% 0.64/0.95 |~member(X1,identity_relation)), inference(literals_permutation, [status(thm)], [c_0_278])).
% 0.64/0.95 cnf(c_0_278_1, axiom, (~member(X1,identity_relation)
% 0.64/0.95 |ordered_pair(sk1_esk4_1(X1),sk1_esk4_1(X1))=X1), inference(literals_permutation, [status(thm)], [c_0_278])).
% 0.64/0.95 cnf(c_0_279_0, axiom, (X1=X2
% 0.64/0.95 |(~subclass(X2,X1)
% 0.64/0.95 |~subclass(X1,X2))), inference(literals_permutation, [status(thm)], [c_0_279])).
% 0.64/0.95 cnf(c_0_279_1, axiom, ((~subclass(X2,X1)
% 0.64/0.95 |X1=X2)
% 0.64/0.95 |~subclass(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_279])).
% 0.64/0.95 cnf(c_0_279_2, axiom, (~subclass(X1,X2)
% 0.64/0.95 |(~subclass(X2,X1)
% 0.64/0.95 |X1=X2)), inference(literals_permutation, [status(thm)], [c_0_279])).
% 0.64/0.95 cnf(c_0_280_0, axiom, (subclass(X1,X2)
% 0.64/0.95 |~member(X1,power_class(X2))), inference(literals_permutation, [status(thm)], [c_0_280])).
% 0.64/0.95 cnf(c_0_280_1, axiom, (~member(X1,power_class(X2))
% 0.64/0.95 |subclass(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_280])).
% 0.64/0.95 cnf(c_0_281_0, axiom, (member(X1,universal_class)
% 0.64/0.95 |~member(X1,power_class(X2))), inference(literals_permutation, [status(thm)], [c_0_281])).
% 0.64/0.95 cnf(c_0_281_1, axiom, (~member(X1,power_class(X2))
% 0.64/0.95 |member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_281])).
% 0.64/0.95 cnf(c_0_282_0, axiom, (member(X1,universal_class)
% 0.64/0.95 |~member(X1,domain_of(X2))), inference(literals_permutation, [status(thm)], [c_0_282])).
% 0.64/0.95 cnf(c_0_282_1, axiom, (~member(X1,domain_of(X2))
% 0.64/0.95 |member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_282])).
% 0.64/0.95 cnf(c_0_283_0, axiom, (member(X1,universal_class)
% 0.64/0.95 |~member(X1,complement(X2))), inference(literals_permutation, [status(thm)], [c_0_283])).
% 0.64/0.95 cnf(c_0_283_1, axiom, (~member(X1,complement(X2))
% 0.64/0.95 |member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_283])).
% 0.64/0.95 cnf(c_0_284_0, axiom, (subclass(image(successor_relation,X1),X1)
% 0.64/0.95 |~inductive(X1)), inference(literals_permutation, [status(thm)], [c_0_284])).
% 0.64/0.95 cnf(c_0_284_1, axiom, (~inductive(X1)
% 0.64/0.95 |subclass(image(successor_relation,X1),X1)), inference(literals_permutation, [status(thm)], [c_0_284])).
% 0.64/0.95 cnf(c_0_285_0, axiom, (subclass(X1,cross_product(universal_class,universal_class))
% 0.64/0.95 |~function(X1)), inference(literals_permutation, [status(thm)], [c_0_285])).
% 0.64/0.95 cnf(c_0_285_1, axiom, (~function(X1)
% 0.64/0.95 |subclass(X1,cross_product(universal_class,universal_class))), inference(literals_permutation, [status(thm)], [c_0_285])).
% 0.64/0.95 cnf(c_0_286_0, axiom, (member(sk1_esk4_1(X1),universal_class)
% 0.64/0.95 |~member(X1,identity_relation)), inference(literals_permutation, [status(thm)], [c_0_286])).
% 0.64/0.95 cnf(c_0_286_1, axiom, (~member(X1,identity_relation)
% 0.64/0.95 |member(sk1_esk4_1(X1),universal_class)), inference(literals_permutation, [status(thm)], [c_0_286])).
% 0.64/0.95 cnf(c_0_287_0, axiom, (member(power_class(X1),universal_class)
% 0.64/0.95 |~member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_287])).
% 0.64/0.95 cnf(c_0_287_1, axiom, (~member(X1,universal_class)
% 0.64/0.95 |member(power_class(X1),universal_class)), inference(literals_permutation, [status(thm)], [c_0_287])).
% 0.64/0.95 cnf(c_0_288_0, axiom, (member(sum_class(X1),universal_class)
% 0.64/0.95 |~member(X1,universal_class)), inference(literals_permutation, [status(thm)], [c_0_288])).
% 0.64/0.95 cnf(c_0_288_1, axiom, (~member(X1,universal_class)
% 0.64/0.95 |member(sum_class(X1),universal_class)), inference(literals_permutation, [status(thm)], [c_0_288])).
% 0.64/0.95 cnf(c_0_293_0, axiom, (X1=null_class
% 0.64/0.95 |member(sk1_esk6_1(X1),X1)), inference(literals_permutation, [status(thm)], [c_0_293])).
% 0.64/0.95 cnf(c_0_293_1, axiom, (member(sk1_esk6_1(X1),X1)
% 0.64/0.95 |X1=null_class), inference(literals_permutation, [status(thm)], [c_0_293])).
% 0.64/0.95 cnf(c_0_294_0, axiom, (X1=null_class
% 0.64/0.95 |disjoint(sk1_esk6_1(X1),X1)), inference(literals_permutation, [status(thm)], [c_0_294])).
% 0.64/0.95 cnf(c_0_294_1, axiom, (disjoint(sk1_esk6_1(X1),X1)
% 0.64/0.95 |X1=null_class), inference(literals_permutation, [status(thm)], [c_0_294])).
% 0.64/0.95 cnf(c_0_295_0, axiom, (X1=null_class
% 0.64/0.95 |member(sk1_esk6_1(X1),universal_class)), inference(literals_permutation, [status(thm)], [c_0_295])).
% 0.64/0.95 cnf(c_0_295_1, axiom, (member(sk1_esk6_1(X1),universal_class)
% 0.64/0.95 |X1=null_class), inference(literals_permutation, [status(thm)], [c_0_295])).
% 0.64/0.95 cnf(c_0_297_0, axiom, (subclass(sk1_esk2_0,X1)
% 0.64/0.95 |~inductive(X1)), inference(literals_permutation, [status(thm)], [c_0_297])).
% 0.64/0.95 cnf(c_0_297_1, axiom, (~inductive(X1)
% 0.64/0.95 |subclass(sk1_esk2_0,X1)), inference(literals_permutation, [status(thm)], [c_0_297])).
% 0.64/0.95 cnf(c_0_298_0, axiom, (member(null_class,X1)
% 0.64/0.95 |~inductive(X1)), inference(literals_permutation, [status(thm)], [c_0_298])).
% 0.64/0.95 cnf(c_0_298_1, axiom, (~inductive(X1)
% 0.64/0.95 |member(null_class,X1)), inference(literals_permutation, [status(thm)], [c_0_298])).
% 0.64/0.95 cnf(c_0_300_0, axiom, (subclass(X1,X2)
% 0.64/0.95 |X1!=X2), inference(literals_permutation, [status(thm)], [c_0_300])).
% 0.64/0.95 cnf(c_0_300_1, axiom, (X1!=X2
% 0.64/0.95 |subclass(X1,X2)), inference(literals_permutation, [status(thm)], [c_0_300])).
% 0.64/0.95 cnf(c_0_301_0, axiom, (subclass(X2,X1)
% 0.64/0.95 |X1!=X2), inference(literals_permutation, [status(thm)], [c_0_301])).
% 0.64/0.95 cnf(c_0_301_1, axiom, (X1!=X2
% 0.64/0.95 |subclass(X2,X1)), inference(literals_permutation, [status(thm)], [c_0_301])).
% 0.64/0.95 cnf(c_0_296_0, axiom, ~member(X1,null_class), inference(literals_permutation, [status(thm)], [c_0_296])).
% 0.64/0.95 cnf(c_0_228_0, axiom, range_of(restrict(X1,X2,universal_class))=image(X1,X2), inference(literals_permutation, [status(thm)], [c_0_228])).
% 0.64/0.95 cnf(c_0_234_0, axiom, intersection(X1,cross_product(X2,X3))=restrict(X1,X2,X3), inference(literals_permutation, [status(thm)], [c_0_234])).
% 0.64/0.95 cnf(c_0_240_0, axiom, subclass(flip(X1),cross_product(cross_product(universal_class,universal_class),universal_class)), inference(literals_permutation, [status(thm)], [c_0_240])).
% 0.64/0.95 cnf(c_0_241_0, axiom, subclass(rotate(X1),cross_product(cross_product(universal_class,universal_class),universal_class)), inference(literals_permutation, [status(thm)], [c_0_241])).
% 0.64/0.95 cnf(c_0_253_0, axiom, unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2)))=ordered_pair(X1,X2), inference(literals_permutation, [status(thm)], [c_0_253])).
% 0.64/0.95 cnf(c_0_266_0, axiom, subclass(compose(X1,X2),cross_product(universal_class,universal_class)), inference(literals_permutation, [status(thm)], [c_0_266])).
% 0.64/0.95 cnf(c_0_267_0, axiom, domain_of(flip(cross_product(X1,universal_class)))=inverse(X1), inference(literals_permutation, [status(thm)], [c_0_267])).
% 0.64/0.95 cnf(c_0_272_0, axiom, sum_class(image(X1,singleton(X2)))=apply(X1,X2), inference(literals_permutation, [status(thm)], [c_0_272])).
% 0.64/0.95 cnf(c_0_289_0, axiom, member(unordered_pair(X1,X2),universal_class), inference(literals_permutation, [status(thm)], [c_0_289])).
% 0.64/0.95 cnf(c_0_290_0, axiom, subclass(successor_relation,cross_product(universal_class,universal_class)), inference(literals_permutation, [status(thm)], [c_0_290])).
% 0.64/0.95 cnf(c_0_291_0, axiom, subclass(element_relation,cross_product(universal_class,universal_class)), inference(literals_permutation, [status(thm)], [c_0_291])).
% 0.64/0.95 cnf(c_0_292_0, axiom, union(X1,singleton(X1))=successor(X1), inference(literals_permutation, [status(thm)], [c_0_292])).
% 0.64/0.95 cnf(c_0_299_0, axiom, unordered_pair(X1,X1)=singleton(X1), inference(literals_permutation, [status(thm)], [c_0_299])).
% 0.64/0.95 cnf(c_0_302_0, axiom, domain_of(inverse(X1))=range_of(X1), inference(literals_permutation, [status(thm)], [c_0_302])).
% 0.64/0.95 cnf(c_0_303_0, axiom, subclass(X1,universal_class), inference(literals_permutation, [status(thm)], [c_0_303])).
% 0.64/0.95 cnf(c_0_304_0, axiom, member(sk1_esk2_0,universal_class), inference(literals_permutation, [status(thm)], [c_0_304])).
% 0.64/0.95 cnf(c_0_305_0, axiom, function(sk1_esk7_0), inference(literals_permutation, [status(thm)], [c_0_305])).
% 0.64/0.95 cnf(c_0_306_0, axiom, inductive(sk1_esk2_0), inference(literals_permutation, [status(thm)], [c_0_306])).
% 0.64/0.95 % CNF of non-axioms
% 0.64/0.95 % Start CNF derivation
% 0.64/0.95 fof(c_0_0, conjecture, (![X1]:?[X2]:?[X3]:((member(X2,universal_class)&(member(X3,universal_class)&X1=ordered_pair(X2,X3)))|(~(?[X4]:?[X5]:(member(X4,universal_class)&(member(X5,universal_class)&X1=ordered_pair(X4,X5))))&(X2=X1&X3=X1)))), file('<stdin>', existence_of_first_and_second)).
% 0.64/0.95 fof(c_0_1, negated_conjecture, (~(![X1]:?[X2]:?[X3]:((member(X2,universal_class)&(member(X3,universal_class)&X1=ordered_pair(X2,X3)))|(~(?[X4]:?[X5]:(member(X4,universal_class)&(member(X5,universal_class)&X1=ordered_pair(X4,X5))))&(X2=X1&X3=X1))))), inference(assume_negation,[status(cth)],[c_0_0])).
% 0.64/0.95 fof(c_0_2, negated_conjecture, (![X7]:![X8]:![X11]:![X12]:((~member(X7,universal_class)|(~member(X8,universal_class)|esk1_0!=ordered_pair(X7,X8)))&((member(esk2_0,universal_class)|(X11!=esk1_0|X12!=esk1_0))&((member(esk3_0,universal_class)|(X11!=esk1_0|X12!=esk1_0))&(esk1_0=ordered_pair(esk2_0,esk3_0)|(X11!=esk1_0|X12!=esk1_0)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
% 0.64/0.95 cnf(c_0_3,negated_conjecture,(esk1_0!=ordered_pair(X1,X2)|~member(X2,universal_class)|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.64/0.95 cnf(c_0_4,negated_conjecture,(member(esk2_0,universal_class)|X1!=esk1_0|X2!=esk1_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.64/0.95 cnf(c_0_5,negated_conjecture,(member(esk3_0,universal_class)|X1!=esk1_0|X2!=esk1_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.64/0.95 cnf(c_0_6,negated_conjecture,(esk1_0=ordered_pair(esk2_0,esk3_0)|X1!=esk1_0|X2!=esk1_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.64/0.95 cnf(c_0_7,negated_conjecture,(ordered_pair(X1,X2)!=esk1_0|~member(X2,universal_class)|~member(X1,universal_class)), c_0_3, ['final']).
% 0.64/0.95 cnf(c_0_8,negated_conjecture,(member(esk2_0,universal_class)|X1!=esk1_0|X2!=esk1_0), c_0_4, ['final']).
% 0.64/0.95 cnf(c_0_9,negated_conjecture,(member(esk3_0,universal_class)|X1!=esk1_0|X2!=esk1_0), c_0_5, ['final']).
% 0.64/0.95 cnf(c_0_10,negated_conjecture,(ordered_pair(esk2_0,esk3_0)=esk1_0|X1!=esk1_0|X2!=esk1_0), c_0_6, ['final']).
% 0.64/0.95 % End CNF derivation
% 0.64/0.95
% 0.64/0.95 %-------------------------------------------------------------
% 0.64/0.95 % Proof by iprover
% 0.64/0.95
% 0.64/0.95 cnf(c_188,negated_conjecture,
% 0.64/0.95 ( ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0
% 0.64/0.95 | X0 != sk2_esk1_0
% 0.64/0.95 | X1 != sk2_esk1_0 ),
% 0.64/0.95 file('/export/starexec/sandbox/tmp/iprover_modulo_f988e1.p', c_0_10) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_277,negated_conjecture,
% 0.64/0.95 ( sP0_iProver_split | ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0 ),
% 0.64/0.95 inference(splitting,
% 0.64/0.95 [splitting(split),new_symbols(definition,[sP0_iProver_split,
% 0.64/0.95 sP0_iProver_split,
% 0.64/0.95 ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0])],
% 0.64/0.95 [c_188]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_303,negated_conjecture,
% 0.64/0.95 ( sP0_iProver_split | ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_277]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_327,negated_conjecture,
% 0.64/0.95 ( sP0_iProver_split | ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_303]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_332,negated_conjecture,
% 0.64/0.95 ( sP0_iProver_split | ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_327]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_266,negated_conjecture,
% 0.64/0.95 ( ~ sP0_iProver_split | X0 != sk2_esk1_0 ),
% 0.64/0.95 inference(splitting,
% 0.64/0.95 [splitting(split),new_symbols(definition,[sP0_iProver_split])],
% 0.64/0.95 [c_188]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_281,negated_conjecture,
% 0.64/0.95 ( ~ sP0_iProver_split | X0 != sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_266]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_287,negated_conjecture,
% 0.64/0.95 ( ~ sP0_iProver_split | X0 != sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_281]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_326,negated_conjecture,
% 0.64/0.95 ( ~ sP0_iProver_split | X0 != sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_287]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_333,negated_conjecture,
% 0.64/0.95 ( ~ sP0_iProver_split | X0 != sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_326]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_347,plain,
% 0.64/0.95 ( ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0 | X0 != sk2_esk1_0 ),
% 0.64/0.95 inference(resolution,[status(thm)],[c_332,c_333]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_348,plain,
% 0.64/0.95 ( ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0 ),
% 0.64/0.95 inference(unflattening,[status(esa)],[c_347]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_352,plain,
% 0.64/0.95 ( ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_348]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_358,plain,
% 0.64/0.95 ( ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_352]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_361,plain,
% 0.64/0.95 ( ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_358]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_918,plain,
% 0.64/0.95 ( ordered_pair(sk2_esk2_0,sk2_esk3_0) = sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_361]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_185,negated_conjecture,
% 0.64/0.95 ( ~ member(X0,universal_class)
% 0.64/0.95 | ~ member(X1,universal_class)
% 0.64/0.95 | ordered_pair(X0,X1) != sk2_esk1_0 ),
% 0.64/0.95 file('/export/starexec/sandbox/tmp/iprover_modulo_f988e1.p', c_0_7) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_285,negated_conjecture,
% 0.64/0.95 ( ~ member(X0,universal_class)
% 0.64/0.95 | ~ member(X1,universal_class)
% 0.64/0.95 | ordered_pair(X0,X1) != sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_185]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_325,negated_conjecture,
% 0.64/0.95 ( ~ member(X0,universal_class)
% 0.64/0.95 | ~ member(X1,universal_class)
% 0.64/0.95 | ordered_pair(X0,X1) != sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_285]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_334,negated_conjecture,
% 0.64/0.95 ( ~ member(X0,universal_class)
% 0.64/0.95 | ~ member(X1,universal_class)
% 0.64/0.95 | ordered_pair(X0,X1) != sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_325]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_362,negated_conjecture,
% 0.64/0.95 ( ~ member(X0,universal_class)
% 0.64/0.95 | ~ member(X1,universal_class)
% 0.64/0.95 | ordered_pair(X0,X1) != sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_334]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_920,negated_conjecture,
% 0.64/0.95 ( ~ member(X0,universal_class)
% 0.64/0.95 | ~ member(X1,universal_class)
% 0.64/0.95 | ordered_pair(X0,X1) != sk2_esk1_0 ),
% 0.64/0.95 inference(copy,[status(esa)],[c_362]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_1048,plain,
% 0.64/0.95 ( ~ member(sk2_esk2_0,universal_class)
% 0.64/0.95 | ~ member(sk2_esk3_0,universal_class) ),
% 0.64/0.95 inference(resolution,[status(thm)],[c_918,c_920]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_1049,plain,
% 0.64/0.95 ( ~ member(sk2_esk2_0,universal_class)
% 0.64/0.95 | ~ member(sk2_esk3_0,universal_class) ),
% 0.64/0.95 inference(rewriting,[status(thm)],[c_1048]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_187,negated_conjecture,
% 0.64/0.95 ( member(sk2_esk3_0,universal_class)
% 0.64/0.95 | X0 != sk2_esk1_0
% 0.64/0.95 | X1 != sk2_esk1_0 ),
% 0.64/0.95 file('/export/starexec/sandbox/tmp/iprover_modulo_f988e1.p', c_0_9) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_280,negated_conjecture,
% 0.64/0.95 ( member(sk2_esk3_0,universal_class) | sP0_iProver_split ),
% 0.64/0.95 inference(splitting,
% 0.64/0.95 [splitting(split),new_symbols(definition,[sP0_iProver_split,
% 0.64/0.95 sP0_iProver_split,
% 0.64/0.95 member(sk2_esk3_0,universal_class)])],
% 0.64/0.95 [c_187]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_297,negated_conjecture,
% 0.64/0.95 ( member(sk2_esk3_0,universal_class) | sP0_iProver_split ),
% 0.64/0.95 inference(copy,[status(esa)],[c_280]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_328,negated_conjecture,
% 0.64/0.95 ( member(sk2_esk3_0,universal_class) | sP0_iProver_split ),
% 0.64/0.95 inference(copy,[status(esa)],[c_297]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_331,negated_conjecture,
% 0.64/0.95 ( member(sk2_esk3_0,universal_class) | sP0_iProver_split ),
% 0.64/0.95 inference(copy,[status(esa)],[c_328]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_341,plain,
% 0.64/0.95 ( member(sk2_esk3_0,universal_class) | X0 != sk2_esk1_0 ),
% 0.64/0.95 inference(resolution,[status(thm)],[c_331,c_333]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_342,plain,
% 0.64/0.95 ( member(sk2_esk3_0,universal_class) ),
% 0.64/0.95 inference(unflattening,[status(esa)],[c_341]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_346,plain,
% 0.64/0.95 ( member(sk2_esk3_0,universal_class) ),
% 0.64/0.95 inference(copy,[status(esa)],[c_342]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_356,plain,
% 0.64/0.95 ( member(sk2_esk3_0,universal_class) ),
% 0.64/0.95 inference(copy,[status(esa)],[c_346]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_360,plain,
% 0.64/0.95 ( member(sk2_esk3_0,universal_class) ),
% 0.64/0.95 inference(copy,[status(esa)],[c_356]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_916,plain,
% 0.64/0.95 ( member(sk2_esk3_0,universal_class) ),
% 0.64/0.95 inference(copy,[status(esa)],[c_360]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_186,negated_conjecture,
% 0.64/0.95 ( member(sk2_esk2_0,universal_class)
% 0.64/0.95 | X0 != sk2_esk1_0
% 0.64/0.95 | X1 != sk2_esk1_0 ),
% 0.64/0.95 file('/export/starexec/sandbox/tmp/iprover_modulo_f988e1.p', c_0_8) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_283,negated_conjecture,
% 0.64/0.95 ( member(sk2_esk2_0,universal_class) | sP0_iProver_split ),
% 0.64/0.95 inference(splitting,
% 0.64/0.95 [splitting(split),new_symbols(definition,[sP0_iProver_split,
% 0.64/0.95 sP0_iProver_split,
% 0.64/0.95 member(sk2_esk2_0,universal_class)])],
% 0.64/0.95 [c_186]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_291,negated_conjecture,
% 0.64/0.95 ( member(sk2_esk2_0,universal_class) | sP0_iProver_split ),
% 0.64/0.95 inference(copy,[status(esa)],[c_283]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_329,negated_conjecture,
% 0.64/0.95 ( member(sk2_esk2_0,universal_class) | sP0_iProver_split ),
% 0.64/0.95 inference(copy,[status(esa)],[c_291]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_330,negated_conjecture,
% 0.64/0.95 ( member(sk2_esk2_0,universal_class) | sP0_iProver_split ),
% 0.64/0.95 inference(copy,[status(esa)],[c_329]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_335,plain,
% 0.64/0.95 ( member(sk2_esk2_0,universal_class) | X0 != sk2_esk1_0 ),
% 0.64/0.95 inference(resolution,[status(thm)],[c_330,c_333]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_336,plain,
% 0.64/0.95 ( member(sk2_esk2_0,universal_class) ),
% 0.64/0.95 inference(unflattening,[status(esa)],[c_335]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_340,plain,
% 0.64/0.95 ( member(sk2_esk2_0,universal_class) ),
% 0.64/0.95 inference(copy,[status(esa)],[c_336]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_354,plain,
% 0.64/0.95 ( member(sk2_esk2_0,universal_class) ),
% 0.64/0.95 inference(copy,[status(esa)],[c_340]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_359,plain,
% 0.64/0.95 ( member(sk2_esk2_0,universal_class) ),
% 0.64/0.95 inference(copy,[status(esa)],[c_354]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_914,plain,
% 0.64/0.95 ( member(sk2_esk2_0,universal_class) ),
% 0.64/0.95 inference(copy,[status(esa)],[c_359]) ).
% 0.64/0.95
% 0.64/0.95 cnf(c_1052,plain,
% 0.64/0.95 ( $false ),
% 0.64/0.95 inference(forward_subsumption_resolution,
% 0.64/0.95 [status(thm)],
% 0.64/0.95 [c_1049,c_916,c_914]) ).
% 0.64/0.95
% 0.64/0.95
% 0.64/0.95
% 0.64/0.95 % SZS output end CNFRefutation
%------------------------------------------------------------------------------