TSTP Solution File: GRP595-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP595-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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 01:00:38 EDT 2023
% Result : Unsatisfiable 0.45s 1.13s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of clauses : 40 ( 40 unt; 0 nHn; 4 RR)
% Number of literals : 40 ( 39 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(double_divide(X2,X1)))))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
inverse(double_divide(X0,X1)) = multiply(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_60,plain,
multiply(multiply(multiply(X0,X1),X2),double_divide(X2,X0)) = X1,
inference(demodulation,[status(thm)],[c_49,c_50]) ).
cnf(c_98,plain,
multiply(multiply(X0,X1),double_divide(X1,multiply(multiply(X2,X0),X3))) = double_divide(X3,X2),
inference(superposition,[status(thm)],[c_60,c_60]) ).
cnf(c_100,plain,
multiply(X0,double_divide(double_divide(X1,X2),multiply(X2,X0))) = X1,
inference(superposition,[status(thm)],[c_60,c_60]) ).
cnf(c_105,plain,
double_divide(double_divide(X0,X1),multiply(X1,X2)) = multiply(multiply(X0,X3),double_divide(X3,X2)),
inference(superposition,[status(thm)],[c_100,c_60]) ).
cnf(c_106,plain,
multiply(X0,double_divide(double_divide(double_divide(X0,X1),multiply(X1,multiply(X2,X3))),X2)) = X3,
inference(superposition,[status(thm)],[c_100,c_60]) ).
cnf(c_127,plain,
double_divide(multiply(X0,double_divide(X1,multiply(X2,X0))),X2) = X1,
inference(superposition,[status(thm)],[c_98,c_100]) ).
cnf(c_150,plain,
double_divide(double_divide(multiply(X0,X1),X2),multiply(X2,X0)) = X1,
inference(superposition,[status(thm)],[c_98,c_127]) ).
cnf(c_155,plain,
multiply(X0,multiply(X1,double_divide(X2,multiply(X0,X1)))) = inverse(X2),
inference(superposition,[status(thm)],[c_127,c_50]) ).
cnf(c_187,plain,
multiply(multiply(X0,X1),double_divide(multiply(X1,X2),X0)) = inverse(X2),
inference(superposition,[status(thm)],[c_150,c_50]) ).
cnf(c_385,plain,
multiply(inverse(X0),double_divide(double_divide(multiply(X1,X0),X2),X2)) = X1,
inference(superposition,[status(thm)],[c_187,c_60]) ).
cnf(c_493,plain,
double_divide(multiply(X0,X1),multiply(X2,inverse(X1))) = double_divide(X0,X2),
inference(superposition,[status(thm)],[c_385,c_127]) ).
cnf(c_596,plain,
multiply(X0,multiply(multiply(X1,X2),double_divide(X2,X0))) = X1,
inference(superposition,[status(thm)],[c_105,c_100]) ).
cnf(c_925,plain,
multiply(multiply(X0,multiply(X1,double_divide(X2,X0))),X2) = X1,
inference(superposition,[status(thm)],[c_100,c_596]) ).
cnf(c_1332,plain,
double_divide(multiply(inverse(X0),double_divide(X1,X2)),X2) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_493,c_127]) ).
cnf(c_1834,plain,
multiply(double_divide(multiply(X0,X1),X2),X1) = double_divide(X0,X2),
inference(superposition,[status(thm)],[c_385,c_1332]) ).
cnf(c_1976,plain,
multiply(X0,double_divide(X0,multiply(X1,X2))) = double_divide(X2,X1),
inference(superposition,[status(thm)],[c_127,c_1834]) ).
cnf(c_2009,plain,
double_divide(multiply(X0,double_divide(X1,X2)),X3) = multiply(multiply(X2,double_divide(X0,X3)),X1),
inference(superposition,[status(thm)],[c_1834,c_925]) ).
cnf(c_2267,plain,
double_divide(double_divide(multiply(X0,X1),X2),multiply(X2,X0)) = multiply(X3,double_divide(X3,inverse(X1))),
inference(superposition,[status(thm)],[c_187,c_1976]) ).
cnf(c_2294,plain,
double_divide(double_divide(X0,X1),X1) = X0,
inference(superposition,[status(thm)],[c_1976,c_127]) ).
cnf(c_2295,plain,
multiply(X0,double_divide(X1,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_1976,c_155]) ).
cnf(c_2296,plain,
inverse(multiply(X0,X1)) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_1976,c_187]) ).
cnf(c_2301,plain,
multiply(X0,double_divide(X0,inverse(X1))) = X1,
inference(light_normalisation,[status(thm)],[c_2267,c_150]) ).
cnf(c_2607,plain,
multiply(multiply(multiply(X0,X1),double_divide(X2,X0)),X2) = X1,
inference(superposition,[status(thm)],[c_2294,c_60]) ).
cnf(c_2612,plain,
double_divide(multiply(X0,X1),X2) = double_divide(X1,multiply(X2,X0)),
inference(superposition,[status(thm)],[c_2294,c_127]) ).
cnf(c_2613,plain,
inverse(double_divide(X0,multiply(X1,X2))) = multiply(X1,multiply(X2,X0)),
inference(superposition,[status(thm)],[c_2294,c_155]) ).
cnf(c_3386,plain,
double_divide(double_divide(X0,multiply(X1,X2)),multiply(X1,X0)) = X2,
inference(demodulation,[status(thm)],[c_2607,c_2009,c_2612]) ).
cnf(c_3412,plain,
inverse(double_divide(X0,multiply(X1,X2))) = multiply(multiply(X1,X0),X2),
inference(superposition,[status(thm)],[c_3386,c_2295]) ).
cnf(c_3421,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X2,X1)),
inference(light_normalisation,[status(thm)],[c_3412,c_2613]) ).
cnf(c_3429,plain,
multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(c3,b3)),
inference(demodulation,[status(thm)],[c_51,c_3421]) ).
cnf(c_3958,plain,
multiply(X0,double_divide(double_divide(double_divide(X0,X1),multiply(X1,X2)),X3)) = double_divide(X3,inverse(X2)),
inference(superposition,[status(thm)],[c_2301,c_106]) ).
cnf(c_3963,plain,
double_divide(X0,inverse(multiply(X0,X1))) = X1,
inference(demodulation,[status(thm)],[c_106,c_3958]) ).
cnf(c_3964,plain,
double_divide(X0,double_divide(X1,X0)) = X1,
inference(light_normalisation,[status(thm)],[c_3963,c_2296]) ).
cnf(c_4039,plain,
double_divide(X0,X1) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_2294,c_3964]) ).
cnf(c_4139,plain,
inverse(double_divide(X0,X1)) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_4039,c_50]) ).
cnf(c_5028,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_4139,c_50]) ).
cnf(c_5033,plain,
multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3)),
inference(demodulation,[status(thm)],[c_3429,c_5028]) ).
cnf(c_5035,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_5033]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP595-1 : TPTP v8.1.2. Released v2.6.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 21:10:24 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/0.46 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
% 0.45/1.13 % SZS status Started for theBenchmark.p
% 0.45/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/1.13
% 0.45/1.13 ------ iProver source info
% 0.45/1.13
% 0.45/1.13 git: date: 2023-05-31 18:12:56 +0000
% 0.45/1.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/1.13 git: non_committed_changes: false
% 0.45/1.13 git: last_make_outside_of_git: false
% 0.45/1.13
% 0.45/1.13 ------ Parsing...successful
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.45/1.13 ------ Proving...
% 0.45/1.13 ------ Problem Properties
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 clauses 3
% 0.45/1.13 conjectures 1
% 0.45/1.13 EPR 0
% 0.45/1.13 Horn 3
% 0.45/1.13 unary 3
% 0.45/1.13 binary 0
% 0.45/1.13 lits 3
% 0.45/1.13 lits eq 3
% 0.45/1.13 fd_pure 0
% 0.45/1.13 fd_pseudo 0
% 0.45/1.13 fd_cond 0
% 0.45/1.13 fd_pseudo_cond 0
% 0.45/1.13 AC symbols 0
% 0.45/1.13
% 0.45/1.13 ------ Input Options Time Limit: Unbounded
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 ------
% 0.45/1.13 Current options:
% 0.45/1.13 ------
% 0.45/1.13
% 0.45/1.13 ------ Input Options
% 0.45/1.13
% 0.45/1.13 --out_options all
% 0.45/1.13 --tptp_safe_out true
% 0.45/1.13 --problem_path ""
% 0.45/1.13 --include_path ""
% 0.45/1.13 --clausifier res/vclausify_rel
% 0.45/1.13 --clausifier_options --mode clausify -t 305.00
% 0.45/1.13 --stdin false
% 0.45/1.13 --proof_out true
% 0.45/1.13 --proof_dot_file ""
% 0.45/1.13 --proof_reduce_dot []
% 0.45/1.13 --suppress_sat_res true
% 0.45/1.13 --suppress_unsat_res false
% 0.45/1.13 --stats_out all
% 0.45/1.13 --stats_mem false
% 0.45/1.13 --theory_stats_out false
% 0.45/1.13
% 0.45/1.13 ------ General Options
% 0.45/1.13
% 0.45/1.13 --fof false
% 0.45/1.13 --time_out_real 305.
% 0.45/1.13 --time_out_virtual -1.
% 0.45/1.13 --rnd_seed 13
% 0.45/1.13 --symbol_type_check false
% 0.45/1.13 --clausify_out false
% 0.45/1.13 --sig_cnt_out false
% 0.45/1.13 --trig_cnt_out false
% 0.45/1.13 --trig_cnt_out_tolerance 1.
% 0.45/1.13 --trig_cnt_out_sk_spl false
% 0.45/1.13 --abstr_cl_out false
% 0.45/1.13
% 0.45/1.13 ------ Interactive Mode
% 0.45/1.13
% 0.45/1.13 --interactive_mode false
% 0.45/1.13 --external_ip_address ""
% 0.45/1.13 --external_port 0
% 0.45/1.13
% 0.45/1.13 ------ Global Options
% 0.45/1.13
% 0.45/1.13 --schedule none
% 0.45/1.13 --add_important_lit false
% 0.45/1.13 --prop_solver_per_cl 500
% 0.45/1.13 --subs_bck_mult 8
% 0.45/1.13 --min_unsat_core false
% 0.45/1.13 --soft_assumptions false
% 0.45/1.13 --soft_lemma_size 3
% 0.45/1.13 --prop_impl_unit_size 0
% 0.45/1.13 --prop_impl_unit []
% 0.45/1.13 --share_sel_clauses true
% 0.45/1.13 --reset_solvers false
% 0.45/1.13 --bc_imp_inh [conj_cone]
% 0.45/1.13 --conj_cone_tolerance 3.
% 0.45/1.13 --extra_neg_conj none
% 0.45/1.13 --large_theory_mode true
% 0.45/1.13 --prolific_symb_bound 200
% 0.45/1.13 --lt_threshold 2000
% 0.45/1.13 --clause_weak_htbl true
% 0.45/1.13 --gc_record_bc_elim false
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing Options
% 0.45/1.13
% 0.45/1.13 --preprocessing_flag true
% 0.45/1.13 --time_out_prep_mult 0.1
% 0.45/1.13 --splitting_mode input
% 0.45/1.13 --splitting_grd true
% 0.45/1.13 --splitting_cvd false
% 0.45/1.13 --splitting_cvd_svl false
% 0.45/1.13 --splitting_nvd 32
% 0.45/1.13 --sub_typing false
% 0.45/1.13 --prep_gs_sim true
% 0.45/1.13 --prep_unflatten true
% 0.45/1.13 --prep_res_sim true
% 0.45/1.13 --prep_sup_sim_all true
% 0.45/1.13 --prep_sup_sim_sup false
% 0.45/1.13 --prep_upred true
% 0.45/1.13 --prep_well_definedness true
% 0.45/1.13 --prep_sem_filter exhaustive
% 0.45/1.13 --prep_sem_filter_out false
% 0.45/1.13 --pred_elim true
% 0.45/1.13 --res_sim_input true
% 0.45/1.13 --eq_ax_congr_red true
% 0.45/1.13 --pure_diseq_elim true
% 0.45/1.13 --brand_transform false
% 0.45/1.13 --non_eq_to_eq false
% 0.45/1.13 --prep_def_merge true
% 0.45/1.13 --prep_def_merge_prop_impl false
% 0.45/1.13 --prep_def_merge_mbd true
% 0.45/1.13 --prep_def_merge_tr_red false
% 0.45/1.13 --prep_def_merge_tr_cl false
% 0.45/1.13 --smt_preprocessing false
% 0.45/1.13 --smt_ac_axioms fast
% 0.45/1.13 --preprocessed_out false
% 0.45/1.13 --preprocessed_stats false
% 0.45/1.13
% 0.45/1.13 ------ Abstraction refinement Options
% 0.45/1.13
% 0.45/1.13 --abstr_ref []
% 0.45/1.13 --abstr_ref_prep false
% 0.45/1.13 --abstr_ref_until_sat false
% 0.45/1.13 --abstr_ref_sig_restrict funpre
% 0.45/1.13 --abstr_ref_af_restrict_to_split_sk false
% 0.45/1.13 --abstr_ref_under []
% 0.45/1.13
% 0.45/1.13 ------ SAT Options
% 0.45/1.13
% 0.45/1.13 --sat_mode false
% 0.45/1.13 --sat_fm_restart_options ""
% 0.45/1.13 --sat_gr_def false
% 0.45/1.13 --sat_epr_types true
% 0.45/1.13 --sat_non_cyclic_types false
% 0.45/1.13 --sat_finite_models false
% 0.45/1.13 --sat_fm_lemmas false
% 0.45/1.13 --sat_fm_prep false
% 0.45/1.13 --sat_fm_uc_incr true
% 0.45/1.13 --sat_out_model small
% 0.45/1.13 --sat_out_clauses false
% 0.45/1.13
% 0.45/1.13 ------ QBF Options
% 0.45/1.13
% 0.45/1.13 --qbf_mode false
% 0.45/1.13 --qbf_elim_univ false
% 0.45/1.13 --qbf_dom_inst none
% 0.45/1.13 --qbf_dom_pre_inst false
% 0.45/1.13 --qbf_sk_in false
% 0.45/1.13 --qbf_pred_elim true
% 0.45/1.13 --qbf_split 512
% 0.45/1.13
% 0.45/1.13 ------ BMC1 Options
% 0.45/1.13
% 0.45/1.13 --bmc1_incremental false
% 0.45/1.13 --bmc1_axioms reachable_all
% 0.45/1.13 --bmc1_min_bound 0
% 0.45/1.13 --bmc1_max_bound -1
% 0.45/1.13 --bmc1_max_bound_default -1
% 0.45/1.13 --bmc1_symbol_reachability true
% 0.45/1.13 --bmc1_property_lemmas false
% 0.45/1.13 --bmc1_k_induction false
% 0.45/1.13 --bmc1_non_equiv_states false
% 0.45/1.13 --bmc1_deadlock false
% 0.45/1.13 --bmc1_ucm false
% 0.45/1.13 --bmc1_add_unsat_core none
% 0.45/1.13 --bmc1_unsat_core_children false
% 0.45/1.13 --bmc1_unsat_core_extrapolate_axioms false
% 0.45/1.13 --bmc1_out_stat full
% 0.45/1.13 --bmc1_ground_init false
% 0.45/1.13 --bmc1_pre_inst_next_state false
% 0.45/1.13 --bmc1_pre_inst_state false
% 0.45/1.13 --bmc1_pre_inst_reach_state false
% 0.45/1.13 --bmc1_out_unsat_core false
% 0.45/1.13 --bmc1_aig_witness_out false
% 0.45/1.13 --bmc1_verbose false
% 0.45/1.13 --bmc1_dump_clauses_tptp false
% 0.45/1.13 --bmc1_dump_unsat_core_tptp false
% 0.45/1.13 --bmc1_dump_file -
% 0.45/1.13 --bmc1_ucm_expand_uc_limit 128
% 0.45/1.13 --bmc1_ucm_n_expand_iterations 6
% 0.45/1.13 --bmc1_ucm_extend_mode 1
% 0.45/1.13 --bmc1_ucm_init_mode 2
% 0.45/1.13 --bmc1_ucm_cone_mode none
% 0.45/1.13 --bmc1_ucm_reduced_relation_type 0
% 0.45/1.13 --bmc1_ucm_relax_model 4
% 0.45/1.13 --bmc1_ucm_full_tr_after_sat true
% 0.45/1.13 --bmc1_ucm_expand_neg_assumptions false
% 0.45/1.13 --bmc1_ucm_layered_model none
% 0.45/1.13 --bmc1_ucm_max_lemma_size 10
% 0.45/1.13
% 0.45/1.13 ------ AIG Options
% 0.45/1.13
% 0.45/1.13 --aig_mode false
% 0.45/1.13
% 0.45/1.13 ------ Instantiation Options
% 0.45/1.13
% 0.45/1.13 --instantiation_flag true
% 0.45/1.13 --inst_sos_flag false
% 0.45/1.13 --inst_sos_phase true
% 0.45/1.13 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 0.45/1.13 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.45/1.13 --inst_lit_sel_side num_symb
% 0.45/1.13 --inst_solver_per_active 1400
% 0.45/1.13 --inst_solver_calls_frac 1.
% 0.45/1.13 --inst_to_smt_solver true
% 0.45/1.13 --inst_passive_queue_type priority_queues
% 0.45/1.13 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.45/1.13 --inst_passive_queues_freq [25;2]
% 0.45/1.13 --inst_dismatching true
% 0.45/1.13 --inst_eager_unprocessed_to_passive true
% 0.45/1.13 --inst_unprocessed_bound 1000
% 0.45/1.13 --inst_prop_sim_given true
% 0.45/1.13 --inst_prop_sim_new false
% 0.45/1.13 --inst_subs_new false
% 0.45/1.13 --inst_eq_res_simp false
% 0.45/1.13 --inst_subs_given false
% 0.45/1.13 --inst_orphan_elimination true
% 0.45/1.13 --inst_learning_loop_flag true
% 0.45/1.13 --inst_learning_start 3000
% 0.45/1.13 --inst_learning_factor 2
% 0.45/1.13 --inst_start_prop_sim_after_learn 3
% 0.45/1.13 --inst_sel_renew solver
% 0.45/1.13 --inst_lit_activity_flag true
% 0.45/1.13 --inst_restr_to_given false
% 0.45/1.13 --inst_activity_threshold 500
% 0.45/1.13
% 0.45/1.13 ------ Resolution Options
% 0.45/1.13
% 0.45/1.13 --resolution_flag true
% 0.45/1.13 --res_lit_sel adaptive
% 0.45/1.13 --res_lit_sel_side none
% 0.45/1.13 --res_ordering kbo
% 0.45/1.13 --res_to_prop_solver active
% 0.45/1.13 --res_prop_simpl_new false
% 0.45/1.13 --res_prop_simpl_given true
% 0.45/1.13 --res_to_smt_solver true
% 0.45/1.13 --res_passive_queue_type priority_queues
% 0.45/1.13 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.45/1.13 --res_passive_queues_freq [15;5]
% 0.45/1.13 --res_forward_subs full
% 0.45/1.13 --res_backward_subs full
% 0.45/1.13 --res_forward_subs_resolution true
% 0.45/1.13 --res_backward_subs_resolution true
% 0.45/1.13 --res_orphan_elimination true
% 0.45/1.13 --res_time_limit 300.
% 0.45/1.13
% 0.45/1.13 ------ Superposition Options
% 0.45/1.13
% 0.45/1.13 --superposition_flag true
% 0.45/1.13 --sup_passive_queue_type priority_queues
% 0.45/1.13 --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]]
% 0.45/1.13 --sup_passive_queues_freq [8;1;4;4]
% 0.45/1.13 --demod_completeness_check fast
% 0.45/1.13 --demod_use_ground true
% 0.45/1.13 --sup_unprocessed_bound 0
% 0.45/1.13 --sup_to_prop_solver passive
% 0.45/1.13 --sup_prop_simpl_new true
% 0.45/1.13 --sup_prop_simpl_given true
% 0.45/1.13 --sup_fun_splitting false
% 0.45/1.13 --sup_iter_deepening 2
% 0.45/1.13 --sup_restarts_mult 12
% 0.45/1.13 --sup_score sim_d_gen
% 0.45/1.13 --sup_share_score_frac 0.2
% 0.45/1.13 --sup_share_max_num_cl 500
% 0.45/1.13 --sup_ordering kbo
% 0.45/1.13 --sup_symb_ordering invfreq
% 0.45/1.13 --sup_term_weight default
% 0.45/1.13
% 0.45/1.13 ------ Superposition Simplification Setup
% 0.45/1.13
% 0.45/1.13 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 0.45/1.13 --sup_full_triv [SMTSimplify;PropSubs]
% 0.45/1.13 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.45/1.13 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.45/1.13 --sup_immed_triv []
% 0.45/1.13 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 0.45/1.13 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 0.45/1.13 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 0.45/1.13 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.45/1.13 --sup_input_triv [Unflattening;SMTSimplify]
% 0.45/1.13 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.45/1.13 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.45/1.13 --sup_full_fixpoint true
% 0.45/1.13 --sup_main_fixpoint true
% 0.45/1.13 --sup_immed_fixpoint false
% 0.45/1.13 --sup_input_fixpoint true
% 0.45/1.13 --sup_cache_sim none
% 0.45/1.13 --sup_smt_interval 500
% 0.45/1.13 --sup_bw_gjoin_interval 0
% 0.45/1.13
% 0.45/1.13 ------ Combination Options
% 0.45/1.13
% 0.45/1.13 --comb_mode clause_based
% 0.45/1.13 --comb_inst_mult 5
% 0.45/1.13 --comb_res_mult 1
% 0.45/1.13 --comb_sup_mult 8
% 0.45/1.13 --comb_sup_deep_mult 2
% 0.45/1.13
% 0.45/1.13 ------ Debug Options
% 0.45/1.13
% 0.45/1.13 --dbg_backtrace false
% 0.45/1.13 --dbg_dump_prop_clauses false
% 0.45/1.13 --dbg_dump_prop_clauses_file -
% 0.45/1.13 --dbg_out_stat false
% 0.45/1.13 --dbg_just_parse false
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 ------ Proving...
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.14
% 0.45/1.14 ------ Statistics
% 0.45/1.14
% 0.45/1.14 ------ Problem properties
% 0.45/1.14
% 0.45/1.14 clauses: 3
% 0.45/1.14 conjectures: 1
% 0.45/1.14 epr: 0
% 0.45/1.14 horn: 3
% 0.45/1.14 ground: 1
% 0.45/1.14 unary: 3
% 0.45/1.14 binary: 0
% 0.45/1.14 lits: 3
% 0.45/1.14 lits_eq: 3
% 0.45/1.14 fd_pure: 0
% 0.45/1.14 fd_pseudo: 0
% 0.45/1.14 fd_cond: 0
% 0.45/1.14 fd_pseudo_cond: 0
% 0.45/1.14 ac_symbols: 0
% 0.45/1.14
% 0.45/1.14 ------ General
% 0.45/1.14
% 0.45/1.14 abstr_ref_over_cycles: 0
% 0.45/1.14 abstr_ref_under_cycles: 0
% 0.45/1.14 gc_basic_clause_elim: 0
% 0.45/1.14 num_of_symbols: 102
% 0.45/1.14 num_of_terms: 13399
% 0.45/1.14
% 0.45/1.14 parsing_time: 0.
% 0.45/1.14 unif_index_cands_time: 0.009
% 0.45/1.14 unif_index_add_time: 0.002
% 0.45/1.14 orderings_time: 0.001
% 0.45/1.14 out_proof_time: 0.001
% 0.45/1.14 total_time: 0.339
% 0.45/1.14
% 0.45/1.14 ------ Preprocessing
% 0.45/1.14
% 0.45/1.14 num_of_splits: 0
% 0.45/1.14 num_of_split_atoms: 0
% 0.45/1.14 num_of_reused_defs: 0
% 0.45/1.14 num_eq_ax_congr_red: 4
% 0.45/1.14 num_of_sem_filtered_clauses: 0
% 0.45/1.14 num_of_subtypes: 0
% 0.45/1.14 monotx_restored_types: 0
% 0.45/1.14 sat_num_of_epr_types: 0
% 0.45/1.14 sat_num_of_non_cyclic_types: 0
% 0.45/1.14 sat_guarded_non_collapsed_types: 0
% 0.45/1.14 num_pure_diseq_elim: 0
% 0.45/1.14 simp_replaced_by: 0
% 0.45/1.14 res_preprocessed: 0
% 0.45/1.14 sup_preprocessed: 2
% 0.45/1.14 prep_upred: 0
% 0.45/1.14 prep_unflattend: 0
% 0.45/1.14 prep_well_definedness: 0
% 0.45/1.14 smt_new_axioms: 0
% 0.45/1.14 pred_elim_cands: 0
% 0.45/1.14 pred_elim: 0
% 0.45/1.14 pred_elim_cl: 0
% 0.45/1.14 pred_elim_cycles: 0
% 0.45/1.14 merged_defs: 0
% 0.45/1.14 merged_defs_ncl: 0
% 0.45/1.14 bin_hyper_res: 0
% 0.45/1.14 prep_cycles: 2
% 0.45/1.14
% 0.45/1.14 splitting_time: 0.
% 0.45/1.14 sem_filter_time: 0.
% 0.45/1.14 monotx_time: 0.
% 0.45/1.14 subtype_inf_time: 0.
% 0.45/1.14 res_prep_time: 0.005
% 0.45/1.14 sup_prep_time: 0.
% 0.45/1.14 pred_elim_time: 0.
% 0.45/1.14 bin_hyper_res_time: 0.
% 0.45/1.14 prep_time_total: 0.006
% 0.45/1.14
% 0.45/1.14 ------ Propositional Solver
% 0.45/1.14
% 0.45/1.14 prop_solver_calls: 22
% 0.45/1.14 prop_fast_solver_calls: 198
% 0.45/1.14 smt_solver_calls: 1
% 0.45/1.14 smt_fast_solver_calls: 0
% 0.45/1.14 prop_num_of_clauses: 2784
% 0.45/1.14 prop_preprocess_simplified: 3031
% 0.45/1.14 prop_fo_subsumed: 0
% 0.45/1.14
% 0.45/1.14 prop_solver_time: 0.001
% 0.45/1.14 prop_fast_solver_time: 0.
% 0.45/1.14 prop_unsat_core_time: 0.
% 0.45/1.14 smt_solver_time: 0.059
% 0.45/1.14 smt_fast_solver_time: 0.
% 0.45/1.14
% 0.45/1.14 ------ QBF
% 0.45/1.14
% 0.45/1.14 qbf_q_res: 0
% 0.45/1.14 qbf_num_tautologies: 0
% 0.45/1.14 qbf_prep_cycles: 0
% 0.45/1.14
% 0.45/1.14 ------ BMC1
% 0.45/1.14
% 0.45/1.14 bmc1_current_bound: -1
% 0.45/1.14 bmc1_last_solved_bound: -1
% 0.45/1.14 bmc1_unsat_core_size: -1
% 0.45/1.14 bmc1_unsat_core_parents_size: -1
% 0.45/1.14 bmc1_merge_next_fun: 0
% 0.45/1.14
% 0.45/1.14 bmc1_unsat_core_clauses_time: 0.
% 0.45/1.14
% 0.45/1.14 ------ Instantiation
% 0.45/1.14
% 0.45/1.14 inst_num_of_clauses: 753
% 0.45/1.14 inst_num_in_passive: 227
% 0.45/1.14 inst_num_in_active: 301
% 0.45/1.14 inst_num_of_loops: 310
% 0.45/1.14 inst_num_in_unprocessed: 225
% 0.45/1.14 inst_num_of_learning_restarts: 0
% 0.45/1.14 inst_num_moves_active_passive: 0
% 0.45/1.14 inst_lit_activity: 0
% 0.45/1.14 inst_lit_activity_moves: 0
% 0.45/1.14 inst_num_tautologies: 0
% 0.45/1.14 inst_num_prop_implied: 0
% 0.45/1.14 inst_num_existing_simplified: 0
% 0.45/1.14 inst_num_eq_res_simplified: 0
% 0.45/1.14 inst_num_child_elim: 0
% 0.45/1.14 inst_num_of_dismatching_blockings: 193
% 0.45/1.14 inst_num_of_non_proper_insts: 709
% 0.45/1.14 inst_num_of_duplicates: 0
% 0.45/1.14 inst_inst_num_from_inst_to_res: 0
% 0.45/1.14
% 0.45/1.14 inst_time_sim_new: 0.029
% 0.45/1.14 inst_time_sim_given: 0.
% 0.45/1.14 inst_time_dismatching_checking: 0.006
% 0.45/1.14 inst_time_total: 0.089
% 0.45/1.14
% 0.45/1.14 ------ Resolution
% 0.45/1.14
% 0.45/1.14 res_num_of_clauses: 148
% 0.45/1.14 res_num_in_passive: 112
% 0.45/1.14 res_num_in_active: 36
% 0.45/1.14 res_num_of_loops: 51
% 0.45/1.14 res_forward_subset_subsumed: 164
% 0.45/1.14 res_backward_subset_subsumed: 0
% 0.45/1.14 res_forward_subsumed: 2
% 0.45/1.14 res_backward_subsumed: 0
% 0.45/1.14 res_forward_subsumption_resolution: 0
% 0.45/1.14 res_backward_subsumption_resolution: 0
% 0.45/1.14 res_clause_to_clause_subsumption: 435
% 0.45/1.14 res_subs_bck_cnt: 3
% 0.45/1.14 res_orphan_elimination: 0
% 0.45/1.14 res_tautology_del: 131
% 0.45/1.14 res_num_eq_res_simplified: 0
% 0.45/1.14 res_num_sel_changes: 44
% 0.45/1.14 res_moves_from_active_to_pass: 1
% 0.45/1.14
% 0.45/1.14 res_time_sim_new: 0.005
% 0.45/1.14 res_time_sim_fw_given: 0.001
% 0.45/1.14 res_time_sim_bw_given: 0.
% 0.45/1.14 res_time_total: 0.017
% 0.45/1.14
% 0.45/1.14 ------ Superposition
% 0.45/1.14
% 0.45/1.14 sup_num_of_clauses: 317
% 0.45/1.14 sup_num_in_active: 16
% 0.45/1.14 sup_num_in_passive: 301
% 0.45/1.14 sup_num_of_loops: 62
% 0.45/1.14 sup_fw_superposition: 575
% 0.45/1.14 sup_bw_superposition: 604
% 0.45/1.14 sup_eq_factoring: 0
% 0.45/1.14 sup_eq_resolution: 0
% 0.45/1.14 sup_immediate_simplified: 0
% 0.45/1.14 sup_given_eliminated: 0
% 0.45/1.14 comparisons_done: 1547
% 0.45/1.14 comparisons_avoided: 0
% 0.45/1.14 comparisons_inc_criteria: 0
% 0.45/1.14 sup_deep_cl_discarded: 0
% 0.45/1.14 sup_num_of_deepenings: 0
% 0.45/1.14 sup_num_of_restarts: 1
% 0.45/1.14
% 0.45/1.14 sup_time_generating: 0.027
% 0.45/1.14 sup_time_sim_fw_full: 0.003
% 0.45/1.14 sup_time_sim_bw_full: 0.055
% 0.45/1.14 sup_time_sim_fw_immed: 0.007
% 0.45/1.14 sup_time_sim_bw_immed: 0.006
% 0.45/1.14 sup_time_prep_sim_fw_input: 0.
% 0.45/1.14 sup_time_prep_sim_bw_input: 0.
% 0.45/1.14 sup_time_total: 0.143
% 0.45/1.14
% 0.45/1.14 ------ Simplifications
% 0.45/1.14
% 0.45/1.14 sim_repeated: 307
% 0.45/1.14 sim_fw_subset_subsumed: 0
% 0.45/1.14 sim_bw_subset_subsumed: 0
% 0.45/1.14 sim_fw_subsumed: 0
% 0.45/1.14 sim_bw_subsumed: 0
% 0.45/1.14 sim_fw_subsumption_res: 0
% 0.45/1.14 sim_bw_subsumption_res: 0
% 0.45/1.14 sim_fw_unit_subs: 0
% 0.45/1.14 sim_bw_unit_subs: 0
% 0.45/1.14 sim_tautology_del: 0
% 0.45/1.14 sim_eq_tautology_del: 6
% 0.45/1.14 sim_eq_res_simp: 0
% 0.45/1.14 sim_fw_demodulated: 8
% 0.45/1.14 sim_bw_demodulated: 29
% 0.45/1.14 sim_encompassment_demod: 0
% 0.45/1.14 sim_light_normalised: 42
% 0.45/1.14 sim_ac_normalised: 0
% 0.45/1.14 sim_joinable_taut: 0
% 0.45/1.14 sim_joinable_simp: 0
% 0.45/1.14 sim_fw_ac_demod: 0
% 0.45/1.14 sim_bw_ac_demod: 0
% 0.45/1.14 sim_smt_subsumption: 0
% 0.45/1.14 sim_smt_simplified: 0
% 0.45/1.14 sim_ground_joinable: 0
% 0.45/1.14 sim_bw_ground_joinable: 0
% 0.45/1.14 sim_connectedness: 0
% 0.45/1.14
% 0.45/1.14 sim_time_fw_subset_subs: 0.
% 0.45/1.14 sim_time_bw_subset_subs: 0.
% 0.45/1.14 sim_time_fw_subs: 0.
% 0.45/1.14 sim_time_bw_subs: 0.
% 0.45/1.14 sim_time_fw_subs_res: 0.
% 0.45/1.14 sim_time_bw_subs_res: 0.
% 0.45/1.14 sim_time_fw_unit_subs: 0.004
% 0.45/1.14 sim_time_bw_unit_subs: 0.002
% 0.45/1.14 sim_time_tautology_del: 0.
% 0.45/1.14 sim_time_eq_tautology_del: 0.
% 0.45/1.14 sim_time_eq_res_simp: 0.
% 0.45/1.14 sim_time_fw_demod: 0.
% 0.45/1.14 sim_time_bw_demod: 0.003
% 0.45/1.14 sim_time_light_norm: 0.002
% 0.45/1.14 sim_time_joinable: 0.
% 0.45/1.14 sim_time_ac_norm: 0.
% 0.45/1.14 sim_time_fw_ac_demod: 0.
% 0.45/1.14 sim_time_bw_ac_demod: 0.
% 0.45/1.14 sim_time_smt_subs: 0.
% 0.45/1.14 sim_time_fw_gjoin: 0.002
% 0.45/1.14 sim_time_fw_connected: 0.
% 0.45/1.14
% 0.45/1.14
%------------------------------------------------------------------------------