%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL666+1.001 : 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 : n004.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 12:10:49 EDT 2022

% Result   : Theorem 0.12s 0.35s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n004.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul  4 22:18:37 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % SZS status Theorem
% 0.12/0.35  % SZS output begin IncompleteProof
% 0.12/0.35  cnf(c0, axiom,
% 0.12/0.35  	p101(sK0)).
% 0.12/0.35  cnf(c1, plain,
% 0.12/0.35  	p101(sK0),
% 0.12/0.35  	inference(start, [], [c0])).
% 0.12/0.35  
% 0.12/0.35  cnf(c2, axiom,
% 0.12/0.35  	~p101(X0) | ~p201(X0) | ~r1(sK0,X0)).
% 0.12/0.35  cnf(a0, assumption,
% 0.12/0.35  	sK0 = X0).
% 0.12/0.35  cnf(c3, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35  cnf(c4, plain,
% 0.12/0.35  	~p201(X0) | ~r1(sK0,X0),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35  
% 0.12/0.35  cnf(c5, axiom,
% 0.12/0.35  	p201(sK0)).
% 0.12/0.35  cnf(a1, assumption,
% 0.12/0.35  	X0 = sK0).
% 0.12/0.35  cnf(c6, plain,
% 0.12/0.35  	~r1(sK0,X0),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.35  cnf(c7, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.35  
% 0.12/0.35  cnf(c8, axiom,
% 0.12/0.35  	r1(X1,X1)).
% 0.12/0.35  cnf(a2, assumption,
% 0.12/0.35  	sK0 = X1).
% 0.12/0.35  cnf(a3, assumption,
% 0.12/0.35  	X0 = X1).
% 0.12/0.35  cnf(c9, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c6, c8])).
% 0.12/0.35  cnf(c10, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c6, c8])).
% 0.12/0.35  
% 0.12/0.35  cnf(c11, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(constraint_solving, [
% 0.12/0.35  		bind(X0, sK0),
% 0.12/0.35  		bind(X1, sK0)
% 0.12/0.35  	],
% 0.12/0.35  	[a0, a1, a2, a3])).
% 0.12/0.35  
% 0.12/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------