%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : SYN065+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 : 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:26:57 EST 2024

% Result   : Theorem 0.12s 0.34s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN065+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33  % Computer : n025.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Sun Mar  3 21:41:55 EST 2024
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  % SZS status Theorem for theBenchmark
% 0.12/0.34  % SZS output start Proof for theBenchmark
% 0.12/0.34  
% 0.12/0.34  % Formula: pel36_1 ( axiom ) converted to clauses:
% 0.12/0.34  cnf(pel36_1-1, axiom, ( big_f(_u1, skolem1(_u1)) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: pel36_2 ( axiom ) converted to clauses:
% 0.12/0.34  cnf(pel36_2-1, axiom, ( big_g(_u3, skolem2(_u3)) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: pel36_3 ( axiom ) converted to clauses:
% 0.12/0.34  cnf(pel36_3-1, axiom, ( ~big_f(_u6, _u5) | big_h(_u6, _u4) | ~big_f(_u5, _u4) )).
% 0.12/0.34  cnf(pel36_3-2, axiom, ( ~big_f(_u6, _u5) | big_h(_u6, _u4) | ~big_g(_u5, _u4) )).
% 0.12/0.34  cnf(pel36_3-3, axiom, ( ~big_g(_u6, _u5) | big_h(_u6, _u4) | ~big_f(_u5, _u4) )).
% 0.12/0.34  cnf(pel36_3-4, axiom, ( ~big_g(_u6, _u5) | big_h(_u6, _u4) | ~big_g(_u5, _u4) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: pel36 ( conjecture ) converted to clauses:
% 0.12/0.34  cnf(pel36-1, negated_conjecture, ( ~big_h(skolem3, _u7) )).
% 0.12/0.34  
% 0.12/0.34  % Problem matrix:
% 0.12/0.34  cnf(matrix-0, plain, ( big_f(_u1, skolem1(_u1)) )).
% 0.12/0.34  cnf(matrix-1, plain, ( big_g(_u3, skolem2(_u3)) )).
% 0.12/0.34  cnf(matrix-2, plain, ( ~big_f(_u6, _u5) | big_h(_u6, _u4) | ~big_f(_u5, _u4) )).
% 0.12/0.34  cnf(matrix-3, plain, ( ~big_f(_u6, _u5) | big_h(_u6, _u4) | ~big_g(_u5, _u4) )).
% 0.12/0.34  cnf(matrix-4, plain, ( ~big_g(_u6, _u5) | big_h(_u6, _u4) | ~big_f(_u5, _u4) )).
% 0.12/0.34  cnf(matrix-5, plain, ( ~big_g(_u6, _u5) | big_h(_u6, _u4) | ~big_g(_u5, _u4) )).
% 0.12/0.34  cnf(matrix-6, plain, ( ~big_h(skolem3, _u7) )).
% 0.12/0.34  
% 0.12/0.34  % Proof stack:
% 0.12/0.34  cnf(proof-stack, plain, 
% 0.12/0.34  proof_stack(
% 0.12/0.34  start(6), 
% 0.12/0.34  left_branch(0, 5, 1, 2), 
% 0.12/0.34  left_branch(0, 1, 0, 3), 
% 0.12/0.34  right_branch(3), 
% 0.12/0.34  left_branch(0, 1, 0, 4), 
% 0.12/0.34  right_branch(4), 
% 0.12/0.34  right_branch(2)
% 0.12/0.34  )).
% 0.12/0.34  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------