TSTP Solution File: PUZ015-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : PUZ015-1 : 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:19:28 EDT 2023
% Result : Satisfiable 174.04s 23.81s
% Output : Saturation 174.04s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ achievable(row(X0),squares(not_covered,not_covered,X1,X2,X3,X4,X5,X6))
| achievable(row(X0),squares(covered,covered,X1,X2,X3,X4,X5,X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cover_columns_1_and_2) ).
cnf(c_50,plain,
( ~ achievable(row(X0),squares(X1,not_covered,not_covered,X2,X3,X4,X5,X6))
| achievable(row(X0),squares(X1,covered,covered,X2,X3,X4,X5,X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cover_columns_2_and_3) ).
cnf(c_51,plain,
( ~ achievable(row(X0),squares(X1,X2,not_covered,not_covered,X3,X4,X5,X6))
| achievable(row(X0),squares(X1,X2,covered,covered,X3,X4,X5,X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cover_columns_3_and_4) ).
cnf(c_52,plain,
( ~ achievable(row(X0),squares(X1,X2,X3,not_covered,not_covered,X4,X5,X6))
| achievable(row(X0),squares(X1,X2,X3,covered,covered,X4,X5,X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cover_columns_4_and_5) ).
cnf(c_53,plain,
( ~ achievable(row(X0),squares(X1,X2,X3,X4,not_covered,not_covered,X5,X6))
| achievable(row(X0),squares(X1,X2,X3,X4,covered,covered,X5,X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cover_columns_5_and_6) ).
cnf(c_54,plain,
( ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,not_covered,not_covered,X6))
| achievable(row(X0),squares(X1,X2,X3,X4,X5,covered,covered,X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cover_columns_6_and_7) ).
cnf(c_55,plain,
( ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,not_covered,not_covered))
| achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,covered,covered)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cover_columns_7_and_8) ).
cnf(c_56,plain,
( ~ achievable(row(X0),squares(X1,X2,X3,X4,X5,X6,X7,X8))
| achievable(row(successor(X0)),squares(complement(X1),complement(X2),complement(X3),complement(X4),complement(X5),complement(X6),complement(X7),complement(X8))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',place_vertical_pieces) ).
cnf(c_57,plain,
successor(n1) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_1_is_2) ).
cnf(c_58,plain,
successor(n2) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_2_is_3) ).
cnf(c_59,plain,
successor(n3) = n4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_3_is_4) ).
cnf(c_60,plain,
successor(n4) = n5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_4_is_5) ).
cnf(c_61,plain,
successor(n5) = n6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_5_is_6) ).
cnf(c_62,plain,
successor(n6) = n7,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_6_is_7) ).
cnf(c_63,plain,
successor(n7) = n8,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_7_is_8) ).
cnf(c_64,plain,
successor(n8) = n9,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_8_is_9) ).
cnf(c_65,plain,
complement(covered) = not_covered,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_covered_is_not_covered) ).
cnf(c_66,plain,
complement(not_covered) = covered,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_not_covered_is_covered) ).
cnf(c_67,plain,
complement(removed) = not_covered,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_r_is_not_covered) ).
cnf(c_68,plain,
achievable(row(n1),squares(removed,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',first_row_initially) ).
cnf(c_69,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,not_covered)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',try_prove_row_8_can_be_covered) ).
cnf(c_137,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_144,negated_conjecture,
~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,not_covered)),
inference(subtyping,[status(esa)],[c_69]) ).
cnf(c_145,plain,
achievable(row(n1),squares(removed,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
inference(subtyping,[status(esa)],[c_68]) ).
cnf(c_146,plain,
complement(removed) = not_covered,
inference(subtyping,[status(esa)],[c_67]) ).
cnf(c_147,plain,
complement(not_covered) = covered,
inference(subtyping,[status(esa)],[c_66]) ).
cnf(c_148,plain,
complement(covered) = not_covered,
inference(subtyping,[status(esa)],[c_65]) ).
cnf(c_149,plain,
successor(n8) = n9,
inference(subtyping,[status(esa)],[c_64]) ).
cnf(c_150,plain,
successor(n7) = n8,
inference(subtyping,[status(esa)],[c_63]) ).
cnf(c_151,plain,
successor(n6) = n7,
inference(subtyping,[status(esa)],[c_62]) ).
cnf(c_152,plain,
successor(n5) = n6,
inference(subtyping,[status(esa)],[c_61]) ).
cnf(c_153,plain,
successor(n4) = n5,
inference(subtyping,[status(esa)],[c_60]) ).
cnf(c_154,plain,
successor(n3) = n4,
inference(subtyping,[status(esa)],[c_59]) ).
cnf(c_155,plain,
successor(n2) = n3,
inference(subtyping,[status(esa)],[c_58]) ).
cnf(c_156,plain,
successor(n1) = n2,
inference(subtyping,[status(esa)],[c_57]) ).
cnf(c_157,plain,
( ~ achievable(row(X0_15),squares(X0_16,X1_16,X2_16,X3_16,X4_16,X5_16,X6_16,X7_16))
| achievable(row(successor(X0_15)),squares(complement(X0_16),complement(X1_16),complement(X2_16),complement(X3_16),complement(X4_16),complement(X5_16),complement(X6_16),complement(X7_16))) ),
inference(subtyping,[status(esa)],[c_56]) ).
cnf(c_158,plain,
( ~ achievable(row(X0_15),squares(X0_16,X1_16,X2_16,X3_16,X4_16,X5_16,not_covered,not_covered))
| achievable(row(X0_15),squares(X0_16,X1_16,X2_16,X3_16,X4_16,X5_16,covered,covered)) ),
inference(subtyping,[status(esa)],[c_55]) ).
cnf(c_159,plain,
( ~ achievable(row(X0_15),squares(X0_16,X1_16,X2_16,X3_16,X4_16,not_covered,not_covered,X5_16))
| achievable(row(X0_15),squares(X0_16,X1_16,X2_16,X3_16,X4_16,covered,covered,X5_16)) ),
inference(subtyping,[status(esa)],[c_54]) ).
cnf(c_160,plain,
( ~ achievable(row(X0_15),squares(X0_16,X1_16,X2_16,X3_16,not_covered,not_covered,X4_16,X5_16))
| achievable(row(X0_15),squares(X0_16,X1_16,X2_16,X3_16,covered,covered,X4_16,X5_16)) ),
inference(subtyping,[status(esa)],[c_53]) ).
cnf(c_161,plain,
( ~ achievable(row(X0_15),squares(X0_16,X1_16,X2_16,not_covered,not_covered,X3_16,X4_16,X5_16))
| achievable(row(X0_15),squares(X0_16,X1_16,X2_16,covered,covered,X3_16,X4_16,X5_16)) ),
inference(subtyping,[status(esa)],[c_52]) ).
cnf(c_162,plain,
( ~ achievable(row(X0_15),squares(X0_16,X1_16,not_covered,not_covered,X2_16,X3_16,X4_16,X5_16))
| achievable(row(X0_15),squares(X0_16,X1_16,covered,covered,X2_16,X3_16,X4_16,X5_16)) ),
inference(subtyping,[status(esa)],[c_51]) ).
cnf(c_163,plain,
( ~ achievable(row(X0_15),squares(X0_16,not_covered,not_covered,X1_16,X2_16,X3_16,X4_16,X5_16))
| achievable(row(X0_15),squares(X0_16,covered,covered,X1_16,X2_16,X3_16,X4_16,X5_16)) ),
inference(subtyping,[status(esa)],[c_50]) ).
cnf(c_164,plain,
( ~ achievable(row(X0_15),squares(not_covered,not_covered,X0_16,X1_16,X2_16,X3_16,X4_16,X5_16))
| achievable(row(X0_15),squares(covered,covered,X0_16,X1_16,X2_16,X3_16,X4_16,X5_16)) ),
inference(subtyping,[status(esa)],[c_49]) ).
cnf(c_562,plain,
achievable(row(n1),squares(removed,not_covered,not_covered,not_covered,not_covered,not_covered,covered,covered)),
inference(superposition,[status(thm)],[c_145,c_158]) ).
cnf(c_566,plain,
achievable(row(n1),squares(removed,not_covered,not_covered,not_covered,not_covered,covered,covered,not_covered)),
inference(superposition,[status(thm)],[c_145,c_159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : PUZ015-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n003.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 : Sat Aug 26 22:28:24 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 39.62/6.23 % SZS status Started for theBenchmark.p
% 39.62/6.23 ERROR - "ProverProcess:heur/379306:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Z3.Error("Sort mismatch at argument #1 for function (declare-fun k!96 (|16777216|) |16777216|) supplied sort is |16777231|")
% 39.62/6.23 Fatal error: exception Z3.Error("Sort mismatch at argument #1 for function (declare-fun k!96 (|16777216|) |16777216|) supplied sort is |16777231|")
% 39.62/6.23 ERROR - cmd was: ulimit -v 4096000; ./res/iproveropt_static_z3 --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 6 --comb_sup_mult 32 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground false --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs;Unflattening]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes;DemodLoopTriv;ACNormalisation]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;Demod;LightNorm;ACNormalisation]" --sup_immed_triv "[PropSubs]" --sup_indices_passive "[]" --sup_input_bw "[SubsumptionRes]" --sup_input_fw "[SMTSubs;]" --sup_input_triv "[]" --sup_iter_deepening 1 --sup_passive_queue_type priority_queues --sup_passive_queues "[[+min_def_symb;-score;+epr];[-next_state;-conj_dist;+conj_symb]]" --sup_passive_queues_freq "[3;512]" --sup_prop_simpl_given false --sup_prop_simpl_new true --sup_restarts_mult 16 --sup_score sim_d_gen --sup_share_max_num_cl 320 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering arity_rev --sup_to_prop_solver none --superposition_flag true --time_out_prep_mult 0.1 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 2.00" --time_out_real 2.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_yzwfvq6i/6xpyg3dn 2>> /export/starexec/sandbox2/tmp/iprover_out_yzwfvq6i/6xpyg3dn_error
% 174.04/23.81 % SZS status Satisfiable for theBenchmark.p
% 174.04/23.81
% 174.04/23.81 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 174.04/23.81
% 174.04/23.81 ------ iProver source info
% 174.04/23.81
% 174.04/23.81 git: date: 2023-05-31 18:12:56 +0000
% 174.04/23.81 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 174.04/23.81 git: non_committed_changes: false
% 174.04/23.81 git: last_make_outside_of_git: false
% 174.04/23.81
% 174.04/23.81 ------ Parsing...successful
% 174.04/23.81
% 174.04/23.81
% 174.04/23.81
% 174.04/23.81 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 174.04/23.81
% 174.04/23.81 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 174.04/23.81
% 174.04/23.81 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 174.04/23.81 ------ Proving...
% 174.04/23.81 ------ Problem Properties
% 174.04/23.81
% 174.04/23.81
% 174.04/23.81 clauses 21
% 174.04/23.81 conjectures 1
% 174.04/23.81 EPR 0
% 174.04/23.81 Horn 21
% 174.04/23.81 unary 13
% 174.04/23.81 binary 8
% 174.04/23.81 lits 29
% 174.04/23.81 lits eq 11
% 174.04/23.81 fd_pure 0
% 174.04/23.81 fd_pseudo 0
% 174.04/23.81 fd_cond 0
% 174.04/23.81 fd_pseudo_cond 0
% 174.04/23.81 AC symbols 0
% 174.04/23.81
% 174.04/23.81 ------ Input Options Time Limit: Unbounded
% 174.04/23.81
% 174.04/23.81
% 174.04/23.81 ------
% 174.04/23.81 Current options:
% 174.04/23.81 ------
% 174.04/23.81
% 174.04/23.81
% 174.04/23.81
% 174.04/23.81
% 174.04/23.81 ------ Proving...
% 174.04/23.81
% 174.04/23.81
% 174.04/23.81 % SZS status Satisfiable for theBenchmark.p
% 174.04/23.81
% 174.04/23.81 % SZS output start Saturation for theBenchmark.p
% See solution above
% 174.04/23.81
% 174.04/23.82
%------------------------------------------------------------------------------