TSTP Solution File: SWV019-1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SWV019-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n011.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 Mar 25 14:37:37 EDT 2024
% Result : Unsatisfiable 0.13s 0.36s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV019-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34 % Computer : n011.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 : Thu Mar 21 07:33:13 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.36 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.36 % SZS output start Proof for theBenchmark
% 0.13/0.36
% 0.13/0.36 % Problem matrix:
% 0.13/0.36 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.36 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.36 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.36 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( successor(__eqx_0) = successor(__eqy_0)) )).
% 0.13/0.36 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( array_value_at(__eqx_0, __eqx_1) = array_value_at(__eqy_0, __eqy_1)) )).
% 0.13/0.36 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~less_than(__eqx_0, __eqx_1) | less_than(__eqy_0, __eqy_1) )).
% 0.13/0.36 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in_array_bounds(__eqx_0, __eqx_1) | in_array_bounds(__eqy_0, __eqy_1) )).
% 0.13/0.36 cnf(matrix-7, plain, ( less_than(X1, lower_bound) | less_than(upper_bound, X1) | in_array_bounds(array, X1) )).
% 0.13/0.36 cnf(matrix-8, plain, ( ~less_than(successor(X), successor(Y)) | less_than(X, Y) )).
% 0.13/0.36 cnf(matrix-9, plain, ( ~less_than(X, Y) | ~less_than(Y, Z) | less_than(X, Z) )).
% 0.13/0.36 cnf(matrix-10, plain, ( less_than(X, successor(X)) )).
% 0.13/0.36 cnf(matrix-11, plain, ( ~in_array_bounds(array, index_of_maximal) | ( maximal_value = array_value_at(array, index_of_maximal)) )).
% 0.13/0.36 cnf(matrix-12, plain, ( less_than(index_of_maximal, an_index) )).
% 0.13/0.36 cnf(matrix-13, plain, ( ~less_than(an_index, lower_bound) )).
% 0.13/0.36 cnf(matrix-14, plain, ( ~less_than(upper_bound, an_index) )).
% 0.13/0.36 cnf(matrix-15, plain, ( ~less_than(index_of_maximal, lower_bound) )).
% 0.13/0.36 cnf(matrix-16, plain, ( ~in_array_bounds(array, an_index) | less_than(successor(an_index), lower_bound) | less_than(successor(upper_bound), successor(an_index)) | less_than(index_of_maximal, lower_bound) | ~less_than(index_of_maximal, successor(an_index)) | ~in_array_bounds(array, index_of_maximal) | ( maximal_value != array_value_at(array, index_of_maximal)) )).
% 0.13/0.36
% 0.13/0.36 % Proof stack:
% 0.13/0.36 cnf(proof-stack, plain,
% 0.13/0.36 proof_stack(
% 0.13/0.36 start(15),
% 0.13/0.36 left_branch(0, 16, 3, 2),
% 0.13/0.36 left_branch(0, 7, 2, 3),
% 0.13/0.36 left_branch(0, 13, 0, 4),
% 0.13/0.36 right_branch(4),
% 0.13/0.36 left_branch(0, 14, 0, 5),
% 0.13/0.36 right_branch(5),
% 0.13/0.36 right_branch(3),
% 0.13/0.36 left_branch(0, 7, 2, 4),
% 0.13/0.36 reduction(0, 0),
% 0.13/0.36 left_branch(0, 9, 0, 6),
% 0.13/0.36 left_branch(0, 14, 0, 7),
% 0.13/0.36 right_branch(7),
% 0.13/0.36 left_branch(0, 12, 0, 8),
% 0.13/0.36 right_branch(8),
% 0.13/0.36 right_branch(6),
% 0.13/0.36 right_branch(4),
% 0.13/0.36 left_branch(0, 9, 2, 5),
% 0.13/0.36 left_branch(0, 12, 0, 6),
% 0.13/0.36 right_branch(6),
% 0.13/0.36 left_branch(0, 10, 0, 7),
% 0.13/0.36 right_branch(7),
% 0.13/0.36 right_branch(5),
% 0.13/0.36 left_branch(0, 11, 1, 6),
% 0.13/0.36 lemmata(0, 1),
% 0.13/0.36 right_branch(6),
% 0.13/0.36 left_branch(0, 8, 0, 7),
% 0.13/0.36 left_branch(0, 14, 0, 8),
% 0.13/0.36 right_branch(8),
% 0.13/0.36 right_branch(7),
% 0.13/0.36 left_branch(0, 9, 1, 8),
% 0.13/0.36 left_branch(0, 10, 0, 9),
% 0.13/0.36 right_branch(9),
% 0.13/0.36 left_branch(0, 13, 0, 10),
% 0.13/0.36 right_branch(10),
% 0.13/0.36 right_branch(8),
% 0.13/0.36 right_branch(2)
% 0.13/0.36 )).
% 0.13/0.36 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------