TSTP Solution File: NUM409+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM409+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 : n014.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 : Mon Jul 18 11:32:40 EDT 2022
% Result : Theorem 9.61s 1.63s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM409+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 : n014.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 : Thu Jul 7 23:30:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 9.61/1.63 % SZS status Theorem
% 9.61/1.63 % SZS output begin IncompleteProof
% 9.61/1.63 cnf(c0, axiom,
% 9.61/1.63 ~transfinite_sequence_of(empty_set,sK24)).
% 9.61/1.63 cnf(c1, plain,
% 9.61/1.63 ~transfinite_sequence_of(empty_set,sK24),
% 9.61/1.63 inference(start, [], [c0])).
% 9.61/1.63
% 9.61/1.63 cnf(c2, axiom,
% 9.61/1.63 transfinite_sequence_of(X0,X1) | ~subset(relation_rng(X0),X1) | ~transfinite_sequence(X0) | ~function(X0) | ~relation(X0)).
% 9.61/1.63 cnf(a0, assumption,
% 9.61/1.63 empty_set = X0).
% 9.61/1.63 cnf(a1, assumption,
% 9.61/1.63 sK24 = X1).
% 9.61/1.63 cnf(c3, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 9.61/1.63 cnf(c4, plain,
% 9.61/1.63 ~subset(relation_rng(X0),X1) | ~transfinite_sequence(X0) | ~function(X0) | ~relation(X0),
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 9.61/1.63
% 9.61/1.63 cnf(c5, axiom,
% 9.61/1.63 empty_set = X2 | ~empty(X2)).
% 9.61/1.63 cnf(a2, assumption,
% 9.61/1.63 relation_rng(X0) = X2).
% 9.61/1.63 cnf(c6, plain,
% 9.61/1.63 ~transfinite_sequence(X0) | ~function(X0) | ~relation(X0),
% 9.61/1.63 inference(variable_extension, [assumptions([a2])], [c4, c5])).
% 9.61/1.63 cnf(c7, plain,
% 9.61/1.63 ~empty(X2),
% 9.61/1.63 inference(variable_extension, [assumptions([a2])], [c4, c5])).
% 9.61/1.63 cnf(c8, plain,
% 9.61/1.63 empty_set != X3 | ~subset(X3,X1),
% 9.61/1.63 inference(variable_extension, [assumptions([a2])], [c4, c5])).
% 9.61/1.63
% 9.61/1.63 cnf(a3, assumption,
% 9.61/1.63 empty_set = X3).
% 9.61/1.63 cnf(c9, plain,
% 9.61/1.63 ~subset(X3,X1),
% 9.61/1.63 inference(reflexivity, [assumptions([a3])], [c8])).
% 9.61/1.63
% 9.61/1.63 cnf(c10, axiom,
% 9.61/1.63 subset(empty_set,X4)).
% 9.61/1.63 cnf(a4, assumption,
% 9.61/1.63 X3 = empty_set).
% 9.61/1.63 cnf(a5, assumption,
% 9.61/1.63 X1 = X4).
% 9.61/1.63 cnf(c11, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])).
% 9.61/1.63 cnf(c12, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])).
% 9.61/1.63
% 9.61/1.63 cnf(c13, axiom,
% 9.61/1.63 empty(relation_rng(X5)) | ~empty(X5)).
% 9.61/1.63 cnf(a6, assumption,
% 9.61/1.63 X2 = relation_rng(X5)).
% 9.61/1.63 cnf(c14, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a6])], [c7, c13])).
% 9.61/1.63 cnf(c15, plain,
% 9.61/1.63 ~empty(X5),
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a6])], [c7, c13])).
% 9.61/1.63
% 9.61/1.63 cnf(c16, axiom,
% 9.61/1.63 empty(empty_set)).
% 9.61/1.63 cnf(a7, assumption,
% 9.61/1.63 X5 = empty_set).
% 9.61/1.63 cnf(c17, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a7])], [c15, c16])).
% 9.61/1.63 cnf(c18, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a7])], [c15, c16])).
% 9.61/1.63
% 9.61/1.63 cnf(c19, axiom,
% 9.61/1.63 transfinite_sequence(X6) | ~ordinal(relation_dom(X6)) | ~function(X6) | ~relation(X6)).
% 9.61/1.63 cnf(a8, assumption,
% 9.61/1.63 X0 = X6).
% 9.61/1.63 cnf(c20, plain,
% 9.61/1.63 ~function(X0) | ~relation(X0),
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a8])], [c6, c19])).
% 9.61/1.63 cnf(c21, plain,
% 9.61/1.63 ~ordinal(relation_dom(X6)) | ~function(X6) | ~relation(X6),
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a8])], [c6, c19])).
% 9.61/1.63
% 9.61/1.63 cnf(c22, axiom,
% 9.61/1.63 ordinal(X7) | ~sP1(X7)).
% 9.61/1.63 cnf(a9, assumption,
% 9.61/1.63 relation_dom(X6) = X7).
% 9.61/1.63 cnf(c23, plain,
% 9.61/1.63 ~function(X6) | ~relation(X6),
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a9])], [c21, c22])).
% 9.61/1.63 cnf(c24, plain,
% 9.61/1.63 ~sP1(X7),
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a9])], [c21, c22])).
% 9.61/1.63
% 9.61/1.63 cnf(c25, axiom,
% 9.61/1.63 sP1(X8) | ~empty(X8)).
% 9.61/1.63 cnf(a10, assumption,
% 9.61/1.63 X7 = X8).
% 9.61/1.63 cnf(c26, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a10])], [c24, c25])).
% 9.61/1.63 cnf(c27, plain,
% 9.61/1.63 ~empty(X8),
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a10])], [c24, c25])).
% 9.61/1.63
% 9.61/1.63 cnf(c28, axiom,
% 9.61/1.63 empty(relation_dom(X9)) | ~empty(X9)).
% 9.61/1.63 cnf(a11, assumption,
% 9.61/1.63 X8 = relation_dom(X9)).
% 9.61/1.63 cnf(c29, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a11])], [c27, c28])).
% 9.61/1.63 cnf(c30, plain,
% 9.61/1.63 ~empty(X9),
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a11])], [c27, c28])).
% 9.61/1.63
% 9.61/1.63 cnf(c31, plain,
% 9.61/1.63 empty(X5)).
% 9.61/1.63 cnf(a12, assumption,
% 9.61/1.63 X9 = X5).
% 9.61/1.63 cnf(c32, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(predicate_reduction, [assumptions([a12])], [c30, c31])).
% 9.61/1.63
% 9.61/1.63 cnf(c33, axiom,
% 9.61/1.63 function(empty_set)).
% 9.61/1.63 cnf(a13, assumption,
% 9.61/1.63 X6 = empty_set).
% 9.61/1.63 cnf(c34, plain,
% 9.61/1.63 ~relation(X6),
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a13])], [c23, c33])).
% 9.61/1.63 cnf(c35, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a13])], [c23, c33])).
% 9.61/1.63
% 9.61/1.63 cnf(c36, axiom,
% 9.61/1.63 relation(empty_set)).
% 9.61/1.63 cnf(a14, assumption,
% 9.61/1.63 X6 = empty_set).
% 9.61/1.63 cnf(c37, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a14])], [c34, c36])).
% 9.61/1.63 cnf(c38, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(strict_predicate_extension, [assumptions([a14])], [c34, c36])).
% 9.61/1.63
% 9.61/1.63 cnf(c39, plain,
% 9.61/1.63 function(X6)).
% 9.61/1.63 cnf(a15, assumption,
% 9.61/1.63 X0 = X6).
% 9.61/1.63 cnf(c40, plain,
% 9.61/1.63 ~relation(X0),
% 9.61/1.63 inference(predicate_reduction, [assumptions([a15])], [c20, c39])).
% 9.61/1.63
% 9.61/1.63 cnf(c41, plain,
% 9.61/1.63 relation(X6)).
% 9.61/1.63 cnf(a16, assumption,
% 9.61/1.63 X0 = X6).
% 9.61/1.63 cnf(c42, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(predicate_reduction, [assumptions([a16])], [c40, c41])).
% 9.61/1.63
% 9.61/1.63 cnf(c43, plain,
% 9.61/1.63 $false,
% 9.61/1.63 inference(constraint_solving, [
% 9.61/1.63 bind(X0, empty_set),
% 9.61/1.63 bind(X1, sK24),
% 9.61/1.63 bind(X2, relation_rng(X0)),
% 9.61/1.63 bind(X3, empty_set),
% 9.61/1.63 bind(X4, sK24),
% 9.61/1.63 bind(X5, empty_set),
% 9.61/1.63 bind(X6, empty_set),
% 9.61/1.63 bind(X7, relation_dom(X6)),
% 9.61/1.63 bind(X8, relation_dom(X6)),
% 9.61/1.63 bind(X9, empty_set)
% 9.61/1.63 ],
% 9.61/1.63 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 9.61/1.63
% 9.61/1.63 % SZS output end IncompleteProof
%------------------------------------------------------------------------------