TSTP Solution File: SWV019-1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SWV019-1 : TPTP v8.2.0. Released v2.4.0.
% 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 : Mon Jun 24 17:08:57 EDT 2024

% Result   : Unsatisfiable 1.78s 1.15s
% Output   : CNFRefutation 1.78s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ( less_than(X0,lower_bound)
    | less_than(upper_bound,X0)
    | in_array_bounds(array,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_bounds) ).

cnf(c_50,plain,
    ( ~ less_than(successor(X0),successor(X1))
    | less_than(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',predecessor_less) ).

cnf(c_51,plain,
    ( ~ less_than(X0,X1)
    | ~ less_than(X1,X2)
    | less_than(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).

cnf(c_52,plain,
    less_than(X0,successor(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_greater) ).

cnf(c_53,plain,
    ( ~ in_array_bounds(array,index_of_maximal)
    | array_value_at(array,index_of_maximal) = maximal_value ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',this_is_maximal) ).

cnf(c_54,plain,
    less_than(index_of_maximal,an_index),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_before_somewhere) ).

cnf(c_55,plain,
    ~ less_than(an_index,lower_bound),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_above_lower_bound) ).

cnf(c_56,plain,
    ~ less_than(upper_bound,an_index),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_below_upper_bound) ).

cnf(c_57,plain,
    ~ less_than(index_of_maximal,lower_bound),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_above_lower_bound) ).

cnf(c_58,negated_conjecture,
    ( array_value_at(array,index_of_maximal) != maximal_value
    | ~ less_than(index_of_maximal,successor(an_index))
    | ~ in_array_bounds(array,index_of_maximal)
    | ~ in_array_bounds(array,an_index)
    | less_than(successor(upper_bound),successor(an_index))
    | less_than(successor(an_index),lower_bound)
    | less_than(index_of_maximal,lower_bound) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(c_62,plain,
    ( less_than(successor(an_index),lower_bound)
    | less_than(successor(upper_bound),successor(an_index))
    | ~ in_array_bounds(array,an_index)
    | ~ in_array_bounds(array,index_of_maximal)
    | ~ less_than(index_of_maximal,successor(an_index)) ),
    inference(global_subsumption_just,[status(thm)],[c_58,c_57,c_53,c_58]) ).

cnf(c_63,negated_conjecture,
    ( ~ less_than(index_of_maximal,successor(an_index))
    | ~ in_array_bounds(array,index_of_maximal)
    | ~ in_array_bounds(array,an_index)
    | less_than(successor(upper_bound),successor(an_index))
    | less_than(successor(an_index),lower_bound) ),
    inference(renaming,[status(thm)],[c_62]) ).

cnf(c_139,plain,
    successor(an_index) = sP0_iProver_def,
    definition ).

cnf(c_140,plain,
    successor(upper_bound) = sP1_iProver_def,
    definition ).

cnf(c_141,negated_conjecture,
    ( ~ less_than(index_of_maximal,sP0_iProver_def)
    | ~ in_array_bounds(array,index_of_maximal)
    | ~ in_array_bounds(array,an_index)
    | less_than(sP0_iProver_def,lower_bound)
    | less_than(sP1_iProver_def,sP0_iProver_def) ),
    inference(demodulation,[status(thm)],[c_63,c_140,c_139]) ).

cnf(c_316,plain,
    less_than(an_index,sP0_iProver_def),
    inference(superposition,[status(thm)],[c_139,c_52]) ).

cnf(c_337,plain,
    ( ~ less_than(sP1_iProver_def,successor(X0))
    | less_than(upper_bound,X0) ),
    inference(superposition,[status(thm)],[c_140,c_50]) ).

cnf(c_366,plain,
    ( ~ less_than(X0,index_of_maximal)
    | less_than(X0,an_index) ),
    inference(superposition,[status(thm)],[c_54,c_51]) ).

cnf(c_367,plain,
    ( ~ less_than(X0,an_index)
    | less_than(X0,sP0_iProver_def) ),
    inference(superposition,[status(thm)],[c_316,c_51]) ).

cnf(c_374,plain,
    ( ~ less_than(index_of_maximal,an_index)
    | less_than(index_of_maximal,sP0_iProver_def) ),
    inference(instantiation,[status(thm)],[c_367]) ).

cnf(c_387,plain,
    less_than(index_of_maximal,sP0_iProver_def),
    inference(superposition,[status(thm)],[c_54,c_367]) ).

cnf(c_388,plain,
    ( ~ in_array_bounds(array,index_of_maximal)
    | ~ in_array_bounds(array,an_index)
    | less_than(sP0_iProver_def,lower_bound)
    | less_than(sP1_iProver_def,sP0_iProver_def) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_141,c_387]) ).

cnf(c_404,plain,
    ( ~ in_array_bounds(array,an_index)
    | less_than(upper_bound,index_of_maximal)
    | less_than(index_of_maximal,lower_bound)
    | less_than(sP0_iProver_def,lower_bound)
    | less_than(sP1_iProver_def,sP0_iProver_def) ),
    inference(superposition,[status(thm)],[c_49,c_388]) ).

cnf(c_405,plain,
    ( ~ in_array_bounds(array,an_index)
    | less_than(upper_bound,index_of_maximal)
    | less_than(sP0_iProver_def,lower_bound)
    | less_than(sP1_iProver_def,sP0_iProver_def) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_404,c_57]) ).

cnf(c_420,plain,
    ( less_than(upper_bound,index_of_maximal)
    | less_than(upper_bound,an_index)
    | less_than(an_index,lower_bound)
    | less_than(sP0_iProver_def,lower_bound)
    | less_than(sP1_iProver_def,sP0_iProver_def) ),
    inference(superposition,[status(thm)],[c_49,c_405]) ).

cnf(c_421,plain,
    ( less_than(upper_bound,index_of_maximal)
    | less_than(sP0_iProver_def,lower_bound)
    | less_than(sP1_iProver_def,sP0_iProver_def) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_420,c_55,c_56]) ).

cnf(c_435,plain,
    ( less_than(upper_bound,an_index)
    | less_than(sP0_iProver_def,lower_bound)
    | less_than(sP1_iProver_def,sP0_iProver_def) ),
    inference(superposition,[status(thm)],[c_421,c_366]) ).

cnf(c_436,plain,
    ( less_than(sP0_iProver_def,lower_bound)
    | less_than(sP1_iProver_def,sP0_iProver_def) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_435,c_56]) ).

cnf(c_505,plain,
    ( ~ less_than(sP1_iProver_def,sP0_iProver_def)
    | less_than(upper_bound,an_index) ),
    inference(superposition,[status(thm)],[c_139,c_337]) ).

cnf(c_509,plain,
    ~ less_than(sP1_iProver_def,sP0_iProver_def),
    inference(forward_subsumption_resolution,[status(thm)],[c_505,c_56]) ).

cnf(c_510,plain,
    less_than(sP0_iProver_def,lower_bound),
    inference(backward_subsumption_resolution,[status(thm)],[c_436,c_509]) ).

cnf(c_511,plain,
    ( ~ less_than(X0,sP0_iProver_def)
    | less_than(X0,lower_bound) ),
    inference(superposition,[status(thm)],[c_510,c_51]) ).

cnf(c_514,plain,
    ( ~ less_than(index_of_maximal,sP0_iProver_def)
    | less_than(index_of_maximal,lower_bound) ),
    inference(instantiation,[status(thm)],[c_511]) ).

cnf(c_515,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_514,c_374,c_57,c_54]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWV019-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.11  % Command  : run_iprover %s %d THM
% 0.10/0.32  % Computer : n021.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 300
% 0.10/0.32  % DateTime : Thu Jun 20 15:12:09 EDT 2024
% 0.10/0.32  % CPUTime  : 
% 0.18/0.45  Running first-order theorem proving
% 0.18/0.45  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
% 1.78/1.15  % SZS status Started for theBenchmark.p
% 1.78/1.15  % SZS status Unsatisfiable for theBenchmark.p
% 1.78/1.15  
% 1.78/1.15  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.78/1.15  
% 1.78/1.15  ------  iProver source info
% 1.78/1.15  
% 1.78/1.15  git: date: 2024-06-12 09:56:46 +0000
% 1.78/1.15  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 1.78/1.15  git: non_committed_changes: false
% 1.78/1.15  
% 1.78/1.15  ------ Parsing...successful
% 1.78/1.15  
% 1.78/1.15  
% 1.78/1.15  
% 1.78/1.15  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 1.78/1.15  
% 1.78/1.15  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.78/1.15  
% 1.78/1.15  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.78/1.15  ------ Proving...
% 1.78/1.15  ------ Problem Properties 
% 1.78/1.15  
% 1.78/1.15  
% 1.78/1.15  clauses                                 12
% 1.78/1.15  conjectures                             1
% 1.78/1.15  EPR                                     7
% 1.78/1.15  Horn                                    10
% 1.78/1.15  unary                                   7
% 1.78/1.15  binary                                  2
% 1.78/1.15  lits                                    22
% 1.78/1.15  lits eq                                 3
% 1.78/1.15  fd_pure                                 0
% 1.78/1.15  fd_pseudo                               0
% 1.78/1.15  fd_cond                                 0
% 1.78/1.15  fd_pseudo_cond                          0
% 1.78/1.15  AC symbols                              0
% 1.78/1.15  
% 1.78/1.15  ------ Schedule dynamic 5 is on 
% 1.78/1.15  
% 1.78/1.15  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.78/1.15  
% 1.78/1.15  
% 1.78/1.15  ------ 
% 1.78/1.15  Current options:
% 1.78/1.15  ------ 
% 1.78/1.15  
% 1.78/1.15  
% 1.78/1.15  
% 1.78/1.15  
% 1.78/1.15  ------ Proving...
% 1.78/1.15  
% 1.78/1.15  
% 1.78/1.15  % SZS status Unsatisfiable for theBenchmark.p
% 1.78/1.15  
% 1.78/1.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.78/1.15  
% 1.78/1.15  
%------------------------------------------------------------------------------