↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : MGT073+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:13:22 AM UTC 2026

% Result   : Theorem 0.17s 0.46s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : MGT073+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.06  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.17/0.43  % Computer : n018.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Mon Sep  7 13:58:52 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.46  % SZS status Theorem
% 0.17/0.46  % SZS output begin IncompleteProof
% 0.17/0.46  cnf(c0, axiom,
% 0.17/0.46  	~in_closed(X0,n5,n10) | ~in_closed(X0,n0,n10)).
% 0.17/0.46  cnf(c1, plain,
% 0.17/0.46  	~in_closed(X0,n5,n10) | ~in_closed(X0,n0,n10),
% 0.17/0.46  	inference(start, [], [c0])).
% 0.17/0.46  
% 0.17/0.46  cnf(c2, axiom,
% 0.17/0.46  	in_closed(sK1(X1,X2,X3,X4),X3,X4) | ~axis_compatible(X1,X2,X3,X4)).
% 0.17/0.46  cnf(a0, assumption,
% 0.17/0.46  	X0 = sK1(X1,X2,X3,X4)).
% 0.17/0.46  cnf(a1, assumption,
% 0.17/0.46  	n5 = X3).
% 0.17/0.46  cnf(a2, assumption,
% 0.17/0.46  	n10 = X4).
% 0.17/0.46  cnf(c3, plain,
% 0.17/0.46  	~in_closed(X0,n0,n10),
% 0.17/0.46  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.17/0.46  cnf(c4, plain,
% 0.17/0.46  	~axis_compatible(X1,X2,X3,X4),
% 0.17/0.46  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.17/0.46  
% 0.17/0.46  cnf(c5, axiom,
% 0.17/0.46  	axis_compatible(n0,n10,n5,n10)).
% 0.17/0.46  cnf(a3, assumption,
% 0.17/0.46  	X1 = n0).
% 0.17/0.46  cnf(a4, assumption,
% 0.17/0.46  	X2 = n10).
% 0.17/0.46  cnf(a5, assumption,
% 0.17/0.46  	X3 = n5).
% 0.17/0.46  cnf(a6, assumption,
% 0.17/0.46  	X4 = n10).
% 0.17/0.46  cnf(c6, plain,
% 0.17/0.46  	$false,
% 0.17/0.46  	inference(strict_predicate_extension, [assumptions([a3, a4, a5, a6])], [c4, c5])).
% 0.17/0.46  cnf(c7, plain,
% 0.17/0.46  	$false,
% 0.17/0.46  	inference(strict_predicate_extension, [assumptions([a3, a4, a5, a6])], [c4, c5])).
% 0.17/0.46  
% 0.17/0.46  cnf(c8, axiom,
% 0.17/0.46  	in_closed(sK1(X5,X6,X7,X8),X5,X6) | ~axis_compatible(X5,X6,X7,X8)).
% 0.17/0.46  cnf(a7, assumption,
% 0.17/0.46  	X0 = sK1(X5,X6,X7,X8)).
% 0.17/0.46  cnf(a8, assumption,
% 0.17/0.46  	n0 = X5).
% 0.17/0.46  cnf(a9, assumption,
% 0.17/0.46  	n10 = X6).
% 0.17/0.46  cnf(c9, plain,
% 0.17/0.46  	$false,
% 0.17/0.46  	inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c3, c8])).
% 0.17/0.46  cnf(c10, plain,
% 0.17/0.46  	~axis_compatible(X5,X6,X7,X8),
% 0.17/0.46  	inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c3, c8])).
% 0.17/0.46  
% 0.17/0.46  cnf(c11, plain,
% 0.17/0.46  	axis_compatible(X1,X2,X3,X4)).
% 0.17/0.46  cnf(a10, assumption,
% 0.17/0.46  	X5 = X1).
% 0.17/0.46  cnf(a11, assumption,
% 0.17/0.46  	X6 = X2).
% 0.17/0.46  cnf(a12, assumption,
% 0.17/0.46  	X7 = X3).
% 0.17/0.46  cnf(a13, assumption,
% 0.17/0.46  	X8 = X4).
% 0.17/0.46  cnf(c12, plain,
% 0.17/0.46  	$false,
% 0.17/0.46  	inference(predicate_reduction, [assumptions([a10, a11, a12, a13])], [c10, c11])).
% 0.17/0.46  
% 0.17/0.46  cnf(c13, plain,
% 0.17/0.46  	$false,
% 0.17/0.46  	inference(constraint_solving, [
% 0.17/0.46  		bind(X0, sK1(X1,X2,X3,X4)),
% 0.17/0.46  		bind(X1, n0),
% 0.17/0.46  		bind(X2, n10),
% 0.17/0.46  		bind(X3, n5),
% 0.17/0.46  		bind(X4, n10),
% 0.17/0.46  		bind(X5, n0),
% 0.17/0.46  		bind(X6, n10),
% 0.17/0.46  		bind(X7, n5),
% 0.17/0.46  		bind(X8, n10)
% 0.17/0.46  	],
% 0.17/0.46  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 0.17/0.46  
% 0.17/0.46  % SZS output end IncompleteProof
%------------------------------------------------------------------------------