↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : KRS070+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n032.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 : Sun Jul 17 03:12:55 EDT 2022

% Result   : Unsatisfiable 0.09s 0.29s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : KRS070+1 : TPTP v8.1.0. Released v3.1.0.
% 0.02/0.09  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Tue Jun  7 10:27:05 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.09/0.29  % SZS status Theorem
% 0.09/0.29  % SZS output begin IncompleteProof
% 0.09/0.29  cnf(c0, axiom,
% 0.09/0.29  	~cc1(X0) | ~cc2(X0) | ~rrx3(X1,X0) | ~sP0(X1)).
% 0.09/0.29  cnf(c1, plain,
% 0.09/0.29  	~cc1(X0) | ~cc2(X0) | ~rrx3(X1,X0) | ~sP0(X1),
% 0.09/0.29  	inference(start, [], [c0])).
% 0.09/0.29  
% 0.09/0.29  cnf(c2, axiom,
% 0.09/0.29  	cc1(sK2(X2)) | ~cUnsatisfiable(X2)).
% 0.09/0.29  cnf(a0, assumption,
% 0.09/0.29  	X0 = sK2(X2)).
% 0.09/0.29  cnf(c3, plain,
% 0.09/0.29  	~cc2(X0) | ~rrx3(X1,X0) | ~sP0(X1),
% 0.09/0.29  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.09/0.29  cnf(c4, plain,
% 0.09/0.29  	~cUnsatisfiable(X2),
% 0.09/0.29  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.09/0.29  
% 0.09/0.29  cnf(c5, axiom,
% 0.09/0.29  	cUnsatisfiable(i2003_11_14_17_18_32242)).
% 0.09/0.29  cnf(a1, assumption,
% 0.09/0.29  	X2 = i2003_11_14_17_18_32242).
% 0.09/0.29  cnf(c6, plain,
% 0.09/0.29  	$false,
% 0.09/0.29  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.09/0.29  cnf(c7, plain,
% 0.09/0.29  	$false,
% 0.09/0.29  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.09/0.29  
% 0.09/0.29  cnf(c8, axiom,
% 0.09/0.29  	cc2(sK3(X3)) | ~cUnsatisfiable(X3)).
% 0.09/0.29  cnf(a2, assumption,
% 0.09/0.29  	X4 = X0).
% 0.09/0.29  cnf(c9, plain,
% 0.09/0.29  	~rrx3(X1,X0) | ~sP0(X1),
% 0.09/0.29  	inference(lazy_predicate_extension, [assumptions([a2])], [c3, c8])).
% 0.09/0.30  cnf(c10, plain,
% 0.09/0.30  	~cUnsatisfiable(X3),
% 0.09/0.30  	inference(lazy_predicate_extension, [assumptions([a2])], [c3, c8])).
% 0.09/0.30  cnf(c11, plain,
% 0.09/0.30  	sK3(X3) != X4,
% 0.09/0.30  	inference(lazy_predicate_extension, [assumptions([a2])], [c3, c8])).
% 0.09/0.30  
% 0.09/0.30  cnf(c12, axiom,
% 0.09/0.30  	X5 = X6 | ~rrx(X7,X6) | ~rrx(X7,X5)).
% 0.09/0.30  cnf(a3, assumption,
% 0.09/0.30  	sK3(X3) = X6).
% 0.09/0.30  cnf(c13, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(variable_extension, [assumptions([a3])], [c11, c12])).
% 0.09/0.30  cnf(c14, plain,
% 0.09/0.30  	~rrx(X7,X6) | ~rrx(X7,X5),
% 0.09/0.30  	inference(variable_extension, [assumptions([a3])], [c11, c12])).
% 0.09/0.30  cnf(c15, plain,
% 0.09/0.30  	X5 != X8 | X8 != X4,
% 0.09/0.30  	inference(variable_extension, [assumptions([a3])], [c11, c12])).
% 0.09/0.30  
% 0.09/0.30  cnf(a4, assumption,
% 0.09/0.30  	X5 = X8).
% 0.09/0.30  cnf(c16, plain,
% 0.09/0.30  	X8 != X4,
% 0.09/0.30  	inference(reflexivity, [assumptions([a4])], [c15])).
% 0.09/0.30  
% 0.09/0.30  cnf(a5, assumption,
% 0.09/0.30  	X8 = X4).
% 0.09/0.30  cnf(c17, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(reflexivity, [assumptions([a5])], [c16])).
% 0.09/0.30  
% 0.09/0.30  cnf(c18, axiom,
% 0.09/0.30  	rrx(X9,X10) | ~rrx4(X9,X10)).
% 0.09/0.30  cnf(a6, assumption,
% 0.09/0.30  	X7 = X9).
% 0.09/0.30  cnf(a7, assumption,
% 0.09/0.30  	X6 = X10).
% 0.09/0.30  cnf(c19, plain,
% 0.09/0.30  	~rrx(X7,X5),
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c14, c18])).
% 0.09/0.30  cnf(c20, plain,
% 0.09/0.30  	~rrx4(X9,X10),
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c14, c18])).
% 0.09/0.30  
% 0.09/0.30  cnf(c21, axiom,
% 0.09/0.30  	rrx4(X11,sK3(X11)) | ~cUnsatisfiable(X11)).
% 0.09/0.30  cnf(a8, assumption,
% 0.09/0.30  	X9 = X11).
% 0.09/0.30  cnf(a9, assumption,
% 0.09/0.30  	X10 = sK3(X11)).
% 0.09/0.30  cnf(c22, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c20, c21])).
% 0.09/0.30  cnf(c23, plain,
% 0.09/0.30  	~cUnsatisfiable(X11),
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c20, c21])).
% 0.09/0.30  
% 0.09/0.30  cnf(c24, plain,
% 0.09/0.30  	cUnsatisfiable(X2)).
% 0.09/0.30  cnf(a10, assumption,
% 0.09/0.30  	X11 = X2).
% 0.09/0.30  cnf(c25, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(predicate_reduction, [assumptions([a10])], [c23, c24])).
% 0.09/0.30  
% 0.09/0.30  cnf(c26, axiom,
% 0.09/0.30  	rrx(X12,X13) | ~rrx3(X12,X13)).
% 0.09/0.30  cnf(a11, assumption,
% 0.09/0.30  	X7 = X12).
% 0.09/0.30  cnf(a12, assumption,
% 0.09/0.30  	X5 = X13).
% 0.09/0.30  cnf(c27, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c26])).
% 0.09/0.30  cnf(c28, plain,
% 0.09/0.30  	~rrx3(X12,X13),
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c26])).
% 0.09/0.30  
% 0.09/0.30  cnf(c29, axiom,
% 0.09/0.30  	rrx3(X14,sK2(X14)) | ~cUnsatisfiable(X14)).
% 0.09/0.30  cnf(a13, assumption,
% 0.09/0.30  	X12 = X14).
% 0.09/0.30  cnf(a14, assumption,
% 0.09/0.30  	X13 = sK2(X14)).
% 0.09/0.30  cnf(c30, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c28, c29])).
% 0.09/0.30  cnf(c31, plain,
% 0.09/0.30  	~cUnsatisfiable(X14),
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c28, c29])).
% 0.09/0.30  
% 0.09/0.30  cnf(c32, plain,
% 0.09/0.30  	cUnsatisfiable(X2)).
% 0.09/0.30  cnf(a15, assumption,
% 0.09/0.30  	X14 = X2).
% 0.09/0.30  cnf(c33, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(predicate_reduction, [assumptions([a15])], [c31, c32])).
% 0.09/0.30  
% 0.09/0.30  cnf(c34, plain,
% 0.09/0.30  	cUnsatisfiable(X2)).
% 0.09/0.30  cnf(a16, assumption,
% 0.09/0.30  	X3 = X2).
% 0.09/0.30  cnf(c35, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(predicate_reduction, [assumptions([a16])], [c10, c34])).
% 0.09/0.30  
% 0.09/0.30  cnf(c36, plain,
% 0.09/0.30  	rrx3(X12,X13)).
% 0.09/0.30  cnf(a17, assumption,
% 0.09/0.30  	X1 = X12).
% 0.09/0.30  cnf(a18, assumption,
% 0.09/0.30  	X0 = X13).
% 0.09/0.30  cnf(c37, plain,
% 0.09/0.30  	~sP0(X1),
% 0.09/0.30  	inference(predicate_reduction, [assumptions([a17, a18])], [c9, c36])).
% 0.09/0.30  
% 0.09/0.30  cnf(c38, axiom,
% 0.09/0.30  	sP0(X15) | ~cUnsatisfiable(X15)).
% 0.09/0.30  cnf(a19, assumption,
% 0.09/0.30  	X1 = X15).
% 0.09/0.30  cnf(c39, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a19])], [c37, c38])).
% 0.09/0.30  cnf(c40, plain,
% 0.09/0.30  	~cUnsatisfiable(X15),
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a19])], [c37, c38])).
% 0.09/0.30  
% 0.09/0.30  cnf(c41, plain,
% 0.09/0.30  	cUnsatisfiable(X2)).
% 0.09/0.30  cnf(a20, assumption,
% 0.09/0.30  	X15 = X2).
% 0.09/0.30  cnf(c42, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(predicate_reduction, [assumptions([a20])], [c40, c41])).
% 0.09/0.30  
% 0.09/0.30  cnf(c43, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(constraint_solving, [
% 0.09/0.30  		bind(X0, sK2(X2)),
% 0.09/0.30  		bind(X1, i2003_11_14_17_18_32242),
% 0.09/0.30  		bind(X2, i2003_11_14_17_18_32242),
% 0.09/0.30  		bind(X3, i2003_11_14_17_18_32242),
% 0.09/0.30  		bind(X4, sK2(X2)),
% 0.09/0.30  		bind(X5, sK2(X2)),
% 0.09/0.30  		bind(X6, sK3(X3)),
% 0.09/0.30  		bind(X7, i2003_11_14_17_18_32242),
% 0.09/0.30  		bind(X8, sK2(X2)),
% 0.09/0.30  		bind(X9, i2003_11_14_17_18_32242),
% 0.09/0.30  		bind(X10, sK3(X3)),
% 0.09/0.30  		bind(X11, i2003_11_14_17_18_32242),
% 0.09/0.30  		bind(X12, i2003_11_14_17_18_32242),
% 0.09/0.30  		bind(X13, sK2(X2)),
% 0.09/0.30  		bind(X14, i2003_11_14_17_18_32242),
% 0.09/0.30  		bind(X15, i2003_11_14_17_18_32242)
% 0.09/0.30  	],
% 0.09/0.30  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 0.09/0.30  
% 0.09/0.30  % SZS output end IncompleteProof
%------------------------------------------------------------------------------