%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWX074_1 : TPTP v9.3.1. Released v9.1.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 03:32:38 PM UTC 2026
% Result : Theorem 1.69s 1.60s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f34ERROR: Could not build tree for root c_1271ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
f__integer__: $int > general ).
tff(pred_def_1,type,
p__is_integer__: general > $o ).
tff(pred_def_2,type,
p__is_symbolic__: general > $o ).
tff(pred_def_3,type,
p__less_equal__: ( general * general ) > $o ).
tff(pred_def_4,type,
p__less__: ( general * general ) > $o ).
tff(pred_def_5,type,
p__greater_equal__: ( general * general ) > $o ).
tff(pred_def_6,type,
p__greater__: ( general * general ) > $o ).
tff(pred_def_8,type,
hq: general > $o ).
tff(pred_def_9,type,
tq: general > $o ).
tff(pred_def_10,type,
hp: general > $o ).
tff(pred_def_11,type,
tp: general > $o ).
tff(func_def_12,type,
sK5: general ).
tff(pred_def_13,type,
sP0: ( general * general ) > $o ).
tff(f19,conjecture,
! [X0: general,X1: general] :
( ( ( tq(X0)
& ? [X2: general] :
( tp(X2)
& ( X2 = X1 ) )
& ( X0 = X1 ) )
=> tq(X0) )
& ( ( tq(X0)
& ? [X2: general] :
( hp(X2)
& ( X2 = X1 ) )
& ( X0 = X1 ) )
=> hq(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_3_left_0) ).
tff(f20,negated_conjecture,
~ ! [X0: general,X1: general] :
( ( ( tq(X0)
& ? [X2: general] :
( tp(X2)
& ( X2 = X1 ) )
& ( X0 = X1 ) )
=> tq(X0) )
& ( ( tq(X0)
& ? [X2: general] :
( hp(X2)
& ( X2 = X1 ) )
& ( X0 = X1 ) )
=> hq(X0) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
tff(f35,plain,
~ ! [X0: general,X1: general] :
( ( ( tq(X0)
& ? [X3: general] :
( tp(X3)
& ( X1 = X3 ) )
& ( X0 = X1 ) )
=> tq(X0) )
& ( ( tq(X0)
& ? [X2: general] :
( hp(X2)
& ( X2 = X1 ) )
& ( X0 = X1 ) )
=> hq(X0) ) ),
inference(rectify,[],[f20]) ).
tff(f48,plain,
! [X0: general,X1: general] :
( ( ! [X5: general] :
( ~ tq(X5)
| ( X1 != X5 ) )
| ! [X4: general] :
( ~ tp(X4)
| ( X1 != X4 ) )
| ( X0 != X1 )
| tq(X0) )
& ( ! [X3: general] :
( ~ tq(X3)
| ( X1 != X3 ) )
| ! [X2: general] :
( ~ hp(X2)
| ( X1 != X2 ) )
| ( X0 != X1 )
| hq(X0) ) ),
inference(ennf_transformation,[],[f34]) ).
tff(f49,plain,
! [X0: general,X1: general] :
( ( ! [X5: general] :
( ~ tq(X5)
| ( X1 != X5 ) )
| ! [X4: general] :
( ~ tp(X4)
| ( X1 != X4 ) )
| ( X0 != X1 )
| tq(X0) )
& ( ! [X3: general] :
( ~ tq(X3)
| ( X1 != X3 ) )
| ! [X2: general] :
( ~ hp(X2)
| ( X1 != X2 ) )
| ( X0 != X1 )
| hq(X0) ) ),
inference(flattening,[],[f48]) ).
tff(f50,plain,
? [X0: general,X1: general] :
( ( tq(X0)
& ? [X3: general] :
( tp(X3)
& ( X1 = X3 ) )
& ( X0 = X1 )
& ~ tq(X0) )
| ( tq(X0)
& ? [X2: general] :
( hp(X2)
& ( X2 = X1 ) )
& ( X0 = X1 )
& ~ hq(X0) ) ),
inference(ennf_transformation,[],[f35]) ).
tff(f51,plain,
? [X0: general,X1: general] :
( ( tq(X0)
& ? [X3: general] :
( tp(X3)
& ( X1 = X3 ) )
& ( X0 = X1 )
& ~ tq(X0) )
| ( tq(X0)
& ? [X2: general] :
( hp(X2)
& ( X2 = X1 ) )
& ( X0 = X1 )
& ~ hq(X0) ) ),
inference(flattening,[],[f50]) ).
tff(f62,plain,
( sP0(sK4,sK5)
| ( tq(sK4)
& hp(sK6)
& ( sK5 = sK6 )
& ( sK4 = sK5 )
& ~ hq(sK4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6)],[f53]) ).
tff(f83,plain,
! [X2: general,X3: general,X0: general,X1: general] :
( ~ tq(X3)
| ( X1 != X3 )
| ~ hp(X2)
| ( X1 != X2 )
| ( X0 != X1 )
| hq(X0) ),
inference(cnf_transformation,[],[f49]) ).
tff(f89,plain,
( sP0(sK4,sK5)
| tq(sK4) ),
inference(cnf_transformation,[],[f62]) ).
tff(f90,plain,
( sP0(sK4,sK5)
| hp(sK6) ),
inference(cnf_transformation,[],[f62]) ).
tff(f91,plain,
( sP0(sK4,sK5)
| ( sK5 = sK6 ) ),
inference(cnf_transformation,[],[f62]) ).
tff(f92,plain,
( sP0(sK4,sK5)
| ( sK4 = sK5 ) ),
inference(cnf_transformation,[],[f62]) ).
tff(f93,plain,
( sP0(sK4,sK5)
| ~ hq(sK4) ),
inference(cnf_transformation,[],[f62]) ).
tff(f97,plain,
! [X2: general,X3: general,X1: general] :
( ~ tq(X3)
| ( X1 != X3 )
| ~ hp(X2)
| ( X1 != X2 )
| hq(X1) ),
inference(equality_resolution,[],[f83]) ).
tff(f98,plain,
! [X2: general,X3: general] :
( ~ tq(X3)
| ( X2 != X3 )
| ~ hp(X2)
| hq(X2) ),
inference(equality_resolution,[],[f97]) ).
tff(f99,plain,
! [X3: general] :
( ~ tq(X3)
| ~ hp(X3)
| hq(X3) ),
inference(equality_resolution,[],[f98]) ).
tcf(c_78,plain,
! [X0_general: general] :
( hq(X0_general)
| ~ hp(X0_general)
| ~ tq(X0_general) ),
inference(cnf_transformation,[],[f99]) ).
tcf(c_84,negated_conjecture,
( sP0(sK4,sK5)
| ~ hq(sK4) ),
inference(cnf_transformation,[],[f93]) ).
tcf(c_85,negated_conjecture,
( sP0(sK4,sK5)
| ( sK4 = sK5 ) ),
inference(cnf_transformation,[],[f92]) ).
tcf(c_86,negated_conjecture,
( sP0(sK4,sK5)
| ( sK5 = sK6 ) ),
inference(cnf_transformation,[],[f91]) ).
tcf(c_87,negated_conjecture,
( hp(sK6)
| sP0(sK4,sK5) ),
inference(cnf_transformation,[],[f90]) ).
tcf(c_88,negated_conjecture,
( tq(sK4)
| sP0(sK4,sK5) ),
inference(cnf_transformation,[],[f89]) ).
tcf(c_162,plain,
( sP0(sK4,sK5)
| ~ hq(sK4) ),
inference(prop_impl_just,[status(thm)],[c_84]) ).
tcf(c_166,plain,
( ( sK4 = sK5 )
| sP0(sK4,sK5) ),
inference(prop_impl_just,[status(thm)],[c_85]) ).
tcf(c_167,plain,
( sP0(sK4,sK5)
| ( sK4 = sK5 ) ),
inference(renaming,[status(thm)],[c_166]) ).
tcf(c_168,plain,
( ( sK5 = sK6 )
| sP0(sK4,sK5) ),
inference(prop_impl_just,[status(thm)],[c_86]) ).
tcf(c_169,plain,
( sP0(sK4,sK5)
| ( sK5 = sK6 ) ),
inference(renaming,[status(thm)],[c_168]) ).
tcf(c_170,plain,
( hp(sK6)
| sP0(sK4,sK5) ),
inference(prop_impl_just,[status(thm)],[c_87]) ).
tcf(c_172,plain,
( tq(sK4)
| sP0(sK4,sK5) ),
inference(prop_impl_just,[status(thm)],[c_88]) ).
tff(f52,definition,
! [X0: general,X1: general] :
( ~ sP0(X0,X1)
| ( tq(X0)
& ? [X3: general] :
( tp(X3)
& ( X1 = X3 ) )
& ( X0 = X1 )
& ~ tq(X0) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
tff(f53,plain,
? [X0: general,X1: general] :
( sP0(X0,X1)
| ( tq(X0)
& ? [X2: general] :
( hp(X2)
& ( X2 = X1 ) )
& ( X0 = X1 )
& ~ hq(X0) ) ),
inference(definition_folding,[],[f51,f52]) ).
tff(f59,plain,
! [X0: general,X1: general] :
( ~ sP0(X0,X1)
| ( tq(X0)
& ? [X3: general] :
( tp(X3)
& ( X1 = X3 ) )
& ( X0 = X1 )
& ~ tq(X0) ) ),
inference(nnf_transformation,[],[f52]) ).
tff(f60,plain,
! [X0: general,X1: general] :
( ~ sP0(X0,X1)
| ( tq(X0)
& ? [X2: general] :
( tp(X2)
& ( X1 = X2 ) )
& ( X0 = X1 )
& ~ tq(X0) ) ),
inference(rectify,[],[f59]) ).
tff(f61,plain,
! [X0: general,X1: general] :
( ~ sP0(X0,X1)
| ( tq(X0)
& tp(sK3(X1))
& ( sK3(X1) = X1 )
& ( X0 = X1 )
& ~ tq(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X1))],[f60]) ).
tff(f84,plain,
! [X0: general,X1: general] :
( ~ sP0(X0,X1)
| tq(X0) ),
inference(cnf_transformation,[],[f61]) ).
tff(f86,plain,
! [X0: general,X1: general] :
( ~ sP0(X0,X1)
| ( sK3(X1) = X1 ) ),
inference(cnf_transformation,[],[f61]) ).
tff(f88,plain,
! [X0: general,X1: general] :
( ~ sP0(X0,X1)
| ~ tq(X0) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_79,negated_conjecture,
! [X0_general: general,X1_general: general] :
( ~ tq(X0_general)
| ~ sP0(X0_general,X1_general) ),
inference(cnf_transformation,[],[f88]) ).
tcf(c_81,plain,
! [X0_general: general,X1_general: general] :
( ( sK3(X1_general) = X1_general )
| ~ sP0(X0_general,X1_general) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_83,plain,
! [X0_general: general,X1_general: general] :
( tq(X0_general)
| ~ sP0(X0_general,X1_general) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_119,plain,
! [X0_general: general,X1_general: general] : ~ sP0(X0_general,X1_general),
inference(global_subsumption_just,[status(thm)],[c_83,c_83,c_79]) ).
tcf(c_128,plain,
! [X0_general: general,X1_general: general] : ~ sP0(X0_general,X1_general),
inference(global_subsumption_just,[status(thm)],[c_81,c_119]) ).
tcf(c_266,plain,
hp(sK6),
inference(backward_subsumption_resolution,[status(thm)],[c_170,c_128]) ).
tcf(c_267,plain,
sK5 = sK6,
inference(backward_subsumption_resolution,[status(thm)],[c_169,c_128]) ).
tcf(c_268,plain,
sK4 = sK5,
inference(backward_subsumption_resolution,[status(thm)],[c_167,c_128]) ).
tcf(c_269,plain,
tq(sK4),
inference(backward_subsumption_resolution,[status(thm)],[c_172,c_128]) ).
tcf(c_270,plain,
~ hq(sK4),
inference(backward_subsumption_resolution,[status(thm)],[c_162,c_128]) ).
tcf(c_402,plain,
! [X0_general: general] :
( hq(X0_general)
| ~ tq(X0_general)
| ( X0_general != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_78,c_266]) ).
tcf(c_403,plain,
( hq(sK6)
| ~ tq(sK6) ),
inference(unflattening,[status(thm)],[c_402]) ).
tcf(c_456,plain,
( ~ tq(sK6)
| ( sK4 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_270,c_403]) ).
tcf(c_465,plain,
sK4 != sK6,
inference(resolution_lifted,[status(thm)],[c_269,c_456]) ).
tcf(c_1271,plain,
$false,
inference(ground_joinability,[status(thm)],[c_465,c_267,c_268]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWX074_1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.64 % Computer : n014.cluster.edu
% 0.18/0.64 % Model : x86_64 x86_64
% 0.18/0.64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.64 % Memory : 8046.5625MB
% 0.18/0.64 % OS : Linux 6.8.0-71-generic
% 0.18/0.64 % CPULimit : 300
% 0.18/0.64 % WCLimit : 300
% 0.18/0.64 % DateTime : Thu Sep 24 23:23:48 UTC 2026
% 0.22/0.65 % CPUTime :
% 0.22/0.65 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.23/0.70 Running TFA theorem proving
% 0.23/0.70 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.23/0.71
% 0.23/0.71 % ======== iProver multi-core TPTP/SMT =========
% 0.23/0.71
% 0.23/0.71 % Detected problem language: tptp
% 0.23/0.73 % Proving...
% 1.69/1.60 % SZS status Started for theBenchmark.p
% 1.69/1.60 ERROR - "ProverProcess:heur/schedule_none:304.99995970726013" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.69/1.60 Fatal error: exception Failure("undefined enum value")
% 1.69/1.60 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_x9jd5hrl/rzi0qks9 2>> /export/starexec/sandbox2/tmp/iprover_out_x9jd5hrl/rzi0qks9_error
% 1.69/1.60 ERROR - "ProverProcess:heur/vip_65520:11.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.69/1.60 Fatal error: exception Failure("undefined enum value")
% 1.69/1.60 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_x9jd5hrl/zalv60rz 2>> /export/starexec/sandbox2/tmp/iprover_out_x9jd5hrl/zalv60rz_error
% 1.69/1.60 % SZS status Theorem for theBenchmark.p
% 1.69/1.60
% 1.69/1.60 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.69/1.60
% 1.69/1.60 % ------ iProver source info
% 1.69/1.60
% 1.69/1.60 % git: date: 2026-07-19 20:42:38 +0200
% 1.69/1.60 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.69/1.60 % git: non_committed_changes: false
% 1.69/1.60
% 1.69/1.60 % ------ Parsing...
% 1.69/1.60 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.69/1.60
% 1.69/1.60 % ------ Preprocessing... sf_s rm: 3 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 5 0s sf_e pe_s pe_e %
% 1.69/1.60
% 1.69/1.60 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.69/1.60
% 1.69/1.60 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.69/1.60 % ------ Proving...
% 1.69/1.60 % ------ Problem Properties
% 1.69/1.60
% 1.69/1.60 %
% 1.69/1.60 % clauses 31
% 1.69/1.60 % conjectures 3
% 1.69/1.60 % EPR 10
% 1.69/1.60 % Horn 26
% 1.69/1.60 % unary 17
% 1.69/1.60 % binary 9
% 1.69/1.60 % lits 51
% 1.69/1.60 % lits eq 22
% 1.69/1.60 % fd_pure 0
% 1.69/1.60 % fd_pseudo 0
% 1.69/1.60 % fd_cond 0
% 1.69/1.60 % fd_pseudo_cond 4
% 1.69/1.60 % AC symbols 1
% 1.69/1.60
% 1.69/1.60 % ------ Input Options Time Limit: Unbounded
% 1.69/1.60
% 1.69/1.60
% 1.69/1.60 % ------
% 1.69/1.60 % Current options:
% 1.69/1.60 % ------
% 1.69/1.60
% 1.69/1.60
% 1.69/1.60 %
% 1.69/1.60
% 1.69/1.60 % ------ Proving...
% 1.69/1.60 %
% 1.69/1.60
% 1.69/1.60 % SZS status Theorem for theBenchmark.p
% 1.69/1.60
% 1.69/1.60 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.69/1.60
% 1.69/1.60
%------------------------------------------------------------------------------