TSTP Solution File: LAT268-10 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LAT268-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 : 300s
% DateTime : Thu Aug 31 06:17:12 EDT 2023
% Result : Unsatisfiable 2.66s 1.15s
% Output : CNFRefutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 13 RR)
% Number of literals : 23 ( 22 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 10 con; 0-4 aty)
% Number of variables : 22 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(c_50,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_51,negated_conjecture,
c_in(v_x,v_S,t_a) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_52,negated_conjecture,
c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_53,plain,
c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) = v_A,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_OA_A_61_61_Apset_Acl_0) ).
cnf(c_54,plain,
ifeq(c_lessequals(X0,c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),tc_set(X2)),true,ifeq(c_in(X1,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit)),true,ifeq(c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit)),true,ifeq(c_in(X3,X0,X2),true,c_in(c_Pair(X3,c_Tarski_Olub(X0,X1,X2),X2,X2),c_Tarski_Opotype_Oorder(X1,X2,tc_Product__Type_Ounit),tc_prod(X2,X2)),true),true),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_OCL_Olub__upper_0) ).
cnf(c_55,plain,
ifeq(c_in(c_Pair(X0,X1,X2,X2),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X3,X2),X2,tc_Product__Type_Ounit),tc_prod(X2,X2)),true,c_in(c_Pair(X1,X0,X2,X2),c_Tarski_Opotype_Oorder(X3,X2,tc_Product__Type_Ounit),tc_prod(X2,X2)),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0) ).
cnf(c_56,plain,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0) ).
cnf(c_57,plain,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_Odual_Acl_A_58_APartialOrder_0) ).
cnf(c_58,plain,
c_Tarski_Olub(X0,c_Tarski_Odual(X1,X2),X2) = c_Tarski_Oglb(X0,X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_Oglb__dual__lub_0) ).
cnf(c_59,plain,
c_Tarski_Opotype_Opset(c_Tarski_Odual(X0,X1),X1,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(X0,X1,tc_Product__Type_Ounit),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0) ).
cnf(c_60,plain,
c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit) = v_r,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_Or_A_61_61_Aorder_Acl_0) ).
cnf(c_252,plain,
ifeq(c_lessequals(v_S,c_Tarski_Opotype_Opset(X0,t_a,tc_Product__Type_Ounit),tc_set(t_a)),true,ifeq(c_in(X0,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),true,ifeq(c_in(X0,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),true,ifeq(true,true,c_in(c_Pair(v_x,c_Tarski_Olub(v_S,X0,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(X0,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)),true),true),true),true) = true,
inference(superposition,[status(thm)],[c_51,c_54]) ).
cnf(c_270,plain,
ifeq(c_in(c_Pair(X0,X1,t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)),true,c_in(c_Pair(X1,X0,t_a,t_a),v_r,tc_prod(t_a,t_a)),true) = true,
inference(superposition,[status(thm)],[c_60,c_55]) ).
cnf(c_281,plain,
ifeq(c_lessequals(v_S,c_Tarski_Opotype_Opset(X0,t_a,tc_Product__Type_Ounit),tc_set(t_a)),true,ifeq(c_in(X0,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),true,ifeq(c_in(X0,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),true,c_in(c_Pair(v_x,c_Tarski_Olub(v_S,X0,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(X0,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)),true),true),true) = true,
inference(demodulation,[status(thm)],[c_252,c_49]) ).
cnf(c_283,plain,
ifeq(c_lessequals(v_S,c_Tarski_Opotype_Opset(X0,t_a,tc_Product__Type_Ounit),tc_set(t_a)),true,ifeq(c_in(c_Tarski_Odual(X0,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),true,ifeq(c_in(c_Tarski_Odual(X0,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),true,c_in(c_Pair(v_x,c_Tarski_Olub(v_S,c_Tarski_Odual(X0,t_a),t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X0,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)),true),true),true) = true,
inference(superposition,[status(thm)],[c_59,c_281]) ).
cnf(c_294,plain,
ifeq(c_lessequals(v_S,c_Tarski_Opotype_Opset(X0,t_a,tc_Product__Type_Ounit),tc_set(t_a)),true,ifeq(c_in(c_Tarski_Odual(X0,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),true,ifeq(c_in(c_Tarski_Odual(X0,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),true,c_in(c_Pair(v_x,c_Tarski_Oglb(v_S,X0,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X0,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)),true),true),true) = true,
inference(demodulation,[status(thm)],[c_283,c_58]) ).
cnf(c_298,plain,
ifeq(c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)),true,ifeq(c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),true,ifeq(true,true,c_in(c_Pair(v_x,c_Tarski_Oglb(v_S,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)),true),true),true) = true,
inference(superposition,[status(thm)],[c_57,c_294]) ).
cnf(c_299,plain,
ifeq(true,true,ifeq(true,true,ifeq(true,true,c_in(c_Pair(v_x,c_Tarski_Oglb(v_S,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)),true),true),true) = true,
inference(light_normalisation,[status(thm)],[c_298,c_50,c_53,c_56]) ).
cnf(c_303,plain,
c_in(c_Pair(v_x,c_Tarski_Oglb(v_S,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)) = true,
inference(demodulation,[status(thm)],[c_299,c_49]) ).
cnf(c_307,plain,
ifeq(true,true,c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),true) = true,
inference(superposition,[status(thm)],[c_303,c_270]) ).
cnf(c_312,plain,
c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)) = true,
inference(demodulation,[status(thm)],[c_307,c_49]) ).
cnf(c_313,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_312,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT268-10 : TPTP v8.1.2. Released v7.5.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n017.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 : 300
% 0.13/0.34 % DateTime : Thu Aug 24 07:04:24 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running UEQ theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.66/1.15 % SZS status Started for theBenchmark.p
% 2.66/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 2.66/1.15
% 2.66/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.66/1.15
% 2.66/1.15 ------ iProver source info
% 2.66/1.15
% 2.66/1.15 git: date: 2023-05-31 18:12:56 +0000
% 2.66/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.66/1.15 git: non_committed_changes: false
% 2.66/1.15 git: last_make_outside_of_git: false
% 2.66/1.15
% 2.66/1.15 ------ Parsing...successful
% 2.66/1.15
% 2.66/1.15
% 2.66/1.15
% 2.66/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.66/1.15
% 2.66/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.66/1.15
% 2.66/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.66/1.15 ------ Proving...
% 2.66/1.15 ------ Problem Properties
% 2.66/1.15
% 2.66/1.15
% 2.66/1.15 clauses 12
% 2.66/1.15 conjectures 3
% 2.66/1.15 EPR 0
% 2.66/1.15 Horn 12
% 2.66/1.15 unary 12
% 2.66/1.15 binary 0
% 2.66/1.15 lits 12
% 2.66/1.15 lits eq 12
% 2.66/1.15 fd_pure 0
% 2.66/1.15 fd_pseudo 0
% 2.66/1.15 fd_cond 0
% 2.66/1.15 fd_pseudo_cond 0
% 2.66/1.15 AC symbols 0
% 2.66/1.15
% 2.66/1.15 ------ Input Options Time Limit: Unbounded
% 2.66/1.15
% 2.66/1.15
% 2.66/1.15 ------
% 2.66/1.15 Current options:
% 2.66/1.15 ------
% 2.66/1.15
% 2.66/1.15 ------ Input Options
% 2.66/1.15
% 2.66/1.15 --out_options all
% 2.66/1.15 --tptp_safe_out true
% 2.66/1.15 --problem_path ""
% 2.66/1.15 --include_path ""
% 2.66/1.15 --clausifier res/vclausify_rel
% 2.66/1.15 --clausifier_options --mode clausify -t 305.00
% 2.66/1.15 --stdin false
% 2.66/1.15 --proof_out true
% 2.66/1.15 --proof_dot_file ""
% 2.66/1.15 --proof_reduce_dot []
% 2.66/1.15 --suppress_sat_res true
% 2.66/1.15 --suppress_unsat_res false
% 2.66/1.15 --stats_out all
% 2.66/1.15 --stats_mem false
% 2.66/1.15 --theory_stats_out false
% 2.66/1.15
% 2.66/1.15 ------ General Options
% 2.66/1.15
% 2.66/1.15 --fof false
% 2.66/1.15 --time_out_real 305.
% 2.66/1.15 --time_out_virtual -1.
% 2.66/1.15 --rnd_seed 13
% 2.66/1.15 --symbol_type_check false
% 2.66/1.15 --clausify_out false
% 2.66/1.15 --sig_cnt_out false
% 2.66/1.15 --trig_cnt_out false
% 2.66/1.15 --trig_cnt_out_tolerance 1.
% 2.66/1.15 --trig_cnt_out_sk_spl false
% 2.66/1.15 --abstr_cl_out false
% 2.66/1.15
% 2.66/1.15 ------ Interactive Mode
% 2.66/1.15
% 2.66/1.15 --interactive_mode false
% 2.66/1.15 --external_ip_address ""
% 2.66/1.15 --external_port 0
% 2.66/1.15
% 2.66/1.15 ------ Global Options
% 2.66/1.15
% 2.66/1.15 --schedule none
% 2.66/1.15 --add_important_lit false
% 2.66/1.15 --prop_solver_per_cl 500
% 2.66/1.15 --subs_bck_mult 8
% 2.66/1.15 --min_unsat_core false
% 2.66/1.15 --soft_assumptions false
% 2.66/1.15 --soft_lemma_size 3
% 2.66/1.15 --prop_impl_unit_size 0
% 2.66/1.15 --prop_impl_unit []
% 2.66/1.15 --share_sel_clauses true
% 2.66/1.15 --reset_solvers false
% 2.66/1.15 --bc_imp_inh [conj_cone]
% 2.66/1.15 --conj_cone_tolerance 3.
% 2.66/1.15 --extra_neg_conj none
% 2.66/1.15 --large_theory_mode true
% 2.66/1.15 --prolific_symb_bound 200
% 2.66/1.15 --lt_threshold 2000
% 2.66/1.15 --clause_weak_htbl true
% 2.66/1.15 --gc_record_bc_elim false
% 2.66/1.15
% 2.66/1.15 ------ Preprocessing Options
% 2.66/1.15
% 2.66/1.15 --preprocessing_flag true
% 2.66/1.15 --time_out_prep_mult 0.1
% 2.66/1.15 --splitting_mode input
% 2.66/1.15 --splitting_grd true
% 2.66/1.15 --splitting_cvd false
% 2.66/1.15 --splitting_cvd_svl false
% 2.66/1.15 --splitting_nvd 32
% 2.66/1.15 --sub_typing false
% 2.66/1.15 --prep_gs_sim true
% 2.66/1.15 --prep_unflatten true
% 2.66/1.15 --prep_res_sim true
% 2.66/1.15 --prep_sup_sim_all true
% 2.66/1.15 --prep_sup_sim_sup false
% 2.66/1.15 --prep_upred true
% 2.66/1.15 --prep_well_definedness true
% 2.66/1.15 --prep_sem_filter exhaustive
% 2.66/1.15 --prep_sem_filter_out false
% 2.66/1.15 --pred_elim true
% 2.66/1.15 --res_sim_input true
% 2.66/1.15 --eq_ax_congr_red true
% 2.66/1.15 --pure_diseq_elim true
% 2.66/1.15 --brand_transform false
% 2.66/1.15 --non_eq_to_eq false
% 2.66/1.15 --prep_def_merge true
% 2.66/1.15 --prep_def_merge_prop_impl false
% 2.66/1.15 --prep_def_merge_mbd true
% 2.66/1.15 --prep_def_merge_tr_red false
% 2.66/1.15 --prep_def_merge_tr_cl false
% 2.66/1.15 --smt_preprocessing false
% 2.66/1.15 --smt_ac_axioms fast
% 2.66/1.15 --preprocessed_out false
% 2.66/1.15 --preprocessed_stats false
% 2.66/1.15
% 2.66/1.15 ------ Abstraction refinement Options
% 2.66/1.15
% 2.66/1.15 --abstr_ref []
% 2.66/1.15 --abstr_ref_prep false
% 2.66/1.15 --abstr_ref_until_sat false
% 2.66/1.15 --abstr_ref_sig_restrict funpre
% 2.66/1.15 --abstr_ref_af_restrict_to_split_sk false
% 2.66/1.15 --abstr_ref_under []
% 2.66/1.15
% 2.66/1.15 ------ SAT Options
% 2.66/1.15
% 2.66/1.15 --sat_mode false
% 2.66/1.15 --sat_fm_restart_options ""
% 2.66/1.15 --sat_gr_def false
% 2.66/1.15 --sat_epr_types true
% 2.66/1.15 --sat_non_cyclic_types false
% 2.66/1.15 --sat_finite_models false
% 2.66/1.15 --sat_fm_lemmas false
% 2.66/1.15 --sat_fm_prep false
% 2.66/1.15 --sat_fm_uc_incr true
% 2.66/1.15 --sat_out_model small
% 2.66/1.15 --sat_out_clauses false
% 2.66/1.15
% 2.66/1.15 ------ QBF Options
% 2.66/1.15
% 2.66/1.15 --qbf_mode false
% 2.66/1.15 --qbf_elim_univ false
% 2.66/1.15 --qbf_dom_inst none
% 2.66/1.15 --qbf_dom_pre_inst false
% 2.66/1.15 --qbf_sk_in false
% 2.66/1.15 --qbf_pred_elim true
% 2.66/1.15 --qbf_split 512
% 2.66/1.15
% 2.66/1.15 ------ BMC1 Options
% 2.66/1.15
% 2.66/1.15 --bmc1_incremental false
% 2.66/1.15 --bmc1_axioms reachable_all
% 2.66/1.15 --bmc1_min_bound 0
% 2.66/1.15 --bmc1_max_bound -1
% 2.66/1.15 --bmc1_max_bound_default -1
% 2.66/1.15 --bmc1_symbol_reachability true
% 2.66/1.15 --bmc1_property_lemmas false
% 2.66/1.15 --bmc1_k_induction false
% 2.66/1.15 --bmc1_non_equiv_states false
% 2.66/1.15 --bmc1_deadlock false
% 2.66/1.15 --bmc1_ucm false
% 2.66/1.15 --bmc1_add_unsat_core none
% 2.66/1.15 --bmc1_unsat_core_children false
% 2.66/1.15 --bmc1_unsat_core_extrapolate_axioms false
% 2.66/1.15 --bmc1_out_stat full
% 2.66/1.15 --bmc1_ground_init false
% 2.66/1.15 --bmc1_pre_inst_next_state false
% 2.66/1.15 --bmc1_pre_inst_state false
% 2.66/1.15 --bmc1_pre_inst_reach_state false
% 2.66/1.15 --bmc1_out_unsat_core false
% 2.66/1.15 --bmc1_aig_witness_out false
% 2.66/1.15 --bmc1_verbose false
% 2.66/1.15 --bmc1_dump_clauses_tptp false
% 2.66/1.15 --bmc1_dump_unsat_core_tptp false
% 2.66/1.15 --bmc1_dump_file -
% 2.66/1.15 --bmc1_ucm_expand_uc_limit 128
% 2.66/1.15 --bmc1_ucm_n_expand_iterations 6
% 2.66/1.15 --bmc1_ucm_extend_mode 1
% 2.66/1.15 --bmc1_ucm_init_mode 2
% 2.66/1.15 --bmc1_ucm_cone_mode none
% 2.66/1.15 --bmc1_ucm_reduced_relation_type 0
% 2.66/1.15 --bmc1_ucm_relax_model 4
% 2.66/1.15 --bmc1_ucm_full_tr_after_sat true
% 2.66/1.15 --bmc1_ucm_expand_neg_assumptions false
% 2.66/1.15 --bmc1_ucm_layered_model none
% 2.66/1.15 --bmc1_ucm_max_lemma_size 10
% 2.66/1.15
% 2.66/1.15 ------ AIG Options
% 2.66/1.15
% 2.66/1.15 --aig_mode false
% 2.66/1.15
% 2.66/1.15 ------ Instantiation Options
% 2.66/1.15
% 2.66/1.15 --instantiation_flag true
% 2.66/1.15 --inst_sos_flag false
% 2.66/1.15 --inst_sos_phase true
% 2.66/1.15 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 2.66/1.15 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.66/1.15 --inst_lit_sel_side num_symb
% 2.66/1.15 --inst_solver_per_active 1400
% 2.66/1.15 --inst_solver_calls_frac 1.
% 2.66/1.15 --inst_to_smt_solver true
% 2.66/1.15 --inst_passive_queue_type priority_queues
% 2.66/1.15 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.66/1.15 --inst_passive_queues_freq [25;2]
% 2.66/1.15 --inst_dismatching true
% 2.66/1.15 --inst_eager_unprocessed_to_passive true
% 2.66/1.15 --inst_unprocessed_bound 1000
% 2.66/1.15 --inst_prop_sim_given true
% 2.66/1.15 --inst_prop_sim_new false
% 2.66/1.15 --inst_subs_new false
% 2.66/1.15 --inst_eq_res_simp false
% 2.66/1.15 --inst_subs_given false
% 2.66/1.15 --inst_orphan_elimination true
% 2.66/1.15 --inst_learning_loop_flag true
% 2.66/1.15 --inst_learning_start 3000
% 2.66/1.15 --inst_learning_factor 2
% 2.66/1.15 --inst_start_prop_sim_after_learn 3
% 2.66/1.15 --inst_sel_renew solver
% 2.66/1.15 --inst_lit_activity_flag true
% 2.66/1.15 --inst_restr_to_given false
% 2.66/1.15 --inst_activity_threshold 500
% 2.66/1.15
% 2.66/1.15 ------ Resolution Options
% 2.66/1.15
% 2.66/1.15 --resolution_flag true
% 2.66/1.15 --res_lit_sel adaptive
% 2.66/1.15 --res_lit_sel_side none
% 2.66/1.15 --res_ordering kbo
% 2.66/1.15 --res_to_prop_solver active
% 2.66/1.15 --res_prop_simpl_new false
% 2.66/1.15 --res_prop_simpl_given true
% 2.66/1.15 --res_to_smt_solver true
% 2.66/1.15 --res_passive_queue_type priority_queues
% 2.66/1.15 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.66/1.15 --res_passive_queues_freq [15;5]
% 2.66/1.15 --res_forward_subs full
% 2.66/1.15 --res_backward_subs full
% 2.66/1.15 --res_forward_subs_resolution true
% 2.66/1.15 --res_backward_subs_resolution true
% 2.66/1.15 --res_orphan_elimination true
% 2.66/1.15 --res_time_limit 300.
% 2.66/1.15
% 2.66/1.15 ------ Superposition Options
% 2.66/1.15
% 2.66/1.15 --superposition_flag true
% 2.66/1.15 --sup_passive_queue_type priority_queues
% 2.66/1.15 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]]
% 2.66/1.15 --sup_passive_queues_freq [8;1;4;4]
% 2.66/1.15 --demod_completeness_check fast
% 2.66/1.15 --demod_use_ground true
% 2.66/1.15 --sup_unprocessed_bound 0
% 2.66/1.15 --sup_to_prop_solver passive
% 2.66/1.15 --sup_prop_simpl_new true
% 2.66/1.15 --sup_prop_simpl_given true
% 2.66/1.15 --sup_fun_splitting false
% 2.66/1.15 --sup_iter_deepening 2
% 2.66/1.15 --sup_restarts_mult 12
% 2.66/1.15 --sup_score sim_d_gen
% 2.66/1.15 --sup_share_score_frac 0.2
% 2.66/1.15 --sup_share_max_num_cl 500
% 2.66/1.15 --sup_ordering kbo
% 2.66/1.15 --sup_symb_ordering invfreq
% 2.66/1.15 --sup_term_weight default
% 2.66/1.15
% 2.66/1.15 ------ Superposition Simplification Setup
% 2.66/1.15
% 2.66/1.15 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 2.66/1.15 --sup_full_triv [SMTSimplify;PropSubs]
% 2.66/1.15 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.66/1.15 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.66/1.15 --sup_immed_triv []
% 2.66/1.15 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 2.66/1.15 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 2.66/1.15 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 2.66/1.15 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.66/1.15 --sup_input_triv [Unflattening;SMTSimplify]
% 2.66/1.15 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 2.66/1.15 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 2.66/1.15 --sup_full_fixpoint true
% 2.66/1.15 --sup_main_fixpoint true
% 2.66/1.15 --sup_immed_fixpoint false
% 2.66/1.15 --sup_input_fixpoint true
% 2.66/1.15 --sup_cache_sim none
% 2.66/1.15 --sup_smt_interval 500
% 2.66/1.15 --sup_bw_gjoin_interval 0
% 2.66/1.15
% 2.66/1.15 ------ Combination Options
% 2.66/1.15
% 2.66/1.15 --comb_mode clause_based
% 2.66/1.15 --comb_inst_mult 5
% 2.66/1.15 --comb_res_mult 1
% 2.66/1.15 --comb_sup_mult 8
% 2.66/1.15 --comb_sup_deep_mult 2
% 2.66/1.15
% 2.66/1.15 ------ Debug Options
% 2.66/1.15
% 2.66/1.15 --dbg_backtrace false
% 2.66/1.15 --dbg_dump_prop_clauses false
% 2.66/1.15 --dbg_dump_prop_clauses_file -
% 2.66/1.15 --dbg_out_stat false
% 2.66/1.15 --dbg_just_parse false
% 2.66/1.15
% 2.66/1.15
% 2.66/1.15
% 2.66/1.15
% 2.66/1.15 ------ Proving...
% 2.66/1.15
% 2.66/1.15
% 2.66/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 2.66/1.15
% 2.66/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.66/1.15
% 2.66/1.15 ------ Statistics
% 2.66/1.15
% 2.66/1.15 ------ Problem properties
% 2.66/1.15
% 2.66/1.15 clauses: 12
% 2.66/1.15 conjectures: 3
% 2.66/1.15 epr: 0
% 2.66/1.15 horn: 12
% 2.66/1.15 ground: 7
% 2.66/1.15 unary: 12
% 2.66/1.15 binary: 0
% 2.66/1.15 lits: 12
% 2.66/1.15 lits_eq: 12
% 2.66/1.15 fd_pure: 0
% 2.66/1.15 fd_pseudo: 0
% 2.66/1.15 fd_cond: 0
% 2.66/1.15 fd_pseudo_cond: 0
% 2.66/1.15 ac_symbols: 0
% 2.66/1.15
% 2.66/1.15 ------ General
% 2.66/1.15
% 2.66/1.15 abstr_ref_over_cycles: 0
% 2.66/1.15 abstr_ref_under_cycles: 0
% 2.66/1.15 gc_basic_clause_elim: 0
% 2.66/1.15 num_of_symbols: 118
% 2.66/1.15 num_of_terms: 826
% 2.66/1.15
% 2.66/1.15 parsing_time: 0.
% 2.66/1.15 unif_index_cands_time: 0.
% 2.66/1.15 unif_index_add_time: 0.
% 2.66/1.15 orderings_time: 0.
% 2.66/1.15 out_proof_time: 0.002
% 2.66/1.15 total_time: 0.09
% 2.66/1.15
% 2.66/1.15 ------ Preprocessing
% 2.66/1.15
% 2.66/1.15 num_of_splits: 0
% 2.66/1.15 num_of_split_atoms: 0
% 2.66/1.15 num_of_reused_defs: 0
% 2.66/1.15 num_eq_ax_congr_red: 4
% 2.66/1.15 num_of_sem_filtered_clauses: 0
% 2.66/1.15 num_of_subtypes: 0
% 2.66/1.15 monotx_restored_types: 0
% 2.66/1.15 sat_num_of_epr_types: 0
% 2.66/1.15 sat_num_of_non_cyclic_types: 0
% 2.66/1.15 sat_guarded_non_collapsed_types: 0
% 2.66/1.15 num_pure_diseq_elim: 0
% 2.66/1.15 simp_replaced_by: 0
% 2.66/1.15 res_preprocessed: 0
% 2.66/1.15 sup_preprocessed: 0
% 2.66/1.15 prep_upred: 0
% 2.66/1.15 prep_unflattend: 0
% 2.66/1.15 prep_well_definedness: 0
% 2.66/1.15 smt_new_axioms: 0
% 2.66/1.15 pred_elim_cands: 0
% 2.66/1.15 pred_elim: 0
% 2.66/1.15 pred_elim_cl: 0
% 2.66/1.15 pred_elim_cycles: 0
% 2.66/1.15 merged_defs: 0
% 2.66/1.15 merged_defs_ncl: 0
% 2.66/1.15 bin_hyper_res: 0
% 2.66/1.15 prep_cycles: 2
% 2.66/1.15
% 2.66/1.15 splitting_time: 0.
% 2.66/1.15 sem_filter_time: 0.002
% 2.66/1.15 monotx_time: 0.
% 2.66/1.15 subtype_inf_time: 0.
% 2.66/1.15 res_prep_time: 0.007
% 2.66/1.15 sup_prep_time: 0.001
% 2.66/1.15 pred_elim_time: 0.
% 2.66/1.15 bin_hyper_res_time: 0.
% 2.66/1.15 prep_time_total: 0.018
% 2.66/1.15
% 2.66/1.15 ------ Propositional Solver
% 2.66/1.15
% 2.66/1.15 prop_solver_calls: 8
% 2.66/1.15 prop_fast_solver_calls: 235
% 2.66/1.15 smt_solver_calls: 0
% 2.66/1.15 smt_fast_solver_calls: 0
% 2.66/1.15 prop_num_of_clauses: 77
% 2.66/1.15 prop_preprocess_simplified: 612
% 2.66/1.15 prop_fo_subsumed: 0
% 2.66/1.15
% 2.66/1.15 prop_solver_time: 0.
% 2.66/1.15 prop_fast_solver_time: 0.
% 2.66/1.15 prop_unsat_core_time: 0.
% 2.66/1.15 smt_solver_time: 0.
% 2.66/1.15 smt_fast_solver_time: 0.
% 2.66/1.15
% 2.66/1.15 ------ QBF
% 2.66/1.15
% 2.66/1.15 qbf_q_res: 0
% 2.66/1.15 qbf_num_tautologies: 0
% 2.66/1.15 qbf_prep_cycles: 0
% 2.66/1.15
% 2.66/1.15 ------ BMC1
% 2.66/1.15
% 2.66/1.15 bmc1_current_bound: -1
% 2.66/1.15 bmc1_last_solved_bound: -1
% 2.66/1.15 bmc1_unsat_core_size: -1
% 2.66/1.15 bmc1_unsat_core_parents_size: -1
% 2.66/1.15 bmc1_merge_next_fun: 0
% 2.66/1.15
% 2.66/1.15 bmc1_unsat_core_clauses_time: 0.
% 2.66/1.15
% 2.66/1.15 ------ Instantiation
% 2.66/1.15
% 2.66/1.15 inst_num_of_clauses: 26
% 2.66/1.15 inst_num_in_passive: 0
% 2.66/1.15 inst_num_in_active: 0
% 2.66/1.15 inst_num_of_loops: 0
% 2.66/1.15 inst_num_in_unprocessed: 26
% 2.66/1.15 inst_num_of_learning_restarts: 0
% 2.66/1.15 inst_num_moves_active_passive: 0
% 2.66/1.15 inst_lit_activity: 0
% 2.66/1.15 inst_lit_activity_moves: 0
% 2.66/1.15 inst_num_tautologies: 0
% 2.66/1.15 inst_num_prop_implied: 0
% 2.66/1.15 inst_num_existing_simplified: 0
% 2.66/1.15 inst_num_eq_res_simplified: 0
% 2.66/1.15 inst_num_child_elim: 0
% 2.66/1.15 inst_num_of_dismatching_blockings: 0
% 2.66/1.15 inst_num_of_non_proper_insts: 0
% 2.66/1.15 inst_num_of_duplicates: 0
% 2.66/1.15 inst_inst_num_from_inst_to_res: 0
% 2.66/1.15
% 2.66/1.15 inst_time_sim_new: 0.
% 2.66/1.15 inst_time_sim_given: 0.
% 2.66/1.15 inst_time_dismatching_checking: 0.
% 2.66/1.15 inst_time_total: 0.
% 2.66/1.15
% 2.66/1.15 ------ Resolution
% 2.66/1.15
% 2.66/1.15 res_num_of_clauses: 26
% 2.66/1.15 res_num_in_passive: 26
% 2.66/1.15 res_num_in_active: 0
% 2.66/1.15 res_num_of_loops: 40
% 2.66/1.15 res_forward_subset_subsumed: 0
% 2.66/1.15 res_backward_subset_subsumed: 0
% 2.66/1.15 res_forward_subsumed: 0
% 2.66/1.15 res_backward_subsumed: 0
% 2.66/1.15 res_forward_subsumption_resolution: 0
% 2.66/1.15 res_backward_subsumption_resolution: 0
% 2.66/1.15 res_clause_to_clause_subsumption: 164
% 2.66/1.15 res_subs_bck_cnt: 4
% 2.66/1.15 res_orphan_elimination: 0
% 2.66/1.15 res_tautology_del: 0
% 2.66/1.15 res_num_eq_res_simplified: 0
% 2.66/1.15 res_num_sel_changes: 0
% 2.66/1.15 res_moves_from_active_to_pass: 0
% 2.66/1.15
% 2.66/1.15 res_time_sim_new: 0.
% 2.66/1.15 res_time_sim_fw_given: 0.
% 2.66/1.15 res_time_sim_bw_given: 0.
% 2.66/1.15 res_time_total: 0.005
% 2.66/1.15
% 2.66/1.15 ------ Superposition
% 2.66/1.15
% 2.66/1.15 sup_num_of_clauses: 12
% 2.66/1.15 sup_num_in_active: 0
% 2.66/1.15 sup_num_in_passive: 12
% 2.66/1.15 sup_num_of_loops: 19
% 2.66/1.15 sup_fw_superposition: 21
% 2.66/1.15 sup_bw_superposition: 8
% 2.66/1.15 sup_eq_factoring: 0
% 2.66/1.15 sup_eq_resolution: 0
% 2.66/1.15 sup_immediate_simplified: 0
% 2.66/1.15 sup_given_eliminated: 0
% 2.66/1.15 comparisons_done: 75
% 2.66/1.15 comparisons_avoided: 0
% 2.66/1.15 comparisons_inc_criteria: 0
% 2.66/1.15 sup_deep_cl_discarded: 0
% 2.66/1.15 sup_num_of_deepenings: 0
% 2.66/1.15 sup_num_of_restarts: 0
% 2.66/1.15
% 2.66/1.15 sup_time_generating: 0.001
% 2.66/1.15 sup_time_sim_fw_full: 0.
% 2.66/1.15 sup_time_sim_bw_full: 0.031
% 2.66/1.15 sup_time_sim_fw_immed: 0.007
% 2.66/1.15 sup_time_sim_bw_immed: 0.
% 2.66/1.15 sup_time_prep_sim_fw_input: 0.
% 2.66/1.15 sup_time_prep_sim_bw_input: 0.
% 2.66/1.15 sup_time_total: 0.045
% 2.66/1.15
% 2.66/1.15 ------ Simplifications
% 2.66/1.15
% 2.66/1.15 sim_repeated: 6
% 2.66/1.15 sim_fw_subset_subsumed: 0
% 2.66/1.15 sim_bw_subset_subsumed: 0
% 2.66/1.15 sim_fw_subsumed: 0
% 2.66/1.15 sim_bw_subsumed: 0
% 2.66/1.15 sim_fw_subsumption_res: 0
% 2.66/1.15 sim_bw_subsumption_res: 0
% 2.66/1.15 sim_fw_unit_subs: 0
% 2.66/1.15 sim_bw_unit_subs: 0
% 2.66/1.15 sim_tautology_del: 0
% 2.66/1.15 sim_eq_tautology_del: 0
% 2.66/1.15 sim_eq_res_simp: 0
% 2.66/1.15 sim_fw_demodulated: 6
% 2.66/1.15 sim_bw_demodulated: 0
% 2.66/1.15 sim_encompassment_demod: 0
% 2.66/1.15 sim_light_normalised: 16
% 2.66/1.15 sim_ac_normalised: 0
% 2.66/1.15 sim_joinable_taut: 0
% 2.66/1.15 sim_joinable_simp: 0
% 2.66/1.15 sim_fw_ac_demod: 0
% 2.66/1.15 sim_bw_ac_demod: 0
% 2.66/1.15 sim_smt_subsumption: 0
% 2.66/1.15 sim_smt_simplified: 0
% 2.66/1.15 sim_ground_joinable: 0
% 2.66/1.15 sim_bw_ground_joinable: 0
% 2.66/1.15 sim_connectedness: 0
% 2.66/1.15
% 2.66/1.15 sim_time_fw_subset_subs: 0.
% 2.66/1.15 sim_time_bw_subset_subs: 0.
% 2.66/1.15 sim_time_fw_subs: 0.
% 2.66/1.15 sim_time_bw_subs: 0.
% 2.66/1.15 sim_time_fw_subs_res: 0.
% 2.66/1.15 sim_time_bw_subs_res: 0.
% 2.66/1.15 sim_time_fw_unit_subs: 0.001
% 2.66/1.15 sim_time_bw_unit_subs: 0.
% 2.66/1.15 sim_time_tautology_del: 0.
% 2.66/1.15 sim_time_eq_tautology_del: 0.
% 2.66/1.15 sim_time_eq_res_simp: 0.
% 2.66/1.15 sim_time_fw_demod: 0.
% 2.66/1.15 sim_time_bw_demod: 0.
% 2.66/1.15 sim_time_light_norm: 0.006
% 2.66/1.15 sim_time_joinable: 0.
% 2.66/1.15 sim_time_ac_norm: 0.
% 2.66/1.15 sim_time_fw_ac_demod: 0.
% 2.66/1.15 sim_time_bw_ac_demod: 0.
% 2.66/1.15 sim_time_smt_subs: 0.
% 2.66/1.15 sim_time_fw_gjoin: 0.
% 2.66/1.15 sim_time_fw_connected: 0.
% 2.66/1.15
% 2.66/1.15
%------------------------------------------------------------------------------