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

View Problem - Process Solution

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

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

% Result   : Unsatisfiable 0.07s 0.27s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08  % Problem  : KRS123+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.08  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.07/0.27  % Computer : n032.cluster.edu
% 0.07/0.27  % Model    : x86_64 x86_64
% 0.07/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27  % Memory   : 8042.1875MB
% 0.07/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27  % CPULimit : 300
% 0.07/0.27  % WCLimit  : 600
% 0.07/0.27  % DateTime : Tue Jun  7 05:23:35 EDT 2022
% 0.07/0.27  % CPUTime  : 
% 0.07/0.27  % SZS status Theorem
% 0.07/0.27  % SZS output begin IncompleteProof
% 0.07/0.27  cnf(c0, axiom,
% 0.07/0.27  	~ra_Px1(X0,X1) | ~cd(X0)).
% 0.07/0.27  cnf(c1, plain,
% 0.07/0.27  	~ra_Px1(X0,X1) | ~cd(X0),
% 0.07/0.27  	inference(start, [], [c0])).
% 0.07/0.27  
% 0.07/0.27  cnf(c2, axiom,
% 0.07/0.27  	ra_Px1(X2,sK1(X2)) | ~cdxcomp(X2)).
% 0.07/0.27  cnf(a0, assumption,
% 0.07/0.27  	X0 = X2).
% 0.07/0.27  cnf(a1, assumption,
% 0.07/0.27  	X1 = sK1(X2)).
% 0.07/0.27  cnf(c3, plain,
% 0.07/0.27  	~cd(X0),
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.07/0.27  cnf(c4, plain,
% 0.07/0.27  	~cdxcomp(X2),
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.07/0.27  
% 0.07/0.27  cnf(c5, axiom,
% 0.07/0.27  	cdxcomp(X3) | ~cc(X3)).
% 0.07/0.27  cnf(a2, assumption,
% 0.07/0.27  	X2 = X3).
% 0.07/0.27  cnf(c6, plain,
% 0.07/0.27  	$false,
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.07/0.27  cnf(c7, plain,
% 0.07/0.27  	~cc(X3),
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.07/0.27  
% 0.07/0.27  cnf(c8, axiom,
% 0.07/0.27  	cc(X4) | ~cUnsatisfiable(X4)).
% 0.07/0.27  cnf(a3, assumption,
% 0.07/0.27  	X3 = X4).
% 0.07/0.27  cnf(c9, plain,
% 0.07/0.27  	$false,
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a3])], [c7, c8])).
% 0.07/0.27  cnf(c10, plain,
% 0.07/0.27  	~cUnsatisfiable(X4),
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a3])], [c7, c8])).
% 0.07/0.27  
% 0.07/0.27  cnf(c11, axiom,
% 0.07/0.27  	cUnsatisfiable(i2003_11_14_17_22_02803)).
% 0.07/0.27  cnf(a4, assumption,
% 0.07/0.27  	X4 = i2003_11_14_17_22_02803).
% 0.07/0.27  cnf(c12, plain,
% 0.07/0.27  	$false,
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 0.07/0.27  cnf(c13, plain,
% 0.07/0.27  	$false,
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 0.07/0.27  
% 0.07/0.27  cnf(c14, axiom,
% 0.07/0.27  	cd(X5) | ~cUnsatisfiable(X5)).
% 0.07/0.27  cnf(a5, assumption,
% 0.07/0.27  	X0 = X5).
% 0.07/0.27  cnf(c15, plain,
% 0.07/0.27  	$false,
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a5])], [c3, c14])).
% 0.07/0.27  cnf(c16, plain,
% 0.07/0.27  	~cUnsatisfiable(X5),
% 0.07/0.27  	inference(strict_predicate_extension, [assumptions([a5])], [c3, c14])).
% 0.07/0.27  
% 0.07/0.27  cnf(c17, plain,
% 0.07/0.27  	cUnsatisfiable(X4)).
% 0.07/0.27  cnf(a6, assumption,
% 0.07/0.27  	X5 = X4).
% 0.07/0.27  cnf(c18, plain,
% 0.07/0.27  	$false,
% 0.07/0.27  	inference(predicate_reduction, [assumptions([a6])], [c16, c17])).
% 0.07/0.27  
% 0.07/0.27  cnf(c19, plain,
% 0.07/0.27  	$false,
% 0.07/0.27  	inference(constraint_solving, [
% 0.07/0.27  		bind(X0, i2003_11_14_17_22_02803),
% 0.07/0.27  		bind(X1, sK1(X2)),
% 0.07/0.27  		bind(X2, i2003_11_14_17_22_02803),
% 0.07/0.27  		bind(X3, i2003_11_14_17_22_02803),
% 0.07/0.27  		bind(X4, i2003_11_14_17_22_02803),
% 0.07/0.27  		bind(X5, i2003_11_14_17_22_02803)
% 0.07/0.27  	],
% 0.07/0.27  	[a0, a1, a2, a3, a4, a5, a6])).
% 0.07/0.27  
% 0.07/0.27  % SZS output end IncompleteProof
%------------------------------------------------------------------------------