↑ Up

lazyCoP---0.1.UNS-Ass.s

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

% Result   : Unsatisfiable 2.06s 0.60s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12  % Problem  : CAT018-1 : TPTP v8.1.0. Released v1.0.0.
% 0.09/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun May 29 16:04:39 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 2.06/0.60  % SZS status Unsatisfiable
% 2.06/0.60  % SZS output begin IncompleteProof
% 2.06/0.60  cnf(c0, axiom,
% 2.06/0.60  	~defined(a,compose(b,c))).
% 2.06/0.60  cnf(c1, plain,
% 2.06/0.60  	~defined(a,compose(b,c)),
% 2.06/0.60  	inference(start, [], [c0])).
% 2.06/0.60  
% 2.06/0.60  cnf(c2, axiom,
% 2.06/0.60  	defined(X0,X1) | ~identity_map(X2) | ~defined(X2,X1) | ~defined(X0,X2)).
% 2.06/0.60  cnf(a0, assumption,
% 2.06/0.60  	a = X0).
% 2.06/0.60  cnf(a1, assumption,
% 2.06/0.60  	compose(b,c) = X1).
% 2.06/0.60  cnf(c3, plain,
% 2.06/0.60  	$false,
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.06/0.60  cnf(c4, plain,
% 2.06/0.60  	~identity_map(X2) | ~defined(X2,X1) | ~defined(X0,X2),
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.06/0.60  
% 2.06/0.60  cnf(c5, axiom,
% 2.06/0.60  	identity_map(codomain(X3))).
% 2.06/0.60  cnf(a2, assumption,
% 2.06/0.60  	X2 = codomain(X3)).
% 2.06/0.60  cnf(c6, plain,
% 2.06/0.60  	~defined(X2,X1) | ~defined(X0,X2),
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 2.06/0.60  cnf(c7, plain,
% 2.06/0.60  	$false,
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 2.06/0.60  
% 2.06/0.60  cnf(c8, axiom,
% 2.06/0.60  	defined(X4,X5) | ~defined(X6,X7) | ~product(X8,X7,X5) | ~product(X4,X8,X6)).
% 2.06/0.60  cnf(a3, assumption,
% 2.06/0.60  	X2 = X4).
% 2.06/0.60  cnf(a4, assumption,
% 2.06/0.60  	X1 = X5).
% 2.06/0.60  cnf(c9, plain,
% 2.06/0.60  	~defined(X0,X2),
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 2.06/0.60  cnf(c10, plain,
% 2.06/0.60  	~defined(X6,X7) | ~product(X8,X7,X5) | ~product(X4,X8,X6),
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 2.06/0.60  
% 2.06/0.60  cnf(c11, axiom,
% 2.06/0.60  	defined(b,c)).
% 2.06/0.60  cnf(a5, assumption,
% 2.06/0.60  	X6 = b).
% 2.06/0.60  cnf(a6, assumption,
% 2.06/0.60  	X7 = c).
% 2.06/0.60  cnf(c12, plain,
% 2.06/0.60  	~product(X8,X7,X5) | ~product(X4,X8,X6),
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 2.06/0.60  cnf(c13, plain,
% 2.06/0.60  	$false,
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 2.06/0.60  
% 2.06/0.60  cnf(c14, axiom,
% 2.06/0.60  	product(X9,X10,compose(X9,X10)) | ~defined(X9,X10)).
% 2.06/0.60  cnf(a7, assumption,
% 2.06/0.60  	X8 = X9).
% 2.06/0.60  cnf(a8, assumption,
% 2.06/0.60  	X7 = X10).
% 2.06/0.60  cnf(a9, assumption,
% 2.06/0.60  	X5 = compose(X9,X10)).
% 2.06/0.60  cnf(c15, plain,
% 2.06/0.60  	~product(X4,X8,X6),
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c12, c14])).
% 2.06/0.60  cnf(c16, plain,
% 2.06/0.60  	~defined(X9,X10),
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c12, c14])).
% 2.06/0.60  
% 2.06/0.60  cnf(c17, plain,
% 2.06/0.60  	defined(X6,X7)).
% 2.06/0.60  cnf(a10, assumption,
% 2.06/0.60  	X9 = X6).
% 2.06/0.60  cnf(a11, assumption,
% 2.06/0.60  	X10 = X7).
% 2.06/0.60  cnf(c18, plain,
% 2.06/0.60  	$false,
% 2.06/0.60  	inference(predicate_reduction, [assumptions([a10, a11])], [c16, c17])).
% 2.06/0.60  
% 2.06/0.60  cnf(c19, axiom,
% 2.06/0.60  	product(codomain(X11),X11,X11)).
% 2.06/0.60  cnf(a12, assumption,
% 2.06/0.60  	X4 = codomain(X11)).
% 2.06/0.60  cnf(a13, assumption,
% 2.06/0.60  	X8 = X11).
% 2.06/0.60  cnf(a14, assumption,
% 2.06/0.60  	X6 = X11).
% 2.06/0.60  cnf(c20, plain,
% 2.06/0.60  	$false,
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c15, c19])).
% 2.06/0.60  cnf(c21, plain,
% 2.06/0.60  	$false,
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c15, c19])).
% 2.06/0.60  
% 2.06/0.60  cnf(c22, axiom,
% 2.06/0.60  	defined(X12,X13) | ~defined(X12,X14) | ~product(X13,X15,X14)).
% 2.06/0.60  cnf(a15, assumption,
% 2.06/0.60  	X0 = X12).
% 2.06/0.60  cnf(a16, assumption,
% 2.06/0.60  	X2 = X13).
% 2.06/0.60  cnf(c23, plain,
% 2.06/0.60  	$false,
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a15, a16])], [c9, c22])).
% 2.06/0.60  cnf(c24, plain,
% 2.06/0.60  	~defined(X12,X14) | ~product(X13,X15,X14),
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a15, a16])], [c9, c22])).
% 2.06/0.60  
% 2.06/0.60  cnf(c25, axiom,
% 2.06/0.60  	defined(a,b)).
% 2.06/0.60  cnf(a17, assumption,
% 2.06/0.60  	X12 = a).
% 2.06/0.60  cnf(a18, assumption,
% 2.06/0.60  	X14 = b).
% 2.06/0.60  cnf(c26, plain,
% 2.06/0.60  	~product(X13,X15,X14),
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c24, c25])).
% 2.06/0.60  cnf(c27, plain,
% 2.06/0.60  	$false,
% 2.06/0.60  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c24, c25])).
% 2.06/0.60  
% 2.06/0.60  cnf(c28, plain,
% 2.06/0.60  	product(X4,X8,X6)).
% 2.06/0.60  cnf(a19, assumption,
% 2.06/0.60  	X13 = X4).
% 2.06/0.60  cnf(a20, assumption,
% 2.06/0.60  	X15 = X8).
% 2.06/0.60  cnf(a21, assumption,
% 2.06/0.60  	X14 = X6).
% 2.06/0.60  cnf(c29, plain,
% 2.06/0.60  	$false,
% 2.06/0.60  	inference(predicate_reduction, [assumptions([a19, a20, a21])], [c26, c28])).
% 2.06/0.60  
% 2.06/0.60  cnf(c30, plain,
% 2.06/0.60  	$false,
% 2.06/0.60  	inference(constraint_solving, [
% 2.06/0.60  		bind(X0, a),
% 2.06/0.60  		bind(X1, compose(b,c)),
% 2.06/0.60  		bind(X2, codomain(X3)),
% 2.06/0.60  		bind(X3, b),
% 2.06/0.60  		bind(X4, codomain(X3)),
% 2.06/0.60  		bind(X5, compose(b,c)),
% 2.06/0.60  		bind(X6, b),
% 2.06/0.60  		bind(X7, c),
% 2.06/0.60  		bind(X8, b),
% 2.06/0.60  		bind(X9, b),
% 2.06/0.60  		bind(X10, c),
% 2.06/0.60  		bind(X11, b),
% 2.06/0.60  		bind(X12, a),
% 2.06/0.60  		bind(X13, codomain(X3)),
% 2.06/0.60  		bind(X14, b),
% 2.06/0.60  		bind(X15, b)
% 2.06/0.60  	],
% 2.06/0.60  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 2.06/0.60  
% 2.06/0.60  % SZS output end IncompleteProof
%------------------------------------------------------------------------------