↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : KRS069+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 : n024.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.13s 0.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS069+1 : TPTP v8.1.0. Released v3.1.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.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jun  7 15:05:20 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.39  % SZS status Theorem
% 0.13/0.39  % SZS output begin IncompleteProof
% 0.13/0.39  cnf(c0, axiom,
% 0.13/0.39  	~cp1(sK1(X0)) | ~cUnsatisfiable(X0)).
% 0.13/0.39  cnf(c1, plain,
% 0.13/0.39  	~cp1(sK1(X0)) | ~cUnsatisfiable(X0),
% 0.13/0.39  	inference(start, [], [c0])).
% 0.13/0.39  
% 0.13/0.39  cnf(c2, axiom,
% 0.13/0.39  	X1 = X2 | ~rf2(X3,X2) | ~rf2(X3,X1)).
% 0.13/0.39  cnf(a0, assumption,
% 0.13/0.39  	sK1(X0) = X1).
% 0.13/0.39  cnf(c3, plain,
% 0.13/0.39  	~cUnsatisfiable(X0),
% 0.13/0.39  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.39  cnf(c4, plain,
% 0.13/0.39  	~rf2(X3,X2) | ~rf2(X3,X1),
% 0.13/0.39  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.39  cnf(c5, plain,
% 0.13/0.39  	X2 != X4 | ~cp1(X4),
% 0.13/0.39  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.39  
% 0.13/0.39  cnf(a1, assumption,
% 0.13/0.39  	X2 = X4).
% 0.13/0.39  cnf(c6, plain,
% 0.13/0.39  	~cp1(X4),
% 0.13/0.39  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.13/0.39  
% 0.13/0.39  cnf(c7, axiom,
% 0.13/0.39  	cp1(sK2(X5)) | ~cUnsatisfiable(X5)).
% 0.13/0.39  cnf(a2, assumption,
% 0.13/0.39  	X6 = X4).
% 0.13/0.39  cnf(c8, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(lazy_predicate_extension, [assumptions([a2])], [c6, c7])).
% 0.13/0.39  cnf(c9, plain,
% 0.13/0.39  	~cUnsatisfiable(X5),
% 0.13/0.39  	inference(lazy_predicate_extension, [assumptions([a2])], [c6, c7])).
% 0.13/0.39  cnf(c10, plain,
% 0.13/0.39  	sK2(X5) != X6,
% 0.13/0.39  	inference(lazy_predicate_extension, [assumptions([a2])], [c6, c7])).
% 0.13/0.39  
% 0.13/0.39  cnf(c11, axiom,
% 0.13/0.39  	X7 = X8 | ~rf1(X9,X8) | ~rf1(X9,X7)).
% 0.13/0.39  cnf(a3, assumption,
% 0.13/0.39  	sK2(X5) = X7).
% 0.13/0.39  cnf(c12, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(variable_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.39  cnf(c13, plain,
% 0.13/0.39  	~rf1(X9,X8) | ~rf1(X9,X7),
% 0.13/0.39  	inference(variable_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.39  cnf(c14, plain,
% 0.13/0.39  	X8 != X10 | X10 != X6,
% 0.13/0.39  	inference(variable_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.39  
% 0.13/0.39  cnf(a4, assumption,
% 0.13/0.39  	X8 = X10).
% 0.13/0.39  cnf(c15, plain,
% 0.13/0.39  	X10 != X6,
% 0.13/0.39  	inference(reflexivity, [assumptions([a4])], [c14])).
% 0.13/0.39  
% 0.13/0.39  cnf(a5, assumption,
% 0.13/0.39  	X10 = X6).
% 0.13/0.39  cnf(c16, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(reflexivity, [assumptions([a5])], [c15])).
% 0.13/0.39  
% 0.13/0.39  cnf(c17, axiom,
% 0.13/0.39  	rf1(X11,X12) | ~rf3(X11,X12)).
% 0.13/0.39  cnf(a6, assumption,
% 0.13/0.39  	X9 = X11).
% 0.13/0.39  cnf(a7, assumption,
% 0.13/0.39  	X8 = X12).
% 0.13/0.39  cnf(c18, plain,
% 0.13/0.39  	~rf1(X9,X7),
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c17])).
% 0.13/0.39  cnf(c19, plain,
% 0.13/0.39  	~rf3(X11,X12),
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c17])).
% 0.13/0.39  
% 0.13/0.39  cnf(c20, axiom,
% 0.13/0.39  	rf3(X13,sK0(X13)) | ~cUnsatisfiable(X13)).
% 0.13/0.39  cnf(a8, assumption,
% 0.13/0.39  	X11 = X13).
% 0.13/0.39  cnf(a9, assumption,
% 0.13/0.39  	X12 = sK0(X13)).
% 0.13/0.39  cnf(c21, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c19, c20])).
% 0.13/0.39  cnf(c22, plain,
% 0.13/0.39  	~cUnsatisfiable(X13),
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c19, c20])).
% 0.13/0.39  
% 0.13/0.39  cnf(c23, axiom,
% 0.13/0.39  	cUnsatisfiable(i2003_11_14_17_18_2750)).
% 0.13/0.39  cnf(a10, assumption,
% 0.13/0.39  	X13 = i2003_11_14_17_18_2750).
% 0.13/0.39  cnf(c24, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a10])], [c22, c23])).
% 0.13/0.39  cnf(c25, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a10])], [c22, c23])).
% 0.13/0.39  
% 0.13/0.39  cnf(c26, axiom,
% 0.13/0.39  	rf1(X14,sK2(X14)) | ~cUnsatisfiable(X14)).
% 0.13/0.39  cnf(a11, assumption,
% 0.13/0.39  	X9 = X14).
% 0.13/0.39  cnf(a12, assumption,
% 0.13/0.39  	X7 = sK2(X14)).
% 0.13/0.39  cnf(c27, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c26])).
% 0.13/0.39  cnf(c28, plain,
% 0.13/0.39  	~cUnsatisfiable(X14),
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c26])).
% 0.13/0.39  
% 0.13/0.39  cnf(c29, plain,
% 0.13/0.39  	cUnsatisfiable(X13)).
% 0.13/0.39  cnf(a13, assumption,
% 0.13/0.39  	X14 = X13).
% 0.13/0.39  cnf(c30, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(predicate_reduction, [assumptions([a13])], [c28, c29])).
% 0.13/0.39  
% 0.13/0.39  cnf(c31, plain,
% 0.13/0.39  	cUnsatisfiable(X13)).
% 0.13/0.39  cnf(a14, assumption,
% 0.13/0.39  	X5 = X13).
% 0.13/0.39  cnf(c32, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(predicate_reduction, [assumptions([a14])], [c9, c31])).
% 0.13/0.39  
% 0.13/0.39  cnf(c33, axiom,
% 0.13/0.39  	rf2(X15,X16) | ~rf3(X15,X16)).
% 0.13/0.39  cnf(a15, assumption,
% 0.13/0.39  	X3 = X15).
% 0.13/0.39  cnf(a16, assumption,
% 0.13/0.39  	X2 = X16).
% 0.13/0.39  cnf(c34, plain,
% 0.13/0.39  	~rf2(X3,X1),
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a15, a16])], [c4, c33])).
% 0.13/0.39  cnf(c35, plain,
% 0.13/0.39  	~rf3(X15,X16),
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a15, a16])], [c4, c33])).
% 0.13/0.39  
% 0.13/0.39  cnf(c36, plain,
% 0.13/0.39  	rf3(X11,X12)).
% 0.13/0.39  cnf(a17, assumption,
% 0.13/0.39  	X15 = X11).
% 0.13/0.39  cnf(a18, assumption,
% 0.13/0.39  	X16 = X12).
% 0.13/0.39  cnf(c37, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(predicate_reduction, [assumptions([a17, a18])], [c35, c36])).
% 0.13/0.39  
% 0.13/0.39  cnf(c38, axiom,
% 0.13/0.39  	rf2(X17,sK1(X17)) | ~cUnsatisfiable(X17)).
% 0.13/0.39  cnf(a19, assumption,
% 0.13/0.39  	X3 = X17).
% 0.13/0.39  cnf(a20, assumption,
% 0.13/0.39  	X1 = sK1(X17)).
% 0.13/0.39  cnf(c39, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c34, c38])).
% 0.13/0.39  cnf(c40, plain,
% 0.13/0.39  	~cUnsatisfiable(X17),
% 0.13/0.39  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c34, c38])).
% 0.13/0.39  
% 0.13/0.39  cnf(c41, plain,
% 0.13/0.39  	cUnsatisfiable(X13)).
% 0.13/0.39  cnf(a21, assumption,
% 0.13/0.39  	X17 = X13).
% 0.13/0.39  cnf(c42, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(predicate_reduction, [assumptions([a21])], [c40, c41])).
% 0.13/0.39  
% 0.13/0.39  cnf(c43, plain,
% 0.13/0.39  	cUnsatisfiable(X13)).
% 0.13/0.39  cnf(a22, assumption,
% 0.13/0.39  	X0 = X13).
% 0.13/0.39  cnf(c44, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(predicate_reduction, [assumptions([a22])], [c3, c43])).
% 0.13/0.39  
% 0.13/0.39  cnf(c45, plain,
% 0.13/0.39  	$false,
% 0.13/0.39  	inference(constraint_solving, [
% 0.13/0.39  		bind(X0, i2003_11_14_17_18_2750),
% 0.13/0.39  		bind(X1, sK1(X0)),
% 0.13/0.39  		bind(X2, sK0(X13)),
% 0.13/0.39  		bind(X3, i2003_11_14_17_18_2750),
% 0.13/0.39  		bind(X4, sK0(X13)),
% 0.13/0.39  		bind(X5, i2003_11_14_17_18_2750),
% 0.13/0.39  		bind(X6, sK0(X13)),
% 0.13/0.39  		bind(X7, sK2(X5)),
% 0.13/0.39  		bind(X8, sK0(X13)),
% 0.13/0.39  		bind(X9, i2003_11_14_17_18_2750),
% 0.13/0.39  		bind(X10, sK0(X13)),
% 0.13/0.39  		bind(X11, i2003_11_14_17_18_2750),
% 0.13/0.39  		bind(X12, sK0(X13)),
% 0.13/0.39  		bind(X13, i2003_11_14_17_18_2750),
% 0.13/0.39  		bind(X14, i2003_11_14_17_18_2750),
% 0.13/0.39  		bind(X15, i2003_11_14_17_18_2750),
% 0.13/0.39  		bind(X16, sK0(X13)),
% 0.13/0.39  		bind(X17, i2003_11_14_17_18_2750)
% 0.13/0.39  	],
% 0.13/0.39  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22])).
% 0.13/0.39  
% 0.13/0.39  % SZS output end IncompleteProof
%------------------------------------------------------------------------------