TSTP Solution File: RNG123+4 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : RNG123+4 : 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 : n025.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 20:33:35 EDT 2022

% Result   : Theorem 0.20s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : RNG123+4 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon May 30 11:34:57 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.40  % SZS status Theorem
% 0.20/0.40  % SZS output begin IncompleteProof
% 0.20/0.40  cnf(c0, axiom,
% 0.20/0.40  	~aElementOf0(xr,xI)).
% 0.20/0.40  cnf(c1, plain,
% 0.20/0.40  	~aElementOf0(xr,xI),
% 0.20/0.40  	inference(start, [], [c0])).
% 0.20/0.40  
% 0.20/0.40  cnf(c2, axiom,
% 0.20/0.40  	aElementOf0(sdtpldt0(X0,X1),xI) | ~aElementOf0(X1,xI) | ~aElementOf0(X0,xI)).
% 0.20/0.40  cnf(a0, assumption,
% 0.20/0.40  	X2 = xr).
% 0.20/0.40  cnf(a1, assumption,
% 0.20/0.40  	X3 = xI).
% 0.20/0.40  cnf(c3, plain,
% 0.20/0.40  	$false,
% 0.20/0.40  	inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.40  cnf(c4, plain,
% 0.20/0.40  	~aElementOf0(X1,xI) | ~aElementOf0(X0,xI),
% 0.20/0.40  	inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.40  cnf(c5, plain,
% 0.20/0.40  	sdtpldt0(X0,X1) != X2 | xI != X3,
% 0.20/0.40  	inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.40  
% 0.20/0.40  cnf(c6, axiom,
% 0.20/0.40  	xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)).
% 0.20/0.40  cnf(a2, assumption,
% 0.20/0.40  	sdtpldt0(X0,X1) = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)).
% 0.20/0.40  cnf(c7, plain,
% 0.20/0.40  	xI != X3,
% 0.20/0.40  	inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 0.20/0.40  cnf(c8, plain,
% 0.20/0.40  	$false,
% 0.20/0.40  	inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 0.20/0.40  cnf(c9, plain,
% 0.20/0.40  	X4 != xr | X4 != X2,
% 0.20/0.40  	inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 0.20/0.40  
% 0.20/0.40  cnf(a3, assumption,
% 0.20/0.40  	X4 = xr).
% 0.20/0.40  cnf(c10, plain,
% 0.20/0.40  	X4 != X2,
% 0.20/0.40  	inference(reflexivity, [assumptions([a3])], [c9])).
% 0.20/0.40  
% 0.20/0.40  cnf(a4, assumption,
% 0.20/0.40  	X4 = X2).
% 0.20/0.40  cnf(c11, plain,
% 0.20/0.40  	$false,
% 0.20/0.40  	inference(reflexivity, [assumptions([a4])], [c10])).
% 0.20/0.40  
% 0.20/0.40  cnf(a5, assumption,
% 0.20/0.40  	xI = X3).
% 0.20/0.40  cnf(c12, plain,
% 0.20/0.40  	$false,
% 0.20/0.40  	inference(reflexivity, [assumptions([a5])], [c7])).
% 0.20/0.40  
% 0.20/0.40  cnf(c13, axiom,
% 0.20/0.40  	aElementOf0(xb,xI)).
% 0.20/0.40  cnf(a6, assumption,
% 0.20/0.40  	X1 = xb).
% 0.20/0.40  cnf(a7, assumption,
% 0.20/0.40  	xI = xI).
% 0.20/0.40  cnf(c14, plain,
% 0.20/0.40  	~aElementOf0(X0,xI),
% 0.20/0.40  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c4, c13])).
% 0.20/0.40  cnf(c15, plain,
% 0.20/0.40  	$false,
% 0.20/0.40  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c4, c13])).
% 0.20/0.40  
% 0.20/0.40  cnf(c16, axiom,
% 0.20/0.40  	aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)).
% 0.20/0.40  cnf(a8, assumption,
% 0.20/0.40  	X0 = smndt0(sdtasdt0(xq,xu))).
% 0.20/0.40  cnf(a9, assumption,
% 0.20/0.40  	xI = xI).
% 0.20/0.40  cnf(c17, plain,
% 0.20/0.40  	$false,
% 0.20/0.40  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c14, c16])).
% 0.20/0.40  cnf(c18, plain,
% 0.20/0.40  	$false,
% 0.20/0.40  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c14, c16])).
% 0.20/0.40  
% 0.20/0.40  cnf(c19, plain,
% 0.20/0.40  	$false,
% 0.20/0.40  	inference(constraint_solving, [
% 0.20/0.40  		bind(X0, smndt0(sdtasdt0(xq,xu))),
% 0.20/0.40  		bind(X1, xb),
% 0.20/0.40  		bind(X2, xr),
% 0.20/0.40  		bind(X3, xI),
% 0.20/0.40  		bind(X4, xr)
% 0.20/0.40  	],
% 0.20/0.40  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 0.20/0.40  
% 0.20/0.40  % SZS output end IncompleteProof
%------------------------------------------------------------------------------