%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET103-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 : n003.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:51 EDT 2022

% Result   : Unsatisfiable 1.51s 0.59s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET103-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n003.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jul 11 09:21:15 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.51/0.59  % SZS status Unsatisfiable
% 1.51/0.59  % SZS output begin IncompleteProof
% 1.51/0.59  cnf(c0, axiom,
% 1.51/0.59  	~member(y,universal_class)).
% 1.51/0.59  cnf(c1, plain,
% 1.51/0.59  	~member(y,universal_class),
% 1.51/0.59  	inference(start, [], [c0])).
% 1.51/0.59  
% 1.51/0.59  cnf(c2, axiom,
% 1.51/0.59  	unordered_pair(X0,X0) = null_class | member(X0,universal_class)).
% 1.51/0.59  cnf(a0, assumption,
% 1.51/0.59  	y = X0).
% 1.51/0.59  cnf(a1, assumption,
% 1.51/0.59  	universal_class = universal_class).
% 1.51/0.59  cnf(c3, plain,
% 1.51/0.59  	$false,
% 1.51/0.59  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.51/0.59  cnf(c4, plain,
% 1.51/0.59  	unordered_pair(X0,X0) = null_class,
% 1.51/0.59  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.51/0.59  
% 1.51/0.59  cnf(c5, axiom,
% 1.51/0.59  	unordered_pair(unordered_pair(x,x),unordered_pair(x,null_class)) != unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y)))).
% 1.51/0.59  cnf(a2, assumption,
% 1.51/0.59  	unordered_pair(y,y) = unordered_pair(X0,X0)).
% 1.51/0.59  cnf(a3, assumption,
% 1.51/0.59  	null_class = X1).
% 1.51/0.59  cnf(c6, plain,
% 1.51/0.59  	$false,
% 1.51/0.59  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 1.51/0.59  cnf(c7, plain,
% 1.51/0.59  	$false,
% 1.51/0.59  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 1.51/0.59  cnf(c8, plain,
% 1.51/0.59  	unordered_pair(unordered_pair(x,x),unordered_pair(x,null_class)) != unordered_pair(unordered_pair(x,x),unordered_pair(x,X1)),
% 1.51/0.59  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 1.51/0.59  
% 1.51/0.59  cnf(a4, assumption,
% 1.51/0.59  	unordered_pair(unordered_pair(x,x),unordered_pair(x,null_class)) = unordered_pair(unordered_pair(x,x),unordered_pair(x,X1))).
% 1.51/0.59  cnf(c9, plain,
% 1.51/0.59  	$false,
% 1.51/0.59  	inference(reflexivity, [assumptions([a4])], [c8])).
% 1.51/0.59  
% 1.51/0.59  cnf(c10, plain,
% 1.51/0.59  	$false,
% 1.51/0.59  	inference(constraint_solving, [
% 1.51/0.59  		bind(X0, y),
% 1.51/0.59  		bind(X1, null_class)
% 1.51/0.59  	],
% 1.51/0.59  	[a0, a1, a2, a3, a4])).
% 1.51/0.59  
% 1.51/0.59  % SZS output end IncompleteProof
%------------------------------------------------------------------------------