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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SWV284-1 : 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 : Wed Jul 20 19:46:13 EDT 2022

% Result   : Unsatisfiable 75.89s 11.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SWV284-1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35  % Computer : n021.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 : Wed Jun 15 20:32:29 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 75.89/11.39  % SZS status Unsatisfiable
% 75.89/11.39  % SZS output begin IncompleteProof
% 75.89/11.39  cnf(c0, axiom,
% 75.89/11.39  	c_lessequals(X0,v_x(X0),tc_nat)).
% 75.89/11.39  cnf(c1, plain,
% 75.89/11.39  	c_lessequals(X0,v_x(X0),tc_nat),
% 75.89/11.39  	inference(start, [], [c0])).
% 75.89/11.39  
% 75.89/11.39  cnf(c2, axiom,
% 75.89/11.39  	c_lessequals(X1,X2,tc_nat) | ~c_lessequals(c_plus(X3,X1,tc_nat),X2,tc_nat)).
% 75.89/11.39  cnf(a0, assumption,
% 75.89/11.39  	X0 = c_plus(X3,X1,tc_nat)).
% 75.89/11.39  cnf(a1, assumption,
% 75.89/11.39  	v_x(X0) = X2).
% 75.89/11.39  cnf(a2, assumption,
% 75.89/11.39  	tc_nat = tc_nat).
% 75.89/11.39  cnf(c3, plain,
% 75.89/11.39  	$false,
% 75.89/11.39  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 75.89/11.39  cnf(c4, plain,
% 75.89/11.39  	c_lessequals(X1,X2,tc_nat),
% 75.89/11.39  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 75.89/11.39  
% 75.89/11.39  cnf(c5, axiom,
% 75.89/11.39  	~c_lessequals(v_N,X4,tc_nat) | ~c_in(c_Message_Omsg_ONonce(X4),c_Event_Oused(v_list),tc_Message_Omsg)).
% 75.89/11.39  cnf(a3, assumption,
% 75.89/11.39  	X1 = v_N).
% 75.89/11.39  cnf(a4, assumption,
% 75.89/11.39  	X2 = X4).
% 75.89/11.39  cnf(a5, assumption,
% 75.89/11.39  	tc_nat = tc_nat).
% 75.89/11.39  cnf(c6, plain,
% 75.89/11.39  	$false,
% 75.89/11.39  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 75.89/11.39  cnf(c7, plain,
% 75.89/11.39  	~c_in(c_Message_Omsg_ONonce(X4),c_Event_Oused(v_list),tc_Message_Omsg),
% 75.89/11.39  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 75.89/11.39  
% 75.89/11.39  cnf(c8, axiom,
% 75.89/11.39  	c_in(c_Message_Omsg_ONonce(v_x(X5)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) | c_in(c_Message_Omsg_ONonce(v_x(X5)),c_Event_Oused(v_list),tc_Message_Omsg)).
% 75.89/11.39  cnf(a6, assumption,
% 75.89/11.39  	c_Message_Omsg_ONonce(X4) = c_Message_Omsg_ONonce(v_x(X5))).
% 75.89/11.39  cnf(a7, assumption,
% 75.89/11.39  	c_Event_Oused(v_list) = c_Event_Oused(v_list)).
% 75.89/11.39  cnf(a8, assumption,
% 75.89/11.39  	tc_Message_Omsg = tc_Message_Omsg).
% 75.89/11.39  cnf(c9, plain,
% 75.89/11.39  	$false,
% 75.89/11.39  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])).
% 75.89/11.39  cnf(c10, plain,
% 75.89/11.39  	c_in(c_Message_Omsg_ONonce(v_x(X5)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),
% 75.89/11.39  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])).
% 75.89/11.39  
% 75.89/11.39  cnf(c11, axiom,
% 75.89/11.39  	~c_lessequals(v_sko__upX(X6),X7,tc_nat) | ~c_in(c_Message_Omsg_ONonce(X7),c_Message_Oparts(c_insert(X6,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)).
% 75.89/11.39  cnf(a9, assumption,
% 75.89/11.39  	c_Message_Omsg_ONonce(v_x(X5)) = c_Message_Omsg_ONonce(X7)).
% 75.89/11.39  cnf(a10, assumption,
% 75.89/11.39  	c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)) = c_Message_Oparts(c_insert(X6,c_emptyset,tc_Message_Omsg))).
% 75.89/11.39  cnf(a11, assumption,
% 75.89/11.39  	tc_Message_Omsg = tc_Message_Omsg).
% 75.89/11.39  cnf(c12, plain,
% 75.89/11.39  	$false,
% 75.89/11.39  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c10, c11])).
% 75.89/11.39  cnf(c13, plain,
% 75.89/11.39  	~c_lessequals(v_sko__upX(X6),X7,tc_nat),
% 75.89/11.39  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c10, c11])).
% 75.89/11.39  
% 75.89/11.39  cnf(c14, axiom,
% 75.89/11.39  	c_lessequals(X8,X9,tc_nat) | ~c_lessequals(c_plus(X8,X10,tc_nat),X9,tc_nat)).
% 75.89/11.39  cnf(a12, assumption,
% 75.89/11.39  	v_sko__upX(X6) = X8).
% 75.89/11.39  cnf(a13, assumption,
% 75.89/11.39  	X7 = X9).
% 75.89/11.39  cnf(a14, assumption,
% 75.89/11.39  	tc_nat = tc_nat).
% 75.89/11.39  cnf(c15, plain,
% 75.89/11.39  	$false,
% 75.89/11.39  	inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c13, c14])).
% 75.89/11.39  cnf(c16, plain,
% 75.89/11.39  	~c_lessequals(c_plus(X8,X10,tc_nat),X9,tc_nat),
% 75.89/11.39  	inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c13, c14])).
% 75.89/11.39  
% 75.89/11.39  cnf(c17, plain,
% 75.89/11.39  	c_lessequals(X0,v_x(X0),tc_nat)).
% 75.89/11.39  cnf(a15, assumption,
% 75.89/11.39  	c_plus(X8,X10,tc_nat) = X0).
% 75.89/11.39  cnf(a16, assumption,
% 75.89/11.39  	X9 = v_x(X0)).
% 75.89/11.39  cnf(a17, assumption,
% 75.89/11.39  	tc_nat = tc_nat).
% 75.89/11.39  cnf(c18, plain,
% 75.89/11.39  	$false,
% 75.89/11.39  	inference(predicate_reduction, [assumptions([a15, a16, a17])], [c16, c17])).
% 75.89/11.39  
% 75.89/11.39  cnf(c19, plain,
% 75.89/11.39  	$false,
% 75.89/11.39  	inference(constraint_solving, [
% 75.89/11.39  		bind(X0, c_plus(X3,X1,tc_nat)),
% 75.89/11.39  		bind(X1, v_N),
% 75.89/11.39  		bind(X2, v_x(X0)),
% 75.89/11.39  		bind(X3, v_sko__upX(X6)),
% 75.89/11.39  		bind(X4, v_x(X0)),
% 75.89/11.39  		bind(X5, c_plus(X3,X1,tc_nat)),
% 75.89/11.39  		bind(X6, v_msg),
% 75.89/11.39  		bind(X7, v_x(X5)),
% 75.89/11.39  		bind(X8, v_sko__upX(X6)),
% 75.89/11.39  		bind(X9, v_x(X5)),
% 75.89/11.39  		bind(X10, v_N)
% 75.89/11.39  	],
% 75.89/11.39  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 75.89/11.39  
% 75.89/11.39  % SZS output end IncompleteProof
%------------------------------------------------------------------------------