%------------------------------------------------------------------------------
% File     : ConnectPP---0.3.0
% Problem  : COM001-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 : n014.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:01:47 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.11/0.12  % Problem  : COM001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34  % Computer : n014.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 09:00:15 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, ( succeeds(Goal_state, Start_state) | ~follows(Goal_state, Start_state) )).
% 0.13/0.34  cnf(matrix-1, plain, ( succeeds(Goal_state, Start_state) | ~succeeds(Goal_state, Intermediate_state) | ~succeeds(Intermediate_state, Start_state) )).
% 0.13/0.34  cnf(matrix-2, plain, ( succeeds(Goal_state, Start_state) | ~has(Start_state, goto(Label)) | ~labels(Label, Goal_state) )).
% 0.13/0.34  cnf(matrix-3, plain, ( succeeds(Goal_state, Start_state) | ~has(Start_state, ifthen(Condition, Goal_state)) )).
% 0.13/0.34  cnf(matrix-4, plain, ( labels(loop, p3) )).
% 0.13/0.34  cnf(matrix-5, plain, ( has(p3, ifthen(equal_function(register_j, n), p4)) )).
% 0.13/0.34  cnf(matrix-6, plain, ( has(p4, goto(out)) )).
% 0.13/0.34  cnf(matrix-7, plain, ( follows(p5, p4) )).
% 0.13/0.34  cnf(matrix-8, plain, ( follows(p8, p3) )).
% 0.13/0.34  cnf(matrix-9, plain, ( has(p8, goto(loop)) )).
% 0.13/0.34  cnf(matrix-10, plain, ( ~succeeds(p3, p3) )).
% 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(10), 
% 0.13/0.34  left_branch(0, 1, 0, 2), 
% 0.13/0.34  left_branch(0, 0, 0, 3), 
% 0.13/0.34  left_branch(0, 8, 0, 4), 
% 0.13/0.34  right_branch(4), 
% 0.13/0.34  right_branch(3), 
% 0.13/0.34  left_branch(0, 2, 0, 4), 
% 0.13/0.34  left_branch(0, 4, 0, 5), 
% 0.13/0.34  right_branch(5), 
% 0.13/0.34  left_branch(0, 9, 0, 6), 
% 0.13/0.34  right_branch(6), 
% 0.13/0.34  right_branch(4), 
% 0.13/0.34  right_branch(2)
% 0.13/0.34  )).
% 0.13/0.34  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------