%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SEU116+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 : n032.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.07s 0.27s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : SEU116+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.08  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.07/0.26  % Computer : n032.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit : 300
% 0.07/0.26  % WCLimit  : 600
% 0.07/0.26  % DateTime : Sun Jun 19 11:44:48 EDT 2022
% 0.07/0.26  % CPUTime  : 
% 0.07/0.27  % SZS status Theorem
% 0.07/0.27  % SZS output begin IncompleteProof
% 0.07/0.27  cnf(c0, axiom,
% 0.07/0.27  	element(sK13,finite_subsets(sK12))).
% 0.07/0.27  cnf(c1, plain,
% 0.07/0.27  	element(sK13,finite_subsets(sK12)),
% 0.07/0.27  	inference(start, [], [c0])).
% 0.07/0.27  
% 0.07/0.27  cnf(c2, axiom,
% 0.07/0.27  	finite(X0) | ~element(X0,finite_subsets(X1))).
% 0.07/0.27  cnf(a0, assumption,
% 0.07/0.27  	sK13 = X0).
% 0.07/0.27  cnf(a1, assumption,
% 0.07/0.27  	finite_subsets(sK12) = finite_subsets(X1)).
% 0.07/0.27  cnf(c3, plain,
% 0.07/0.27  	$false,
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.07/0.27  cnf(c4, plain,
% 0.07/0.27  	finite(X0),
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.07/0.27  
% 0.07/0.27  cnf(c5, axiom,
% 0.07/0.27  	~finite(sK13)).
% 0.07/0.27  cnf(a2, assumption,
% 0.07/0.27  	X0 = sK13).
% 0.07/0.27  cnf(c6, plain,
% 0.07/0.27  	$false,
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.07/0.27  cnf(c7, plain,
% 0.07/0.27  	$false,
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.07/0.27  
% 0.07/0.27  cnf(c8, plain,
% 0.07/0.27  	$false,
% 0.07/0.27  	inference(constraint_solving, [
% 0.07/0.27  		bind(X0, sK13),
% 0.07/0.27  		bind(X1, sK12)
% 0.07/0.27  	],
% 0.07/0.27  	[a0, a1, a2])).
% 0.07/0.27  
% 0.07/0.27  % SZS output end IncompleteProof
%------------------------------------------------------------------------------