TSTP Solution File: SEU137+2 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SEU137+2 : 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 : n004.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:23 EDT 2022

% Result   : Theorem 0.10s 0.44s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : SEU137+2 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.07  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.06/0.25  % Computer : n004.cluster.edu
% 0.06/0.25  % Model    : x86_64 x86_64
% 0.06/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25  % Memory   : 8042.1875MB
% 0.06/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25  % CPULimit : 300
% 0.06/0.25  % WCLimit  : 600
% 0.06/0.25  % DateTime : Mon Jun 20 09:04:53 EDT 2022
% 0.06/0.25  % CPUTime  : 
% 0.10/0.44  % SZS status Theorem
% 0.10/0.44  % SZS output begin IncompleteProof
% 0.10/0.44  cnf(c0, axiom,
% 0.10/0.44  	sK16 != set_union2(sK15,set_difference(sK16,sK15))).
% 0.10/0.44  cnf(c1, plain,
% 0.10/0.44  	sK16 != set_union2(sK15,set_difference(sK16,sK15)),
% 0.10/0.44  	inference(start, [], [c0])).
% 0.10/0.44  
% 0.10/0.44  cnf(c2, axiom,
% 0.10/0.44  	set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0))).
% 0.10/0.44  cnf(a0, assumption,
% 0.10/0.44  	set_union2(sK15,set_difference(sK16,sK15)) = set_union2(X0,set_difference(X1,X0))).
% 0.10/0.44  cnf(c3, plain,
% 0.10/0.44  	$false,
% 0.10/0.44  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.10/0.44  cnf(c4, plain,
% 0.10/0.44  	$false,
% 0.10/0.44  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.10/0.44  cnf(c5, plain,
% 0.10/0.44  	X2 != set_union2(X0,X1) | sK16 != X2,
% 0.10/0.44  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.10/0.44  
% 0.10/0.44  cnf(c6, axiom,
% 0.10/0.44  	set_union2(X3,X4) = X4 | ~subset(X3,X4)).
% 0.10/0.44  cnf(a1, assumption,
% 0.10/0.44  	set_union2(X0,X1) = set_union2(X3,X4)).
% 0.10/0.44  cnf(c7, plain,
% 0.10/0.44  	sK16 != X2,
% 0.10/0.44  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.10/0.44  cnf(c8, plain,
% 0.10/0.44  	~subset(X3,X4),
% 0.10/0.44  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.10/0.44  cnf(c9, plain,
% 0.10/0.44  	X5 != X4 | X2 != X5,
% 0.10/0.44  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.10/0.44  
% 0.10/0.44  cnf(a2, assumption,
% 0.10/0.44  	X5 = X4).
% 0.10/0.44  cnf(c10, plain,
% 0.10/0.44  	X2 != X5,
% 0.10/0.44  	inference(reflexivity, [assumptions([a2])], [c9])).
% 0.10/0.44  
% 0.10/0.44  cnf(a3, assumption,
% 0.10/0.44  	X2 = X5).
% 0.10/0.44  cnf(c11, plain,
% 0.10/0.44  	$false,
% 0.10/0.44  	inference(reflexivity, [assumptions([a3])], [c10])).
% 0.10/0.44  
% 0.10/0.44  cnf(c12, axiom,
% 0.10/0.44  	subset(sK15,sK16)).
% 0.10/0.44  cnf(a4, assumption,
% 0.10/0.44  	X3 = sK15).
% 0.10/0.44  cnf(a5, assumption,
% 0.10/0.44  	X4 = sK16).
% 0.10/0.44  cnf(c13, plain,
% 0.10/0.44  	$false,
% 0.10/0.44  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c12])).
% 0.10/0.44  cnf(c14, plain,
% 0.10/0.44  	$false,
% 0.10/0.44  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c12])).
% 0.10/0.44  
% 0.10/0.44  cnf(a6, assumption,
% 0.10/0.44  	sK16 = X2).
% 0.10/0.44  cnf(c15, plain,
% 0.10/0.44  	$false,
% 0.10/0.44  	inference(reflexivity, [assumptions([a6])], [c7])).
% 0.10/0.44  
% 0.10/0.44  cnf(c16, plain,
% 0.10/0.44  	$false,
% 0.10/0.44  	inference(constraint_solving, [
% 0.10/0.44  		bind(X0, sK15),
% 0.10/0.44  		bind(X1, sK16),
% 0.10/0.44  		bind(X2, sK16),
% 0.10/0.44  		bind(X3, sK15),
% 0.10/0.44  		bind(X4, sK16),
% 0.10/0.44  		bind(X5, sK16)
% 0.10/0.44  	],
% 0.10/0.44  	[a0, a1, a2, a3, a4, a5, a6])).
% 0.10/0.44  
% 0.10/0.44  % SZS output end IncompleteProof
%------------------------------------------------------------------------------