%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUM837+1 : TPTP v8.1.0. Released v4.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 : n020.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:36:59 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NUM837+1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n020.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 : Thu Jul  7 15:14:44 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % SZS status Theorem
% 0.13/0.35  % SZS output begin IncompleteProof
% 0.13/0.35  cnf(c0, axiom,
% 0.13/0.35  	vd269 != vplus(vd268,X0)).
% 0.13/0.35  cnf(c1, plain,
% 0.13/0.35  	vd269 != vplus(vd268,X0),
% 0.13/0.35  	inference(start, [], [c0])).
% 0.13/0.35  
% 0.13/0.35  cnf(c2, axiom,
% 0.13/0.35  	vplus(X1,sK0(X2,X1)) = X2 | ~less(X1,X2)).
% 0.13/0.35  cnf(a0, assumption,
% 0.13/0.35  	vplus(vd268,X0) = vplus(X1,sK0(X2,X1))).
% 0.13/0.35  cnf(c3, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35  cnf(c4, plain,
% 0.13/0.35  	~less(X1,X2),
% 0.13/0.35  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35  cnf(c5, plain,
% 0.13/0.35  	X3 != X2 | vd269 != X3,
% 0.13/0.35  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35  
% 0.13/0.35  cnf(a1, assumption,
% 0.13/0.35  	X3 = X2).
% 0.13/0.35  cnf(c6, plain,
% 0.13/0.35  	vd269 != X3,
% 0.13/0.35  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.13/0.35  
% 0.13/0.35  cnf(a2, assumption,
% 0.13/0.35  	vd269 = X3).
% 0.13/0.35  cnf(c7, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(reflexivity, [assumptions([a2])], [c6])).
% 0.13/0.35  
% 0.13/0.35  cnf(c8, axiom,
% 0.13/0.35  	less(vd268,vd269)).
% 0.13/0.35  cnf(a3, assumption,
% 0.13/0.35  	X1 = vd268).
% 0.13/0.35  cnf(a4, assumption,
% 0.13/0.35  	X2 = vd269).
% 0.13/0.35  cnf(c9, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.13/0.35  cnf(c10, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.13/0.35  
% 0.13/0.35  cnf(c11, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(constraint_solving, [
% 0.13/0.35  		bind(X0, sK0(X2,X1)),
% 0.13/0.35  		bind(X1, vd268),
% 0.13/0.35  		bind(X2, vd269),
% 0.13/0.35  		bind(X3, vd269)
% 0.13/0.35  	],
% 0.13/0.35  	[a0, a1, a2, a3, a4])).
% 0.13/0.35  
% 0.13/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------