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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET199+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 : n028.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:44:38 EDT 2022

% Result   : Theorem 0.21s 0.49s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET199+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jul 10 02:09:27 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.49  % SZS status Theorem
% 0.21/0.49  % SZS output begin IncompleteProof
% 0.21/0.49  cnf(c0, axiom,
% 0.21/0.49  	~subset(sK3,intersection(sK4,sK5))).
% 0.21/0.49  cnf(c1, plain,
% 0.21/0.49  	~subset(sK3,intersection(sK4,sK5)),
% 0.21/0.49  	inference(start, [], [c0])).
% 0.21/0.49  
% 0.21/0.49  cnf(c2, axiom,
% 0.21/0.49  	subset(X0,X1) | member(sK1(X0,X1),X0)).
% 0.21/0.49  cnf(a0, assumption,
% 0.21/0.49  	sK3 = X0).
% 0.21/0.49  cnf(a1, assumption,
% 0.21/0.49  	intersection(sK4,sK5) = X1).
% 0.21/0.49  cnf(c3, plain,
% 0.21/0.49  	$false,
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.21/0.49  cnf(c4, plain,
% 0.21/0.49  	member(sK1(X0,X1),X0),
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.21/0.49  
% 0.21/0.49  cnf(c5, axiom,
% 0.21/0.49  	member(X2,X3) | ~member(X2,X4) | ~subset(X4,X3)).
% 0.21/0.49  cnf(a2, assumption,
% 0.21/0.49  	sK1(X0,X1) = X2).
% 0.21/0.49  cnf(a3, assumption,
% 0.21/0.49  	X0 = X4).
% 0.21/0.49  cnf(c6, plain,
% 0.21/0.49  	$false,
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.21/0.49  cnf(c7, plain,
% 0.21/0.49  	member(X2,X3) | ~subset(X4,X3),
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.21/0.49  
% 0.21/0.49  cnf(c8, axiom,
% 0.21/0.49  	member(X5,intersection(X6,X7)) | ~member(X5,X7) | ~member(X5,X6)).
% 0.21/0.49  cnf(a4, assumption,
% 0.21/0.49  	X2 = X5).
% 0.21/0.49  cnf(a5, assumption,
% 0.21/0.49  	X3 = X6).
% 0.21/0.49  cnf(c9, plain,
% 0.21/0.49  	~subset(X4,X3),
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.21/0.49  cnf(c10, plain,
% 0.21/0.49  	member(X5,intersection(X6,X7)) | ~member(X5,X7),
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.21/0.49  
% 0.21/0.49  cnf(c11, axiom,
% 0.21/0.49  	subset(X8,X9) | ~member(sK1(X8,X9),X9)).
% 0.21/0.49  cnf(a6, assumption,
% 0.21/0.49  	X5 = sK1(X8,X9)).
% 0.21/0.49  cnf(a7, assumption,
% 0.21/0.49  	intersection(X6,X7) = X9).
% 0.21/0.49  cnf(c12, plain,
% 0.21/0.49  	~member(X5,X7),
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.21/0.49  cnf(c13, plain,
% 0.21/0.49  	subset(X8,X9),
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.21/0.49  
% 0.21/0.49  cnf(c14, plain,
% 0.21/0.49  	~subset(sK3,intersection(sK4,sK5))).
% 0.21/0.49  cnf(a8, assumption,
% 0.21/0.49  	X8 = sK3).
% 0.21/0.49  cnf(a9, assumption,
% 0.21/0.49  	X9 = intersection(sK4,sK5)).
% 0.21/0.49  cnf(c15, plain,
% 0.21/0.49  	$false,
% 0.21/0.49  	inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])).
% 0.21/0.49  
% 0.21/0.49  cnf(c16, axiom,
% 0.21/0.49  	member(X10,X11) | ~member(X10,X12) | ~subset(X12,X11)).
% 0.21/0.49  cnf(a10, assumption,
% 0.21/0.49  	X5 = X10).
% 0.21/0.49  cnf(a11, assumption,
% 0.21/0.49  	X7 = X11).
% 0.21/0.49  cnf(c17, plain,
% 0.21/0.49  	$false,
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])).
% 0.21/0.49  cnf(c18, plain,
% 0.21/0.49  	~member(X10,X12) | ~subset(X12,X11),
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])).
% 0.21/0.49  
% 0.21/0.49  cnf(c19, plain,
% 0.21/0.49  	member(sK1(X0,X1),X0)).
% 0.21/0.49  cnf(a12, assumption,
% 0.21/0.49  	X10 = sK1(X0,X1)).
% 0.21/0.49  cnf(a13, assumption,
% 0.21/0.49  	X12 = X0).
% 0.21/0.49  cnf(c20, plain,
% 0.21/0.49  	~subset(X12,X11),
% 0.21/0.49  	inference(predicate_reduction, [assumptions([a12, a13])], [c18, c19])).
% 0.21/0.49  
% 0.21/0.49  cnf(c21, axiom,
% 0.21/0.49  	subset(sK3,sK5)).
% 0.21/0.49  cnf(a14, assumption,
% 0.21/0.49  	X12 = sK3).
% 0.21/0.49  cnf(a15, assumption,
% 0.21/0.49  	X11 = sK5).
% 0.21/0.49  cnf(c22, plain,
% 0.21/0.49  	$false,
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c20, c21])).
% 0.21/0.49  cnf(c23, plain,
% 0.21/0.49  	$false,
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c20, c21])).
% 0.21/0.49  
% 0.21/0.49  cnf(c24, axiom,
% 0.21/0.49  	subset(sK3,sK4)).
% 0.21/0.49  cnf(a16, assumption,
% 0.21/0.49  	X4 = sK3).
% 0.21/0.49  cnf(a17, assumption,
% 0.21/0.49  	X3 = sK4).
% 0.21/0.49  cnf(c25, plain,
% 0.21/0.49  	$false,
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c9, c24])).
% 0.21/0.49  cnf(c26, plain,
% 0.21/0.49  	$false,
% 0.21/0.49  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c9, c24])).
% 0.21/0.49  
% 0.21/0.49  cnf(c27, plain,
% 0.21/0.49  	$false,
% 0.21/0.49  	inference(constraint_solving, [
% 0.21/0.49  		bind(X0, sK3),
% 0.21/0.49  		bind(X1, intersection(sK4,sK5)),
% 0.21/0.49  		bind(X2, sK1(X0,X1)),
% 0.21/0.49  		bind(X3, sK4),
% 0.21/0.49  		bind(X4, sK3),
% 0.21/0.49  		bind(X5, sK1(X0,X1)),
% 0.21/0.49  		bind(X6, sK4),
% 0.21/0.49  		bind(X7, sK5),
% 0.21/0.49  		bind(X8, sK3),
% 0.21/0.49  		bind(X9, intersection(sK4,sK5)),
% 0.21/0.49  		bind(X10, sK1(X0,X1)),
% 0.21/0.49  		bind(X11, sK5),
% 0.21/0.49  		bind(X12, sK3)
% 0.21/0.49  	],
% 0.21/0.49  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 0.21/0.49  
% 0.21/0.49  % SZS output end IncompleteProof
%------------------------------------------------------------------------------