TSTP Solution File: LCL159-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL159-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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 07:42:47 EDT 2023
% Result : Unsatisfiable 7.42s 1.67s
% Output : CNFRefutation 7.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 14
% Syntax : Number of clauses : 88 ( 88 unt; 0 nHn; 11 RR)
% Number of literals : 88 ( 87 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 127 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
xor(xor(x,truth),y) != xor(x,xor(truth,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).
cnf(c_50,plain,
or(and(X0,not(X1)),and(not(X0),X1)) = xor(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',xor_definition) ).
cnf(c_51,plain,
xor(X0,X1) = xor(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',xor_commutativity) ).
cnf(c_55,plain,
not(truth) = falsehood,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',false_definition) ).
cnf(c_56,plain,
implies(not(X0),X1) = or(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',or_definition) ).
cnf(c_57,plain,
or(or(X0,X1),X2) = or(X0,or(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',or_associativity) ).
cnf(c_58,plain,
or(X0,X1) = or(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).
cnf(c_59,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',and_definition) ).
cnf(c_60,plain,
and(and(X0,X1),X2) = and(X0,and(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',and_associativity) ).
cnf(c_61,plain,
and(X0,X1) = and(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',and_commutativity) ).
cnf(c_62,plain,
implies(truth,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(c_63,plain,
implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(c_64,plain,
implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(c_65,plain,
implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(c_118,plain,
implies(or(X0,not(X1)),implies(X1,X0)) = truth,
inference(demodulation,[status(thm)],[c_65,c_56]) ).
cnf(c_121,plain,
xor(x,xor(truth,y)) != xor(y,xor(truth,x)),
inference(demodulation,[status(thm)],[c_49,c_51]) ).
cnf(c_250,plain,
or(truth,X0) = implies(falsehood,X0),
inference(superposition,[status(thm)],[c_55,c_56]) ).
cnf(c_256,plain,
implies(or(X0,not(truth)),X0) = truth,
inference(superposition,[status(thm)],[c_62,c_118]) ).
cnf(c_259,plain,
implies(or(X0,falsehood),X0) = truth,
inference(light_normalisation,[status(thm)],[c_256,c_55]) ).
cnf(c_268,plain,
not(or(falsehood,not(X0))) = and(truth,X0),
inference(superposition,[status(thm)],[c_55,c_59]) ).
cnf(c_270,plain,
not(or(not(X0),falsehood)) = and(X0,truth),
inference(superposition,[status(thm)],[c_55,c_59]) ).
cnf(c_275,plain,
not(or(falsehood,not(X0))) = and(X0,truth),
inference(theory_normalisation,[status(thm)],[c_270,c_60,c_61,c_57,c_58]) ).
cnf(c_287,plain,
implies(implies(X0,truth),truth) = implies(X0,X0),
inference(superposition,[status(thm)],[c_62,c_64]) ).
cnf(c_296,plain,
or(X0,truth) = implies(falsehood,X0),
inference(superposition,[status(thm)],[c_250,c_58]) ).
cnf(c_303,plain,
implies(or(falsehood,X0),X0) = truth,
inference(superposition,[status(thm)],[c_58,c_259]) ).
cnf(c_304,plain,
implies(implies(falsehood,falsehood),truth) = truth,
inference(superposition,[status(thm)],[c_250,c_259]) ).
cnf(c_399,plain,
implies(not(X0),not(X0)) = implies(or(X0,truth),truth),
inference(superposition,[status(thm)],[c_56,c_287]) ).
cnf(c_417,plain,
implies(not(X0),not(X0)) = implies(implies(falsehood,X0),truth),
inference(light_normalisation,[status(thm)],[c_399,c_296]) ).
cnf(c_419,plain,
implies(not(falsehood),not(falsehood)) = truth,
inference(demodulation,[status(thm)],[c_304,c_417]) ).
cnf(c_433,plain,
or(falsehood,not(falsehood)) = truth,
inference(demodulation,[status(thm)],[c_419,c_56]) ).
cnf(c_438,plain,
implies(truth,not(falsehood)) = truth,
inference(superposition,[status(thm)],[c_433,c_303]) ).
cnf(c_450,plain,
not(falsehood) = truth,
inference(demodulation,[status(thm)],[c_438,c_62]) ).
cnf(c_457,plain,
not(or(truth,not(X0))) = and(falsehood,X0),
inference(superposition,[status(thm)],[c_450,c_59]) ).
cnf(c_458,plain,
or(falsehood,X0) = implies(truth,X0),
inference(superposition,[status(thm)],[c_450,c_56]) ).
cnf(c_459,plain,
or(falsehood,X0) = X0,
inference(light_normalisation,[status(thm)],[c_458,c_62]) ).
cnf(c_466,plain,
implies(X0,X0) = truth,
inference(demodulation,[status(thm)],[c_303,c_459]) ).
cnf(c_467,plain,
not(not(X0)) = and(X0,truth),
inference(demodulation,[status(thm)],[c_275,c_459]) ).
cnf(c_468,plain,
not(not(X0)) = and(truth,X0),
inference(demodulation,[status(thm)],[c_268,c_459]) ).
cnf(c_473,plain,
implies(implies(X0,truth),truth) = truth,
inference(demodulation,[status(thm)],[c_287,c_466]) ).
cnf(c_541,plain,
or(and(X0,and(X1,X2)),and(not(X0),or(not(X1),not(X2)))) = xor(X0,or(not(X1),not(X2))),
inference(superposition,[status(thm)],[c_59,c_50]) ).
cnf(c_546,plain,
or(and(or(not(X0),not(X1)),not(X2)),and(and(X0,X1),X2)) = xor(or(not(X0),not(X1)),X2),
inference(superposition,[status(thm)],[c_59,c_50]) ).
cnf(c_556,plain,
or(and(X0,and(X1,X2)),and(or(not(X0),not(X1)),not(X2))) = xor(or(not(X0),not(X1)),X2),
inference(theory_normalisation,[status(thm)],[c_546,c_60,c_61,c_57,c_58]) ).
cnf(c_595,plain,
implies(implies(truth,X0),implies(implies(X0,X1),X1)) = truth,
inference(superposition,[status(thm)],[c_62,c_63]) ).
cnf(c_610,plain,
implies(X0,implies(implies(X0,X1),X1)) = truth,
inference(light_normalisation,[status(thm)],[c_595,c_62]) ).
cnf(c_682,plain,
or(X0,falsehood) = X0,
inference(superposition,[status(thm)],[c_459,c_58]) ).
cnf(c_1097,plain,
not(implies(falsehood,not(X0))) = and(falsehood,X0),
inference(demodulation,[status(thm)],[c_457,c_250]) ).
cnf(c_1284,plain,
implies(X0,truth) = truth,
inference(superposition,[status(thm)],[c_473,c_610]) ).
cnf(c_1351,plain,
or(X0,truth) = truth,
inference(superposition,[status(thm)],[c_1284,c_56]) ).
cnf(c_1371,plain,
implies(falsehood,X0) = truth,
inference(demodulation,[status(thm)],[c_296,c_1351]) ).
cnf(c_1373,plain,
and(falsehood,X0) = not(truth),
inference(demodulation,[status(thm)],[c_1097,c_1371]) ).
cnf(c_1374,plain,
and(falsehood,X0) = falsehood,
inference(light_normalisation,[status(thm)],[c_1373,c_55]) ).
cnf(c_1414,plain,
implies(implies(X0,falsehood),falsehood) = implies(truth,X0),
inference(superposition,[status(thm)],[c_1371,c_64]) ).
cnf(c_1420,plain,
implies(implies(X0,falsehood),falsehood) = X0,
inference(light_normalisation,[status(thm)],[c_1414,c_62]) ).
cnf(c_1472,plain,
implies(or(X0,falsehood),falsehood) = not(X0),
inference(superposition,[status(thm)],[c_56,c_1420]) ).
cnf(c_1492,plain,
implies(X0,falsehood) = not(X0),
inference(light_normalisation,[status(thm)],[c_1472,c_682]) ).
cnf(c_1519,plain,
not(not(X0)) = or(X0,falsehood),
inference(superposition,[status(thm)],[c_1492,c_56]) ).
cnf(c_1534,plain,
not(not(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_1519,c_682]) ).
cnf(c_1545,plain,
and(truth,X0) = X0,
inference(demodulation,[status(thm)],[c_468,c_1534]) ).
cnf(c_1546,plain,
and(X0,truth) = X0,
inference(demodulation,[status(thm)],[c_467,c_1534]) ).
cnf(c_1575,plain,
or(not(X0),not(X1)) = not(and(X0,X1)),
inference(superposition,[status(thm)],[c_59,c_1534]) ).
cnf(c_1579,plain,
not(or(not(X0),X1)) = and(X0,not(X1)),
inference(superposition,[status(thm)],[c_1534,c_59]) ).
cnf(c_1586,plain,
or(not(X0),X1) = implies(X0,X1),
inference(superposition,[status(thm)],[c_1534,c_56]) ).
cnf(c_1617,plain,
or(not(X0),and(not(truth),X0)) = xor(truth,X0),
inference(superposition,[status(thm)],[c_1545,c_50]) ).
cnf(c_1622,plain,
or(not(X0),falsehood) = xor(truth,X0),
inference(light_normalisation,[status(thm)],[c_1617,c_55,c_1374]) ).
cnf(c_1623,plain,
or(falsehood,not(X0)) = xor(truth,X0),
inference(theory_normalisation,[status(thm)],[c_1622,c_60,c_61,c_57,c_58]) ).
cnf(c_1629,plain,
and(X0,and(truth,X1)) = and(X0,X1),
inference(superposition,[status(thm)],[c_1546,c_60]) ).
cnf(c_1648,plain,
or(X0,not(X1)) = implies(X1,X0),
inference(superposition,[status(thm)],[c_1586,c_58]) ).
cnf(c_1660,plain,
xor(truth,X0) = not(X0),
inference(demodulation,[status(thm)],[c_1623,c_459]) ).
cnf(c_1661,plain,
xor(x,xor(truth,y)) != xor(y,not(x)),
inference(demodulation,[status(thm)],[c_121,c_1660]) ).
cnf(c_1669,plain,
xor(x,not(y)) != xor(y,not(x)),
inference(demodulation,[status(thm)],[c_1661,c_1660]) ).
cnf(c_1683,plain,
implies(not(X0),X1) = or(X1,X0),
inference(superposition,[status(thm)],[c_1534,c_1648]) ).
cnf(c_3348,plain,
not(and(X0,X1)) = implies(X0,not(X1)),
inference(demodulation,[status(thm)],[c_1575,c_1586]) ).
cnf(c_3353,plain,
not(and(X0,X1)) = implies(X1,not(X0)),
inference(superposition,[status(thm)],[c_61,c_3348]) ).
cnf(c_3368,plain,
implies(implies(X0,not(X1)),X2) = or(X2,and(X0,X1)),
inference(superposition,[status(thm)],[c_3348,c_1683]) ).
cnf(c_3370,plain,
not(implies(X0,not(X1))) = and(X0,X1),
inference(superposition,[status(thm)],[c_3348,c_1534]) ).
cnf(c_3503,plain,
not(or(not(X0),X1)) = and(not(X1),X0),
inference(superposition,[status(thm)],[c_1683,c_3370]) ).
cnf(c_3542,plain,
not(implies(X0,X1)) = and(not(X1),X0),
inference(light_normalisation,[status(thm)],[c_3503,c_1579,c_1586]) ).
cnf(c_3749,plain,
not(implies(X0,and(X1,X2))) = and(implies(X1,not(X2)),X0),
inference(superposition,[status(thm)],[c_3348,c_3542]) ).
cnf(c_17217,plain,
implies(or(X0,and(X1,X2)),and(X0,and(X2,X1))) = xor(X0,implies(X1,not(X2))),
inference(demodulation,[status(thm)],[c_541,c_1575,c_1648,c_3353,c_3368,c_3542]) ).
cnf(c_17232,plain,
implies(or(X0,X1),and(X0,and(truth,X1))) = xor(X0,implies(X1,not(truth))),
inference(superposition,[status(thm)],[c_1546,c_17217]) ).
cnf(c_17287,plain,
implies(or(X0,X1),and(X0,X1)) = xor(X0,implies(X1,falsehood)),
inference(light_normalisation,[status(thm)],[c_17232,c_55,c_1629]) ).
cnf(c_21154,plain,
or(and(X0,and(X1,X2)),and(implies(X1,not(X0)),not(X2))) = xor(implies(X1,not(X0)),X2),
inference(light_normalisation,[status(thm)],[c_556,c_1575,c_3353]) ).
cnf(c_21155,plain,
implies(or(and(X0,X1),X2),and(X1,and(X0,X2))) = xor(implies(X0,not(X1)),X2),
inference(demodulation,[status(thm)],[c_21154,c_1648,c_1683,c_3749]) ).
cnf(c_21183,plain,
implies(or(and(X0,truth),X1),and(X0,X1)) = xor(implies(X0,not(truth)),X1),
inference(superposition,[status(thm)],[c_1545,c_21155]) ).
cnf(c_21238,plain,
xor(X0,implies(X1,falsehood)) = xor(not(X0),X1),
inference(light_normalisation,[status(thm)],[c_21183,c_55,c_1492,c_1546,c_17287]) ).
cnf(c_21619,plain,
xor(not(X0),X1) = xor(X0,not(X1)),
inference(demodulation,[status(thm)],[c_21238,c_1492]) ).
cnf(c_21644,plain,
xor(X0,not(X1)) = xor(X1,not(X0)),
inference(superposition,[status(thm)],[c_21619,c_51]) ).
cnf(c_21663,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1669,c_21644]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL159-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 24 16:56:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running UEQ theorem proving
% 0.20/0.47 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
% 7.42/1.67 % SZS status Started for theBenchmark.p
% 7.42/1.67 % SZS status Unsatisfiable for theBenchmark.p
% 7.42/1.67
% 7.42/1.67 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.42/1.67
% 7.42/1.67 ------ iProver source info
% 7.42/1.67
% 7.42/1.67 git: date: 2023-05-31 18:12:56 +0000
% 7.42/1.67 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.42/1.67 git: non_committed_changes: false
% 7.42/1.67 git: last_make_outside_of_git: false
% 7.42/1.67
% 7.42/1.67 ------ Parsing...successful
% 7.42/1.67
% 7.42/1.67
% 7.42/1.67
% 7.42/1.67 ------ Preprocessing... sup_sim: 6 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
% 7.42/1.67
% 7.42/1.67 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.42/1.67
% 7.42/1.67 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 7.42/1.67 ------ Proving...
% 7.42/1.67 ------ Problem Properties
% 7.42/1.67
% 7.42/1.67
% 7.42/1.67 clauses 15
% 7.42/1.67 conjectures 0
% 7.42/1.67 EPR 0
% 7.42/1.67 Horn 15
% 7.42/1.67 unary 15
% 7.42/1.67 binary 0
% 7.42/1.67 lits 15
% 7.42/1.67 lits eq 15
% 7.42/1.67 fd_pure 0
% 7.42/1.67 fd_pseudo 0
% 7.42/1.67 fd_cond 0
% 7.42/1.67 fd_pseudo_cond 0
% 7.42/1.67 AC symbols 2
% 7.42/1.67
% 7.42/1.67 ------ Input Options Time Limit: Unbounded
% 7.42/1.67
% 7.42/1.67
% 7.42/1.67 ------
% 7.42/1.67 Current options:
% 7.42/1.67 ------
% 7.42/1.67
% 7.42/1.67 ------ Input Options
% 7.42/1.67
% 7.42/1.67 --out_options all
% 7.42/1.67 --tptp_safe_out true
% 7.42/1.67 --problem_path ""
% 7.42/1.67 --include_path ""
% 7.42/1.67 --clausifier res/vclausify_rel
% 7.42/1.67 --clausifier_options --mode clausify -t 305.00
% 7.42/1.67 --stdin false
% 7.42/1.67 --proof_out true
% 7.42/1.67 --proof_dot_file ""
% 7.42/1.67 --proof_reduce_dot []
% 7.42/1.67 --suppress_sat_res true
% 7.42/1.67 --suppress_unsat_res false
% 7.42/1.67 --stats_out all
% 7.42/1.67 --stats_mem false
% 7.42/1.67 --theory_stats_out false
% 7.42/1.67
% 7.42/1.67 ------ General Options
% 7.42/1.67
% 7.42/1.67 --fof false
% 7.42/1.67 --time_out_real 305.
% 7.42/1.67 --time_out_virtual -1.
% 7.42/1.67 --rnd_seed 13
% 7.42/1.67 --symbol_type_check false
% 7.42/1.67 --clausify_out false
% 7.42/1.67 --sig_cnt_out false
% 7.42/1.67 --trig_cnt_out false
% 7.42/1.67 --trig_cnt_out_tolerance 1.
% 7.42/1.67 --trig_cnt_out_sk_spl false
% 7.42/1.67 --abstr_cl_out false
% 7.42/1.67
% 7.42/1.67 ------ Interactive Mode
% 7.42/1.67
% 7.42/1.67 --interactive_mode false
% 7.42/1.67 --external_ip_address ""
% 7.42/1.67 --external_port 0
% 7.42/1.67
% 7.42/1.67 ------ Global Options
% 7.42/1.67
% 7.42/1.67 --schedule none
% 7.42/1.67 --add_important_lit false
% 7.42/1.67 --prop_solver_per_cl 500
% 7.42/1.67 --subs_bck_mult 8
% 7.42/1.67 --min_unsat_core false
% 7.42/1.67 --soft_assumptions false
% 7.42/1.67 --soft_lemma_size 3
% 7.42/1.67 --prop_impl_unit_size 0
% 7.42/1.67 --prop_impl_unit []
% 7.42/1.67 --share_sel_clauses true
% 7.42/1.67 --reset_solvers false
% 7.42/1.67 --bc_imp_inh [conj_cone]
% 7.42/1.67 --conj_cone_tolerance 3.
% 7.42/1.67 --extra_neg_conj none
% 7.42/1.67 --large_theory_mode true
% 7.42/1.67 --prolific_symb_bound 200
% 7.42/1.67 --lt_threshold 2000
% 7.42/1.67 --clause_weak_htbl true
% 7.42/1.67 --gc_record_bc_elim false
% 7.42/1.67
% 7.42/1.67 ------ Preprocessing Options
% 7.42/1.67
% 7.42/1.67 --preprocessing_flag true
% 7.42/1.67 --time_out_prep_mult 0.1
% 7.42/1.67 --splitting_mode input
% 7.42/1.67 --splitting_grd true
% 7.42/1.67 --splitting_cvd false
% 7.42/1.67 --splitting_cvd_svl false
% 7.42/1.67 --splitting_nvd 32
% 7.42/1.67 --sub_typing false
% 7.42/1.67 --prep_gs_sim true
% 7.42/1.67 --prep_unflatten true
% 7.42/1.67 --prep_res_sim true
% 7.42/1.67 --prep_sup_sim_all true
% 7.42/1.67 --prep_sup_sim_sup false
% 7.42/1.67 --prep_upred true
% 7.42/1.67 --prep_well_definedness true
% 7.42/1.67 --prep_sem_filter exhaustive
% 7.42/1.67 --prep_sem_filter_out false
% 7.42/1.67 --pred_elim true
% 7.42/1.67 --res_sim_input true
% 7.42/1.67 --eq_ax_congr_red true
% 7.42/1.67 --pure_diseq_elim true
% 7.42/1.67 --brand_transform false
% 7.42/1.67 --non_eq_to_eq false
% 7.42/1.67 --prep_def_merge true
% 7.42/1.67 --prep_def_merge_prop_impl false
% 7.42/1.67 --prep_def_merge_mbd true
% 7.42/1.67 --prep_def_merge_tr_red false
% 7.42/1.67 --prep_def_merge_tr_cl false
% 7.42/1.67 --smt_preprocessing false
% 7.42/1.67 --smt_ac_axioms fast
% 7.42/1.67 --preprocessed_out false
% 7.42/1.67 --preprocessed_stats false
% 7.42/1.67
% 7.42/1.67 ------ Abstraction refinement Options
% 7.42/1.67
% 7.42/1.67 --abstr_ref []
% 7.42/1.67 --abstr_ref_prep false
% 7.42/1.67 --abstr_ref_until_sat false
% 7.42/1.67 --abstr_ref_sig_restrict funpre
% 7.42/1.67 --abstr_ref_af_restrict_to_split_sk false
% 7.42/1.67 --abstr_ref_under []
% 7.42/1.67
% 7.42/1.67 ------ SAT Options
% 7.42/1.67
% 7.42/1.67 --sat_mode false
% 7.42/1.67 --sat_fm_restart_options ""
% 7.42/1.67 --sat_gr_def false
% 7.42/1.67 --sat_epr_types true
% 7.42/1.67 --sat_non_cyclic_types false
% 7.42/1.67 --sat_finite_models false
% 7.42/1.67 --sat_fm_lemmas false
% 7.42/1.67 --sat_fm_prep false
% 7.42/1.67 --sat_fm_uc_incr true
% 7.42/1.67 --sat_out_model small
% 7.42/1.67 --sat_out_clauses false
% 7.42/1.67
% 7.42/1.67 ------ QBF Options
% 7.42/1.67
% 7.42/1.67 --qbf_mode false
% 7.42/1.67 --qbf_elim_univ false
% 7.42/1.67 --qbf_dom_inst none
% 7.42/1.67 --qbf_dom_pre_inst false
% 7.42/1.67 --qbf_sk_in false
% 7.42/1.67 --qbf_pred_elim true
% 7.42/1.67 --qbf_split 512
% 7.42/1.67
% 7.42/1.67 ------ BMC1 Options
% 7.42/1.67
% 7.42/1.67 --bmc1_incremental false
% 7.42/1.67 --bmc1_axioms reachable_all
% 7.42/1.67 --bmc1_min_bound 0
% 7.42/1.67 --bmc1_max_bound -1
% 7.42/1.67 --bmc1_max_bound_default -1
% 7.42/1.67 --bmc1_symbol_reachability true
% 7.42/1.67 --bmc1_property_lemmas false
% 7.42/1.67 --bmc1_k_induction false
% 7.42/1.67 --bmc1_non_equiv_states false
% 7.42/1.67 --bmc1_deadlock false
% 7.42/1.67 --bmc1_ucm false
% 7.42/1.67 --bmc1_add_unsat_core none
% 7.42/1.67 --bmc1_unsat_core_children false
% 7.42/1.67 --bmc1_unsat_core_extrapolate_axioms false
% 7.42/1.67 --bmc1_out_stat full
% 7.42/1.67 --bmc1_ground_init false
% 7.42/1.67 --bmc1_pre_inst_next_state false
% 7.42/1.67 --bmc1_pre_inst_state false
% 7.42/1.67 --bmc1_pre_inst_reach_state false
% 7.42/1.67 --bmc1_out_unsat_core false
% 7.42/1.67 --bmc1_aig_witness_out false
% 7.42/1.67 --bmc1_verbose false
% 7.42/1.67 --bmc1_dump_clauses_tptp false
% 7.42/1.67 --bmc1_dump_unsat_core_tptp false
% 7.42/1.67 --bmc1_dump_file -
% 7.42/1.67 --bmc1_ucm_expand_uc_limit 128
% 7.42/1.67 --bmc1_ucm_n_expand_iterations 6
% 7.42/1.67 --bmc1_ucm_extend_mode 1
% 7.42/1.67 --bmc1_ucm_init_mode 2
% 7.42/1.67 --bmc1_ucm_cone_mode none
% 7.42/1.67 --bmc1_ucm_reduced_relation_type 0
% 7.42/1.67 --bmc1_ucm_relax_model 4
% 7.42/1.67 --bmc1_ucm_full_tr_after_sat true
% 7.42/1.67 --bmc1_ucm_expand_neg_assumptions false
% 7.42/1.67 --bmc1_ucm_layered_model none
% 7.42/1.67 --bmc1_ucm_max_lemma_size 10
% 7.42/1.67
% 7.42/1.67 ------ AIG Options
% 7.42/1.67
% 7.42/1.67 --aig_mode false
% 7.42/1.67
% 7.42/1.67 ------ Instantiation Options
% 7.42/1.67
% 7.42/1.67 --instantiation_flag true
% 7.42/1.67 --inst_sos_flag false
% 7.42/1.67 --inst_sos_phase true
% 7.42/1.67 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 7.42/1.67 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 7.42/1.67 --inst_lit_sel_side num_symb
% 7.42/1.67 --inst_solver_per_active 1400
% 7.42/1.67 --inst_solver_calls_frac 1.
% 7.42/1.67 --inst_to_smt_solver true
% 7.42/1.67 --inst_passive_queue_type priority_queues
% 7.42/1.67 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 7.42/1.67 --inst_passive_queues_freq [25;2]
% 7.42/1.67 --inst_dismatching true
% 7.42/1.67 --inst_eager_unprocessed_to_passive true
% 7.42/1.67 --inst_unprocessed_bound 1000
% 7.42/1.67 --inst_prop_sim_given true
% 7.42/1.67 --inst_prop_sim_new false
% 7.42/1.67 --inst_subs_new false
% 7.42/1.67 --inst_eq_res_simp false
% 7.42/1.67 --inst_subs_given false
% 7.42/1.67 --inst_orphan_elimination true
% 7.42/1.67 --inst_learning_loop_flag true
% 7.42/1.67 --inst_learning_start 3000
% 7.42/1.67 --inst_learning_factor 2
% 7.42/1.67 --inst_start_prop_sim_after_learn 3
% 7.42/1.67 --inst_sel_renew solver
% 7.42/1.67 --inst_lit_activity_flag true
% 7.42/1.67 --inst_restr_to_given false
% 7.42/1.67 --inst_activity_threshold 500
% 7.42/1.67
% 7.42/1.67 ------ Resolution Options
% 7.42/1.67
% 7.42/1.67 --resolution_flag true
% 7.42/1.67 --res_lit_sel adaptive
% 7.42/1.67 --res_lit_sel_side none
% 7.42/1.67 --res_ordering kbo
% 7.42/1.67 --res_to_prop_solver active
% 7.42/1.67 --res_prop_simpl_new false
% 7.42/1.67 --res_prop_simpl_given true
% 7.42/1.67 --res_to_smt_solver true
% 7.42/1.67 --res_passive_queue_type priority_queues
% 7.42/1.67 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 7.42/1.67 --res_passive_queues_freq [15;5]
% 7.42/1.67 --res_forward_subs full
% 7.42/1.67 --res_backward_subs full
% 7.42/1.67 --res_forward_subs_resolution true
% 7.42/1.67 --res_backward_subs_resolution true
% 7.42/1.67 --res_orphan_elimination true
% 7.42/1.67 --res_time_limit 300.
% 7.42/1.67
% 7.42/1.67 ------ Superposition Options
% 7.42/1.67
% 7.42/1.67 --superposition_flag true
% 7.42/1.67 --sup_passive_queue_type priority_queues
% 7.42/1.67 --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]]
% 7.42/1.67 --sup_passive_queues_freq [8;1;4;4]
% 7.42/1.67 --demod_completeness_check fast
% 7.42/1.67 --demod_use_ground true
% 7.42/1.67 --sup_unprocessed_bound 0
% 7.42/1.67 --sup_to_prop_solver passive
% 7.42/1.67 --sup_prop_simpl_new true
% 7.42/1.67 --sup_prop_simpl_given true
% 7.42/1.67 --sup_fun_splitting false
% 7.42/1.67 --sup_iter_deepening 2
% 7.42/1.67 --sup_restarts_mult 12
% 7.42/1.67 --sup_score sim_d_gen
% 7.42/1.67 --sup_share_score_frac 0.2
% 7.42/1.67 --sup_share_max_num_cl 500
% 7.42/1.67 --sup_ordering kbo
% 7.42/1.67 --sup_symb_ordering invfreq
% 7.42/1.67 --sup_term_weight default
% 7.42/1.67
% 7.42/1.67 ------ Superposition Simplification Setup
% 7.42/1.67
% 7.42/1.67 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 7.42/1.67 --sup_full_triv [SMTSimplify;PropSubs]
% 7.42/1.67 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 7.42/1.67 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 7.42/1.67 --sup_immed_triv []
% 7.42/1.67 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 7.42/1.67 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 7.42/1.67 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 7.42/1.67 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 7.42/1.67 --sup_input_triv [Unflattening;SMTSimplify]
% 7.42/1.67 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 7.42/1.67 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 7.42/1.67 --sup_full_fixpoint true
% 7.42/1.67 --sup_main_fixpoint true
% 7.42/1.67 --sup_immed_fixpoint false
% 7.42/1.67 --sup_input_fixpoint true
% 7.42/1.67 --sup_cache_sim none
% 7.42/1.67 --sup_smt_interval 500
% 7.42/1.67 --sup_bw_gjoin_interval 0
% 7.42/1.67
% 7.42/1.67 ------ Combination Options
% 7.42/1.67
% 7.42/1.67 --comb_mode clause_based
% 7.42/1.67 --comb_inst_mult 5
% 7.42/1.67 --comb_res_mult 1
% 7.42/1.67 --comb_sup_mult 8
% 7.42/1.67 --comb_sup_deep_mult 2
% 7.42/1.67
% 7.42/1.67 ------ Debug Options
% 7.42/1.67
% 7.42/1.67 --dbg_backtrace false
% 7.42/1.67 --dbg_dump_prop_clauses false
% 7.42/1.67 --dbg_dump_prop_clauses_file -
% 7.42/1.67 --dbg_out_stat false
% 7.42/1.67 --dbg_just_parse false
% 7.42/1.67
% 7.42/1.67
% 7.42/1.67
% 7.42/1.67
% 7.42/1.67 ------ Proving...
% 7.42/1.67
% 7.42/1.67
% 7.42/1.67 % SZS status Unsatisfiable for theBenchmark.p
% 7.42/1.67
% 7.42/1.67 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.42/1.67
% 7.42/1.67 ------ Statistics
% 7.42/1.67
% 7.42/1.67 ------ Problem properties
% 7.42/1.67
% 7.42/1.67 clauses: 15
% 7.42/1.67 conjectures: 0
% 7.42/1.67 epr: 0
% 7.42/1.67 horn: 15
% 7.42/1.67 ground: 2
% 7.42/1.67 unary: 15
% 7.42/1.67 binary: 0
% 7.42/1.67 lits: 15
% 7.42/1.67 lits_eq: 15
% 7.42/1.67 fd_pure: 0
% 7.42/1.67 fd_pseudo: 0
% 7.42/1.67 fd_cond: 0
% 7.42/1.67 fd_pseudo_cond: 0
% 7.42/1.67 ac_symbols: 2
% 7.42/1.67
% 7.42/1.67 ------ General
% 7.42/1.67
% 7.42/1.67 abstr_ref_over_cycles: 0
% 7.42/1.67 abstr_ref_under_cycles: 0
% 7.42/1.67 gc_basic_clause_elim: 0
% 7.42/1.67 num_of_symbols: 106
% 7.42/1.67 num_of_terms: 46196
% 7.42/1.67
% 7.42/1.67 parsing_time: 0.001
% 7.42/1.67 unif_index_cands_time: 0.021
% 7.42/1.67 unif_index_add_time: 0.005
% 7.42/1.67 orderings_time: 0.008
% 7.42/1.67 out_proof_time: 0.002
% 7.42/1.67 total_time: 0.851
% 7.42/1.67
% 7.42/1.67 ------ Preprocessing
% 7.42/1.67
% 7.42/1.67 num_of_splits: 0
% 7.42/1.67 num_of_split_atoms: 0
% 7.42/1.67 num_of_reused_defs: 0
% 7.42/1.67 num_eq_ax_congr_red: 6
% 7.42/1.67 num_of_sem_filtered_clauses: 0
% 7.42/1.67 num_of_subtypes: 0
% 7.42/1.67 monotx_restored_types: 0
% 7.42/1.67 sat_num_of_epr_types: 0
% 7.42/1.67 sat_num_of_non_cyclic_types: 0
% 7.42/1.67 sat_guarded_non_collapsed_types: 0
% 7.42/1.67 num_pure_diseq_elim: 0
% 7.42/1.67 simp_replaced_by: 0
% 7.42/1.67 res_preprocessed: 0
% 7.42/1.67 sup_preprocessed: 6
% 7.42/1.67 prep_upred: 0
% 7.42/1.67 prep_unflattend: 0
% 7.42/1.67 prep_well_definedness: 0
% 7.42/1.67 smt_new_axioms: 0
% 7.42/1.67 pred_elim_cands: 0
% 7.42/1.67 pred_elim: 0
% 7.42/1.67 pred_elim_cl: 0
% 7.42/1.67 pred_elim_cycles: 0
% 7.42/1.67 merged_defs: 0
% 7.42/1.67 merged_defs_ncl: 0
% 7.42/1.67 bin_hyper_res: 0
% 7.42/1.67 prep_cycles: 3
% 7.42/1.67
% 7.42/1.67 splitting_time: 0.
% 7.42/1.67 sem_filter_time: 0.015
% 7.42/1.67 monotx_time: 0.
% 7.42/1.67 subtype_inf_time: 0.
% 7.42/1.67 res_prep_time: 0.003
% 7.42/1.67 sup_prep_time: 0.002
% 7.42/1.67 pred_elim_time: 0.
% 7.42/1.67 bin_hyper_res_time: 0.
% 7.42/1.67 prep_time_total: 0.022
% 7.42/1.67
% 7.42/1.67 ------ Propositional Solver
% 7.42/1.67
% 7.42/1.67 prop_solver_calls: 23
% 7.42/1.67 prop_fast_solver_calls: 1258
% 7.42/1.67 smt_solver_calls: 0
% 7.42/1.67 smt_fast_solver_calls: 0
% 7.42/1.67 prop_num_of_clauses: 8329
% 7.42/1.67 prop_preprocess_simplified: 9549
% 7.42/1.67 prop_fo_subsumed: 0
% 7.42/1.67
% 7.42/1.67 prop_solver_time: 0.
% 7.42/1.67 prop_fast_solver_time: 0.
% 7.42/1.67 prop_unsat_core_time: 0.
% 7.42/1.67 smt_solver_time: 0.
% 7.42/1.67 smt_fast_solver_time: 0.
% 7.42/1.67
% 7.42/1.67 ------ QBF
% 7.42/1.67
% 7.42/1.67 qbf_q_res: 0
% 7.42/1.67 qbf_num_tautologies: 0
% 7.42/1.67 qbf_prep_cycles: 0
% 7.42/1.67
% 7.42/1.67 ------ BMC1
% 7.42/1.67
% 7.42/1.67 bmc1_current_bound: -1
% 7.42/1.67 bmc1_last_solved_bound: -1
% 7.42/1.67 bmc1_unsat_core_size: -1
% 7.42/1.67 bmc1_unsat_core_parents_size: -1
% 7.42/1.67 bmc1_merge_next_fun: 0
% 7.42/1.67
% 7.42/1.67 bmc1_unsat_core_clauses_time: 0.
% 7.42/1.67
% 7.42/1.67 ------ Instantiation
% 7.42/1.67
% 7.42/1.67 inst_num_of_clauses: 1661
% 7.42/1.67 inst_num_in_passive: 779
% 7.42/1.67 inst_num_in_active: 583
% 7.42/1.67 inst_num_of_loops: 592
% 7.42/1.67 inst_num_in_unprocessed: 299
% 7.42/1.67 inst_num_of_learning_restarts: 0
% 7.42/1.67 inst_num_moves_active_passive: 0
% 7.42/1.67 inst_lit_activity: 0
% 7.42/1.67 inst_lit_activity_moves: 0
% 7.42/1.67 inst_num_tautologies: 0
% 7.42/1.67 inst_num_prop_implied: 0
% 7.42/1.67 inst_num_existing_simplified: 0
% 7.42/1.67 inst_num_eq_res_simplified: 0
% 7.42/1.67 inst_num_child_elim: 0
% 7.42/1.67 inst_num_of_dismatching_blockings: 234
% 7.42/1.67 inst_num_of_non_proper_insts: 1235
% 7.42/1.67 inst_num_of_duplicates: 0
% 7.42/1.67 inst_inst_num_from_inst_to_res: 0
% 7.42/1.67
% 7.42/1.67 inst_time_sim_new: 0.045
% 7.42/1.67 inst_time_sim_given: 0.
% 7.42/1.67 inst_time_dismatching_checking: 0.01
% 7.42/1.67 inst_time_total: 0.145
% 7.42/1.67
% 7.42/1.67 ------ Resolution
% 7.42/1.67
% 7.42/1.67 res_num_of_clauses: 330
% 7.42/1.67 res_num_in_passive: 242
% 7.42/1.67 res_num_in_active: 88
% 7.42/1.67 res_num_of_loops: 156
% 7.42/1.67 res_forward_subset_subsumed: 403
% 7.42/1.67 res_backward_subset_subsumed: 0
% 7.42/1.67 res_forward_subsumed: 9
% 7.42/1.67 res_backward_subsumed: 0
% 7.42/1.67 res_forward_subsumption_resolution: 1
% 7.42/1.67 res_backward_subsumption_resolution: 0
% 7.42/1.67 res_clause_to_clause_subsumption: 746
% 7.42/1.67 res_subs_bck_cnt: 3
% 7.42/1.67 res_orphan_elimination: 0
% 7.42/1.67 res_tautology_del: 196
% 7.42/1.67 res_num_eq_res_simplified: 6
% 7.42/1.67 res_num_sel_changes: 52
% 7.42/1.67 res_moves_from_active_to_pass: 1
% 7.42/1.67
% 7.42/1.67 res_time_sim_new: 0.013
% 7.42/1.67 res_time_sim_fw_given: 0.003
% 7.42/1.67 res_time_sim_bw_given: 0.002
% 7.42/1.67 res_time_total: 0.028
% 7.42/1.67
% 7.42/1.67 ------ Superposition
% 7.42/1.67
% 7.42/1.67 sup_num_of_clauses: 669
% 7.42/1.67 sup_num_in_active: 69
% 7.42/1.67 sup_num_in_passive: 600
% 7.42/1.67 sup_num_of_loops: 323
% 7.42/1.67 sup_fw_superposition: 6618
% 7.42/1.67 sup_bw_superposition: 4066
% 7.42/1.67 sup_eq_factoring: 0
% 7.42/1.67 sup_eq_resolution: 0
% 7.42/1.67 sup_immediate_simplified: 4
% 7.42/1.67 sup_given_eliminated: 1
% 7.42/1.67 comparisons_done: 19999
% 7.42/1.67 comparisons_avoided: 0
% 7.42/1.67 comparisons_inc_criteria: 0
% 7.42/1.67 sup_deep_cl_discarded: 0
% 7.42/1.67 sup_num_of_deepenings: 0
% 7.42/1.67 sup_num_of_restarts: 1
% 7.42/1.67
% 7.42/1.67 sup_time_generating: 0.17
% 7.42/1.67 sup_time_sim_fw_full: 0.029
% 7.42/1.67 sup_time_sim_bw_full: 0.06
% 7.42/1.67 sup_time_sim_fw_immed: 0.082
% 7.42/1.67 sup_time_sim_bw_immed: 0.035
% 7.42/1.67 sup_time_prep_sim_fw_input: 0.001
% 7.42/1.67 sup_time_prep_sim_bw_input: 0.001
% 7.42/1.67 sup_time_total: 0.614
% 7.42/1.67
% 7.42/1.67 ------ Simplifications
% 7.42/1.67
% 7.42/1.67 sim_repeated: 3936
% 7.42/1.67 sim_fw_subset_subsumed: 0
% 7.42/1.67 sim_bw_subset_subsumed: 0
% 7.42/1.67 sim_fw_subsumed: 0
% 7.42/1.67 sim_bw_subsumed: 0
% 7.42/1.67 sim_fw_subsumption_res: 0
% 7.42/1.67 sim_bw_subsumption_res: 0
% 7.42/1.67 sim_fw_unit_subs: 0
% 7.42/1.67 sim_bw_unit_subs: 11
% 7.42/1.67 sim_tautology_del: 0
% 7.42/1.67 sim_eq_tautology_del: 646
% 7.42/1.67 sim_eq_res_simp: 0
% 7.42/1.67 sim_fw_demodulated: 97
% 7.42/1.67 sim_bw_demodulated: 97
% 7.42/1.67 sim_encompassment_demod: 0
% 7.42/1.67 sim_light_normalised: 1942
% 7.42/1.67 sim_ac_normalised: 1065
% 7.42/1.67 sim_joinable_taut: 13
% 7.42/1.67 sim_joinable_simp: 0
% 7.42/1.67 sim_fw_ac_demod: 0
% 7.42/1.67 sim_bw_ac_demod: 0
% 7.42/1.67 sim_smt_subsumption: 0
% 7.42/1.67 sim_smt_simplified: 0
% 7.42/1.67 sim_ground_joinable: 50
% 7.42/1.67 sim_bw_ground_joinable: 0
% 7.42/1.67 sim_connectedness: 0
% 7.42/1.67
% 7.42/1.67 sim_time_fw_subset_subs: 0.003
% 7.42/1.67 sim_time_bw_subset_subs: 0.001
% 7.42/1.67 sim_time_fw_subs: 0.
% 7.42/1.67 sim_time_bw_subs: 0.
% 7.42/1.67 sim_time_fw_subs_res: 0.
% 7.42/1.67 sim_time_bw_subs_res: 0.
% 7.42/1.67 sim_time_fw_unit_subs: 0.022
% 7.42/1.67 sim_time_bw_unit_subs: 0.015
% 7.42/1.67 sim_time_tautology_del: 0.001
% 7.42/1.67 sim_time_eq_tautology_del: 0.001
% 7.42/1.67 sim_time_eq_res_simp: 0.
% 7.42/1.67 sim_time_fw_demod: 0.009
% 7.42/1.67 sim_time_bw_demod: 0.016
% 7.42/1.67 sim_time_light_norm: 0.029
% 7.42/1.67 sim_time_joinable: 0.
% 7.42/1.67 sim_time_ac_norm: 0.024
% 7.42/1.67 sim_time_fw_ac_demod: 0.
% 7.42/1.67 sim_time_bw_ac_demod: 0.
% 7.42/1.67 sim_time_smt_subs: 0.
% 7.42/1.67 sim_time_fw_gjoin: 0.011
% 7.42/1.67 sim_time_fw_connected: 0.
% 7.42/1.67
% 7.42/1.67
%------------------------------------------------------------------------------