↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NLP208+1 : TPTP v8.1.0. Released v2.4.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 : Mon Jul 18 02:57:15 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NLP208+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/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 : Fri Jul  1 06:41:23 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.54  % SZS status Theorem
% 0.20/0.54  % SZS output begin IncompleteProof
% 0.20/0.54  cnf(c0, axiom,
% 0.20/0.54  	be(sK10,sK19,sK11,sK20)).
% 0.20/0.54  cnf(c1, plain,
% 0.20/0.54  	be(sK10,sK19,sK11,sK20),
% 0.20/0.54  	inference(start, [], [c0])).
% 0.20/0.54  
% 0.20/0.54  cnf(c2, axiom,
% 0.20/0.54  	X0 = X1 | ~be(X2,X3,X0,X1)).
% 0.20/0.54  cnf(a0, assumption,
% 0.20/0.54  	sK10 = X2).
% 0.20/0.54  cnf(a1, assumption,
% 0.20/0.54  	sK19 = X3).
% 0.20/0.54  cnf(a2, assumption,
% 0.20/0.54  	sK11 = X0).
% 0.20/0.54  cnf(a3, assumption,
% 0.20/0.54  	sK20 = X1).
% 0.20/0.54  cnf(c3, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])).
% 0.20/0.54  cnf(c4, plain,
% 0.20/0.54  	X0 = X1,
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])).
% 0.20/0.54  
% 0.20/0.54  cnf(c5, axiom,
% 0.20/0.54  	man(sK10,sK11)).
% 0.20/0.54  cnf(a4, assumption,
% 0.20/0.54  	sK11 = X0).
% 0.20/0.54  cnf(c6, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_subterm_extension, [assumptions([a4])], [c4, c5])).
% 0.20/0.54  cnf(c7, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_subterm_extension, [assumptions([a4])], [c4, c5])).
% 0.20/0.54  cnf(c8, plain,
% 0.20/0.54  	man(sK10,X1),
% 0.20/0.54  	inference(strict_subterm_extension, [assumptions([a4])], [c4, c5])).
% 0.20/0.54  
% 0.20/0.54  cnf(c9, axiom,
% 0.20/0.54  	male(X4,X5) | ~man(X4,X5)).
% 0.20/0.54  cnf(a5, assumption,
% 0.20/0.54  	sK10 = X4).
% 0.20/0.54  cnf(a6, assumption,
% 0.20/0.54  	X1 = X5).
% 0.20/0.54  cnf(c10, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])).
% 0.20/0.54  cnf(c11, plain,
% 0.20/0.54  	male(X4,X5),
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])).
% 0.20/0.54  
% 0.20/0.54  cnf(c12, axiom,
% 0.20/0.54  	~male(X6,X7) | ~unisex(X6,X7)).
% 0.20/0.54  cnf(a7, assumption,
% 0.20/0.54  	X4 = X6).
% 0.20/0.54  cnf(a8, assumption,
% 0.20/0.54  	X5 = X7).
% 0.20/0.54  cnf(c13, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c12])).
% 0.20/0.54  cnf(c14, plain,
% 0.20/0.54  	~unisex(X6,X7),
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c12])).
% 0.20/0.54  
% 0.20/0.54  cnf(c15, axiom,
% 0.20/0.54  	unisex(X8,X9) | ~object(X8,X9)).
% 0.20/0.54  cnf(a9, assumption,
% 0.20/0.54  	X6 = X8).
% 0.20/0.54  cnf(a10, assumption,
% 0.20/0.54  	X7 = X9).
% 0.20/0.54  cnf(c16, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c15])).
% 0.20/0.54  cnf(c17, plain,
% 0.20/0.54  	~object(X8,X9),
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c15])).
% 0.20/0.54  
% 0.20/0.54  cnf(c18, axiom,
% 0.20/0.54  	object(X10,X11) | ~artifact(X10,X11)).
% 0.20/0.54  cnf(a11, assumption,
% 0.20/0.54  	X8 = X10).
% 0.20/0.54  cnf(a12, assumption,
% 0.20/0.54  	X9 = X11).
% 0.20/0.54  cnf(c19, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c17, c18])).
% 0.20/0.54  cnf(c20, plain,
% 0.20/0.54  	~artifact(X10,X11),
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c17, c18])).
% 0.20/0.54  
% 0.20/0.54  cnf(c21, axiom,
% 0.20/0.54  	artifact(X12,X13) | ~instrumentality(X12,X13)).
% 0.20/0.54  cnf(a13, assumption,
% 0.20/0.54  	X10 = X12).
% 0.20/0.54  cnf(a14, assumption,
% 0.20/0.54  	X11 = X13).
% 0.20/0.54  cnf(c22, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c20, c21])).
% 0.20/0.54  cnf(c23, plain,
% 0.20/0.54  	~instrumentality(X12,X13),
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c20, c21])).
% 0.20/0.54  
% 0.20/0.54  cnf(c24, axiom,
% 0.20/0.54  	instrumentality(X14,X15) | ~device(X14,X15)).
% 0.20/0.54  cnf(a15, assumption,
% 0.20/0.54  	X12 = X14).
% 0.20/0.54  cnf(a16, assumption,
% 0.20/0.54  	X13 = X15).
% 0.20/0.54  cnf(c25, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a15, a16])], [c23, c24])).
% 0.20/0.54  cnf(c26, plain,
% 0.20/0.54  	~device(X14,X15),
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a15, a16])], [c23, c24])).
% 0.20/0.54  
% 0.20/0.54  cnf(c27, axiom,
% 0.20/0.54  	device(X16,X17) | ~wheel(X16,X17)).
% 0.20/0.54  cnf(a17, assumption,
% 0.20/0.54  	X14 = X16).
% 0.20/0.54  cnf(a18, assumption,
% 0.20/0.54  	X15 = X17).
% 0.20/0.54  cnf(c28, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c26, c27])).
% 0.20/0.54  cnf(c29, plain,
% 0.20/0.54  	~wheel(X16,X17),
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c26, c27])).
% 0.20/0.54  
% 0.20/0.54  cnf(c30, axiom,
% 0.20/0.54  	wheel(sK10,sK20)).
% 0.20/0.54  cnf(a19, assumption,
% 0.20/0.54  	X16 = sK10).
% 0.20/0.54  cnf(a20, assumption,
% 0.20/0.54  	X17 = sK20).
% 0.20/0.54  cnf(c31, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c29, c30])).
% 0.20/0.54  cnf(c32, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c29, c30])).
% 0.20/0.54  
% 0.20/0.54  cnf(c33, plain,
% 0.20/0.54  	$false,
% 0.20/0.54  	inference(constraint_solving, [
% 0.20/0.54  		bind(X0, sK11),
% 0.20/0.54  		bind(X1, sK20),
% 0.20/0.54  		bind(X2, sK10),
% 0.20/0.54  		bind(X3, sK19),
% 0.20/0.54  		bind(X4, sK10),
% 0.20/0.54  		bind(X5, sK20),
% 0.20/0.54  		bind(X6, sK10),
% 0.20/0.54  		bind(X7, sK20),
% 0.20/0.54  		bind(X8, sK10),
% 0.20/0.54  		bind(X9, sK20),
% 0.20/0.54  		bind(X10, sK10),
% 0.20/0.54  		bind(X11, sK20),
% 0.20/0.54  		bind(X12, sK10),
% 0.20/0.54  		bind(X13, sK20),
% 0.20/0.54  		bind(X14, sK10),
% 0.20/0.54  		bind(X15, sK20),
% 0.20/0.54  		bind(X16, sK10),
% 0.20/0.54  		bind(X17, sK20)
% 0.20/0.54  	],
% 0.20/0.54  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 0.20/0.54  
% 0.20/0.54  % SZS output end IncompleteProof
%------------------------------------------------------------------------------