%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SWV183+1 : TPTP v8.1.0. Bugfixed v3.3.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 : Wed Jul 20 19:45:47 EDT 2022

% Result   : Theorem 0.24s 0.44s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SWV183+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.36  % Computer : n017.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Wed Jun 15 17:33:25 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.24/0.44  % SZS status Theorem
% 0.24/0.44  % SZS output begin IncompleteProof
% 0.24/0.44  cnf(c0, axiom,
% 0.24/0.44  	leq(n0,sK41)).
% 0.24/0.44  cnf(c1, plain,
% 0.24/0.44  	leq(n0,sK41),
% 0.24/0.44  	inference(start, [], [c0])).
% 0.24/0.44  
% 0.24/0.44  cnf(c2, axiom,
% 0.24/0.44  	init = a_select2(mu_init,X0) | ~leq(X0,n4) | ~leq(n0,X0)).
% 0.24/0.44  cnf(a0, assumption,
% 0.24/0.44  	n0 = n0).
% 0.24/0.44  cnf(a1, assumption,
% 0.24/0.44  	sK41 = X0).
% 0.24/0.44  cnf(c3, plain,
% 0.24/0.44  	$false,
% 0.24/0.44  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.24/0.44  cnf(c4, plain,
% 0.24/0.44  	init = a_select2(mu_init,X0) | ~leq(X0,n4),
% 0.24/0.44  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.24/0.44  
% 0.24/0.44  cnf(c5, axiom,
% 0.24/0.44  	init != a_select2(mu_init,sK41)).
% 0.24/0.44  cnf(a2, assumption,
% 0.24/0.44  	a_select2(mu_init,sK41) = a_select2(mu_init,X0)).
% 0.24/0.44  cnf(a3, assumption,
% 0.24/0.44  	init = X1).
% 0.24/0.44  cnf(c6, plain,
% 0.24/0.44  	~leq(X0,n4),
% 0.24/0.44  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.24/0.44  cnf(c7, plain,
% 0.24/0.44  	$false,
% 0.24/0.44  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.24/0.44  cnf(c8, plain,
% 0.24/0.44  	init != X1,
% 0.24/0.44  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.24/0.44  
% 0.24/0.44  cnf(a4, assumption,
% 0.24/0.44  	init = X1).
% 0.24/0.44  cnf(c9, plain,
% 0.24/0.44  	$false,
% 0.24/0.44  	inference(reflexivity, [assumptions([a4])], [c8])).
% 0.24/0.44  
% 0.24/0.44  cnf(c10, axiom,
% 0.24/0.44  	leq(sK41,n4)).
% 0.24/0.44  cnf(a5, assumption,
% 0.24/0.44  	X0 = sK41).
% 0.24/0.44  cnf(a6, assumption,
% 0.24/0.44  	n4 = n4).
% 0.24/0.44  cnf(c11, plain,
% 0.24/0.44  	$false,
% 0.24/0.44  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])).
% 0.24/0.44  cnf(c12, plain,
% 0.24/0.44  	$false,
% 0.24/0.44  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])).
% 0.24/0.44  
% 0.24/0.44  cnf(c13, plain,
% 0.24/0.44  	$false,
% 0.24/0.44  	inference(constraint_solving, [
% 0.24/0.44  		bind(X0, sK41),
% 0.24/0.44  		bind(X1, init)
% 0.24/0.44  	],
% 0.24/0.44  	[a0, a1, a2, a3, a4, a5, a6])).
% 0.24/0.44  
% 0.24/0.44  % SZS output end IncompleteProof
%------------------------------------------------------------------------------