↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : TOP002-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n024.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 : Thu Jul 21 21:31:27 EDT 2022

% Result   : Unsatisfiable 0.14s 0.35s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : TOP002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n024.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 : Sun May 29 07:54:51 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.35  % SZS status Unsatisfiable
% 0.14/0.35  % SZS output begin IncompleteProof
% 0.14/0.35  cnf(c0, axiom,
% 0.14/0.35  	~element_of_collection(empty_set,top_of_basis(f))).
% 0.14/0.35  cnf(c1, plain,
% 0.14/0.35  	~element_of_collection(empty_set,top_of_basis(f)),
% 0.14/0.35  	inference(start, [], [c0])).
% 0.14/0.35  
% 0.14/0.35  cnf(c2, axiom,
% 0.14/0.35  	element_of_set(f11(X0,X1),X1) | element_of_collection(X1,top_of_basis(X0))).
% 0.14/0.35  cnf(a0, assumption,
% 0.14/0.35  	empty_set = X1).
% 0.14/0.35  cnf(a1, assumption,
% 0.14/0.35  	top_of_basis(f) = top_of_basis(X0)).
% 0.14/0.35  cnf(c3, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.35  cnf(c4, plain,
% 0.14/0.35  	element_of_set(f11(X0,X1),X1),
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.35  
% 0.14/0.35  cnf(c5, axiom,
% 0.14/0.35  	~element_of_set(X2,empty_set)).
% 0.14/0.35  cnf(a2, assumption,
% 0.14/0.35  	f11(X0,X1) = X2).
% 0.14/0.35  cnf(a3, assumption,
% 0.14/0.35  	X1 = empty_set).
% 0.14/0.35  cnf(c6, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.35  cnf(c7, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.35  
% 0.14/0.35  cnf(c8, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(constraint_solving, [
% 0.14/0.35  		bind(X0, f),
% 0.14/0.35  		bind(X1, empty_set),
% 0.14/0.35  		bind(X2, f11(X0,X1))
% 0.14/0.35  	],
% 0.14/0.35  	[a0, a1, a2, a3])).
% 0.14/0.35  
% 0.14/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------