TSTP Solution File: SEU323+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU323+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 : n028.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:04 EDT 2022
% Result : Theorem 9.20s 1.51s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU323+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n028.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 12:30:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 9.20/1.51 % SZS status Theorem
% 9.20/1.51 % SZS output begin IncompleteProof
% 9.20/1.51 cnf(c0, axiom,
% 9.20/1.51 top_str(sK5)).
% 9.20/1.51 cnf(c1, plain,
% 9.20/1.51 top_str(sK5),
% 9.20/1.51 inference(start, [], [c0])).
% 9.20/1.51
% 9.20/1.51 cnf(c2, axiom,
% 9.20/1.51 interior(X0,X1) = subset_complement(the_carrier(X0),topstr_closure(X0,subset_complement(the_carrier(X0),X1))) | ~element(X1,powerset(the_carrier(X0))) | ~top_str(X0)).
% 9.20/1.51 cnf(a0, assumption,
% 9.20/1.51 sK5 = X0).
% 9.20/1.51 cnf(c3, plain,
% 9.20/1.51 $false,
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 9.20/1.51 cnf(c4, plain,
% 9.20/1.51 interior(X0,X1) = subset_complement(the_carrier(X0),topstr_closure(X0,subset_complement(the_carrier(X0),X1))) | ~element(X1,powerset(the_carrier(X0))),
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 9.20/1.51
% 9.20/1.51 cnf(c5, axiom,
% 9.20/1.51 ~open_subset(interior(sK5,sK6),sK5)).
% 9.20/1.51 cnf(a1, assumption,
% 9.20/1.51 interior(sK5,sK6) = interior(X0,X1)).
% 9.20/1.51 cnf(a2, assumption,
% 9.20/1.51 subset_complement(the_carrier(X0),topstr_closure(X0,subset_complement(the_carrier(X0),X1))) = X2).
% 9.20/1.51 cnf(c6, plain,
% 9.20/1.51 ~element(X1,powerset(the_carrier(X0))),
% 9.20/1.51 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 9.20/1.51 cnf(c7, plain,
% 9.20/1.51 $false,
% 9.20/1.51 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 9.20/1.51 cnf(c8, plain,
% 9.20/1.51 ~open_subset(X2,sK5),
% 9.20/1.51 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 9.20/1.51
% 9.20/1.51 cnf(c9, axiom,
% 9.20/1.51 open_subset(subset_complement(the_carrier(X3),X4),X3) | ~element(X4,powerset(the_carrier(X3))) | ~closed_subset(X4,X3) | ~top_str(X3) | ~topological_space(X3)).
% 9.20/1.51 cnf(a3, assumption,
% 9.20/1.51 X2 = subset_complement(the_carrier(X3),X4)).
% 9.20/1.51 cnf(a4, assumption,
% 9.20/1.51 sK5 = X3).
% 9.20/1.51 cnf(c10, plain,
% 9.20/1.51 $false,
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])).
% 9.20/1.51 cnf(c11, plain,
% 9.20/1.51 ~element(X4,powerset(the_carrier(X3))) | ~closed_subset(X4,X3) | ~top_str(X3) | ~topological_space(X3),
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])).
% 9.20/1.51
% 9.20/1.51 cnf(c12, axiom,
% 9.20/1.51 element(topstr_closure(X5,X6),powerset(the_carrier(X5))) | ~element(X6,powerset(the_carrier(X5))) | ~top_str(X5)).
% 9.20/1.51 cnf(a5, assumption,
% 9.20/1.51 X4 = topstr_closure(X5,X6)).
% 9.20/1.51 cnf(a6, assumption,
% 9.20/1.51 powerset(the_carrier(X3)) = powerset(the_carrier(X5))).
% 9.20/1.51 cnf(c13, plain,
% 9.20/1.51 ~closed_subset(X4,X3) | ~top_str(X3) | ~topological_space(X3),
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a5, a6])], [c11, c12])).
% 9.20/1.51 cnf(c14, plain,
% 9.20/1.51 ~element(X6,powerset(the_carrier(X5))) | ~top_str(X5),
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a5, a6])], [c11, c12])).
% 9.20/1.51
% 9.20/1.51 cnf(c15, axiom,
% 9.20/1.51 element(subset_complement(X7,X8),powerset(X7)) | ~element(X8,powerset(X7))).
% 9.20/1.51 cnf(a7, assumption,
% 9.20/1.51 X6 = subset_complement(X7,X8)).
% 9.20/1.51 cnf(a8, assumption,
% 9.20/1.51 powerset(the_carrier(X5)) = powerset(X7)).
% 9.20/1.51 cnf(c16, plain,
% 9.20/1.51 ~top_str(X5),
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a7, a8])], [c14, c15])).
% 9.20/1.51 cnf(c17, plain,
% 9.20/1.51 ~element(X8,powerset(X7)),
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a7, a8])], [c14, c15])).
% 9.20/1.51
% 9.20/1.51 cnf(c18, axiom,
% 9.20/1.51 element(sK6,powerset(the_carrier(sK5)))).
% 9.20/1.51 cnf(a9, assumption,
% 9.20/1.51 X8 = sK6).
% 9.20/1.51 cnf(a10, assumption,
% 9.20/1.51 powerset(X7) = powerset(the_carrier(sK5))).
% 9.20/1.51 cnf(c19, plain,
% 9.20/1.51 $false,
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])).
% 9.20/1.51 cnf(c20, plain,
% 9.20/1.51 $false,
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])).
% 9.20/1.51
% 9.20/1.51 cnf(c21, plain,
% 9.20/1.51 top_str(sK5)).
% 9.20/1.51 cnf(a11, assumption,
% 9.20/1.51 X5 = sK5).
% 9.20/1.51 cnf(c22, plain,
% 9.20/1.51 $false,
% 9.20/1.51 inference(predicate_reduction, [assumptions([a11])], [c16, c21])).
% 9.20/1.51
% 9.20/1.51 cnf(c23, axiom,
% 9.20/1.51 closed_subset(topstr_closure(X9,X10),X9) | ~element(X10,powerset(the_carrier(X9))) | ~top_str(X9) | ~topological_space(X9)).
% 9.20/1.51 cnf(a12, assumption,
% 9.20/1.51 X4 = topstr_closure(X9,X10)).
% 9.20/1.51 cnf(a13, assumption,
% 9.20/1.51 X3 = X9).
% 9.20/1.51 cnf(c24, plain,
% 9.20/1.51 ~top_str(X3) | ~topological_space(X3),
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a12, a13])], [c13, c23])).
% 9.20/1.51 cnf(c25, plain,
% 9.20/1.51 ~element(X10,powerset(the_carrier(X9))) | ~top_str(X9) | ~topological_space(X9),
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a12, a13])], [c13, c23])).
% 9.20/1.51
% 9.20/1.51 cnf(c26, plain,
% 9.20/1.51 element(X6,powerset(the_carrier(X5)))).
% 9.20/1.51 cnf(a14, assumption,
% 9.20/1.51 X10 = X6).
% 9.20/1.51 cnf(a15, assumption,
% 9.20/1.51 powerset(the_carrier(X9)) = powerset(the_carrier(X5))).
% 9.20/1.51 cnf(c27, plain,
% 9.20/1.51 ~top_str(X9) | ~topological_space(X9),
% 9.20/1.51 inference(predicate_reduction, [assumptions([a14, a15])], [c25, c26])).
% 9.20/1.51
% 9.20/1.51 cnf(c28, plain,
% 9.20/1.51 top_str(sK5)).
% 9.20/1.51 cnf(a16, assumption,
% 9.20/1.51 X9 = sK5).
% 9.20/1.51 cnf(c29, plain,
% 9.20/1.51 ~topological_space(X9),
% 9.20/1.51 inference(predicate_reduction, [assumptions([a16])], [c27, c28])).
% 9.20/1.51
% 9.20/1.51 cnf(c30, axiom,
% 9.20/1.51 topological_space(sK5)).
% 9.20/1.51 cnf(a17, assumption,
% 9.20/1.51 X9 = sK5).
% 9.20/1.51 cnf(c31, plain,
% 9.20/1.51 $false,
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a17])], [c29, c30])).
% 9.20/1.51 cnf(c32, plain,
% 9.20/1.51 $false,
% 9.20/1.51 inference(strict_predicate_extension, [assumptions([a17])], [c29, c30])).
% 9.20/1.51
% 9.20/1.51 cnf(c33, plain,
% 9.20/1.51 top_str(sK5)).
% 9.20/1.51 cnf(a18, assumption,
% 9.20/1.51 X3 = sK5).
% 9.20/1.51 cnf(c34, plain,
% 9.20/1.51 ~topological_space(X3),
% 9.20/1.51 inference(predicate_reduction, [assumptions([a18])], [c24, c33])).
% 9.20/1.51
% 9.20/1.51 cnf(c35, plain,
% 9.20/1.51 topological_space(X9)).
% 9.20/1.51 cnf(a19, assumption,
% 9.20/1.51 X3 = X9).
% 9.20/1.51 cnf(c36, plain,
% 9.20/1.51 $false,
% 9.20/1.51 inference(predicate_reduction, [assumptions([a19])], [c34, c35])).
% 9.20/1.51
% 9.20/1.51 cnf(c37, plain,
% 9.20/1.51 element(X8,powerset(X7))).
% 9.20/1.51 cnf(a20, assumption,
% 9.20/1.51 X1 = X8).
% 9.20/1.51 cnf(a21, assumption,
% 9.20/1.51 powerset(the_carrier(X0)) = powerset(X7)).
% 9.20/1.51 cnf(c38, plain,
% 9.20/1.51 $false,
% 9.20/1.51 inference(predicate_reduction, [assumptions([a20, a21])], [c6, c37])).
% 9.20/1.51
% 9.20/1.51 cnf(c39, plain,
% 9.20/1.51 $false,
% 9.20/1.51 inference(constraint_solving, [
% 9.20/1.51 bind(X0, sK5),
% 9.20/1.51 bind(X1, sK6),
% 9.20/1.51 bind(X2, subset_complement(the_carrier(X0),topstr_closure(X0,subset_complement(the_carrier(X0),X1)))),
% 9.20/1.51 bind(X3, sK5),
% 9.20/1.51 bind(X4, topstr_closure(X0,subset_complement(the_carrier(X0),X1))),
% 9.20/1.51 bind(X5, sK5),
% 9.20/1.51 bind(X6, subset_complement(the_carrier(X0),X1)),
% 9.20/1.51 bind(X7, the_carrier(X0)),
% 9.20/1.51 bind(X8, sK6),
% 9.20/1.51 bind(X9, sK5),
% 9.20/1.51 bind(X10, subset_complement(the_carrier(X0),X1))
% 9.20/1.51 ],
% 9.20/1.51 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 9.20/1.51
% 9.20/1.51 % SZS output end IncompleteProof
%------------------------------------------------------------------------------