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

% Computer : n021.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 : Tue Jul 19 02:48:29 EDT 2022

% Result   : Unsatisfiable 0.15s 0.36s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET833-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.35  % Computer : n021.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Mon Jul 11 02:08:38 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.15/0.36  % SZS status Unsatisfiable
% 0.15/0.36  % SZS output begin IncompleteProof
% 0.15/0.36  cnf(c0, axiom,
% 0.15/0.36  	c_lessequals(v_Z,v_V,tc_set(t_a))).
% 0.15/0.36  cnf(c1, plain,
% 0.15/0.36  	c_lessequals(v_Z,v_V,tc_set(t_a)),
% 0.15/0.36  	inference(start, [], [c0])).
% 0.15/0.36  
% 0.15/0.36  cnf(c2, axiom,
% 0.15/0.36  	c_in(X0,X1,X2) | ~c_lessequals(X3,X1,tc_set(X2)) | ~c_in(X0,X3,X2)).
% 0.15/0.36  cnf(a0, assumption,
% 0.15/0.36  	v_Z = X3).
% 0.15/0.36  cnf(a1, assumption,
% 0.15/0.36  	v_V = X1).
% 0.15/0.36  cnf(a2, assumption,
% 0.15/0.36  	tc_set(t_a) = tc_set(X2)).
% 0.15/0.36  cnf(c3, plain,
% 0.15/0.36  	$false,
% 0.15/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.15/0.36  cnf(c4, plain,
% 0.15/0.36  	c_in(X0,X1,X2) | ~c_in(X0,X3,X2),
% 0.15/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.15/0.36  
% 0.15/0.36  cnf(c5, axiom,
% 0.15/0.36  	~c_in(v_x,v_V,t_a)).
% 0.15/0.36  cnf(a3, assumption,
% 0.15/0.36  	X0 = v_x).
% 0.15/0.36  cnf(a4, assumption,
% 0.15/0.36  	X1 = v_V).
% 0.15/0.36  cnf(a5, assumption,
% 0.15/0.36  	X2 = t_a).
% 0.15/0.36  cnf(c6, plain,
% 0.15/0.36  	~c_in(X0,X3,X2),
% 0.15/0.36  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.15/0.36  cnf(c7, plain,
% 0.15/0.36  	$false,
% 0.15/0.36  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.15/0.36  
% 0.15/0.36  cnf(c8, axiom,
% 0.15/0.36  	c_in(v_x,v_Z,t_a)).
% 0.15/0.36  cnf(a6, assumption,
% 0.15/0.36  	X0 = v_x).
% 0.15/0.36  cnf(a7, assumption,
% 0.15/0.36  	X3 = v_Z).
% 0.15/0.36  cnf(a8, assumption,
% 0.15/0.36  	X2 = t_a).
% 0.15/0.36  cnf(c9, plain,
% 0.15/0.36  	$false,
% 0.15/0.36  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])).
% 0.15/0.36  cnf(c10, plain,
% 0.15/0.36  	$false,
% 0.15/0.36  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])).
% 0.15/0.36  
% 0.15/0.36  cnf(c11, plain,
% 0.15/0.36  	$false,
% 0.15/0.36  	inference(constraint_solving, [
% 0.15/0.36  		bind(X0, v_x),
% 0.15/0.36  		bind(X1, v_V),
% 0.15/0.36  		bind(X2, t_a),
% 0.15/0.36  		bind(X3, v_Z)
% 0.15/0.36  	],
% 0.15/0.36  	[a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.15/0.36  
% 0.15/0.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------