TSTP Solution File: HWV090_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : HWV090_1 : TPTP v8.1.2. Bugfixed v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 02:23:35 EDT 2023
% Result : Timeout 288.60s 41.55s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 73 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 222 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 163 ( 62 ~; 46 |; 25 &)
% ( 20 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 48 ( 48 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 20 ( 18 usr; 8 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 69 ( 3 sgn; 55 !; 2 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1210,conjecture,
! [X1: state_type] :
( reachableState(X1)
=> v4(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssertion) ).
tff(f1211,negated_conjecture,
~ ! [X1: state_type] :
( reachableState(X1)
=> v4(X1) ),
inference(negated_conjecture,[],[f1210]) ).
tff(f1212,axiom,
! [X1: state_type] :
( ~ v4(X1)
<=> v30850(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_3140) ).
tff(f1213,axiom,
! [X1: state_type] :
( ~ v30850(X1)
<=> v30851(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_3139) ).
tff(f1214,axiom,
! [X1: state_type] :
( v30851(X1)
<=> ( v30869(X1)
& v30853(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_6728) ).
tff(f1215,axiom,
! [X1: state_type] :
( v30869(X1)
<=> ( v30855(X1,bitIndex1)
| v30855(X1,bitIndex0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_1723) ).
tff(f1216,axiom,
! [X1: state_type] :
( ~ v30853(X1)
<=> v30854(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_3138) ).
tff(f1217,axiom,
! [X1: state_type] :
( v30854(X1)
<=> ( v30855(X1,bitIndex1)
& v30855(X1,bitIndex0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_1722) ).
tff(f1218,axiom,
! [X1: state_type] :
( v30855(X1,bitIndex0)
<=> v30856(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_9322) ).
tff(f1219,axiom,
! [X1: state_type] :
( v30855(X1,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_9321) ).
tff(f1220,axiom,
! [X1: state_type] :
( v30856(X1)
<=> ( v30860(X1,bitIndex5)
& v30858(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_1721) ).
tff(f1221,axiom,
! [X1: state_type] :
( v30858(X1)
<=> ( v30860(X1,bitIndex4)
& v30859(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_1720) ).
tff(f1232,axiom,
! [X1: state_type] : ~ v30860(X1,bitIndex4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addZeroExtensionConstraint_12) ).
tff(f40827,plain,
~ ! [X0: state_type] :
( reachableState(X0)
=> v4(X0) ),
inference(rectify,[],[f1211]) ).
tff(f40828,plain,
! [X0: state_type] :
( ~ v4(X0)
<=> v30850(X0) ),
inference(rectify,[],[f1212]) ).
tff(f40829,plain,
! [X0: state_type] :
( ~ v30850(X0)
<=> v30851(X0) ),
inference(rectify,[],[f1213]) ).
tff(f40830,plain,
! [X0: state_type] :
( v30851(X0)
<=> ( v30869(X0)
& v30853(X0) ) ),
inference(rectify,[],[f1214]) ).
tff(f40831,plain,
! [X0: state_type] :
( v30869(X0)
<=> ( v30855(X0,bitIndex1)
| v30855(X0,bitIndex0) ) ),
inference(rectify,[],[f1215]) ).
tff(f40832,plain,
! [X0: state_type] :
( ~ v30853(X0)
<=> v30854(X0) ),
inference(rectify,[],[f1216]) ).
tff(f40833,plain,
! [X0: state_type] :
( v30854(X0)
<=> ( v30855(X0,bitIndex1)
& v30855(X0,bitIndex0) ) ),
inference(rectify,[],[f1217]) ).
tff(f40834,plain,
! [X0: state_type] :
( v30855(X0,bitIndex0)
<=> v30856(X0) ),
inference(rectify,[],[f1218]) ).
tff(f40835,plain,
! [X0: state_type] :
( v30855(X0,bitIndex1)
<=> $true ),
inference(rectify,[],[f1219]) ).
tff(f40836,plain,
! [X0: state_type] : v30855(X0,bitIndex1),
inference(true_and_false_elimination,[],[f40835]) ).
tff(f40837,plain,
! [X0: state_type] :
( v30856(X0)
<=> ( v30860(X0,bitIndex5)
& v30858(X0) ) ),
inference(rectify,[],[f1220]) ).
tff(f40838,plain,
! [X0: state_type] :
( v30858(X0)
<=> ( v30860(X0,bitIndex4)
& v30859(X0) ) ),
inference(rectify,[],[f1221]) ).
tff(f40849,plain,
! [X0: state_type] : ~ v30860(X0,bitIndex4),
inference(rectify,[],[f1232]) ).
tff(f76376,plain,
! [X0: state_type] :
( ~ v4(X0)
=> v30850(X0) ),
inference(unused_predicate_definition_removal,[],[f40828]) ).
tff(f76377,plain,
! [X0: state_type] :
( v30851(X0)
=> ~ v30850(X0) ),
inference(unused_predicate_definition_removal,[],[f40829]) ).
tff(f76378,plain,
! [X0: state_type] :
( ( v30869(X0)
& v30853(X0) )
=> v30851(X0) ),
inference(unused_predicate_definition_removal,[],[f40830]) ).
tff(f76379,plain,
! [X0: state_type] :
( ( v30855(X0,bitIndex1)
| v30855(X0,bitIndex0) )
=> v30869(X0) ),
inference(unused_predicate_definition_removal,[],[f40831]) ).
tff(f76380,plain,
! [X0: state_type] :
( ~ v30853(X0)
=> v30854(X0) ),
inference(unused_predicate_definition_removal,[],[f40832]) ).
tff(f76381,plain,
! [X0: state_type] :
( v30854(X0)
=> ( v30855(X0,bitIndex1)
& v30855(X0,bitIndex0) ) ),
inference(unused_predicate_definition_removal,[],[f40833]) ).
tff(f77713,plain,
? [X0: state_type] :
( ~ v4(X0)
& reachableState(X0) ),
inference(ennf_transformation,[],[f40827]) ).
tff(f77714,plain,
! [X0: state_type] :
( v30850(X0)
| v4(X0) ),
inference(ennf_transformation,[],[f76376]) ).
tff(f77715,plain,
! [X0: state_type] :
( ~ v30850(X0)
| ~ v30851(X0) ),
inference(ennf_transformation,[],[f76377]) ).
tff(f77716,plain,
! [X0: state_type] :
( v30851(X0)
| ~ v30869(X0)
| ~ v30853(X0) ),
inference(ennf_transformation,[],[f76378]) ).
tff(f77717,plain,
! [X0: state_type] :
( v30851(X0)
| ~ v30869(X0)
| ~ v30853(X0) ),
inference(flattening,[],[f77716]) ).
tff(f77718,plain,
! [X0: state_type] :
( v30869(X0)
| ( ~ v30855(X0,bitIndex1)
& ~ v30855(X0,bitIndex0) ) ),
inference(ennf_transformation,[],[f76379]) ).
tff(f77719,plain,
! [X0: state_type] :
( v30854(X0)
| v30853(X0) ),
inference(ennf_transformation,[],[f76380]) ).
tff(f77720,plain,
! [X0: state_type] :
( ( v30855(X0,bitIndex1)
& v30855(X0,bitIndex0) )
| ~ v30854(X0) ),
inference(ennf_transformation,[],[f76381]) ).
tff(f96685,plain,
( ? [X0: state_type] :
( ~ v4(X0)
& reachableState(X0) )
=> ( ~ v4(sK7671)
& reachableState(sK7671) ) ),
introduced(choice_axiom,[]) ).
tff(f96686,plain,
( ~ v4(sK7671)
& reachableState(sK7671) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7671])],[f77713,f96685]) ).
tff(f96687,plain,
! [X0: state_type] :
( ( v30855(X0,bitIndex0)
| ~ v30856(X0) )
& ( v30856(X0)
| ~ v30855(X0,bitIndex0) ) ),
inference(nnf_transformation,[],[f40834]) ).
tff(f96688,plain,
! [X0: state_type] :
( ( v30856(X0)
| ~ v30860(X0,bitIndex5)
| ~ v30858(X0) )
& ( ( v30860(X0,bitIndex5)
& v30858(X0) )
| ~ v30856(X0) ) ),
inference(nnf_transformation,[],[f40837]) ).
tff(f96689,plain,
! [X0: state_type] :
( ( v30856(X0)
| ~ v30860(X0,bitIndex5)
| ~ v30858(X0) )
& ( ( v30860(X0,bitIndex5)
& v30858(X0) )
| ~ v30856(X0) ) ),
inference(flattening,[],[f96688]) ).
tff(f96690,plain,
! [X0: state_type] :
( ( v30858(X0)
| ~ v30860(X0,bitIndex4)
| ~ v30859(X0) )
& ( ( v30860(X0,bitIndex4)
& v30859(X0) )
| ~ v30858(X0) ) ),
inference(nnf_transformation,[],[f40838]) ).
tff(f96691,plain,
! [X0: state_type] :
( ( v30858(X0)
| ~ v30860(X0,bitIndex4)
| ~ v30859(X0) )
& ( ( v30860(X0,bitIndex4)
& v30859(X0) )
| ~ v30858(X0) ) ),
inference(flattening,[],[f96690]) ).
tff(f147359,plain,
~ v4(sK7671),
inference(cnf_transformation,[],[f96686]) ).
tff(f147360,plain,
! [X0: state_type] :
( v30850(X0)
| v4(X0) ),
inference(cnf_transformation,[],[f77714]) ).
tff(f147361,plain,
! [X0: state_type] :
( ~ v30850(X0)
| ~ v30851(X0) ),
inference(cnf_transformation,[],[f77715]) ).
tff(f147362,plain,
! [X0: state_type] :
( v30851(X0)
| ~ v30869(X0)
| ~ v30853(X0) ),
inference(cnf_transformation,[],[f77717]) ).
tff(f147364,plain,
! [X0: state_type] :
( v30869(X0)
| ~ v30855(X0,bitIndex1) ),
inference(cnf_transformation,[],[f77718]) ).
tff(f147365,plain,
! [X0: state_type] :
( v30854(X0)
| v30853(X0) ),
inference(cnf_transformation,[],[f77719]) ).
tff(f147366,plain,
! [X0: state_type] :
( v30855(X0,bitIndex0)
| ~ v30854(X0) ),
inference(cnf_transformation,[],[f77720]) ).
tff(f147368,plain,
! [X0: state_type] :
( v30856(X0)
| ~ v30855(X0,bitIndex0) ),
inference(cnf_transformation,[],[f96687]) ).
tff(f147370,plain,
! [X0: state_type] : v30855(X0,bitIndex1),
inference(cnf_transformation,[],[f40836]) ).
tff(f147371,plain,
! [X0: state_type] :
( v30858(X0)
| ~ v30856(X0) ),
inference(cnf_transformation,[],[f96689]) ).
tff(f147375,plain,
! [X0: state_type] :
( v30860(X0,bitIndex4)
| ~ v30858(X0) ),
inference(cnf_transformation,[],[f96691]) ).
tff(f147402,plain,
! [X0: state_type] : ~ v30860(X0,bitIndex4),
inference(cnf_transformation,[],[f40849]) ).
cnf(c_2629,negated_conjecture,
~ v4(sK7671),
inference(cnf_transformation,[],[f147359]) ).
cnf(c_2631,plain,
( v30850(X0_13)
| v4(X0_13) ),
inference(cnf_transformation,[],[f147360]) ).
cnf(c_2632,plain,
( ~ v30851(X0_13)
| ~ v30850(X0_13) ),
inference(cnf_transformation,[],[f147361]) ).
cnf(c_2633,plain,
( ~ v30853(X0_13)
| ~ v30869(X0_13)
| v30851(X0_13) ),
inference(cnf_transformation,[],[f147362]) ).
cnf(c_2634,plain,
( ~ v30855(X0_13,bitIndex1)
| v30869(X0_13) ),
inference(cnf_transformation,[],[f147364]) ).
cnf(c_2636,plain,
( v30854(X0_13)
| v30853(X0_13) ),
inference(cnf_transformation,[],[f147365]) ).
cnf(c_2638,plain,
( ~ v30854(X0_13)
| v30855(X0_13,bitIndex0) ),
inference(cnf_transformation,[],[f147366]) ).
cnf(c_2640,plain,
( ~ v30855(X0_13,bitIndex0)
| v30856(X0_13) ),
inference(cnf_transformation,[],[f147368]) ).
cnf(c_2641,plain,
v30855(X0_13,bitIndex1),
inference(cnf_transformation,[],[f147370]) ).
cnf(c_2644,plain,
( ~ v30856(X0_13)
| v30858(X0_13) ),
inference(cnf_transformation,[],[f147371]) ).
cnf(c_2646,plain,
( ~ v30858(X0_13)
| v30860(X0_13,bitIndex4) ),
inference(cnf_transformation,[],[f147375]) ).
cnf(c_2673,plain,
~ v30860(X0_13,bitIndex4),
inference(cnf_transformation,[],[f147402]) ).
cnf(c_225458,plain,
v4(X0_13),
inference(global_subsumption_just,[status(thm)],[c_2631,c_2641,c_2673,c_2636,c_2631,c_2644,c_2646,c_2640,c_2638,c_2634,c_2632,c_2633]) ).
cnf(c_627026,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_2629,c_225458]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : HWV090_1 : TPTP v8.1.2. Bugfixed v6.2.0.
% 0.12/0.15 % Command : run_iprover %s %d THM
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Aug 29 13:21:58 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 11.13/2.26 % SZS status Started for theBenchmark.p
% 11.13/2.26 ERROR - "ProverProcess:heur/409474:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 11.13/2.26 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 11.13/2.26 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 4 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --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 false --res_forward_subs subset_subsumption --res_forward_subs_resolution true --res_lit_sel pos_max --res_lit_sel_side num_var --res_ordering kbo_pred --res_passive_queue_type priority_queues --res_passive_queues "[[-num_lits];[-conj_symb;-num_symb;+num_symb]]" --res_passive_queues_freq "[15;3]" --res_prop_simpl_given false --res_prop_simpl_new true --res_sim_input true --res_time_limit 202.80 --res_to_prop_solver passive --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]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 1.00 --show_fool true" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/1z3f75rl 2>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/1z3f75rl_error
% 11.13/2.26 ERROR - "ProverProcess:heur/469571:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 11.13/2.26 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 11.13/2.26 ERROR - cmd was: ulimit -v 4096000; ./res/iproveropt_static_z3 --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 6 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3.0 --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 32 --inst_dismatching false --inst_eager_unprocessed_to_passive false --inst_eq_res_simp false --inst_learning_factor 10 --inst_learning_loop_flag true --inst_learning_start 256 --inst_lit_activity_flag true --inst_lit_sel "[+sign;-ground;-non_prol_conj_symb;-num_var]" --inst_lit_sel_side num_lit --inst_orphan_elimination true --inst_passive_queue_type list --inst_passive_queues "[[-ground;-epr]]" --inst_passive_queues_freq "[2]" --inst_prop_sim_given false --inst_prop_sim_new false --inst_restr_to_given true --inst_sel_renew solver --inst_solver_calls_frac 0.6939020527068606 --inst_solver_per_active 8 --inst_sos_flag false --inst_start_prop_sim_after_learn 9 --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 2048 --prop_solver_per_cl 128 --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]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[DemodLightNormLoopTriv;ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 640 --sup_share_score_frac 0.1 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 1.00 --show_fool true" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/5qlfcpuh 2>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/5qlfcpuh_error
% 11.13/2.26 ERROR - "ProverProcess:heur/381325:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 11.13/2.26 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 11.13/2.26 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 1 --comb_sup_mult 3 --conj_cone_tolerance 3. --demod_completeness_check full --demod_use_ground true --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 "[Demod;DemodLoopTriv;LightNorm;ACNormalisation]" --sup_full_triv "[]" --sup_fun_splitting true --sup_immed_bw_immed "[]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes]" --sup_immed_fw_immed "[Subsumption;UnitSubsAndRes;Demod;DemodLoopTriv;LightNorm;DemodLightNormLoopTriv]" --sup_immed_fw_main "[Subsumption;SubsumptionRes;LightNorm;DemodLightNormLoopTriv]" --sup_immed_triv "[PropSubs]" --sup_indices_passive "[UnitSubsumption;NonunitSubsumption;FwDemod]" --sup_input_bw "[UnitSubsAndRes]" --sup_input_fw "[]" --sup_input_triv "[PropSubs]" --sup_iter_deepening 0 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_symb;-max_atom_input_occur];[+horn];[+bc_imp_inh;+ground;-conj_dist]]" --sup_passive_queues_freq "[3;1;25]" --sup_prop_simpl_given true --sup_prop_simpl_new false --sup_restarts_mult 8 --sup_score sim_d_gen --sup_share_max_num_cl 40 --sup_share_score_frac 0.1 --sup_smt_interval 10000 --sup_symb_ordering arity_random --sup_to_prop_solver active --superposition_flag true --time_out_prep_mult 0.1 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 1.00 --show_fool true" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/wezpjh4d 2>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/wezpjh4d_error
% 11.13/2.26 ERROR - "ProverProcess:heur/346297:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 11.13/2.26 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 11.13/2.26 ERROR - cmd was: ulimit -v 4096000; ./res/iproveropt_static_z3 --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode time_based --comb_sup_deep_mult 6 --comb_sup_mult 32 --conj_cone_tolerance 2.7380125131254 --demod_completeness_check full --demod_use_ground true --eq_ax_congr_red false --extra_neg_conj none --inst_activity_threshold 16 --inst_dismatching false --inst_eager_unprocessed_to_passive false --inst_eq_res_simp true --inst_learning_factor 6 --inst_learning_loop_flag true --inst_learning_start 1024 --inst_lit_activity_flag true --inst_lit_sel "[+depth;+sign;+num_symb;-split;-eq]" --inst_lit_sel_side cnt --inst_orphan_elimination true --inst_passive_queue_type list --inst_passive_queues "[[-num_lits];[-max_atom_input_occur;-ground]]" --inst_passive_queues_freq "[8;50]" --inst_prop_sim_given false --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 0.21724605765256222 --inst_solver_per_active 256 --inst_sos_flag true --inst_sos_phase true --inst_sos_sth_lit_sel "[-depth;+non_prol_conj_symb;-split;-ground;+num_var]" --inst_start_prop_sim_after_learn 8 --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 false --prep_def_merge_prop_impl true --prep_def_merge_tr_cl true --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim false --prep_sem_filter none --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten false --prep_upred true --preprocessing_flag true --prolific_symb_bound 2048 --prop_solver_per_cl 32 --pure_diseq_elim false --resolution_flag false --schedule none --share_sel_clauses false --smt_ac_axioms full --smt_preprocessing true --splitting_cvd true --splitting_cvd_svl false --splitting_grd true --splitting_mode full --splitting_nvd 128 --stats_out none --sub_typing true --subs_bck_mult 0 --sup_full_bw "[Demod]" --sup_full_fw "[Subsumption;SubsumptionRes;UnitSubsAndRes;DemodLoopTriv;DemodLightNormLoopTriv;ACJoinability;ACNormalisation]" --sup_full_triv "[PropSubs;Unflattening]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes;Demod;ACJoinability]" --sup_immed_fw_main "[SubsumptionRes;DemodLoopTriv;DemodLightNormLoopTriv;ACJoinability;ACNormalisation]" --sup_immed_triv "[]" --sup_indices_passive "[UnitSubsumption;NonunitSubsumption;Subsumption;FwDemod;BwDemod;LightNorm]" --sup_input_bw "[]" --sup_input_fw "[]" --sup_input_triv "[PropSubs;Unflattening]" --sup_iter_deepening 4 --sup_passive_queue_type queue --sup_passive_queues "[[+num_symb]]" --sup_passive_queues_freq "[5]" --sup_prop_simpl_given true --sup_prop_simpl_new false --sup_restarts_mult 4 --sup_smt_interval 10000 --sup_symb_ordering arity_random --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.4432297345384799 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 1.00 --show_fool true" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/nnisgq6m 2>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/nnisgq6m_error
% 21.46/3.77 ERROR - "ProverProcess:heur/397442:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 21.46/3.77 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 21.46/3.77 ERROR - cmd was: ulimit -v 4096000; ./res/iproveropt_static_z3 --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 64 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 4 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp true --inst_learning_factor 8 --inst_learning_loop_flag true --inst_learning_start 2 --inst_lit_activity_flag false --inst_lit_sel "[-split]" --inst_lit_sel_side num_lit --inst_orphan_elimination false --inst_passive_queue_type priority_queues --inst_passive_queues "[[+conj_symb]]" --inst_passive_queues_freq "[50]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 0.8199321230744955 --inst_solver_per_active 4 --inst_sos_flag false --inst_start_prop_sim_after_learn 7 --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]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 1.00 --show_fool true" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/r8i2or0u 2>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/r8i2or0u_error
% 21.46/3.77 ERROR - "ProverProcess:heur/421498:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 21.46/3.77 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 21.46/3.77 ERROR - cmd was: ulimit -v 4096000; ./res/iproveropt_static_z3 --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 8 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 512 --inst_dismatching true --inst_eager_unprocessed_to_passive false --inst_eq_res_simp true --inst_learning_factor 8 --inst_learning_loop_flag true --inst_learning_start 128 --inst_lit_activity_flag false --inst_lit_sel "[+sign;+prop]" --inst_lit_sel_side none --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[+num_symb;-age;-age];[+num_symb;+conj_non_prolific_symb]]" --inst_passive_queues_freq "[512;10]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew model --inst_solver_calls_frac 0.006221608720445637 --inst_solver_per_active 32768 --inst_sos_flag true --inst_sos_phase false --inst_sos_sth_lit_sel "[+non_prol_conj_symb;+sign;-depth;-prop]" --inst_start_prop_sim_after_learn 9 --inst_subs_given true --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]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 1.00 --show_fool true" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/66vfuo_w 2>> /export/starexec/sandbox/tmp/iprover_out_mao7za7g/66vfuo_w_error
% 288.60/41.55 % SZS status Theorem for theBenchmark.p
% 288.60/41.55
% 288.60/41.55 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 288.60/41.55
% 288.60/41.55 ------ iProver source info
% 288.60/41.55
% 288.60/41.55 git: date: 2023-05-31 18:12:56 +0000
% 288.60/41.55 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 288.60/41.55 git: non_committed_changes: false
% 288.60/41.55 git: last_make_outside_of_git: false
% 288.60/41.55
% 288.60/41.55 ------ Parsing...
% 288.60/41.55 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 288.60/41.55
% 288.60/41.55
% 288.60/41.55 ------ Preprocessing...
% 288.60/41.55
% 288.60/41.55 % SZS status Theorem for theBenchmark.p
% 288.60/41.55
% 288.60/41.55 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 288.60/41.55
% 288.60/41.55
%------------------------------------------------------------------------------