↑ Up

lazyCoP---0.1.THM-Ass.s

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

% Result   : Theorem 0.20s 0.55s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : CSR115+78 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n025.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jun  9 17:51:05 EDT 2022
% 0.20/0.34  % CPUTime  : 
% 0.20/0.55  % SZS status Theorem
% 0.20/0.55  % SZS output begin IncompleteProof
% 0.20/0.55  cnf(c0, axiom,
% 0.20/0.55  	~val(X0,bmw_0) | ~sub(X0,name_1_1) | ~sub(X1,firma_1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0)).
% 0.20/0.55  cnf(c1, plain,
% 0.20/0.55  	~val(X0,bmw_0) | ~sub(X0,name_1_1) | ~sub(X1,firma_1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0),
% 0.20/0.55  	inference(start, [], [c0])).
% 0.20/0.55  
% 0.20/0.55  cnf(c2, axiom,
% 0.20/0.55  	val(c4653,bmw_0)).
% 0.20/0.55  cnf(a0, assumption,
% 0.20/0.55  	X0 = c4653).
% 0.20/0.55  cnf(a1, assumption,
% 0.20/0.55  	bmw_0 = bmw_0).
% 0.20/0.55  cnf(c3, plain,
% 0.20/0.55  	~sub(X0,name_1_1) | ~sub(X1,firma_1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0),
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.55  cnf(c4, plain,
% 0.20/0.55  	$false,
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.55  
% 0.20/0.55  cnf(c5, axiom,
% 0.20/0.55  	sub(c4653,name_1_1)).
% 0.20/0.55  cnf(a2, assumption,
% 0.20/0.55  	X0 = c4653).
% 0.20/0.55  cnf(a3, assumption,
% 0.20/0.55  	name_1_1 = name_1_1).
% 0.20/0.55  cnf(c6, plain,
% 0.20/0.55  	~sub(X1,firma_1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0),
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.20/0.55  cnf(c7, plain,
% 0.20/0.55  	$false,
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.20/0.55  
% 0.20/0.55  cnf(c8, axiom,
% 0.20/0.55  	sub(c5557,firma_1_1)).
% 0.20/0.55  cnf(a4, assumption,
% 0.20/0.55  	X1 = c5557).
% 0.20/0.55  cnf(a5, assumption,
% 0.20/0.55  	firma_1_1 = firma_1_1).
% 0.20/0.55  cnf(c9, plain,
% 0.20/0.55  	~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0),
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.20/0.55  cnf(c10, plain,
% 0.20/0.55  	$false,
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.20/0.55  
% 0.20/0.55  cnf(c11, axiom,
% 0.20/0.55  	obj(c5513,c5557)).
% 0.20/0.55  cnf(a6, assumption,
% 0.20/0.55  	X2 = c5513).
% 0.20/0.55  cnf(a7, assumption,
% 0.20/0.55  	X1 = c5557).
% 0.20/0.55  cnf(c12, plain,
% 0.20/0.55  	~attr(X3,X4) | ~attr(X5,X0),
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.20/0.55  cnf(c13, plain,
% 0.20/0.55  	$false,
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.20/0.55  
% 0.20/0.55  cnf(c14, axiom,
% 0.20/0.55  	attr(c5557,c5558)).
% 0.20/0.55  cnf(a8, assumption,
% 0.20/0.55  	X3 = c5557).
% 0.20/0.55  cnf(a9, assumption,
% 0.20/0.55  	X4 = c5558).
% 0.20/0.55  cnf(c15, plain,
% 0.20/0.55  	~attr(X5,X0),
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 0.20/0.55  cnf(c16, plain,
% 0.20/0.55  	$false,
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 0.20/0.55  
% 0.20/0.55  cnf(c17, axiom,
% 0.20/0.55  	attr(c4652,c4653)).
% 0.20/0.55  cnf(a10, assumption,
% 0.20/0.55  	X5 = c4652).
% 0.20/0.55  cnf(a11, assumption,
% 0.20/0.55  	X0 = c4653).
% 0.20/0.55  cnf(c18, plain,
% 0.20/0.55  	$false,
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.20/0.55  cnf(c19, plain,
% 0.20/0.55  	$false,
% 0.20/0.55  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.20/0.55  
% 0.20/0.55  cnf(c20, plain,
% 0.20/0.55  	$false,
% 0.20/0.55  	inference(constraint_solving, [
% 0.20/0.55  		bind(X0, c4653),
% 0.20/0.55  		bind(X1, c5557),
% 0.20/0.55  		bind(X2, c5513),
% 0.20/0.55  		bind(X3, c5557),
% 0.20/0.55  		bind(X4, c5558),
% 0.20/0.55  		bind(X5, c4652)
% 0.20/0.55  	],
% 0.20/0.55  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 0.20/0.55  
% 0.20/0.55  % SZS output end IncompleteProof
%------------------------------------------------------------------------------