TSTP Solution File: GEO454+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO454+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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 : Wed Aug 30 23:11:23 EDT 2023
% Result : Theorem 61.05s 11.77s
% Output : CNFRefutation 61.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 21 unt; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn; 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f200,axiom,
! [X83] : s(num,X83) = s(num,i(s(fun(num,num),numeral),s(num,X83))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aNUMERAL) ).
fof(f3206,axiom,
! [X0] : s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X0))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) = s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',adrop) ).
fof(f3207,axiom,
! [X0] : s(real,X0) = s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X0))))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aLIFTu_COMPONENT) ).
fof(f3209,conjecture,
! [X0] : s(real,X0) = s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X0))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aLIFTu_DROPu_conjunct1) ).
fof(f3210,negated_conjecture,
~ ! [X0] : s(real,X0) = s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X0))))),
inference(negated_conjecture,[],[f3209]) ).
fof(f3374,plain,
! [X0] : s(num,X0) = s(num,i(s(fun(num,num),numeral),s(num,X0))),
inference(rectify,[],[f200]) ).
fof(f8215,plain,
? [X0] : s(real,X0) != s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X0))))),
inference(ennf_transformation,[],[f3210]) ).
fof(f14273,plain,
( ? [X0] : s(real,X0) != s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X0)))))
=> s(real,sK4049) != s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,sK4049))))) ),
introduced(choice_axiom,[]) ).
fof(f14274,plain,
s(real,sK4049) != s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,sK4049))))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4049])],[f8215,f14273]) ).
fof(f14927,plain,
! [X0] : s(num,X0) = s(num,i(s(fun(num,num),numeral),s(num,X0))),
inference(cnf_transformation,[],[f3374]) ).
fof(f21359,plain,
! [X0] : s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X0))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) = s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X0))),
inference(cnf_transformation,[],[f3206]) ).
fof(f21360,plain,
! [X0] : s(real,X0) = s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X0))))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),
inference(cnf_transformation,[],[f3207]) ).
fof(f21362,plain,
s(real,sK4049) != s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,sK4049))))),
inference(cnf_transformation,[],[f14274]) ).
cnf(c_459,plain,
s(num,i(s(fun(num,num),numeral),s(num,X0))) = s(num,X0),
inference(cnf_transformation,[],[f14927]) ).
cnf(c_6891,plain,
s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X0))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) = s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X0))),
inference(cnf_transformation,[],[f21359]) ).
cnf(c_6892,plain,
s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X0))))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) = s(real,X0),
inference(cnf_transformation,[],[f21360]) ).
cnf(c_6894,negated_conjecture,
s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,sK4049))))) != s(real,sK4049),
inference(cnf_transformation,[],[f21362]) ).
cnf(c_35492,plain,
s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X0))))),s(num,i(s(fun(num,num),bit1),s(num,u_0))))) = s(real,X0),
inference(demodulation,[status(thm)],[c_6892,c_459]) ).
cnf(c_35750,plain,
s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X0))),s(num,i(s(fun(num,num),bit1),s(num,u_0))))) = s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X0))),
inference(demodulation,[status(thm)],[c_6891,c_459]) ).
cnf(c_35751,plain,
s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X0))))) = s(real,X0),
inference(demodulation,[status(thm)],[c_35492,c_35750]) ).
cnf(c_35752,plain,
s(real,sK4049) != s(real,sK4049),
inference(demodulation,[status(thm)],[c_6894,c_35751]) ).
cnf(c_35753,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_35752]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO454+1 : TPTP v8.1.2. Released v7.0.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 19:12:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.44/2.20 % SZS status Started for theBenchmark.p
% 10.44/2.20 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")
% 10.44/2.20 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 10.44/2.20 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 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 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 1.00" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_tck3p7c0/aa8maia0 2>> /export/starexec/sandbox/tmp/iprover_out_tck3p7c0/aa8maia0_error
% 61.05/11.77 % SZS status Theorem for theBenchmark.p
% 61.05/11.77
% 61.05/11.77 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 61.05/11.77
% 61.05/11.77 ------ iProver source info
% 61.05/11.77
% 61.05/11.77 git: date: 2023-05-31 18:12:56 +0000
% 61.05/11.77 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 61.05/11.77 git: non_committed_changes: false
% 61.05/11.77 git: last_make_outside_of_git: false
% 61.05/11.77
% 61.05/11.77 ------ Parsing...
% 61.05/11.77 ------ Clausification by vclausify_rel & Parsing by iProver...
% 61.05/11.77
% 61.05/11.77 ------ Preprocessing...
% 61.05/11.77
% 61.05/11.77 % SZS status Theorem for theBenchmark.p
% 61.05/11.77
% 61.05/11.77 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 61.05/11.77
% 61.05/11.77
%------------------------------------------------------------------------------