TSTP Solution File: CSR114+9 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : CSR114+9 : TPTP v8.1.0. Released v4.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 : n032.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 : Fri Jul 15 20:37:31 EDT 2022

% Result   : Theorem 126.93s 16.61s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : CSR114+9 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.10  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Sat Jun 11 07:08:24 EDT 2022
% 0.10/0.29  % CPUTime  : 
% 126.93/16.61  % SZS status Theorem
% 126.93/16.61  % SZS output begin IncompleteProof
% 126.93/16.61  cnf(c0, axiom,
% 126.93/16.61  	~subs(X0,stehen_1_1) | ~sub(X1,name_1_1) | ~scar(X0,X2) | ~loc(X0,X3) | ~attr(X4,X1) | ~in(X3,X4)).
% 126.93/16.61  cnf(c1, plain,
% 126.93/16.61  	~subs(X0,stehen_1_1) | ~sub(X1,name_1_1) | ~scar(X0,X2) | ~loc(X0,X3) | ~attr(X4,X1) | ~in(X3,X4),
% 126.93/16.61  	inference(start, [], [c0])).
% 126.93/16.61  
% 126.93/16.61  cnf(c2, axiom,
% 126.93/16.61  	subs(sK111(X5,X6),stehen_1_1) | ~sP48(X5,X6)).
% 126.93/16.61  cnf(a0, assumption,
% 126.93/16.61  	X0 = sK111(X5,X6)).
% 126.93/16.61  cnf(a1, assumption,
% 126.93/16.61  	stehen_1_1 = stehen_1_1).
% 126.93/16.61  cnf(c3, plain,
% 126.93/16.61  	~sub(X1,name_1_1) | ~scar(X0,X2) | ~loc(X0,X3) | ~attr(X4,X1) | ~in(X3,X4),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 126.93/16.61  cnf(c4, plain,
% 126.93/16.61  	~sP48(X5,X6),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 126.93/16.61  
% 126.93/16.61  cnf(c5, axiom,
% 126.93/16.61  	sP48(X7,X8) | ~loc(X7,X8)).
% 126.93/16.61  cnf(a2, assumption,
% 126.93/16.61  	X5 = X7).
% 126.93/16.61  cnf(a3, assumption,
% 126.93/16.61  	X6 = X8).
% 126.93/16.61  cnf(c6, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 126.93/16.61  cnf(c7, plain,
% 126.93/16.61  	~loc(X7,X8),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 126.93/16.61  
% 126.93/16.61  cnf(c8, axiom,
% 126.93/16.61  	loc(X9,sK98(X10,X9)) | ~sP34(X10,X9)).
% 126.93/16.61  cnf(a4, assumption,
% 126.93/16.61  	X7 = X9).
% 126.93/16.61  cnf(a5, assumption,
% 126.93/16.61  	X8 = sK98(X10,X9)).
% 126.93/16.61  cnf(c9, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 126.93/16.61  cnf(c10, plain,
% 126.93/16.61  	~sP34(X10,X9),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 126.93/16.61  
% 126.93/16.61  cnf(c11, axiom,
% 126.93/16.61  	sP34(X11,X12) | ~state_adjective_state_binding(X13,X11) | ~prop(X12,X13)).
% 126.93/16.61  cnf(a6, assumption,
% 126.93/16.61  	X10 = X11).
% 126.93/16.61  cnf(a7, assumption,
% 126.93/16.61  	X9 = X12).
% 126.93/16.61  cnf(c12, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 126.93/16.61  cnf(c13, plain,
% 126.93/16.61  	~state_adjective_state_binding(X13,X11) | ~prop(X12,X13),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 126.93/16.61  
% 126.93/16.61  cnf(c14, axiom,
% 126.93/16.61  	state_adjective_state_binding(italienisch__1_1,italien_0)).
% 126.93/16.61  cnf(a8, assumption,
% 126.93/16.61  	X13 = italienisch__1_1).
% 126.93/16.61  cnf(a9, assumption,
% 126.93/16.61  	X11 = italien_0).
% 126.93/16.61  cnf(c15, plain,
% 126.93/16.61  	~prop(X12,X13),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 126.93/16.61  cnf(c16, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 126.93/16.61  
% 126.93/16.61  cnf(c17, axiom,
% 126.93/16.61  	prop(c35631,italienisch__1_1)).
% 126.93/16.61  cnf(a10, assumption,
% 126.93/16.61  	X12 = c35631).
% 126.93/16.61  cnf(a11, assumption,
% 126.93/16.61  	X13 = italienisch__1_1).
% 126.93/16.61  cnf(c18, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 126.93/16.61  cnf(c19, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 126.93/16.61  
% 126.93/16.61  cnf(c20, axiom,
% 126.93/16.61  	sub(sK97(X14,X15),name_1_1) | ~sP34(X14,X15)).
% 126.93/16.61  cnf(a12, assumption,
% 126.93/16.61  	X1 = sK97(X14,X15)).
% 126.93/16.61  cnf(a13, assumption,
% 126.93/16.61  	name_1_1 = name_1_1).
% 126.93/16.61  cnf(c21, plain,
% 126.93/16.61  	~scar(X0,X2) | ~loc(X0,X3) | ~attr(X4,X1) | ~in(X3,X4),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c3, c20])).
% 126.93/16.61  cnf(c22, plain,
% 126.93/16.61  	~sP34(X14,X15),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c3, c20])).
% 126.93/16.61  
% 126.93/16.61  cnf(c23, plain,
% 126.93/16.61  	sP34(X10,X9)).
% 126.93/16.61  cnf(a14, assumption,
% 126.93/16.61  	X14 = X10).
% 126.93/16.61  cnf(a15, assumption,
% 126.93/16.61  	X15 = X9).
% 126.93/16.61  cnf(c24, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(predicate_reduction, [assumptions([a14, a15])], [c22, c23])).
% 126.93/16.61  
% 126.93/16.61  cnf(c25, axiom,
% 126.93/16.61  	scar(sK111(X16,X17),X16) | ~sP48(X16,X17)).
% 126.93/16.61  cnf(a16, assumption,
% 126.93/16.61  	X0 = sK111(X16,X17)).
% 126.93/16.61  cnf(a17, assumption,
% 126.93/16.61  	X2 = X16).
% 126.93/16.61  cnf(c26, plain,
% 126.93/16.61  	~loc(X0,X3) | ~attr(X4,X1) | ~in(X3,X4),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c21, c25])).
% 126.93/16.61  cnf(c27, plain,
% 126.93/16.61  	~sP48(X16,X17),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c21, c25])).
% 126.93/16.61  
% 126.93/16.61  cnf(c28, plain,
% 126.93/16.61  	sP48(X5,X6)).
% 126.93/16.61  cnf(a18, assumption,
% 126.93/16.61  	X16 = X5).
% 126.93/16.61  cnf(a19, assumption,
% 126.93/16.61  	X17 = X6).
% 126.93/16.61  cnf(c29, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(predicate_reduction, [assumptions([a18, a19])], [c27, c28])).
% 126.93/16.61  
% 126.93/16.61  cnf(c30, axiom,
% 126.93/16.61  	loc(sK111(X18,X19),X19) | ~sP48(X18,X19)).
% 126.93/16.61  cnf(a20, assumption,
% 126.93/16.61  	X0 = sK111(X18,X19)).
% 126.93/16.61  cnf(a21, assumption,
% 126.93/16.61  	X3 = X19).
% 126.93/16.61  cnf(c31, plain,
% 126.93/16.61  	~attr(X4,X1) | ~in(X3,X4),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a20, a21])], [c26, c30])).
% 126.93/16.61  cnf(c32, plain,
% 126.93/16.61  	~sP48(X18,X19),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a20, a21])], [c26, c30])).
% 126.93/16.61  
% 126.93/16.61  cnf(c33, plain,
% 126.93/16.61  	sP48(X5,X6)).
% 126.93/16.61  cnf(a22, assumption,
% 126.93/16.61  	X18 = X5).
% 126.93/16.61  cnf(a23, assumption,
% 126.93/16.61  	X19 = X6).
% 126.93/16.61  cnf(c34, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(predicate_reduction, [assumptions([a22, a23])], [c32, c33])).
% 126.93/16.61  
% 126.93/16.61  cnf(c35, axiom,
% 126.93/16.61  	attr(sK96(X20,X21),sK97(X20,X21)) | ~sP34(X20,X21)).
% 126.93/16.61  cnf(a24, assumption,
% 126.93/16.61  	X4 = sK96(X20,X21)).
% 126.93/16.61  cnf(a25, assumption,
% 126.93/16.61  	X1 = sK97(X20,X21)).
% 126.93/16.61  cnf(c36, plain,
% 126.93/16.61  	~in(X3,X4),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c31, c35])).
% 126.93/16.61  cnf(c37, plain,
% 126.93/16.61  	~sP34(X20,X21),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c31, c35])).
% 126.93/16.61  
% 126.93/16.61  cnf(c38, plain,
% 126.93/16.61  	sP34(X10,X9)).
% 126.93/16.61  cnf(a26, assumption,
% 126.93/16.61  	X20 = X10).
% 126.93/16.61  cnf(a27, assumption,
% 126.93/16.61  	X21 = X9).
% 126.93/16.61  cnf(c39, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(predicate_reduction, [assumptions([a26, a27])], [c37, c38])).
% 126.93/16.61  
% 126.93/16.61  cnf(c40, axiom,
% 126.93/16.61  	in(sK98(X22,X23),sK96(X22,X23)) | ~sP34(X22,X23)).
% 126.93/16.61  cnf(a28, assumption,
% 126.93/16.61  	X3 = sK98(X22,X23)).
% 126.93/16.61  cnf(a29, assumption,
% 126.93/16.61  	X4 = sK96(X22,X23)).
% 126.93/16.61  cnf(c41, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a28, a29])], [c36, c40])).
% 126.93/16.61  cnf(c42, plain,
% 126.93/16.61  	~sP34(X22,X23),
% 126.93/16.61  	inference(strict_predicate_extension, [assumptions([a28, a29])], [c36, c40])).
% 126.93/16.61  
% 126.93/16.61  cnf(c43, plain,
% 126.93/16.61  	sP34(X10,X9)).
% 126.93/16.61  cnf(a30, assumption,
% 126.93/16.61  	X22 = X10).
% 126.93/16.61  cnf(a31, assumption,
% 126.93/16.61  	X23 = X9).
% 126.93/16.61  cnf(c44, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(predicate_reduction, [assumptions([a30, a31])], [c42, c43])).
% 126.93/16.61  
% 126.93/16.61  cnf(c45, plain,
% 126.93/16.61  	$false,
% 126.93/16.61  	inference(constraint_solving, [
% 126.93/16.61  		bind(X0, sK111(X5,X6)),
% 126.93/16.61  		bind(X1, sK97(X14,X15)),
% 126.93/16.61  		bind(X2, c35631),
% 126.93/16.61  		bind(X3, sK98(X10,X9)),
% 126.93/16.61  		bind(X4, sK96(X20,X21)),
% 126.93/16.61  		bind(X5, c35631),
% 126.93/16.61  		bind(X6, sK98(X10,X9)),
% 126.93/16.61  		bind(X7, c35631),
% 126.93/16.61  		bind(X8, sK98(X10,X9)),
% 126.93/16.61  		bind(X9, c35631),
% 126.93/16.61  		bind(X10, italien_0),
% 126.93/16.61  		bind(X11, italien_0),
% 126.93/16.61  		bind(X12, c35631),
% 126.93/16.61  		bind(X13, italienisch__1_1),
% 126.93/16.61  		bind(X14, italien_0),
% 126.93/16.61  		bind(X15, c35631),
% 126.93/16.61  		bind(X16, c35631),
% 126.93/16.61  		bind(X17, sK98(X10,X9)),
% 126.93/16.61  		bind(X18, c35631),
% 126.93/16.61  		bind(X19, sK98(X10,X9)),
% 126.93/16.61  		bind(X20, italien_0),
% 126.93/16.61  		bind(X21, c35631),
% 126.93/16.61  		bind(X22, italien_0),
% 126.93/16.61  		bind(X23, c35631)
% 126.93/16.61  	],
% 126.93/16.61  	[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])).
% 126.93/16.61  
% 126.93/16.61  % SZS output end IncompleteProof
%------------------------------------------------------------------------------