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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SEU117+1 : TPTP v8.1.0. Released v3.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 : n016.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 11:53:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SEU117+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n016.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 : Sun Jun 19 05:30:38 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.21/0.39  % SZS status Theorem
% 0.21/0.39  % SZS output begin IncompleteProof
% 0.21/0.39  cnf(c0, axiom,
% 0.21/0.39  	element(sK16,finite_subsets(sK15))).
% 0.21/0.39  cnf(c1, plain,
% 0.21/0.39  	element(sK16,finite_subsets(sK15)),
% 0.21/0.39  	inference(start, [], [c0])).
% 0.21/0.39  
% 0.21/0.39  cnf(c2, axiom,
% 0.21/0.39  	in(X0,X1) | empty(X1) | ~element(X0,X1)).
% 0.21/0.39  cnf(a0, assumption,
% 0.21/0.39  	sK16 = X0).
% 0.21/0.39  cnf(a1, assumption,
% 0.21/0.39  	finite_subsets(sK15) = X1).
% 0.21/0.39  cnf(c3, plain,
% 0.21/0.39  	$false,
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.21/0.39  cnf(c4, plain,
% 0.21/0.39  	in(X0,X1) | empty(X1),
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.21/0.39  
% 0.21/0.39  cnf(c5, axiom,
% 0.21/0.39  	sP2(X2,X3) | ~in(X2,X4) | ~sP3(X3,X4)).
% 0.21/0.39  cnf(a2, assumption,
% 0.21/0.39  	X0 = X2).
% 0.21/0.39  cnf(a3, assumption,
% 0.21/0.39  	X1 = X4).
% 0.21/0.39  cnf(c6, plain,
% 0.21/0.39  	empty(X1),
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.21/0.39  cnf(c7, plain,
% 0.21/0.39  	sP2(X2,X3) | ~sP3(X3,X4),
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.21/0.39  
% 0.21/0.39  cnf(c8, axiom,
% 0.21/0.39  	subset(X5,X6) | ~sP2(X5,X6)).
% 0.21/0.39  cnf(a4, assumption,
% 0.21/0.39  	X2 = X5).
% 0.21/0.39  cnf(a5, assumption,
% 0.21/0.39  	X3 = X6).
% 0.21/0.39  cnf(c9, plain,
% 0.21/0.39  	~sP3(X3,X4),
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.21/0.39  cnf(c10, plain,
% 0.21/0.39  	subset(X5,X6),
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.21/0.39  
% 0.21/0.39  cnf(c11, axiom,
% 0.21/0.39  	element(X7,powerset(X8)) | ~subset(X7,X8)).
% 0.21/0.39  cnf(a6, assumption,
% 0.21/0.39  	X5 = X7).
% 0.21/0.39  cnf(a7, assumption,
% 0.21/0.39  	X6 = X8).
% 0.21/0.39  cnf(c12, plain,
% 0.21/0.39  	$false,
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.21/0.39  cnf(c13, plain,
% 0.21/0.39  	element(X7,powerset(X8)),
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.21/0.39  
% 0.21/0.39  cnf(c14, axiom,
% 0.21/0.39  	~element(sK16,powerset(sK15))).
% 0.21/0.39  cnf(a8, assumption,
% 0.21/0.39  	X7 = sK16).
% 0.21/0.39  cnf(a9, assumption,
% 0.21/0.39  	powerset(X8) = powerset(sK15)).
% 0.21/0.39  cnf(c15, plain,
% 0.21/0.39  	$false,
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 0.21/0.39  cnf(c16, plain,
% 0.21/0.39  	$false,
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 0.21/0.39  
% 0.21/0.39  cnf(c17, axiom,
% 0.21/0.39  	sP3(X9,finite_subsets(X9)) | ~sP4(finite_subsets(X9),X9)).
% 0.21/0.39  cnf(a10, assumption,
% 0.21/0.39  	X3 = X9).
% 0.21/0.39  cnf(a11, assumption,
% 0.21/0.39  	X4 = finite_subsets(X9)).
% 0.21/0.39  cnf(c18, plain,
% 0.21/0.39  	$false,
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c9, c17])).
% 0.21/0.39  cnf(c19, plain,
% 0.21/0.39  	~sP4(finite_subsets(X9),X9),
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c9, c17])).
% 0.21/0.39  
% 0.21/0.39  cnf(c20, axiom,
% 0.21/0.39  	sP4(X10,X11) | ~preboolean(X10)).
% 0.21/0.39  cnf(a12, assumption,
% 0.21/0.39  	finite_subsets(X9) = X10).
% 0.21/0.39  cnf(a13, assumption,
% 0.21/0.39  	X9 = X11).
% 0.21/0.39  cnf(c21, plain,
% 0.21/0.39  	$false,
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 0.21/0.39  cnf(c22, plain,
% 0.21/0.39  	~preboolean(X10),
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 0.21/0.39  
% 0.21/0.39  cnf(c23, axiom,
% 0.21/0.39  	preboolean(finite_subsets(X12))).
% 0.21/0.39  cnf(a14, assumption,
% 0.21/0.39  	X10 = finite_subsets(X12)).
% 0.21/0.39  cnf(c24, plain,
% 0.21/0.39  	$false,
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a14])], [c22, c23])).
% 0.21/0.39  cnf(c25, plain,
% 0.21/0.39  	$false,
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a14])], [c22, c23])).
% 0.21/0.39  
% 0.21/0.39  cnf(c26, axiom,
% 0.21/0.39  	~empty(finite_subsets(X13))).
% 0.21/0.39  cnf(a15, assumption,
% 0.21/0.39  	X1 = finite_subsets(X13)).
% 0.21/0.39  cnf(c27, plain,
% 0.21/0.39  	$false,
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a15])], [c6, c26])).
% 0.21/0.39  cnf(c28, plain,
% 0.21/0.39  	$false,
% 0.21/0.39  	inference(strict_predicate_extension, [assumptions([a15])], [c6, c26])).
% 0.21/0.39  
% 0.21/0.39  cnf(c29, plain,
% 0.21/0.39  	$false,
% 0.21/0.39  	inference(constraint_solving, [
% 0.21/0.39  		bind(X0, sK16),
% 0.21/0.39  		bind(X1, finite_subsets(sK15)),
% 0.21/0.39  		bind(X2, sK16),
% 0.21/0.39  		bind(X3, sK15),
% 0.21/0.39  		bind(X4, finite_subsets(sK15)),
% 0.21/0.39  		bind(X5, sK16),
% 0.21/0.39  		bind(X6, sK15),
% 0.21/0.39  		bind(X7, sK16),
% 0.21/0.39  		bind(X8, sK15),
% 0.21/0.39  		bind(X9, sK15),
% 0.21/0.39  		bind(X10, finite_subsets(X9)),
% 0.21/0.39  		bind(X11, sK15),
% 0.21/0.39  		bind(X12, sK15),
% 0.21/0.39  		bind(X13, sK15)
% 0.21/0.39  	],
% 0.21/0.39  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])).
% 0.21/0.39  
% 0.21/0.39  % SZS output end IncompleteProof
%------------------------------------------------------------------------------