%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : DAT079_1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n004.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:13:58 PM UTC 2026
% Result : Theorem 1.35s 1.17s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f31ERROR: Could not build tree for root c_151ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
nil: list ).
tff(pred_def_1,type,
in: ( list * $int ) > $o ).
tff(pred_def_2,type,
inRange: ( list * $int ) > $o ).
tff(func_def_3,type,
tail: list > list ).
tff(func_def_5,type,
length: list > $int ).
tff(func_def_8,type,
count: ( list * $int ) > $int ).
tff(func_def_9,type,
append: ( list * list ) > list ).
tff(func_def_13,type,
sK0: ( list * $int ) > $int ).
tff(func_def_14,type,
sK1: ( list * $int ) > list ).
tff(func_def_15,type,
sK2: ( list * $int ) > $int ).
tff(func_def_16,type,
sK3: ( list * $int ) > list ).
tff(func_def_17,type,
sK4: ( list * $int ) > $int ).
tff(func_def_18,type,
sK5: ( list * $int ) > list ).
tff(f15,conjecture,
in(2,cons(1,cons(2,cons(3,nil)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f16,negated_conjecture,
~ in(2,cons(1,cons(2,cons(3,nil)))),
inference(negated_conjecture,[status(cth)],[f15]) ).
tff(f34,plain,
~ in(2,cons(1,cons(2,cons(3,nil)))),
inference(flattening,[],[f16]) ).
tff(f37,plain,
! [X0: $int,X1: list] :
( ( ~ in(X0,X1)
| ? [X4: $int,X5: list] :
( in(X0,X5)
& ( cons(X4,X5) = X1 ) )
| ? [X2: $int,X3: list] :
( ( X0 = X2 )
& ( X1 = cons(X2,X3) ) ) )
& ( ( ! [X4: $int,X5: list] :
( ~ in(X0,X5)
| ( cons(X4,X5) != X1 ) )
& ! [X2: $int,X3: list] :
( ( X0 != X2 )
| ( cons(X2,X3) != X1 ) ) )
| in(X0,X1) ) ),
inference(nnf_transformation,[],[f31]) ).
tff(f38,plain,
! [X0: $int,X1: list] :
( ( ~ in(X0,X1)
| ? [X4: $int,X5: list] :
( in(X0,X5)
& ( cons(X4,X5) = X1 ) )
| ? [X2: $int,X3: list] :
( ( X0 = X2 )
& ( X1 = cons(X2,X3) ) ) )
& ( ( ! [X4: $int,X5: list] :
( ~ in(X0,X5)
| ( cons(X4,X5) != X1 ) )
& ! [X2: $int,X3: list] :
( ( X0 != X2 )
| ( cons(X2,X3) != X1 ) ) )
| in(X0,X1) ) ),
inference(flattening,[],[f37]) ).
tff(f39,plain,
! [X0: $int,X1: list] :
( ( ~ in(X0,X1)
| ? [X8: $int,X9: list] :
( in(X0,X9)
& ( cons(X8,X9) = X1 ) )
| ? [X6: $int,X7: list] :
( ( X0 = X6 )
& ( cons(X6,X7) = X1 ) ) )
& ( ( ! [X4: $int,X5: list] :
( ~ in(X0,X5)
| ( cons(X4,X5) != X1 ) )
& ! [X2: $int,X3: list] :
( ( X0 != X2 )
| ( cons(X2,X3) != X1 ) ) )
| in(X0,X1) ) ),
inference(rectify,[],[f38]) ).
tff(f40,plain,
! [X0: $int,X1: list] :
( ( ~ in(X0,X1)
| ( in(X0,sK3(X0,X1))
& ( cons(sK2(X0,X1),sK3(X0,X1)) = X1 ) )
| ( ( sK0(X0,X1) = X0 )
& ( cons(sK0(X0,X1),sK1(X0,X1)) = X1 ) ) )
& ( ( ! [X4: $int,X5: list] :
( ~ in(X0,X5)
| ( cons(X4,X5) != X1 ) )
& ! [X2: $int,X3: list] :
( ( X0 != X2 )
| ( cons(X2,X3) != X1 ) ) )
| in(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X6,sK0(X0,X1)),skolemize(X7,sK1(X0,X1)),skolemize(X8,sK2(X0,X1)),skolemize(X9,sK3(X0,X1))],[f39]) ).
tff(f54,plain,
! [X0: $int,X1: list,X4: $int,X5: list] :
( ~ in(X0,X5)
| ( cons(X4,X5) != X1 )
| in(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
tff(f55,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( ( X0 != X2 )
| ( cons(X2,X3) != X1 )
| in(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
tff(f71,plain,
~ in(2,cons(1,cons(2,cons(3,nil)))),
inference(cnf_transformation,[],[f34]) ).
tff(f72,plain,
! [X2: $int,X3: list,X0: $int] :
( ( X0 != X2 )
| in(X0,cons(X2,X3)) ),
inference(equality_resolution,[],[f55]) ).
tff(f73,plain,
! [X2: $int,X3: list] : in(X2,cons(X2,X3)),
inference(equality_resolution,[],[f72]) ).
tff(f74,plain,
! [X0: $int,X4: $int,X5: list] :
( ~ in(X0,X5)
| in(X0,cons(X4,X5)) ),
inference(equality_resolution,[],[f54]) ).
tcf(c_65,plain,
! [X0_int: $int,X0_list: list] : in(X0_int,cons(X0_int,X0_list)),
inference(cnf_transformation,[],[f73]) ).
tcf(c_66,plain,
! [X0_int: $int,X0_list: list,X1_int: $int] :
( in(X0_int,cons(X1_int,X0_list))
| ~ in(X0_int,X0_list) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_86,negated_conjecture,
~ in(2,cons(1,cons(2,cons(3,nil)))),
inference(cnf_transformation,[],[f71]) ).
tcf(c_146,plain,
( in(2,cons(1,cons(2,cons(3,nil))))
| ~ in(2,cons(2,cons(3,nil))) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_150,plain,
in(2,cons(2,cons(3,nil))),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_151,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_150,c_146,c_86]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT079_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 10:23:20 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running TFA theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.35/1.17 % SZS status Started for theBenchmark.p
% 1.35/1.17 ERROR - "ProverProcess:heur/schedule_none:304.9999794960022" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.35/1.17 Fatal error: exception Failure("undefined enum value")
% 1.35/1.17 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --schedule none --sub_typing false --suppress_sat_res true --tptp_safe_out true --stats_out none --out_options none --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 101.67 --show_fool true" --time_out_real 305.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_g5su2z9g/mq_pz7b9 2>> /export/starexec/sandbox2/tmp/iprover_out_g5su2z9g/mq_pz7b9_error
% 1.35/1.17 ERROR - "ProverProcess:heur/vip_65520:11.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.35/1.17 Fatal error: exception Failure("undefined enum value")
% 1.35/1.17 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_mode time_based --comb_res_mult 6 --comb_sup_deep_mult 0 --comb_sup_mult 6 --conj_cone_tolerance 1.8969679945890683 --demod_completeness_check fullold --demod_use_ground false --extra_neg_conj all_neg --instantiation_flag false --out_options none --preprocessed_out false --preprocessing_flag false --prolific_symb_bound 1024 --proof_out true --prop_solver_per_cl 512 --res_to_smt_solver false --resolution_flag true --schedule none --share_sel_clauses true --stats_out none --subs_bck_mult 16 --sup_bw_gjoin_interval 100 --sup_cache_sim none --sup_full_bw "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_full_fixpoint false --sup_full_fw "[]" --sup_fun_splitting false --sup_immed_bw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes;FullSubsAndRes;Demod;ACDemod]" --sup_immed_fixpoint false --sup_immed_fw_immed "[Subsumption;SubsumptionRes;FullSubsAndRes;Demod;LightNorm;ACDemod]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;FullSubsAndRes;Demod;LightNorm;ACNormalisation;GroundJoinability;Connectedness]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_fixpoint false --sup_main_fixpoint true --sup_ordering lpo --sup_passive_queue_type priority_queues --sup_passive_queues "[[+has_eq;-has_eq];[-num_var;-num_var];[+conj_dist;+ground;-max_atom_input_occur]]" --sup_passive_queues_freq "[1;4;4]" --sup_prop_simpl_given false --sup_prop_simpl_new false --sup_score sim_d_gen --sup_share_max_num_cl 10 --sup_share_score_frac 0.2 --sup_smt_interval 32 --sup_symb_ordering invfreq_arity --sup_term_weight default --sup_to_prop_solver passive --sup_unprocessed_bound 10 --superposition_flag true --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 3.67 --show_fool true" --time_out_real 11.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_g5su2z9g/t93e8fy6 2>> /export/starexec/sandbox2/tmp/iprover_out_g5su2z9g/t93e8fy6_error
% 1.35/1.17 ERROR - "ProverProcess:heur/vip_65097:3.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.35/1.17 Fatal error: exception Failure("undefined enum value")
% 1.35/1.17 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 3 --comb_sup_deep_mult 0 --comb_sup_mult 0 --conj_cone_tolerance 4.0357851670394345 --extra_neg_conj none --inst_activity_threshold 512 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp true --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 2048 --inst_lit_activity_flag true --inst_lit_sel "[+split;-sign;-depth]" --inst_lit_sel_side none --inst_orphan_elimination true --inst_passive_queue_type queue --inst_passive_queues "[[+age;+num_lits;-age];[-age;-min_def_symb;+bc_imp_inh]]" --inst_passive_queues_freq "[2;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given true --inst_sel_renew solver --inst_solver_calls_frac 1.0 --inst_solver_per_active 1024 --inst_sos_flag true --inst_sos_phase false --inst_sos_sth_lit_sel "[+split;-ground;-depth]" --inst_start_prop_sim_after_learn 3 --inst_subs_given true --inst_subs_new false --instantiation_flag true --out_options none --prep_sup_sim_all true --prep_sup_sim_sup false --preprocessed_out false --preprocessing_flag true --prolific_symb_bound 256 --proof_out true --prop_solver_per_cl 16384 --resolution_flag true --schedule none --share_sel_clauses false --stats_out none --subs_bck_mult 8 --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 1.00 --show_fool true" --time_out_real 3.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_g5su2z9g/1t0c4091 2>> /export/starexec/sandbox2/tmp/iprover_out_g5su2z9g/1t0c4091_error
% 1.35/1.17 ERROR - "ProverProcess:heur/vip_65080:40.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.35/1.17 Fatal error: exception Failure("undefined enum value")
% 1.35/1.17 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_mode time_based --comb_res_mult 6 --comb_sup_deep_mult 4 --comb_sup_mult 6 --conj_cone_tolerance 1.895766803319499 --demod_completeness_check fullold --demod_use_ground false --extra_neg_conj all_pos_neg --instantiation_flag false --out_options none --preprocessed_out false --preprocessing_flag false --prolific_symb_bound 1024 --proof_out true --prop_solver_per_cl 128 --res_to_smt_solver false --resolution_flag true --schedule none --share_sel_clauses true --stats_out none --subs_bck_mult 16 --sup_bw_gjoin_interval 100 --sup_cache_sim none --sup_full_bw "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_full_fixpoint false --sup_full_fw "[]" --sup_fun_splitting false --sup_immed_bw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes;FullSubsAndRes;Demod;ACDemod]" --sup_immed_fixpoint false --sup_immed_fw_immed "[Subsumption;SubsumptionRes;FullSubsAndRes;Demod;LightNorm;ACDemod]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;FullSubsAndRes;Demod;LightNorm;ACNormalisation;GroundJoinability;Connectedness]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_fixpoint false --sup_iter_deepening 2 --sup_main_fixpoint true --sup_ordering lpo --sup_passive_queue_type priority_queues --sup_passive_queues "[[+has_eq;-has_eq];[-num_var;-num_var];[+conj_dist;+ground;-max_atom_input_occur]]" --sup_passive_queues_freq "[1;4;4]" --sup_prop_simpl_given false --sup_prop_simpl_new false --sup_restarts_mult 4 --sup_score sim_d_gen --sup_share_max_num_cl 10 --sup_share_score_frac 0.2 --sup_smt_interval 32 --sup_symb_ordering invfreq_arity --sup_term_weight default --sup_to_prop_solver passive --sup_unprocessed_bound 10 --superposition_flag true --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 13.33 --show_fool true" --time_out_real 40.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_g5su2z9g/a53pj8u_ 2>> /export/starexec/sandbox2/tmp/iprover_out_g5su2z9g/a53pj8u__error
% 1.35/1.17 % SZS status Theorem for theBenchmark.p
% 1.35/1.17
% 1.35/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.35/1.17
% 1.35/1.17 % ------ iProver source info
% 1.35/1.17
% 1.35/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 1.35/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.35/1.17 % git: non_committed_changes: false
% 1.35/1.17
% 1.35/1.17 % ------ Parsing...
% 1.35/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.35/1.17 % ------ Proving...
% 1.35/1.17 % ------ Problem Properties
% 1.35/1.17
% 1.35/1.17 %
% 1.35/1.17 % clauses 41
% 1.35/1.17 % conjectures 1
% 1.35/1.17 % EPR 7
% 1.35/1.17 % Horn 29
% 1.35/1.17 % unary 22
% 1.35/1.17 % binary 8
% 1.35/1.17 % lits 72
% 1.35/1.17 % lits eq 31
% 1.35/1.17 % fd_pure 0
% 1.35/1.17 % fd_pseudo 0
% 1.35/1.17 % fd_cond 3
% 1.35/1.17 % fd_pseudo_cond 2
% 1.35/1.17 % AC symbols 1
% 1.35/1.17
% 1.35/1.17 % ------ Input Options Time Limit: Unbounded
% 1.35/1.17
% 1.35/1.17
% 1.35/1.17 % ------
% 1.35/1.17 % Current options:
% 1.35/1.17 % ------
% 1.35/1.17
% 1.35/1.17
% 1.35/1.17 %
% 1.35/1.17
% 1.35/1.17 % ------ Proving...
% 1.35/1.17 %
% 1.35/1.17
% 1.35/1.17 % SZS status Theorem for theBenchmark.p
% 1.35/1.17
% 1.35/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.35/1.17
% 1.35/1.17
%------------------------------------------------------------------------------