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

% Computer : n019.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 : Tue Jul 19 11:53:38 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SEU161+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35  % Computer : n019.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 : Mon Jun 20 01:59:39 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.38  % SZS status Theorem
% 0.14/0.38  % SZS output begin IncompleteProof
% 0.14/0.38  cnf(c0, axiom,
% 0.14/0.38  	in(sK31,sK32)).
% 0.14/0.38  cnf(c1, plain,
% 0.14/0.38  	in(sK31,sK32),
% 0.14/0.38  	inference(start, [], [c0])).
% 0.14/0.38  
% 0.14/0.38  cnf(c2, axiom,
% 0.14/0.38  	set_union2(unordered_pair(X0,X0),X1) = X1 | ~in(X0,X1)).
% 0.14/0.38  cnf(a0, assumption,
% 0.14/0.38  	sK31 = X0).
% 0.14/0.38  cnf(a1, assumption,
% 0.14/0.38  	sK32 = X1).
% 0.14/0.38  cnf(c3, plain,
% 0.14/0.38  	$false,
% 0.14/0.38  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.38  cnf(c4, plain,
% 0.14/0.38  	set_union2(unordered_pair(X0,X0),X1) = X1,
% 0.14/0.38  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.38  
% 0.14/0.38  cnf(c5, axiom,
% 0.14/0.38  	sK32 != set_union2(unordered_pair(sK31,sK31),sK32)).
% 0.14/0.38  cnf(a2, assumption,
% 0.14/0.38  	set_union2(unordered_pair(sK31,sK31),sK32) = set_union2(unordered_pair(X0,X0),X1)).
% 0.14/0.38  cnf(c6, plain,
% 0.14/0.38  	$false,
% 0.14/0.38  	inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 0.14/0.38  cnf(c7, plain,
% 0.14/0.38  	$false,
% 0.14/0.38  	inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 0.14/0.38  cnf(c8, plain,
% 0.14/0.38  	sK32 != X1,
% 0.14/0.38  	inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 0.14/0.38  
% 0.14/0.38  cnf(a3, assumption,
% 0.14/0.38  	sK32 = X1).
% 0.14/0.38  cnf(c9, plain,
% 0.14/0.38  	$false,
% 0.14/0.38  	inference(reflexivity, [assumptions([a3])], [c8])).
% 0.14/0.38  
% 0.14/0.38  cnf(c10, plain,
% 0.14/0.38  	$false,
% 0.14/0.38  	inference(constraint_solving, [
% 0.14/0.38  		bind(X0, sK31),
% 0.14/0.38  		bind(X1, sK32)
% 0.14/0.38  	],
% 0.14/0.38  	[a0, a1, a2, a3])).
% 0.14/0.38  
% 0.14/0.38  % SZS output end IncompleteProof
%------------------------------------------------------------------------------