↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : CAT007-1 : 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 : n029.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 : Fri Jul 15 00:03:26 EDT 2022

% Result   : Unsatisfiable 0.11s 0.36s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : CAT007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.33  % Computer : n029.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun May 29 23:13:43 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.36  % SZS status Unsatisfiable
% 0.11/0.36  % SZS output begin IncompleteProof
% 0.11/0.36  cnf(c0, axiom,
% 0.11/0.36  	~defined(a,b)).
% 0.11/0.36  cnf(c1, plain,
% 0.11/0.36  	~defined(a,b),
% 0.11/0.36  	inference(start, [], [c0])).
% 0.11/0.36  
% 0.11/0.36  cnf(c2, axiom,
% 0.11/0.36  	defined(X0,X1) | ~identity_map(X2) | ~defined(X2,X1) | ~defined(X0,X2)).
% 0.11/0.36  cnf(a0, assumption,
% 0.11/0.36  	a = X0).
% 0.11/0.36  cnf(a1, assumption,
% 0.11/0.36  	b = X1).
% 0.11/0.36  cnf(c3, plain,
% 0.11/0.36  	$false,
% 0.11/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.11/0.36  cnf(c4, plain,
% 0.11/0.36  	~identity_map(X2) | ~defined(X2,X1) | ~defined(X0,X2),
% 0.11/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.11/0.36  
% 0.11/0.36  cnf(c5, axiom,
% 0.11/0.36  	identity_map(domain(X3))).
% 0.11/0.36  cnf(a2, assumption,
% 0.11/0.36  	X2 = domain(X3)).
% 0.11/0.36  cnf(c6, plain,
% 0.11/0.36  	~defined(X2,X1) | ~defined(X0,X2),
% 0.11/0.36  	inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.11/0.36  cnf(c7, plain,
% 0.11/0.36  	$false,
% 0.11/0.36  	inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.11/0.36  
% 0.11/0.36  cnf(c8, axiom,
% 0.11/0.36  	defined(codomain(X4),X4)).
% 0.11/0.36  cnf(a3, assumption,
% 0.11/0.36  	X5 = X2).
% 0.11/0.36  cnf(a4, assumption,
% 0.11/0.36  	X6 = X1).
% 0.11/0.36  cnf(c9, plain,
% 0.11/0.36  	~defined(X0,X2),
% 0.11/0.36  	inference(lazy_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 0.11/0.36  cnf(c10, plain,
% 0.11/0.36  	$false,
% 0.11/0.36  	inference(lazy_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 0.11/0.36  cnf(c11, plain,
% 0.11/0.36  	codomain(X4) != X5 | X4 != X6,
% 0.11/0.36  	inference(lazy_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 0.11/0.36  
% 0.11/0.36  cnf(c12, axiom,
% 0.11/0.36  	domain(a) = codomain(b)).
% 0.11/0.36  cnf(a5, assumption,
% 0.11/0.36  	codomain(X4) = codomain(b)).
% 0.11/0.36  cnf(c13, plain,
% 0.11/0.36  	X4 != X6,
% 0.11/0.36  	inference(strict_function_extension, [assumptions([a5])], [c11, c12])).
% 0.11/0.36  cnf(c14, plain,
% 0.11/0.36  	$false,
% 0.11/0.36  	inference(strict_function_extension, [assumptions([a5])], [c11, c12])).
% 0.11/0.36  cnf(c15, plain,
% 0.11/0.36  	X7 != domain(a) | X7 != X5,
% 0.11/0.36  	inference(strict_function_extension, [assumptions([a5])], [c11, c12])).
% 0.11/0.36  
% 0.11/0.36  cnf(a6, assumption,
% 0.11/0.36  	X7 = domain(a)).
% 0.11/0.36  cnf(c16, plain,
% 0.11/0.36  	X7 != X5,
% 0.11/0.36  	inference(reflexivity, [assumptions([a6])], [c15])).
% 0.11/0.36  
% 0.11/0.36  cnf(a7, assumption,
% 0.11/0.36  	X7 = X5).
% 0.11/0.36  cnf(c17, plain,
% 0.11/0.36  	$false,
% 0.11/0.36  	inference(reflexivity, [assumptions([a7])], [c16])).
% 0.11/0.36  
% 0.11/0.36  cnf(a8, assumption,
% 0.11/0.36  	X4 = X6).
% 0.11/0.36  cnf(c18, plain,
% 0.11/0.36  	$false,
% 0.11/0.36  	inference(reflexivity, [assumptions([a8])], [c13])).
% 0.11/0.36  
% 0.11/0.36  cnf(c19, axiom,
% 0.11/0.36  	defined(X8,domain(X8))).
% 0.11/0.36  cnf(a9, assumption,
% 0.11/0.36  	X0 = X8).
% 0.11/0.36  cnf(a10, assumption,
% 0.11/0.36  	X2 = domain(X8)).
% 0.11/0.36  cnf(c20, plain,
% 0.11/0.36  	$false,
% 0.11/0.36  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c9, c19])).
% 0.11/0.36  cnf(c21, plain,
% 0.11/0.36  	$false,
% 0.11/0.36  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c9, c19])).
% 0.11/0.36  
% 0.11/0.36  cnf(c22, plain,
% 0.11/0.36  	$false,
% 0.11/0.36  	inference(constraint_solving, [
% 0.11/0.36  		bind(X0, a),
% 0.11/0.36  		bind(X1, b),
% 0.11/0.36  		bind(X2, domain(X3)),
% 0.11/0.36  		bind(X3, a),
% 0.11/0.36  		bind(X4, b),
% 0.11/0.36  		bind(X5, domain(X3)),
% 0.11/0.36  		bind(X6, b),
% 0.11/0.36  		bind(X7, domain(a)),
% 0.11/0.36  		bind(X8, a)
% 0.11/0.36  	],
% 0.11/0.36  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.11/0.36  
% 0.11/0.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------