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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUM605+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 : 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:25 EDT 2022

% Result   : Theorem 4.99s 1.01s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : NUM605+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33  % Computer : n021.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 Jul  5 02:32:17 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 4.99/1.01  % SZS status Theorem
% 4.99/1.01  % SZS output begin IncompleteProof
% 4.99/1.01  cnf(c0, axiom,
% 4.99/1.01  	slcrc0 = xQ).
% 4.99/1.01  cnf(c1, plain,
% 4.99/1.01  	slcrc0 = xQ,
% 4.99/1.01  	inference(start, [], [c0])).
% 4.99/1.01  
% 4.99/1.01  cnf(c2, axiom,
% 4.99/1.01  	xK = sbrdtbr0(xQ)).
% 4.99/1.01  cnf(a0, assumption,
% 4.99/1.01  	xQ = xQ).
% 4.99/1.01  cnf(a1, assumption,
% 4.99/1.01  	slcrc0 = X0).
% 4.99/1.01  cnf(c3, plain,
% 4.99/1.01  	$false,
% 4.99/1.01  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 4.99/1.01  cnf(c4, plain,
% 4.99/1.01  	$false,
% 4.99/1.01  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 4.99/1.01  cnf(c5, plain,
% 4.99/1.01  	xK = sbrdtbr0(X0),
% 4.99/1.01  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 4.99/1.01  
% 4.99/1.01  cnf(c6, axiom,
% 4.99/1.01  	sz00 = sbrdtbr0(slcrc0) | ~aSet0(slcrc0)).
% 4.99/1.01  cnf(a2, assumption,
% 4.99/1.01  	sbrdtbr0(slcrc0) = sbrdtbr0(X0)).
% 4.99/1.01  cnf(a3, assumption,
% 4.99/1.01  	xK = X1).
% 4.99/1.01  cnf(c7, plain,
% 4.99/1.01  	$false,
% 4.99/1.01  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 4.99/1.01  cnf(c8, plain,
% 4.99/1.01  	~aSet0(slcrc0),
% 4.99/1.01  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 4.99/1.01  cnf(c9, plain,
% 4.99/1.01  	sz00 = X1,
% 4.99/1.01  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 4.99/1.01  
% 4.99/1.01  cnf(c10, axiom,
% 4.99/1.01  	sz00 != xK).
% 4.99/1.01  cnf(a4, assumption,
% 4.99/1.01  	xK = X1).
% 4.99/1.01  cnf(a5, assumption,
% 4.99/1.01  	sz00 = X2).
% 4.99/1.01  cnf(c11, plain,
% 4.99/1.01  	$false,
% 4.99/1.01  	inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])).
% 4.99/1.01  cnf(c12, plain,
% 4.99/1.01  	$false,
% 4.99/1.01  	inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])).
% 4.99/1.01  cnf(c13, plain,
% 4.99/1.01  	sz00 != X2,
% 4.99/1.01  	inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])).
% 4.99/1.01  
% 4.99/1.01  cnf(a6, assumption,
% 4.99/1.01  	sz00 = X2).
% 4.99/1.01  cnf(c14, plain,
% 4.99/1.01  	$false,
% 4.99/1.01  	inference(reflexivity, [assumptions([a6])], [c13])).
% 4.99/1.01  
% 4.99/1.01  cnf(c15, axiom,
% 4.99/1.01  	aSet0(slcrc0)).
% 4.99/1.01  cnf(a7, assumption,
% 4.99/1.01  	slcrc0 = slcrc0).
% 4.99/1.01  cnf(c16, plain,
% 4.99/1.01  	$false,
% 4.99/1.01  	inference(strict_predicate_extension, [assumptions([a7])], [c8, c15])).
% 4.99/1.01  cnf(c17, plain,
% 4.99/1.01  	$false,
% 4.99/1.01  	inference(strict_predicate_extension, [assumptions([a7])], [c8, c15])).
% 4.99/1.01  
% 4.99/1.01  cnf(c18, plain,
% 4.99/1.01  	$false,
% 4.99/1.01  	inference(constraint_solving, [
% 4.99/1.01  		bind(X0, slcrc0),
% 4.99/1.01  		bind(X1, xK),
% 4.99/1.01  		bind(X2, sz00)
% 4.99/1.01  	],
% 4.99/1.01  	[a0, a1, a2, a3, a4, a5, a6, a7])).
% 4.99/1.01  
% 4.99/1.01  % SZS output end IncompleteProof
%------------------------------------------------------------------------------