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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : CSR114+1 : 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 : n012.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:27 EDT 2022

% Result   : Theorem 0.41s 0.57s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : CSR114+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.33  % Computer : n012.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sat Jun 11 04:32:12 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.41/0.57  % SZS status Theorem
% 0.41/0.57  % SZS output begin IncompleteProof
% 0.41/0.57  cnf(c0, axiom,
% 0.41/0.57  	~val(X0,rom_0) | ~subs(X1,stehen_1_1) | ~sub(X2,kolosseum_1_1) | ~sub(X3,stadt__1_1) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X4) | ~attr(X3,X0) | ~in(X4,X3)).
% 0.41/0.57  cnf(c1, plain,
% 0.41/0.57  	~val(X0,rom_0) | ~subs(X1,stehen_1_1) | ~sub(X2,kolosseum_1_1) | ~sub(X3,stadt__1_1) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X4) | ~attr(X3,X0) | ~in(X4,X3),
% 0.41/0.57  	inference(start, [], [c0])).
% 0.41/0.57  
% 0.41/0.57  cnf(c2, axiom,
% 0.41/0.57  	val(c148,rom_0)).
% 0.41/0.57  cnf(a0, assumption,
% 0.41/0.57  	X0 = c148).
% 0.41/0.57  cnf(a1, assumption,
% 0.41/0.57  	rom_0 = rom_0).
% 0.41/0.57  cnf(c3, plain,
% 0.41/0.57  	~subs(X1,stehen_1_1) | ~sub(X2,kolosseum_1_1) | ~sub(X3,stadt__1_1) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X4) | ~attr(X3,X0) | ~in(X4,X3),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.41/0.57  cnf(c4, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.41/0.57  
% 0.41/0.57  cnf(c5, axiom,
% 0.41/0.57  	subs(sK111(X5,X6),stehen_1_1) | ~sP48(X5,X6)).
% 0.41/0.57  cnf(a2, assumption,
% 0.41/0.57  	X1 = sK111(X5,X6)).
% 0.41/0.57  cnf(a3, assumption,
% 0.41/0.57  	stehen_1_1 = stehen_1_1).
% 0.41/0.57  cnf(c6, plain,
% 0.41/0.57  	~sub(X2,kolosseum_1_1) | ~sub(X3,stadt__1_1) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X4) | ~attr(X3,X0) | ~in(X4,X3),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.41/0.57  cnf(c7, plain,
% 0.41/0.57  	~sP48(X5,X6),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.41/0.57  
% 0.41/0.57  cnf(c8, axiom,
% 0.41/0.57  	sP48(X7,X8) | ~loc(X7,X8)).
% 0.41/0.57  cnf(a4, assumption,
% 0.41/0.57  	X5 = X7).
% 0.41/0.57  cnf(a5, assumption,
% 0.41/0.57  	X6 = X8).
% 0.41/0.57  cnf(c9, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.41/0.57  cnf(c10, plain,
% 0.41/0.57  	~loc(X7,X8),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.41/0.57  
% 0.41/0.57  cnf(c11, axiom,
% 0.41/0.57  	loc(c140,c169)).
% 0.41/0.57  cnf(a6, assumption,
% 0.41/0.57  	X7 = c140).
% 0.41/0.57  cnf(a7, assumption,
% 0.41/0.57  	X8 = c169).
% 0.41/0.57  cnf(c12, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.41/0.57  cnf(c13, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.41/0.57  
% 0.41/0.57  cnf(c14, axiom,
% 0.41/0.57  	sub(c140,kolosseum_1_1)).
% 0.41/0.57  cnf(a8, assumption,
% 0.41/0.57  	X2 = c140).
% 0.41/0.57  cnf(a9, assumption,
% 0.41/0.57  	kolosseum_1_1 = kolosseum_1_1).
% 0.41/0.57  cnf(c15, plain,
% 0.41/0.57  	~sub(X3,stadt__1_1) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X4) | ~attr(X3,X0) | ~in(X4,X3),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])).
% 0.41/0.57  cnf(c16, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])).
% 0.41/0.57  
% 0.41/0.57  cnf(c17, axiom,
% 0.41/0.57  	sub(c147,stadt__1_1)).
% 0.41/0.57  cnf(a10, assumption,
% 0.41/0.57  	X3 = c147).
% 0.41/0.57  cnf(a11, assumption,
% 0.41/0.57  	stadt__1_1 = stadt__1_1).
% 0.41/0.57  cnf(c18, plain,
% 0.41/0.57  	~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X4) | ~attr(X3,X0) | ~in(X4,X3),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.41/0.57  cnf(c19, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.41/0.57  
% 0.41/0.57  cnf(c20, axiom,
% 0.41/0.57  	sub(c148,name_1_1)).
% 0.41/0.57  cnf(a12, assumption,
% 0.41/0.57  	X0 = c148).
% 0.41/0.57  cnf(a13, assumption,
% 0.41/0.57  	name_1_1 = name_1_1).
% 0.41/0.57  cnf(c21, plain,
% 0.41/0.57  	~scar(X1,X2) | ~loc(X1,X4) | ~attr(X3,X0) | ~in(X4,X3),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c20])).
% 0.41/0.57  cnf(c22, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c20])).
% 0.41/0.57  
% 0.41/0.57  cnf(c23, axiom,
% 0.41/0.57  	scar(sK111(X9,X10),X9) | ~sP48(X9,X10)).
% 0.41/0.57  cnf(a14, assumption,
% 0.41/0.57  	X1 = sK111(X9,X10)).
% 0.41/0.57  cnf(a15, assumption,
% 0.41/0.57  	X2 = X9).
% 0.41/0.57  cnf(c24, plain,
% 0.41/0.57  	~loc(X1,X4) | ~attr(X3,X0) | ~in(X4,X3),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c23])).
% 0.41/0.57  cnf(c25, plain,
% 0.41/0.57  	~sP48(X9,X10),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c23])).
% 0.41/0.57  
% 0.41/0.57  cnf(c26, plain,
% 0.41/0.57  	sP48(X5,X6)).
% 0.41/0.57  cnf(a16, assumption,
% 0.41/0.57  	X9 = X5).
% 0.41/0.57  cnf(a17, assumption,
% 0.41/0.57  	X10 = X6).
% 0.41/0.57  cnf(c27, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(predicate_reduction, [assumptions([a16, a17])], [c25, c26])).
% 0.41/0.57  
% 0.41/0.57  cnf(c28, axiom,
% 0.41/0.57  	loc(sK111(X11,X12),X12) | ~sP48(X11,X12)).
% 0.41/0.57  cnf(a18, assumption,
% 0.41/0.57  	X1 = sK111(X11,X12)).
% 0.41/0.57  cnf(a19, assumption,
% 0.41/0.57  	X4 = X12).
% 0.41/0.57  cnf(c29, plain,
% 0.41/0.57  	~attr(X3,X0) | ~in(X4,X3),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c24, c28])).
% 0.41/0.57  cnf(c30, plain,
% 0.41/0.57  	~sP48(X11,X12),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c24, c28])).
% 0.41/0.57  
% 0.41/0.57  cnf(c31, plain,
% 0.41/0.57  	sP48(X5,X6)).
% 0.41/0.57  cnf(a20, assumption,
% 0.41/0.57  	X11 = X5).
% 0.41/0.57  cnf(a21, assumption,
% 0.41/0.57  	X12 = X6).
% 0.41/0.57  cnf(c32, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(predicate_reduction, [assumptions([a20, a21])], [c30, c31])).
% 0.41/0.57  
% 0.41/0.57  cnf(c33, axiom,
% 0.41/0.57  	attr(c147,c148)).
% 0.41/0.57  cnf(a22, assumption,
% 0.41/0.57  	X3 = c147).
% 0.41/0.57  cnf(a23, assumption,
% 0.41/0.57  	X0 = c148).
% 0.41/0.57  cnf(c34, plain,
% 0.41/0.57  	~in(X4,X3),
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a22, a23])], [c29, c33])).
% 0.41/0.57  cnf(c35, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a22, a23])], [c29, c33])).
% 0.41/0.57  
% 0.41/0.57  cnf(c36, axiom,
% 0.41/0.57  	in(c169,c147)).
% 0.41/0.57  cnf(a24, assumption,
% 0.41/0.57  	X4 = c169).
% 0.41/0.57  cnf(a25, assumption,
% 0.41/0.57  	X3 = c147).
% 0.41/0.57  cnf(c37, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c34, c36])).
% 0.41/0.57  cnf(c38, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c34, c36])).
% 0.41/0.57  
% 0.41/0.57  cnf(c39, plain,
% 0.41/0.57  	$false,
% 0.41/0.57  	inference(constraint_solving, [
% 0.41/0.57  		bind(X0, c148),
% 0.41/0.57  		bind(X1, sK111(X5,X6)),
% 0.41/0.57  		bind(X2, c140),
% 0.41/0.57  		bind(X3, c147),
% 0.41/0.57  		bind(X4, c169),
% 0.41/0.57  		bind(X5, c140),
% 0.41/0.57  		bind(X6, c169),
% 0.41/0.57  		bind(X7, c140),
% 0.41/0.57  		bind(X8, c169),
% 0.41/0.57  		bind(X9, c140),
% 0.41/0.57  		bind(X10, c169),
% 0.41/0.57  		bind(X11, c140),
% 0.41/0.57  		bind(X12, c169)
% 0.41/0.57  	],
% 0.41/0.57  	[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])).
% 0.41/0.57  
% 0.41/0.57  % SZS output end IncompleteProof
%------------------------------------------------------------------------------