↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : CAT009-4 : 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 : n023.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:27 EDT 2022

% Result   : Unsatisfiable 237.78s 30.52s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : CAT009-4 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35  % Computer : n023.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 : Sun May 29 19:52:42 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 237.78/30.52  % SZS status Unsatisfiable
% 237.78/30.52  % SZS output begin IncompleteProof
% 237.78/30.52  cnf(c0, axiom,
% 237.78/30.52  	domain(compose(a,b)) != domain(b)).
% 237.78/30.52  cnf(c1, plain,
% 237.78/30.52  	domain(compose(a,b)) != domain(b),
% 237.78/30.52  	inference(start, [], [c0])).
% 237.78/30.52  
% 237.78/30.52  cnf(c2, axiom,
% 237.78/30.52  	domain(X0) = codomain(X1) | ~there_exists(compose(X0,X1))).
% 237.78/30.52  cnf(a0, assumption,
% 237.78/30.52  	domain(compose(a,b)) = domain(X0)).
% 237.78/30.52  cnf(c3, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 237.78/30.52  cnf(c4, plain,
% 237.78/30.52  	~there_exists(compose(X0,X1)),
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 237.78/30.52  cnf(c5, plain,
% 237.78/30.52  	X2 != codomain(X1) | X2 != domain(b),
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 237.78/30.52  
% 237.78/30.52  cnf(c6, axiom,
% 237.78/30.52  	domain(X3) = codomain(X4) | ~there_exists(compose(X3,X4))).
% 237.78/30.52  cnf(a1, assumption,
% 237.78/30.52  	codomain(X1) = codomain(X4)).
% 237.78/30.52  cnf(c7, plain,
% 237.78/30.52  	X2 != domain(b),
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 237.78/30.52  cnf(c8, plain,
% 237.78/30.52  	~there_exists(compose(X3,X4)),
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 237.78/30.52  cnf(c9, plain,
% 237.78/30.52  	X5 != domain(X3) | X2 != X5,
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 237.78/30.52  
% 237.78/30.52  cnf(a2, assumption,
% 237.78/30.52  	X5 = domain(X3)).
% 237.78/30.52  cnf(c10, plain,
% 237.78/30.52  	X2 != X5,
% 237.78/30.52  	inference(reflexivity, [assumptions([a2])], [c9])).
% 237.78/30.52  
% 237.78/30.52  cnf(a3, assumption,
% 237.78/30.52  	X2 = X5).
% 237.78/30.52  cnf(c11, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(reflexivity, [assumptions([a3])], [c10])).
% 237.78/30.52  
% 237.78/30.52  cnf(c12, axiom,
% 237.78/30.52  	there_exists(X6) | ~there_exists(codomain(X6))).
% 237.78/30.52  cnf(a4, assumption,
% 237.78/30.52  	compose(X3,X4) = X6).
% 237.78/30.52  cnf(c13, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])).
% 237.78/30.52  cnf(c14, plain,
% 237.78/30.52  	~there_exists(codomain(X6)),
% 237.78/30.52  	inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])).
% 237.78/30.52  
% 237.78/30.52  cnf(c15, axiom,
% 237.78/30.52  	domain(X7) = codomain(X8) | ~there_exists(compose(X7,X8))).
% 237.78/30.52  cnf(a5, assumption,
% 237.78/30.52  	codomain(X6) = codomain(X8)).
% 237.78/30.52  cnf(c16, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a5])], [c14, c15])).
% 237.78/30.52  cnf(c17, plain,
% 237.78/30.52  	~there_exists(compose(X7,X8)),
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a5])], [c14, c15])).
% 237.78/30.52  cnf(c18, plain,
% 237.78/30.52  	X9 != domain(X7) | ~there_exists(X9),
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a5])], [c14, c15])).
% 237.78/30.52  
% 237.78/30.52  cnf(a6, assumption,
% 237.78/30.52  	X9 = domain(X7)).
% 237.78/30.52  cnf(c19, plain,
% 237.78/30.52  	~there_exists(X9),
% 237.78/30.52  	inference(reflexivity, [assumptions([a6])], [c18])).
% 237.78/30.52  
% 237.78/30.52  cnf(c20, axiom,
% 237.78/30.52  	there_exists(domain(X10)) | ~there_exists(compose(X10,X11))).
% 237.78/30.52  cnf(a7, assumption,
% 237.78/30.52  	X9 = domain(X10)).
% 237.78/30.52  cnf(c21, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(strict_predicate_extension, [assumptions([a7])], [c19, c20])).
% 237.78/30.52  cnf(c22, plain,
% 237.78/30.52  	~there_exists(compose(X10,X11)),
% 237.78/30.52  	inference(strict_predicate_extension, [assumptions([a7])], [c19, c20])).
% 237.78/30.52  
% 237.78/30.52  cnf(c23, axiom,
% 237.78/30.52  	compose(X12,compose(X13,X14)) = compose(compose(X12,X13),X14)).
% 237.78/30.52  cnf(a8, assumption,
% 237.78/30.52  	compose(X10,X11) = compose(X12,compose(X13,X14))).
% 237.78/30.52  cnf(c24, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a8])], [c22, c23])).
% 237.78/30.52  cnf(c25, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a8])], [c22, c23])).
% 237.78/30.52  cnf(c26, plain,
% 237.78/30.52  	X15 != compose(compose(X12,X13),X14) | ~there_exists(X15),
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a8])], [c22, c23])).
% 237.78/30.52  
% 237.78/30.52  cnf(c27, axiom,
% 237.78/30.52  	compose(X16,domain(X16)) = X16).
% 237.78/30.52  cnf(a9, assumption,
% 237.78/30.52  	compose(compose(X12,X13),X14) = compose(X16,domain(X16))).
% 237.78/30.52  cnf(c28, plain,
% 237.78/30.52  	~there_exists(X15),
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a9])], [c26, c27])).
% 237.78/30.52  cnf(c29, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a9])], [c26, c27])).
% 237.78/30.52  cnf(c30, plain,
% 237.78/30.52  	X17 != X16 | X15 != X17,
% 237.78/30.52  	inference(strict_function_extension, [assumptions([a9])], [c26, c27])).
% 237.78/30.52  
% 237.78/30.52  cnf(a10, assumption,
% 237.78/30.52  	X17 = X16).
% 237.78/30.52  cnf(c31, plain,
% 237.78/30.52  	X15 != X17,
% 237.78/30.52  	inference(reflexivity, [assumptions([a10])], [c30])).
% 237.78/30.52  
% 237.78/30.52  cnf(a11, assumption,
% 237.78/30.52  	X15 = X17).
% 237.78/30.52  cnf(c32, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(reflexivity, [assumptions([a11])], [c31])).
% 237.78/30.52  
% 237.78/30.52  cnf(c33, axiom,
% 237.78/30.52  	there_exists(compose(a,b))).
% 237.78/30.52  cnf(a12, assumption,
% 237.78/30.52  	X15 = compose(a,b)).
% 237.78/30.52  cnf(c34, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(strict_predicate_extension, [assumptions([a12])], [c28, c33])).
% 237.78/30.52  cnf(c35, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(strict_predicate_extension, [assumptions([a12])], [c28, c33])).
% 237.78/30.52  
% 237.78/30.52  cnf(c36, plain,
% 237.78/30.52  	there_exists(compose(X10,X11))).
% 237.78/30.52  cnf(a13, assumption,
% 237.78/30.52  	compose(X7,X8) = compose(X10,X11)).
% 237.78/30.52  cnf(c37, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(predicate_reduction, [assumptions([a13])], [c17, c36])).
% 237.78/30.52  
% 237.78/30.52  cnf(a14, assumption,
% 237.78/30.52  	X2 = domain(b)).
% 237.78/30.52  cnf(c38, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(reflexivity, [assumptions([a14])], [c7])).
% 237.78/30.52  
% 237.78/30.52  cnf(c39, plain,
% 237.78/30.52  	X15 = compose(compose(X12,X13),X14)).
% 237.78/30.52  cnf(a15, assumption,
% 237.78/30.52  	compose(X0,X1) = compose(compose(X12,X13),X14)).
% 237.78/30.52  cnf(c40, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(equality_reduction, [assumptions([a15])], [c4, c39])).
% 237.78/30.52  cnf(c41, plain,
% 237.78/30.52  	~there_exists(X15),
% 237.78/30.52  	inference(equality_reduction, [assumptions([a15])], [c4, c39])).
% 237.78/30.52  
% 237.78/30.52  cnf(c42, plain,
% 237.78/30.52  	there_exists(X15)).
% 237.78/30.52  cnf(a16, assumption,
% 237.78/30.52  	X15 = X15).
% 237.78/30.52  cnf(c43, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(predicate_reduction, [assumptions([a16])], [c41, c42])).
% 237.78/30.52  
% 237.78/30.52  cnf(c44, plain,
% 237.78/30.52  	$false,
% 237.78/30.52  	inference(constraint_solving, [
% 237.78/30.52  		bind(X0, compose(a,b)),
% 237.78/30.52  		bind(X1, domain(X16)),
% 237.78/30.52  		bind(X2, domain(X3)),
% 237.78/30.52  		bind(X3, b),
% 237.78/30.52  		bind(X4, domain(X16)),
% 237.78/30.52  		bind(X5, domain(X3)),
% 237.78/30.52  		bind(X6, compose(X3,X4)),
% 237.78/30.52  		bind(X7, a),
% 237.78/30.52  		bind(X8, compose(X3,X4)),
% 237.78/30.52  		bind(X9, domain(X7)),
% 237.78/30.52  		bind(X10, a),
% 237.78/30.52  		bind(X11, compose(X13,X14)),
% 237.78/30.52  		bind(X12, a),
% 237.78/30.52  		bind(X13, b),
% 237.78/30.52  		bind(X14, domain(X16)),
% 237.78/30.52  		bind(X15, compose(X12,X13)),
% 237.78/30.52  		bind(X16, compose(X12,X13)),
% 237.78/30.52  		bind(X17, compose(X12,X13))
% 237.78/30.52  	],
% 237.78/30.52  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 237.78/30.52  
% 237.78/30.52  % SZS output end IncompleteProof
%------------------------------------------------------------------------------