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

% Computer : n010.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:42:38 EDT 2022

% Result   : Unsatisfiable 0.21s 0.37s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SET025-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.04/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35  % Computer : n010.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jul 10 03:58:15 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.37  % SZS status Unsatisfiable
% 0.21/0.37  % SZS output begin IncompleteProof
% 0.21/0.37  cnf(c0, axiom,
% 0.21/0.37  	~member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),universal_class)).
% 0.21/0.37  cnf(c1, plain,
% 0.21/0.37  	~member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),universal_class),
% 0.21/0.37  	inference(start, [], [c0])).
% 0.21/0.37  
% 0.21/0.37  cnf(c2, axiom,
% 0.21/0.37  	member(unordered_pair(X0,X1),universal_class)).
% 0.21/0.37  cnf(a0, assumption,
% 0.21/0.37  	unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))) = unordered_pair(X0,X1)).
% 0.21/0.37  cnf(a1, assumption,
% 0.21/0.37  	universal_class = universal_class).
% 0.21/0.37  cnf(c3, plain,
% 0.21/0.37  	$false,
% 0.21/0.37  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.21/0.37  cnf(c4, plain,
% 0.21/0.37  	$false,
% 0.21/0.37  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.21/0.37  
% 0.21/0.37  cnf(c5, plain,
% 0.21/0.37  	$false,
% 0.21/0.37  	inference(constraint_solving, [
% 0.21/0.37  		bind(X0, unordered_pair(x,x)),
% 0.21/0.37  		bind(X1, unordered_pair(x,unordered_pair(y,y)))
% 0.21/0.37  	],
% 0.21/0.37  	[a0, a1])).
% 0.21/0.37  
% 0.21/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------