TSTP Solution File: CSR115+17 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : CSR115+17 : 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 : n025.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:32 EDT 2022

% Result   : Theorem 0.43s 0.59s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR115+17 : TPTP v8.1.0. Released v4.0.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.34  % Computer : n025.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 : Sat Jun 11 00:30:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.43/0.59  % SZS status Theorem
% 0.43/0.59  % SZS output begin IncompleteProof
% 0.43/0.59  cnf(c0, axiom,
% 0.43/0.59  	~sub(X0,name_1_1) | ~sub(X1,name_1_1) | ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1)).
% 0.43/0.59  cnf(c1, plain,
% 0.43/0.59  	~sub(X0,name_1_1) | ~sub(X1,name_1_1) | ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1),
% 0.43/0.59  	inference(start, [], [c0])).
% 0.43/0.59  
% 0.43/0.59  cnf(c2, axiom,
% 0.43/0.59  	sub(sK97(X6,X7),name_1_1) | ~sP34(X6,X7)).
% 0.43/0.59  cnf(a0, assumption,
% 0.43/0.59  	X0 = sK97(X6,X7)).
% 0.43/0.59  cnf(a1, assumption,
% 0.43/0.59  	name_1_1 = name_1_1).
% 0.43/0.59  cnf(c3, plain,
% 0.43/0.59  	~sub(X1,name_1_1) | ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1),
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.43/0.59  cnf(c4, plain,
% 0.43/0.59  	~sP34(X6,X7),
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.43/0.59  
% 0.43/0.59  cnf(c5, axiom,
% 0.43/0.59  	sP34(X8,X9) | ~state_adjective_state_binding(X10,X8) | ~prop(X9,X10)).
% 0.43/0.59  cnf(a2, assumption,
% 0.43/0.59  	X6 = X8).
% 0.43/0.59  cnf(a3, assumption,
% 0.43/0.59  	X7 = X9).
% 0.43/0.59  cnf(c6, plain,
% 0.43/0.59  	$false,
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.43/0.59  cnf(c7, plain,
% 0.43/0.59  	~state_adjective_state_binding(X10,X8) | ~prop(X9,X10),
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.43/0.59  
% 0.43/0.59  cnf(c8, axiom,
% 0.43/0.59  	state_adjective_state_binding(britisch__1_1,grossbritannien_0)).
% 0.43/0.59  cnf(a4, assumption,
% 0.43/0.59  	X10 = britisch__1_1).
% 0.43/0.59  cnf(a5, assumption,
% 0.43/0.59  	X8 = grossbritannien_0).
% 0.43/0.59  cnf(c9, plain,
% 0.43/0.59  	~prop(X9,X10),
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.43/0.59  cnf(c10, plain,
% 0.43/0.59  	$false,
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.43/0.59  
% 0.43/0.59  cnf(c11, axiom,
% 0.43/0.59  	prop(c175,britisch__1_1)).
% 0.43/0.59  cnf(a6, assumption,
% 0.43/0.59  	X9 = c175).
% 0.43/0.59  cnf(a7, assumption,
% 0.43/0.59  	X10 = britisch__1_1).
% 0.43/0.59  cnf(c12, plain,
% 0.43/0.59  	$false,
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.43/0.59  cnf(c13, plain,
% 0.43/0.59  	$false,
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.43/0.59  
% 0.43/0.59  cnf(c14, plain,
% 0.43/0.59  	sub(X0,name_1_1)).
% 0.43/0.59  cnf(a8, assumption,
% 0.43/0.59  	X1 = X0).
% 0.43/0.59  cnf(a9, assumption,
% 0.43/0.59  	name_1_1 = name_1_1).
% 0.43/0.59  cnf(c15, plain,
% 0.43/0.59  	~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1),
% 0.43/0.59  	inference(predicate_reduction, [assumptions([a8, a9])], [c3, c14])).
% 0.43/0.59  
% 0.43/0.59  cnf(c16, axiom,
% 0.43/0.59  	attr(c185,c187)).
% 0.43/0.59  cnf(a10, assumption,
% 0.43/0.59  	X2 = c185).
% 0.43/0.59  cnf(a11, assumption,
% 0.43/0.59  	X3 = c187).
% 0.43/0.59  cnf(c17, plain,
% 0.43/0.59  	~attr(X4,X0) | ~attr(X5,X1),
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c16])).
% 0.43/0.59  cnf(c18, plain,
% 0.43/0.59  	$false,
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c16])).
% 0.43/0.59  
% 0.43/0.59  cnf(c19, axiom,
% 0.43/0.59  	attr(sK96(X11,X12),sK97(X11,X12)) | ~sP34(X11,X12)).
% 0.43/0.59  cnf(a12, assumption,
% 0.43/0.59  	X4 = sK96(X11,X12)).
% 0.43/0.59  cnf(a13, assumption,
% 0.43/0.59  	X0 = sK97(X11,X12)).
% 0.43/0.59  cnf(c20, plain,
% 0.43/0.59  	~attr(X5,X1),
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])).
% 0.43/0.59  cnf(c21, plain,
% 0.43/0.59  	~sP34(X11,X12),
% 0.43/0.59  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])).
% 0.43/0.59  
% 0.43/0.59  cnf(c22, plain,
% 0.43/0.59  	sP34(X6,X7)).
% 0.43/0.59  cnf(a14, assumption,
% 0.43/0.59  	X11 = X6).
% 0.43/0.59  cnf(a15, assumption,
% 0.43/0.59  	X12 = X7).
% 0.43/0.59  cnf(c23, plain,
% 0.43/0.59  	$false,
% 0.43/0.59  	inference(predicate_reduction, [assumptions([a14, a15])], [c21, c22])).
% 0.43/0.59  
% 0.43/0.59  cnf(c24, plain,
% 0.43/0.59  	attr(X4,X0)).
% 0.43/0.59  cnf(a16, assumption,
% 0.43/0.59  	X5 = X4).
% 0.43/0.59  cnf(a17, assumption,
% 0.43/0.59  	X1 = X0).
% 0.43/0.59  cnf(c25, plain,
% 0.43/0.59  	$false,
% 0.43/0.59  	inference(predicate_reduction, [assumptions([a16, a17])], [c20, c24])).
% 0.43/0.59  
% 0.43/0.59  cnf(c26, plain,
% 0.43/0.59  	$false,
% 0.43/0.59  	inference(constraint_solving, [
% 0.43/0.59  		bind(X0, sK97(X6,X7)),
% 0.43/0.59  		bind(X1, sK97(X6,X7)),
% 0.43/0.59  		bind(X2, c185),
% 0.43/0.59  		bind(X3, c187),
% 0.43/0.59  		bind(X4, sK96(X11,X12)),
% 0.43/0.59  		bind(X5, sK96(X11,X12)),
% 0.43/0.59  		bind(X6, grossbritannien_0),
% 0.43/0.59  		bind(X7, c175),
% 0.43/0.59  		bind(X8, grossbritannien_0),
% 0.43/0.59  		bind(X9, c175),
% 0.43/0.59  		bind(X10, britisch__1_1),
% 0.43/0.59  		bind(X11, grossbritannien_0),
% 0.43/0.59  		bind(X12, c175)
% 0.43/0.59  	],
% 0.43/0.59  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 0.43/0.59  
% 0.43/0.59  % SZS output end IncompleteProof
%------------------------------------------------------------------------------