TSTP Solution File: LCL065-1 by ConnectPP---0.2.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : LCL065-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 : n025.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:08:59 EST 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : LCL065-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Sun Mar  3 15:16:40 EST 2024
% 0.14/0.35  % CPUTime  : 
% 0.94/1.11  % SZS status Unsatisfiable for theBenchmark
% 0.94/1.11  % SZS output start Proof for theBenchmark
% 0.94/1.11  
% 0.94/1.11  % Problem matrix:
% 0.94/1.11  cnf(matrix-0, plain, ( ~is_a_theorem(implies(X, Y)) | ~is_a_theorem(X) | is_a_theorem(Y) )).
% 0.94/1.11  cnf(matrix-1, plain, ( is_a_theorem(implies(X, implies(Y, X))) )).
% 0.94/1.11  cnf(matrix-2, plain, ( is_a_theorem(implies(implies(X, implies(Y, Z)), implies(implies(X, Y), implies(X, Z)))) )).
% 0.94/1.11  cnf(matrix-3, plain, ( is_a_theorem(implies(implies(not(X), not(Y)), implies(Y, X))) )).
% 0.94/1.11  cnf(matrix-4, plain, ( ~is_a_theorem(implies(implies(not(a), a), a)) )).
% 0.94/1.11  
% 0.94/1.11  % Proof stack:
% 0.94/1.11  cnf(proof-stack, plain, 
% 0.94/1.11  proof_stack(
% 0.94/1.11  start(4), 
% 0.94/1.11  left_branch(0, 0, 2, 2), 
% 0.94/1.11  left_branch(0, 0, 2, 3), 
% 0.94/1.11  left_branch(0, 2, 0, 4), 
% 0.94/1.11  right_branch(4), 
% 0.94/1.11  left_branch(0, 0, 2, 5), 
% 0.94/1.11  left_branch(0, 1, 0, 6), 
% 0.94/1.11  right_branch(6), 
% 0.94/1.11  left_branch(0, 0, 2, 7), 
% 0.94/1.11  left_branch(0, 0, 2, 8), 
% 0.94/1.11  left_branch(0, 2, 0, 9), 
% 0.94/1.11  right_branch(9), 
% 0.94/1.11  left_branch(0, 3, 0, 10), 
% 0.94/1.11  right_branch(10), 
% 0.94/1.11  right_branch(8), 
% 0.94/1.11  left_branch(0, 0, 2, 9), 
% 0.94/1.11  left_branch(0, 2, 0, 10), 
% 0.94/1.11  right_branch(10), 
% 0.94/1.11  left_branch(0, 1, 0, 11), 
% 0.94/1.11  right_branch(11), 
% 0.94/1.11  right_branch(9), 
% 0.94/1.11  right_branch(7), 
% 0.94/1.11  right_branch(5), 
% 0.94/1.11  right_branch(3), 
% 0.94/1.11  left_branch(0, 0, 2, 4), 
% 0.94/1.11  left_branch(0, 2, 0, 5), 
% 0.94/1.11  right_branch(5), 
% 0.94/1.11  left_branch(0, 0, 2, 6), 
% 0.94/1.11  left_branch(0, 0, 2, 7), 
% 0.94/1.11  left_branch(0, 2, 0, 8), 
% 0.94/1.11  right_branch(8), 
% 0.94/1.11  left_branch(0, 0, 2, 9), 
% 0.94/1.11  left_branch(0, 1, 0, 10), 
% 0.94/1.11  right_branch(10), 
% 0.94/1.11  left_branch(0, 3, 0, 11), 
% 0.94/1.11  right_branch(11), 
% 0.94/1.11  right_branch(9), 
% 0.94/1.11  right_branch(7), 
% 0.94/1.11  left_branch(0, 1, 0, 8), 
% 0.94/1.11  right_branch(8), 
% 0.94/1.11  right_branch(6), 
% 0.94/1.11  right_branch(4), 
% 0.94/1.11  right_branch(2)
% 0.94/1.11  )).
% 0.94/1.11  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------