TSTP Solution File: SWV007-1 by ConnectPP---0.3.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.3.0
% Problem  : SWV007-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s

% Computer : n016.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:36 EDT 2024

% Result   : Unsatisfiable 0.47s 0.64s
% Output   : Proof 0.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : SWV007-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.12  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33  % Computer : n016.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 : Thu Mar 21 08:31:40 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.47/0.64  % SZS status Unsatisfiable for theBenchmark
% 0.47/0.64  % SZS output start Proof for theBenchmark
% 0.47/0.64  
% 0.47/0.64  % Problem matrix:
% 0.47/0.64  cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.47/0.64  cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.47/0.64  cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.47/0.64  cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( successor(__eqx_0) = successor(__eqy_0)) )).
% 0.47/0.64  cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( predecessor(__eqx_0) = predecessor(__eqy_0)) )).
% 0.47/0.64  cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( a(__eqx_0) = a(__eqy_0)) )).
% 0.47/0.64  cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~less_than(__eqx_0, __eqx_1) | less_than(__eqy_0, __eqy_1) )).
% 0.47/0.64  cnf(matrix-7, plain, ( ( predecessor(successor(X)) = X) )).
% 0.47/0.64  cnf(matrix-8, plain, ( ( successor(predecessor(X)) = X) )).
% 0.47/0.64  cnf(matrix-9, plain, ( ( X = Y) | ( predecessor(X) != predecessor(Y)) )).
% 0.47/0.64  cnf(matrix-10, plain, ( ( X = Y) | ( successor(X) != successor(Y)) )).
% 0.47/0.64  cnf(matrix-11, plain, ( less_than(predecessor(X), X) )).
% 0.47/0.64  cnf(matrix-12, plain, ( less_than(X, successor(X)) )).
% 0.47/0.64  cnf(matrix-13, plain, ( less_than(X, Z) | ~less_than(X, Y) | ~less_than(Y, Z) )).
% 0.47/0.64  cnf(matrix-14, plain, ( less_than(X, Y) | less_than(Y, X) | ( X = Y) )).
% 0.47/0.64  cnf(matrix-15, plain, ( ~less_than(X, X) )).
% 0.47/0.64  cnf(matrix-16, plain, ( ~less_than(X, Y) | ~less_than(Y, X) )).
% 0.47/0.64  cnf(matrix-17, plain, ( less_than(Y, Z) | ( X != Y) | ~less_than(X, Z) )).
% 0.47/0.64  cnf(matrix-18, plain, ( less_than(Z, Y) | ( X != Y) | ~less_than(Z, X) )).
% 0.47/0.64  cnf(matrix-19, plain, ( ~less_than(n, k) )).
% 0.47/0.64  cnf(matrix-20, plain, ( ~less_than(k, i) )).
% 0.47/0.64  cnf(matrix-21, plain, ( less_than(i, n) )).
% 0.47/0.64  cnf(matrix-22, plain, ( ~less_than(n, m) )).
% 0.47/0.64  cnf(matrix-23, plain, ( less_than(i, m) )).
% 0.47/0.64  cnf(matrix-24, plain, ( ~less_than(i, one) )).
% 0.47/0.64  cnf(matrix-25, plain, ( ( k != m) )).
% 0.47/0.64  cnf(matrix-26, plain, ( less_than(a(m), a(k)) )).
% 0.47/0.64  cnf(matrix-27, plain, ( ~less_than(one, X) | ~less_than(X, i) | ~less_than(a(X), a(predecessor(X))) )).
% 0.47/0.64  cnf(matrix-28, plain, ( less_than(X, i) | less_than(n, X) | ~less_than(one, X) | ~less_than(a(X), a(predecessor(i))) )).
% 0.47/0.64  cnf(matrix-29, plain, ( less_than(X, i) | ~less_than(X, successor(n)) | ~less_than(a(X), a(k)) )).
% 0.47/0.64  
% 0.47/0.64  % Proof stack:
% 0.47/0.64  cnf(proof-stack, plain, 
% 0.47/0.64  proof_stack(
% 0.47/0.64  start(16), 
% 0.47/0.64  left_branch(0, 29, 0, 2), 
% 0.47/0.64  left_branch(0, 26, 0, 3), 
% 0.47/0.64  right_branch(3), 
% 0.47/0.64  left_branch(0, 14, 1, 4), 
% 0.47/0.64  left_branch(0, 13, 2, 5), 
% 0.47/0.64  left_branch(0, 22, 0, 6), 
% 0.47/0.64  right_branch(6), 
% 0.47/0.64  left_branch(0, 12, 0, 7), 
% 0.47/0.64  right_branch(7), 
% 0.47/0.64  right_branch(5), 
% 0.47/0.64  left_branch(0, 18, 1, 6), 
% 0.47/0.64  left_branch(0, 22, 0, 7), 
% 0.47/0.64  right_branch(7), 
% 0.47/0.64  left_branch(0, 12, 0, 8), 
% 0.47/0.64  right_branch(8), 
% 0.47/0.64  right_branch(6), 
% 0.47/0.64  right_branch(4), 
% 0.47/0.64  right_branch(2), 
% 0.47/0.64  left_branch(0, 23, 0, 3), 
% 0.47/0.64  right_branch(3)
% 0.47/0.64  )).
% 0.47/0.64  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------