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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET979+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 : n022.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:49:34 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SET979+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35  % Computer : n022.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sat Jul  9 21:09:25 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.21/0.36  % SZS status Theorem
% 0.21/0.36  % SZS output begin IncompleteProof
% 0.21/0.36  cnf(c0, axiom,
% 0.21/0.36  	set_union2(cartesian_product2(sK4,singleton(sK2)),cartesian_product2(sK4,singleton(sK3))) != cartesian_product2(sK4,set_union2(singleton(sK2),singleton(sK3))) | set_union2(cartesian_product2(singleton(sK2),sK4),cartesian_product2(singleton(sK3),sK4)) != cartesian_product2(set_union2(singleton(sK2),singleton(sK3)),sK4)).
% 0.21/0.36  cnf(c1, plain,
% 0.21/0.36  	set_union2(cartesian_product2(sK4,singleton(sK2)),cartesian_product2(sK4,singleton(sK3))) != cartesian_product2(sK4,set_union2(singleton(sK2),singleton(sK3))) | set_union2(cartesian_product2(singleton(sK2),sK4),cartesian_product2(singleton(sK3),sK4)) != cartesian_product2(set_union2(singleton(sK2),singleton(sK3)),sK4),
% 0.21/0.36  	inference(start, [], [c0])).
% 0.21/0.36  
% 0.21/0.36  cnf(c2, axiom,
% 0.21/0.36  	cartesian_product2(X0,set_union2(X1,X2)) = set_union2(cartesian_product2(X0,X1),cartesian_product2(X0,X2))).
% 0.21/0.36  cnf(a0, assumption,
% 0.21/0.36  	cartesian_product2(sK4,set_union2(singleton(sK2),singleton(sK3))) = cartesian_product2(X0,set_union2(X1,X2))).
% 0.21/0.36  cnf(c3, plain,
% 0.21/0.36  	set_union2(cartesian_product2(singleton(sK2),sK4),cartesian_product2(singleton(sK3),sK4)) != cartesian_product2(set_union2(singleton(sK2),singleton(sK3)),sK4),
% 0.21/0.36  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.21/0.36  cnf(c4, plain,
% 0.21/0.36  	$false,
% 0.21/0.36  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.21/0.36  cnf(c5, plain,
% 0.21/0.36  	X3 != set_union2(cartesian_product2(X0,X1),cartesian_product2(X0,X2)) | set_union2(cartesian_product2(sK4,singleton(sK2)),cartesian_product2(sK4,singleton(sK3))) != X3,
% 0.21/0.36  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.21/0.36  
% 0.21/0.36  cnf(a1, assumption,
% 0.21/0.36  	X3 = set_union2(cartesian_product2(X0,X1),cartesian_product2(X0,X2))).
% 0.21/0.36  cnf(c6, plain,
% 0.21/0.36  	set_union2(cartesian_product2(sK4,singleton(sK2)),cartesian_product2(sK4,singleton(sK3))) != X3,
% 0.21/0.36  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.21/0.36  
% 0.21/0.36  cnf(a2, assumption,
% 0.21/0.36  	set_union2(cartesian_product2(sK4,singleton(sK2)),cartesian_product2(sK4,singleton(sK3))) = X3).
% 0.21/0.36  cnf(c7, plain,
% 0.21/0.36  	$false,
% 0.21/0.36  	inference(reflexivity, [assumptions([a2])], [c6])).
% 0.21/0.36  
% 0.21/0.36  cnf(c8, axiom,
% 0.21/0.36  	cartesian_product2(set_union2(X4,X5),X6) = set_union2(cartesian_product2(X4,X6),cartesian_product2(X5,X6))).
% 0.21/0.36  cnf(a3, assumption,
% 0.21/0.36  	cartesian_product2(set_union2(singleton(sK2),singleton(sK3)),sK4) = cartesian_product2(set_union2(X4,X5),X6)).
% 0.21/0.36  cnf(c9, plain,
% 0.21/0.36  	$false,
% 0.21/0.36  	inference(strict_function_extension, [assumptions([a3])], [c3, c8])).
% 0.21/0.36  cnf(c10, plain,
% 0.21/0.36  	$false,
% 0.21/0.36  	inference(strict_function_extension, [assumptions([a3])], [c3, c8])).
% 0.21/0.36  cnf(c11, plain,
% 0.21/0.36  	X7 != set_union2(cartesian_product2(X4,X6),cartesian_product2(X5,X6)) | set_union2(cartesian_product2(singleton(sK2),sK4),cartesian_product2(singleton(sK3),sK4)) != X7,
% 0.21/0.36  	inference(strict_function_extension, [assumptions([a3])], [c3, c8])).
% 0.21/0.36  
% 0.21/0.36  cnf(a4, assumption,
% 0.21/0.36  	X7 = set_union2(cartesian_product2(X4,X6),cartesian_product2(X5,X6))).
% 0.21/0.36  cnf(c12, plain,
% 0.21/0.36  	set_union2(cartesian_product2(singleton(sK2),sK4),cartesian_product2(singleton(sK3),sK4)) != X7,
% 0.21/0.36  	inference(reflexivity, [assumptions([a4])], [c11])).
% 0.21/0.36  
% 0.21/0.36  cnf(a5, assumption,
% 0.21/0.36  	set_union2(cartesian_product2(singleton(sK2),sK4),cartesian_product2(singleton(sK3),sK4)) = X7).
% 0.21/0.36  cnf(c13, plain,
% 0.21/0.36  	$false,
% 0.21/0.36  	inference(reflexivity, [assumptions([a5])], [c12])).
% 0.21/0.36  
% 0.21/0.36  cnf(c14, plain,
% 0.21/0.36  	$false,
% 0.21/0.36  	inference(constraint_solving, [
% 0.21/0.36  		bind(X0, sK4),
% 0.21/0.36  		bind(X1, singleton(sK2)),
% 0.21/0.36  		bind(X2, singleton(sK3)),
% 0.21/0.36  		bind(X3, set_union2(cartesian_product2(X0,X1),cartesian_product2(X0,X2))),
% 0.21/0.36  		bind(X4, singleton(sK2)),
% 0.21/0.36  		bind(X5, singleton(sK3)),
% 0.21/0.36  		bind(X6, sK4),
% 0.21/0.36  		bind(X7, set_union2(cartesian_product2(X4,X6),cartesian_product2(X5,X6)))
% 0.21/0.36  	],
% 0.21/0.36  	[a0, a1, a2, a3, a4, a5])).
% 0.21/0.36  
% 0.21/0.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------