TSTP Solution File: NUM622+3 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUM622+3 : TPTP v8.1.0. Released v4.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 : Mon Jul 18 11:34:35 EDT 2022

% Result   : Theorem 158.99s 21.02s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : NUM622+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.11  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.10/0.31  % Computer : n029.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.31  % CPULimit : 300
% 0.15/0.31  % WCLimit  : 600
% 0.15/0.31  % DateTime : Tue Jul  5 23:50:12 EDT 2022
% 0.15/0.31  % CPUTime  : 
% 158.99/21.02  % SZS status Theorem
% 158.99/21.02  % SZS output begin IncompleteProof
% 158.99/21.02  cnf(c0, axiom,
% 158.99/21.02  	~aElementOf0(xp,sdtlpdtrp0(xN,xm))).
% 158.99/21.02  cnf(c1, plain,
% 158.99/21.02  	~aElementOf0(xp,sdtlpdtrp0(xN,xm)),
% 158.99/21.02  	inference(start, [], [c0])).
% 158.99/21.02  
% 158.99/21.02  cnf(c2, axiom,
% 158.99/21.02  	aElementOf0(X0,sdtlpdtrp0(xN,xm)) | ~aElementOf0(X0,sdtlpdtrp0(xN,xn))).
% 158.99/21.02  cnf(a0, assumption,
% 158.99/21.02  	xp = X0).
% 158.99/21.02  cnf(a1, assumption,
% 158.99/21.02  	sdtlpdtrp0(xN,xm) = sdtlpdtrp0(xN,xm)).
% 158.99/21.02  cnf(c3, plain,
% 158.99/21.02  	$false,
% 158.99/21.02  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 158.99/21.02  cnf(c4, plain,
% 158.99/21.02  	~aElementOf0(X0,sdtlpdtrp0(xN,xn)),
% 158.99/21.02  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 158.99/21.02  
% 158.99/21.02  cnf(c5, axiom,
% 158.99/21.02  	aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1)) | ~sP104(X1)).
% 158.99/21.02  cnf(a2, assumption,
% 158.99/21.02  	X2 = X0).
% 158.99/21.02  cnf(a3, assumption,
% 158.99/21.02  	X3 = sdtlpdtrp0(xN,xn)).
% 158.99/21.02  cnf(c6, plain,
% 158.99/21.02  	$false,
% 158.99/21.02  	inference(lazy_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 158.99/21.02  cnf(c7, plain,
% 158.99/21.02  	~sP104(X1),
% 158.99/21.02  	inference(lazy_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 158.99/21.02  cnf(c8, plain,
% 158.99/21.02  	sdtlpdtrp0(xe,X1) != X2 | sdtlpdtrp0(xN,X1) != X3,
% 158.99/21.02  	inference(lazy_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 158.99/21.02  
% 158.99/21.02  cnf(c9, axiom,
% 158.99/21.02  	xp = sdtlpdtrp0(xe,xn)).
% 158.99/21.02  cnf(a4, assumption,
% 158.99/21.02  	sdtlpdtrp0(xe,X1) = sdtlpdtrp0(xe,xn)).
% 158.99/21.02  cnf(c10, plain,
% 158.99/21.02  	sdtlpdtrp0(xN,X1) != X3,
% 158.99/21.02  	inference(strict_function_extension, [assumptions([a4])], [c8, c9])).
% 158.99/21.02  cnf(c11, plain,
% 158.99/21.02  	$false,
% 158.99/21.02  	inference(strict_function_extension, [assumptions([a4])], [c8, c9])).
% 158.99/21.02  cnf(c12, plain,
% 158.99/21.02  	X4 != xp | X4 != X2,
% 158.99/21.02  	inference(strict_function_extension, [assumptions([a4])], [c8, c9])).
% 158.99/21.02  
% 158.99/21.02  cnf(a5, assumption,
% 158.99/21.02  	X4 = xp).
% 158.99/21.02  cnf(c13, plain,
% 158.99/21.02  	X4 != X2,
% 158.99/21.02  	inference(reflexivity, [assumptions([a5])], [c12])).
% 158.99/21.02  
% 158.99/21.02  cnf(a6, assumption,
% 158.99/21.02  	X4 = X2).
% 158.99/21.02  cnf(c14, plain,
% 158.99/21.02  	$false,
% 158.99/21.02  	inference(reflexivity, [assumptions([a6])], [c13])).
% 158.99/21.02  
% 158.99/21.02  cnf(a7, assumption,
% 158.99/21.02  	sdtlpdtrp0(xN,X1) = X3).
% 158.99/21.02  cnf(c15, plain,
% 158.99/21.02  	$false,
% 158.99/21.02  	inference(reflexivity, [assumptions([a7])], [c10])).
% 158.99/21.02  
% 158.99/21.02  cnf(c16, axiom,
% 158.99/21.02  	sP104(X5) | ~aElementOf0(X5,szNzAzT0)).
% 158.99/21.02  cnf(a8, assumption,
% 158.99/21.02  	X1 = X5).
% 158.99/21.02  cnf(c17, plain,
% 158.99/21.02  	$false,
% 158.99/21.02  	inference(strict_predicate_extension, [assumptions([a8])], [c7, c16])).
% 158.99/21.02  cnf(c18, plain,
% 158.99/21.02  	~aElementOf0(X5,szNzAzT0),
% 158.99/21.02  	inference(strict_predicate_extension, [assumptions([a8])], [c7, c16])).
% 158.99/21.02  
% 158.99/21.02  cnf(c19, axiom,
% 158.99/21.02  	aElementOf0(xn,szNzAzT0)).
% 158.99/21.02  cnf(a9, assumption,
% 158.99/21.02  	X5 = xn).
% 158.99/21.02  cnf(a10, assumption,
% 158.99/21.02  	szNzAzT0 = szNzAzT0).
% 158.99/21.02  cnf(c20, plain,
% 158.99/21.02  	$false,
% 158.99/21.02  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c18, c19])).
% 158.99/21.02  cnf(c21, plain,
% 158.99/21.02  	$false,
% 158.99/21.02  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c18, c19])).
% 158.99/21.02  
% 158.99/21.02  cnf(c22, plain,
% 158.99/21.02  	$false,
% 158.99/21.02  	inference(constraint_solving, [
% 158.99/21.02  		bind(X0, xp),
% 158.99/21.02  		bind(X1, xn),
% 158.99/21.02  		bind(X2, xp),
% 158.99/21.02  		bind(X3, sdtlpdtrp0(xN,xn)),
% 158.99/21.02  		bind(X4, xp),
% 158.99/21.02  		bind(X5, xn)
% 158.99/21.02  	],
% 158.99/21.02  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 158.99/21.02  
% 158.99/21.02  % SZS output end IncompleteProof
%------------------------------------------------------------------------------