%------------------------------------------------------------------------------
% File     : ConnectPP---0.3.0
% Problem  : SYN044+1 : TPTP v8.1.2. Released v2.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 : Mon Mar 25 14:41:36 EDT 2024

% Result   : Theorem 0.11s 0.31s
% Output   : Proof 0.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : SYN044+1 : TPTP v8.1.2. Released v2.0.0.
% 0.02/0.11  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.11/0.30  % Computer : n032.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit : 300
% 0.11/0.30  % WCLimit  : 300
% 0.11/0.30  % DateTime : Wed Mar 20 23:05:25 EDT 2024
% 0.11/0.31  % CPUTime  : 
% 0.11/0.31  % SZS status Theorem for theBenchmark
% 0.11/0.31  % SZS output start Proof for theBenchmark
% 0.11/0.31  
% 0.11/0.31  % Formula: pel10_1 ( axiom ) converted to clauses:
% 0.11/0.31  cnf(pel10_1-1, axiom, ( ~q | r )).
% 0.11/0.31  
% 0.11/0.31  % Formula: pel10_2 ( axiom ) converted to clauses:
% 0.11/0.31  cnf(pel10_2-1, axiom, ( ~r | p )).
% 0.11/0.31  cnf(pel10_2-2, axiom, ( ~r | q )).
% 0.11/0.31  
% 0.11/0.31  % Formula: pel10_3 ( axiom ) converted to clauses:
% 0.11/0.31  cnf(pel10_3-1, axiom, ( ~p | q | r )).
% 0.11/0.31  
% 0.11/0.31  % Formula: pel10 ( conjecture ) (definitionally) converted to clauses:
% 0.11/0.31  cnf(pel10-1, negated_conjecture, ( ~_def0 | ~_def1 )).
% 0.11/0.31  cnf(pel10-2, negated_conjecture, ( _def0 | p )).
% 0.11/0.31  cnf(pel10-3, negated_conjecture, ( _def0 | ~q )).
% 0.11/0.31  cnf(pel10-4, negated_conjecture, ( _def1 | q )).
% 0.11/0.31  cnf(pel10-5, negated_conjecture, ( _def1 | ~p )).
% 0.11/0.31  
% 0.11/0.31  % Problem matrix:
% 0.11/0.31  cnf(matrix-0, plain, ( ~q | r )).
% 0.11/0.31  cnf(matrix-1, plain, ( ~r | p )).
% 0.11/0.31  cnf(matrix-2, plain, ( ~r | q )).
% 0.11/0.31  cnf(matrix-3, plain, ( ~p | q | r )).
% 0.11/0.31  cnf(matrix-4, plain, ( ~_def0 | ~_def1 )).
% 0.11/0.31  cnf(matrix-5, plain, ( _def0 | p )).
% 0.11/0.31  cnf(matrix-6, plain, ( _def0 | ~q )).
% 0.11/0.31  cnf(matrix-7, plain, ( _def1 | q )).
% 0.11/0.31  cnf(matrix-8, plain, ( _def1 | ~p )).
% 0.11/0.31  
% 0.11/0.31  % Proof stack:
% 0.11/0.31  cnf(proof-stack, plain, 
% 0.11/0.31  proof_stack(
% 0.11/0.31  start(4), 
% 0.11/0.31  left_branch(0, 6, 0, 2), 
% 0.11/0.31  left_branch(0, 3, 1, 3), 
% 0.11/0.31  left_branch(0, 5, 1, 4), 
% 0.11/0.31  reduction(0, 0), 
% 0.11/0.31  right_branch(4), 
% 0.11/0.31  left_branch(0, 2, 0, 5), 
% 0.11/0.31  reduction(0, 1), 
% 0.11/0.31  right_branch(5), 
% 0.11/0.31  right_branch(3), 
% 0.11/0.31  right_branch(2), 
% 0.11/0.31  left_branch(0, 8, 0, 3), 
% 0.11/0.31  left_branch(0, 1, 1, 4), 
% 0.11/0.31  left_branch(0, 0, 1, 5), 
% 0.11/0.31  left_branch(0, 7, 1, 6), 
% 0.11/0.31  reduction(0, 0), 
% 0.11/0.31  right_branch(6), 
% 0.11/0.31  right_branch(5), 
% 0.11/0.31  right_branch(4), 
% 0.11/0.31  right_branch(3)
% 0.11/0.31  )).
% 0.11/0.31  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------