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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET985+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 : n005.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:36 EDT 2022

% Result   : Theorem 35.49s 4.85s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET985+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33  % Computer : n005.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul 11 06:23:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 35.49/4.85  % SZS status Theorem
% 35.49/4.85  % SZS output begin IncompleteProof
% 35.49/4.85  cnf(c0, axiom,
% 35.49/4.85  	~subset(sK3,sK5)).
% 35.49/4.85  cnf(c1, plain,
% 35.49/4.85  	~subset(sK3,sK5),
% 35.49/4.85  	inference(start, [], [c0])).
% 35.49/4.85  
% 35.49/4.85  cnf(c2, axiom,
% 35.49/4.85  	subset(X0,X1) | empty_set = cartesian_product2(X2,X0) | ~subset(cartesian_product2(X2,X0),cartesian_product2(X3,X1))).
% 35.49/4.85  cnf(a0, assumption,
% 35.49/4.85  	sK3 = X0).
% 35.49/4.85  cnf(a1, assumption,
% 35.49/4.85  	sK5 = X1).
% 35.49/4.85  cnf(c3, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 35.49/4.85  cnf(c4, plain,
% 35.49/4.85  	empty_set = cartesian_product2(X2,X0) | ~subset(cartesian_product2(X2,X0),cartesian_product2(X3,X1)),
% 35.49/4.85  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 35.49/4.85  
% 35.49/4.85  cnf(c5, axiom,
% 35.49/4.85  	empty_set = X4 | empty_set = X5 | empty_set != cartesian_product2(X5,X4)).
% 35.49/4.85  cnf(a2, assumption,
% 35.49/4.85  	cartesian_product2(X5,X4) = cartesian_product2(X2,X0)).
% 35.49/4.85  cnf(a3, assumption,
% 35.49/4.85  	empty_set = X6).
% 35.49/4.85  cnf(c6, plain,
% 35.49/4.85  	~subset(cartesian_product2(X2,X0),cartesian_product2(X3,X1)),
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 35.49/4.85  cnf(c7, plain,
% 35.49/4.85  	empty_set = X4 | empty_set = X5,
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 35.49/4.85  cnf(c8, plain,
% 35.49/4.85  	empty_set != X6,
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 35.49/4.85  
% 35.49/4.85  cnf(a4, assumption,
% 35.49/4.85  	empty_set = X6).
% 35.49/4.85  cnf(c9, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(reflexivity, [assumptions([a4])], [c8])).
% 35.49/4.85  
% 35.49/4.85  cnf(c10, plain,
% 35.49/4.85  	~subset(sK3,sK5)).
% 35.49/4.85  cnf(a5, assumption,
% 35.49/4.85  	sK3 = X4).
% 35.49/4.85  cnf(a6, assumption,
% 35.49/4.85  	empty_set = X7).
% 35.49/4.85  cnf(c11, plain,
% 35.49/4.85  	empty_set = X5,
% 35.49/4.85  	inference(subterm_reduction, [assumptions([a5, a6])], [c7, c10])).
% 35.49/4.85  cnf(c12, plain,
% 35.49/4.85  	~subset(X7,sK5),
% 35.49/4.85  	inference(subterm_reduction, [assumptions([a5, a6])], [c7, c10])).
% 35.49/4.85  
% 35.49/4.85  cnf(c13, axiom,
% 35.49/4.85  	subset(empty_set,X8)).
% 35.49/4.85  cnf(a7, assumption,
% 35.49/4.85  	X7 = empty_set).
% 35.49/4.85  cnf(a8, assumption,
% 35.49/4.85  	sK5 = X8).
% 35.49/4.85  cnf(c14, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c12, c13])).
% 35.49/4.85  cnf(c15, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c12, c13])).
% 35.49/4.85  
% 35.49/4.85  cnf(c16, axiom,
% 35.49/4.85  	~empty(sK2)).
% 35.49/4.85  cnf(a9, assumption,
% 35.49/4.85  	sK2 = X5).
% 35.49/4.85  cnf(a10, assumption,
% 35.49/4.85  	empty_set = X9).
% 35.49/4.85  cnf(c17, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a9, a10])], [c11, c16])).
% 35.49/4.85  cnf(c18, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a9, a10])], [c11, c16])).
% 35.49/4.85  cnf(c19, plain,
% 35.49/4.85  	~empty(X9),
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a9, a10])], [c11, c16])).
% 35.49/4.85  
% 35.49/4.85  cnf(c20, axiom,
% 35.49/4.85  	empty(empty_set)).
% 35.49/4.85  cnf(a11, assumption,
% 35.49/4.85  	X9 = empty_set).
% 35.49/4.85  cnf(c21, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(strict_predicate_extension, [assumptions([a11])], [c19, c20])).
% 35.49/4.85  cnf(c22, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(strict_predicate_extension, [assumptions([a11])], [c19, c20])).
% 35.49/4.85  
% 35.49/4.85  cnf(c23, axiom,
% 35.49/4.85  	subset(cartesian_product2(sK3,sK2),cartesian_product2(sK5,sK4)) | subset(cartesian_product2(sK2,sK3),cartesian_product2(sK4,sK5))).
% 35.49/4.85  cnf(a12, assumption,
% 35.49/4.85  	cartesian_product2(X2,X0) = cartesian_product2(sK2,sK3)).
% 35.49/4.85  cnf(a13, assumption,
% 35.49/4.85  	cartesian_product2(X3,X1) = cartesian_product2(sK4,sK5)).
% 35.49/4.85  cnf(c24, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c23])).
% 35.49/4.85  cnf(c25, plain,
% 35.49/4.85  	subset(cartesian_product2(sK3,sK2),cartesian_product2(sK5,sK4)),
% 35.49/4.85  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c23])).
% 35.49/4.85  
% 35.49/4.85  cnf(c26, axiom,
% 35.49/4.85  	subset(X10,X11) | empty_set = cartesian_product2(X10,X12) | ~subset(cartesian_product2(X10,X12),cartesian_product2(X11,X13))).
% 35.49/4.85  cnf(a14, assumption,
% 35.49/4.85  	cartesian_product2(sK3,sK2) = cartesian_product2(X10,X12)).
% 35.49/4.85  cnf(a15, assumption,
% 35.49/4.85  	cartesian_product2(sK5,sK4) = cartesian_product2(X11,X13)).
% 35.49/4.85  cnf(c27, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c25, c26])).
% 35.49/4.85  cnf(c28, plain,
% 35.49/4.85  	subset(X10,X11) | empty_set = cartesian_product2(X10,X12),
% 35.49/4.85  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c25, c26])).
% 35.49/4.85  
% 35.49/4.85  cnf(c29, plain,
% 35.49/4.85  	~subset(sK3,sK5)).
% 35.49/4.85  cnf(a16, assumption,
% 35.49/4.85  	X10 = sK3).
% 35.49/4.85  cnf(a17, assumption,
% 35.49/4.85  	X11 = sK5).
% 35.49/4.85  cnf(c30, plain,
% 35.49/4.85  	empty_set = cartesian_product2(X10,X12),
% 35.49/4.85  	inference(predicate_reduction, [assumptions([a16, a17])], [c28, c29])).
% 35.49/4.85  
% 35.49/4.85  cnf(c31, axiom,
% 35.49/4.85  	empty_set = X14 | empty_set = X15 | empty_set != cartesian_product2(X15,X14)).
% 35.49/4.85  cnf(a18, assumption,
% 35.49/4.85  	cartesian_product2(X15,X14) = cartesian_product2(X10,X12)).
% 35.49/4.85  cnf(a19, assumption,
% 35.49/4.85  	empty_set = X16).
% 35.49/4.85  cnf(c32, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a18, a19])], [c30, c31])).
% 35.49/4.85  cnf(c33, plain,
% 35.49/4.85  	empty_set = X14 | empty_set = X15,
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a18, a19])], [c30, c31])).
% 35.49/4.85  cnf(c34, plain,
% 35.49/4.85  	empty_set != X16,
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a18, a19])], [c30, c31])).
% 35.49/4.85  
% 35.49/4.85  cnf(a20, assumption,
% 35.49/4.85  	empty_set = X16).
% 35.49/4.85  cnf(c35, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(reflexivity, [assumptions([a20])], [c34])).
% 35.49/4.85  
% 35.49/4.85  cnf(c36, axiom,
% 35.49/4.85  	~empty(sK2)).
% 35.49/4.85  cnf(a21, assumption,
% 35.49/4.85  	sK2 = X14).
% 35.49/4.85  cnf(a22, assumption,
% 35.49/4.85  	empty_set = X17).
% 35.49/4.85  cnf(c37, plain,
% 35.49/4.85  	empty_set = X15,
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a21, a22])], [c33, c36])).
% 35.49/4.85  cnf(c38, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a21, a22])], [c33, c36])).
% 35.49/4.85  cnf(c39, plain,
% 35.49/4.85  	~empty(X17),
% 35.49/4.85  	inference(strict_subterm_extension, [assumptions([a21, a22])], [c33, c36])).
% 35.49/4.85  
% 35.49/4.85  cnf(c40, plain,
% 35.49/4.85  	empty(X9)).
% 35.49/4.85  cnf(a23, assumption,
% 35.49/4.85  	X17 = X9).
% 35.49/4.85  cnf(c41, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(predicate_reduction, [assumptions([a23])], [c39, c40])).
% 35.49/4.85  
% 35.49/4.85  cnf(c42, plain,
% 35.49/4.85  	~subset(sK3,sK5)).
% 35.49/4.85  cnf(a24, assumption,
% 35.49/4.85  	sK3 = X15).
% 35.49/4.85  cnf(a25, assumption,
% 35.49/4.85  	empty_set = X18).
% 35.49/4.85  cnf(c43, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(subterm_reduction, [assumptions([a24, a25])], [c37, c42])).
% 35.49/4.85  cnf(c44, plain,
% 35.49/4.85  	~subset(X18,sK5),
% 35.49/4.85  	inference(subterm_reduction, [assumptions([a24, a25])], [c37, c42])).
% 35.49/4.85  
% 35.49/4.85  cnf(c45, plain,
% 35.49/4.85  	subset(X7,sK5)).
% 35.49/4.85  cnf(a26, assumption,
% 35.49/4.85  	X18 = X7).
% 35.49/4.85  cnf(a27, assumption,
% 35.49/4.85  	sK5 = sK5).
% 35.49/4.85  cnf(c46, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(predicate_reduction, [assumptions([a26, a27])], [c44, c45])).
% 35.49/4.85  
% 35.49/4.85  cnf(c47, plain,
% 35.49/4.85  	$false,
% 35.49/4.85  	inference(constraint_solving, [
% 35.49/4.85  		bind(X0, sK3),
% 35.49/4.85  		bind(X1, sK5),
% 35.49/4.85  		bind(X2, sK2),
% 35.49/4.85  		bind(X3, sK4),
% 35.49/4.85  		bind(X4, sK3),
% 35.49/4.85  		bind(X5, sK2),
% 35.49/4.85  		bind(X6, empty_set),
% 35.49/4.85  		bind(X7, empty_set),
% 35.49/4.85  		bind(X8, sK5),
% 35.49/4.85  		bind(X9, empty_set),
% 35.49/4.85  		bind(X10, sK3),
% 35.49/4.85  		bind(X11, sK5),
% 35.49/4.85  		bind(X12, sK2),
% 35.49/4.85  		bind(X13, sK4),
% 35.49/4.85  		bind(X14, sK2),
% 35.49/4.85  		bind(X15, sK3),
% 35.49/4.85  		bind(X16, empty_set),
% 35.49/4.85  		bind(X17, empty_set),
% 35.49/4.85  		bind(X18, empty_set)
% 35.49/4.85  	],
% 35.49/4.85  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27])).
% 35.49/4.85  
% 35.49/4.85  % SZS output end IncompleteProof
%------------------------------------------------------------------------------