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

% Computer : n021.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 02:43:35 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET086+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n021.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 : Sun Jul 10 10:48:37 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.37  % SZS status Theorem
% 0.12/0.37  % SZS output begin IncompleteProof
% 0.12/0.37  cnf(c0, axiom,
% 0.12/0.37  	sK9 = unordered_pair(sK10,sK10)).
% 0.12/0.37  cnf(c1, plain,
% 0.12/0.37  	sK9 = unordered_pair(sK10,sK10),
% 0.12/0.37  	inference(start, [], [c0])).
% 0.12/0.37  
% 0.12/0.37  cnf(c2, axiom,
% 0.12/0.37  	sK9 != unordered_pair(X0,X0) | ~member(X0,universal_class)).
% 0.12/0.37  cnf(a0, assumption,
% 0.12/0.37  	unordered_pair(X0,X0) = unordered_pair(sK10,sK10)).
% 0.12/0.37  cnf(a1, assumption,
% 0.12/0.37  	sK9 = X1).
% 0.12/0.37  cnf(c3, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.37  cnf(c4, plain,
% 0.12/0.37  	~member(X0,universal_class),
% 0.12/0.37  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.37  cnf(c5, plain,
% 0.12/0.37  	sK9 != X1,
% 0.12/0.37  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.37  
% 0.12/0.37  cnf(a2, assumption,
% 0.12/0.37  	sK9 = X1).
% 0.12/0.37  cnf(c6, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(reflexivity, [assumptions([a2])], [c5])).
% 0.12/0.37  
% 0.12/0.37  cnf(c7, axiom,
% 0.12/0.37  	member(sK10,universal_class)).
% 0.12/0.37  cnf(a3, assumption,
% 0.12/0.37  	X0 = sK10).
% 0.12/0.37  cnf(a4, assumption,
% 0.12/0.37  	universal_class = universal_class).
% 0.12/0.37  cnf(c8, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c7])).
% 0.12/0.37  cnf(c9, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c7])).
% 0.12/0.37  
% 0.12/0.37  cnf(c10, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(constraint_solving, [
% 0.12/0.37  		bind(X0, sK10),
% 0.12/0.37  		bind(X1, sK9)
% 0.12/0.37  	],
% 0.12/0.37  	[a0, a1, a2, a3, a4])).
% 0.12/0.37  
% 0.12/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------