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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SEU153+1 : TPTP v8.1.0. Released v3.3.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:33 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem  : SEU153+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.08  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.08/0.27  % Computer : n032.cluster.edu
% 0.08/0.27  % Model    : x86_64 x86_64
% 0.08/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27  % Memory   : 8042.1875MB
% 0.08/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27  % CPULimit : 300
% 0.08/0.27  % WCLimit  : 600
% 0.08/0.27  % DateTime : Sat Jun 18 21:13:47 EDT 2022
% 0.08/0.27  % CPUTime  : 
% 0.12/0.33  % SZS status Theorem
% 0.12/0.33  % SZS output begin IncompleteProof
% 0.12/0.33  cnf(c0, axiom,
% 0.12/0.33  	disjoint(singleton(sK6),sK7)).
% 0.12/0.33  cnf(c1, plain,
% 0.12/0.33  	disjoint(singleton(sK6),sK7),
% 0.12/0.33  	inference(start, [], [c0])).
% 0.12/0.33  
% 0.12/0.33  cnf(c2, axiom,
% 0.12/0.33  	set_intersection2(X0,X1) = empty_set | ~disjoint(X0,X1)).
% 0.12/0.33  cnf(a0, assumption,
% 0.12/0.33  	singleton(sK6) = X0).
% 0.12/0.33  cnf(a1, assumption,
% 0.12/0.33  	sK7 = X1).
% 0.12/0.33  cnf(c3, plain,
% 0.12/0.33  	$false,
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.33  cnf(c4, plain,
% 0.12/0.33  	set_intersection2(X0,X1) = empty_set,
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.33  
% 0.12/0.33  cnf(c5, axiom,
% 0.12/0.33  	sP2(X2,X3,set_intersection2(X2,X3))).
% 0.12/0.33  cnf(a2, assumption,
% 0.12/0.33  	set_intersection2(X2,X3) = set_intersection2(X0,X1)).
% 0.12/0.33  cnf(a3, assumption,
% 0.12/0.33  	empty_set = X4).
% 0.12/0.33  cnf(c6, plain,
% 0.12/0.33  	$false,
% 0.12/0.33  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.33  cnf(c7, plain,
% 0.12/0.33  	$false,
% 0.12/0.33  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.33  cnf(c8, plain,
% 0.12/0.33  	sP2(X2,X3,X4),
% 0.12/0.33  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.33  
% 0.12/0.33  cnf(c9, axiom,
% 0.12/0.33  	in(X5,X6) | ~sP1(X7,X5,X8) | ~sP2(X8,X7,X6)).
% 0.12/0.33  cnf(a4, assumption,
% 0.12/0.33  	X2 = X8).
% 0.12/0.33  cnf(a5, assumption,
% 0.12/0.33  	X3 = X7).
% 0.12/0.33  cnf(a6, assumption,
% 0.12/0.33  	X4 = X6).
% 0.12/0.33  cnf(c10, plain,
% 0.12/0.33  	$false,
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c8, c9])).
% 0.12/0.33  cnf(c11, plain,
% 0.12/0.33  	in(X5,X6) | ~sP1(X7,X5,X8),
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c8, c9])).
% 0.12/0.33  
% 0.12/0.33  cnf(c12, axiom,
% 0.12/0.33  	~in(X9,empty_set)).
% 0.12/0.33  cnf(a7, assumption,
% 0.12/0.33  	X5 = X9).
% 0.12/0.33  cnf(a8, assumption,
% 0.12/0.33  	X6 = empty_set).
% 0.12/0.33  cnf(c13, plain,
% 0.12/0.33  	~sP1(X7,X5,X8),
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c12])).
% 0.12/0.33  cnf(c14, plain,
% 0.12/0.33  	$false,
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c12])).
% 0.12/0.33  
% 0.12/0.33  cnf(c15, axiom,
% 0.12/0.33  	sP1(X10,X11,X12) | ~in(X11,X10) | ~in(X11,X12)).
% 0.12/0.33  cnf(a9, assumption,
% 0.12/0.33  	X7 = X10).
% 0.12/0.33  cnf(a10, assumption,
% 0.12/0.33  	X5 = X11).
% 0.12/0.33  cnf(a11, assumption,
% 0.12/0.33  	X8 = X12).
% 0.12/0.33  cnf(c16, plain,
% 0.12/0.33  	$false,
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c13, c15])).
% 0.12/0.33  cnf(c17, plain,
% 0.12/0.33  	~in(X11,X10) | ~in(X11,X12),
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c13, c15])).
% 0.12/0.33  
% 0.12/0.33  cnf(c18, axiom,
% 0.12/0.33  	in(sK6,sK7)).
% 0.12/0.33  cnf(a12, assumption,
% 0.12/0.33  	X11 = sK6).
% 0.12/0.33  cnf(a13, assumption,
% 0.12/0.33  	X10 = sK7).
% 0.12/0.33  cnf(c19, plain,
% 0.12/0.33  	~in(X11,X12),
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c18])).
% 0.12/0.33  cnf(c20, plain,
% 0.12/0.33  	$false,
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c18])).
% 0.12/0.33  
% 0.12/0.33  cnf(c21, axiom,
% 0.12/0.33  	in(X13,X14) | ~sP0(X13,X14)).
% 0.12/0.33  cnf(a14, assumption,
% 0.12/0.33  	X11 = X13).
% 0.12/0.33  cnf(a15, assumption,
% 0.12/0.33  	X12 = X14).
% 0.12/0.33  cnf(c22, plain,
% 0.12/0.33  	$false,
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c19, c21])).
% 0.12/0.33  cnf(c23, plain,
% 0.12/0.33  	~sP0(X13,X14),
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c19, c21])).
% 0.12/0.33  
% 0.12/0.33  cnf(c24, axiom,
% 0.12/0.33  	sP0(X15,singleton(X15))).
% 0.12/0.33  cnf(a16, assumption,
% 0.12/0.33  	X13 = X15).
% 0.12/0.33  cnf(a17, assumption,
% 0.12/0.33  	X14 = singleton(X15)).
% 0.12/0.33  cnf(c25, plain,
% 0.12/0.33  	$false,
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])).
% 0.12/0.33  cnf(c26, plain,
% 0.12/0.33  	$false,
% 0.12/0.33  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])).
% 0.12/0.33  
% 0.12/0.33  cnf(c27, plain,
% 0.12/0.33  	$false,
% 0.12/0.33  	inference(constraint_solving, [
% 0.12/0.33  		bind(X0, singleton(sK6)),
% 0.12/0.33  		bind(X1, sK7),
% 0.12/0.33  		bind(X2, singleton(sK6)),
% 0.12/0.33  		bind(X3, sK7),
% 0.12/0.33  		bind(X4, empty_set),
% 0.12/0.33  		bind(X5, sK6),
% 0.12/0.33  		bind(X6, empty_set),
% 0.12/0.33  		bind(X7, sK7),
% 0.12/0.33  		bind(X8, singleton(sK6)),
% 0.12/0.33  		bind(X9, sK6),
% 0.12/0.33  		bind(X10, sK7),
% 0.12/0.33  		bind(X11, sK6),
% 0.12/0.33  		bind(X12, singleton(sK6)),
% 0.12/0.33  		bind(X13, sK6),
% 0.12/0.33  		bind(X14, singleton(sK6)),
% 0.12/0.33  		bind(X15, sK6)
% 0.12/0.33  	],
% 0.12/0.33  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 0.12/0.33  
% 0.12/0.33  % SZS output end IncompleteProof
%------------------------------------------------------------------------------