↑ Up

lazyCoP---0.1.THM-Ass.s

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

% Computer : n012.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:23 AM UTC 2026

% Result   : Theorem 5.39s 1.10s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : MGT086+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.02  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.03/0.29  % Computer : n012.cluster.edu
% 0.03/0.29  % Model    : x86_64 x86_64
% 0.03/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29  % Memory   : 8046.5625MB
% 0.03/0.29  % OS       : Linux 6.8.0-71-generic
% 0.03/0.29  % CPULimit : 300
% 0.03/0.29  % WCLimit  : 300
% 0.03/0.29  % DateTime : Mon Sep  7 14:19:56 UTC 2026
% 0.03/0.30  % CPUTime  : 
% 5.39/1.10  % SZS status Theorem
% 5.39/1.10  % SZS output begin IncompleteProof
% 5.39/1.10  cnf(c0, axiom,
% 5.39/1.10  	~in_lopen(X0,v0,v400) | in_lopen(X1,v0,v600) | ~in_lopen(X0,v0,v200) | ~leq(v800,X1)).
% 5.39/1.10  cnf(c1, plain,
% 5.39/1.10  	~in_lopen(X0,v0,v400) | in_lopen(X1,v0,v600) | ~in_lopen(X0,v0,v200) | ~leq(v800,X1),
% 5.39/1.10  	inference(start, [], [c0])).
% 5.39/1.10  
% 5.39/1.10  cnf(c2, axiom,
% 5.39/1.10  	in_lopen(X2,X3,X4) | ~leq(X2,X4) | ~less(X3,X2)).
% 5.39/1.10  cnf(a0, assumption,
% 5.39/1.10  	X0 = X2).
% 5.39/1.10  cnf(a1, assumption,
% 5.39/1.10  	v0 = X3).
% 5.39/1.10  cnf(a2, assumption,
% 5.39/1.10  	v400 = X4).
% 5.39/1.10  cnf(c3, plain,
% 5.39/1.10  	in_lopen(X1,v0,v600) | ~in_lopen(X0,v0,v200) | ~leq(v800,X1),
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 5.39/1.10  cnf(c4, plain,
% 5.39/1.10  	~leq(X2,X4) | ~less(X3,X2),
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 5.39/1.10  
% 5.39/1.10  cnf(c5, axiom,
% 5.39/1.10  	leq(X5,X6) | ~less(X5,X6)).
% 5.39/1.10  cnf(a3, assumption,
% 5.39/1.10  	X2 = X5).
% 5.39/1.10  cnf(a4, assumption,
% 5.39/1.10  	X4 = X6).
% 5.39/1.10  cnf(c6, plain,
% 5.39/1.10  	~less(X3,X2),
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 5.39/1.10  cnf(c7, plain,
% 5.39/1.10  	~less(X5,X6),
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 5.39/1.10  
% 5.39/1.10  cnf(c8, axiom,
% 5.39/1.10  	less(v200,v400)).
% 5.39/1.10  cnf(a5, assumption,
% 5.39/1.10  	X5 = v200).
% 5.39/1.10  cnf(a6, assumption,
% 5.39/1.10  	X6 = v400).
% 5.39/1.10  cnf(c9, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 5.39/1.10  cnf(c10, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 5.39/1.10  
% 5.39/1.10  cnf(c11, axiom,
% 5.39/1.10  	less(v0,v200)).
% 5.39/1.10  cnf(a7, assumption,
% 5.39/1.10  	X3 = v0).
% 5.39/1.10  cnf(a8, assumption,
% 5.39/1.10  	X2 = v200).
% 5.39/1.10  cnf(c12, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c6, c11])).
% 5.39/1.10  cnf(c13, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c6, c11])).
% 5.39/1.10  
% 5.39/1.10  cnf(c14, axiom,
% 5.39/1.10  	leq(X7,X8) | ~in_lopen(X7,X9,X8)).
% 5.39/1.10  cnf(a9, assumption,
% 5.39/1.10  	X1 = X7).
% 5.39/1.10  cnf(a10, assumption,
% 5.39/1.10  	v0 = X9).
% 5.39/1.10  cnf(a11, assumption,
% 5.39/1.10  	v600 = X8).
% 5.39/1.10  cnf(c15, plain,
% 5.39/1.10  	~in_lopen(X0,v0,v200) | ~leq(v800,X1),
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c3, c14])).
% 5.39/1.10  cnf(c16, plain,
% 5.39/1.10  	leq(X7,X8),
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c3, c14])).
% 5.39/1.10  
% 5.39/1.10  cnf(c17, axiom,
% 5.39/1.10  	less(X10,X11) | ~leq(X12,X11) | ~less(X10,X12)).
% 5.39/1.10  cnf(a12, assumption,
% 5.39/1.10  	X7 = X12).
% 5.39/1.10  cnf(a13, assumption,
% 5.39/1.10  	X8 = X11).
% 5.39/1.10  cnf(c18, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c16, c17])).
% 5.39/1.10  cnf(c19, plain,
% 5.39/1.10  	less(X10,X11) | ~less(X10,X12),
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c16, c17])).
% 5.39/1.10  
% 5.39/1.10  cnf(c20, axiom,
% 5.39/1.10  	~less(X13,X13)).
% 5.39/1.10  cnf(a14, assumption,
% 5.39/1.10  	X10 = X13).
% 5.39/1.10  cnf(a15, assumption,
% 5.39/1.10  	X11 = X13).
% 5.39/1.10  cnf(c21, plain,
% 5.39/1.10  	~less(X10,X12),
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c19, c20])).
% 5.39/1.10  cnf(c22, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c19, c20])).
% 5.39/1.10  
% 5.39/1.10  cnf(c23, axiom,
% 5.39/1.10  	less(v600,v800)).
% 5.39/1.10  cnf(a16, assumption,
% 5.39/1.10  	X10 = v600).
% 5.39/1.10  cnf(a17, assumption,
% 5.39/1.10  	X12 = v800).
% 5.39/1.10  cnf(c24, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c21, c23])).
% 5.39/1.10  cnf(c25, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c21, c23])).
% 5.39/1.10  
% 5.39/1.10  cnf(c26, axiom,
% 5.39/1.10  	in_lopen(X14,X15,X16) | ~leq(X14,X16) | ~less(X15,X14)).
% 5.39/1.10  cnf(a18, assumption,
% 5.39/1.10  	X0 = X14).
% 5.39/1.10  cnf(a19, assumption,
% 5.39/1.10  	v0 = X15).
% 5.39/1.10  cnf(a20, assumption,
% 5.39/1.10  	v200 = X16).
% 5.39/1.10  cnf(c27, plain,
% 5.39/1.10  	~leq(v800,X1),
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c15, c26])).
% 5.39/1.10  cnf(c28, plain,
% 5.39/1.10  	~leq(X14,X16) | ~less(X15,X14),
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c15, c26])).
% 5.39/1.10  
% 5.39/1.10  cnf(c29, axiom,
% 5.39/1.10  	leq(X17,X17)).
% 5.39/1.10  cnf(a21, assumption,
% 5.39/1.10  	X14 = X17).
% 5.39/1.10  cnf(a22, assumption,
% 5.39/1.10  	X16 = X17).
% 5.39/1.10  cnf(c30, plain,
% 5.39/1.10  	~less(X15,X14),
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a21, a22])], [c28, c29])).
% 5.39/1.10  cnf(c31, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a21, a22])], [c28, c29])).
% 5.39/1.10  
% 5.39/1.10  cnf(c32, plain,
% 5.39/1.10  	less(X3,X2)).
% 5.39/1.10  cnf(a23, assumption,
% 5.39/1.10  	X15 = X3).
% 5.39/1.10  cnf(a24, assumption,
% 5.39/1.10  	X14 = X2).
% 5.39/1.10  cnf(c33, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(predicate_reduction, [assumptions([a23, a24])], [c30, c32])).
% 5.39/1.10  
% 5.39/1.10  cnf(c34, axiom,
% 5.39/1.10  	leq(X18,X18)).
% 5.39/1.10  cnf(a25, assumption,
% 5.39/1.10  	v800 = X18).
% 5.39/1.10  cnf(a26, assumption,
% 5.39/1.10  	X1 = X18).
% 5.39/1.10  cnf(c35, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a25, a26])], [c27, c34])).
% 5.39/1.10  cnf(c36, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(strict_predicate_extension, [assumptions([a25, a26])], [c27, c34])).
% 5.39/1.10  
% 5.39/1.10  cnf(c37, plain,
% 5.39/1.10  	$false,
% 5.39/1.10  	inference(constraint_solving, [
% 5.39/1.10  		bind(X0, v200),
% 5.39/1.10  		bind(X1, v800),
% 5.39/1.10  		bind(X2, v200),
% 5.39/1.10  		bind(X3, v0),
% 5.39/1.10  		bind(X4, v400),
% 5.39/1.10  		bind(X5, v200),
% 5.39/1.10  		bind(X6, v400),
% 5.39/1.10  		bind(X7, v800),
% 5.39/1.10  		bind(X8, v600),
% 5.39/1.10  		bind(X9, v0),
% 5.39/1.10  		bind(X10, v600),
% 5.39/1.10  		bind(X11, v600),
% 5.39/1.10  		bind(X12, v800),
% 5.39/1.10  		bind(X13, v600),
% 5.39/1.10  		bind(X14, v200),
% 5.39/1.10  		bind(X15, v0),
% 5.39/1.10  		bind(X16, v200),
% 5.39/1.10  		bind(X17, v200),
% 5.39/1.10  		bind(X18, v800)
% 5.39/1.10  	],
% 5.39/1.10  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26])).
% 5.39/1.10  
% 5.39/1.10  % SZS output end IncompleteProof
%------------------------------------------------------------------------------