TSTP Solution File: SWV077+1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SWV077+1 : TPTP v8.1.0. Bugfixed v3.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 : 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 : Wed Jul 20 19:45:28 EDT 2022

% Result   : Theorem 3.31s 0.80s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV077+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jun 15 16:03:05 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 3.31/0.80  % SZS status Theorem
% 3.31/0.80  % SZS output begin IncompleteProof
% 3.31/0.80  cnf(c0, axiom,
% 3.31/0.80  	leq(n0,pv31)).
% 3.31/0.80  cnf(c1, plain,
% 3.31/0.80  	leq(n0,pv31),
% 3.31/0.80  	inference(start, [], [c0])).
% 3.31/0.80  
% 3.31/0.80  cnf(c2, axiom,
% 3.31/0.80  	~leq(pv31,minus(n5,n1)) | ~leq(n0,pv31) | ~sP14).
% 3.31/0.80  cnf(a0, assumption,
% 3.31/0.80  	n0 = n0).
% 3.31/0.80  cnf(a1, assumption,
% 3.31/0.80  	pv31 = pv31).
% 3.31/0.80  cnf(c3, plain,
% 3.31/0.80  	$false,
% 3.31/0.80  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 3.31/0.80  cnf(c4, plain,
% 3.31/0.80  	~leq(pv31,minus(n5,n1)) | ~sP14,
% 3.31/0.80  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 3.31/0.80  
% 3.31/0.80  cnf(c5, axiom,
% 3.31/0.80  	leq(pv31,minus(n5,n1))).
% 3.31/0.80  cnf(a2, assumption,
% 3.31/0.80  	pv31 = pv31).
% 3.31/0.80  cnf(a3, assumption,
% 3.31/0.80  	minus(n5,n1) = minus(n5,n1)).
% 3.31/0.80  cnf(c6, plain,
% 3.31/0.80  	~sP14,
% 3.31/0.80  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 3.31/0.80  cnf(c7, plain,
% 3.31/0.80  	$false,
% 3.31/0.80  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 3.31/0.80  
% 3.31/0.80  cnf(c8, axiom,
% 3.31/0.80  	~true | sP14 | ~leq(pv31,minus(n5,n1)) | ~leq(n0,pv31)).
% 3.31/0.80  cnf(c9, plain,
% 3.31/0.80  	$false,
% 3.31/0.80  	inference(strict_predicate_extension, [], [c6, c8])).
% 3.31/0.80  cnf(c10, plain,
% 3.31/0.80  	~true | ~leq(pv31,minus(n5,n1)) | ~leq(n0,pv31),
% 3.31/0.80  	inference(strict_predicate_extension, [], [c6, c8])).
% 3.31/0.80  
% 3.31/0.80  cnf(c11, axiom,
% 3.31/0.80  	true).
% 3.31/0.80  cnf(c12, plain,
% 3.31/0.80  	~leq(pv31,minus(n5,n1)) | ~leq(n0,pv31),
% 3.31/0.80  	inference(strict_predicate_extension, [], [c10, c11])).
% 3.31/0.80  cnf(c13, plain,
% 3.31/0.80  	$false,
% 3.31/0.80  	inference(strict_predicate_extension, [], [c10, c11])).
% 3.31/0.80  
% 3.31/0.80  cnf(c14, plain,
% 3.31/0.80  	leq(pv31,minus(n5,n1))).
% 3.31/0.80  cnf(a4, assumption,
% 3.31/0.80  	pv31 = pv31).
% 3.31/0.80  cnf(a5, assumption,
% 3.31/0.80  	minus(n5,n1) = minus(n5,n1)).
% 3.31/0.80  cnf(c15, plain,
% 3.31/0.80  	~leq(n0,pv31),
% 3.31/0.80  	inference(predicate_reduction, [assumptions([a4, a5])], [c12, c14])).
% 3.31/0.80  
% 3.31/0.80  cnf(c16, plain,
% 3.31/0.80  	leq(n0,pv31)).
% 3.31/0.80  cnf(a6, assumption,
% 3.31/0.80  	n0 = n0).
% 3.31/0.80  cnf(a7, assumption,
% 3.31/0.80  	pv31 = pv31).
% 3.31/0.80  cnf(c17, plain,
% 3.31/0.80  	$false,
% 3.31/0.80  	inference(predicate_reduction, [assumptions([a6, a7])], [c15, c16])).
% 3.31/0.80  
% 3.31/0.80  cnf(c18, plain,
% 3.31/0.80  	$false,
% 3.31/0.80  	inference(constraint_solving, [
% 3.31/0.80  		
% 3.31/0.80  	],
% 3.31/0.80  	[a0, a1, a2, a3, a4, a5, a6, a7])).
% 3.31/0.80  
% 3.31/0.80  % SZS output end IncompleteProof
%------------------------------------------------------------------------------