↑ Up

lazyCoP---0.1.UNS-Ass.s

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

% Computer : n029.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:48 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.12  % Problem  : KRS015-1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n029.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jun  7 05:56:50 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.37  % SZS status Unsatisfiable
% 0.19/0.37  % SZS output begin IncompleteProof
% 0.19/0.37  cnf(c0, axiom,
% 0.19/0.37  	e(exist)).
% 0.19/0.37  cnf(c1, plain,
% 0.19/0.37  	e(exist),
% 0.19/0.37  	inference(start, [], [c0])).
% 0.19/0.37  
% 0.19/0.37  cnf(c2, axiom,
% 0.19/0.37  	~e(X0) | r(X0,u4r4(X0))).
% 0.19/0.37  cnf(a0, assumption,
% 0.19/0.37  	exist = X0).
% 0.19/0.37  cnf(c3, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.37  cnf(c4, plain,
% 0.19/0.37  	r(X0,u4r4(X0)),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.37  
% 0.19/0.37  cnf(c5, axiom,
% 0.19/0.37  	~r(X1,X2) | ~e(X1) | c(X2)).
% 0.19/0.37  cnf(a1, assumption,
% 0.19/0.37  	X0 = X1).
% 0.19/0.37  cnf(a2, assumption,
% 0.19/0.37  	u4r4(X0) = X2).
% 0.19/0.37  cnf(c6, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.19/0.37  cnf(c7, plain,
% 0.19/0.37  	~e(X1) | c(X2),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.19/0.37  
% 0.19/0.37  cnf(c8, plain,
% 0.19/0.37  	e(exist)).
% 0.19/0.37  cnf(a3, assumption,
% 0.19/0.37  	X1 = exist).
% 0.19/0.37  cnf(c9, plain,
% 0.19/0.37  	c(X2),
% 0.19/0.37  	inference(predicate_reduction, [assumptions([a3])], [c7, c8])).
% 0.19/0.37  
% 0.19/0.37  cnf(c10, axiom,
% 0.19/0.37  	~c(X3) | t2least(X3)).
% 0.19/0.37  cnf(a4, assumption,
% 0.19/0.37  	X2 = X3).
% 0.19/0.37  cnf(c11, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a4])], [c9, c10])).
% 0.19/0.37  cnf(c12, plain,
% 0.19/0.37  	t2least(X3),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a4])], [c9, c10])).
% 0.19/0.37  
% 0.19/0.37  cnf(c13, axiom,
% 0.19/0.37  	~t2least(X4) | t(X4,u1r1(X4))).
% 0.19/0.37  cnf(a5, assumption,
% 0.19/0.37  	X3 = X4).
% 0.19/0.37  cnf(c14, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])).
% 0.19/0.37  cnf(c15, plain,
% 0.19/0.37  	t(X4,u1r1(X4)),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])).
% 0.19/0.37  
% 0.19/0.37  cnf(c16, axiom,
% 0.19/0.37  	~t(X5,X6) | ~t(X5,X7) | ~t1most(X5) | equalish(X7,X6)).
% 0.19/0.37  cnf(a6, assumption,
% 0.19/0.37  	X4 = X5).
% 0.19/0.37  cnf(a7, assumption,
% 0.19/0.37  	u1r1(X4) = X6).
% 0.19/0.37  cnf(c17, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c15, c16])).
% 0.19/0.37  cnf(c18, plain,
% 0.19/0.37  	~t(X5,X7) | ~t1most(X5) | equalish(X7,X6),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c15, c16])).
% 0.19/0.37  
% 0.19/0.37  cnf(c19, axiom,
% 0.19/0.37  	~t2least(X8) | t(X8,u1r2(X8))).
% 0.19/0.37  cnf(a8, assumption,
% 0.19/0.37  	X5 = X8).
% 0.19/0.37  cnf(a9, assumption,
% 0.19/0.37  	X7 = u1r2(X8)).
% 0.19/0.37  cnf(c20, plain,
% 0.19/0.37  	~t1most(X5) | equalish(X7,X6),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c18, c19])).
% 0.19/0.37  cnf(c21, plain,
% 0.19/0.37  	~t2least(X8),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c18, c19])).
% 0.19/0.37  
% 0.19/0.37  cnf(c22, plain,
% 0.19/0.37  	t2least(X3)).
% 0.19/0.37  cnf(a10, assumption,
% 0.19/0.37  	X8 = X3).
% 0.19/0.37  cnf(c23, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(predicate_reduction, [assumptions([a10])], [c21, c22])).
% 0.19/0.37  
% 0.19/0.37  cnf(c24, axiom,
% 0.19/0.37  	~d(X9) | t1most(X9)).
% 0.19/0.37  cnf(a11, assumption,
% 0.19/0.37  	X5 = X9).
% 0.19/0.37  cnf(c25, plain,
% 0.19/0.37  	equalish(X7,X6),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a11])], [c20, c24])).
% 0.19/0.37  cnf(c26, plain,
% 0.19/0.37  	~d(X9),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a11])], [c20, c24])).
% 0.19/0.37  
% 0.19/0.37  cnf(c27, axiom,
% 0.19/0.37  	~s(X10,X11) | ~e(X10) | d(X11)).
% 0.19/0.37  cnf(a12, assumption,
% 0.19/0.37  	X9 = X11).
% 0.19/0.37  cnf(c28, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a12])], [c26, c27])).
% 0.19/0.37  cnf(c29, plain,
% 0.19/0.37  	~s(X10,X11) | ~e(X10),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a12])], [c26, c27])).
% 0.19/0.37  
% 0.19/0.37  cnf(c30, axiom,
% 0.19/0.37  	~r(X12,X13) | ~e(X12) | s(X12,X13)).
% 0.19/0.37  cnf(a13, assumption,
% 0.19/0.37  	X10 = X12).
% 0.19/0.37  cnf(a14, assumption,
% 0.19/0.37  	X11 = X13).
% 0.19/0.37  cnf(c31, plain,
% 0.19/0.37  	~e(X10),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c29, c30])).
% 0.19/0.37  cnf(c32, plain,
% 0.19/0.37  	~r(X12,X13) | ~e(X12),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c29, c30])).
% 0.19/0.37  
% 0.19/0.37  cnf(c33, plain,
% 0.19/0.37  	r(X0,u4r4(X0))).
% 0.19/0.37  cnf(a15, assumption,
% 0.19/0.37  	X12 = X0).
% 0.19/0.37  cnf(a16, assumption,
% 0.19/0.37  	X13 = u4r4(X0)).
% 0.19/0.37  cnf(c34, plain,
% 0.19/0.37  	~e(X12),
% 0.19/0.37  	inference(predicate_reduction, [assumptions([a15, a16])], [c32, c33])).
% 0.19/0.37  
% 0.19/0.37  cnf(c35, plain,
% 0.19/0.37  	e(exist)).
% 0.19/0.37  cnf(a17, assumption,
% 0.19/0.37  	X12 = exist).
% 0.19/0.37  cnf(c36, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(predicate_reduction, [assumptions([a17])], [c34, c35])).
% 0.19/0.37  
% 0.19/0.37  cnf(c37, plain,
% 0.19/0.37  	e(exist)).
% 0.19/0.37  cnf(a18, assumption,
% 0.19/0.37  	X10 = exist).
% 0.19/0.37  cnf(c38, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(predicate_reduction, [assumptions([a18])], [c31, c37])).
% 0.19/0.37  
% 0.19/0.37  cnf(c39, axiom,
% 0.19/0.37  	~equalish(u1r2(X14),u1r1(X14)) | ~t2least(X14)).
% 0.19/0.37  cnf(a19, assumption,
% 0.19/0.37  	X7 = u1r2(X14)).
% 0.19/0.37  cnf(a20, assumption,
% 0.19/0.37  	X6 = u1r1(X14)).
% 0.19/0.37  cnf(c40, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c25, c39])).
% 0.19/0.37  cnf(c41, plain,
% 0.19/0.37  	~t2least(X14),
% 0.19/0.37  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c25, c39])).
% 0.19/0.37  
% 0.19/0.37  cnf(c42, plain,
% 0.19/0.37  	t2least(X3)).
% 0.19/0.37  cnf(a21, assumption,
% 0.19/0.37  	X14 = X3).
% 0.19/0.37  cnf(c43, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(predicate_reduction, [assumptions([a21])], [c41, c42])).
% 0.19/0.37  
% 0.19/0.37  cnf(c44, plain,
% 0.19/0.37  	$false,
% 0.19/0.37  	inference(constraint_solving, [
% 0.19/0.37  		bind(X0, exist),
% 0.19/0.37  		bind(X1, exist),
% 0.19/0.37  		bind(X2, u4r4(X0)),
% 0.19/0.37  		bind(X3, u4r4(X0)),
% 0.19/0.37  		bind(X4, u4r4(X0)),
% 0.19/0.37  		bind(X5, u4r4(X0)),
% 0.19/0.37  		bind(X6, u1r1(X4)),
% 0.19/0.37  		bind(X7, u1r2(X8)),
% 0.19/0.37  		bind(X8, u4r4(X0)),
% 0.19/0.37  		bind(X9, u4r4(X0)),
% 0.19/0.37  		bind(X10, exist),
% 0.19/0.37  		bind(X11, u4r4(X0)),
% 0.19/0.37  		bind(X12, exist),
% 0.19/0.37  		bind(X13, u4r4(X0)),
% 0.19/0.37  		bind(X14, u4r4(X0))
% 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])).
% 0.19/0.37  
% 0.19/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------