%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : SYN083+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 : n016.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:27:01 EST 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN083+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.12  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33  % Computer : n016.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 22:03:29 EST 2024
% 0.12/0.33  % CPUTime  : 
% 0.19/0.34  % SZS status Theorem for theBenchmark
% 0.19/0.34  % SZS output start Proof for theBenchmark
% 0.19/0.34  
% 0.19/0.34  % Formula: p61_1 ( axiom ) converted to clauses:
% 0.19/0.34  cnf(p61_1-1, axiom, ( ( f(_u2, f(_u1, _u0)) = f(f(_u2, _u1), _u0)) )).
% 0.19/0.34  
% 0.19/0.34  % Formula: pel61 ( conjecture ) converted to clauses:
% 0.19/0.34  cnf(pel61-1, negated_conjecture, ( ( f(skolem1, f(skolem2, f(skolem3, skolem4))) != f(f(f(skolem1, skolem2), skolem3), skolem4)) )).
% 0.19/0.34  
% 0.19/0.34  % Problem matrix:
% 0.19/0.34  cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.19/0.34  cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.19/0.34  cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.19/0.34  cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( f(__eqx_0, __eqx_1) = f(__eqy_0, __eqy_1)) )).
% 0.19/0.34  cnf(matrix-4, plain, ( ( f(_u2, f(_u1, _u0)) = f(f(_u2, _u1), _u0)) )).
% 0.19/0.34  cnf(matrix-5, plain, ( ( f(skolem1, f(skolem2, f(skolem3, skolem4))) != f(f(f(skolem1, skolem2), skolem3), skolem4)) )).
% 0.19/0.34  
% 0.19/0.34  % Proof stack:
% 0.19/0.34  cnf(proof-stack, plain, 
% 0.19/0.34  proof_stack(
% 0.19/0.34  start(5), 
% 0.19/0.34  left_branch(0, 2, 2, 2), 
% 0.19/0.34  left_branch(0, 4, 0, 3), 
% 0.19/0.34  right_branch(3), 
% 0.19/0.34  left_branch(0, 4, 0, 4), 
% 0.19/0.34  right_branch(4), 
% 0.19/0.34  right_branch(2)
% 0.19/0.34  )).
% 0.19/0.34  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------