↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : CSR115+50 : 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 : n026.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:39 EDT 2022

% Result   : Theorem 0.52s 0.60s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR115+50 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n026.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 04:16:49 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.52/0.60  % SZS status Theorem
% 0.52/0.60  % SZS output begin IncompleteProof
% 0.52/0.60  cnf(c0, axiom,
% 0.52/0.60  	~val(X0,bmw_0) | ~subs(X1,n374bernehmen_1_1) | ~sub(X0,name_1_1) | ~sub(X2,firma_1_1) | ~attr(X3,X4) | ~attr(X5,X0)).
% 0.52/0.60  cnf(c1, plain,
% 0.52/0.60  	~val(X0,bmw_0) | ~subs(X1,n374bernehmen_1_1) | ~sub(X0,name_1_1) | ~sub(X2,firma_1_1) | ~attr(X3,X4) | ~attr(X5,X0),
% 0.52/0.60  	inference(start, [], [c0])).
% 0.52/0.60  
% 0.52/0.60  cnf(c2, axiom,
% 0.52/0.60  	val(c74,bmw_0)).
% 0.52/0.60  cnf(a0, assumption,
% 0.52/0.60  	X0 = c74).
% 0.52/0.60  cnf(a1, assumption,
% 0.52/0.60  	bmw_0 = bmw_0).
% 0.52/0.60  cnf(c3, plain,
% 0.52/0.60  	~subs(X1,n374bernehmen_1_1) | ~sub(X0,name_1_1) | ~sub(X2,firma_1_1) | ~attr(X3,X4) | ~attr(X5,X0),
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.52/0.60  cnf(c4, plain,
% 0.52/0.60  	$false,
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.52/0.60  
% 0.52/0.60  cnf(c5, axiom,
% 0.52/0.60  	subs(sK53(X6,X7),X7) | ~subs(X6,X8) | ~chea(X7,X8)).
% 0.52/0.60  cnf(a2, assumption,
% 0.52/0.60  	X1 = sK53(X6,X7)).
% 0.52/0.60  cnf(a3, assumption,
% 0.52/0.60  	n374bernehmen_1_1 = X7).
% 0.52/0.60  cnf(c6, plain,
% 0.52/0.60  	~sub(X0,name_1_1) | ~sub(X2,firma_1_1) | ~attr(X3,X4) | ~attr(X5,X0),
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.52/0.60  cnf(c7, plain,
% 0.52/0.60  	~subs(X6,X8) | ~chea(X7,X8),
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.52/0.60  
% 0.52/0.60  cnf(c8, axiom,
% 0.52/0.60  	subs(c25,annahme_1_1)).
% 0.52/0.60  cnf(a4, assumption,
% 0.52/0.60  	X6 = c25).
% 0.52/0.60  cnf(a5, assumption,
% 0.52/0.60  	X8 = annahme_1_1).
% 0.52/0.60  cnf(c9, plain,
% 0.52/0.60  	~chea(X7,X8),
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.52/0.60  cnf(c10, plain,
% 0.52/0.60  	$false,
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.52/0.60  
% 0.52/0.60  cnf(c11, axiom,
% 0.52/0.60  	chea(n374bernehmen_1_1,annahme_1_1)).
% 0.52/0.60  cnf(a6, assumption,
% 0.52/0.60  	X7 = n374bernehmen_1_1).
% 0.52/0.60  cnf(a7, assumption,
% 0.52/0.60  	X8 = annahme_1_1).
% 0.52/0.60  cnf(c12, plain,
% 0.52/0.60  	$false,
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.52/0.60  cnf(c13, plain,
% 0.52/0.60  	$false,
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.52/0.60  
% 0.52/0.60  cnf(c14, axiom,
% 0.52/0.60  	sub(c74,name_1_1)).
% 0.52/0.60  cnf(a8, assumption,
% 0.52/0.60  	X0 = c74).
% 0.52/0.60  cnf(a9, assumption,
% 0.52/0.60  	name_1_1 = name_1_1).
% 0.52/0.60  cnf(c15, plain,
% 0.52/0.60  	~sub(X2,firma_1_1) | ~attr(X3,X4) | ~attr(X5,X0),
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])).
% 0.52/0.60  cnf(c16, plain,
% 0.52/0.60  	$false,
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])).
% 0.52/0.60  
% 0.52/0.60  cnf(c17, axiom,
% 0.52/0.60  	sub(c73,firma_1_1)).
% 0.52/0.60  cnf(a10, assumption,
% 0.52/0.60  	X2 = c73).
% 0.52/0.60  cnf(a11, assumption,
% 0.52/0.60  	firma_1_1 = firma_1_1).
% 0.52/0.60  cnf(c18, plain,
% 0.52/0.60  	~attr(X3,X4) | ~attr(X5,X0),
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.52/0.60  cnf(c19, plain,
% 0.52/0.60  	$false,
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.52/0.60  
% 0.52/0.60  cnf(c20, axiom,
% 0.52/0.60  	attr(c86,c87)).
% 0.52/0.60  cnf(a12, assumption,
% 0.52/0.60  	X3 = c86).
% 0.52/0.60  cnf(a13, assumption,
% 0.52/0.60  	X4 = c87).
% 0.52/0.60  cnf(c21, plain,
% 0.52/0.60  	~attr(X5,X0),
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c20])).
% 0.52/0.60  cnf(c22, plain,
% 0.52/0.60  	$false,
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c20])).
% 0.52/0.60  
% 0.52/0.60  cnf(c23, axiom,
% 0.52/0.60  	attr(c73,c74)).
% 0.52/0.60  cnf(a14, assumption,
% 0.52/0.60  	X5 = c73).
% 0.52/0.60  cnf(a15, assumption,
% 0.52/0.60  	X0 = c74).
% 0.52/0.60  cnf(c24, plain,
% 0.52/0.60  	$false,
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c23])).
% 0.52/0.60  cnf(c25, plain,
% 0.52/0.60  	$false,
% 0.52/0.60  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c23])).
% 0.52/0.60  
% 0.52/0.60  cnf(c26, plain,
% 0.52/0.60  	$false,
% 0.52/0.60  	inference(constraint_solving, [
% 0.52/0.60  		bind(X0, c74),
% 0.52/0.60  		bind(X1, sK53(X6,X7)),
% 0.52/0.60  		bind(X2, c73),
% 0.52/0.60  		bind(X3, c86),
% 0.52/0.60  		bind(X4, c87),
% 0.52/0.60  		bind(X5, c73),
% 0.52/0.60  		bind(X6, c25),
% 0.52/0.60  		bind(X7, n374bernehmen_1_1),
% 0.52/0.60  		bind(X8, annahme_1_1)
% 0.52/0.60  	],
% 0.52/0.60  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])).
% 0.52/0.60  
% 0.52/0.60  % SZS output end IncompleteProof
%------------------------------------------------------------------------------