%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n008.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 : 600s % DateTime : Wed Jul 20 19:45:18 EDT 2022 % Result : Unsatisfiable 0.12s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWV019-1 : TPTP v8.1.0. Released v2.4.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n008.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 14 22:28:37 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.37 % SZS status Unsatisfiable % 0.12/0.37 % SZS output begin IncompleteProof % 0.12/0.37 cnf(c0, axiom, % 0.12/0.37 maximal_value != array_value_at(array,index_of_maximal) | ~in_array_bounds(array,index_of_maximal) | ~less_than(index_of_maximal,successor(an_index)) | less_than(index_of_maximal,lower_bound) | less_than(successor(upper_bound),successor(an_index)) | less_than(successor(an_index),lower_bound) | ~in_array_bounds(array,an_index)). % 0.12/0.37 cnf(c1, plain, % 0.12/0.37 maximal_value != array_value_at(array,index_of_maximal) | ~in_array_bounds(array,index_of_maximal) | ~less_than(index_of_maximal,successor(an_index)) | less_than(index_of_maximal,lower_bound) | less_than(successor(upper_bound),successor(an_index)) | less_than(successor(an_index),lower_bound) | ~in_array_bounds(array,an_index), % 0.12/0.37 inference(start, [], [c0])). % 0.12/0.37 % 0.12/0.37 cnf(c2, axiom, % 0.12/0.37 maximal_value = array_value_at(array,index_of_maximal) | ~in_array_bounds(array,index_of_maximal)). % 0.12/0.37 cnf(a0, assumption, % 0.12/0.37 array_value_at(array,index_of_maximal) = array_value_at(array,index_of_maximal)). % 0.12/0.37 cnf(c3, plain, % 0.12/0.37 ~in_array_bounds(array,index_of_maximal) | ~less_than(index_of_maximal,successor(an_index)) | less_than(index_of_maximal,lower_bound) | less_than(successor(upper_bound),successor(an_index)) | less_than(successor(an_index),lower_bound) | ~in_array_bounds(array,an_index), % 0.12/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.37 cnf(c4, plain, % 0.12/0.37 ~in_array_bounds(array,index_of_maximal), % 0.12/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.37 cnf(c5, plain, % 0.12/0.37 X0 != maximal_value | maximal_value != X0, % 0.12/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.37 % 0.12/0.37 cnf(a1, assumption, % 0.12/0.37 X0 = maximal_value). % 0.12/0.37 cnf(c6, plain, % 0.12/0.37 maximal_value != X0, % 0.12/0.37 inference(reflexivity, [assumptions([a1])], [c5])). % 0.12/0.37 % 0.12/0.37 cnf(a2, assumption, % 0.12/0.37 maximal_value = X0). % 0.12/0.37 cnf(c7, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(reflexivity, [assumptions([a2])], [c6])). % 0.12/0.37 % 0.12/0.37 cnf(c8, axiom, % 0.12/0.37 in_array_bounds(array,X1) | less_than(upper_bound,X1) | less_than(X1,lower_bound)). % 0.12/0.37 cnf(a3, assumption, % 0.12/0.37 array = array). % 0.12/0.37 cnf(a4, assumption, % 0.12/0.37 index_of_maximal = X1). % 0.12/0.37 cnf(c9, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])). % 0.12/0.37 cnf(c10, plain, % 0.12/0.37 less_than(upper_bound,X1) | less_than(X1,lower_bound), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])). % 0.12/0.37 % 0.12/0.37 cnf(c11, axiom, % 0.12/0.37 less_than(X2,X3) | ~less_than(X4,X3) | ~less_than(X2,X4)). % 0.12/0.37 cnf(a5, assumption, % 0.12/0.37 upper_bound = X2). % 0.12/0.37 cnf(a6, assumption, % 0.12/0.37 X1 = X4). % 0.12/0.37 cnf(c12, plain, % 0.12/0.37 less_than(X1,lower_bound), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.12/0.37 cnf(c13, plain, % 0.12/0.37 less_than(X2,X3) | ~less_than(X4,X3), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.12/0.37 % 0.12/0.37 cnf(c14, axiom, % 0.12/0.37 ~less_than(upper_bound,an_index)). % 0.12/0.37 cnf(a7, assumption, % 0.12/0.37 X2 = upper_bound). % 0.12/0.37 cnf(a8, assumption, % 0.12/0.37 X3 = an_index). % 0.12/0.37 cnf(c15, plain, % 0.12/0.37 ~less_than(X4,X3), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.12/0.37 cnf(c16, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.12/0.37 % 0.12/0.37 cnf(c17, axiom, % 0.12/0.37 less_than(index_of_maximal,an_index)). % 0.12/0.37 cnf(a9, assumption, % 0.12/0.37 X4 = index_of_maximal). % 0.12/0.37 cnf(a10, assumption, % 0.12/0.37 X3 = an_index). % 0.12/0.37 cnf(c18, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])). % 0.12/0.37 cnf(c19, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])). % 0.12/0.37 % 0.12/0.37 cnf(c20, axiom, % 0.12/0.37 ~less_than(index_of_maximal,lower_bound)). % 0.12/0.37 cnf(a11, assumption, % 0.12/0.37 X1 = index_of_maximal). % 0.12/0.37 cnf(a12, assumption, % 0.12/0.37 lower_bound = lower_bound). % 0.12/0.37 cnf(c21, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a11, a12])], [c12, c20])). % 0.12/0.37 cnf(c22, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a11, a12])], [c12, c20])). % 0.12/0.37 % 0.12/0.37 cnf(c23, plain, % 0.12/0.37 in_array_bounds(array,index_of_maximal)). % 0.12/0.37 cnf(a13, assumption, % 0.12/0.37 array = array). % 0.12/0.37 cnf(a14, assumption, % 0.12/0.37 index_of_maximal = index_of_maximal). % 0.12/0.37 cnf(c24, plain, % 0.12/0.37 ~less_than(index_of_maximal,successor(an_index)) | less_than(index_of_maximal,lower_bound) | less_than(successor(upper_bound),successor(an_index)) | less_than(successor(an_index),lower_bound) | ~in_array_bounds(array,an_index), % 0.12/0.37 inference(predicate_reduction, [assumptions([a13, a14])], [c3, c23])). % 0.12/0.37 % 0.12/0.37 cnf(c25, axiom, % 0.12/0.37 less_than(X5,X6) | ~less_than(X7,X6) | ~less_than(X5,X7)). % 0.12/0.37 cnf(a15, assumption, % 0.12/0.37 index_of_maximal = X5). % 0.12/0.37 cnf(a16, assumption, % 0.12/0.37 successor(an_index) = X6). % 0.12/0.37 cnf(c26, plain, % 0.12/0.37 less_than(index_of_maximal,lower_bound) | less_than(successor(upper_bound),successor(an_index)) | less_than(successor(an_index),lower_bound) | ~in_array_bounds(array,an_index), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c24, c25])). % 0.12/0.37 cnf(c27, plain, % 0.12/0.37 ~less_than(X7,X6) | ~less_than(X5,X7), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c24, c25])). % 0.12/0.37 % 0.12/0.37 cnf(c28, axiom, % 0.12/0.37 less_than(X8,successor(X8))). % 0.12/0.37 cnf(a17, assumption, % 0.12/0.37 X7 = X8). % 0.12/0.37 cnf(a18, assumption, % 0.12/0.37 X6 = successor(X8)). % 0.12/0.37 cnf(c29, plain, % 0.12/0.37 ~less_than(X5,X7), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a17, a18])], [c27, c28])). % 0.12/0.37 cnf(c30, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a17, a18])], [c27, c28])). % 0.12/0.37 % 0.12/0.37 cnf(c31, plain, % 0.12/0.37 less_than(X4,X3)). % 0.12/0.37 cnf(a19, assumption, % 0.12/0.37 X5 = X4). % 0.12/0.37 cnf(a20, assumption, % 0.12/0.37 X7 = X3). % 0.12/0.37 cnf(c32, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(predicate_reduction, [assumptions([a19, a20])], [c29, c31])). % 0.12/0.37 % 0.12/0.37 cnf(c33, plain, % 0.12/0.37 ~less_than(X1,lower_bound)). % 0.12/0.37 cnf(a21, assumption, % 0.12/0.37 index_of_maximal = X1). % 0.12/0.37 cnf(a22, assumption, % 0.12/0.37 lower_bound = lower_bound). % 0.12/0.37 cnf(c34, plain, % 0.12/0.37 less_than(successor(upper_bound),successor(an_index)) | less_than(successor(an_index),lower_bound) | ~in_array_bounds(array,an_index), % 0.12/0.37 inference(predicate_reduction, [assumptions([a21, a22])], [c26, c33])). % 0.12/0.37 % 0.12/0.37 cnf(c35, axiom, % 0.12/0.37 less_than(X9,X10) | ~less_than(successor(X9),successor(X10))). % 0.12/0.37 cnf(a23, assumption, % 0.12/0.37 successor(upper_bound) = successor(X9)). % 0.12/0.37 cnf(a24, assumption, % 0.12/0.37 successor(an_index) = successor(X10)). % 0.12/0.37 cnf(c36, plain, % 0.12/0.37 less_than(successor(an_index),lower_bound) | ~in_array_bounds(array,an_index), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a23, a24])], [c34, c35])). % 0.12/0.37 cnf(c37, plain, % 0.12/0.37 less_than(X9,X10), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a23, a24])], [c34, c35])). % 0.12/0.37 % 0.12/0.37 cnf(c38, plain, % 0.12/0.37 ~less_than(X2,X3)). % 0.12/0.37 cnf(a25, assumption, % 0.12/0.37 X9 = X2). % 0.12/0.37 cnf(a26, assumption, % 0.12/0.37 X10 = X3). % 0.12/0.37 cnf(c39, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(predicate_reduction, [assumptions([a25, a26])], [c37, c38])). % 0.12/0.37 % 0.12/0.37 cnf(c40, axiom, % 0.12/0.37 less_than(X11,X12) | ~less_than(X13,X12) | ~less_than(X11,X13)). % 0.12/0.37 cnf(a27, assumption, % 0.12/0.37 successor(an_index) = X13). % 0.12/0.37 cnf(a28, assumption, % 0.12/0.37 lower_bound = X12). % 0.12/0.37 cnf(c41, plain, % 0.12/0.37 ~in_array_bounds(array,an_index), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a27, a28])], [c36, c40])). % 0.12/0.37 cnf(c42, plain, % 0.12/0.37 less_than(X11,X12) | ~less_than(X11,X13), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a27, a28])], [c36, c40])). % 0.12/0.37 % 0.12/0.37 cnf(c43, plain, % 0.12/0.37 ~less_than(X1,lower_bound)). % 0.12/0.37 cnf(a29, assumption, % 0.12/0.37 X11 = X1). % 0.12/0.37 cnf(a30, assumption, % 0.12/0.37 X12 = lower_bound). % 0.12/0.37 cnf(c44, plain, % 0.12/0.37 ~less_than(X11,X13), % 0.12/0.37 inference(predicate_reduction, [assumptions([a29, a30])], [c42, c43])). % 0.12/0.37 % 0.12/0.37 cnf(c45, plain, % 0.12/0.37 less_than(index_of_maximal,successor(an_index))). % 0.12/0.37 cnf(a31, assumption, % 0.12/0.37 X11 = index_of_maximal). % 0.12/0.37 cnf(a32, assumption, % 0.12/0.37 X13 = successor(an_index)). % 0.12/0.37 cnf(c46, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(predicate_reduction, [assumptions([a31, a32])], [c44, c45])). % 0.12/0.37 % 0.12/0.37 cnf(c47, axiom, % 0.12/0.37 in_array_bounds(array,X14) | less_than(upper_bound,X14) | less_than(X14,lower_bound)). % 0.12/0.37 cnf(a33, assumption, % 0.12/0.37 array = array). % 0.12/0.37 cnf(a34, assumption, % 0.12/0.37 an_index = X14). % 0.12/0.37 cnf(c48, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a33, a34])], [c41, c47])). % 0.12/0.37 cnf(c49, plain, % 0.12/0.37 less_than(upper_bound,X14) | less_than(X14,lower_bound), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a33, a34])], [c41, c47])). % 0.12/0.37 % 0.12/0.37 cnf(c50, plain, % 0.12/0.37 ~less_than(X2,X3)). % 0.12/0.37 cnf(a35, assumption, % 0.12/0.37 upper_bound = X2). % 0.12/0.37 cnf(a36, assumption, % 0.12/0.37 X14 = X3). % 0.12/0.37 cnf(c51, plain, % 0.12/0.37 less_than(X14,lower_bound), % 0.12/0.37 inference(predicate_reduction, [assumptions([a35, a36])], [c49, c50])). % 0.12/0.37 % 0.12/0.37 cnf(c52, axiom, % 0.12/0.37 ~less_than(an_index,lower_bound)). % 0.12/0.37 cnf(a37, assumption, % 0.12/0.37 X14 = an_index). % 0.12/0.37 cnf(a38, assumption, % 0.12/0.37 lower_bound = lower_bound). % 0.12/0.37 cnf(c53, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a37, a38])], [c51, c52])). % 0.12/0.37 cnf(c54, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a37, a38])], [c51, c52])). % 0.12/0.37 % 0.12/0.37 cnf(c55, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(constraint_solving, [ % 0.12/0.37 bind(X0, maximal_value), % 0.12/0.37 bind(X1, index_of_maximal), % 0.12/0.37 bind(X2, upper_bound), % 0.12/0.37 bind(X3, an_index), % 0.12/0.37 bind(X4, index_of_maximal), % 0.12/0.37 bind(X5, index_of_maximal), % 0.12/0.37 bind(X6, successor(an_index)), % 0.12/0.37 bind(X7, an_index), % 0.12/0.37 bind(X8, an_index), % 0.12/0.37 bind(X9, upper_bound), % 0.12/0.37 bind(X10, an_index), % 0.12/0.37 bind(X11, index_of_maximal), % 0.12/0.37 bind(X12, lower_bound), % 0.12/0.37 bind(X13, successor(an_index)), % 0.12/0.37 bind(X14, an_index) % 0.12/0.37 ], % 0.12/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30, a31, a32, a33, a34, a35, a36, a37, a38])). % 0.12/0.37 % 0.12/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------