TSTP Solution File: SET622+3 by lazyCoP---0.1

View Problem - Process Solution

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

% Computer : n011.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:47:09 EDT 2022

% Result   : Theorem 0.19s 0.34s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SET622+3 : TPTP v8.1.0. Released v2.2.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 : n011.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 00:23:41 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.34  % SZS status Theorem
% 0.19/0.34  % SZS output begin IncompleteProof
% 0.19/0.34  cnf(c0, axiom,
% 0.19/0.34  	union(difference(sK3,union(sK4,sK5)),intersection(intersection(sK3,sK4),sK5)) != difference(sK3,difference(union(sK4,sK5),intersection(sK4,sK5)))).
% 0.19/0.34  cnf(c1, plain,
% 0.19/0.34  	union(difference(sK3,union(sK4,sK5)),intersection(intersection(sK3,sK4),sK5)) != difference(sK3,difference(union(sK4,sK5),intersection(sK4,sK5))),
% 0.19/0.34  	inference(start, [], [c0])).
% 0.19/0.34  
% 0.19/0.34  cnf(c2, axiom,
% 0.19/0.34  	intersection(intersection(X0,X1),X2) = intersection(X0,intersection(X1,X2))).
% 0.19/0.34  cnf(a0, assumption,
% 0.19/0.34  	intersection(intersection(sK3,sK4),sK5) = intersection(intersection(X0,X1),X2)).
% 0.19/0.34  cnf(c3, plain,
% 0.19/0.34  	$false,
% 0.19/0.34  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.34  cnf(c4, plain,
% 0.19/0.34  	$false,
% 0.19/0.34  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.34  cnf(c5, plain,
% 0.19/0.34  	X3 != intersection(X0,intersection(X1,X2)) | union(difference(sK3,union(sK4,sK5)),X3) != difference(sK3,difference(union(sK4,sK5),intersection(sK4,sK5))),
% 0.19/0.34  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.34  
% 0.19/0.34  cnf(a1, assumption,
% 0.19/0.34  	X3 = intersection(X0,intersection(X1,X2))).
% 0.19/0.34  cnf(c6, plain,
% 0.19/0.34  	union(difference(sK3,union(sK4,sK5)),X3) != difference(sK3,difference(union(sK4,sK5),intersection(sK4,sK5))),
% 0.19/0.34  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.19/0.34  
% 0.19/0.34  cnf(c7, axiom,
% 0.19/0.34  	difference(X4,difference(X5,X6)) = union(difference(X4,X5),intersection(X4,X6))).
% 0.19/0.34  cnf(a2, assumption,
% 0.19/0.34  	union(difference(sK3,union(sK4,sK5)),X3) = union(difference(X4,X5),intersection(X4,X6))).
% 0.19/0.34  cnf(c8, plain,
% 0.19/0.34  	$false,
% 0.19/0.34  	inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 0.19/0.34  cnf(c9, plain,
% 0.19/0.34  	$false,
% 0.19/0.34  	inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 0.19/0.34  cnf(c10, plain,
% 0.19/0.34  	X7 != difference(X4,difference(X5,X6)) | X7 != difference(sK3,difference(union(sK4,sK5),intersection(sK4,sK5))),
% 0.19/0.34  	inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 0.19/0.34  
% 0.19/0.34  cnf(a3, assumption,
% 0.19/0.34  	X7 = difference(X4,difference(X5,X6))).
% 0.19/0.34  cnf(c11, plain,
% 0.19/0.34  	X7 != difference(sK3,difference(union(sK4,sK5),intersection(sK4,sK5))),
% 0.19/0.34  	inference(reflexivity, [assumptions([a3])], [c10])).
% 0.19/0.34  
% 0.19/0.34  cnf(a4, assumption,
% 0.19/0.34  	X7 = difference(sK3,difference(union(sK4,sK5),intersection(sK4,sK5)))).
% 0.19/0.34  cnf(c12, plain,
% 0.19/0.34  	$false,
% 0.19/0.34  	inference(reflexivity, [assumptions([a4])], [c11])).
% 0.19/0.34  
% 0.19/0.34  cnf(c13, plain,
% 0.19/0.34  	$false,
% 0.19/0.34  	inference(constraint_solving, [
% 0.19/0.34  		bind(X0, sK3),
% 0.19/0.34  		bind(X1, sK4),
% 0.19/0.34  		bind(X2, sK5),
% 0.19/0.34  		bind(X3, intersection(X0,intersection(X1,X2))),
% 0.19/0.34  		bind(X4, sK3),
% 0.19/0.34  		bind(X5, union(sK4,sK5)),
% 0.19/0.34  		bind(X6, intersection(X1,X2)),
% 0.19/0.34  		bind(X7, difference(X4,difference(X5,X6)))
% 0.19/0.34  	],
% 0.19/0.34  	[a0, a1, a2, a3, a4])).
% 0.19/0.34  
% 0.19/0.34  % SZS output end IncompleteProof
%------------------------------------------------------------------------------