%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET117+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 : 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 02:43:59 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SET117+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.11/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n019.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 : Sun Jul 10 05:26:08 EDT 2022
% 0.12/0.33  % 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  	sK9 = unordered_pair(unordered_pair(first(sK9),first(sK9)),unordered_pair(first(sK9),unordered_pair(second(sK9),second(sK9))))).
% 0.12/0.35  cnf(c1, plain,
% 0.12/0.35  	sK9 = unordered_pair(unordered_pair(first(sK9),first(sK9)),unordered_pair(first(sK9),unordered_pair(second(sK9),second(sK9)))),
% 0.12/0.35  	inference(start, [], [c0])).
% 0.12/0.35  
% 0.12/0.35  cnf(c2, axiom,
% 0.12/0.35  	member(unordered_pair(X0,X1),universal_class)).
% 0.12/0.35  cnf(a0, assumption,
% 0.12/0.35  	unordered_pair(X0,X1) = unordered_pair(unordered_pair(first(sK9),first(sK9)),unordered_pair(first(sK9),unordered_pair(second(sK9),second(sK9))))).
% 0.12/0.35  cnf(a1, assumption,
% 0.12/0.35  	sK9 = X2).
% 0.12/0.35  cnf(c3, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.35  cnf(c4, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.35  cnf(c5, plain,
% 0.12/0.35  	member(X2,universal_class),
% 0.12/0.35  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.35  
% 0.12/0.35  cnf(c6, axiom,
% 0.12/0.35  	~member(sK9,universal_class)).
% 0.12/0.35  cnf(a2, assumption,
% 0.12/0.35  	X2 = sK9).
% 0.12/0.35  cnf(a3, assumption,
% 0.12/0.35  	universal_class = universal_class).
% 0.12/0.35  cnf(c7, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.12/0.35  cnf(c8, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.12/0.35  
% 0.12/0.35  cnf(c9, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(constraint_solving, [
% 0.12/0.35  		bind(X0, unordered_pair(first(sK9),first(sK9))),
% 0.12/0.35  		bind(X1, unordered_pair(first(sK9),unordered_pair(second(sK9),second(sK9)))),
% 0.12/0.35  		bind(X2, sK9)
% 0.12/0.35  	],
% 0.12/0.35  	[a0, a1, a2, a3])).
% 0.12/0.35  
% 0.12/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------