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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SEU280+1 : TPTP v8.1.0. Released 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 : n022.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 : Tue Jul 19 11:54:42 EDT 2022

% Result   : Theorem 8.59s 1.43s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU280+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % 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 : Mon Jun 20 01:27:31 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 8.59/1.43  % SZS status Theorem
% 8.59/1.43  % SZS output begin IncompleteProof
% 8.59/1.43  cnf(c0, axiom,
% 8.59/1.43  	ordinal(sK4(X0)) | in(sK4(X0),X0)).
% 8.59/1.43  cnf(c1, plain,
% 8.59/1.43  	ordinal(sK4(X0)) | in(sK4(X0),X0),
% 8.59/1.43  	inference(start, [], [c0])).
% 8.59/1.43  
% 8.59/1.43  cnf(c2, axiom,
% 8.59/1.43  	~ordinal(sK4(X1)) | ~in(sK4(X1),sK3) | ~in(sK4(X1),X1)).
% 8.59/1.43  cnf(a0, assumption,
% 8.59/1.43  	sK4(X0) = sK4(X1)).
% 8.59/1.43  cnf(c3, plain,
% 8.59/1.43  	in(sK4(X0),X0),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 8.59/1.43  cnf(c4, plain,
% 8.59/1.43  	~in(sK4(X1),sK3) | ~in(sK4(X1),X1),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 8.59/1.43  
% 8.59/1.43  cnf(c5, axiom,
% 8.59/1.43  	in(sK4(X2),sK3) | in(sK4(X2),X2)).
% 8.59/1.43  cnf(a1, assumption,
% 8.59/1.43  	sK4(X1) = sK4(X2)).
% 8.59/1.43  cnf(a2, assumption,
% 8.59/1.43  	sK3 = sK3).
% 8.59/1.43  cnf(c6, plain,
% 8.59/1.43  	~in(sK4(X1),X1),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 8.59/1.43  cnf(c7, plain,
% 8.59/1.43  	in(sK4(X2),X2),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 8.59/1.43  
% 8.59/1.43  cnf(c8, axiom,
% 8.59/1.43  	sP0(X3,X4) | ~in(X3,sK6(X4)) | ~sP2(X4)).
% 8.59/1.43  cnf(a3, assumption,
% 8.59/1.43  	sK4(X2) = X3).
% 8.59/1.43  cnf(a4, assumption,
% 8.59/1.43  	X2 = sK6(X4)).
% 8.59/1.43  cnf(c9, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])).
% 8.59/1.43  cnf(c10, plain,
% 8.59/1.43  	sP0(X3,X4) | ~sP2(X4),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])).
% 8.59/1.43  
% 8.59/1.43  cnf(c11, axiom,
% 8.59/1.43  	sK10(X5,X6) = X5 | ~sP0(X5,X6)).
% 8.59/1.43  cnf(a5, assumption,
% 8.59/1.43  	X3 = X5).
% 8.59/1.43  cnf(a6, assumption,
% 8.59/1.43  	X4 = X6).
% 8.59/1.43  cnf(c12, plain,
% 8.59/1.43  	~sP2(X4),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 8.59/1.43  cnf(c13, plain,
% 8.59/1.43  	sK10(X5,X6) = X5,
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 8.59/1.43  
% 8.59/1.43  cnf(c14, axiom,
% 8.59/1.43  	in(sK10(X7,X8),X8) | ~sP0(X7,X8)).
% 8.59/1.43  cnf(a7, assumption,
% 8.59/1.43  	sK10(X7,X8) = sK10(X5,X6)).
% 8.59/1.43  cnf(c15, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(strict_subterm_extension, [assumptions([a7])], [c13, c14])).
% 8.59/1.43  cnf(c16, plain,
% 8.59/1.43  	~sP0(X7,X8),
% 8.59/1.43  	inference(strict_subterm_extension, [assumptions([a7])], [c13, c14])).
% 8.59/1.43  cnf(c17, plain,
% 8.59/1.43  	in(X5,X8),
% 8.59/1.43  	inference(strict_subterm_extension, [assumptions([a7])], [c13, c14])).
% 8.59/1.43  
% 8.59/1.43  cnf(c18, plain,
% 8.59/1.43  	~in(sK4(X1),sK3)).
% 8.59/1.43  cnf(a8, assumption,
% 8.59/1.43  	X5 = sK4(X1)).
% 8.59/1.43  cnf(a9, assumption,
% 8.59/1.43  	X8 = sK3).
% 8.59/1.43  cnf(c19, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(predicate_reduction, [assumptions([a8, a9])], [c17, c18])).
% 8.59/1.43  
% 8.59/1.43  cnf(c20, plain,
% 8.59/1.43  	sP0(X3,X4)).
% 8.59/1.43  cnf(a10, assumption,
% 8.59/1.43  	X7 = X3).
% 8.59/1.43  cnf(a11, assumption,
% 8.59/1.43  	X8 = X4).
% 8.59/1.43  cnf(c21, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(predicate_reduction, [assumptions([a10, a11])], [c16, c20])).
% 8.59/1.43  
% 8.59/1.43  cnf(c22, axiom,
% 8.59/1.43  	sP2(X9) | sP1).
% 8.59/1.43  cnf(a12, assumption,
% 8.59/1.43  	X4 = X9).
% 8.59/1.43  cnf(c23, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a12])], [c12, c22])).
% 8.59/1.43  cnf(c24, plain,
% 8.59/1.43  	sP1,
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a12])], [c12, c22])).
% 8.59/1.43  
% 8.59/1.43  cnf(c25, axiom,
% 8.59/1.43  	sK7 = sK8 | ~sP1).
% 8.59/1.43  cnf(c26, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(strict_predicate_extension, [], [c24, c25])).
% 8.59/1.43  cnf(c27, plain,
% 8.59/1.43  	sK7 = sK8,
% 8.59/1.43  	inference(strict_predicate_extension, [], [c24, c25])).
% 8.59/1.43  
% 8.59/1.43  cnf(c28, axiom,
% 8.59/1.43  	sK7 = sK9 | ~sP1).
% 8.59/1.43  cnf(a13, assumption,
% 8.59/1.43  	sK7 = sK7).
% 8.59/1.43  cnf(a14, assumption,
% 8.59/1.43  	sK8 = X10).
% 8.59/1.43  cnf(c29, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(strict_subterm_extension, [assumptions([a13, a14])], [c27, c28])).
% 8.59/1.43  cnf(c30, plain,
% 8.59/1.43  	~sP1,
% 8.59/1.43  	inference(strict_subterm_extension, [assumptions([a13, a14])], [c27, c28])).
% 8.59/1.43  cnf(c31, plain,
% 8.59/1.43  	X10 = sK9,
% 8.59/1.43  	inference(strict_subterm_extension, [assumptions([a13, a14])], [c27, c28])).
% 8.59/1.43  
% 8.59/1.43  cnf(c32, axiom,
% 8.59/1.43  	sK8 != sK9 | ~sP1).
% 8.59/1.43  cnf(a15, assumption,
% 8.59/1.43  	sK9 = sK9).
% 8.59/1.43  cnf(c33, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(strict_subterm_extension, [assumptions([a15])], [c31, c32])).
% 8.59/1.43  cnf(c34, plain,
% 8.59/1.43  	~sP1,
% 8.59/1.43  	inference(strict_subterm_extension, [assumptions([a15])], [c31, c32])).
% 8.59/1.43  cnf(c35, plain,
% 8.59/1.43  	sK8 != X10,
% 8.59/1.43  	inference(strict_subterm_extension, [assumptions([a15])], [c31, c32])).
% 8.59/1.43  
% 8.59/1.43  cnf(a16, assumption,
% 8.59/1.43  	sK8 = X10).
% 8.59/1.43  cnf(c36, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(reflexivity, [assumptions([a16])], [c35])).
% 8.59/1.43  
% 8.59/1.43  cnf(c37, plain,
% 8.59/1.43  	sP1).
% 8.59/1.43  cnf(c38, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(predicate_reduction, [], [c34, c37])).
% 8.59/1.43  
% 8.59/1.43  cnf(c39, plain,
% 8.59/1.43  	sP1).
% 8.59/1.43  cnf(c40, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(predicate_reduction, [], [c30, c39])).
% 8.59/1.43  
% 8.59/1.43  cnf(c41, axiom,
% 8.59/1.43  	in(X11,sK6(X12)) | ~sP0(X11,X12) | ~sP2(X12)).
% 8.59/1.43  cnf(a17, assumption,
% 8.59/1.43  	sK4(X1) = X11).
% 8.59/1.43  cnf(a18, assumption,
% 8.59/1.43  	X1 = sK6(X12)).
% 8.59/1.43  cnf(c42, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c6, c41])).
% 8.59/1.43  cnf(c43, plain,
% 8.59/1.43  	~sP0(X11,X12) | ~sP2(X12),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c6, c41])).
% 8.59/1.43  
% 8.59/1.43  cnf(c44, axiom,
% 8.59/1.43  	sP0(X13,X14) | ~ordinal(X13) | ~in(X13,X14)).
% 8.59/1.43  cnf(a19, assumption,
% 8.59/1.43  	X11 = X13).
% 8.59/1.43  cnf(a20, assumption,
% 8.59/1.43  	X12 = X14).
% 8.59/1.43  cnf(c45, plain,
% 8.59/1.43  	~sP2(X12),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c43, c44])).
% 8.59/1.43  cnf(c46, plain,
% 8.59/1.43  	~ordinal(X13) | ~in(X13,X14),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c43, c44])).
% 8.59/1.43  
% 8.59/1.43  cnf(c47, plain,
% 8.59/1.43  	ordinal(sK4(X0))).
% 8.59/1.43  cnf(a21, assumption,
% 8.59/1.43  	X13 = sK4(X0)).
% 8.59/1.43  cnf(c48, plain,
% 8.59/1.43  	~in(X13,X14),
% 8.59/1.43  	inference(predicate_reduction, [assumptions([a21])], [c46, c47])).
% 8.59/1.43  
% 8.59/1.43  cnf(c49, plain,
% 8.59/1.43  	in(sK4(X1),sK3)).
% 8.59/1.43  cnf(a22, assumption,
% 8.59/1.43  	X13 = sK4(X1)).
% 8.59/1.43  cnf(a23, assumption,
% 8.59/1.43  	X14 = sK3).
% 8.59/1.43  cnf(c50, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(predicate_reduction, [assumptions([a22, a23])], [c48, c49])).
% 8.59/1.43  
% 8.59/1.43  cnf(c51, plain,
% 8.59/1.43  	sP2(X4)).
% 8.59/1.43  cnf(a24, assumption,
% 8.59/1.43  	X12 = X4).
% 8.59/1.43  cnf(c52, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(predicate_reduction, [assumptions([a24])], [c45, c51])).
% 8.59/1.43  
% 8.59/1.43  cnf(c53, axiom,
% 8.59/1.43  	sP0(X15,X16) | ~in(X15,sK6(X16)) | ~sP2(X16)).
% 8.59/1.43  cnf(a25, assumption,
% 8.59/1.43  	sK4(X0) = X15).
% 8.59/1.43  cnf(a26, assumption,
% 8.59/1.43  	X0 = sK6(X16)).
% 8.59/1.43  cnf(c54, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a25, a26])], [c3, c53])).
% 8.59/1.43  cnf(c55, plain,
% 8.59/1.43  	sP0(X15,X16) | ~sP2(X16),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a25, a26])], [c3, c53])).
% 8.59/1.43  
% 8.59/1.43  cnf(c56, axiom,
% 8.59/1.43  	ordinal(X17) | ~sP0(X17,X18)).
% 8.59/1.43  cnf(a27, assumption,
% 8.59/1.43  	X15 = X17).
% 8.59/1.43  cnf(a28, assumption,
% 8.59/1.43  	X16 = X18).
% 8.59/1.43  cnf(c57, plain,
% 8.59/1.43  	~sP2(X16),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a27, a28])], [c55, c56])).
% 8.59/1.43  cnf(c58, plain,
% 8.59/1.43  	ordinal(X17),
% 8.59/1.43  	inference(strict_predicate_extension, [assumptions([a27, a28])], [c55, c56])).
% 8.59/1.43  
% 8.59/1.43  cnf(c59, plain,
% 8.59/1.43  	~ordinal(sK4(X0))).
% 8.59/1.43  cnf(a29, assumption,
% 8.59/1.43  	X17 = sK4(X0)).
% 8.59/1.43  cnf(c60, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(predicate_reduction, [assumptions([a29])], [c58, c59])).
% 8.59/1.43  
% 8.59/1.43  cnf(c61, plain,
% 8.59/1.43  	sP2(X4)).
% 8.59/1.43  cnf(a30, assumption,
% 8.59/1.43  	X16 = X4).
% 8.59/1.43  cnf(c62, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(predicate_reduction, [assumptions([a30])], [c57, c61])).
% 8.59/1.43  
% 8.59/1.43  cnf(c63, plain,
% 8.59/1.43  	$false,
% 8.59/1.43  	inference(constraint_solving, [
% 8.59/1.43  		bind(X0, sK6(X4)),
% 8.59/1.43  		bind(X1, sK6(X4)),
% 8.59/1.43  		bind(X2, sK6(X4)),
% 8.59/1.43  		bind(X3, sK4(X2)),
% 8.59/1.43  		bind(X4, sK3),
% 8.59/1.43  		bind(X5, sK4(X2)),
% 8.59/1.43  		bind(X6, sK3),
% 8.59/1.43  		bind(X7, sK4(X2)),
% 8.59/1.43  		bind(X8, sK3),
% 8.59/1.43  		bind(X9, sK3),
% 8.59/1.43  		bind(X10, sK8),
% 8.59/1.43  		bind(X11, sK4(X1)),
% 8.59/1.43  		bind(X12, sK3),
% 8.59/1.43  		bind(X13, sK4(X1)),
% 8.59/1.43  		bind(X14, sK3),
% 8.59/1.43  		bind(X15, sK4(X0)),
% 8.59/1.43  		bind(X16, sK3),
% 8.59/1.43  		bind(X17, sK4(X0)),
% 8.59/1.43  		bind(X18, sK3)
% 8.59/1.43  	],
% 8.59/1.43  	[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, a27, a28, a29, a30])).
% 8.59/1.43  
% 8.59/1.43  % SZS output end IncompleteProof
%------------------------------------------------------------------------------