↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET820-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 : n017.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:19 EDT 2022

% Result   : Unsatisfiable 28.43s 4.05s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

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