↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LDA003-1 : TPTP v8.1.0. Released v1.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 : 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 16:44:42 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LDA003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n024.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 : Mon May 30 04:10:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.39  % SZS status Unsatisfiable
% 0.19/0.39  % SZS output begin IncompleteProof
% 0.19/0.39  cnf(c0, axiom,
% 0.19/0.39  	~left(n3,u)).
% 0.19/0.39  cnf(c1, plain,
% 0.19/0.39  	~left(n3,u),
% 0.19/0.39  	inference(start, [], [c0])).
% 0.19/0.39  
% 0.19/0.39  cnf(c2, axiom,
% 0.19/0.39  	left(X0,f(X0,X1))).
% 0.19/0.39  cnf(a0, assumption,
% 0.19/0.39  	X2 = n3).
% 0.19/0.39  cnf(a1, assumption,
% 0.19/0.39  	X3 = u).
% 0.19/0.39  cnf(c3, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.39  cnf(c4, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.39  cnf(c5, plain,
% 0.19/0.39  	X0 != X2 | f(X0,X1) != X3,
% 0.19/0.39  	inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.39  
% 0.19/0.39  cnf(a2, assumption,
% 0.19/0.39  	X0 = X2).
% 0.19/0.39  cnf(c6, plain,
% 0.19/0.39  	f(X0,X1) != X3,
% 0.19/0.39  	inference(reflexivity, [assumptions([a2])], [c5])).
% 0.19/0.39  
% 0.19/0.39  cnf(c7, axiom,
% 0.19/0.39  	f(X4,f(X5,X6)) = f(f(X4,X5),f(X4,X6))).
% 0.19/0.39  cnf(a3, assumption,
% 0.19/0.39  	f(X7,X8) = f(X0,X1)).
% 0.19/0.39  cnf(c8, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(lazy_function_extension, [assumptions([a3])], [c6, c7])).
% 0.19/0.39  cnf(c9, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(lazy_function_extension, [assumptions([a3])], [c6, c7])).
% 0.19/0.39  cnf(c10, plain,
% 0.19/0.39  	X7 != f(X4,X5) | X8 != f(X4,X6) | X9 != f(X4,f(X5,X6)) | X9 != X3,
% 0.19/0.39  	inference(lazy_function_extension, [assumptions([a3])], [c6, c7])).
% 0.19/0.39  
% 0.19/0.39  cnf(c11, axiom,
% 0.19/0.39  	n3 = f(n2,n1)).
% 0.19/0.39  cnf(a4, assumption,
% 0.19/0.39  	f(X4,X5) = f(n2,n1)).
% 0.19/0.39  cnf(c12, plain,
% 0.19/0.39  	X8 != f(X4,X6) | X9 != f(X4,f(X5,X6)) | X9 != X3,
% 0.19/0.39  	inference(strict_function_extension, [assumptions([a4])], [c10, c11])).
% 0.19/0.39  cnf(c13, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(strict_function_extension, [assumptions([a4])], [c10, c11])).
% 0.19/0.39  cnf(c14, plain,
% 0.19/0.39  	X10 != n3 | X7 != X10,
% 0.19/0.39  	inference(strict_function_extension, [assumptions([a4])], [c10, c11])).
% 0.19/0.39  
% 0.19/0.39  cnf(a5, assumption,
% 0.19/0.39  	X10 = n3).
% 0.19/0.39  cnf(c15, plain,
% 0.19/0.39  	X7 != X10,
% 0.19/0.39  	inference(reflexivity, [assumptions([a5])], [c14])).
% 0.19/0.39  
% 0.19/0.39  cnf(a6, assumption,
% 0.19/0.39  	X7 = X10).
% 0.19/0.39  cnf(c16, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(reflexivity, [assumptions([a6])], [c15])).
% 0.19/0.39  
% 0.19/0.39  cnf(a7, assumption,
% 0.19/0.39  	X8 = f(X4,X6)).
% 0.19/0.39  cnf(c17, plain,
% 0.19/0.39  	X9 != f(X4,f(X5,X6)) | X9 != X3,
% 0.19/0.39  	inference(reflexivity, [assumptions([a7])], [c12])).
% 0.19/0.39  
% 0.19/0.39  cnf(c18, axiom,
% 0.19/0.39  	n2 = f(n1,n1)).
% 0.19/0.39  cnf(a8, assumption,
% 0.19/0.39  	f(X5,X6) = f(n1,n1)).
% 0.19/0.39  cnf(c19, plain,
% 0.19/0.39  	X9 != X3,
% 0.19/0.39  	inference(strict_function_extension, [assumptions([a8])], [c17, c18])).
% 0.19/0.39  cnf(c20, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(strict_function_extension, [assumptions([a8])], [c17, c18])).
% 0.19/0.39  cnf(c21, plain,
% 0.19/0.39  	X11 != n2 | X9 != f(X4,X11),
% 0.19/0.39  	inference(strict_function_extension, [assumptions([a8])], [c17, c18])).
% 0.19/0.39  
% 0.19/0.39  cnf(a9, assumption,
% 0.19/0.39  	X11 = n2).
% 0.19/0.39  cnf(c22, plain,
% 0.19/0.39  	X9 != f(X4,X11),
% 0.19/0.39  	inference(reflexivity, [assumptions([a9])], [c21])).
% 0.19/0.39  
% 0.19/0.39  cnf(c23, axiom,
% 0.19/0.39  	u = f(n2,n2)).
% 0.19/0.39  cnf(a10, assumption,
% 0.19/0.39  	f(X4,X11) = f(n2,n2)).
% 0.19/0.39  cnf(c24, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(strict_function_extension, [assumptions([a10])], [c22, c23])).
% 0.19/0.39  cnf(c25, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(strict_function_extension, [assumptions([a10])], [c22, c23])).
% 0.19/0.39  cnf(c26, plain,
% 0.19/0.39  	X12 != u | X9 != X12,
% 0.19/0.39  	inference(strict_function_extension, [assumptions([a10])], [c22, c23])).
% 0.19/0.39  
% 0.19/0.39  cnf(a11, assumption,
% 0.19/0.39  	X12 = u).
% 0.19/0.39  cnf(c27, plain,
% 0.19/0.39  	X9 != X12,
% 0.19/0.39  	inference(reflexivity, [assumptions([a11])], [c26])).
% 0.19/0.39  
% 0.19/0.39  cnf(a12, assumption,
% 0.19/0.39  	X9 = X12).
% 0.19/0.39  cnf(c28, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(reflexivity, [assumptions([a12])], [c27])).
% 0.19/0.39  
% 0.19/0.39  cnf(a13, assumption,
% 0.19/0.39  	X9 = X3).
% 0.19/0.39  cnf(c29, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(reflexivity, [assumptions([a13])], [c19])).
% 0.19/0.39  
% 0.19/0.39  cnf(c30, plain,
% 0.19/0.39  	$false,
% 0.19/0.39  	inference(constraint_solving, [
% 0.19/0.39  		bind(X0, n3),
% 0.19/0.39  		bind(X1, f(X4,X6)),
% 0.19/0.39  		bind(X2, n3),
% 0.19/0.39  		bind(X3, u),
% 0.19/0.39  		bind(X4, n2),
% 0.19/0.39  		bind(X5, n1),
% 0.19/0.39  		bind(X6, n1),
% 0.19/0.39  		bind(X9, u),
% 0.19/0.39  		bind(X7, n3),
% 0.19/0.39  		bind(X8, f(X4,X6)),
% 0.19/0.39  		bind(X10, n3),
% 0.19/0.39  		bind(X11, n2),
% 0.19/0.39  		bind(X12, u)
% 0.19/0.39  	],
% 0.19/0.39  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 0.19/0.39  
% 0.19/0.39  % SZS output end IncompleteProof
%------------------------------------------------------------------------------