TSTP Solution File: RNG012-6 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG012-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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 13:54:40 EDT 2023
% Result : Unsatisfiable 11.70s 2.19s
% Output : CNFRefutation 11.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 13
% Syntax : Number of clauses : 67 ( 63 unt; 0 nHn; 10 RR)
% Number of literals : 75 ( 74 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 116 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
multiply(additive_inverse(a),additive_inverse(b)) != multiply(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).
cnf(c_51,plain,
add(X0,additive_identity) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_additive_identity) ).
cnf(c_52,plain,
multiply(additive_identity,X0) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',left_multiplicative_zero) ).
cnf(c_53,plain,
multiply(X0,additive_identity) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_multiplicative_zero) ).
cnf(c_55,plain,
add(X0,additive_inverse(X0)) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_additive_inverse) ).
cnf(c_56,plain,
additive_inverse(additive_inverse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',additive_inverse_additive_inverse) ).
cnf(c_57,plain,
add(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',distribute1) ).
cnf(c_58,plain,
add(multiply(X0,X1),multiply(X2,X1)) = multiply(add(X0,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',distribute2) ).
cnf(c_59,plain,
add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',commutativity_for_addition) ).
cnf(c_60,plain,
add(add(X0,X1),X2) = add(X0,add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',associativity_for_addition) ).
cnf(c_64,plain,
add(multiply(X0,X1),additive_inverse(multiply(X1,X0))) = commutator(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',commutator) ).
cnf(c_146,plain,
X0 = X0,
theory(equality) ).
cnf(c_149,plain,
( X0 != X1
| X2 != X3
| multiply(X0,X2) = multiply(X1,X3) ),
theory(equality) ).
cnf(c_206,plain,
add(X0,add(X1,X2)) = add(X1,add(X0,X2)),
inference(superposition,[status(thm)],[c_60,c_59]) ).
cnf(c_211,plain,
add(additive_identity,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_59]) ).
cnf(c_218,plain,
additive_inverse(additive_identity) = additive_identity,
inference(superposition,[status(thm)],[c_211,c_55]) ).
cnf(c_226,plain,
add(X0,add(additive_inverse(X0),X1)) = add(additive_identity,X1),
inference(superposition,[status(thm)],[c_55,c_60]) ).
cnf(c_228,plain,
add(X0,add(X1,additive_inverse(add(X0,X1)))) = additive_identity,
inference(superposition,[status(thm)],[c_60,c_55]) ).
cnf(c_259,plain,
add(multiply(X0,additive_identity),additive_inverse(additive_identity)) = commutator(additive_identity,X0),
inference(superposition,[status(thm)],[c_52,c_64]) ).
cnf(c_267,plain,
add(additive_inverse(additive_identity),multiply(X0,additive_identity)) = commutator(additive_identity,X0),
inference(theory_normalisation,[status(thm)],[c_259,c_60,c_59]) ).
cnf(c_268,plain,
commutator(additive_identity,X0) = add(additive_identity,additive_identity),
inference(light_normalisation,[status(thm)],[c_267,c_53,c_218]) ).
cnf(c_277,plain,
commutator(additive_identity,X0) = additive_identity,
inference(demodulation,[status(thm)],[c_268,c_211]) ).
cnf(c_278,plain,
add(X0,add(additive_inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_226,c_211]) ).
cnf(c_286,plain,
add(additive_inverse(X0),add(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_56,c_278]) ).
cnf(c_296,plain,
add(X0,add(X1,additive_inverse(X0))) = X1,
inference(theory_normalisation,[status(thm)],[c_286,c_60,c_59]) ).
cnf(c_308,plain,
add(X0,add(X1,add(X2,additive_inverse(X0)))) = add(X1,X2),
inference(superposition,[status(thm)],[c_60,c_296]) ).
cnf(c_309,plain,
add(multiply(X0,X1),commutator(X0,X1)) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_64,c_296]) ).
cnf(c_351,plain,
add(X0,additive_inverse(add(additive_inverse(X1),X0))) = add(X1,additive_identity),
inference(superposition,[status(thm)],[c_228,c_278]) ).
cnf(c_436,plain,
( X0 != a
| X1 != b
| multiply(X0,X1) = multiply(a,b) ),
inference(instantiation,[status(thm)],[c_149]) ).
cnf(c_443,plain,
multiply(X0,add(additive_identity,X1)) = add(additive_identity,multiply(X0,X1)),
inference(superposition,[status(thm)],[c_53,c_57]) ).
cnf(c_487,plain,
multiply(add(X0,additive_identity),X1) = add(multiply(X0,X1),additive_identity),
inference(superposition,[status(thm)],[c_52,c_58]) ).
cnf(c_499,plain,
multiply(add(X0,additive_identity),X1) = add(additive_identity,multiply(X0,X1)),
inference(theory_normalisation,[status(thm)],[c_487,c_60,c_59]) ).
cnf(c_500,plain,
multiply(X0,add(additive_identity,X1)) = multiply(X0,X1),
inference(light_normalisation,[status(thm)],[c_499,c_51,c_443]) ).
cnf(c_520,plain,
additive_inverse(additive_inverse(b)) = b,
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_617,plain,
( X0 != b
| a != a
| multiply(a,X0) = multiply(a,b) ),
inference(instantiation,[status(thm)],[c_436]) ).
cnf(c_618,plain,
a = a,
inference(instantiation,[status(thm)],[c_146]) ).
cnf(c_674,plain,
add(X0,add(X1,additive_identity)) = add(X1,X0),
inference(superposition,[status(thm)],[c_51,c_206]) ).
cnf(c_770,plain,
add(X0,additive_inverse(add(additive_inverse(X1),X0))) = X1,
inference(demodulation,[status(thm)],[c_351,c_51]) ).
cnf(c_775,plain,
add(X0,additive_inverse(add(X0,additive_inverse(X1)))) = X1,
inference(superposition,[status(thm)],[c_59,c_770]) ).
cnf(c_783,plain,
add(X0,additive_inverse(add(X1,X0))) = additive_inverse(X1),
inference(superposition,[status(thm)],[c_56,c_770]) ).
cnf(c_955,plain,
add(X0,additive_inverse(add(X0,X1))) = additive_inverse(X1),
inference(superposition,[status(thm)],[c_56,c_775]) ).
cnf(c_1026,plain,
( additive_inverse(additive_inverse(b)) != b
| a != a
| multiply(a,additive_inverse(additive_inverse(b))) = multiply(a,b) ),
inference(instantiation,[status(thm)],[c_617]) ).
cnf(c_1032,plain,
add(multiply(X0,X1),additive_inverse(multiply(X0,add(X2,X1)))) = additive_inverse(multiply(X0,X2)),
inference(superposition,[status(thm)],[c_57,c_783]) ).
cnf(c_1034,plain,
add(multiply(X0,X1),additive_inverse(multiply(add(X2,X0),X1))) = additive_inverse(multiply(X2,X1)),
inference(superposition,[status(thm)],[c_58,c_783]) ).
cnf(c_1106,plain,
add(multiply(X0,X1),additive_inverse(multiply(X1,X0))) = additive_inverse(commutator(X0,X1)),
inference(superposition,[status(thm)],[c_309,c_955]) ).
cnf(c_1129,plain,
additive_inverse(commutator(X0,X1)) = commutator(X1,X0),
inference(light_normalisation,[status(thm)],[c_1106,c_64]) ).
cnf(c_2234,plain,
add(additive_identity,add(X0,add(X1,additive_identity))) = add(X0,X1),
inference(superposition,[status(thm)],[c_218,c_308]) ).
cnf(c_2258,plain,
add(additive_identity,add(X0,X1)) = add(X1,X0),
inference(light_normalisation,[status(thm)],[c_2234,c_674]) ).
cnf(c_14837,plain,
add(multiply(X0,additive_inverse(X1)),additive_inverse(multiply(X0,additive_identity))) = additive_inverse(multiply(X0,X1)),
inference(superposition,[status(thm)],[c_55,c_1032]) ).
cnf(c_14918,plain,
add(multiply(X0,additive_inverse(X1)),additive_identity) = additive_inverse(multiply(X0,X1)),
inference(light_normalisation,[status(thm)],[c_14837,c_53,c_218]) ).
cnf(c_14919,plain,
add(additive_identity,multiply(X0,additive_inverse(X1))) = additive_inverse(multiply(X0,X1)),
inference(theory_normalisation,[status(thm)],[c_14918,c_60,c_59]) ).
cnf(c_15193,plain,
additive_inverse(multiply(X0,X1)) = multiply(X0,additive_inverse(X1)),
inference(demodulation,[status(thm)],[c_14919,c_443,c_500]) ).
cnf(c_15198,plain,
add(multiply(X0,X1),multiply(X1,additive_inverse(X0))) = commutator(X1,X0),
inference(demodulation,[status(thm)],[c_64,c_15193]) ).
cnf(c_15838,plain,
add(multiply(X0,additive_inverse(X1)),additive_inverse(commutator(X0,X1))) = additive_inverse(multiply(X1,X0)),
inference(superposition,[status(thm)],[c_15198,c_783]) ).
cnf(c_15858,plain,
add(multiply(X0,additive_inverse(X1)),commutator(X1,X0)) = additive_inverse(multiply(X1,X0)),
inference(light_normalisation,[status(thm)],[c_15838,c_1129]) ).
cnf(c_15859,plain,
add(commutator(X0,X1),multiply(X1,additive_inverse(X0))) = additive_inverse(multiply(X0,X1)),
inference(theory_normalisation,[status(thm)],[c_15858,c_60,c_59]) ).
cnf(c_15860,plain,
add(commutator(X0,X1),multiply(X1,additive_inverse(X0))) = multiply(X0,additive_inverse(X1)),
inference(light_normalisation,[status(thm)],[c_15859,c_15193]) ).
cnf(c_21807,plain,
add(additive_identity,multiply(X0,additive_inverse(additive_identity))) = multiply(additive_identity,additive_inverse(X0)),
inference(superposition,[status(thm)],[c_277,c_15860]) ).
cnf(c_21883,plain,
multiply(additive_identity,additive_inverse(X0)) = add(additive_identity,additive_identity),
inference(light_normalisation,[status(thm)],[c_21807,c_53,c_218]) ).
cnf(c_32574,plain,
add(multiply(X0,X1),multiply(add(X2,X0),additive_inverse(X1))) = multiply(X2,additive_inverse(X1)),
inference(demodulation,[status(thm)],[c_1034,c_15193]) ).
cnf(c_32603,plain,
add(multiply(additive_inverse(X0),X1),multiply(additive_identity,additive_inverse(X1))) = multiply(X0,additive_inverse(X1)),
inference(superposition,[status(thm)],[c_55,c_32574]) ).
cnf(c_32708,plain,
add(multiply(additive_identity,additive_inverse(X0)),multiply(additive_inverse(X1),X0)) = multiply(X1,additive_inverse(X0)),
inference(theory_normalisation,[status(thm)],[c_32603,c_60,c_59]) ).
cnf(c_32709,plain,
add(add(additive_identity,additive_identity),multiply(additive_inverse(X0),X1)) = multiply(X0,additive_inverse(X1)),
inference(light_normalisation,[status(thm)],[c_32708,c_21883]) ).
cnf(c_32710,plain,
add(additive_identity,add(additive_identity,multiply(additive_inverse(X0),X1))) = multiply(X0,additive_inverse(X1)),
inference(theory_normalisation,[status(thm)],[c_32709,c_60,c_59]) ).
cnf(c_33099,plain,
multiply(additive_inverse(X0),X1) = multiply(X0,additive_inverse(X1)),
inference(demodulation,[status(thm)],[c_32710,c_51,c_2258]) ).
cnf(c_33108,plain,
multiply(a,additive_inverse(additive_inverse(b))) != multiply(a,b),
inference(demodulation,[status(thm)],[c_49,c_33099]) ).
cnf(c_33118,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_33108,c_1026,c_618,c_520]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG012-6 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n003.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Aug 27 01:35:39 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running UEQ theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 11.70/2.19 % SZS status Started for theBenchmark.p
% 11.70/2.19 % SZS status Unsatisfiable for theBenchmark.p
% 11.70/2.19
% 11.70/2.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 11.70/2.19
% 11.70/2.19 ------ iProver source info
% 11.70/2.19
% 11.70/2.19 git: date: 2023-05-31 18:12:56 +0000
% 11.70/2.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 11.70/2.19 git: non_committed_changes: false
% 11.70/2.19 git: last_make_outside_of_git: false
% 11.70/2.19
% 11.70/2.19 ------ Parsing...successful
% 11.70/2.19
% 11.70/2.19
% 11.70/2.19
% 11.70/2.19 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 11.70/2.19
% 11.70/2.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 11.70/2.19
% 11.70/2.19 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 11.70/2.19 ------ Proving...
% 11.70/2.19 ------ Problem Properties
% 11.70/2.19
% 11.70/2.19
% 11.70/2.19 clauses 14
% 11.70/2.19 conjectures 1
% 11.70/2.19 EPR 0
% 11.70/2.19 Horn 14
% 11.70/2.19 unary 14
% 11.70/2.19 binary 0
% 11.70/2.19 lits 14
% 11.70/2.19 lits eq 14
% 11.70/2.19 fd_pure 0
% 11.70/2.19 fd_pseudo 0
% 11.70/2.19 fd_cond 0
% 11.70/2.19 fd_pseudo_cond 0
% 11.70/2.19 AC symbols 1
% 11.70/2.19
% 11.70/2.19 ------ Input Options Time Limit: Unbounded
% 11.70/2.19
% 11.70/2.19
% 11.70/2.19 ------
% 11.70/2.19 Current options:
% 11.70/2.19 ------
% 11.70/2.19
% 11.70/2.19 ------ Input Options
% 11.70/2.19
% 11.70/2.19 --out_options all
% 11.70/2.19 --tptp_safe_out true
% 11.70/2.19 --problem_path ""
% 11.70/2.19 --include_path ""
% 11.70/2.19 --clausifier res/vclausify_rel
% 11.70/2.19 --clausifier_options --mode clausify -t 305.00
% 11.70/2.19 --stdin false
% 11.70/2.19 --proof_out true
% 11.70/2.19 --proof_dot_file ""
% 11.70/2.19 --proof_reduce_dot []
% 11.70/2.19 --suppress_sat_res true
% 11.70/2.19 --suppress_unsat_res false
% 11.70/2.19 --stats_out all
% 11.70/2.19 --stats_mem false
% 11.70/2.19 --theory_stats_out false
% 11.70/2.19
% 11.70/2.19 ------ General Options
% 11.70/2.19
% 11.70/2.19 --fof false
% 11.70/2.19 --time_out_real 305.
% 11.70/2.19 --time_out_virtual -1.
% 11.70/2.19 --rnd_seed 13
% 11.70/2.19 --symbol_type_check false
% 11.70/2.19 --clausify_out false
% 11.70/2.19 --sig_cnt_out false
% 11.70/2.19 --trig_cnt_out false
% 11.70/2.19 --trig_cnt_out_tolerance 1.
% 11.70/2.19 --trig_cnt_out_sk_spl false
% 11.70/2.19 --abstr_cl_out false
% 11.70/2.19
% 11.70/2.19 ------ Interactive Mode
% 11.70/2.19
% 11.70/2.19 --interactive_mode false
% 11.70/2.19 --external_ip_address ""
% 11.70/2.19 --external_port 0
% 11.70/2.19
% 11.70/2.19 ------ Global Options
% 11.70/2.19
% 11.70/2.19 --schedule none
% 11.70/2.19 --add_important_lit false
% 11.70/2.19 --prop_solver_per_cl 500
% 11.70/2.19 --subs_bck_mult 8
% 11.70/2.19 --min_unsat_core false
% 11.70/2.19 --soft_assumptions false
% 11.70/2.19 --soft_lemma_size 3
% 11.70/2.19 --prop_impl_unit_size 0
% 11.70/2.19 --prop_impl_unit []
% 11.70/2.19 --share_sel_clauses true
% 11.70/2.19 --reset_solvers false
% 11.70/2.19 --bc_imp_inh [conj_cone]
% 11.70/2.19 --conj_cone_tolerance 3.
% 11.70/2.19 --extra_neg_conj none
% 11.70/2.19 --large_theory_mode true
% 11.70/2.19 --prolific_symb_bound 200
% 11.70/2.19 --lt_threshold 2000
% 11.70/2.19 --clause_weak_htbl true
% 11.70/2.19 --gc_record_bc_elim false
% 11.70/2.19
% 11.70/2.19 ------ Preprocessing Options
% 11.70/2.19
% 11.70/2.19 --preprocessing_flag true
% 11.70/2.19 --time_out_prep_mult 0.1
% 11.70/2.19 --splitting_mode input
% 11.70/2.19 --splitting_grd true
% 11.70/2.19 --splitting_cvd false
% 11.70/2.19 --splitting_cvd_svl false
% 11.70/2.19 --splitting_nvd 32
% 11.70/2.19 --sub_typing false
% 11.70/2.19 --prep_gs_sim true
% 11.70/2.19 --prep_unflatten true
% 11.70/2.19 --prep_res_sim true
% 11.70/2.19 --prep_sup_sim_all true
% 11.70/2.19 --prep_sup_sim_sup false
% 11.70/2.19 --prep_upred true
% 11.70/2.19 --prep_well_definedness true
% 11.70/2.19 --prep_sem_filter exhaustive
% 11.70/2.19 --prep_sem_filter_out false
% 11.70/2.19 --pred_elim true
% 11.70/2.19 --res_sim_input true
% 11.70/2.19 --eq_ax_congr_red true
% 11.70/2.19 --pure_diseq_elim true
% 11.70/2.19 --brand_transform false
% 11.70/2.19 --non_eq_to_eq false
% 11.70/2.19 --prep_def_merge true
% 11.70/2.19 --prep_def_merge_prop_impl false
% 11.70/2.19 --prep_def_merge_mbd true
% 11.70/2.19 --prep_def_merge_tr_red false
% 11.70/2.19 --prep_def_merge_tr_cl false
% 11.70/2.19 --smt_preprocessing false
% 11.70/2.19 --smt_ac_axioms fast
% 11.70/2.19 --preprocessed_out false
% 11.70/2.19 --preprocessed_stats false
% 11.70/2.19
% 11.70/2.19 ------ Abstraction refinement Options
% 11.70/2.19
% 11.70/2.19 --abstr_ref []
% 11.70/2.19 --abstr_ref_prep false
% 11.70/2.19 --abstr_ref_until_sat false
% 11.70/2.19 --abstr_ref_sig_restrict funpre
% 11.70/2.19 --abstr_ref_af_restrict_to_split_sk false
% 11.70/2.19 --abstr_ref_under []
% 11.70/2.19
% 11.70/2.19 ------ SAT Options
% 11.70/2.19
% 11.70/2.19 --sat_mode false
% 11.70/2.19 --sat_fm_restart_options ""
% 11.70/2.19 --sat_gr_def false
% 11.70/2.19 --sat_epr_types true
% 11.70/2.19 --sat_non_cyclic_types false
% 11.70/2.19 --sat_finite_models false
% 11.70/2.19 --sat_fm_lemmas false
% 11.70/2.19 --sat_fm_prep false
% 11.70/2.19 --sat_fm_uc_incr true
% 11.70/2.19 --sat_out_model small
% 11.70/2.19 --sat_out_clauses false
% 11.70/2.19
% 11.70/2.19 ------ QBF Options
% 11.70/2.19
% 11.70/2.19 --qbf_mode false
% 11.70/2.19 --qbf_elim_univ false
% 11.70/2.19 --qbf_dom_inst none
% 11.70/2.19 --qbf_dom_pre_inst false
% 11.70/2.19 --qbf_sk_in false
% 11.70/2.19 --qbf_pred_elim true
% 11.70/2.19 --qbf_split 512
% 11.70/2.19
% 11.70/2.19 ------ BMC1 Options
% 11.70/2.19
% 11.70/2.19 --bmc1_incremental false
% 11.70/2.19 --bmc1_axioms reachable_all
% 11.70/2.19 --bmc1_min_bound 0
% 11.70/2.19 --bmc1_max_bound -1
% 11.70/2.19 --bmc1_max_bound_default -1
% 11.70/2.19 --bmc1_symbol_reachability true
% 11.70/2.19 --bmc1_property_lemmas false
% 11.70/2.19 --bmc1_k_induction false
% 11.70/2.19 --bmc1_non_equiv_states false
% 11.70/2.19 --bmc1_deadlock false
% 11.70/2.19 --bmc1_ucm false
% 11.70/2.19 --bmc1_add_unsat_core none
% 11.70/2.19 --bmc1_unsat_core_children false
% 11.70/2.19 --bmc1_unsat_core_extrapolate_axioms false
% 11.70/2.19 --bmc1_out_stat full
% 11.70/2.19 --bmc1_ground_init false
% 11.70/2.19 --bmc1_pre_inst_next_state false
% 11.70/2.19 --bmc1_pre_inst_state false
% 11.70/2.19 --bmc1_pre_inst_reach_state false
% 11.70/2.19 --bmc1_out_unsat_core false
% 11.70/2.19 --bmc1_aig_witness_out false
% 11.70/2.19 --bmc1_verbose false
% 11.70/2.19 --bmc1_dump_clauses_tptp false
% 11.70/2.19 --bmc1_dump_unsat_core_tptp false
% 11.70/2.19 --bmc1_dump_file -
% 11.70/2.19 --bmc1_ucm_expand_uc_limit 128
% 11.70/2.19 --bmc1_ucm_n_expand_iterations 6
% 11.70/2.19 --bmc1_ucm_extend_mode 1
% 11.70/2.19 --bmc1_ucm_init_mode 2
% 11.70/2.19 --bmc1_ucm_cone_mode none
% 11.70/2.19 --bmc1_ucm_reduced_relation_type 0
% 11.70/2.19 --bmc1_ucm_relax_model 4
% 11.70/2.19 --bmc1_ucm_full_tr_after_sat true
% 11.70/2.19 --bmc1_ucm_expand_neg_assumptions false
% 11.70/2.19 --bmc1_ucm_layered_model none
% 11.70/2.19 --bmc1_ucm_max_lemma_size 10
% 11.70/2.19
% 11.70/2.19 ------ AIG Options
% 11.70/2.19
% 11.70/2.19 --aig_mode false
% 11.70/2.19
% 11.70/2.19 ------ Instantiation Options
% 11.70/2.19
% 11.70/2.19 --instantiation_flag true
% 11.70/2.19 --inst_sos_flag false
% 11.70/2.19 --inst_sos_phase true
% 11.70/2.19 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 11.70/2.19 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 11.70/2.19 --inst_lit_sel_side num_symb
% 11.70/2.19 --inst_solver_per_active 1400
% 11.70/2.19 --inst_solver_calls_frac 1.
% 11.70/2.19 --inst_to_smt_solver true
% 11.70/2.19 --inst_passive_queue_type priority_queues
% 11.70/2.19 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 11.70/2.19 --inst_passive_queues_freq [25;2]
% 11.70/2.19 --inst_dismatching true
% 11.70/2.19 --inst_eager_unprocessed_to_passive true
% 11.70/2.19 --inst_unprocessed_bound 1000
% 11.70/2.19 --inst_prop_sim_given true
% 11.70/2.19 --inst_prop_sim_new false
% 11.70/2.19 --inst_subs_new false
% 11.70/2.19 --inst_eq_res_simp false
% 11.70/2.19 --inst_subs_given false
% 11.70/2.19 --inst_orphan_elimination true
% 11.70/2.19 --inst_learning_loop_flag true
% 11.70/2.19 --inst_learning_start 3000
% 11.70/2.19 --inst_learning_factor 2
% 11.70/2.19 --inst_start_prop_sim_after_learn 3
% 11.70/2.19 --inst_sel_renew solver
% 11.70/2.19 --inst_lit_activity_flag true
% 11.70/2.19 --inst_restr_to_given false
% 11.70/2.19 --inst_activity_threshold 500
% 11.70/2.19
% 11.70/2.19 ------ Resolution Options
% 11.70/2.19
% 11.70/2.19 --resolution_flag true
% 11.70/2.19 --res_lit_sel adaptive
% 11.70/2.19 --res_lit_sel_side none
% 11.70/2.19 --res_ordering kbo
% 11.70/2.19 --res_to_prop_solver active
% 11.70/2.19 --res_prop_simpl_new false
% 11.70/2.19 --res_prop_simpl_given true
% 11.70/2.19 --res_to_smt_solver true
% 11.70/2.19 --res_passive_queue_type priority_queues
% 11.70/2.19 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 11.70/2.19 --res_passive_queues_freq [15;5]
% 11.70/2.19 --res_forward_subs full
% 11.70/2.19 --res_backward_subs full
% 11.70/2.19 --res_forward_subs_resolution true
% 11.70/2.19 --res_backward_subs_resolution true
% 11.70/2.19 --res_orphan_elimination true
% 11.70/2.19 --res_time_limit 300.
% 11.70/2.19
% 11.70/2.19 ------ Superposition Options
% 11.70/2.19
% 11.70/2.19 --superposition_flag true
% 11.70/2.19 --sup_passive_queue_type priority_queues
% 11.70/2.19 --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]]
% 11.70/2.19 --sup_passive_queues_freq [8;1;4;4]
% 11.70/2.19 --demod_completeness_check fast
% 11.70/2.19 --demod_use_ground true
% 11.70/2.19 --sup_unprocessed_bound 0
% 11.70/2.19 --sup_to_prop_solver passive
% 11.70/2.19 --sup_prop_simpl_new true
% 11.70/2.19 --sup_prop_simpl_given true
% 11.70/2.19 --sup_fun_splitting false
% 11.70/2.19 --sup_iter_deepening 2
% 11.70/2.19 --sup_restarts_mult 12
% 11.70/2.19 --sup_score sim_d_gen
% 11.70/2.19 --sup_share_score_frac 0.2
% 11.70/2.19 --sup_share_max_num_cl 500
% 11.70/2.19 --sup_ordering kbo
% 11.70/2.19 --sup_symb_ordering invfreq
% 11.70/2.19 --sup_term_weight default
% 11.70/2.19
% 11.70/2.19 ------ Superposition Simplification Setup
% 11.70/2.19
% 11.70/2.19 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 11.70/2.19 --sup_full_triv [SMTSimplify;PropSubs]
% 11.70/2.19 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 11.70/2.19 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 11.70/2.19 --sup_immed_triv []
% 11.70/2.19 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 11.70/2.19 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 11.70/2.19 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 11.70/2.19 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 11.70/2.19 --sup_input_triv [Unflattening;SMTSimplify]
% 11.70/2.19 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 11.70/2.19 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 11.70/2.19 --sup_full_fixpoint true
% 11.70/2.19 --sup_main_fixpoint true
% 11.70/2.19 --sup_immed_fixpoint false
% 11.70/2.19 --sup_input_fixpoint true
% 11.70/2.19 --sup_cache_sim none
% 11.70/2.19 --sup_smt_interval 500
% 11.70/2.19 --sup_bw_gjoin_interval 0
% 11.70/2.19
% 11.70/2.19 ------ Combination Options
% 11.70/2.19
% 11.70/2.19 --comb_mode clause_based
% 11.70/2.19 --comb_inst_mult 5
% 11.70/2.19 --comb_res_mult 1
% 11.70/2.19 --comb_sup_mult 8
% 11.70/2.19 --comb_sup_deep_mult 2
% 11.70/2.19
% 11.70/2.19 ------ Debug Options
% 11.70/2.19
% 11.70/2.19 --dbg_backtrace false
% 11.70/2.19 --dbg_dump_prop_clauses false
% 11.70/2.19 --dbg_dump_prop_clauses_file -
% 11.70/2.19 --dbg_out_stat false
% 11.70/2.19 --dbg_just_parse false
% 11.70/2.19
% 11.70/2.19
% 11.70/2.19
% 11.70/2.19
% 11.70/2.19 ------ Proving...
% 11.70/2.19
% 11.70/2.19
% 11.70/2.19 % SZS status Unsatisfiable for theBenchmark.p
% 11.70/2.19
% 11.70/2.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 11.70/2.19
% 11.70/2.19 ------ Statistics
% 11.70/2.19
% 11.70/2.19 ------ Problem properties
% 11.70/2.19
% 11.70/2.19 clauses: 14
% 11.70/2.19 conjectures: 1
% 11.70/2.19 epr: 0
% 11.70/2.19 horn: 14
% 11.70/2.19 ground: 1
% 11.70/2.19 unary: 14
% 11.70/2.19 binary: 0
% 11.70/2.19 lits: 14
% 11.70/2.19 lits_eq: 14
% 11.70/2.19 fd_pure: 0
% 11.70/2.19 fd_pseudo: 0
% 11.70/2.19 fd_cond: 0
% 11.70/2.19 fd_pseudo_cond: 0
% 11.70/2.19 ac_symbols: 1
% 11.70/2.19
% 11.70/2.19 ------ General
% 11.70/2.19
% 11.70/2.19 abstr_ref_over_cycles: 0
% 11.70/2.19 abstr_ref_under_cycles: 0
% 11.70/2.19 gc_basic_clause_elim: 0
% 11.70/2.19 num_of_symbols: 104
% 11.70/2.19 num_of_terms: 68623
% 11.70/2.19
% 11.70/2.19 parsing_time: 0.
% 11.70/2.19 unif_index_cands_time: 0.023
% 11.70/2.19 unif_index_add_time: 0.006
% 11.70/2.19 orderings_time: 0.019
% 11.70/2.19 out_proof_time: 0.002
% 11.70/2.19 total_time: 1.269
% 11.70/2.19
% 11.70/2.19 ------ Preprocessing
% 11.70/2.19
% 11.70/2.19 num_of_splits: 0
% 11.70/2.19 num_of_split_atoms: 0
% 11.70/2.19 num_of_reused_defs: 0
% 11.70/2.19 num_eq_ax_congr_red: 15
% 11.70/2.19 num_of_sem_filtered_clauses: 0
% 11.70/2.19 num_of_subtypes: 0
% 11.70/2.19 monotx_restored_types: 0
% 11.70/2.19 sat_num_of_epr_types: 0
% 11.70/2.19 sat_num_of_non_cyclic_types: 0
% 11.70/2.19 sat_guarded_non_collapsed_types: 0
% 11.70/2.19 num_pure_diseq_elim: 0
% 11.70/2.19 simp_replaced_by: 0
% 11.70/2.19 res_preprocessed: 0
% 11.70/2.19 sup_preprocessed: 1
% 11.70/2.19 prep_upred: 0
% 11.70/2.19 prep_unflattend: 0
% 11.70/2.19 prep_well_definedness: 0
% 11.70/2.19 smt_new_axioms: 0
% 11.70/2.19 pred_elim_cands: 0
% 11.70/2.19 pred_elim: 0
% 11.70/2.19 pred_elim_cl: 0
% 11.70/2.19 pred_elim_cycles: 0
% 11.70/2.19 merged_defs: 0
% 11.70/2.19 merged_defs_ncl: 0
% 11.70/2.19 bin_hyper_res: 0
% 11.70/2.19 prep_cycles: 3
% 11.70/2.19
% 11.70/2.19 splitting_time: 0.
% 11.70/2.19 sem_filter_time: 0.001
% 11.70/2.19 monotx_time: 0.
% 11.70/2.19 subtype_inf_time: 0.
% 11.70/2.19 res_prep_time: 0.005
% 11.70/2.19 sup_prep_time: 0.002
% 11.70/2.19 pred_elim_time: 0.
% 11.70/2.19 bin_hyper_res_time: 0.
% 11.70/2.19 prep_time_total: 0.01
% 11.70/2.19
% 11.70/2.19 ------ Propositional Solver
% 11.70/2.19
% 11.70/2.19 prop_solver_calls: 28
% 11.70/2.19 prop_fast_solver_calls: 1097
% 11.70/2.19 smt_solver_calls: 0
% 11.70/2.19 smt_fast_solver_calls: 0
% 11.70/2.19 prop_num_of_clauses: 13515
% 11.70/2.19 prop_preprocess_simplified: 12137
% 11.70/2.19 prop_fo_subsumed: 0
% 11.70/2.19
% 11.70/2.19 prop_solver_time: 0.004
% 11.70/2.19 prop_fast_solver_time: 0.001
% 11.70/2.19 prop_unsat_core_time: 0.001
% 11.70/2.19 smt_solver_time: 0.
% 11.70/2.19 smt_fast_solver_time: 0.
% 11.70/2.19
% 11.70/2.19 ------ QBF
% 11.70/2.19
% 11.70/2.19 qbf_q_res: 0
% 11.70/2.19 qbf_num_tautologies: 0
% 11.70/2.19 qbf_prep_cycles: 0
% 11.70/2.19
% 11.70/2.19 ------ BMC1
% 11.70/2.19
% 11.70/2.19 bmc1_current_bound: -1
% 11.70/2.19 bmc1_last_solved_bound: -1
% 11.70/2.19 bmc1_unsat_core_size: -1
% 11.70/2.19 bmc1_unsat_core_parents_size: -1
% 11.70/2.19 bmc1_merge_next_fun: 0
% 11.70/2.19
% 11.70/2.19 bmc1_unsat_core_clauses_time: 0.
% 11.70/2.19
% 11.70/2.19 ------ Instantiation
% 11.70/2.19
% 11.70/2.19 inst_num_of_clauses: 2785
% 11.70/2.19 inst_num_in_passive: 1243
% 11.70/2.19 inst_num_in_active: 963
% 11.70/2.19 inst_num_of_loops: 973
% 11.70/2.19 inst_num_in_unprocessed: 579
% 11.70/2.19 inst_num_of_learning_restarts: 0
% 11.70/2.19 inst_num_moves_active_passive: 0
% 11.70/2.19 inst_lit_activity: 0
% 11.70/2.19 inst_lit_activity_moves: 0
% 11.70/2.19 inst_num_tautologies: 0
% 11.70/2.19 inst_num_prop_implied: 0
% 11.70/2.19 inst_num_existing_simplified: 0
% 11.70/2.19 inst_num_eq_res_simplified: 0
% 11.70/2.19 inst_num_child_elim: 0
% 11.70/2.19 inst_num_of_dismatching_blockings: 439
% 11.70/2.19 inst_num_of_non_proper_insts: 2012
% 11.70/2.19 inst_num_of_duplicates: 0
% 11.70/2.19 inst_inst_num_from_inst_to_res: 0
% 11.70/2.19
% 11.70/2.19 inst_time_sim_new: 0.083
% 11.70/2.19 inst_time_sim_given: 0.
% 11.70/2.19 inst_time_dismatching_checking: 0.022
% 11.70/2.19 inst_time_total: 0.198
% 11.70/2.19
% 11.70/2.19 ------ Resolution
% 11.70/2.19
% 11.70/2.19 res_num_of_clauses: 549
% 11.70/2.19 res_num_in_passive: 418
% 11.70/2.19 res_num_in_active: 131
% 11.70/2.19 res_num_of_loops: 197
% 11.70/2.19 res_forward_subset_subsumed: 473
% 11.70/2.19 res_backward_subset_subsumed: 0
% 11.70/2.19 res_forward_subsumed: 14
% 11.70/2.19 res_backward_subsumed: 0
% 11.70/2.19 res_forward_subsumption_resolution: 0
% 11.70/2.19 res_backward_subsumption_resolution: 0
% 11.70/2.19 res_clause_to_clause_subsumption: 2177
% 11.70/2.19 res_subs_bck_cnt: 3
% 11.70/2.19 res_orphan_elimination: 0
% 11.70/2.19 res_tautology_del: 239
% 11.70/2.19 res_num_eq_res_simplified: 0
% 11.70/2.19 res_num_sel_changes: 47
% 11.70/2.19 res_moves_from_active_to_pass: 1
% 11.70/2.19
% 11.70/2.19 res_time_sim_new: 0.021
% 11.70/2.19 res_time_sim_fw_given: 0.006
% 11.70/2.19 res_time_sim_bw_given: 0.007
% 11.70/2.19 res_time_total: 0.052
% 11.70/2.19
% 11.70/2.19 ------ Superposition
% 11.70/2.19
% 11.70/2.19 sup_num_of_clauses: 1162
% 11.70/2.19 sup_num_in_active: 67
% 11.70/2.19 sup_num_in_passive: 1095
% 11.70/2.19 sup_num_of_loops: 275
% 11.70/2.19 sup_fw_superposition: 7753
% 11.70/2.19 sup_bw_superposition: 4461
% 11.70/2.19 sup_eq_factoring: 0
% 11.70/2.19 sup_eq_resolution: 0
% 11.70/2.19 sup_immediate_simplified: 0
% 11.70/2.19 sup_given_eliminated: 0
% 11.70/2.19 comparisons_done: 44293
% 11.70/2.19 comparisons_avoided: 0
% 11.70/2.19 comparisons_inc_criteria: 0
% 11.70/2.19 sup_deep_cl_discarded: 1
% 11.70/2.19 sup_num_of_deepenings: 0
% 11.70/2.19 sup_num_of_restarts: 1
% 11.70/2.19
% 11.70/2.19 sup_time_generating: 0.256
% 11.70/2.19 sup_time_sim_fw_full: 0.037
% 11.70/2.19 sup_time_sim_bw_full: 0.067
% 11.70/2.19 sup_time_sim_fw_immed: 0.206
% 11.70/2.19 sup_time_sim_bw_immed: 0.04
% 11.70/2.19 sup_time_prep_sim_fw_input: 0.
% 11.70/2.19 sup_time_prep_sim_bw_input: 0.001
% 11.70/2.19 sup_time_total: 0.968
% 11.70/2.19
% 11.70/2.19 ------ Simplifications
% 11.70/2.19
% 11.70/2.19 sim_repeated: 2754
% 11.70/2.19 sim_fw_subset_subsumed: 0
% 11.70/2.19 sim_bw_subset_subsumed: 0
% 11.70/2.19 sim_fw_subsumed: 0
% 11.70/2.19 sim_bw_subsumed: 0
% 11.70/2.19 sim_fw_subsumption_res: 0
% 11.70/2.19 sim_bw_subsumption_res: 0
% 11.70/2.19 sim_fw_unit_subs: 0
% 11.70/2.19 sim_bw_unit_subs: 0
% 11.70/2.19 sim_tautology_del: 0
% 11.70/2.19 sim_eq_tautology_del: 890
% 11.70/2.19 sim_eq_res_simp: 0
% 11.70/2.19 sim_fw_demodulated: 156
% 11.70/2.19 sim_bw_demodulated: 53
% 11.70/2.19 sim_encompassment_demod: 0
% 11.70/2.19 sim_light_normalised: 5280
% 11.70/2.19 sim_ac_normalised: 3243
% 11.70/2.19 sim_joinable_taut: 560
% 11.70/2.19 sim_joinable_simp: 0
% 11.70/2.19 sim_fw_ac_demod: 0
% 11.70/2.19 sim_bw_ac_demod: 0
% 11.70/2.19 sim_smt_subsumption: 0
% 11.70/2.19 sim_smt_simplified: 0
% 11.70/2.19 sim_ground_joinable: 68
% 11.70/2.19 sim_bw_ground_joinable: 0
% 11.70/2.19 sim_connectedness: 0
% 11.70/2.19
% 11.70/2.19 sim_time_fw_subset_subs: 0.005
% 11.70/2.19 sim_time_bw_subset_subs: 0.002
% 11.70/2.19 sim_time_fw_subs: 0.
% 11.70/2.19 sim_time_bw_subs: 0.
% 11.70/2.19 sim_time_fw_subs_res: 0.
% 11.70/2.19 sim_time_bw_subs_res: 0.
% 11.70/2.19 sim_time_fw_unit_subs: 0.041
% 11.70/2.19 sim_time_bw_unit_subs: 0.018
% 11.70/2.19 sim_time_tautology_del: 0.002
% 11.70/2.19 sim_time_eq_tautology_del: 0.002
% 11.70/2.19 sim_time_eq_res_simp: 0.001
% 11.70/2.19 sim_time_fw_demod: 0.011
% 11.70/2.19 sim_time_bw_demod: 0.015
% 11.70/2.19 sim_time_light_norm: 0.082
% 11.70/2.19 sim_time_joinable: 0.
% 11.70/2.19 sim_time_ac_norm: 0.062
% 11.70/2.19 sim_time_fw_ac_demod: 0.
% 11.70/2.19 sim_time_bw_ac_demod: 0.
% 11.70/2.19 sim_time_smt_subs: 0.
% 11.70/2.19 sim_time_fw_gjoin: 0.016
% 11.70/2.19 sim_time_fw_connected: 0.
% 11.70/2.19
% 11.70/2.19
%------------------------------------------------------------------------------