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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : MGT009+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 : 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 : Sun Jul 17 22:16:25 EDT 2022

% Result   : Theorem 0.13s 0.35s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : MGT009+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n022.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 : Thu Jun  9 09:33:19 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % SZS status Theorem
% 0.13/0.35  % SZS output begin IncompleteProof
% 0.13/0.35  cnf(c0, axiom,
% 0.13/0.35  	organization(sK1,sK8)).
% 0.13/0.35  cnf(c1, plain,
% 0.13/0.35  	organization(sK1,sK8),
% 0.13/0.35  	inference(start, [], [c0])).
% 0.13/0.35  
% 0.13/0.35  cnf(c2, axiom,
% 0.13/0.35  	greater(X0,X1) | ~greater(X2,X3) | ~inertia(X4,X2,X5) | ~inertia(X6,X3,X7) | ~reproducibility(X4,X0,X5) | ~reproducibility(X6,X1,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5) | ~organization(X6,X7)).
% 0.13/0.35  cnf(a0, assumption,
% 0.13/0.35  	sK1 = X6).
% 0.13/0.35  cnf(a1, assumption,
% 0.13/0.35  	sK8 = X7).
% 0.13/0.35  cnf(c3, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.35  cnf(c4, plain,
% 0.13/0.35  	greater(X0,X1) | ~greater(X2,X3) | ~inertia(X4,X2,X5) | ~inertia(X6,X3,X7) | ~reproducibility(X4,X0,X5) | ~reproducibility(X6,X1,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.35  
% 0.13/0.35  cnf(c5, axiom,
% 0.13/0.35  	~greater(sK5,sK4)).
% 0.13/0.35  cnf(a2, assumption,
% 0.13/0.35  	X0 = sK5).
% 0.13/0.35  cnf(a3, assumption,
% 0.13/0.35  	X1 = sK4).
% 0.13/0.35  cnf(c6, plain,
% 0.13/0.35  	~greater(X2,X3) | ~inertia(X4,X2,X5) | ~inertia(X6,X3,X7) | ~reproducibility(X4,X0,X5) | ~reproducibility(X6,X1,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.35  cnf(c7, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.35  
% 0.13/0.35  cnf(c8, axiom,
% 0.13/0.35  	greater(X8,X9) | ~greater(X10,X11) | ~inertia(X12,X8,X13) | ~inertia(X14,X9,X15) | ~size(X12,X10,X13) | ~size(X14,X11,X15) | ~class(X12,X16,X13) | ~class(X14,X16,X15) | ~organization(X12,X13) | ~organization(X14,X15)).
% 0.13/0.35  cnf(a4, assumption,
% 0.13/0.35  	X2 = X8).
% 0.13/0.35  cnf(a5, assumption,
% 0.13/0.35  	X3 = X9).
% 0.13/0.35  cnf(c9, plain,
% 0.13/0.35  	~inertia(X4,X2,X5) | ~inertia(X6,X3,X7) | ~reproducibility(X4,X0,X5) | ~reproducibility(X6,X1,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.13/0.35  cnf(c10, plain,
% 0.13/0.35  	~greater(X10,X11) | ~inertia(X12,X8,X13) | ~inertia(X14,X9,X15) | ~size(X12,X10,X13) | ~size(X14,X11,X15) | ~class(X12,X16,X13) | ~class(X14,X16,X15) | ~organization(X12,X13) | ~organization(X14,X15),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.13/0.35  
% 0.13/0.35  cnf(c11, axiom,
% 0.13/0.35  	greater(sK7,sK6)).
% 0.13/0.35  cnf(a6, assumption,
% 0.13/0.35  	X10 = sK7).
% 0.13/0.35  cnf(a7, assumption,
% 0.13/0.35  	X11 = sK6).
% 0.13/0.35  cnf(c12, plain,
% 0.13/0.35  	~inertia(X12,X8,X13) | ~inertia(X14,X9,X15) | ~size(X12,X10,X13) | ~size(X14,X11,X15) | ~class(X12,X16,X13) | ~class(X14,X16,X15) | ~organization(X12,X13) | ~organization(X14,X15),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.13/0.35  cnf(c13, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.13/0.35  
% 0.13/0.35  cnf(c14, axiom,
% 0.13/0.35  	inertia(X17,sK0(X17,X18),X18) | ~organization(X17,X18)).
% 0.13/0.35  cnf(a8, assumption,
% 0.13/0.35  	X12 = X17).
% 0.13/0.35  cnf(a9, assumption,
% 0.13/0.35  	X8 = sK0(X17,X18)).
% 0.13/0.35  cnf(a10, assumption,
% 0.13/0.35  	X13 = X18).
% 0.13/0.35  cnf(c15, plain,
% 0.13/0.35  	~inertia(X14,X9,X15) | ~size(X12,X10,X13) | ~size(X14,X11,X15) | ~class(X12,X16,X13) | ~class(X14,X16,X15) | ~organization(X12,X13) | ~organization(X14,X15),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c12, c14])).
% 0.13/0.35  cnf(c16, plain,
% 0.13/0.35  	~organization(X17,X18),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c12, c14])).
% 0.13/0.35  
% 0.13/0.35  cnf(c17, axiom,
% 0.13/0.35  	organization(sK2,sK9)).
% 0.13/0.35  cnf(a11, assumption,
% 0.13/0.35  	X17 = sK2).
% 0.13/0.35  cnf(a12, assumption,
% 0.13/0.35  	X18 = sK9).
% 0.13/0.35  cnf(c18, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c16, c17])).
% 0.13/0.35  cnf(c19, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c16, c17])).
% 0.13/0.35  
% 0.13/0.35  cnf(c20, axiom,
% 0.13/0.35  	inertia(X19,sK0(X19,X20),X20) | ~organization(X19,X20)).
% 0.13/0.35  cnf(a13, assumption,
% 0.13/0.35  	X14 = X19).
% 0.13/0.35  cnf(a14, assumption,
% 0.13/0.35  	X9 = sK0(X19,X20)).
% 0.13/0.35  cnf(a15, assumption,
% 0.13/0.35  	X15 = X20).
% 0.13/0.35  cnf(c21, plain,
% 0.13/0.35  	~size(X12,X10,X13) | ~size(X14,X11,X15) | ~class(X12,X16,X13) | ~class(X14,X16,X15) | ~organization(X12,X13) | ~organization(X14,X15),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c15, c20])).
% 0.13/0.35  cnf(c22, plain,
% 0.13/0.35  	~organization(X19,X20),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c15, c20])).
% 0.13/0.35  
% 0.13/0.35  cnf(c23, plain,
% 0.13/0.35  	organization(sK1,sK8)).
% 0.13/0.35  cnf(a16, assumption,
% 0.13/0.35  	X19 = sK1).
% 0.13/0.35  cnf(a17, assumption,
% 0.13/0.35  	X20 = sK8).
% 0.13/0.35  cnf(c24, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(predicate_reduction, [assumptions([a16, a17])], [c22, c23])).
% 0.13/0.35  
% 0.13/0.35  cnf(c25, axiom,
% 0.13/0.35  	size(sK2,sK7,sK9)).
% 0.13/0.35  cnf(a18, assumption,
% 0.13/0.35  	X12 = sK2).
% 0.13/0.35  cnf(a19, assumption,
% 0.13/0.35  	X10 = sK7).
% 0.13/0.35  cnf(a20, assumption,
% 0.13/0.35  	X13 = sK9).
% 0.13/0.35  cnf(c26, plain,
% 0.13/0.35  	~size(X14,X11,X15) | ~class(X12,X16,X13) | ~class(X14,X16,X15) | ~organization(X12,X13) | ~organization(X14,X15),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c21, c25])).
% 0.13/0.35  cnf(c27, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c21, c25])).
% 0.13/0.35  
% 0.13/0.35  cnf(c28, axiom,
% 0.13/0.35  	size(sK1,sK6,sK8)).
% 0.13/0.35  cnf(a21, assumption,
% 0.13/0.35  	X14 = sK1).
% 0.13/0.35  cnf(a22, assumption,
% 0.13/0.35  	X11 = sK6).
% 0.13/0.35  cnf(a23, assumption,
% 0.13/0.35  	X15 = sK8).
% 0.13/0.35  cnf(c29, plain,
% 0.13/0.35  	~class(X12,X16,X13) | ~class(X14,X16,X15) | ~organization(X12,X13) | ~organization(X14,X15),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a21, a22, a23])], [c26, c28])).
% 0.13/0.35  cnf(c30, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a21, a22, a23])], [c26, c28])).
% 0.13/0.35  
% 0.13/0.35  cnf(c31, axiom,
% 0.13/0.35  	class(sK2,sK3,sK9)).
% 0.13/0.35  cnf(a24, assumption,
% 0.13/0.35  	X12 = sK2).
% 0.13/0.35  cnf(a25, assumption,
% 0.13/0.35  	X16 = sK3).
% 0.13/0.35  cnf(a26, assumption,
% 0.13/0.35  	X13 = sK9).
% 0.13/0.35  cnf(c32, plain,
% 0.13/0.35  	~class(X14,X16,X15) | ~organization(X12,X13) | ~organization(X14,X15),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a24, a25, a26])], [c29, c31])).
% 0.13/0.35  cnf(c33, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a24, a25, a26])], [c29, c31])).
% 0.13/0.35  
% 0.13/0.35  cnf(c34, axiom,
% 0.13/0.35  	class(sK1,sK3,sK8)).
% 0.13/0.35  cnf(a27, assumption,
% 0.13/0.35  	X14 = sK1).
% 0.13/0.35  cnf(a28, assumption,
% 0.13/0.35  	X16 = sK3).
% 0.13/0.35  cnf(a29, assumption,
% 0.13/0.35  	X15 = sK8).
% 0.13/0.35  cnf(c35, plain,
% 0.13/0.35  	~organization(X12,X13) | ~organization(X14,X15),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a27, a28, a29])], [c32, c34])).
% 0.13/0.35  cnf(c36, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a27, a28, a29])], [c32, c34])).
% 0.13/0.35  
% 0.13/0.35  cnf(c37, plain,
% 0.13/0.35  	organization(X17,X18)).
% 0.13/0.35  cnf(a30, assumption,
% 0.13/0.35  	X12 = X17).
% 0.13/0.35  cnf(a31, assumption,
% 0.13/0.35  	X13 = X18).
% 0.13/0.35  cnf(c38, plain,
% 0.13/0.35  	~organization(X14,X15),
% 0.13/0.35  	inference(predicate_reduction, [assumptions([a30, a31])], [c35, c37])).
% 0.13/0.35  
% 0.13/0.35  cnf(c39, plain,
% 0.13/0.35  	organization(sK1,sK8)).
% 0.13/0.35  cnf(a32, assumption,
% 0.13/0.35  	X14 = sK1).
% 0.13/0.35  cnf(a33, assumption,
% 0.13/0.35  	X15 = sK8).
% 0.13/0.35  cnf(c40, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(predicate_reduction, [assumptions([a32, a33])], [c38, c39])).
% 0.13/0.35  
% 0.13/0.35  cnf(c41, plain,
% 0.13/0.35  	inertia(X12,X8,X13)).
% 0.13/0.35  cnf(a34, assumption,
% 0.13/0.35  	X4 = X12).
% 0.13/0.35  cnf(a35, assumption,
% 0.13/0.35  	X2 = X8).
% 0.13/0.35  cnf(a36, assumption,
% 0.13/0.35  	X5 = X13).
% 0.13/0.35  cnf(c42, plain,
% 0.13/0.35  	~inertia(X6,X3,X7) | ~reproducibility(X4,X0,X5) | ~reproducibility(X6,X1,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5),
% 0.13/0.35  	inference(predicate_reduction, [assumptions([a34, a35, a36])], [c9, c41])).
% 0.13/0.35  
% 0.13/0.35  cnf(c43, plain,
% 0.13/0.35  	inertia(X14,X9,X15)).
% 0.13/0.35  cnf(a37, assumption,
% 0.13/0.35  	X6 = X14).
% 0.13/0.35  cnf(a38, assumption,
% 0.13/0.35  	X3 = X9).
% 0.13/0.35  cnf(a39, assumption,
% 0.13/0.35  	X7 = X15).
% 0.13/0.35  cnf(c44, plain,
% 0.13/0.35  	~reproducibility(X4,X0,X5) | ~reproducibility(X6,X1,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5),
% 0.13/0.35  	inference(predicate_reduction, [assumptions([a37, a38, a39])], [c42, c43])).
% 0.13/0.35  
% 0.13/0.35  cnf(c45, axiom,
% 0.13/0.35  	reproducibility(sK2,sK5,sK9)).
% 0.13/0.35  cnf(a40, assumption,
% 0.13/0.35  	X4 = sK2).
% 0.13/0.35  cnf(a41, assumption,
% 0.13/0.35  	X0 = sK5).
% 0.13/0.35  cnf(a42, assumption,
% 0.13/0.35  	X5 = sK9).
% 0.13/0.35  cnf(c46, plain,
% 0.13/0.35  	~reproducibility(X6,X1,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a40, a41, a42])], [c44, c45])).
% 0.13/0.35  cnf(c47, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a40, a41, a42])], [c44, c45])).
% 0.13/0.35  
% 0.13/0.35  cnf(c48, axiom,
% 0.13/0.35  	reproducibility(sK1,sK4,sK8)).
% 0.13/0.35  cnf(a43, assumption,
% 0.13/0.35  	X6 = sK1).
% 0.13/0.35  cnf(a44, assumption,
% 0.13/0.35  	X1 = sK4).
% 0.13/0.35  cnf(a45, assumption,
% 0.13/0.35  	X7 = sK8).
% 0.13/0.35  cnf(c49, plain,
% 0.13/0.35  	~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a43, a44, a45])], [c46, c48])).
% 0.13/0.35  cnf(c50, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a43, a44, a45])], [c46, c48])).
% 0.13/0.35  
% 0.13/0.35  cnf(c51, axiom,
% 0.13/0.35  	reorganization_free(sK2,sK9,sK9)).
% 0.13/0.35  cnf(a46, assumption,
% 0.13/0.35  	X4 = sK2).
% 0.13/0.35  cnf(a47, assumption,
% 0.13/0.35  	X5 = sK9).
% 0.13/0.35  cnf(a48, assumption,
% 0.13/0.35  	X5 = sK9).
% 0.13/0.35  cnf(c52, plain,
% 0.13/0.35  	~reorganization_free(X6,X7,X7) | ~organization(X4,X5),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a46, a47, a48])], [c49, c51])).
% 0.13/0.35  cnf(c53, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a46, a47, a48])], [c49, c51])).
% 0.13/0.35  
% 0.13/0.35  cnf(c54, axiom,
% 0.13/0.35  	reorganization_free(sK1,sK8,sK8)).
% 0.13/0.35  cnf(a49, assumption,
% 0.13/0.35  	X6 = sK1).
% 0.13/0.35  cnf(a50, assumption,
% 0.13/0.35  	X7 = sK8).
% 0.13/0.35  cnf(a51, assumption,
% 0.13/0.35  	X7 = sK8).
% 0.13/0.35  cnf(c55, plain,
% 0.13/0.35  	~organization(X4,X5),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a49, a50, a51])], [c52, c54])).
% 0.13/0.35  cnf(c56, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a49, a50, a51])], [c52, c54])).
% 0.13/0.35  
% 0.13/0.35  cnf(c57, plain,
% 0.13/0.35  	organization(X17,X18)).
% 0.13/0.35  cnf(a52, assumption,
% 0.13/0.35  	X4 = X17).
% 0.13/0.35  cnf(a53, assumption,
% 0.13/0.35  	X5 = X18).
% 0.13/0.35  cnf(c58, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(predicate_reduction, [assumptions([a52, a53])], [c55, c57])).
% 0.13/0.35  
% 0.13/0.35  cnf(c59, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(constraint_solving, [
% 0.13/0.35  		bind(X0, sK5),
% 0.13/0.35  		bind(X1, sK4),
% 0.13/0.35  		bind(X2, sK0(X17,X18)),
% 0.13/0.35  		bind(X3, sK0(X19,X20)),
% 0.13/0.35  		bind(X4, sK2),
% 0.13/0.35  		bind(X5, sK9),
% 0.13/0.35  		bind(X6, sK1),
% 0.13/0.35  		bind(X7, sK8),
% 0.13/0.35  		bind(X8, sK0(X17,X18)),
% 0.13/0.35  		bind(X9, sK0(X19,X20)),
% 0.13/0.35  		bind(X10, sK7),
% 0.13/0.35  		bind(X11, sK6),
% 0.13/0.35  		bind(X12, sK2),
% 0.13/0.35  		bind(X13, sK9),
% 0.13/0.35  		bind(X14, sK1),
% 0.13/0.35  		bind(X15, sK8),
% 0.13/0.35  		bind(X16, sK3),
% 0.13/0.35  		bind(X17, sK2),
% 0.13/0.35  		bind(X18, sK9),
% 0.13/0.35  		bind(X19, sK1),
% 0.13/0.35  		bind(X20, sK8)
% 0.13/0.35  	],
% 0.13/0.35  	[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, a46, a47, a48, a49, a50, a51, a52, a53])).
% 0.13/0.35  
% 0.13/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------