TSTP Solution File: RNG045+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG045+1 : TPTP v8.2.0. Released v4.0.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 : Mon Jun 24 14:03:11 EDT 2024
% Result : Theorem 182.08s 24.80s
% Output : CNFRefutation 182.08s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0,X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1)
& aScalar0(X0) )
=> ( sdtasdt0(sdtpldt0(X0,X1),X2) = sdtpldt0(sdtasdt0(X0,X2),sdtasdt0(X1,X2))
& sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDistr) ).
fof(f16,axiom,
( aScalar0(xv)
& aScalar0(xu)
& aScalar0(xy)
& aScalar0(xx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__674) ).
fof(f17,axiom,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__733) ).
fof(f18,conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f19,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(negated_conjecture,[],[f18]) ).
fof(f23,plain,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(flattening,[],[f19]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( sdtasdt0(sdtpldt0(X0,X1),X2) = sdtpldt0(sdtasdt0(X0,X2),sdtasdt0(X1,X2))
& sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2)) )
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( sdtasdt0(sdtpldt0(X0,X1),X2) = sdtpldt0(sdtasdt0(X0,X2),sdtasdt0(X1,X2))
& sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2)) )
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(flattening,[],[f38]) ).
fof(f64,plain,
! [X2,X0,X1] :
( sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f66,plain,
aScalar0(xx),
inference(cnf_transformation,[],[f16]) ).
fof(f67,plain,
aScalar0(xy),
inference(cnf_transformation,[],[f16]) ).
fof(f68,plain,
aScalar0(xu),
inference(cnf_transformation,[],[f16]) ).
fof(f69,plain,
aScalar0(xv),
inference(cnf_transformation,[],[f16]) ).
fof(f70,plain,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),
inference(cnf_transformation,[],[f17]) ).
fof(f71,plain,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(cnf_transformation,[],[f23]) ).
cnf(c_72,plain,
( ~ aScalar0(X0)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2)) = sdtasdt0(X0,sdtpldt0(X1,X2)) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_73,plain,
aScalar0(xv),
inference(cnf_transformation,[],[f69]) ).
cnf(c_74,plain,
aScalar0(xu),
inference(cnf_transformation,[],[f68]) ).
cnf(c_75,plain,
aScalar0(xy),
inference(cnf_transformation,[],[f67]) ).
cnf(c_76,plain,
aScalar0(xx),
inference(cnf_transformation,[],[f66]) ).
cnf(c_77,plain,
sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) = sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(cnf_transformation,[],[f70]) ).
cnf(c_78,negated_conjecture,
sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(cnf_transformation,[],[f71]) ).
cnf(c_249,negated_conjecture,
sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(subtyping,[status(esa)],[c_78]) ).
cnf(c_250,plain,
sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) = sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(subtyping,[status(esa)],[c_77]) ).
cnf(c_251,plain,
aScalar0(xx),
inference(subtyping,[status(esa)],[c_76]) ).
cnf(c_252,plain,
aScalar0(xy),
inference(subtyping,[status(esa)],[c_75]) ).
cnf(c_253,plain,
aScalar0(xu),
inference(subtyping,[status(esa)],[c_74]) ).
cnf(c_254,plain,
aScalar0(xv),
inference(subtyping,[status(esa)],[c_73]) ).
cnf(c_255,plain,
( ~ aScalar0(X0_13)
| ~ aScalar0(X1_13)
| ~ aScalar0(X2_13)
| sdtpldt0(sdtasdt0(X0_13,X1_13),sdtasdt0(X0_13,X2_13)) = sdtasdt0(X0_13,sdtpldt0(X1_13,X2_13)) ),
inference(subtyping,[status(esa)],[c_72]) ).
cnf(c_283,plain,
sdtasdt0(xx,xu) = sP3_iProver_def,
definition ).
cnf(c_284,plain,
sdtasdt0(xx,xv) = sP4_iProver_def,
definition ).
cnf(c_285,plain,
sdtpldt0(sP3_iProver_def,sP4_iProver_def) = sP5_iProver_def,
definition ).
cnf(c_286,plain,
sdtasdt0(xy,xu) = sP6_iProver_def,
definition ).
cnf(c_287,plain,
sdtasdt0(xy,xv) = sP7_iProver_def,
definition ).
cnf(c_288,plain,
sdtpldt0(sP6_iProver_def,sP7_iProver_def) = sP8_iProver_def,
definition ).
cnf(c_289,plain,
sdtpldt0(sP5_iProver_def,sP8_iProver_def) = sP9_iProver_def,
definition ).
cnf(c_290,plain,
sdtpldt0(xx,xy) = sP10_iProver_def,
definition ).
cnf(c_291,plain,
sdtpldt0(xu,xv) = sP11_iProver_def,
definition ).
cnf(c_292,plain,
sdtasdt0(sP10_iProver_def,sP11_iProver_def) = sP12_iProver_def,
definition ).
cnf(c_293,negated_conjecture,
sP9_iProver_def != sP12_iProver_def,
inference(demodulation,[status(thm)],[c_249,c_291,c_290,c_292,c_287,c_286,c_288,c_284,c_283,c_285,c_289]) ).
cnf(c_1604,plain,
sdtpldt0(sdtasdt0(xx,sP11_iProver_def),sdtasdt0(xy,sP11_iProver_def)) = sdtasdt0(sdtpldt0(xx,xy),sP11_iProver_def),
inference(superposition,[status(thm)],[c_291,c_250]) ).
cnf(c_1605,plain,
sdtpldt0(sdtasdt0(xx,sP11_iProver_def),sdtasdt0(xy,sP11_iProver_def)) = sdtasdt0(sP10_iProver_def,sP11_iProver_def),
inference(demodulation,[status(thm)],[c_1604,c_290]) ).
cnf(c_1606,plain,
sdtpldt0(sdtasdt0(xx,sP11_iProver_def),sdtasdt0(xy,sP11_iProver_def)) = sP12_iProver_def,
inference(demodulation,[status(thm)],[c_1605,c_292]) ).
cnf(c_1609,plain,
( ~ aScalar0(X0_13)
| ~ aScalar0(X1_13)
| sdtpldt0(sdtasdt0(xy,X0_13),sdtasdt0(xy,X1_13)) = sdtasdt0(xy,sdtpldt0(X0_13,X1_13)) ),
inference(superposition,[status(thm)],[c_252,c_255]) ).
cnf(c_1610,plain,
( ~ aScalar0(X0_13)
| ~ aScalar0(X1_13)
| sdtpldt0(sdtasdt0(xx,X0_13),sdtasdt0(xx,X1_13)) = sdtasdt0(xx,sdtpldt0(X0_13,X1_13)) ),
inference(superposition,[status(thm)],[c_251,c_255]) ).
cnf(c_1812,plain,
( ~ aScalar0(X0_13)
| sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,X0_13)) = sdtasdt0(xy,sdtpldt0(xu,X0_13)) ),
inference(superposition,[status(thm)],[c_253,c_1609]) ).
cnf(c_1819,plain,
( ~ aScalar0(X0_13)
| sdtpldt0(sP6_iProver_def,sdtasdt0(xy,X0_13)) = sdtasdt0(xy,sdtpldt0(xu,X0_13)) ),
inference(demodulation,[status(thm)],[c_1812,c_286]) ).
cnf(c_1836,plain,
( ~ aScalar0(X0_13)
| sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,X0_13)) = sdtasdt0(xx,sdtpldt0(xu,X0_13)) ),
inference(superposition,[status(thm)],[c_253,c_1610]) ).
cnf(c_1843,plain,
( ~ aScalar0(X0_13)
| sdtpldt0(sP3_iProver_def,sdtasdt0(xx,X0_13)) = sdtasdt0(xx,sdtpldt0(xu,X0_13)) ),
inference(demodulation,[status(thm)],[c_1836,c_283]) ).
cnf(c_2591,plain,
sdtpldt0(sP6_iProver_def,sdtasdt0(xy,xv)) = sdtasdt0(xy,sdtpldt0(xu,xv)),
inference(superposition,[status(thm)],[c_254,c_1819]) ).
cnf(c_2597,plain,
sdtasdt0(xy,sP11_iProver_def) = sP8_iProver_def,
inference(demodulation,[status(thm)],[c_2591,c_287,c_288,c_291]) ).
cnf(c_2602,plain,
sdtpldt0(sdtasdt0(xx,sP11_iProver_def),sP8_iProver_def) = sP12_iProver_def,
inference(demodulation,[status(thm)],[c_1606,c_2597]) ).
cnf(c_2714,plain,
sdtpldt0(sP3_iProver_def,sdtasdt0(xx,xv)) = sdtasdt0(xx,sdtpldt0(xu,xv)),
inference(superposition,[status(thm)],[c_254,c_1843]) ).
cnf(c_2720,plain,
sdtasdt0(xx,sP11_iProver_def) = sP5_iProver_def,
inference(demodulation,[status(thm)],[c_2714,c_284,c_285,c_291]) ).
cnf(c_2725,plain,
sdtpldt0(sP5_iProver_def,sP8_iProver_def) = sP12_iProver_def,
inference(demodulation,[status(thm)],[c_2602,c_2720]) ).
cnf(c_2726,plain,
sP9_iProver_def = sP12_iProver_def,
inference(demodulation,[status(thm)],[c_2725,c_289]) ).
cnf(c_2727,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2726,c_293]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG045+1 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Jun 18 13:31:39 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 42.36/6.71 % SZS status Started for theBenchmark.p
% 42.36/6.71 ERROR - "ProverProcess:heur/379306:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Z3.Error("Sort mismatch at argument #1 for function (declare-fun k!98 (|16777216|) |16777216|) supplied sort is |16777230|")
% 42.36/6.71 Fatal error: exception Z3.Error("Sort mismatch at argument #1 for function (declare-fun k!98 (|16777216|) |16777216|) supplied sort is |16777230|")
% 42.36/6.71 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 6 --comb_sup_mult 32 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground false --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 "[]" --sup_full_triv "[PropSubs;Unflattening]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes;DemodLoopTriv;ACNormalisation]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;Demod;LightNorm;ACNormalisation]" --sup_immed_triv "[PropSubs]" --sup_indices_passive "[]" --sup_input_bw "[SubsumptionRes]" --sup_input_fw "[SMTSubs;]" --sup_input_triv "[]" --sup_iter_deepening 1 --sup_passive_queue_type priority_queues --sup_passive_queues "[[+min_def_symb;-score;+epr];[-next_state;-conj_dist;+conj_symb]]" --sup_passive_queues_freq "[3;512]" --sup_prop_simpl_given false --sup_prop_simpl_new true --sup_restarts_mult 16 --sup_score sim_d_gen --sup_share_max_num_cl 320 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering arity_rev --sup_to_prop_solver none --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify --show_fool true -t 2.00" --time_out_real 2.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_u3qa5fcr/5gdc8n12 2>> /export/starexec/sandbox2/tmp/iprover_out_u3qa5fcr/5gdc8n12_error
% 182.08/24.80 % SZS status Theorem for theBenchmark.p
% 182.08/24.80
% 182.08/24.80 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 182.08/24.80
% 182.08/24.80 ------ iProver source info
% 182.08/24.80
% 182.08/24.80 git: date: 2024-06-12 09:56:46 +0000
% 182.08/24.80 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 182.08/24.80 git: non_committed_changes: false
% 182.08/24.80
% 182.08/24.80 ------ Parsing...
% 182.08/24.80 ------ Clausification by vclausify_rel & Parsing by iProver...
% 182.08/24.80
% 182.08/24.80 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 182.08/24.80
% 182.08/24.80 ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e
% 182.08/24.80
% 182.08/24.80 ------ Preprocessing... sf_s rm: 4 0s sf_e sf_s rm: 0 0s sf_e
% 182.08/24.80 ------ Proving...
% 182.08/24.80 ------ Problem Properties
% 182.08/24.80
% 182.08/24.80
% 182.08/24.80 clauses 43
% 182.08/24.80 conjectures 1
% 182.08/24.80 EPR 10
% 182.08/24.80 Horn 39
% 182.08/24.80 unary 19
% 182.08/24.80 binary 13
% 182.08/24.80 lits 85
% 182.08/24.80 lits eq 32
% 182.08/24.80 fd_pure 0
% 182.08/24.80 fd_pseudo 0
% 182.08/24.80 fd_cond 1
% 182.08/24.80 fd_pseudo_cond 1
% 182.08/24.80 AC symbols 0
% 182.08/24.80
% 182.08/24.80 ------ Input Options Time Limit: Unbounded
% 182.08/24.80
% 182.08/24.80
% 182.08/24.80 ------
% 182.08/24.80 Current options:
% 182.08/24.80 ------
% 182.08/24.80
% 182.08/24.80
% 182.08/24.80
% 182.08/24.80
% 182.08/24.80 ------ Proving...
% 182.08/24.80
% 182.08/24.80
% 182.08/24.80 % SZS status Theorem for theBenchmark.p
% 182.08/24.80
% 182.08/24.80 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 182.08/24.80
% 182.08/24.81
%------------------------------------------------------------------------------