TSTP Solution File: SET822-2 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET822-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 : n023.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:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SET822-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Mon Jul 11 11:02:54 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.36  % SZS status Unsatisfiable
% 0.14/0.36  % SZS output begin IncompleteProof
% 0.14/0.36  cnf(c0, axiom,
% 0.14/0.36  	c_in(v_x(X0,X1),X1,tc_IntDef_Oint) | ~c_in(v_f(X0),X1,tc_IntDef_Oint)).
% 0.14/0.36  cnf(c1, plain,
% 0.14/0.36  	c_in(v_x(X0,X1),X1,tc_IntDef_Oint) | ~c_in(v_f(X0),X1,tc_IntDef_Oint),
% 0.14/0.36  	inference(start, [], [c0])).
% 0.14/0.36  
% 0.14/0.36  cnf(c2, axiom,
% 0.14/0.36  	X2 = X3 | c_in(X2,X4,X5) | ~c_in(X2,c_insert(X3,X4,X5),X5)).
% 0.14/0.36  cnf(a0, assumption,
% 0.14/0.36  	v_x(X0,X1) = X2).
% 0.14/0.36  cnf(a1, assumption,
% 0.14/0.36  	X1 = c_insert(X3,X4,X5)).
% 0.14/0.36  cnf(a2, assumption,
% 0.14/0.36  	tc_IntDef_Oint = X5).
% 0.14/0.36  cnf(c3, plain,
% 0.14/0.36  	~c_in(v_f(X0),X1,tc_IntDef_Oint),
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.14/0.36  cnf(c4, plain,
% 0.14/0.36  	X2 = X3 | c_in(X2,X4,X5),
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.14/0.36  
% 0.14/0.36  cnf(c5, axiom,
% 0.14/0.36  	~v_P(v_x(X6,X7)) | ~c_in(v_f(X6),X7,tc_IntDef_Oint)).
% 0.14/0.36  cnf(a3, assumption,
% 0.14/0.36  	v_x(X6,X7) = X2).
% 0.14/0.36  cnf(c6, plain,
% 0.14/0.36  	c_in(X2,X4,X5),
% 0.14/0.36  	inference(strict_subterm_extension, [assumptions([a3])], [c4, c5])).
% 0.14/0.36  cnf(c7, plain,
% 0.14/0.36  	~c_in(v_f(X6),X7,tc_IntDef_Oint),
% 0.14/0.36  	inference(strict_subterm_extension, [assumptions([a3])], [c4, c5])).
% 0.14/0.36  cnf(c8, plain,
% 0.14/0.36  	~v_P(X3),
% 0.14/0.36  	inference(strict_subterm_extension, [assumptions([a3])], [c4, c5])).
% 0.14/0.36  
% 0.14/0.36  cnf(c9, axiom,
% 0.14/0.36  	v_P(v_f(v_b))).
% 0.14/0.36  cnf(a4, assumption,
% 0.14/0.36  	X3 = v_f(v_b)).
% 0.14/0.36  cnf(c10, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a4])], [c8, c9])).
% 0.14/0.36  cnf(c11, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a4])], [c8, c9])).
% 0.14/0.36  
% 0.14/0.36  cnf(c12, axiom,
% 0.14/0.36  	c_in(X8,c_insert(X8,X9,X10),X10)).
% 0.14/0.36  cnf(a5, assumption,
% 0.14/0.36  	v_f(X6) = X8).
% 0.14/0.36  cnf(a6, assumption,
% 0.14/0.36  	X7 = c_insert(X8,X9,X10)).
% 0.14/0.36  cnf(a7, assumption,
% 0.14/0.36  	tc_IntDef_Oint = X10).
% 0.14/0.36  cnf(c13, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c12])).
% 0.14/0.36  cnf(c14, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c12])).
% 0.14/0.36  
% 0.14/0.36  cnf(c15, axiom,
% 0.14/0.36  	~c_in(X11,c_emptyset,X12)).
% 0.14/0.36  cnf(a8, assumption,
% 0.14/0.36  	X2 = X11).
% 0.14/0.36  cnf(a9, assumption,
% 0.14/0.36  	X4 = c_emptyset).
% 0.14/0.36  cnf(a10, assumption,
% 0.14/0.36  	X5 = X12).
% 0.14/0.36  cnf(c16, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c6, c15])).
% 0.14/0.36  cnf(c17, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c6, c15])).
% 0.14/0.36  
% 0.14/0.36  cnf(c18, plain,
% 0.14/0.36  	c_in(v_f(X6),X7,tc_IntDef_Oint)).
% 0.14/0.36  cnf(a11, assumption,
% 0.14/0.36  	v_f(X0) = v_f(X6)).
% 0.14/0.36  cnf(a12, assumption,
% 0.14/0.36  	X1 = X7).
% 0.14/0.36  cnf(a13, assumption,
% 0.14/0.36  	tc_IntDef_Oint = tc_IntDef_Oint).
% 0.14/0.36  cnf(c19, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(predicate_reduction, [assumptions([a11, a12, a13])], [c3, c18])).
% 0.14/0.36  
% 0.14/0.36  cnf(c20, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(constraint_solving, [
% 0.14/0.36  		bind(X0, v_b),
% 0.14/0.36  		bind(X1, c_insert(X3,X4,X5)),
% 0.14/0.36  		bind(X2, v_x(X0,X1)),
% 0.14/0.36  		bind(X3, v_f(v_b)),
% 0.14/0.36  		bind(X4, c_emptyset),
% 0.14/0.36  		bind(X5, tc_IntDef_Oint),
% 0.14/0.36  		bind(X6, v_b),
% 0.14/0.36  		bind(X7, c_insert(X3,X4,X5)),
% 0.14/0.36  		bind(X8, v_f(X6)),
% 0.14/0.36  		bind(X9, c_emptyset),
% 0.14/0.36  		bind(X10, tc_IntDef_Oint),
% 0.14/0.36  		bind(X11, v_x(X0,X1)),
% 0.14/0.36  		bind(X12, tc_IntDef_Oint)
% 0.14/0.36  	],
% 0.14/0.36  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 0.14/0.36  
% 0.14/0.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------