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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n029.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 : Sun Jul 17 22:49:51 EDT 2022

% Result   : Theorem 2.36s 0.64s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jul  1 16:52:09 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.36/0.64  % SZS status Theorem
% 2.36/0.64  % SZS output begin IncompleteProof
% 2.36/0.64  cnf(c0, axiom,
% 2.36/0.64  	~goal).
% 2.36/0.64  cnf(c1, plain,
% 2.36/0.64  	~goal,
% 2.36/0.64  	inference(start, [], [c0])).
% 2.36/0.64  
% 2.36/0.64  cnf(c2, axiom,
% 2.36/0.64  	goal | ~p(X0) | ~less(X1,X0) | ~p(X1)).
% 2.36/0.64  cnf(c3, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(strict_predicate_extension, [], [c1, c2])).
% 2.36/0.64  cnf(c4, plain,
% 2.36/0.64  	~p(X0) | ~less(X1,X0) | ~p(X1),
% 2.36/0.64  	inference(strict_predicate_extension, [], [c1, c2])).
% 2.36/0.64  
% 2.36/0.64  cnf(c5, axiom,
% 2.36/0.64  	p(sK0(X2)) | p(X2)).
% 2.36/0.64  cnf(a0, assumption,
% 2.36/0.64  	X0 = sK0(X2)).
% 2.36/0.64  cnf(c6, plain,
% 2.36/0.64  	~less(X1,X0) | ~p(X1),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 2.36/0.64  cnf(c7, plain,
% 2.36/0.64  	p(X2),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 2.36/0.64  
% 2.36/0.64  cnf(c8, axiom,
% 2.36/0.64  	goal | ~p(X3) | ~less(X4,X3) | ~p(X4)).
% 2.36/0.64  cnf(a1, assumption,
% 2.36/0.64  	X2 = X3).
% 2.36/0.64  cnf(c9, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 2.36/0.64  cnf(c10, plain,
% 2.36/0.64  	goal | ~less(X4,X3) | ~p(X4),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 2.36/0.64  
% 2.36/0.64  cnf(c11, plain,
% 2.36/0.64  	~goal).
% 2.36/0.64  cnf(c12, plain,
% 2.36/0.64  	~less(X4,X3) | ~p(X4),
% 2.36/0.64  	inference(predicate_reduction, [], [c10, c11])).
% 2.36/0.64  
% 2.36/0.64  cnf(c13, axiom,
% 2.36/0.64  	less(X5,sK1(X5))).
% 2.36/0.64  cnf(a2, assumption,
% 2.36/0.64  	X4 = X5).
% 2.36/0.64  cnf(a3, assumption,
% 2.36/0.64  	X3 = sK1(X5)).
% 2.36/0.64  cnf(c14, plain,
% 2.36/0.64  	~p(X4),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c12, c13])).
% 2.36/0.64  cnf(c15, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c12, c13])).
% 2.36/0.64  
% 2.36/0.64  cnf(c16, axiom,
% 2.36/0.64  	p(sK0(X6)) | p(X6)).
% 2.36/0.64  cnf(a4, assumption,
% 2.36/0.64  	X4 = X6).
% 2.36/0.64  cnf(c17, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a4])], [c14, c16])).
% 2.36/0.64  cnf(c18, plain,
% 2.36/0.64  	p(sK0(X6)),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a4])], [c14, c16])).
% 2.36/0.64  
% 2.36/0.64  cnf(c19, axiom,
% 2.36/0.64  	goal | ~p(X7) | ~less(X8,X7) | ~p(X8)).
% 2.36/0.64  cnf(a5, assumption,
% 2.36/0.64  	sK0(X6) = X8).
% 2.36/0.64  cnf(c20, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a5])], [c18, c19])).
% 2.36/0.64  cnf(c21, plain,
% 2.36/0.64  	goal | ~p(X7) | ~less(X8,X7),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a5])], [c18, c19])).
% 2.36/0.64  
% 2.36/0.64  cnf(c22, plain,
% 2.36/0.64  	~goal).
% 2.36/0.64  cnf(c23, plain,
% 2.36/0.64  	~p(X7) | ~less(X8,X7),
% 2.36/0.64  	inference(predicate_reduction, [], [c21, c22])).
% 2.36/0.64  
% 2.36/0.64  cnf(c24, axiom,
% 2.36/0.64  	less(X9,sK0(X9)) | p(X9)).
% 2.36/0.64  cnf(a6, assumption,
% 2.36/0.64  	X7 = X9).
% 2.36/0.64  cnf(c25, plain,
% 2.36/0.64  	~less(X8,X7),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a6])], [c23, c24])).
% 2.36/0.64  cnf(c26, plain,
% 2.36/0.64  	less(X9,sK0(X9)),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a6])], [c23, c24])).
% 2.36/0.64  
% 2.36/0.64  cnf(c27, axiom,
% 2.36/0.64  	less(X10,X11) | ~less(X12,X11) | ~less(X10,X12)).
% 2.36/0.64  cnf(a7, assumption,
% 2.36/0.64  	X9 = X12).
% 2.36/0.64  cnf(a8, assumption,
% 2.36/0.64  	sK0(X9) = X11).
% 2.36/0.64  cnf(c28, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c26, c27])).
% 2.36/0.64  cnf(c29, plain,
% 2.36/0.64  	less(X10,X11) | ~less(X10,X12),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c26, c27])).
% 2.36/0.64  
% 2.36/0.64  cnf(c30, axiom,
% 2.36/0.64  	goal | ~p(X13) | ~less(X14,X13) | ~p(X14)).
% 2.36/0.64  cnf(a9, assumption,
% 2.36/0.64  	X10 = X14).
% 2.36/0.64  cnf(a10, assumption,
% 2.36/0.64  	X11 = X13).
% 2.36/0.64  cnf(c31, plain,
% 2.36/0.64  	~less(X10,X12),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c29, c30])).
% 2.36/0.64  cnf(c32, plain,
% 2.36/0.64  	goal | ~p(X13) | ~p(X14),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c29, c30])).
% 2.36/0.64  
% 2.36/0.64  cnf(c33, plain,
% 2.36/0.64  	~goal).
% 2.36/0.64  cnf(c34, plain,
% 2.36/0.64  	~p(X13) | ~p(X14),
% 2.36/0.64  	inference(predicate_reduction, [], [c32, c33])).
% 2.36/0.64  
% 2.36/0.64  cnf(c35, axiom,
% 2.36/0.64  	p(sK0(X15)) | p(X15)).
% 2.36/0.64  cnf(a11, assumption,
% 2.36/0.64  	X13 = sK0(X15)).
% 2.36/0.64  cnf(c36, plain,
% 2.36/0.64  	~p(X14),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 2.36/0.64  cnf(c37, plain,
% 2.36/0.64  	p(X15),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 2.36/0.64  
% 2.36/0.64  cnf(c38, plain,
% 2.36/0.64  	~p(X7)).
% 2.36/0.64  cnf(a12, assumption,
% 2.36/0.64  	X15 = X7).
% 2.36/0.64  cnf(c39, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(predicate_reduction, [assumptions([a12])], [c37, c38])).
% 2.36/0.64  
% 2.36/0.64  cnf(c40, plain,
% 2.36/0.64  	p(sK0(X6))).
% 2.36/0.64  cnf(a13, assumption,
% 2.36/0.64  	X14 = sK0(X6)).
% 2.36/0.64  cnf(c41, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(predicate_reduction, [assumptions([a13])], [c36, c40])).
% 2.36/0.64  
% 2.36/0.64  cnf(c42, axiom,
% 2.36/0.64  	less(X16,sK1(X16))).
% 2.36/0.64  cnf(a14, assumption,
% 2.36/0.64  	X10 = X16).
% 2.36/0.64  cnf(a15, assumption,
% 2.36/0.64  	X12 = sK1(X16)).
% 2.36/0.64  cnf(c43, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c31, c42])).
% 2.36/0.64  cnf(c44, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c31, c42])).
% 2.36/0.64  
% 2.36/0.64  cnf(c45, plain,
% 2.36/0.64  	less(X10,X12)).
% 2.36/0.64  cnf(a16, assumption,
% 2.36/0.64  	X8 = X10).
% 2.36/0.64  cnf(a17, assumption,
% 2.36/0.64  	X7 = X12).
% 2.36/0.64  cnf(c46, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(predicate_reduction, [assumptions([a16, a17])], [c25, c45])).
% 2.36/0.64  
% 2.36/0.64  cnf(c47, axiom,
% 2.36/0.64  	less(X17,X18) | ~less(X19,X18) | ~less(X17,X19)).
% 2.36/0.64  cnf(a18, assumption,
% 2.36/0.64  	X1 = X17).
% 2.36/0.64  cnf(a19, assumption,
% 2.36/0.64  	X0 = X18).
% 2.36/0.64  cnf(c48, plain,
% 2.36/0.64  	~p(X1),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c6, c47])).
% 2.36/0.64  cnf(c49, plain,
% 2.36/0.64  	~less(X19,X18) | ~less(X17,X19),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c6, c47])).
% 2.36/0.64  
% 2.36/0.64  cnf(c50, axiom,
% 2.36/0.64  	less(X20,sK0(X20)) | p(X20)).
% 2.36/0.64  cnf(a20, assumption,
% 2.36/0.64  	X19 = X20).
% 2.36/0.64  cnf(a21, assumption,
% 2.36/0.64  	X18 = sK0(X20)).
% 2.36/0.64  cnf(c51, plain,
% 2.36/0.64  	~less(X17,X19),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a20, a21])], [c49, c50])).
% 2.36/0.64  cnf(c52, plain,
% 2.36/0.64  	p(X20),
% 2.36/0.64  	inference(strict_predicate_extension, [assumptions([a20, a21])], [c49, c50])).
% 2.36/0.64  
% 2.36/0.64  cnf(c53, plain,
% 2.36/0.64  	~p(X2)).
% 2.36/0.64  cnf(a22, assumption,
% 2.36/0.64  	X20 = X2).
% 2.36/0.64  cnf(c54, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(predicate_reduction, [assumptions([a22])], [c52, c53])).
% 2.36/0.64  
% 2.36/0.64  cnf(c55, plain,
% 2.36/0.64  	less(X4,X3)).
% 2.36/0.64  cnf(a23, assumption,
% 2.36/0.64  	X17 = X4).
% 2.36/0.64  cnf(a24, assumption,
% 2.36/0.64  	X19 = X3).
% 2.36/0.64  cnf(c56, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(predicate_reduction, [assumptions([a23, a24])], [c51, c55])).
% 2.36/0.64  
% 2.36/0.64  cnf(c57, plain,
% 2.36/0.64  	p(X4)).
% 2.36/0.64  cnf(a25, assumption,
% 2.36/0.64  	X1 = X4).
% 2.36/0.64  cnf(c58, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(predicate_reduction, [assumptions([a25])], [c48, c57])).
% 2.36/0.64  
% 2.36/0.64  cnf(c59, plain,
% 2.36/0.64  	$false,
% 2.36/0.64  	inference(constraint_solving, [
% 2.36/0.64  		bind(X0, sK0(X2)),
% 2.36/0.64  		bind(X1, X5),
% 2.36/0.64  		bind(X2, sK1(X5)),
% 2.36/0.64  		bind(X3, sK1(X5)),
% 2.36/0.64  		bind(X4, X5),
% 2.36/0.64  		bind(X5, X5),
% 2.36/0.64  		bind(X6, X5),
% 2.36/0.64  		bind(X7, sK1(X16)),
% 2.36/0.64  		bind(X8, sK0(X6)),
% 2.36/0.64  		bind(X9, sK1(X16)),
% 2.36/0.64  		bind(X10, sK0(X6)),
% 2.36/0.64  		bind(X11, sK0(X9)),
% 2.36/0.64  		bind(X12, sK1(X16)),
% 2.36/0.64  		bind(X13, sK0(X9)),
% 2.36/0.64  		bind(X14, sK0(X6)),
% 2.36/0.64  		bind(X15, sK1(X16)),
% 2.36/0.64  		bind(X16, sK0(X6)),
% 2.36/0.64  		bind(X17, X5),
% 2.36/0.64  		bind(X18, sK0(X2)),
% 2.36/0.64  		bind(X19, sK1(X5)),
% 2.36/0.64  		bind(X20, sK1(X5))
% 2.36/0.64  	],
% 2.36/0.64  	[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])).
% 2.36/0.64  
% 2.36/0.64  % SZS output end IncompleteProof
%------------------------------------------------------------------------------