TSTP Solution File: SET074+1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET074+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:24 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET074+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jul  9 20:46:51 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.37  % SZS status Theorem
% 0.20/0.37  % SZS output begin IncompleteProof
% 0.20/0.37  cnf(c0, axiom,
% 0.20/0.37  	null_class = unordered_pair(sK9,sK10)).
% 0.20/0.37  cnf(c1, plain,
% 0.20/0.37  	null_class = unordered_pair(sK9,sK10),
% 0.20/0.37  	inference(start, [], [c0])).
% 0.20/0.37  
% 0.20/0.37  cnf(c2, axiom,
% 0.20/0.37  	member(X0,unordered_pair(X1,X2)) | ~sP0(X2,X0,X1)).
% 0.20/0.37  cnf(a0, assumption,
% 0.20/0.37  	unordered_pair(X1,X2) = unordered_pair(sK9,sK10)).
% 0.20/0.37  cnf(a1, assumption,
% 0.20/0.37  	null_class = X3).
% 0.20/0.37  cnf(c3, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.37  cnf(c4, plain,
% 0.20/0.37  	~sP0(X2,X0,X1),
% 0.20/0.37  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.37  cnf(c5, plain,
% 0.20/0.37  	member(X0,X3),
% 0.20/0.37  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.37  
% 0.20/0.37  cnf(c6, axiom,
% 0.20/0.37  	~member(X4,null_class)).
% 0.20/0.37  cnf(a2, assumption,
% 0.20/0.37  	X0 = X4).
% 0.20/0.37  cnf(a3, assumption,
% 0.20/0.37  	X3 = null_class).
% 0.20/0.37  cnf(c7, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.20/0.37  cnf(c8, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.20/0.37  
% 0.20/0.37  cnf(c9, axiom,
% 0.20/0.37  	sP0(X5,X5,X6) | ~member(X5,universal_class)).
% 0.20/0.37  cnf(a4, assumption,
% 0.20/0.37  	X2 = X5).
% 0.20/0.37  cnf(a5, assumption,
% 0.20/0.37  	X0 = X5).
% 0.20/0.37  cnf(a6, assumption,
% 0.20/0.37  	X1 = X6).
% 0.20/0.37  cnf(c10, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c4, c9])).
% 0.20/0.37  cnf(c11, plain,
% 0.20/0.37  	~member(X5,universal_class),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c4, c9])).
% 0.20/0.37  
% 0.20/0.37  cnf(c12, axiom,
% 0.20/0.37  	member(sK10,universal_class)).
% 0.20/0.37  cnf(a7, assumption,
% 0.20/0.37  	X5 = sK10).
% 0.20/0.37  cnf(a8, assumption,
% 0.20/0.37  	universal_class = universal_class).
% 0.20/0.37  cnf(c13, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c12])).
% 0.20/0.37  cnf(c14, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c12])).
% 0.20/0.37  
% 0.20/0.37  cnf(c15, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(constraint_solving, [
% 0.20/0.37  		bind(X0, sK10),
% 0.20/0.37  		bind(X1, sK9),
% 0.20/0.37  		bind(X2, sK10),
% 0.20/0.37  		bind(X3, null_class),
% 0.20/0.37  		bind(X4, sK10),
% 0.20/0.37  		bind(X5, sK10),
% 0.20/0.37  		bind(X6, sK9)
% 0.20/0.37  	],
% 0.20/0.37  	[a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.20/0.37  
% 0.20/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------