↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : DAT102_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 : n016.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:14:00 PM UTC 2026

% Result   : Theorem 1.92s 1.30s
% Output   : CNFRefutation 1.92s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f21ERROR: Could not build tree for root c_188ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    nil: list ).

tff(pred_def_1,type,
    inRange: ( list * $int ) > $o ).

tff(func_def_2,type,
    head: list > $int ).

tff(func_def_3,type,
    tail: list > list ).

tff(type_def_5,type,
    list: $tType ).

tff(func_def_8,type,
    sK0: ( list * $int ) > $int ).

tff(func_def_9,type,
    sK1: ( list * $int ) > list ).

tff(f2,axiom,
    ! [X0: $int,X1: list] : ( tail(cons(X0,X1)) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2) ).

tff(f4,axiom,
    ! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4) ).

tff(f5,axiom,
    ! [X0: $int,X1: list] :
      ( inRange(X0,X1)
    <=> ( ? [X2: $int,X3: list] :
            ( inRange(X0,X3)
            & $less(X2,X0)
            & $lesseq(0,X2)
            & ( X1 = cons(X2,X3) ) )
        | ( X1 = nil ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inRange) ).

tff(f8,plain,
    ! [X0: $int,X1: list] :
      ( inRange(X0,X1)
    <=> ( ? [X2: $int,X3: list] :
            ( inRange(X0,X3)
            & $less(X2,X0)
            & ~ $less(X2,0)
            & ( X1 = cons(X2,X3) ) )
        | ( X1 = nil ) ) ),
    inference(theory_normalization,[],[f5]) ).

tff(f22,plain,
    ! [X0: list,X1: $int] :
      ( ~ inRange(X1,tail(X0))
      | inRange(X1,X0) ),
    inference(ennf_transformation,[],[f21]) ).

tff(f23,plain,
    ! [X0: $int,X1: list] :
      ( ( ~ inRange(X0,X1)
        | ? [X2: $int,X3: list] :
            ( inRange(X0,X3)
            & $less(X2,X0)
            & ~ $less(X2,0)
            & ( X1 = cons(X2,X3) ) )
        | ( X1 = nil ) )
      & ( ( ! [X2: $int,X3: list] :
              ( ~ inRange(X0,X3)
              | ~ $less(X2,X0)
              | $less(X2,0)
              | ( cons(X2,X3) != X1 ) )
          & ( nil != X1 ) )
        | inRange(X0,X1) ) ),
    inference(nnf_transformation,[],[f8]) ).

tff(f24,plain,
    ! [X0: $int,X1: list] :
      ( ( ~ inRange(X0,X1)
        | ? [X2: $int,X3: list] :
            ( inRange(X0,X3)
            & $less(X2,X0)
            & ~ $less(X2,0)
            & ( X1 = cons(X2,X3) ) )
        | ( X1 = nil ) )
      & ( ( ! [X2: $int,X3: list] :
              ( ~ inRange(X0,X3)
              | ~ $less(X2,X0)
              | $less(X2,0)
              | ( cons(X2,X3) != X1 ) )
          & ( nil != X1 ) )
        | inRange(X0,X1) ) ),
    inference(flattening,[],[f23]) ).

tff(f25,plain,
    ! [X0: $int,X1: list] :
      ( ( ~ inRange(X0,X1)
        | ? [X4: $int,X5: list] :
            ( inRange(X0,X5)
            & $less(X4,X0)
            & ~ $less(X4,0)
            & ( cons(X4,X5) = X1 ) )
        | ( X1 = nil ) )
      & ( ( ! [X2: $int,X3: list] :
              ( ~ inRange(X0,X3)
              | ~ $less(X2,X0)
              | $less(X2,0)
              | ( cons(X2,X3) != X1 ) )
          & ( nil != X1 ) )
        | inRange(X0,X1) ) ),
    inference(rectify,[],[f24]) ).

tff(f26,plain,
    ! [X0: $int,X1: list] :
      ( ( ~ inRange(X0,X1)
        | ( inRange(X0,sK1(X0,X1))
          & $less(sK0(X0,X1),X0)
          & ~ $less(sK0(X0,X1),0)
          & ( cons(sK0(X0,X1),sK1(X0,X1)) = X1 ) )
        | ( X1 = nil ) )
      & ( ( ! [X2: $int,X3: list] :
              ( ~ inRange(X0,X3)
              | ~ $less(X2,X0)
              | $less(X2,0)
              | ( cons(X2,X3) != X1 ) )
          & ( nil != X1 ) )
        | inRange(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X4,sK0(X0,X1)),skolemize(X5,sK1(X0,X1))],[f25]) ).

tff(f28,plain,
    ! [X0: $int,X1: list] : ( tail(cons(X0,X1)) = X1 ),
    inference(cnf_transformation,[],[f2]) ).

tff(f30,plain,
    ! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
    inference(cnf_transformation,[],[f4]) ).

tff(f32,plain,
    ! [X0: $int,X1: list] :
      ( ~ inRange(X0,X1)
      | $less(sK0(X0,X1),X0)
      | ( nil = X1 ) ),
    inference(cnf_transformation,[],[f26]) ).

tff(f33,plain,
    ! [X0: $int,X1: list] :
      ( ~ inRange(X0,X1)
      | ~ $less(sK0(X0,X1),0)
      | ( nil = X1 ) ),
    inference(cnf_transformation,[],[f26]) ).

tff(f36,plain,
    ! [X0: $int,X1: list] :
      ( ( nil != X1 )
      | inRange(X0,X1) ),
    inference(cnf_transformation,[],[f26]) ).

tff(f37,plain,
    ! [X0: list,X1: $int] :
      ( ~ inRange(X1,tail(X0))
      | inRange(X1,X0) ),
    inference(cnf_transformation,[],[f22]) ).

tff(f38,plain,
    ! [X0: $int] : inRange(X0,nil),
    inference(equality_resolution,[],[f36]) ).

tcf(c_62,plain,
    ! [X0_int: $int,X0_list: list] : tail(cons(X0_int,X0_list)) = X0_list,
    inference(cnf_transformation,[],[f28]) ).

tcf(c_64,plain,
    ! [X0_int: $int,X0_list: list] : cons(X0_int,X0_list) != nil,
    inference(cnf_transformation,[],[f30]) ).

tcf(c_65,plain,
    ! [X0_int: $int] : inRange(X0_int,nil),
    inference(cnf_transformation,[],[f38]) ).

tcf(c_68,plain,
    ! [X0_int: $int,X0_list: list] :
      ( ( X0_list = nil )
      | ~ inRange(X0_int,X0_list)
      | ~ $less(sK0(X0_int,X0_list),0) ),
    inference(cnf_transformation,[],[f33]) ).

tcf(c_69,plain,
    ! [X0_int: $int,X0_list: list] :
      ( $less(sK0(X0_int,X0_list),X0_int)
      | ( X0_list = nil )
      | ~ inRange(X0_int,X0_list) ),
    inference(cnf_transformation,[],[f32]) ).

tcf(c_71,negated_conjecture,
    ! [X0_int: $int,X0_list: list] :
      ( inRange(X0_int,X0_list)
      | ~ inRange(X0_int,tail(X0_list)) ),
    inference(cnf_transformation,[],[f37]) ).

tcf(c_84,plain,
    ! [X0_int: $int,X0_list: list,X1_list: list] :
      ( inRange(X0_int,X0_list)
      | ~ inRange(X0_int,X1_list)
      | ( X0_list != X1_list ) ),
    theory(equality) ).

tcf(c_85,plain,
    inRange(0,nil),
    inference(instantiation,[status(thm)],[c_65]) ).

tcf(c_92,plain,
    cons(0,nil) != nil,
    inference(instantiation,[status(thm)],[c_64]) ).

tcf(c_93,plain,
    tail(cons(0,nil)) = nil,
    inference(instantiation,[status(thm)],[c_62]) ).

tcf(c_115,plain,
    ! [X0_int: $int,X0_list: list,X1_int: $int] :
      ( ( cons(X1_int,X0_list) = nil )
      | ~ inRange(X0_int,cons(X1_int,X0_list))
      | ~ $less(sK0(X0_int,cons(X1_int,X0_list)),0) ),
    inference(instantiation,[status(thm)],[c_68]) ).

tcf(c_116,plain,
    ! [X0_int: $int,X0_list: list,X1_int: $int] :
      ( $less(sK0(X0_int,cons(X1_int,X0_list)),X0_int)
      | ( cons(X1_int,X0_list) = nil )
      | ~ inRange(X0_int,cons(X1_int,X0_list)) ),
    inference(instantiation,[status(thm)],[c_69]) ).

tcf(c_117,plain,
    ( $less(sK0(0,cons(0,nil)),0)
    | ( cons(0,nil) = nil )
    | ~ inRange(0,cons(0,nil)) ),
    inference(instantiation,[status(thm)],[c_116]) ).

tcf(c_118,plain,
    ( ( cons(0,nil) = nil )
    | ~ inRange(0,cons(0,nil))
    | ~ $less(sK0(0,cons(0,nil)),0) ),
    inference(instantiation,[status(thm)],[c_115]) ).

tcf(c_138,plain,
    ! [X0_int: $int,X0_list: list,X1_int: $int] :
      ( inRange(X0_int,cons(X1_int,X0_list))
      | ~ inRange(X0_int,tail(cons(X1_int,X0_list))) ),
    inference(instantiation,[status(thm)],[c_71]) ).

tcf(c_139,plain,
    ( inRange(0,cons(0,nil))
    | ~ inRange(0,tail(cons(0,nil))) ),
    inference(instantiation,[status(thm)],[c_138]) ).

tcf(c_186,plain,
    ! [X0_int: $int,X0_list: list,X1_int: $int,X1_list: list] :
      ( inRange(X1_int,tail(cons(X0_int,X0_list)))
      | ~ inRange(X1_int,X1_list)
      | ( tail(cons(X0_int,X0_list)) != X1_list ) ),
    inference(instantiation,[status(thm)],[c_84]) ).

tcf(c_187,plain,
    ( inRange(0,tail(cons(0,nil)))
    | ~ inRange(0,nil)
    | ( tail(cons(0,nil)) != nil ) ),
    inference(instantiation,[status(thm)],[c_186]) ).

tcf(c_188,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_187,c_139,c_118,c_117,c_93,c_92,c_85]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : DAT102_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.38  % Computer : n016.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Fri Sep 25 10:29:45 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.42  Running TFA theorem proving
% 0.13/0.42  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.13/0.43  
% 0.13/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43  
% 0.13/0.43  % Detected problem language: tptp
% 0.13/0.45  % Proving...
% 1.92/1.30  % SZS status Started for theBenchmark.p
% 1.92/1.30  ERROR - "ProverProcess:heur/schedule_none:304.9999649524689" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.92/1.30  Fatal error: exception Failure("undefined enum value")
% 1.92/1.30  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_5ufzrbo7/sjq095s8 2>> /export/starexec/sandbox2/tmp/iprover_out_5ufzrbo7/sjq095s8_error
% 1.92/1.30  ERROR - "ProverProcess:heur/vip_66003:95.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.92/1.30  Fatal error: exception Failure("undefined enum value")
% 1.92/1.30  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --comb_inst_mult 32 --comb_mode time_based --comb_sup_deep_mult 64 --comb_sup_mult 64 --conj_cone_tolerance 3.2246457225635665 --demod_completeness_check fast --demod_use_ground true --extra_neg_conj all_pos_neg --inst_activity_threshold 64 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 10 --inst_learning_loop_flag true --inst_learning_start 32768 --inst_lit_activity_flag false --inst_lit_sel "[+sign;-prop]" --inst_lit_sel_side num_lit --inst_orphan_elimination true --inst_passive_queue_type list --inst_passive_queues "[[+num_lits;+num_symb];[-ar_concr];[-ar_concr]]" --inst_passive_queues_freq "[5;3;15]" --inst_prop_sim_given true --inst_prop_sim_new true --inst_restr_to_given false --inst_sel_renew model --inst_solver_calls_frac 0.994592572872622 --inst_solver_per_active 128 --inst_sos_flag true --inst_sos_phase true --inst_sos_sth_lit_sel "[+non_prol_conj_symb;-split;+sign]" --inst_start_prop_sim_after_learn 8 --inst_subs_given false --inst_subs_new true --inst_to_smt_solver 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 128 --proof_out true --prop_solver_per_cl 8192 --resolution_flag false --schedule none --share_sel_clauses true --stats_out none --subs_bck_mult 4 --sup_bw_gjoin_interval 100 --sup_cache_sim once --sup_full_bw "[]" --sup_full_fixpoint true --sup_full_fw "[Subsumption;SubsumptionRes;FullSubsAndRes;ACNormalisation;GroundJoinability;Connectedness]" --sup_fun_splitting true --sup_immed_bw_immed "[SubsumptionRes;UnitSubsAndRes;FullSubsAndRes;ACDemod]" --sup_immed_bw_main "[]" --sup_immed_fixpoint true --sup_immed_fw_immed "[]" --sup_immed_fw_main "[UnitSubsAndRes;Demod;LightNorm;ACJoinability;ACNormalisation;ACDemod;GroundJoinability]" --sup_immed_triv "[Unflattening;SMTSimplify]" --sup_indices_passive "[BwDemod;LightNorm;BwACDemod]" --sup_input_bw "[]" --sup_input_fixpoint false --sup_input_fw "[Subsumption;SubsumptionRes;FullSubsAndRes;SMTSubs;ACJoinability]" --sup_input_triv "[]" --sup_iter_deepening 4 --sup_main_fixpoint true --sup_ordering kbo --sup_passive_queue_type queue --sup_passive_queues "[[-max_atom_input_occur]]" --sup_passive_queues_freq "[3]" --sup_prop_simpl_given true --sup_prop_simpl_new false --sup_restarts_mult 16 --sup_score sim_d_gen --sup_share_max_num_cl 1280 --sup_share_score_frac 0.1 --sup_smt_interval 64 --sup_symb_ordering invfreq_arity --sup_term_weight default --sup_to_prop_solver passive --sup_unprocessed_bound 1000 --superposition_flag true --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify   -t 31.67 --show_fool true" --time_out_real 95.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_5ufzrbo7/h914vzmx 2>> /export/starexec/sandbox2/tmp/iprover_out_5ufzrbo7/h914vzmx_error
% 1.92/1.30  ERROR - "ProverProcess:heur/vip_65520:11.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.92/1.30  Fatal error: exception Failure("undefined enum value")
% 1.92/1.30  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_5ufzrbo7/70g4mfqw 2>> /export/starexec/sandbox2/tmp/iprover_out_5ufzrbo7/70g4mfqw_error
% 1.92/1.30  ERROR - "ProverProcess:heur/vip_65097:3.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.92/1.30  Fatal error: exception Failure("undefined enum value")
% 1.92/1.30  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_5ufzrbo7/xw97rcib 2>> /export/starexec/sandbox2/tmp/iprover_out_5ufzrbo7/xw97rcib_error
% 1.92/1.30  ERROR - "ProverProcess:heur/vip_65080:40.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.92/1.30  Fatal error: exception Failure("undefined enum value")
% 1.92/1.30  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_5ufzrbo7/hckfoufu 2>> /export/starexec/sandbox2/tmp/iprover_out_5ufzrbo7/hckfoufu_error
% 1.92/1.30  % SZS status Theorem for theBenchmark.p
% 1.92/1.30  
% 1.92/1.30  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.92/1.30  
% 1.92/1.30  % ------  iProver source info
% 1.92/1.30  
% 1.92/1.30  % git: date: 2026-07-19 20:42:38 +0200
% 1.92/1.30  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.92/1.30  % git: non_committed_changes: false
% 1.92/1.30  
% 1.92/1.30  % ------ Parsing...
% 1.92/1.30  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.92/1.30  % ------ Proving...
% 1.92/1.30  % ------ Problem Properties 
% 1.92/1.30  
% 1.92/1.30  % 
% 1.92/1.30  % clauses                               24
% 1.92/1.30  % conjectures                           1
% 1.92/1.30  % EPR                                   5
% 1.92/1.30  % Horn                                  17
% 1.92/1.30  % unary                                 12
% 1.92/1.30  % binary                                5
% 1.92/1.30  % lits                                  44
% 1.92/1.30  % lits eq                               17
% 1.92/1.30  % fd_pure                               0
% 1.92/1.30  % fd_pseudo                             0
% 1.92/1.30  % fd_cond                               3
% 1.92/1.30  % fd_pseudo_cond                        1
% 1.92/1.30  % AC symbols                            1
% 1.92/1.30  
% 1.92/1.30  % ------ Input Options Time Limit: Unbounded
% 1.92/1.30  
% 1.92/1.30  
% 1.92/1.30  % ------ 
% 1.92/1.30  % Current options:
% 1.92/1.30  % ------ 
% 1.92/1.30  
% 1.92/1.30  
% 1.92/1.30  % 
% 1.92/1.30  
% 1.92/1.30  % ------ Proving...
% 1.92/1.30  % 
% 1.92/1.30  
% 1.92/1.30  % SZS status Theorem for theBenchmark.p
% 1.92/1.30  
% 1.92/1.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.92/1.30  
% 1.92/1.30  
%------------------------------------------------------------------------------