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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SEU368+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:55:24 EDT 2022

% Result   : Theorem 26.00s 3.75s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU368+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n022.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.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 19 19:49:01 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 26.00/3.75  % SZS status Theorem
% 26.00/3.75  % SZS output begin IncompleteProof
% 26.00/3.75  cnf(c0, axiom,
% 26.00/3.75  	inclusion_order(sK16) != the_InternalRel(rel_str_of(sK16,inclusion_order(sK16))) | sK16 != the_carrier(rel_str_of(sK16,inclusion_order(sK16)))).
% 26.00/3.75  cnf(c1, plain,
% 26.00/3.75  	inclusion_order(sK16) != the_InternalRel(rel_str_of(sK16,inclusion_order(sK16))) | sK16 != the_carrier(rel_str_of(sK16,inclusion_order(sK16))),
% 26.00/3.75  	inference(start, [], [c0])).
% 26.00/3.75  
% 26.00/3.75  cnf(c2, axiom,
% 26.00/3.75  	X0 = X1 | rel_str_of(X2,X0) != rel_str_of(X3,X1) | ~relation_of2(X0,X2,X2)).
% 26.00/3.75  cnf(a0, assumption,
% 26.00/3.75  	the_InternalRel(rel_str_of(sK16,inclusion_order(sK16))) = X1).
% 26.00/3.75  cnf(c3, plain,
% 26.00/3.75  	sK16 != the_carrier(rel_str_of(sK16,inclusion_order(sK16))),
% 26.00/3.75  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 26.00/3.75  cnf(c4, plain,
% 26.00/3.75  	rel_str_of(X2,X0) != rel_str_of(X3,X1) | ~relation_of2(X0,X2,X2),
% 26.00/3.75  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 26.00/3.75  cnf(c5, plain,
% 26.00/3.75  	X0 != X4 | inclusion_order(sK16) != X4,
% 26.00/3.75  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 26.00/3.75  
% 26.00/3.75  cnf(a1, assumption,
% 26.00/3.75  	X0 = X4).
% 26.00/3.75  cnf(c6, plain,
% 26.00/3.75  	inclusion_order(sK16) != X4,
% 26.00/3.75  	inference(reflexivity, [assumptions([a1])], [c5])).
% 26.00/3.75  
% 26.00/3.75  cnf(a2, assumption,
% 26.00/3.75  	inclusion_order(sK16) = X4).
% 26.00/3.75  cnf(c7, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(reflexivity, [assumptions([a2])], [c6])).
% 26.00/3.75  
% 26.00/3.75  cnf(c8, axiom,
% 26.00/3.75  	rel_str_of(the_carrier(X5),the_InternalRel(X5)) = X5 | ~strict_rel_str(X5) | ~rel_str(X5)).
% 26.00/3.75  cnf(a3, assumption,
% 26.00/3.75  	rel_str_of(X3,X1) = rel_str_of(the_carrier(X5),the_InternalRel(X5))).
% 26.00/3.75  cnf(c9, plain,
% 26.00/3.75  	~relation_of2(X0,X2,X2),
% 26.00/3.75  	inference(strict_function_extension, [assumptions([a3])], [c4, c8])).
% 26.00/3.75  cnf(c10, plain,
% 26.00/3.75  	~strict_rel_str(X5) | ~rel_str(X5),
% 26.00/3.75  	inference(strict_function_extension, [assumptions([a3])], [c4, c8])).
% 26.00/3.75  cnf(c11, plain,
% 26.00/3.75  	X6 != X5 | rel_str_of(X2,X0) != X6,
% 26.00/3.75  	inference(strict_function_extension, [assumptions([a3])], [c4, c8])).
% 26.00/3.75  
% 26.00/3.75  cnf(a4, assumption,
% 26.00/3.75  	X6 = X5).
% 26.00/3.75  cnf(c12, plain,
% 26.00/3.75  	rel_str_of(X2,X0) != X6,
% 26.00/3.75  	inference(reflexivity, [assumptions([a4])], [c11])).
% 26.00/3.75  
% 26.00/3.75  cnf(a5, assumption,
% 26.00/3.75  	rel_str_of(X2,X0) = X6).
% 26.00/3.75  cnf(c13, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(reflexivity, [assumptions([a5])], [c12])).
% 26.00/3.75  
% 26.00/3.75  cnf(c14, axiom,
% 26.00/3.75  	strict_rel_str(rel_str_of(X7,inclusion_order(X7)))).
% 26.00/3.75  cnf(a6, assumption,
% 26.00/3.75  	X5 = rel_str_of(X7,inclusion_order(X7))).
% 26.00/3.75  cnf(c15, plain,
% 26.00/3.75  	~rel_str(X5),
% 26.00/3.75  	inference(strict_predicate_extension, [assumptions([a6])], [c10, c14])).
% 26.00/3.75  cnf(c16, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(strict_predicate_extension, [assumptions([a6])], [c10, c14])).
% 26.00/3.75  
% 26.00/3.75  cnf(c17, axiom,
% 26.00/3.75  	rel_str(rel_str_of(X8,inclusion_order(X8)))).
% 26.00/3.75  cnf(a7, assumption,
% 26.00/3.75  	X5 = rel_str_of(X8,inclusion_order(X8))).
% 26.00/3.75  cnf(c18, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(strict_predicate_extension, [assumptions([a7])], [c15, c17])).
% 26.00/3.75  cnf(c19, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(strict_predicate_extension, [assumptions([a7])], [c15, c17])).
% 26.00/3.75  
% 26.00/3.75  cnf(c20, axiom,
% 26.00/3.75  	relation_of2(X9,X10,X11) | ~relation_of2_as_subset(X9,X10,X11)).
% 26.00/3.75  cnf(a8, assumption,
% 26.00/3.75  	X0 = X9).
% 26.00/3.75  cnf(a9, assumption,
% 26.00/3.75  	X2 = X10).
% 26.00/3.75  cnf(a10, assumption,
% 26.00/3.75  	X2 = X11).
% 26.00/3.75  cnf(c21, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c9, c20])).
% 26.00/3.75  cnf(c22, plain,
% 26.00/3.75  	~relation_of2_as_subset(X9,X10,X11),
% 26.00/3.75  	inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c9, c20])).
% 26.00/3.75  
% 26.00/3.75  cnf(c23, axiom,
% 26.00/3.75  	relation_of2_as_subset(inclusion_order(X12),X12,X12)).
% 26.00/3.75  cnf(a11, assumption,
% 26.00/3.75  	X9 = inclusion_order(X12)).
% 26.00/3.75  cnf(a12, assumption,
% 26.00/3.75  	X10 = X12).
% 26.00/3.75  cnf(a13, assumption,
% 26.00/3.75  	X11 = X12).
% 26.00/3.75  cnf(c24, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c22, c23])).
% 26.00/3.75  cnf(c25, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c22, c23])).
% 26.00/3.75  
% 26.00/3.75  cnf(c26, axiom,
% 26.00/3.75  	X13 = X14 | rel_str_of(X13,X15) != rel_str_of(X14,X16) | ~relation_of2(X15,X13,X13)).
% 26.00/3.75  cnf(a14, assumption,
% 26.00/3.75  	the_carrier(rel_str_of(sK16,inclusion_order(sK16))) = X14).
% 26.00/3.75  cnf(c27, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(variable_extension, [assumptions([a14])], [c3, c26])).
% 26.00/3.75  cnf(c28, plain,
% 26.00/3.75  	rel_str_of(X13,X15) != rel_str_of(X14,X16) | ~relation_of2(X15,X13,X13),
% 26.00/3.75  	inference(variable_extension, [assumptions([a14])], [c3, c26])).
% 26.00/3.75  cnf(c29, plain,
% 26.00/3.75  	X13 != X17 | sK16 != X17,
% 26.00/3.75  	inference(variable_extension, [assumptions([a14])], [c3, c26])).
% 26.00/3.75  
% 26.00/3.75  cnf(a15, assumption,
% 26.00/3.75  	X13 = X17).
% 26.00/3.75  cnf(c30, plain,
% 26.00/3.75  	sK16 != X17,
% 26.00/3.75  	inference(reflexivity, [assumptions([a15])], [c29])).
% 26.00/3.75  
% 26.00/3.75  cnf(a16, assumption,
% 26.00/3.75  	sK16 = X17).
% 26.00/3.75  cnf(c31, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(reflexivity, [assumptions([a16])], [c30])).
% 26.00/3.75  
% 26.00/3.75  cnf(c32, plain,
% 26.00/3.75  	rel_str_of(X2,X0) = rel_str_of(X3,X1)).
% 26.00/3.75  cnf(a17, assumption,
% 26.00/3.75  	rel_str_of(X14,X16) = rel_str_of(X3,X1)).
% 26.00/3.75  cnf(a18, assumption,
% 26.00/3.75  	rel_str_of(X2,X0) = X18).
% 26.00/3.75  cnf(c33, plain,
% 26.00/3.75  	~relation_of2(X15,X13,X13),
% 26.00/3.75  	inference(equality_reduction, [assumptions([a17, a18])], [c28, c32])).
% 26.00/3.75  cnf(c34, plain,
% 26.00/3.75  	rel_str_of(X13,X15) != X18,
% 26.00/3.75  	inference(equality_reduction, [assumptions([a17, a18])], [c28, c32])).
% 26.00/3.75  
% 26.00/3.75  cnf(a19, assumption,
% 26.00/3.75  	rel_str_of(X13,X15) = X18).
% 26.00/3.75  cnf(c35, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(reflexivity, [assumptions([a19])], [c34])).
% 26.00/3.75  
% 26.00/3.75  cnf(c36, plain,
% 26.00/3.75  	relation_of2(X0,X2,X2)).
% 26.00/3.75  cnf(a20, assumption,
% 26.00/3.75  	X15 = X0).
% 26.00/3.75  cnf(a21, assumption,
% 26.00/3.75  	X13 = X2).
% 26.00/3.75  cnf(a22, assumption,
% 26.00/3.75  	X13 = X2).
% 26.00/3.75  cnf(c37, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(predicate_reduction, [assumptions([a20, a21, a22])], [c33, c36])).
% 26.00/3.75  
% 26.00/3.75  cnf(c38, plain,
% 26.00/3.75  	$false,
% 26.00/3.75  	inference(constraint_solving, [
% 26.00/3.75  		bind(X0, inclusion_order(sK16)),
% 26.00/3.75  		bind(X1, the_InternalRel(rel_str_of(sK16,inclusion_order(sK16)))),
% 26.00/3.75  		bind(X2, sK16),
% 26.00/3.75  		bind(X3, the_carrier(X5)),
% 26.00/3.75  		bind(X4, inclusion_order(sK16)),
% 26.00/3.75  		bind(X5, rel_str_of(sK16,inclusion_order(sK16))),
% 26.00/3.75  		bind(X6, rel_str_of(sK16,inclusion_order(sK16))),
% 26.00/3.75  		bind(X7, sK16),
% 26.00/3.75  		bind(X8, sK16),
% 26.00/3.75  		bind(X9, inclusion_order(sK16)),
% 26.00/3.75  		bind(X10, sK16),
% 26.00/3.75  		bind(X11, sK16),
% 26.00/3.75  		bind(X12, sK16),
% 26.00/3.75  		bind(X13, sK16),
% 26.00/3.75  		bind(X14, the_carrier(rel_str_of(sK16,inclusion_order(sK16)))),
% 26.00/3.75  		bind(X15, inclusion_order(sK16)),
% 26.00/3.75  		bind(X16, the_InternalRel(rel_str_of(sK16,inclusion_order(sK16)))),
% 26.00/3.75  		bind(X17, sK16),
% 26.00/3.75  		bind(X18, rel_str_of(X2,X0))
% 26.00/3.75  	],
% 26.00/3.75  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22])).
% 26.00/3.75  
% 26.00/3.75  % SZS output end IncompleteProof
%------------------------------------------------------------------------------