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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET047+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n010.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:59 EDT 2022

% Result   : Theorem 5.83s 1.11s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET047+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n010.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jul 10 17:58:45 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 5.83/1.11  % SZS status Theorem
% 5.83/1.11  % SZS output begin IncompleteProof
% 5.83/1.11  cnf(c0, axiom,
% 5.83/1.11  	~set_equal(sK3,sK2) | ~set_equal(sK2,sK3)).
% 5.83/1.11  cnf(c1, plain,
% 5.83/1.11  	~set_equal(sK3,sK2) | ~set_equal(sK2,sK3),
% 5.83/1.11  	inference(start, [], [c0])).
% 5.83/1.11  
% 5.83/1.11  cnf(c2, axiom,
% 5.83/1.11  	set_equal(sK3,sK2) | set_equal(sK2,sK3)).
% 5.83/1.11  cnf(a0, assumption,
% 5.83/1.11  	sK3 = sK3).
% 5.83/1.11  cnf(a1, assumption,
% 5.83/1.11  	sK2 = sK2).
% 5.83/1.11  cnf(c3, plain,
% 5.83/1.11  	~set_equal(sK2,sK3),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 5.83/1.11  cnf(c4, plain,
% 5.83/1.11  	set_equal(sK2,sK3),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 5.83/1.11  
% 5.83/1.11  cnf(c5, axiom,
% 5.83/1.11  	sP0(X0,X1) | ~set_equal(X1,X0)).
% 5.83/1.11  cnf(a2, assumption,
% 5.83/1.11  	sK2 = X1).
% 5.83/1.11  cnf(a3, assumption,
% 5.83/1.11  	sK3 = X0).
% 5.83/1.11  cnf(c6, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 5.83/1.11  cnf(c7, plain,
% 5.83/1.11  	sP0(X0,X1),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 5.83/1.11  
% 5.83/1.11  cnf(c8, axiom,
% 5.83/1.11  	element(X2,X3) | ~element(X2,X4) | ~sP0(X3,X4)).
% 5.83/1.11  cnf(a4, assumption,
% 5.83/1.11  	X0 = X3).
% 5.83/1.11  cnf(a5, assumption,
% 5.83/1.11  	X1 = X4).
% 5.83/1.11  cnf(c9, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 5.83/1.11  cnf(c10, plain,
% 5.83/1.11  	element(X2,X3) | ~element(X2,X4),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 5.83/1.11  
% 5.83/1.11  cnf(c11, axiom,
% 5.83/1.11  	element(X5,X6) | ~element(X5,X7) | ~sP0(X7,X6)).
% 5.83/1.11  cnf(a6, assumption,
% 5.83/1.11  	X2 = X5).
% 5.83/1.11  cnf(a7, assumption,
% 5.83/1.11  	X3 = X7).
% 5.83/1.11  cnf(c12, plain,
% 5.83/1.11  	~element(X2,X4),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 5.83/1.11  cnf(c13, plain,
% 5.83/1.11  	element(X5,X6) | ~sP0(X7,X6),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 5.83/1.11  
% 5.83/1.11  cnf(c14, axiom,
% 5.83/1.11  	sP0(X8,X9) | ~element(sK1(X8,X9),X8) | ~element(sK1(X8,X9),X9)).
% 5.83/1.11  cnf(a8, assumption,
% 5.83/1.11  	X5 = sK1(X8,X9)).
% 5.83/1.11  cnf(a9, assumption,
% 5.83/1.11  	X6 = X8).
% 5.83/1.11  cnf(c15, plain,
% 5.83/1.11  	~sP0(X7,X6),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 5.83/1.11  cnf(c16, plain,
% 5.83/1.11  	sP0(X8,X9) | ~element(sK1(X8,X9),X9),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 5.83/1.11  
% 5.83/1.11  cnf(c17, axiom,
% 5.83/1.11  	set_equal(X10,X11) | ~sP0(X11,X10)).
% 5.83/1.11  cnf(a10, assumption,
% 5.83/1.11  	X8 = X11).
% 5.83/1.11  cnf(a11, assumption,
% 5.83/1.11  	X9 = X10).
% 5.83/1.11  cnf(c18, plain,
% 5.83/1.11  	~element(sK1(X8,X9),X9),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 5.83/1.11  cnf(c19, plain,
% 5.83/1.11  	set_equal(X10,X11),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 5.83/1.11  
% 5.83/1.11  cnf(c20, plain,
% 5.83/1.11  	~set_equal(sK3,sK2)).
% 5.83/1.11  cnf(a12, assumption,
% 5.83/1.11  	X10 = sK3).
% 5.83/1.11  cnf(a13, assumption,
% 5.83/1.11  	X11 = sK2).
% 5.83/1.11  cnf(c21, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(predicate_reduction, [assumptions([a12, a13])], [c19, c20])).
% 5.83/1.11  
% 5.83/1.11  cnf(c22, plain,
% 5.83/1.11  	element(X2,X3)).
% 5.83/1.11  cnf(a14, assumption,
% 5.83/1.11  	sK1(X8,X9) = X2).
% 5.83/1.11  cnf(a15, assumption,
% 5.83/1.11  	X9 = X3).
% 5.83/1.11  cnf(c23, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(predicate_reduction, [assumptions([a14, a15])], [c18, c22])).
% 5.83/1.11  
% 5.83/1.11  cnf(c24, plain,
% 5.83/1.11  	sP0(X0,X1)).
% 5.83/1.11  cnf(a16, assumption,
% 5.83/1.11  	X7 = X0).
% 5.83/1.11  cnf(a17, assumption,
% 5.83/1.11  	X6 = X1).
% 5.83/1.11  cnf(c25, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(predicate_reduction, [assumptions([a16, a17])], [c15, c24])).
% 5.83/1.11  
% 5.83/1.11  cnf(c26, axiom,
% 5.83/1.11  	sP0(X12,X13) | element(sK1(X12,X13),X12) | element(sK1(X12,X13),X13)).
% 5.83/1.11  cnf(a18, assumption,
% 5.83/1.11  	X2 = sK1(X12,X13)).
% 5.83/1.11  cnf(a19, assumption,
% 5.83/1.11  	X4 = X12).
% 5.83/1.11  cnf(c27, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c12, c26])).
% 5.83/1.11  cnf(c28, plain,
% 5.83/1.11  	sP0(X12,X13) | element(sK1(X12,X13),X13),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c12, c26])).
% 5.83/1.11  
% 5.83/1.11  cnf(c29, plain,
% 5.83/1.11  	~sP0(X8,X9)).
% 5.83/1.11  cnf(a20, assumption,
% 5.83/1.11  	X12 = X8).
% 5.83/1.11  cnf(a21, assumption,
% 5.83/1.11  	X13 = X9).
% 5.83/1.11  cnf(c30, plain,
% 5.83/1.11  	element(sK1(X12,X13),X13),
% 5.83/1.11  	inference(predicate_reduction, [assumptions([a20, a21])], [c28, c29])).
% 5.83/1.11  
% 5.83/1.11  cnf(c31, plain,
% 5.83/1.11  	~element(X2,X3)).
% 5.83/1.11  cnf(a22, assumption,
% 5.83/1.11  	sK1(X12,X13) = X2).
% 5.83/1.11  cnf(a23, assumption,
% 5.83/1.11  	X13 = X3).
% 5.83/1.11  cnf(c32, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(predicate_reduction, [assumptions([a22, a23])], [c30, c31])).
% 5.83/1.11  
% 5.83/1.11  cnf(c33, axiom,
% 5.83/1.11  	set_equal(X14,X15) | ~sP0(X15,X14)).
% 5.83/1.11  cnf(a24, assumption,
% 5.83/1.11  	sK2 = X14).
% 5.83/1.11  cnf(a25, assumption,
% 5.83/1.11  	sK3 = X15).
% 5.83/1.11  cnf(c34, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c3, c33])).
% 5.83/1.11  cnf(c35, plain,
% 5.83/1.11  	~sP0(X15,X14),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c3, c33])).
% 5.83/1.11  
% 5.83/1.11  cnf(c36, axiom,
% 5.83/1.11  	sP0(X16,X17) | element(sK1(X16,X17),X16) | element(sK1(X16,X17),X17)).
% 5.83/1.11  cnf(a26, assumption,
% 5.83/1.11  	X15 = X16).
% 5.83/1.11  cnf(a27, assumption,
% 5.83/1.11  	X14 = X17).
% 5.83/1.11  cnf(c37, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a26, a27])], [c35, c36])).
% 5.83/1.11  cnf(c38, plain,
% 5.83/1.11  	element(sK1(X16,X17),X16) | element(sK1(X16,X17),X17),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a26, a27])], [c35, c36])).
% 5.83/1.11  
% 5.83/1.11  cnf(c39, axiom,
% 5.83/1.11  	sP0(X18,X19) | ~element(sK1(X18,X19),X18) | ~element(sK1(X18,X19),X19)).
% 5.83/1.11  cnf(a28, assumption,
% 5.83/1.11  	sK1(X16,X17) = sK1(X18,X19)).
% 5.83/1.11  cnf(a29, assumption,
% 5.83/1.11  	X16 = X18).
% 5.83/1.11  cnf(c40, plain,
% 5.83/1.11  	element(sK1(X16,X17),X17),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a28, a29])], [c38, c39])).
% 5.83/1.11  cnf(c41, plain,
% 5.83/1.11  	sP0(X18,X19) | ~element(sK1(X18,X19),X19),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a28, a29])], [c38, c39])).
% 5.83/1.11  
% 5.83/1.11  cnf(c42, plain,
% 5.83/1.11  	~sP0(X15,X14)).
% 5.83/1.11  cnf(a30, assumption,
% 5.83/1.11  	X18 = X15).
% 5.83/1.11  cnf(a31, assumption,
% 5.83/1.11  	X19 = X14).
% 5.83/1.11  cnf(c43, plain,
% 5.83/1.11  	~element(sK1(X18,X19),X19),
% 5.83/1.11  	inference(predicate_reduction, [assumptions([a30, a31])], [c41, c42])).
% 5.83/1.11  
% 5.83/1.11  cnf(c44, axiom,
% 5.83/1.11  	element(X20,X21) | ~element(X20,X22) | ~sP0(X21,X22)).
% 5.83/1.11  cnf(a32, assumption,
% 5.83/1.11  	sK1(X18,X19) = X20).
% 5.83/1.11  cnf(a33, assumption,
% 5.83/1.11  	X19 = X21).
% 5.83/1.11  cnf(c45, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a32, a33])], [c43, c44])).
% 5.83/1.11  cnf(c46, plain,
% 5.83/1.11  	~element(X20,X22) | ~sP0(X21,X22),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a32, a33])], [c43, c44])).
% 5.83/1.11  
% 5.83/1.11  cnf(c47, plain,
% 5.83/1.11  	element(sK1(X16,X17),X16)).
% 5.83/1.11  cnf(a34, assumption,
% 5.83/1.11  	X20 = sK1(X16,X17)).
% 5.83/1.11  cnf(a35, assumption,
% 5.83/1.11  	X22 = X16).
% 5.83/1.11  cnf(c48, plain,
% 5.83/1.11  	~sP0(X21,X22),
% 5.83/1.11  	inference(predicate_reduction, [assumptions([a34, a35])], [c46, c47])).
% 5.83/1.11  
% 5.83/1.11  cnf(c49, axiom,
% 5.83/1.11  	sP0(X23,X24) | ~set_equal(X24,X23)).
% 5.83/1.11  cnf(a36, assumption,
% 5.83/1.11  	X21 = X23).
% 5.83/1.11  cnf(a37, assumption,
% 5.83/1.11  	X22 = X24).
% 5.83/1.11  cnf(c50, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a36, a37])], [c48, c49])).
% 5.83/1.11  cnf(c51, plain,
% 5.83/1.11  	~set_equal(X24,X23),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a36, a37])], [c48, c49])).
% 5.83/1.11  
% 5.83/1.11  cnf(c52, plain,
% 5.83/1.11  	set_equal(sK3,sK2)).
% 5.83/1.11  cnf(a38, assumption,
% 5.83/1.11  	X24 = sK3).
% 5.83/1.11  cnf(a39, assumption,
% 5.83/1.11  	X23 = sK2).
% 5.83/1.11  cnf(c53, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(predicate_reduction, [assumptions([a38, a39])], [c51, c52])).
% 5.83/1.11  
% 5.83/1.11  cnf(c54, axiom,
% 5.83/1.11  	element(X25,X26) | ~element(X25,X27) | ~sP0(X27,X26)).
% 5.83/1.11  cnf(a40, assumption,
% 5.83/1.11  	sK1(X16,X17) = X25).
% 5.83/1.11  cnf(a41, assumption,
% 5.83/1.11  	X17 = X27).
% 5.83/1.11  cnf(c55, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a40, a41])], [c40, c54])).
% 5.83/1.11  cnf(c56, plain,
% 5.83/1.11  	element(X25,X26) | ~sP0(X27,X26),
% 5.83/1.11  	inference(strict_predicate_extension, [assumptions([a40, a41])], [c40, c54])).
% 5.83/1.11  
% 5.83/1.11  cnf(c57, plain,
% 5.83/1.11  	~element(sK1(X16,X17),X16)).
% 5.83/1.11  cnf(a42, assumption,
% 5.83/1.11  	X25 = sK1(X16,X17)).
% 5.83/1.11  cnf(a43, assumption,
% 5.83/1.11  	X26 = X16).
% 5.83/1.11  cnf(c58, plain,
% 5.83/1.11  	~sP0(X27,X26),
% 5.83/1.11  	inference(predicate_reduction, [assumptions([a42, a43])], [c56, c57])).
% 5.83/1.11  
% 5.83/1.11  cnf(c59, plain,
% 5.83/1.11  	sP0(X21,X22)).
% 5.83/1.11  cnf(a44, assumption,
% 5.83/1.11  	X27 = X21).
% 5.83/1.11  cnf(a45, assumption,
% 5.83/1.11  	X26 = X22).
% 5.83/1.11  cnf(c60, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(predicate_reduction, [assumptions([a44, a45])], [c58, c59])).
% 5.83/1.11  
% 5.83/1.11  cnf(c61, plain,
% 5.83/1.11  	$false,
% 5.83/1.11  	inference(constraint_solving, [
% 5.83/1.11  		bind(X0, sK3),
% 5.83/1.11  		bind(X1, sK2),
% 5.83/1.11  		bind(X2, sK1(X8,X9)),
% 5.83/1.11  		bind(X3, sK3),
% 5.83/1.11  		bind(X4, sK2),
% 5.83/1.11  		bind(X5, sK1(X8,X9)),
% 5.83/1.11  		bind(X6, sK2),
% 5.83/1.11  		bind(X7, sK3),
% 5.83/1.11  		bind(X8, sK2),
% 5.83/1.11  		bind(X9, sK3),
% 5.83/1.11  		bind(X10, sK3),
% 5.83/1.11  		bind(X11, sK2),
% 5.83/1.11  		bind(X12, sK2),
% 5.83/1.11  		bind(X13, sK3),
% 5.83/1.11  		bind(X14, sK2),
% 5.83/1.11  		bind(X15, sK3),
% 5.83/1.11  		bind(X16, sK3),
% 5.83/1.11  		bind(X17, sK2),
% 5.83/1.11  		bind(X18, sK3),
% 5.83/1.11  		bind(X19, sK2),
% 5.83/1.11  		bind(X20, sK1(X18,X19)),
% 5.83/1.11  		bind(X21, sK2),
% 5.83/1.11  		bind(X22, sK3),
% 5.83/1.11  		bind(X23, sK2),
% 5.83/1.11  		bind(X24, sK3),
% 5.83/1.11  		bind(X25, sK1(X16,X17)),
% 5.83/1.11  		bind(X26, sK3),
% 5.83/1.11  		bind(X27, sK2)
% 5.83/1.11  	],
% 5.83/1.11  	[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, a28, a29, a30, a31, a32, a33, a34, a35, a36, a37, a38, a39, a40, a41, a42, a43, a44, a45])).
% 5.83/1.11  
% 5.83/1.11  % SZS output end IncompleteProof
%------------------------------------------------------------------------------