%------------------------------------------------------------------------------
% File     : ConnectPP---0.3.0
% Problem  : NUM016-2 : 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 : 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 : Mon Mar 25 14:26:05 EDT 2024

% Result   : Unsatisfiable 0.13s 0.34s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NUM016-2 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.12  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Wed Mar 20 19:30:59 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.34  % SZS output start Proof for theBenchmark
% 0.13/0.34  
% 0.13/0.34  % Problem matrix:
% 0.13/0.34  cnf(matrix-0, plain, ( ~less(X, X) )).
% 0.13/0.34  cnf(matrix-1, plain, ( ~less(X, Y) | ~less(Y, X) )).
% 0.13/0.34  cnf(matrix-2, plain, ( less(X, factorial_plus_one(X)) )).
% 0.13/0.34  cnf(matrix-3, plain, ( ~divides(X, factorial_plus_one(Y)) | less(Y, X) )).
% 0.13/0.34  cnf(matrix-4, plain, ( prime(X) | divides(prime_divisor(X), X) )).
% 0.13/0.34  cnf(matrix-5, plain, ( prime(X) | prime(prime_divisor(X)) )).
% 0.13/0.34  cnf(matrix-6, plain, ( prime(X) | less(prime_divisor(X), X) )).
% 0.13/0.34  cnf(matrix-7, plain, ( ~prime(X) | ~less(a, X) | less(factorial_plus_one(a), X) )).
% 0.13/0.34  
% 0.13/0.34  % Proof stack:
% 0.13/0.34  cnf(proof-stack, plain, 
% 0.13/0.34  proof_stack(
% 0.13/0.34  start(1), 
% 0.13/0.34  left_branch(0, 7, 2, 2), 
% 0.13/0.34  left_branch(0, 5, 1, 3), 
% 0.13/0.34  left_branch(0, 7, 0, 4), 
% 0.13/0.34  left_branch(0, 1, 1, 5), 
% 0.13/0.34  reduction(0, 3), 
% 0.13/0.34  right_branch(5), 
% 0.13/0.34  left_branch(0, 2, 0, 6), 
% 0.13/0.34  right_branch(6), 
% 0.13/0.34  right_branch(4), 
% 0.13/0.34  right_branch(3), 
% 0.13/0.34  left_branch(0, 3, 1, 4), 
% 0.13/0.34  left_branch(0, 4, 1, 5), 
% 0.13/0.34  left_branch(0, 7, 0, 6), 
% 0.13/0.34  left_branch(0, 0, 0, 7), 
% 0.13/0.34  right_branch(7), 
% 0.13/0.34  left_branch(0, 2, 0, 8), 
% 0.13/0.34  right_branch(8), 
% 0.13/0.34  right_branch(6), 
% 0.13/0.34  right_branch(5), 
% 0.13/0.34  right_branch(4), 
% 0.13/0.34  right_branch(2), 
% 0.13/0.34  left_branch(0, 6, 1, 3), 
% 0.13/0.34  left_branch(0, 7, 0, 4), 
% 0.13/0.34  left_branch(0, 1, 1, 5), 
% 0.13/0.34  reduction(0, 2), 
% 0.13/0.34  right_branch(5), 
% 0.13/0.34  left_branch(0, 2, 0, 6), 
% 0.13/0.34  right_branch(6), 
% 0.13/0.34  right_branch(4), 
% 0.13/0.34  right_branch(3)
% 0.13/0.34  )).
% 0.13/0.34  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------