%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR066+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:10:24 PM UTC 2026
% Result : Theorem 5.67s 1.72s
% Output : CNFRefutation 5.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 13 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 74 ( 36 ~; 28 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 43 ( 0 sgn 41 !; 2 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f195,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_195) ).
fof(f381,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_381) ).
fof(f3627,axiom,
! [X0] :
( shavingrazor_manual(X0)
=> tptp_8_271(f_relationexistsallfn(X0,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3627) ).
fof(f3919,axiom,
! [X0,X1,X2,X3] :
( ( relationexistsall(X2,X3,X1)
& isa(X0,X1) )
=> isa(f_relationexistsallfn(X0,X2,X3,X1),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3919) ).
fof(f4478,axiom,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_4478) ).
fof(f5089,axiom,
! [X0] :
( isa(X0,c_tptpcol_16_25972)
=> tptpcol_16_25972(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_5089) ).
fof(f7743,axiom,
! [X0] :
( shavingrazor_manual(X0)
=> isa(X0,c_shavingrazor_manual) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7743) ).
fof(f8006,conjecture,
? [X0] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptpcol_16_25972(X0)
& tptp_8_271(X0,c_theprototypicalshavingrazor_manual) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query166) ).
fof(f8007,negated_conjecture,
~ ? [X0] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptpcol_16_25972(X0)
& tptp_8_271(X0,c_theprototypicalshavingrazor_manual) ) ),
inference(negated_conjecture,[status(cth)],[f8006]) ).
fof(f8041,plain,
! [X0] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
& ( ~ tptpcol_16_25972(X0)
| ~ tptp_8_271(X0,c_theprototypicalshavingrazor_manual) ) ),
inference(ennf_transformation,[],[f8007]) ).
fof(f8045,plain,
! [X0] :
( ~ isa(X0,c_tptpcol_16_25972)
| tptpcol_16_25972(X0) ),
inference(ennf_transformation,[],[f5089]) ).
fof(f8048,plain,
! [X0] :
( ~ shavingrazor_manual(X0)
| isa(X0,c_shavingrazor_manual) ),
inference(ennf_transformation,[],[f7743]) ).
fof(f8051,plain,
! [X0] :
( ~ shavingrazor_manual(X0)
| tptp_8_271(f_relationexistsallfn(X0,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X0) ),
inference(ennf_transformation,[],[f3627]) ).
fof(f8054,plain,
! [X0,X1,X2,X3] :
( ~ relationexistsall(X2,X3,X1)
| ~ isa(X0,X1)
| isa(f_relationexistsallfn(X0,X2,X3,X1),X3) ),
inference(ennf_transformation,[],[f3919]) ).
fof(f8055,plain,
! [X0,X1,X2,X3] :
( ~ relationexistsall(X2,X3,X1)
| ~ isa(X0,X1)
| isa(f_relationexistsallfn(X0,X2,X3,X1),X3) ),
inference(flattening,[],[f8054]) ).
fof(f8078,plain,
! [X0] :
( ~ tptpcol_16_25972(X0)
| ~ tptp_8_271(X0,c_theprototypicalshavingrazor_manual) ),
inference(cnf_transformation,[],[f8041]) ).
fof(f8080,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(cnf_transformation,[],[f381]) ).
fof(f8081,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(cnf_transformation,[],[f195]) ).
fof(f8087,plain,
! [X0] :
( ~ isa(X0,c_tptpcol_16_25972)
| tptpcol_16_25972(X0) ),
inference(cnf_transformation,[],[f8045]) ).
fof(f8089,plain,
! [X0] :
( ~ shavingrazor_manual(X0)
| isa(X0,c_shavingrazor_manual) ),
inference(cnf_transformation,[],[f8048]) ).
fof(f8095,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
inference(cnf_transformation,[],[f4478]) ).
fof(f8098,plain,
! [X0] :
( ~ shavingrazor_manual(X0)
| tptp_8_271(f_relationexistsallfn(X0,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X0) ),
inference(cnf_transformation,[],[f8051]) ).
fof(f8101,plain,
! [X2,X3,X0,X1] :
( ~ relationexistsall(X2,X3,X1)
| ~ isa(X0,X1)
| isa(f_relationexistsallfn(X0,X2,X3,X1),X3) ),
inference(cnf_transformation,[],[f8055]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( ~ tptpcol_16_25972(X0)
| ~ tptp_8_271(X0,c_theprototypicalshavingrazor_manual) ),
inference(cnf_transformation,[],[f8078]) ).
tcf(c_52,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(cnf_transformation,[],[f8080]) ).
tcf(c_53,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(cnf_transformation,[],[f8081]) ).
tcf(c_59,plain,
! [X0: $i] :
( tptpcol_16_25972(X0)
| ~ isa(X0,c_tptpcol_16_25972) ),
inference(cnf_transformation,[],[f8087]) ).
tcf(c_61,plain,
! [X0: $i] :
( isa(X0,c_shavingrazor_manual)
| ~ shavingrazor_manual(X0) ),
inference(cnf_transformation,[],[f8089]) ).
tcf(c_67,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
inference(cnf_transformation,[],[f8095]) ).
tcf(c_70,plain,
! [X0: $i] :
( tptp_8_271(f_relationexistsallfn(X0,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X0)
| ~ shavingrazor_manual(X0) ),
inference(cnf_transformation,[],[f8098]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( isa(f_relationexistsallfn(X3,X0,X1,X2),X1)
| ~ isa(X3,X2)
| ~ relationexistsall(X0,X1,X2) ),
inference(cnf_transformation,[],[f8101]) ).
tcf(c_111,plain,
! [X0: $i] :
( ~ isa(X0,c_tptpcol_16_25972)
| tptpcol_16_25972(X0) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
tcf(c_112,plain,
! [X0: $i] :
( tptpcol_16_25972(X0)
| ~ isa(X0,c_tptpcol_16_25972) ),
inference(renaming,[status(thm)],[c_111]) ).
tcf(c_117,plain,
! [X0: $i] :
( isa(X0,c_shavingrazor_manual)
| ~ shavingrazor_manual(X0) ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
tcf(c_119,plain,
! [X0: $i] :
( ~ tptpcol_16_25972(X0)
| ~ tptp_8_271(X0,c_theprototypicalshavingrazor_manual) ),
inference(prop_impl_just,[status(thm)],[c_49]) ).
tcf(c_123,plain,
! [X0: $i] :
( tptp_8_271(f_relationexistsallfn(X0,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X0)
| ~ shavingrazor_manual(X0) ),
inference(prop_impl_just,[status(thm)],[c_70]) ).
tcf(c_308,plain,
( ~ shavingrazor_manual(c_theprototypicalshavingrazor_manual)
| ~ tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)) ),
inference(resolution,[status(thm)],[c_119,c_123]) ).
tcf(c_309,plain,
~ tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)),
inference(global_subsumption_just,[status(thm)],[c_308,c_53,c_308]) ).
tcf(c_316,plain,
~ isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972),
inference(resolution,[status(thm)],[c_112,c_309]) ).
tcf(c_322,plain,
isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
inference(resolution,[status(thm)],[c_52,c_117]) ).
tcf(c_327,plain,
! [X0: $i] :
( isa(f_relationexistsallfn(X0,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972)
| ~ isa(X0,c_shavingrazor_manual) ),
inference(resolution,[status(thm)],[c_67,c_73]) ).
tcf(c_527,plain,
( isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972)
| ~ isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual) ),
inference(instantiation,[status(thm)],[c_327]) ).
tcf(c_528,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_527,c_322,c_316]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR066+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n014.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 08:51:03 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.41 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 5.67/1.72 % SZS status Started for theBenchmark.p
% 5.67/1.72 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")
% 5.67/1.72 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 5.67/1.72 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --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 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_rxaq9l8n/6bdf1oo7 2>> /export/starexec/sandbox2/tmp/iprover_out_rxaq9l8n/6bdf1oo7_error
% 5.67/1.72 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")
% 5.67/1.72 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 5.67/1.72 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --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 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_rxaq9l8n/xz1lwap4 2>> /export/starexec/sandbox2/tmp/iprover_out_rxaq9l8n/xz1lwap4_error
% 5.67/1.72 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")
% 5.67/1.72 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 5.67/1.72 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --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 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_rxaq9l8n/xjtmnbp9 2>> /export/starexec/sandbox2/tmp/iprover_out_rxaq9l8n/xjtmnbp9_error
% 5.67/1.72 % SZS status Theorem for theBenchmark.p
% 5.67/1.72
% 5.67/1.72 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 5.67/1.72
% 5.67/1.72 % ------ iProver source info
% 5.67/1.72
% 5.67/1.72 % git: date: 2026-07-19 20:42:38 +0200
% 5.67/1.72 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 5.67/1.72 % git: non_committed_changes: false
% 5.67/1.72
% 5.67/1.72 % ------ Parsing...
% 5.67/1.72 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 5.67/1.72
% 5.67/1.72 % ------ Preprocessing... sf_s rm: 10 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 5.67/1.72
% 5.67/1.72 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 5.67/1.72 % ------ Proving...
% 5.67/1.72 % ------ Problem Properties
% 5.67/1.72
% 5.67/1.72 %
% 5.67/1.72 % clauses 16
% 5.67/1.72 % conjectures 0
% 5.67/1.72 % EPR 9
% 5.67/1.72 % Horn 16
% 5.67/1.72 % unary 9
% 5.67/1.72 % binary 5
% 5.67/1.72 % lits 25
% 5.67/1.72 % lits eq 0
% 5.67/1.72 % fd_pure 0
% 5.67/1.72 % fd_pseudo 0
% 5.67/1.72 % fd_cond 0
% 5.67/1.72 % fd_pseudo_cond 0
% 5.67/1.72 % AC symbols 0
% 5.67/1.72
% 5.67/1.72 % ------ Schedule dynamic 5 is on
% 5.67/1.72
% 5.67/1.72 % ------ no conjectures: strip conj schedule
% 5.67/1.72
% 5.67/1.72 % ------ no equalities: superposition off
% 5.67/1.72
% 5.67/1.72 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 5.67/1.72
% 5.67/1.72
% 5.67/1.72 % ------
% 5.67/1.72 % Current options:
% 5.67/1.72 % ------
% 5.67/1.72
% 5.67/1.72
% 5.67/1.72 %
% 5.67/1.72
% 5.67/1.72 % ------ Proving...
% 5.67/1.72 %
% 5.67/1.72
% 5.67/1.72 % SZS status Theorem for theBenchmark.p
% 5.67/1.72
% 5.67/1.72 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 5.67/1.72
% 5.67/1.72
%------------------------------------------------------------------------------