TSTP Solution File: GRP182-4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP182-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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 : Thu Aug 31 00:58:32 EDT 2023
% Result : Unsatisfiable 0.44s 1.13s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 3 RR)
% Number of literals : 8 ( 7 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_52,negated_conjecture,
greatest_lower_bound(identity,least_upper_bound(a,identity)) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p17b) ).
cnf(c_53,plain,
greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(c_54,plain,
least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(c_55,plain,
greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(c_56,plain,
least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(c_60,plain,
greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(c_85,negated_conjecture,
greatest_lower_bound(identity,least_upper_bound(identity,a)) != identity,
inference(theory_normalisation,[status(thm)],[c_52,c_55,c_53,c_56,c_54]) ).
cnf(c_106,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_85,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP182-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 22:03:29 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running UEQ theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.44/1.13 % SZS status Started for theBenchmark.p
% 0.44/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 0.44/1.13
% 0.44/1.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.44/1.13
% 0.44/1.13 ------ iProver source info
% 0.44/1.13
% 0.44/1.13 git: date: 2023-05-31 18:12:56 +0000
% 0.44/1.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.44/1.13 git: non_committed_changes: false
% 0.44/1.13 git: last_make_outside_of_git: false
% 0.44/1.13
% 0.44/1.13 ------ Parsing...successful
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 ------ Preprocessing...
% 0.44/1.13
% 0.44/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 0.44/1.13
% 0.44/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.13
% 0.44/1.13 ------ Statistics
% 0.44/1.13
% 0.44/1.13 ------ Problem properties
% 0.44/1.13
% 0.44/1.13 clauses: 0
% 0.44/1.13 conjectures: 0
% 0.44/1.13 epr: 0
% 0.44/1.13 horn: 0
% 0.44/1.13 ground: 0
% 0.44/1.13 unary: 0
% 0.44/1.13 binary: 0
% 0.44/1.13 lits: 0
% 0.44/1.13 lits_eq: 0
% 0.44/1.13 fd_pure: 0
% 0.44/1.13 fd_pseudo: 0
% 0.44/1.13 fd_cond: 0
% 0.44/1.13 fd_pseudo_cond: 0
% 0.44/1.13 ac_symbols: undef
% 0.44/1.13
% 0.44/1.13 ------ General
% 0.44/1.13
% 0.44/1.13 abstr_ref_over_cycles: 0
% 0.44/1.13 abstr_ref_under_cycles: 0
% 0.44/1.13 gc_basic_clause_elim: 0
% 0.44/1.13 num_of_symbols: 102
% 0.44/1.13 num_of_terms: 324
% 0.44/1.13
% 0.44/1.13 parsing_time: 0.
% 0.44/1.13 unif_index_cands_time: 0.
% 0.44/1.13 unif_index_add_time: 0.
% 0.44/1.13 orderings_time: 0.
% 0.44/1.13 out_proof_time: 0.
% 0.44/1.13 total_time: 0.03
% 0.44/1.13
% 0.44/1.13 ------ Preprocessing
% 0.44/1.13
% 0.44/1.13 num_of_splits: 0
% 0.44/1.13 num_of_split_atoms: 0
% 0.44/1.13 num_of_reused_defs: 0
% 0.44/1.13 num_eq_ax_congr_red: 0
% 0.44/1.13 num_of_sem_filtered_clauses: 0
% 0.44/1.13 num_of_subtypes: 0
% 0.44/1.13 monotx_restored_types: 0
% 0.44/1.13 sat_num_of_epr_types: 0
% 0.44/1.13 sat_num_of_non_cyclic_types: 0
% 0.44/1.13 sat_guarded_non_collapsed_types: 0
% 0.44/1.13 num_pure_diseq_elim: 0
% 0.44/1.13 simp_replaced_by: 0
% 0.44/1.13 res_preprocessed: 0
% 0.44/1.13 sup_preprocessed: 0
% 0.44/1.13 prep_upred: 0
% 0.44/1.13 prep_unflattend: 0
% 0.44/1.13 prep_well_definedness: 0
% 0.44/1.13 smt_new_axioms: 0
% 0.44/1.13 pred_elim_cands: 0
% 0.44/1.13 pred_elim: 0
% 0.44/1.13 pred_elim_cl: 0
% 0.44/1.13 pred_elim_cycles: 0
% 0.44/1.13 merged_defs: 0
% 0.44/1.13 merged_defs_ncl: 0
% 0.44/1.13 bin_hyper_res: 0
% 0.44/1.13 prep_cycles: 1
% 0.44/1.13
% 0.44/1.13 splitting_time: 0.
% 0.44/1.13 sem_filter_time: 0.
% 0.44/1.13 monotx_time: 0.
% 0.44/1.13 subtype_inf_time: 0.
% 0.44/1.13 res_prep_time: 0.
% 0.44/1.13 sup_prep_time: 0.
% 0.44/1.13 pred_elim_time: 0.
% 0.44/1.13 bin_hyper_res_time: 0.
% 0.44/1.13 prep_time_total: 0.001
% 0.44/1.13
% 0.44/1.13 ------ Propositional Solver
% 0.44/1.13
% 0.44/1.13 prop_solver_calls: 4
% 0.44/1.13 prop_fast_solver_calls: 48
% 0.44/1.13 smt_solver_calls: 0
% 0.44/1.13 smt_fast_solver_calls: 0
% 0.44/1.13 prop_num_of_clauses: 37
% 0.44/1.13 prop_preprocess_simplified: 179
% 0.44/1.13 prop_fo_subsumed: 0
% 0.44/1.13
% 0.44/1.13 prop_solver_time: 0.
% 0.44/1.13 prop_fast_solver_time: 0.
% 0.44/1.13 prop_unsat_core_time: 0.
% 0.44/1.13 smt_solver_time: 0.
% 0.44/1.13 smt_fast_solver_time: 0.
% 0.44/1.13
% 0.44/1.13 ------ QBF
% 0.44/1.13
% 0.44/1.13 qbf_q_res: 0
% 0.44/1.13 qbf_num_tautologies: 0
% 0.44/1.13 qbf_prep_cycles: 0
% 0.44/1.13
% 0.44/1.13 ------ BMC1
% 0.44/1.13
% 0.44/1.13 bmc1_current_bound: -1
% 0.44/1.13 bmc1_last_solved_bound: -1
% 0.44/1.13 bmc1_unsat_core_size: -1
% 0.44/1.13 bmc1_unsat_core_parents_size: -1
% 0.44/1.13 bmc1_merge_next_fun: 0
% 0.44/1.13
% 0.44/1.13 bmc1_unsat_core_clauses_time: 0.
% 0.44/1.13
% 0.44/1.13 ------ Instantiation
% 0.44/1.13
% 0.44/1.13 inst_num_of_clauses: undef
% 0.44/1.13 inst_num_in_passive: undef
% 0.44/1.13 inst_num_in_active: 0
% 0.44/1.13 inst_num_of_loops: 0
% 0.44/1.13 inst_num_in_unprocessed: 0
% 0.44/1.13 inst_num_of_learning_restarts: 0
% 0.44/1.13 inst_num_moves_active_passive: 0
% 0.44/1.13 inst_lit_activity: 0
% 0.44/1.13 inst_lit_activity_moves: 0
% 0.44/1.13 inst_num_tautologies: 0
% 0.44/1.13 inst_num_prop_implied: 0
% 0.44/1.13 inst_num_existing_simplified: 0
% 0.44/1.13 inst_num_eq_res_simplified: 0
% 0.44/1.13 inst_num_child_elim: 0
% 0.44/1.13 inst_num_of_dismatching_blockings: 0
% 0.44/1.13 inst_num_of_non_proper_insts: 0
% 0.44/1.13 inst_num_of_duplicates: 0
% 0.44/1.13 inst_inst_num_from_inst_to_res: 0
% 0.44/1.13
% 0.44/1.13 inst_time_sim_new: 0.
% 0.44/1.13 inst_time_sim_given: 0.
% 0.44/1.13 inst_time_dismatching_checking: 0.
% 0.44/1.13 inst_time_total: 0.
% 0.44/1.13
% 0.44/1.13 ------ Resolution
% 0.44/1.13
% 0.44/1.13 res_num_of_clauses: 19
% 0.44/1.13 res_num_in_passive: 9
% 0.44/1.13 res_num_in_active: 0
% 0.44/1.13 res_num_of_loops: 10
% 0.44/1.13 res_forward_subset_subsumed: 0
% 0.44/1.13 res_backward_subset_subsumed: 0
% 0.44/1.13 res_forward_subsumed: 0
% 0.44/1.13 res_backward_subsumed: 0
% 0.44/1.13 res_forward_subsumption_resolution: 0
% 0.44/1.13 res_backward_subsumption_resolution: 1
% 0.44/1.13 res_clause_to_clause_subsumption: 19
% 0.44/1.13 res_subs_bck_cnt: 0
% 0.44/1.13 res_orphan_elimination: 0
% 0.44/1.13 res_tautology_del: 0
% 0.44/1.13 res_num_eq_res_simplified: 0
% 0.44/1.13 res_num_sel_changes: 0
% 0.44/1.13 res_moves_from_active_to_pass: 0
% 0.44/1.13
% 0.44/1.13 res_time_sim_new: 0.
% 0.44/1.13 res_time_sim_fw_given: 0.
% 0.44/1.13 res_time_sim_bw_given: 0.
% 0.44/1.13 res_time_total: 0.
% 0.44/1.13
% 0.44/1.13 ------ Superposition
% 0.44/1.13
% 0.44/1.13 sup_num_of_clauses: undef
% 0.44/1.13 sup_num_in_active: undef
% 0.44/1.13 sup_num_in_passive: undef
% 0.44/1.13 sup_num_of_loops: 0
% 0.44/1.13 sup_fw_superposition: 0
% 0.44/1.13 sup_bw_superposition: 0
% 0.44/1.13 sup_eq_factoring: 0
% 0.44/1.13 sup_eq_resolution: 0
% 0.44/1.13 sup_immediate_simplified: 0
% 0.44/1.13 sup_given_eliminated: 0
% 0.44/1.13 comparisons_done: 16
% 0.44/1.13 comparisons_avoided: 0
% 0.44/1.13 comparisons_inc_criteria: 0
% 0.44/1.13 sup_deep_cl_discarded: 0
% 0.44/1.13 sup_num_of_deepenings: 0
% 0.44/1.13 sup_num_of_restarts: 0
% 0.44/1.13
% 0.44/1.13 sup_time_generating: 0.
% 0.44/1.13 sup_time_sim_fw_full: 0.
% 0.44/1.13 sup_time_sim_bw_full: 0.
% 0.44/1.13 sup_time_sim_fw_immed: 0.
% 0.44/1.13 sup_time_sim_bw_immed: 0.
% 0.44/1.13 sup_time_prep_sim_fw_input: 0.
% 0.44/1.13 sup_time_prep_sim_bw_input: 0.
% 0.44/1.13 sup_time_total: 0.
% 0.44/1.13
% 0.44/1.13 ------ Simplifications
% 0.44/1.13
% 0.44/1.13 sim_repeated: 0
% 0.44/1.13 sim_fw_subset_subsumed: 0
% 0.44/1.13 sim_bw_subset_subsumed: 0
% 0.44/1.13 sim_fw_subsumed: 0
% 0.44/1.13 sim_bw_subsumed: 0
% 0.44/1.13 sim_fw_subsumption_res: 0
% 0.44/1.13 sim_bw_subsumption_res: 0
% 0.44/1.13 sim_fw_unit_subs: 0
% 0.44/1.13 sim_bw_unit_subs: 0
% 0.44/1.13 sim_tautology_del: 0
% 0.44/1.13 sim_eq_tautology_del: 0
% 0.44/1.13 sim_eq_res_simp: 0
% 0.44/1.13 sim_fw_demodulated: 0
% 0.44/1.13 sim_bw_demodulated: 0
% 0.44/1.13 sim_encompassment_demod: 0
% 0.44/1.13 sim_light_normalised: 0
% 0.44/1.13 sim_ac_normalised: 1
% 0.44/1.13 sim_joinable_taut: 0
% 0.44/1.13 sim_joinable_simp: 0
% 0.44/1.13 sim_fw_ac_demod: 0
% 0.44/1.13 sim_bw_ac_demod: 0
% 0.44/1.13 sim_smt_subsumption: 0
% 0.44/1.13 sim_smt_simplified: 0
% 0.44/1.13 sim_ground_joinable: 0
% 0.44/1.13 sim_bw_ground_joinable: 0
% 0.44/1.13 sim_connectedness: 0
% 0.44/1.13
% 0.44/1.13 sim_time_fw_subset_subs: 0.
% 0.44/1.13 sim_time_bw_subset_subs: 0.
% 0.44/1.13 sim_time_fw_subs: 0.
% 0.44/1.13 sim_time_bw_subs: 0.
% 0.44/1.13 sim_time_fw_subs_res: 0.
% 0.44/1.13 sim_time_bw_subs_res: 0.
% 0.44/1.13 sim_time_fw_unit_subs: 0.
% 0.44/1.13 sim_time_bw_unit_subs: 0.
% 0.44/1.13 sim_time_tautology_del: 0.
% 0.44/1.13 sim_time_eq_tautology_del: 0.
% 0.44/1.13 sim_time_eq_res_simp: 0.
% 0.44/1.13 sim_time_fw_demod: 0.
% 0.44/1.13 sim_time_bw_demod: 0.
% 0.44/1.13 sim_time_light_norm: 0.
% 0.44/1.13 sim_time_joinable: 0.
% 0.44/1.13 sim_time_ac_norm: 0.
% 0.44/1.13 sim_time_fw_ac_demod: 0.
% 0.44/1.13 sim_time_bw_ac_demod: 0.
% 0.44/1.13 sim_time_smt_subs: 0.
% 0.44/1.13 sim_time_fw_gjoin: 0.
% 0.44/1.13 sim_time_fw_connected: 0.
% 0.44/1.13
% 0.44/1.13
%------------------------------------------------------------------------------