TSTP Solution File: NUM571+1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUM571+1 : 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 : n021.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:07 EDT 2022

% Result   : Theorem 52.84s 7.20s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NUM571+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n021.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 : Wed Jul  6 15:06:48 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 52.84/7.20  % SZS status Theorem
% 52.84/7.20  % SZS output begin IncompleteProof
% 52.84/7.20  cnf(c0, axiom,
% 52.84/7.20  	~isCountable0(sdtlpdtrp0(xN,xi)) | ~aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)).
% 52.84/7.20  cnf(c1, plain,
% 52.84/7.20  	~isCountable0(sdtlpdtrp0(xN,xi)) | ~aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0),
% 52.84/7.20  	inference(start, [], [c0])).
% 52.84/7.20  
% 52.84/7.20  cnf(c2, axiom,
% 52.84/7.20  	isCountable0(sdtlpdtrp0(xN,xi)) | ~sP38).
% 52.84/7.20  cnf(a0, assumption,
% 52.84/7.20  	sdtlpdtrp0(xN,xi) = sdtlpdtrp0(xN,xi)).
% 52.84/7.20  cnf(c3, plain,
% 52.84/7.20  	~aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0),
% 52.84/7.20  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 52.84/7.20  cnf(c4, plain,
% 52.84/7.20  	~sP38,
% 52.84/7.20  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 52.84/7.20  
% 52.84/7.20  cnf(c5, axiom,
% 52.84/7.20  	sP38 | sz00 = xi).
% 52.84/7.20  cnf(c6, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(strict_predicate_extension, [], [c4, c5])).
% 52.84/7.20  cnf(c7, plain,
% 52.84/7.20  	sz00 = xi,
% 52.84/7.20  	inference(strict_predicate_extension, [], [c4, c5])).
% 52.84/7.20  
% 52.84/7.20  cnf(c8, plain,
% 52.84/7.20  	~isCountable0(sdtlpdtrp0(xN,xi))).
% 52.84/7.20  cnf(a1, assumption,
% 52.84/7.20  	xi = xi).
% 52.84/7.20  cnf(a2, assumption,
% 52.84/7.20  	sz00 = X0).
% 52.84/7.20  cnf(c9, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(subterm_reduction, [assumptions([a1, a2])], [c7, c8])).
% 52.84/7.20  cnf(c10, plain,
% 52.84/7.20  	~isCountable0(sdtlpdtrp0(xN,X0)),
% 52.84/7.20  	inference(subterm_reduction, [assumptions([a1, a2])], [c7, c8])).
% 52.84/7.20  
% 52.84/7.20  cnf(c11, axiom,
% 52.84/7.20  	xS = sdtlpdtrp0(xN,sz00)).
% 52.84/7.20  cnf(a3, assumption,
% 52.84/7.20  	sdtlpdtrp0(xN,X0) = sdtlpdtrp0(xN,sz00)).
% 52.84/7.20  cnf(c12, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(strict_function_extension, [assumptions([a3])], [c10, c11])).
% 52.84/7.20  cnf(c13, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(strict_function_extension, [assumptions([a3])], [c10, c11])).
% 52.84/7.20  cnf(c14, plain,
% 52.84/7.20  	X1 != xS | ~isCountable0(X1),
% 52.84/7.20  	inference(strict_function_extension, [assumptions([a3])], [c10, c11])).
% 52.84/7.20  
% 52.84/7.20  cnf(a4, assumption,
% 52.84/7.20  	X1 = xS).
% 52.84/7.20  cnf(c15, plain,
% 52.84/7.20  	~isCountable0(X1),
% 52.84/7.20  	inference(reflexivity, [assumptions([a4])], [c14])).
% 52.84/7.20  
% 52.84/7.20  cnf(c16, axiom,
% 52.84/7.20  	isCountable0(xS)).
% 52.84/7.20  cnf(a5, assumption,
% 52.84/7.20  	X1 = xS).
% 52.84/7.20  cnf(c17, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])).
% 52.84/7.20  cnf(c18, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])).
% 52.84/7.20  
% 52.84/7.20  cnf(c19, axiom,
% 52.84/7.20  	aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) | ~sP38).
% 52.84/7.20  cnf(a6, assumption,
% 52.84/7.20  	sdtlpdtrp0(xN,xi) = sdtlpdtrp0(xN,xi)).
% 52.84/7.20  cnf(a7, assumption,
% 52.84/7.20  	szNzAzT0 = szNzAzT0).
% 52.84/7.20  cnf(c20, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c19])).
% 52.84/7.20  cnf(c21, plain,
% 52.84/7.20  	~sP38,
% 52.84/7.20  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c19])).
% 52.84/7.20  
% 52.84/7.20  cnf(c22, axiom,
% 52.84/7.20  	sP38 | sz00 = xi).
% 52.84/7.20  cnf(c23, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(strict_predicate_extension, [], [c21, c22])).
% 52.84/7.20  cnf(c24, plain,
% 52.84/7.20  	sz00 = xi,
% 52.84/7.20  	inference(strict_predicate_extension, [], [c21, c22])).
% 52.84/7.20  
% 52.84/7.20  cnf(c25, plain,
% 52.84/7.20  	~aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)).
% 52.84/7.20  cnf(a8, assumption,
% 52.84/7.20  	xi = xi).
% 52.84/7.20  cnf(a9, assumption,
% 52.84/7.20  	sz00 = X2).
% 52.84/7.20  cnf(c26, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(subterm_reduction, [assumptions([a8, a9])], [c24, c25])).
% 52.84/7.20  cnf(c27, plain,
% 52.84/7.20  	~aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0),
% 52.84/7.20  	inference(subterm_reduction, [assumptions([a8, a9])], [c24, c25])).
% 52.84/7.20  
% 52.84/7.20  cnf(c28, axiom,
% 52.84/7.20  	xS = sdtlpdtrp0(xN,sz00)).
% 52.84/7.20  cnf(a10, assumption,
% 52.84/7.20  	sdtlpdtrp0(xN,X2) = sdtlpdtrp0(xN,sz00)).
% 52.84/7.20  cnf(c29, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(strict_function_extension, [assumptions([a10])], [c27, c28])).
% 52.84/7.20  cnf(c30, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(strict_function_extension, [assumptions([a10])], [c27, c28])).
% 52.84/7.20  cnf(c31, plain,
% 52.84/7.20  	X3 != xS | ~aSubsetOf0(X3,szNzAzT0),
% 52.84/7.20  	inference(strict_function_extension, [assumptions([a10])], [c27, c28])).
% 52.84/7.20  
% 52.84/7.20  cnf(a11, assumption,
% 52.84/7.20  	X3 = xS).
% 52.84/7.20  cnf(c32, plain,
% 52.84/7.20  	~aSubsetOf0(X3,szNzAzT0),
% 52.84/7.20  	inference(reflexivity, [assumptions([a11])], [c31])).
% 52.84/7.20  
% 52.84/7.20  cnf(c33, axiom,
% 52.84/7.20  	aSubsetOf0(xS,szNzAzT0)).
% 52.84/7.20  cnf(a12, assumption,
% 52.84/7.20  	X3 = xS).
% 52.84/7.20  cnf(a13, assumption,
% 52.84/7.20  	szNzAzT0 = szNzAzT0).
% 52.84/7.20  cnf(c34, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c32, c33])).
% 52.84/7.20  cnf(c35, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c32, c33])).
% 52.84/7.20  
% 52.84/7.20  cnf(c36, plain,
% 52.84/7.20  	$false,
% 52.84/7.20  	inference(constraint_solving, [
% 52.84/7.20  		bind(X0, sz00),
% 52.84/7.20  		bind(X1, xS),
% 52.84/7.20  		bind(X2, sz00),
% 52.84/7.20  		bind(X3, xS)
% 52.84/7.20  	],
% 52.84/7.20  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 52.84/7.20  
% 52.84/7.20  % SZS output end IncompleteProof
%------------------------------------------------------------------------------