TSTP Solution File: SWV882-1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SWV882-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 : n007.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:48:52 EDT 2022

% Result   : Unsatisfiable 103.78s 13.81s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWV882-1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n007.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Tue Jun 14 16:32:10 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 103.78/13.81  % SZS status Unsatisfiable
% 103.78/13.81  % SZS output begin IncompleteProof
% 103.78/13.81  cnf(c0, axiom,
% 103.78/13.81  	c_in(hAPP(v_mgt__call,v_pn),v_G,t_a)).
% 103.78/13.81  cnf(c1, plain,
% 103.78/13.81  	c_in(hAPP(v_mgt__call,v_pn),v_G,t_a),
% 103.78/13.81  	inference(start, [], [c0])).
% 103.78/13.81  
% 103.78/13.81  cnf(c2, axiom,
% 103.78/13.81  	~c_in(X0,X1,X2) | ~c_lessequals(X3,X1,tc_fun(X2,tc_bool)) | c_lessequals(c_Set_Oinsert(X0,X3,X2),X1,tc_fun(X2,tc_bool))).
% 103.78/13.81  cnf(a0, assumption,
% 103.78/13.81  	hAPP(v_mgt__call,v_pn) = X0).
% 103.78/13.81  cnf(a1, assumption,
% 103.78/13.81  	v_G = X1).
% 103.78/13.81  cnf(a2, assumption,
% 103.78/13.81  	t_a = X2).
% 103.78/13.81  cnf(c3, plain,
% 103.78/13.81  	$false,
% 103.78/13.81  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 103.78/13.81  cnf(c4, plain,
% 103.78/13.81  	~c_lessequals(X3,X1,tc_fun(X2,tc_bool)) | c_lessequals(c_Set_Oinsert(X0,X3,X2),X1,tc_fun(X2,tc_bool)),
% 103.78/13.81  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 103.78/13.81  
% 103.78/13.81  cnf(c5, axiom,
% 103.78/13.81  	c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(X4,tc_bool)),X5,tc_fun(X4,tc_bool))).
% 103.78/13.81  cnf(a3, assumption,
% 103.78/13.81  	X3 = c_Orderings_Obot__class_Obot(tc_fun(X4,tc_bool))).
% 103.78/13.81  cnf(a4, assumption,
% 103.78/13.81  	X1 = X5).
% 103.78/13.81  cnf(a5, assumption,
% 103.78/13.81  	tc_fun(X2,tc_bool) = tc_fun(X4,tc_bool)).
% 103.78/13.81  cnf(c6, plain,
% 103.78/13.81  	c_lessequals(c_Set_Oinsert(X0,X3,X2),X1,tc_fun(X2,tc_bool)),
% 103.78/13.81  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 103.78/13.81  cnf(c7, plain,
% 103.78/13.81  	$false,
% 103.78/13.81  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 103.78/13.81  
% 103.78/13.81  cnf(c8, axiom,
% 103.78/13.81  	~c_lessequals(X6,X7,tc_fun(t_a,tc_bool)) | hBOOL(hAPP(hAPP(v_P,X7),X6))).
% 103.78/13.81  cnf(a6, assumption,
% 103.78/13.81  	c_Set_Oinsert(X0,X3,X2) = X6).
% 103.78/13.81  cnf(a7, assumption,
% 103.78/13.81  	X1 = X7).
% 103.78/13.81  cnf(a8, assumption,
% 103.78/13.81  	tc_fun(X2,tc_bool) = tc_fun(t_a,tc_bool)).
% 103.78/13.81  cnf(c9, plain,
% 103.78/13.81  	$false,
% 103.78/13.81  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])).
% 103.78/13.81  cnf(c10, plain,
% 103.78/13.81  	hBOOL(hAPP(hAPP(v_P,X7),X6)),
% 103.78/13.81  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])).
% 103.78/13.81  
% 103.78/13.81  cnf(c11, axiom,
% 103.78/13.81  	~hBOOL(hAPP(hAPP(v_P,v_G),c_Set_Oinsert(hAPP(v_mgt__call,v_pn),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a)))).
% 103.78/13.81  cnf(a9, assumption,
% 103.78/13.81  	hAPP(hAPP(v_P,X7),X6) = hAPP(hAPP(v_P,v_G),c_Set_Oinsert(hAPP(v_mgt__call,v_pn),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))).
% 103.78/13.81  cnf(c12, plain,
% 103.78/13.81  	$false,
% 103.78/13.81  	inference(strict_predicate_extension, [assumptions([a9])], [c10, c11])).
% 103.78/13.81  cnf(c13, plain,
% 103.78/13.81  	$false,
% 103.78/13.81  	inference(strict_predicate_extension, [assumptions([a9])], [c10, c11])).
% 103.78/13.81  
% 103.78/13.81  cnf(c14, plain,
% 103.78/13.81  	$false,
% 103.78/13.81  	inference(constraint_solving, [
% 103.78/13.81  		bind(X0, hAPP(v_mgt__call,v_pn)),
% 103.78/13.81  		bind(X1, v_G),
% 103.78/13.81  		bind(X2, t_a),
% 103.78/13.81  		bind(X3, c_Orderings_Obot__class_Obot(tc_fun(X4,tc_bool))),
% 103.78/13.81  		bind(X4, t_a),
% 103.78/13.81  		bind(X5, v_G),
% 103.78/13.81  		bind(X6, c_Set_Oinsert(X0,X3,X2)),
% 103.78/13.81  		bind(X7, v_G)
% 103.78/13.81  	],
% 103.78/13.81  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 103.78/13.81  
% 103.78/13.81  % SZS output end IncompleteProof
%------------------------------------------------------------------------------