↑ Up

lazyCoP---0.1.UNS-Ass.s

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

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET824-1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jul  9 23:41:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.39  % SZS status Unsatisfiable
% 0.20/0.39  % SZS output begin IncompleteProof
% 0.20/0.39  cnf(c0, axiom,
% 0.20/0.39  	c_in(v_a,X0,tc_IntDef_Oint)).
% 0.20/0.39  cnf(c1, plain,
% 0.20/0.39  	c_in(v_a,X0,tc_IntDef_Oint),
% 0.20/0.39  	inference(start, [], [c0])).
% 0.20/0.39  
% 0.20/0.39  cnf(c2, axiom,
% 0.20/0.39  	c_in(c_Pair(X1,X2,X3,X4),X5,tc_prod(X3,X4)) | ~c_in(X2,c_Relation_OImage(X5,c_insert(X1,c_emptyset,X3),X3,X4),X4)).
% 0.20/0.39  cnf(a0, assumption,
% 0.20/0.39  	v_a = X2).
% 0.20/0.39  cnf(a1, assumption,
% 0.20/0.39  	X0 = c_Relation_OImage(X5,c_insert(X1,c_emptyset,X3),X3,X4)).
% 0.20/0.39  cnf(a2, assumption,
% 0.20/0.39  	tc_IntDef_Oint = X4).
% 0.20/0.39  cnf(c3, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.20/0.39  cnf(c4, plain,
% 0.20/0.39  	c_in(c_Pair(X1,X2,X3,X4),X5,tc_prod(X3,X4)),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.20/0.39  
% 0.20/0.39  cnf(c5, axiom,
% 0.20/0.39  	~c_in(X6,c_emptyset,X7)).
% 0.20/0.39  cnf(a3, assumption,
% 0.20/0.39  	c_Pair(X1,X2,X3,X4) = X6).
% 0.20/0.39  cnf(a4, assumption,
% 0.20/0.39  	X5 = c_emptyset).
% 0.20/0.39  cnf(a5, assumption,
% 0.20/0.39  	tc_prod(X3,X4) = X7).
% 0.20/0.39  cnf(c6, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.20/0.39  cnf(c7, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.20/0.39  
% 0.20/0.39  cnf(c8, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(constraint_solving, [
% 0.20/0.39  		bind(X0, c_Relation_OImage(X5,c_insert(X1,c_emptyset,X3),X3,X4)),
% 0.20/0.39  		bind(X1, X1),
% 0.20/0.39  		bind(X2, v_a),
% 0.20/0.39  		bind(X3, X3),
% 0.20/0.39  		bind(X4, tc_IntDef_Oint),
% 0.20/0.39  		bind(X5, c_emptyset),
% 0.20/0.39  		bind(X6, c_Pair(X1,X2,X3,X4)),
% 0.20/0.39  		bind(X7, tc_prod(X3,X4))
% 0.20/0.39  	],
% 0.20/0.39  	[a0, a1, a2, a3, a4, a5])).
% 0.20/0.39  
% 0.20/0.39  % SZS output end IncompleteProof
%------------------------------------------------------------------------------