↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : KRS113+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 : n022.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:13:02 EDT 2022

% Result   : Unsatisfiable 0.19s 0.37s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

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