TSTP Solution File: SYN941+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN941+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n008.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 : Thu Jul 21 07:43:25 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN941+1 : TPTP v8.1.0. Released v3.1.0.
% 0.13/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 06:00:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % FOF problem with conjecture
% 0.20/0.41 % 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_2484ef.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_eee26e.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_5eaa1b | 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.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_2484ef.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44 % ------ Parsing...% successful
% 0.20/0.44
% 0.20/0.44 % ------ Preprocessing... gs_s sp: 10 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 % ------ Problem Properties
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % EPR false
% 0.20/0.44 % Horn true
% 0.20/0.44 % Has equality false
% 0.20/0.44
% 0.20/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % % ------ Current options:
% 0.20/0.44
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_2484ef.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 %
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % Resolution empty clause
% 0.20/0.44
% 0.20/0.44 % ------ Statistics
% 0.20/0.44
% 0.20/0.44 % ------ General
% 0.20/0.44
% 0.20/0.44 % num_of_input_clauses: 4
% 0.20/0.44 % num_of_input_neg_conjectures: 4
% 0.20/0.44 % num_of_splits: 10
% 0.20/0.44 % num_of_split_atoms: 4
% 0.20/0.44 % num_of_sem_filtered_clauses: 0
% 0.20/0.44 % num_of_subtypes: 0
% 0.20/0.44 % monotx_restored_types: 0
% 0.20/0.44 % sat_num_of_epr_types: 0
% 0.20/0.44 % sat_num_of_non_cyclic_types: 0
% 0.20/0.44 % sat_guarded_non_collapsed_types: 0
% 0.20/0.44 % is_epr: 0
% 0.20/0.44 % is_horn: 1
% 0.20/0.44 % has_eq: 0
% 0.20/0.44 % num_pure_diseq_elim: 0
% 0.20/0.44 % simp_replaced_by: 0
% 0.20/0.44 % res_preprocessed: 18
% 0.20/0.44 % prep_upred: 0
% 0.20/0.44 % prep_unflattend: 0
% 0.20/0.44 % pred_elim_cands: 4
% 0.20/0.44 % pred_elim: 3
% 0.20/0.44 % pred_elim_cl: 4
% 0.20/0.44 % pred_elim_cycles: 4
% 0.20/0.44 % forced_gc_time: 0
% 0.20/0.44 % gc_basic_clause_elim: 0
% 0.20/0.44 % parsing_time: 0.
% 0.20/0.44 % sem_filter_time: 0.
% 0.20/0.44 % pred_elim_time: 0.
% 0.20/0.44 % out_proof_time: 0.002
% 0.20/0.44 % monotx_time: 0.
% 0.20/0.44 % subtype_inf_time: 0.
% 0.20/0.44 % unif_index_cands_time: 0.
% 0.20/0.44 % unif_index_add_time: 0.
% 0.20/0.44 % total_time: 0.026
% 0.20/0.44 % num_of_symbols: 35
% 0.20/0.44 % num_of_terms: 48
% 0.20/0.44
% 0.20/0.44 % ------ Propositional Solver
% 0.20/0.44
% 0.20/0.44 % prop_solver_calls: 1
% 0.20/0.44 % prop_fast_solver_calls: 68
% 0.20/0.44 % prop_num_of_clauses: 26
% 0.20/0.44 % prop_preprocess_simplified: 120
% 0.20/0.44 % prop_fo_subsumed: 2
% 0.20/0.44 % prop_solver_time: 0.
% 0.20/0.44 % prop_fast_solver_time: 0.
% 0.20/0.44 % prop_unsat_core_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ QBF
% 0.20/0.44
% 0.20/0.44 % qbf_q_res: 0
% 0.20/0.44 % qbf_num_tautologies: 0
% 0.20/0.44 % qbf_prep_cycles: 0
% 0.20/0.44
% 0.20/0.44 % ------ BMC1
% 0.20/0.44
% 0.20/0.44 % bmc1_current_bound: -1
% 0.20/0.44 % bmc1_last_solved_bound: -1
% 0.20/0.44 % bmc1_unsat_core_size: -1
% 0.20/0.44 % bmc1_unsat_core_parents_size: -1
% 0.20/0.44 % bmc1_merge_next_fun: 0
% 0.20/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation
% 0.20/0.44
% 0.20/0.44 % inst_num_of_clauses: 4
% 0.20/0.44 % inst_num_in_passive: 0
% 0.20/0.44 % inst_num_in_active: 0
% 0.20/0.44 % inst_num_in_unprocessed: 4
% 0.20/0.44 % inst_num_of_loops: 0
% 0.20/0.44 % inst_num_of_learning_restarts: 0
% 0.20/0.44 % inst_num_moves_active_passive: 0
% 0.20/0.44 % inst_lit_activity: 0
% 0.20/0.44 % inst_lit_activity_moves: 0
% 0.20/0.44 % inst_num_tautologies: 0
% 0.20/0.44 % inst_num_prop_implied: 0
% 0.20/0.44 % inst_num_existing_simplified: 0
% 0.20/0.44 % inst_num_eq_res_simplified: 0
% 0.20/0.44 % inst_num_child_elim: 0
% 0.20/0.44 % inst_num_of_dismatching_blockings: 0
% 0.20/0.44 % inst_num_of_non_proper_insts: 0
% 0.20/0.44 % inst_num_of_duplicates: 0
% 0.20/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.44 % inst_dismatching_checking_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Resolution
% 0.20/0.44
% 0.20/0.44 % res_num_of_clauses: 7
% 0.20/0.44 % res_num_in_passive: 1
% 0.20/0.44 % res_num_in_active: 4
% 0.20/0.44 % res_num_of_loops: 8
% 0.20/0.44 % res_forward_subset_subsumed: 0
% 0.20/0.44 % res_backward_subset_subsumed: 1
% 0.20/0.44 % res_forward_subsumed: 0
% 0.20/0.44 % res_backward_subsumed: 0
% 0.20/0.44 % res_forward_subsumption_resolution: 2
% 0.20/0.44 % res_backward_subsumption_resolution: 2
% 0.20/0.44 % res_clause_to_clause_subsumption: 2
% 0.20/0.44 % res_orphan_elimination: 0
% 0.20/0.44 % res_tautology_del: 0
% 0.20/0.44 % res_num_eq_res_simplified: 0
% 0.20/0.44 % res_num_sel_changes: 0
% 0.20/0.44 % res_moves_from_active_to_pass: 0
% 0.20/0.44
% 0.20/0.44 % Status Unsatisfiable
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 % SZS output start CNFRefutation
% 0.20/0.44 % Axioms transformation by autotheo
% 0.20/0.44 % Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% 0.20/0.44 % Orienting axioms whose shape is orientable
% 0.20/0.44 % Start CNF derivation
% 0.20/0.44 % End CNF derivation
% 0.20/0.44 % Orienting (remaining) axiom formulas using strategy ClausalAll
% 0.20/0.44 % CNF of (remaining) axioms:
% 0.20/0.44 % Start CNF derivation
% 0.20/0.44 % End CNF derivation
% 0.20/0.44 % Generating one_way clauses for all literals in the CNF.
% 0.20/0.44 % CNF of non-axioms
% 0.20/0.44 % Start CNF derivation
% 0.20/0.44 fof(c_0_0, conjecture, (![X1]:![X2]:(q(f(X1))=>?[X3]:?[X4]:((p(f(X4))=>(p(X3)&(r(X4)=>(r(X1)&r(X2)))))&q(X3)))), file('<stdin>', prove_this)).
% 0.20/0.44 fof(c_0_1, negated_conjecture, (~(![X1]:![X2]:(q(f(X1))=>?[X3]:?[X4]:((p(f(X4))=>(p(X3)&(r(X4)=>(r(X1)&r(X2)))))&q(X3))))), inference(assume_negation,[status(cth)],[c_0_0])).
% 0.20/0.44 fof(c_0_2, negated_conjecture, (![X7]:![X8]:![X9]:(q(f(esk1_0))&((p(f(X8))|~q(X7))&(((r(X9)|~p(X7))|~q(X7))&(((~r(esk1_0)|~r(esk2_0))|~p(X7))|~q(X7)))))), 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.20/0.44 cnf(c_0_3,negated_conjecture,(~q(X1)|~p(X1)|~r(esk2_0)|~r(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.44 cnf(c_0_4,negated_conjecture,(r(X2)|~q(X1)|~p(X1)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.44 cnf(c_0_5,negated_conjecture,(p(f(X2))|~q(X1)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.44 cnf(c_0_6,negated_conjecture,(q(f(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.44 cnf(c_0_7,negated_conjecture,(~q(X1)|~p(X1)|~r(esk2_0)|~r(esk1_0)), c_0_3, ['final']).
% 0.20/0.44 cnf(c_0_8,negated_conjecture,(r(X2)|~q(X1)|~p(X1)), c_0_4, ['final']).
% 0.20/0.44 cnf(c_0_9,negated_conjecture,(p(f(X2))|~q(X1)), c_0_5, ['final']).
% 0.20/0.44 cnf(c_0_10,negated_conjecture,(q(f(esk1_0))), c_0_6, ['final']).
% 0.20/0.44 % End CNF derivation
% 0.20/0.44
% 0.20/0.44 %-------------------------------------------------------------
% 0.20/0.44 % Proof by iprover
% 0.20/0.45
% 0.20/0.45 cnf(c_2,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | p(f(X1)) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_eee26e.p', c_0_9) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_17,negated_conjecture,
% 0.20/0.45 ( sP0_iProver_split | sP1_iProver_split ),
% 0.20/0.45 inference(splitting,
% 0.20/0.45 [splitting(split),new_symbols(definition,[sP1_iProver_split,
% 0.20/0.45 sP0_iProver_split])],
% 0.20/0.45 [c_2]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_43,negated_conjecture,
% 0.20/0.45 ( sP0_iProver_split | sP1_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_68,negated_conjecture,
% 0.20/0.45 ( sP0_iProver_split | sP1_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_43]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_77,negated_conjecture,
% 0.20/0.45 ( sP0_iProver_split | sP1_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_68]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_8,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ sP1_iProver_split ),
% 0.20/0.45 inference(splitting,
% 0.20/0.45 [splitting(split),new_symbols(definition,[sP1_iProver_split])],
% 0.20/0.45 [c_2]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_16,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ sP1_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_41,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ sP1_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_67,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ sP1_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_41]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_78,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ sP1_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_67]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_106,plain,
% 0.20/0.45 ( ~ q(X0) | sP0_iProver_split ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_77,c_78]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_114,plain,
% 0.20/0.45 ( ~ q(X0) | sP0_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_106]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_117,plain,
% 0.20/0.45 ( ~ q(X0) | sP0_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_114]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_131,plain,
% 0.20/0.45 ( ~ q(X0) | sP0_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_117]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_142,plain,
% 0.20/0.45 ( ~ q(X0) | sP0_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_131]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_3,negated_conjecture,
% 0.20/0.45 ( q(f(sk3_esk1_0)) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_eee26e.p', c_0_10) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_45,negated_conjecture,
% 0.20/0.45 ( q(f(sk3_esk1_0)) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_65,negated_conjecture,
% 0.20/0.45 ( q(f(sk3_esk1_0)) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_45]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_80,negated_conjecture,
% 0.20/0.45 ( q(f(sk3_esk1_0)) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_65]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_128,negated_conjecture,
% 0.20/0.45 ( q(f(sk3_esk1_0)) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_80]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_136,negated_conjecture,
% 0.20/0.45 ( q(f(sk3_esk1_0)) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_128]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_154,plain,
% 0.20/0.45 ( sP0_iProver_split ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_142,c_136]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_155,plain,
% 0.20/0.45 ( sP0_iProver_split ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_154]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_7,negated_conjecture,
% 0.20/0.45 ( p(f(X0)) | ~ sP0_iProver_split ),
% 0.20/0.45 inference(splitting,
% 0.20/0.45 [splitting(split),new_symbols(definition,[sP0_iProver_split])],
% 0.20/0.45 [c_2]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_15,negated_conjecture,
% 0.20/0.45 ( p(f(X0)) | ~ sP0_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_39,negated_conjecture,
% 0.20/0.45 ( p(f(X0)) | ~ sP0_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_66,negated_conjecture,
% 0.20/0.45 ( p(f(X0)) | ~ sP0_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_39]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_79,negated_conjecture,
% 0.20/0.45 ( p(f(X0)) | ~ sP0_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_66]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_129,negated_conjecture,
% 0.20/0.45 ( p(f(X0)) | ~ sP0_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_79]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_138,negated_conjecture,
% 0.20/0.45 ( p(f(X0)) | ~ sP0_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_129]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_170,negated_conjecture,
% 0.20/0.45 ( p(f(X0)) ),
% 0.20/0.45 inference(backward_subsumption_resolution,[status(thm)],[c_155,c_138]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_171,plain,( p(f(X0)) ),inference(rewriting,[status(thm)],[c_170]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_1,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ p(X0) | r(X1) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_eee26e.p', c_0_8) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_20,negated_conjecture,
% 0.20/0.45 ( sP2_iProver_split | sP3_iProver_split ),
% 0.20/0.45 inference(splitting,
% 0.20/0.45 [splitting(split),new_symbols(definition,[sP3_iProver_split,
% 0.20/0.45 sP2_iProver_split])],
% 0.20/0.45 [c_1]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_37,negated_conjecture,
% 0.20/0.45 ( sP2_iProver_split | sP3_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_71,negated_conjecture,
% 0.20/0.45 ( sP2_iProver_split | sP3_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_37]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_74,negated_conjecture,
% 0.20/0.45 ( sP2_iProver_split | sP3_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_71]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_10,negated_conjecture,
% 0.20/0.45 ( r(X0) | ~ sP2_iProver_split ),
% 0.20/0.45 inference(splitting,
% 0.20/0.45 [splitting(split),new_symbols(definition,[sP2_iProver_split])],
% 0.20/0.45 [c_1]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_18,negated_conjecture,
% 0.20/0.45 ( r(X0) | ~ sP2_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_33,negated_conjecture,
% 0.20/0.45 ( r(X0) | ~ sP2_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_69,negated_conjecture,
% 0.20/0.45 ( r(X0) | ~ sP2_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_33]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_76,negated_conjecture,
% 0.20/0.45 ( r(X0) | ~ sP2_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_69]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_81,plain,
% 0.20/0.45 ( r(X0) | sP3_iProver_split ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_74,c_76]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_89,plain,
% 0.20/0.45 ( r(X0) | sP3_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_81]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_0,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ p(X0) | ~ r(sk3_esk2_0) | ~ r(sk3_esk1_0) ),
% 0.20/0.45 file('/export/starexec/sandbox/tmp/iprover_modulo_eee26e.p', c_0_7) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_22,negated_conjecture,
% 0.20/0.45 ( ~ r(sk3_esk2_0) | ~ r(sk3_esk1_0) | sP3_iProver_split ),
% 0.20/0.45 inference(splitting,
% 0.20/0.45 [splitting(split),new_symbols(definition,[sP3_iProver_split,
% 0.20/0.45 ~ r(sk3_esk2_0),
% 0.20/0.45 ~ r(sk3_esk1_0)])],
% 0.20/0.45 [c_0]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_14,negated_conjecture,
% 0.20/0.45 ( ~ r(sk3_esk2_0) | ~ r(sk3_esk1_0) | sP3_iProver_split ),
% 0.20/0.45 inference(splitting,
% 0.20/0.45 [splitting(split),new_symbols(definition,[sP3_iProver_split,
% 0.20/0.45 ~ r(sk3_esk2_0),
% 0.20/0.45 ~ r(sk3_esk1_0)])],
% 0.20/0.45 [c_0]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_27,negated_conjecture,
% 0.20/0.45 ( ~ r(sk3_esk2_0) | sP3_iProver_split ),
% 0.20/0.45 inference(global_propositional_subsumption,[status(thm)],[c_14,c_27]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_28,negated_conjecture,
% 0.20/0.45 ( ~ r(sk3_esk2_0) | sP3_iProver_split ),
% 0.20/0.45 inference(global_propositional_subsumption,[status(thm)],[c_22,c_27]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_31,negated_conjecture,
% 0.20/0.45 ( ~ r(sk3_esk2_0) | sP3_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_28]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_72,negated_conjecture,
% 0.20/0.45 ( ~ r(sk3_esk2_0) | sP3_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_73,negated_conjecture,
% 0.20/0.45 ( ~ r(sk3_esk2_0) | sP3_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_72]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_91,negated_conjecture,
% 0.20/0.45 ( sP3_iProver_split ),
% 0.20/0.45 inference(backward_subsumption_resolution,[status(thm)],[c_89,c_73]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_92,plain,( sP3_iProver_split ),inference(copy,[status(esa)],[c_91]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_11,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ p(X0) | ~ sP3_iProver_split ),
% 0.20/0.45 inference(splitting,
% 0.20/0.45 [splitting(split),new_symbols(definition,[sP3_iProver_split])],
% 0.20/0.45 [c_1]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_21,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ p(X0) | ~ sP3_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_29,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ p(X0) | ~ sP3_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_21]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_70,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ p(X0) | ~ sP3_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_75,negated_conjecture,
% 0.20/0.45 ( ~ q(X0) | ~ p(X0) | ~ sP3_iProver_split ),
% 0.20/0.45 inference(copy,[status(esa)],[c_70]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_94,plain,
% 0.20/0.45 ( ~ q(X0) | ~ p(X0) ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_92,c_75]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_102,plain,( ~ q(X0) | ~ p(X0) ),inference(copy,[status(esa)],[c_94]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_105,plain,
% 0.20/0.45 ( ~ q(X0) | ~ p(X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_102]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_130,plain,
% 0.20/0.45 ( ~ q(X0) | ~ p(X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_105]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_140,plain,
% 0.20/0.45 ( ~ q(X0) | ~ p(X0) ),
% 0.20/0.45 inference(copy,[status(esa)],[c_130]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_174,plain,
% 0.20/0.45 ( ~ q(f(X0)) ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_171,c_140]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_175,plain,( ~ q(f(X0)) ),inference(rewriting,[status(thm)],[c_174]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_178,plain,
% 0.20/0.45 ( $false ),
% 0.20/0.45 inference(backward_subsumption_resolution,[status(thm)],[c_175,c_136]) ).
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % SZS output end CNFRefutation
%------------------------------------------------------------------------------