%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : KLE059+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n008.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  : 600s
% DateTime : Sun Jul 17 02:09:21 EDT 2022

% Result   : Theorem 0.14s 0.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : KLE059+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35  % Computer : n008.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  : 600
% 0.14/0.35  % DateTime : Thu Jun 16 08:24:22 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.39  % SZS status Theorem
% 0.14/0.39  % SZS output begin IncompleteProof
% 0.14/0.39  cnf(c0, axiom,
% 0.14/0.39  	domain(sK1) != addition(domain(sK0),domain(sK1))).
% 0.14/0.39  cnf(c1, plain,
% 0.14/0.39  	domain(sK1) != addition(domain(sK0),domain(sK1)),
% 0.14/0.39  	inference(start, [], [c0])).
% 0.14/0.39  
% 0.14/0.39  cnf(c2, axiom,
% 0.14/0.39  	domain(addition(X0,X1)) = addition(domain(X0),domain(X1))).
% 0.14/0.39  cnf(a0, assumption,
% 0.14/0.39  	addition(domain(sK0),domain(sK1)) = addition(domain(X0),domain(X1))).
% 0.14/0.39  cnf(c3, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.39  cnf(c4, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.39  cnf(c5, plain,
% 0.14/0.39  	X2 != domain(addition(X0,X1)) | domain(sK1) != X2,
% 0.14/0.39  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.39  
% 0.14/0.39  cnf(c6, axiom,
% 0.14/0.39  	sK1 = addition(sK0,sK1)).
% 0.14/0.39  cnf(a1, assumption,
% 0.14/0.39  	addition(X0,X1) = addition(sK0,sK1)).
% 0.14/0.39  cnf(c7, plain,
% 0.14/0.39  	domain(sK1) != X2,
% 0.14/0.39  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.14/0.39  cnf(c8, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.14/0.39  cnf(c9, plain,
% 0.14/0.39  	X3 != sK1 | X2 != domain(X3),
% 0.14/0.39  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.14/0.39  
% 0.14/0.39  cnf(a2, assumption,
% 0.14/0.39  	X3 = sK1).
% 0.14/0.39  cnf(c10, plain,
% 0.14/0.39  	X2 != domain(X3),
% 0.14/0.39  	inference(reflexivity, [assumptions([a2])], [c9])).
% 0.14/0.39  
% 0.14/0.39  cnf(a3, assumption,
% 0.14/0.39  	X2 = domain(X3)).
% 0.14/0.39  cnf(c11, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(reflexivity, [assumptions([a3])], [c10])).
% 0.14/0.39  
% 0.14/0.39  cnf(a4, assumption,
% 0.14/0.39  	domain(sK1) = X2).
% 0.14/0.39  cnf(c12, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(reflexivity, [assumptions([a4])], [c7])).
% 0.14/0.39  
% 0.14/0.39  cnf(c13, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(constraint_solving, [
% 0.14/0.39  		bind(X0, sK0),
% 0.14/0.39  		bind(X1, sK1),
% 0.14/0.39  		bind(X2, domain(X3)),
% 0.14/0.39  		bind(X3, sK1)
% 0.14/0.39  	],
% 0.14/0.39  	[a0, a1, a2, a3, a4])).
% 0.14/0.39  
% 0.14/0.39  % SZS output end IncompleteProof
%------------------------------------------------------------------------------