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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET865-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 : n013.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:52 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET865-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n013.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jul  9 17:33:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.36  % SZS status Unsatisfiable
% 0.20/0.36  % SZS output begin IncompleteProof
% 0.20/0.36  cnf(c0, axiom,
% 0.20/0.36  	~c_in(X0,v_S,tc_set(t_a)) | c_lessequals(X0,v_x(X0),tc_set(t_a))).
% 0.20/0.36  cnf(c1, plain,
% 0.20/0.36  	~c_in(X0,v_S,tc_set(t_a)) | c_lessequals(X0,v_x(X0),tc_set(t_a)),
% 0.20/0.36  	inference(start, [], [c0])).
% 0.20/0.36  
% 0.20/0.36  cnf(c2, axiom,
% 0.20/0.36  	~c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) | c_in(c_Union(X1,t_a),v_S,tc_set(t_a))).
% 0.20/0.36  cnf(a0, assumption,
% 0.20/0.36  	X0 = c_Union(X1,t_a)).
% 0.20/0.36  cnf(a1, assumption,
% 0.20/0.36  	v_S = v_S).
% 0.20/0.36  cnf(a2, assumption,
% 0.20/0.36  	tc_set(t_a) = tc_set(t_a)).
% 0.20/0.36  cnf(c3, plain,
% 0.20/0.36  	c_lessequals(X0,v_x(X0),tc_set(t_a)),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.20/0.36  cnf(c4, plain,
% 0.20/0.36  	~c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.20/0.36  
% 0.20/0.36  cnf(c5, axiom,
% 0.20/0.36  	c_in(X2,X3,X4) | ~c_lessequals(X5,X3,tc_set(X4)) | ~c_in(X2,X5,X4)).
% 0.20/0.36  cnf(a3, assumption,
% 0.20/0.36  	X1 = X2).
% 0.20/0.36  cnf(a4, assumption,
% 0.20/0.36  	c_Zorn_Ochain(v_S,t_a) = X3).
% 0.20/0.36  cnf(a5, assumption,
% 0.20/0.36  	tc_set(tc_set(t_a)) = X4).
% 0.20/0.36  cnf(c6, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.20/0.36  cnf(c7, plain,
% 0.20/0.36  	~c_lessequals(X5,X3,tc_set(X4)) | ~c_in(X2,X5,X4),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.20/0.36  
% 0.20/0.36  cnf(c8, axiom,
% 0.20/0.36  	c_lessequals(c_Zorn_Omaxchain(X6,X7),c_Zorn_Ochain(X6,X7),tc_set(tc_set(tc_set(X7))))).
% 0.20/0.36  cnf(a6, assumption,
% 0.20/0.36  	X5 = c_Zorn_Omaxchain(X6,X7)).
% 0.20/0.36  cnf(a7, assumption,
% 0.20/0.36  	X3 = c_Zorn_Ochain(X6,X7)).
% 0.20/0.36  cnf(a8, assumption,
% 0.20/0.36  	tc_set(X4) = tc_set(tc_set(tc_set(X7)))).
% 0.20/0.36  cnf(c9, plain,
% 0.20/0.36  	~c_in(X2,X5,X4),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])).
% 0.20/0.36  cnf(c10, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])).
% 0.20/0.36  
% 0.20/0.36  cnf(c11, axiom,
% 0.20/0.36  	c_in(c_Zorn_OHausdorff__1(X8,X9),c_Zorn_Omaxchain(X8,X9),tc_set(tc_set(X9)))).
% 0.20/0.36  cnf(a9, assumption,
% 0.20/0.36  	X2 = c_Zorn_OHausdorff__1(X8,X9)).
% 0.20/0.36  cnf(a10, assumption,
% 0.20/0.36  	X5 = c_Zorn_Omaxchain(X8,X9)).
% 0.20/0.36  cnf(a11, assumption,
% 0.20/0.36  	X4 = tc_set(tc_set(X9))).
% 0.20/0.36  cnf(c12, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c11])).
% 0.20/0.36  cnf(c13, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c11])).
% 0.20/0.36  
% 0.20/0.36  cnf(c14, axiom,
% 0.20/0.36  	c_Union(X10,X11) = X12 | ~c_lessequals(c_Union(X10,X11),X12,tc_set(X11)) | ~c_in(X10,c_Zorn_Omaxchain(X13,X11),tc_set(tc_set(X11))) | ~c_in(X12,X13,tc_set(X11))).
% 0.20/0.36  cnf(a12, assumption,
% 0.20/0.36  	X0 = c_Union(X10,X11)).
% 0.20/0.36  cnf(a13, assumption,
% 0.20/0.36  	v_x(X0) = X12).
% 0.20/0.36  cnf(a14, assumption,
% 0.20/0.36  	tc_set(t_a) = tc_set(X11)).
% 0.20/0.36  cnf(c15, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c3, c14])).
% 0.20/0.36  cnf(c16, plain,
% 0.20/0.36  	c_Union(X10,X11) = X12 | ~c_in(X10,c_Zorn_Omaxchain(X13,X11),tc_set(tc_set(X11))) | ~c_in(X12,X13,tc_set(X11)),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c3, c14])).
% 0.20/0.36  
% 0.20/0.36  cnf(c17, axiom,
% 0.20/0.36  	~c_in(X14,v_S,tc_set(t_a)) | v_x(X14) != X14).
% 0.20/0.36  cnf(a15, assumption,
% 0.20/0.36  	v_x(X14) = X12).
% 0.20/0.36  cnf(a16, assumption,
% 0.20/0.36  	c_Union(X10,X11) = X15).
% 0.20/0.36  cnf(c18, plain,
% 0.20/0.36  	~c_in(X10,c_Zorn_Omaxchain(X13,X11),tc_set(tc_set(X11))) | ~c_in(X12,X13,tc_set(X11)),
% 0.20/0.36  	inference(strict_subterm_extension, [assumptions([a15, a16])], [c16, c17])).
% 0.20/0.36  cnf(c19, plain,
% 0.20/0.36  	~c_in(X14,v_S,tc_set(t_a)),
% 0.20/0.36  	inference(strict_subterm_extension, [assumptions([a15, a16])], [c16, c17])).
% 0.20/0.36  cnf(c20, plain,
% 0.20/0.36  	X15 != X14,
% 0.20/0.36  	inference(strict_subterm_extension, [assumptions([a15, a16])], [c16, c17])).
% 0.20/0.36  
% 0.20/0.36  cnf(a17, assumption,
% 0.20/0.36  	X15 = X14).
% 0.20/0.36  cnf(c21, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(reflexivity, [assumptions([a17])], [c20])).
% 0.20/0.36  
% 0.20/0.36  cnf(c22, plain,
% 0.20/0.36  	c_in(X0,v_S,tc_set(t_a))).
% 0.20/0.36  cnf(a18, assumption,
% 0.20/0.36  	X14 = X0).
% 0.20/0.36  cnf(a19, assumption,
% 0.20/0.36  	v_S = v_S).
% 0.20/0.36  cnf(a20, assumption,
% 0.20/0.36  	tc_set(t_a) = tc_set(t_a)).
% 0.20/0.36  cnf(c23, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(predicate_reduction, [assumptions([a18, a19, a20])], [c19, c22])).
% 0.20/0.36  
% 0.20/0.36  cnf(c24, plain,
% 0.20/0.36  	c_in(X2,X5,X4)).
% 0.20/0.36  cnf(a21, assumption,
% 0.20/0.36  	X10 = X2).
% 0.20/0.36  cnf(a22, assumption,
% 0.20/0.36  	c_Zorn_Omaxchain(X13,X11) = X5).
% 0.20/0.36  cnf(a23, assumption,
% 0.20/0.36  	tc_set(tc_set(X11)) = X4).
% 0.20/0.36  cnf(c25, plain,
% 0.20/0.36  	~c_in(X12,X13,tc_set(X11)),
% 0.20/0.36  	inference(predicate_reduction, [assumptions([a21, a22, a23])], [c18, c24])).
% 0.20/0.36  
% 0.20/0.36  cnf(c26, axiom,
% 0.20/0.36  	~c_in(X16,v_S,tc_set(t_a)) | c_in(v_x(X16),v_S,tc_set(t_a))).
% 0.20/0.36  cnf(a24, assumption,
% 0.20/0.36  	X12 = v_x(X16)).
% 0.20/0.36  cnf(a25, assumption,
% 0.20/0.36  	X13 = v_S).
% 0.20/0.36  cnf(a26, assumption,
% 0.20/0.36  	tc_set(X11) = tc_set(t_a)).
% 0.20/0.36  cnf(c27, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a24, a25, a26])], [c25, c26])).
% 0.20/0.36  cnf(c28, plain,
% 0.20/0.36  	~c_in(X16,v_S,tc_set(t_a)),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a24, a25, a26])], [c25, c26])).
% 0.20/0.36  
% 0.20/0.36  cnf(c29, plain,
% 0.20/0.36  	c_in(X0,v_S,tc_set(t_a))).
% 0.20/0.36  cnf(a27, assumption,
% 0.20/0.36  	X16 = X0).
% 0.20/0.36  cnf(a28, assumption,
% 0.20/0.36  	v_S = v_S).
% 0.20/0.36  cnf(a29, assumption,
% 0.20/0.36  	tc_set(t_a) = tc_set(t_a)).
% 0.20/0.36  cnf(c30, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(predicate_reduction, [assumptions([a27, a28, a29])], [c28, c29])).
% 0.20/0.36  
% 0.20/0.36  cnf(c31, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(constraint_solving, [
% 0.20/0.36  		bind(X0, c_Union(X1,t_a)),
% 0.20/0.36  		bind(X1, c_Zorn_OHausdorff__1(X8,X9)),
% 0.20/0.36  		bind(X2, c_Zorn_OHausdorff__1(X8,X9)),
% 0.20/0.36  		bind(X3, c_Zorn_Ochain(v_S,t_a)),
% 0.20/0.36  		bind(X4, tc_set(tc_set(t_a))),
% 0.20/0.36  		bind(X5, c_Zorn_Omaxchain(X6,X7)),
% 0.20/0.36  		bind(X6, v_S),
% 0.20/0.36  		bind(X7, t_a),
% 0.20/0.36  		bind(X8, v_S),
% 0.20/0.36  		bind(X9, t_a),
% 0.20/0.36  		bind(X10, c_Zorn_OHausdorff__1(X8,X9)),
% 0.20/0.36  		bind(X11, t_a),
% 0.20/0.36  		bind(X12, v_x(X0)),
% 0.20/0.36  		bind(X13, v_S),
% 0.20/0.36  		bind(X14, c_Union(X1,t_a)),
% 0.20/0.36  		bind(X15, c_Union(X10,X11)),
% 0.20/0.36  		bind(X16, c_Union(X1,t_a))
% 0.20/0.36  	],
% 0.20/0.36  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29])).
% 0.20/0.36  
% 0.20/0.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------