TSTP Solution File: SET014-2 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET014-2 : TPTP v8.1.0. Bugfixed v2.1.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 02:42:19 EDT 2022

% Result   : Unsatisfiable 2.32s 0.65s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET014-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 10:35:57 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 2.32/0.65  % SZS status Unsatisfiable
% 2.32/0.65  % SZS output begin IncompleteProof
% 2.32/0.65  cnf(c0, axiom,
% 2.32/0.65  	~subset(union(as,bs),cs)).
% 2.32/0.65  cnf(c1, plain,
% 2.32/0.65  	~subset(union(as,bs),cs),
% 2.32/0.65  	inference(start, [], [c0])).
% 2.32/0.65  
% 2.32/0.65  cnf(c2, axiom,
% 2.32/0.65  	subset(X0,X1) | ~member(member_of_1_not_of_2(X0,X1),X1)).
% 2.32/0.65  cnf(a0, assumption,
% 2.32/0.65  	union(as,bs) = X0).
% 2.32/0.65  cnf(a1, assumption,
% 2.32/0.65  	cs = X1).
% 2.32/0.65  cnf(c3, plain,
% 2.32/0.65  	$false,
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.32/0.65  cnf(c4, plain,
% 2.32/0.65  	~member(member_of_1_not_of_2(X0,X1),X1),
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.32/0.65  
% 2.32/0.65  cnf(c5, axiom,
% 2.32/0.65  	member(X2,X3) | ~subset(X4,X3) | ~member(X2,X4)).
% 2.32/0.65  cnf(a2, assumption,
% 2.32/0.65  	member_of_1_not_of_2(X0,X1) = X2).
% 2.32/0.65  cnf(a3, assumption,
% 2.32/0.65  	X1 = X3).
% 2.32/0.65  cnf(c6, plain,
% 2.32/0.65  	$false,
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.32/0.65  cnf(c7, plain,
% 2.32/0.65  	~subset(X4,X3) | ~member(X2,X4),
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.32/0.65  
% 2.32/0.65  cnf(c8, axiom,
% 2.32/0.65  	subset(as,cs)).
% 2.32/0.65  cnf(a4, assumption,
% 2.32/0.65  	X4 = as).
% 2.32/0.65  cnf(a5, assumption,
% 2.32/0.65  	X3 = cs).
% 2.32/0.65  cnf(c9, plain,
% 2.32/0.65  	~member(X2,X4),
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 2.32/0.65  cnf(c10, plain,
% 2.32/0.65  	$false,
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 2.32/0.65  
% 2.32/0.65  cnf(c11, axiom,
% 2.32/0.65  	member(X5,X6) | member(X5,X7) | ~member(X5,union(X7,X6))).
% 2.32/0.65  cnf(a6, assumption,
% 2.32/0.65  	X2 = X5).
% 2.32/0.65  cnf(a7, assumption,
% 2.32/0.65  	X4 = X7).
% 2.32/0.65  cnf(c12, plain,
% 2.32/0.65  	$false,
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 2.32/0.65  cnf(c13, plain,
% 2.32/0.65  	member(X5,X6) | ~member(X5,union(X7,X6)),
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 2.32/0.65  
% 2.32/0.65  cnf(c14, axiom,
% 2.32/0.65  	member(X8,X9) | ~subset(X10,X9) | ~member(X8,X10)).
% 2.32/0.65  cnf(a8, assumption,
% 2.32/0.65  	X5 = X8).
% 2.32/0.65  cnf(a9, assumption,
% 2.32/0.65  	X6 = X10).
% 2.32/0.65  cnf(c15, plain,
% 2.32/0.65  	~member(X5,union(X7,X6)),
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 2.32/0.65  cnf(c16, plain,
% 2.32/0.65  	member(X8,X9) | ~subset(X10,X9),
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 2.32/0.65  
% 2.32/0.65  cnf(c17, plain,
% 2.32/0.65  	~member(member_of_1_not_of_2(X0,X1),X1)).
% 2.32/0.65  cnf(a10, assumption,
% 2.32/0.65  	X8 = member_of_1_not_of_2(X0,X1)).
% 2.32/0.65  cnf(a11, assumption,
% 2.32/0.65  	X9 = X1).
% 2.32/0.65  cnf(c18, plain,
% 2.32/0.65  	~subset(X10,X9),
% 2.32/0.65  	inference(predicate_reduction, [assumptions([a10, a11])], [c16, c17])).
% 2.32/0.65  
% 2.32/0.65  cnf(c19, axiom,
% 2.32/0.65  	subset(bs,cs)).
% 2.32/0.65  cnf(a12, assumption,
% 2.32/0.65  	X10 = bs).
% 2.32/0.65  cnf(a13, assumption,
% 2.32/0.65  	X9 = cs).
% 2.32/0.65  cnf(c20, plain,
% 2.32/0.65  	$false,
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])).
% 2.32/0.65  cnf(c21, plain,
% 2.32/0.65  	$false,
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])).
% 2.32/0.65  
% 2.32/0.65  cnf(c22, axiom,
% 2.32/0.65  	member(member_of_1_not_of_2(X11,X12),X11) | subset(X11,X12)).
% 2.32/0.65  cnf(a14, assumption,
% 2.32/0.65  	X5 = member_of_1_not_of_2(X11,X12)).
% 2.32/0.65  cnf(a15, assumption,
% 2.32/0.65  	union(X7,X6) = X11).
% 2.32/0.65  cnf(c23, plain,
% 2.32/0.65  	$false,
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c15, c22])).
% 2.32/0.65  cnf(c24, plain,
% 2.32/0.65  	subset(X11,X12),
% 2.32/0.65  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c15, c22])).
% 2.32/0.65  
% 2.32/0.65  cnf(c25, plain,
% 2.32/0.65  	~subset(union(as,bs),cs)).
% 2.32/0.65  cnf(a16, assumption,
% 2.32/0.65  	X11 = union(as,bs)).
% 2.32/0.65  cnf(a17, assumption,
% 2.32/0.65  	X12 = cs).
% 2.32/0.65  cnf(c26, plain,
% 2.32/0.65  	$false,
% 2.32/0.65  	inference(predicate_reduction, [assumptions([a16, a17])], [c24, c25])).
% 2.32/0.65  
% 2.32/0.65  cnf(c27, plain,
% 2.32/0.65  	$false,
% 2.32/0.65  	inference(constraint_solving, [
% 2.32/0.65  		bind(X0, union(as,bs)),
% 2.32/0.65  		bind(X1, cs),
% 2.32/0.65  		bind(X2, member_of_1_not_of_2(X0,X1)),
% 2.32/0.65  		bind(X3, cs),
% 2.32/0.65  		bind(X4, as),
% 2.32/0.65  		bind(X5, member_of_1_not_of_2(X0,X1)),
% 2.32/0.65  		bind(X6, bs),
% 2.32/0.65  		bind(X7, as),
% 2.32/0.65  		bind(X8, member_of_1_not_of_2(X0,X1)),
% 2.32/0.65  		bind(X9, cs),
% 2.32/0.65  		bind(X10, bs),
% 2.32/0.65  		bind(X11, union(as,bs)),
% 2.32/0.65  		bind(X12, cs)
% 2.32/0.65  	],
% 2.32/0.65  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 2.32/0.65  
% 2.32/0.65  % SZS output end IncompleteProof
%------------------------------------------------------------------------------