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

View Problem - Process Solution

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

% Computer : n026.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 12:12:41 EDT 2022

% Result   : Theorem 19.68s 2.84s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL893+1 : TPTP v8.1.0. Released v5.5.0.
% 0.12/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33  % Computer : n026.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 : Sun Jul  3 02:47:50 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 19.68/2.84  % SZS status Theorem
% 19.68/2.84  % SZS output begin IncompleteProof
% 19.68/2.84  cnf(c0, axiom,
% 19.68/2.84  	sK0 = h(sK0)).
% 19.68/2.84  cnf(c1, plain,
% 19.68/2.84  	sK0 = h(sK0),
% 19.68/2.84  	inference(start, [], [c0])).
% 19.68/2.84  
% 19.68/2.84  cnf(c2, axiom,
% 19.68/2.84  	h(X0) = '==>'(h(X0),X0)).
% 19.68/2.84  cnf(a0, assumption,
% 19.68/2.84  	h(X0) = h(sK0)).
% 19.68/2.84  cnf(a1, assumption,
% 19.68/2.84  	sK0 = X1).
% 19.68/2.84  cnf(c3, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 19.68/2.84  cnf(c4, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 19.68/2.84  cnf(c5, plain,
% 19.68/2.84  	h(X0) = '==>'(X1,X0),
% 19.68/2.84  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 19.68/2.84  
% 19.68/2.84  cnf(c6, axiom,
% 19.68/2.84  	'>='(X2,'==>'(X3,X4)) | ~'>='('+'(X3,X2),X4)).
% 19.68/2.84  cnf(a2, assumption,
% 19.68/2.84  	'==>'(X3,X4) = '==>'(X1,X0)).
% 19.68/2.84  cnf(a3, assumption,
% 19.68/2.84  	h(X0) = X5).
% 19.68/2.84  cnf(c7, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 19.68/2.84  cnf(c8, plain,
% 19.68/2.84  	~'>='('+'(X3,X2),X4),
% 19.68/2.84  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 19.68/2.84  cnf(c9, plain,
% 19.68/2.84  	'>='(X2,X5),
% 19.68/2.84  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 19.68/2.84  
% 19.68/2.84  cnf(c10, axiom,
% 19.68/2.84  	X6 = X7 | ~'>='(X7,X6) | ~'>='(X6,X7)).
% 19.68/2.84  cnf(a4, assumption,
% 19.68/2.84  	X2 = X6).
% 19.68/2.84  cnf(a5, assumption,
% 19.68/2.84  	X5 = X7).
% 19.68/2.84  cnf(c11, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])).
% 19.68/2.84  cnf(c12, plain,
% 19.68/2.84  	X6 = X7 | ~'>='(X7,X6),
% 19.68/2.84  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])).
% 19.68/2.84  
% 19.68/2.84  cnf(c13, plain,
% 19.68/2.84  	sK0 = h(sK0)).
% 19.68/2.84  cnf(a6, assumption,
% 19.68/2.84  	h(sK0) = X7).
% 19.68/2.84  cnf(c14, plain,
% 19.68/2.84  	~'>='(X7,X6),
% 19.68/2.84  	inference(subterm_reduction, [assumptions([a6])], [c12, c13])).
% 19.68/2.84  cnf(c15, plain,
% 19.68/2.84  	sK0 = X6,
% 19.68/2.84  	inference(subterm_reduction, [assumptions([a6])], [c12, c13])).
% 19.68/2.84  
% 19.68/2.84  cnf(c16, axiom,
% 19.68/2.84  	'0' != sK0).
% 19.68/2.84  cnf(a7, assumption,
% 19.68/2.84  	sK0 = sK0).
% 19.68/2.84  cnf(c17, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_subterm_extension, [assumptions([a7])], [c15, c16])).
% 19.68/2.84  cnf(c18, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_subterm_extension, [assumptions([a7])], [c15, c16])).
% 19.68/2.84  cnf(c19, plain,
% 19.68/2.84  	'0' != X6,
% 19.68/2.84  	inference(strict_subterm_extension, [assumptions([a7])], [c15, c16])).
% 19.68/2.84  
% 19.68/2.84  cnf(a8, assumption,
% 19.68/2.84  	'0' = X6).
% 19.68/2.84  cnf(c20, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(reflexivity, [assumptions([a8])], [c19])).
% 19.68/2.84  
% 19.68/2.84  cnf(c21, axiom,
% 19.68/2.84  	'>='(X8,'0')).
% 19.68/2.84  cnf(a9, assumption,
% 19.68/2.84  	X7 = X8).
% 19.68/2.84  cnf(a10, assumption,
% 19.68/2.84  	X6 = '0').
% 19.68/2.84  cnf(c22, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c21])).
% 19.68/2.84  cnf(c23, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c21])).
% 19.68/2.84  
% 19.68/2.84  cnf(c24, axiom,
% 19.68/2.84  	'+'(X9,'0') = X9).
% 19.68/2.84  cnf(a11, assumption,
% 19.68/2.84  	'+'(X3,X2) = '+'(X9,'0')).
% 19.68/2.84  cnf(c25, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_function_extension, [assumptions([a11])], [c8, c24])).
% 19.68/2.84  cnf(c26, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_function_extension, [assumptions([a11])], [c8, c24])).
% 19.68/2.84  cnf(c27, plain,
% 19.68/2.84  	X10 != X9 | ~'>='(X10,X4),
% 19.68/2.84  	inference(strict_function_extension, [assumptions([a11])], [c8, c24])).
% 19.68/2.84  
% 19.68/2.84  cnf(a12, assumption,
% 19.68/2.84  	X10 = X9).
% 19.68/2.84  cnf(c28, plain,
% 19.68/2.84  	~'>='(X10,X4),
% 19.68/2.84  	inference(reflexivity, [assumptions([a12])], [c27])).
% 19.68/2.84  
% 19.68/2.84  cnf(c29, axiom,
% 19.68/2.84  	'>='(X11,X11)).
% 19.68/2.84  cnf(a13, assumption,
% 19.68/2.84  	X10 = X11).
% 19.68/2.84  cnf(a14, assumption,
% 19.68/2.84  	X4 = X11).
% 19.68/2.84  cnf(c30, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c28, c29])).
% 19.68/2.84  cnf(c31, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c28, c29])).
% 19.68/2.84  
% 19.68/2.84  cnf(c32, plain,
% 19.68/2.84  	$false,
% 19.68/2.84  	inference(constraint_solving, [
% 19.68/2.84  		bind(X0, sK0),
% 19.68/2.84  		bind(X1, sK0),
% 19.68/2.84  		bind(X2, '0'),
% 19.68/2.84  		bind(X3, sK0),
% 19.68/2.84  		bind(X4, sK0),
% 19.68/2.84  		bind(X5, h(X0)),
% 19.68/2.84  		bind(X6, '0'),
% 19.68/2.84  		bind(X7, h(X0)),
% 19.68/2.84  		bind(X8, h(X0)),
% 19.68/2.84  		bind(X9, sK0),
% 19.68/2.84  		bind(X10, sK0),
% 19.68/2.84  		bind(X11, sK0)
% 19.68/2.84  	],
% 19.68/2.84  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])).
% 19.68/2.84  
% 19.68/2.84  % SZS output end IncompleteProof
%------------------------------------------------------------------------------