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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET008+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 : n013.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:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET008+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.12/0.34  % Computer : n013.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 01:48:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.37  % SZS status Theorem
% 0.12/0.37  % SZS output begin IncompleteProof
% 0.12/0.37  cnf(c0, axiom,
% 0.12/0.37  	empty_set != intersection(difference(sK4,sK5),sK5)).
% 0.12/0.37  cnf(c1, plain,
% 0.12/0.37  	empty_set != intersection(difference(sK4,sK5),sK5),
% 0.12/0.37  	inference(start, [], [c0])).
% 0.12/0.37  
% 0.12/0.37  cnf(c2, axiom,
% 0.12/0.37  	X0 = X1 | ~sP0(X1,X0)).
% 0.12/0.37  cnf(a0, assumption,
% 0.12/0.37  	intersection(difference(sK4,sK5),sK5) = X1).
% 0.12/0.37  cnf(c3, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.37  cnf(c4, plain,
% 0.12/0.37  	~sP0(X1,X0),
% 0.12/0.37  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.37  cnf(c5, plain,
% 0.12/0.37  	X0 != X2 | empty_set != X2,
% 0.12/0.37  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.37  
% 0.12/0.37  cnf(a1, assumption,
% 0.12/0.37  	X0 = X2).
% 0.12/0.37  cnf(c6, plain,
% 0.12/0.37  	empty_set != X2,
% 0.12/0.37  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.12/0.37  
% 0.12/0.37  cnf(a2, assumption,
% 0.12/0.37  	empty_set = X2).
% 0.12/0.37  cnf(c7, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(reflexivity, [assumptions([a2])], [c6])).
% 0.12/0.37  
% 0.12/0.37  cnf(c8, axiom,
% 0.12/0.37  	sP0(X3,X4) | member(sK3(X3,X4),X3) | member(sK3(X3,X4),X4)).
% 0.12/0.37  cnf(a3, assumption,
% 0.12/0.37  	X1 = X3).
% 0.12/0.37  cnf(a4, assumption,
% 0.12/0.37  	X0 = X4).
% 0.12/0.37  cnf(c9, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.12/0.37  cnf(c10, plain,
% 0.12/0.37  	member(sK3(X3,X4),X3) | member(sK3(X3,X4),X4),
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.12/0.37  
% 0.12/0.37  cnf(c11, axiom,
% 0.12/0.37  	member(X5,X6) | ~member(X5,intersection(X7,X6))).
% 0.12/0.37  cnf(a5, assumption,
% 0.12/0.37  	sK3(X3,X4) = X5).
% 0.12/0.37  cnf(a6, assumption,
% 0.12/0.37  	X3 = intersection(X7,X6)).
% 0.12/0.37  cnf(c12, plain,
% 0.12/0.37  	member(sK3(X3,X4),X4),
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.12/0.37  cnf(c13, plain,
% 0.12/0.37  	member(X5,X6),
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.12/0.37  
% 0.12/0.37  cnf(c14, axiom,
% 0.12/0.37  	~member(X8,X9) | ~member(X8,difference(X10,X9))).
% 0.12/0.37  cnf(a7, assumption,
% 0.12/0.37  	X5 = X8).
% 0.12/0.37  cnf(a8, assumption,
% 0.12/0.37  	X6 = X9).
% 0.12/0.37  cnf(c15, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 0.12/0.37  cnf(c16, plain,
% 0.12/0.37  	~member(X8,difference(X10,X9)),
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 0.12/0.37  
% 0.12/0.37  cnf(c17, axiom,
% 0.12/0.37  	member(X11,X12) | ~member(X11,intersection(X12,X13))).
% 0.12/0.37  cnf(a9, assumption,
% 0.12/0.37  	X8 = X11).
% 0.12/0.37  cnf(a10, assumption,
% 0.12/0.37  	difference(X10,X9) = X12).
% 0.12/0.37  cnf(c18, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])).
% 0.12/0.37  cnf(c19, plain,
% 0.12/0.37  	~member(X11,intersection(X12,X13)),
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])).
% 0.12/0.37  
% 0.12/0.37  cnf(c20, plain,
% 0.12/0.37  	member(sK3(X3,X4),X3)).
% 0.12/0.37  cnf(a11, assumption,
% 0.12/0.37  	X11 = sK3(X3,X4)).
% 0.12/0.37  cnf(a12, assumption,
% 0.12/0.37  	intersection(X12,X13) = X3).
% 0.12/0.37  cnf(c21, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(predicate_reduction, [assumptions([a11, a12])], [c19, c20])).
% 0.12/0.37  
% 0.12/0.37  cnf(c22, axiom,
% 0.12/0.37  	~member(X14,empty_set)).
% 0.12/0.37  cnf(a13, assumption,
% 0.12/0.37  	sK3(X3,X4) = X14).
% 0.12/0.37  cnf(a14, assumption,
% 0.12/0.37  	X4 = empty_set).
% 0.12/0.37  cnf(c23, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c12, c22])).
% 0.12/0.37  cnf(c24, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c12, c22])).
% 0.12/0.37  
% 0.12/0.37  cnf(c25, plain,
% 0.12/0.37  	$false,
% 0.12/0.37  	inference(constraint_solving, [
% 0.12/0.37  		bind(X0, empty_set),
% 0.12/0.37  		bind(X1, intersection(difference(sK4,sK5),sK5)),
% 0.12/0.37  		bind(X2, empty_set),
% 0.12/0.37  		bind(X3, intersection(difference(sK4,sK5),sK5)),
% 0.12/0.37  		bind(X4, empty_set),
% 0.12/0.37  		bind(X5, sK3(X3,X4)),
% 0.12/0.37  		bind(X6, sK5),
% 0.12/0.37  		bind(X7, difference(sK4,sK5)),
% 0.12/0.37  		bind(X8, sK3(X3,X4)),
% 0.12/0.37  		bind(X9, sK5),
% 0.12/0.37  		bind(X10, sK4),
% 0.12/0.37  		bind(X11, sK3(X3,X4)),
% 0.12/0.37  		bind(X12, difference(X10,X9)),
% 0.12/0.37  		bind(X13, sK5),
% 0.12/0.37  		bind(X14, sK3(X3,X4))
% 0.12/0.37  	],
% 0.12/0.37  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])).
% 0.12/0.37  
% 0.12/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------