%------------------------------------------------------------------------------
% File     : ConnectPP---0.3.0
% Problem  : LCL077-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 : n027.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:19:37 EDT 2024

% Result   : Unsatisfiable 1.15s 1.32s
% Output   : Proof 1.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL077-2 : 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.33  % Computer : n027.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 18:58:45 EDT 2024
% 0.13/0.33  % CPUTime  : 
% 1.15/1.32  % SZS status Unsatisfiable for theBenchmark
% 1.15/1.32  % SZS output start Proof for theBenchmark
% 1.15/1.32  
% 1.15/1.32  % Problem matrix:
% 1.15/1.32  cnf(matrix-0, plain, ( ~is_a_theorem(implies(X, Y)) | ~is_a_theorem(X) | is_a_theorem(Y) )).
% 1.15/1.32  cnf(matrix-1, plain, ( is_a_theorem(implies(X, implies(Y, X))) )).
% 1.15/1.32  cnf(matrix-2, plain, ( is_a_theorem(implies(implies(X, implies(Y, Z)), implies(implies(X, Y), implies(X, Z)))) )).
% 1.15/1.32  cnf(matrix-3, plain, ( is_a_theorem(implies(implies(not(X), not(Y)), implies(Y, X))) )).
% 1.15/1.32  cnf(matrix-4, plain, ( ~is_a_theorem(implies(X1, X2)) | ~is_a_theorem(implies(X2, X3)) | is_a_theorem(implies(X1, X3)) )).
% 1.15/1.32  cnf(matrix-5, plain, ( ~is_a_theorem(implies(not(not(a)), a)) )).
% 1.15/1.32  
% 1.15/1.32  % Proof stack:
% 1.15/1.32  cnf(proof-stack, plain, 
% 1.15/1.32  proof_stack(
% 1.15/1.32  start(5), 
% 1.15/1.32  left_branch(0, 4, 2, 2), 
% 1.15/1.32  left_branch(0, 4, 2, 3), 
% 1.15/1.32  left_branch(0, 1, 0, 4), 
% 1.15/1.32  right_branch(4), 
% 1.15/1.32  left_branch(0, 3, 0, 5), 
% 1.15/1.32  right_branch(5), 
% 1.15/1.32  right_branch(3), 
% 1.15/1.32  left_branch(0, 0, 2, 4), 
% 1.15/1.32  left_branch(0, 0, 2, 5), 
% 1.15/1.32  left_branch(0, 2, 0, 6), 
% 1.15/1.32  right_branch(6), 
% 1.15/1.32  left_branch(0, 3, 0, 7), 
% 1.15/1.32  right_branch(7), 
% 1.15/1.32  right_branch(5), 
% 1.15/1.32  left_branch(0, 0, 2, 6), 
% 1.15/1.32  left_branch(0, 2, 0, 7), 
% 1.15/1.32  right_branch(7), 
% 1.15/1.32  left_branch(0, 1, 0, 8), 
% 1.15/1.32  right_branch(8), 
% 1.15/1.32  right_branch(6), 
% 1.15/1.32  right_branch(4), 
% 1.15/1.32  right_branch(2)
% 1.15/1.32  )).
% 1.15/1.32  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------