↑ Up

lazyCoP---0.1.UNS-Ass.s

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

% Result   : Unsatisfiable 0.12s 0.35s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

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