TSTP Solution File: GRP146-1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : GRP146-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n009.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 Mar 6 09:04:12 EST 2024
% Result : Unsatisfiable 0.99s 1.16s
% Output : Proof 0.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP146-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n009.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 : 300
% 0.12/0.33 % DateTime : Mon Mar 4 08:20:17 EST 2024
% 0.12/0.33 % CPUTime :
% 0.99/1.16 % SZS status Unsatisfiable for theBenchmark
% 0.99/1.16 % SZS output start Proof for theBenchmark
% 0.99/1.16
% 0.99/1.16 % Problem matrix:
% 0.99/1.16 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.99/1.16 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.99/1.16 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.99/1.16 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( multiply(__eqx_0, __eqx_1) = multiply(__eqy_0, __eqy_1)) )).
% 0.99/1.16 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( inverse(__eqx_0) = inverse(__eqy_0)) )).
% 0.99/1.16 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( greatest_lower_bound(__eqx_0, __eqx_1) = greatest_lower_bound(__eqy_0, __eqy_1)) )).
% 0.99/1.16 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( least_upper_bound(__eqx_0, __eqx_1) = least_upper_bound(__eqy_0, __eqy_1)) )).
% 0.99/1.16 cnf(matrix-7, plain, ( ( multiply(identity, X) = X) )).
% 0.99/1.16 cnf(matrix-8, plain, ( ( multiply(inverse(X), X) = identity) )).
% 0.99/1.16 cnf(matrix-9, plain, ( ( multiply(multiply(X, Y), Z) = multiply(X, multiply(Y, Z))) )).
% 0.99/1.16 cnf(matrix-10, plain, ( ( greatest_lower_bound(X, Y) = greatest_lower_bound(Y, X)) )).
% 0.99/1.16 cnf(matrix-11, plain, ( ( least_upper_bound(X, Y) = least_upper_bound(Y, X)) )).
% 0.99/1.16 cnf(matrix-12, plain, ( ( greatest_lower_bound(X, greatest_lower_bound(Y, Z)) = greatest_lower_bound(greatest_lower_bound(X, Y), Z)) )).
% 0.99/1.16 cnf(matrix-13, plain, ( ( least_upper_bound(X, least_upper_bound(Y, Z)) = least_upper_bound(least_upper_bound(X, Y), Z)) )).
% 0.99/1.16 cnf(matrix-14, plain, ( ( least_upper_bound(X, X) = X) )).
% 0.99/1.16 cnf(matrix-15, plain, ( ( greatest_lower_bound(X, X) = X) )).
% 0.99/1.16 cnf(matrix-16, plain, ( ( least_upper_bound(X, greatest_lower_bound(X, Y)) = X) )).
% 0.99/1.16 cnf(matrix-17, plain, ( ( greatest_lower_bound(X, least_upper_bound(X, Y)) = X) )).
% 0.99/1.16 cnf(matrix-18, plain, ( ( multiply(X, least_upper_bound(Y, Z)) = least_upper_bound(multiply(X, Y), multiply(X, Z))) )).
% 0.99/1.16 cnf(matrix-19, plain, ( ( multiply(X, greatest_lower_bound(Y, Z)) = greatest_lower_bound(multiply(X, Y), multiply(X, Z))) )).
% 0.99/1.16 cnf(matrix-20, plain, ( ( multiply(least_upper_bound(Y, Z), X) = least_upper_bound(multiply(Y, X), multiply(Z, X))) )).
% 0.99/1.16 cnf(matrix-21, plain, ( ( multiply(greatest_lower_bound(Y, Z), X) = greatest_lower_bound(multiply(Y, X), multiply(Z, X))) )).
% 0.99/1.16 cnf(matrix-22, plain, ( ( least_upper_bound(a, c) = c) )).
% 0.99/1.16 cnf(matrix-23, plain, ( ( least_upper_bound(b, c) = c) )).
% 0.99/1.16 cnf(matrix-24, plain, ( ( least_upper_bound(least_upper_bound(a, b), c) != c) )).
% 0.99/1.16
% 0.99/1.16 % Proof stack:
% 0.99/1.16 cnf(proof-stack, plain,
% 0.99/1.16 proof_stack(
% 0.99/1.16 start(24),
% 0.99/1.16 left_branch(0, 2, 2, 2),
% 0.99/1.16 left_branch(0, 2, 2, 3),
% 0.99/1.16 left_branch(0, 6, 2, 4),
% 0.99/1.16 left_branch(0, 11, 0, 5),
% 0.99/1.16 right_branch(5),
% 0.99/1.16 left_branch(0, 0, 0, 6),
% 0.99/1.16 right_branch(6),
% 0.99/1.16 right_branch(4),
% 0.99/1.16 left_branch(0, 1, 1, 5),
% 0.99/1.16 left_branch(0, 13, 0, 6),
% 0.99/1.16 right_branch(6),
% 0.99/1.16 right_branch(5),
% 0.99/1.16 right_branch(3),
% 0.99/1.16 left_branch(0, 2, 2, 4),
% 0.99/1.16 left_branch(0, 6, 2, 5),
% 0.99/1.16 left_branch(0, 0, 0, 6),
% 0.99/1.16 right_branch(6),
% 0.99/1.16 left_branch(0, 22, 0, 7),
% 0.99/1.16 right_branch(7),
% 0.99/1.16 right_branch(5),
% 0.99/1.16 left_branch(0, 23, 0, 6),
% 0.99/1.16 right_branch(6),
% 0.99/1.16 right_branch(4),
% 0.99/1.16 right_branch(2)
% 0.99/1.16 )).
% 0.99/1.16 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------