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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET009+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 : n027.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:42:13 EDT 2022

% Result   : Theorem 0.14s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

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