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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : KRS193+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n017.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 03:13:13 EDT 2022

% Result   : Theorem 0.19s 0.35s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : KRS193+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.12/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n017.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 : Tue Jun  7 12:38:47 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.35  % SZS status Theorem
% 0.19/0.35  % SZS output begin IncompleteProof
% 0.19/0.35  cnf(c0, axiom,
% 0.19/0.35  	~isa(cax,thm)).
% 0.19/0.35  cnf(c1, plain,
% 0.19/0.35  	~isa(cax,thm),
% 0.19/0.35  	inference(start, [], [c0])).
% 0.19/0.35  
% 0.19/0.35  cnf(c2, axiom,
% 0.19/0.35  	isa(X0,X1) | ~status(sK51(X0,X1),sK52(X0,X1),X1)).
% 0.19/0.35  cnf(a0, assumption,
% 0.19/0.35  	cax = X0).
% 0.19/0.35  cnf(a1, assumption,
% 0.19/0.35  	thm = X1).
% 0.19/0.35  cnf(c3, plain,
% 0.19/0.35  	$false,
% 0.19/0.35  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.35  cnf(c4, plain,
% 0.19/0.35  	~status(sK51(X0,X1),sK52(X0,X1),X1),
% 0.19/0.35  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.35  
% 0.19/0.35  cnf(c5, axiom,
% 0.19/0.35  	status(X2,X3,thm) | model(sK17(X2,X3),X2)).
% 0.19/0.35  cnf(a2, assumption,
% 0.19/0.35  	sK51(X0,X1) = X2).
% 0.19/0.35  cnf(a3, assumption,
% 0.19/0.35  	sK52(X0,X1) = X3).
% 0.19/0.35  cnf(a4, assumption,
% 0.19/0.35  	X1 = thm).
% 0.19/0.35  cnf(c6, plain,
% 0.19/0.35  	$false,
% 0.19/0.35  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 0.19/0.35  cnf(c7, plain,
% 0.19/0.35  	model(sK17(X2,X3),X2),
% 0.19/0.35  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 0.19/0.35  
% 0.19/0.35  cnf(c8, axiom,
% 0.19/0.35  	~model(X4,X5) | ~status(X5,X6,cax)).
% 0.19/0.35  cnf(a5, assumption,
% 0.19/0.35  	sK17(X2,X3) = X4).
% 0.19/0.35  cnf(a6, assumption,
% 0.19/0.35  	X2 = X5).
% 0.19/0.35  cnf(c9, plain,
% 0.19/0.35  	$false,
% 0.19/0.35  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 0.19/0.35  cnf(c10, plain,
% 0.19/0.35  	~status(X5,X6,cax),
% 0.19/0.35  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 0.19/0.35  
% 0.19/0.35  cnf(c11, axiom,
% 0.19/0.35  	isa(X7,X8) | status(sK51(X7,X8),sK52(X7,X8),X7)).
% 0.19/0.35  cnf(a7, assumption,
% 0.19/0.35  	X5 = sK51(X7,X8)).
% 0.19/0.35  cnf(a8, assumption,
% 0.19/0.35  	X6 = sK52(X7,X8)).
% 0.19/0.35  cnf(a9, assumption,
% 0.19/0.35  	cax = X7).
% 0.19/0.35  cnf(c12, plain,
% 0.19/0.35  	$false,
% 0.19/0.35  	inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c10, c11])).
% 0.19/0.35  cnf(c13, plain,
% 0.19/0.35  	isa(X7,X8),
% 0.19/0.35  	inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c10, c11])).
% 0.19/0.35  
% 0.19/0.35  cnf(c14, plain,
% 0.19/0.35  	~isa(cax,thm)).
% 0.19/0.35  cnf(a10, assumption,
% 0.19/0.35  	X7 = cax).
% 0.19/0.35  cnf(a11, assumption,
% 0.19/0.35  	X8 = thm).
% 0.19/0.35  cnf(c15, plain,
% 0.19/0.35  	$false,
% 0.19/0.35  	inference(predicate_reduction, [assumptions([a10, a11])], [c13, c14])).
% 0.19/0.35  
% 0.19/0.35  cnf(c16, plain,
% 0.19/0.35  	$false,
% 0.19/0.35  	inference(constraint_solving, [
% 0.19/0.35  		bind(X0, cax),
% 0.19/0.35  		bind(X1, thm),
% 0.19/0.35  		bind(X2, sK51(X0,X1)),
% 0.19/0.35  		bind(X3, sK52(X0,X1)),
% 0.19/0.35  		bind(X4, sK17(X2,X3)),
% 0.19/0.35  		bind(X5, sK51(X0,X1)),
% 0.19/0.35  		bind(X6, sK52(X7,X8)),
% 0.19/0.35  		bind(X7, cax),
% 0.19/0.35  		bind(X8, thm)
% 0.19/0.35  	],
% 0.19/0.35  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 0.19/0.35  
% 0.19/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------