%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : NUM024-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s

% Computer : n032.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:14:52 EST 2024

% Result   : Unsatisfiable 1.11s 1.28s
% Output   : Proof 1.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : NUM024-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.05/0.09  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 300
% 0.09/0.28  % DateTime : Sun Mar  3 16:36:08 EST 2024
% 0.09/0.28  % CPUTime  : 
% 1.11/1.28  % SZS status Unsatisfiable for theBenchmark
% 1.11/1.28  % SZS output start Proof for theBenchmark
% 1.11/1.28  
% 1.11/1.28  % Problem matrix:
% 1.11/1.28  cnf(matrix-0, plain, ( equalish(add(A, n0), A) )).
% 1.11/1.28  cnf(matrix-1, plain, ( equalish(add(A, successor(B)), successor(add(A, B))) )).
% 1.11/1.28  cnf(matrix-2, plain, ( equalish(multiply(A, n0), n0) )).
% 1.11/1.28  cnf(matrix-3, plain, ( equalish(multiply(A, successor(B)), add(multiply(A, B), A)) )).
% 1.11/1.28  cnf(matrix-4, plain, ( ~equalish(successor(A), successor(B)) | equalish(A, B) )).
% 1.11/1.28  cnf(matrix-5, plain, ( ~equalish(A, B) | equalish(successor(A), successor(B)) )).
% 1.11/1.28  cnf(matrix-6, plain, ( ~less(A, B) | ~less(C, A) | less(C, B) )).
% 1.11/1.28  cnf(matrix-7, plain, ( ~equalish(add(successor(A), B), C) | less(B, C) )).
% 1.11/1.28  cnf(matrix-8, plain, ( ~less(A, B) | equalish(add(successor(predecessor_of_1st_minus_2nd(B, A)), A), B) )).
% 1.11/1.28  cnf(matrix-9, plain, ( equalish(X, X) )).
% 1.11/1.28  cnf(matrix-10, plain, ( ~equalish(X, Y) | equalish(Y, X) )).
% 1.11/1.28  cnf(matrix-11, plain, ( ~equalish(X, Y) | ~equalish(Y, Z) | equalish(X, Z) )).
% 1.11/1.28  cnf(matrix-12, plain, ( ~equalish(add(A, B), add(C, B)) | equalish(A, C) )).
% 1.11/1.28  cnf(matrix-13, plain, ( equalish(add(A, B), add(B, A)) )).
% 1.11/1.28  cnf(matrix-14, plain, ( less(a, a) )).
% 1.11/1.28  cnf(matrix-15, plain, ( ~equalish(successor(A), n0) )).
% 1.11/1.28  
% 1.11/1.28  % Proof stack:
% 1.11/1.28  cnf(proof-stack, plain, 
% 1.11/1.28  proof_stack(
% 1.11/1.28  start(15), 
% 1.11/1.28  left_branch(0, 12, 1, 2), 
% 1.11/1.28  left_branch(0, 11, 2, 3), 
% 1.11/1.28  left_branch(0, 11, 2, 4), 
% 1.11/1.28  left_branch(0, 8, 1, 5), 
% 1.11/1.28  left_branch(0, 14, 0, 6), 
% 1.11/1.28  right_branch(6), 
% 1.11/1.28  right_branch(5), 
% 1.11/1.28  left_branch(0, 12, 1, 6), 
% 1.11/1.28  left_branch(0, 13, 0, 7), 
% 1.11/1.28  right_branch(7), 
% 1.11/1.28  right_branch(6), 
% 1.11/1.28  right_branch(4), 
% 1.11/1.28  left_branch(0, 11, 2, 5), 
% 1.11/1.28  left_branch(0, 10, 1, 6), 
% 1.11/1.28  left_branch(0, 0, 0, 7), 
% 1.11/1.28  right_branch(7), 
% 1.11/1.28  right_branch(6), 
% 1.11/1.28  left_branch(0, 13, 0, 7), 
% 1.11/1.28  right_branch(7), 
% 1.11/1.28  right_branch(5), 
% 1.11/1.28  right_branch(3), 
% 1.11/1.28  right_branch(2)
% 1.11/1.28  )).
% 1.11/1.28  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------