TSTP Solution File: NUM410+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM410+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 : n020.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 0.15s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM410+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Tue Jul 5 15:09:44 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.15/0.37 % SZS status Theorem
% 0.15/0.37 % SZS output begin IncompleteProof
% 0.15/0.37 cnf(c0, axiom,
% 0.15/0.37 relation(sK19)).
% 0.15/0.37 cnf(c1, plain,
% 0.15/0.37 relation(sK19),
% 0.15/0.37 inference(start, [], [c0])).
% 0.15/0.37
% 0.15/0.37 cnf(c2, axiom,
% 0.15/0.37 transfinite_sequence(X0) | ~ordinal(relation_dom(X0)) | ~function(X0) | ~relation(X0)).
% 0.15/0.37 cnf(a0, assumption,
% 0.15/0.37 sK19 = X0).
% 0.15/0.37 cnf(c3, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.15/0.37 cnf(c4, plain,
% 0.15/0.37 transfinite_sequence(X0) | ~ordinal(relation_dom(X0)) | ~function(X0),
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.15/0.37
% 0.15/0.37 cnf(c5, axiom,
% 0.15/0.37 transfinite_sequence_of(X1,X2) | ~subset(relation_rng(X1),X2) | ~transfinite_sequence(X1) | ~function(X1) | ~relation(X1)).
% 0.15/0.37 cnf(a1, assumption,
% 0.15/0.37 X0 = X1).
% 0.15/0.37 cnf(c6, plain,
% 0.15/0.37 ~ordinal(relation_dom(X0)) | ~function(X0),
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.15/0.37 cnf(c7, plain,
% 0.15/0.37 transfinite_sequence_of(X1,X2) | ~subset(relation_rng(X1),X2) | ~function(X1) | ~relation(X1),
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.15/0.37
% 0.15/0.37 cnf(c8, axiom,
% 0.15/0.37 ~transfinite_sequence_of(sK19,relation_rng(sK19))).
% 0.15/0.37 cnf(a2, assumption,
% 0.15/0.37 X1 = sK19).
% 0.15/0.37 cnf(a3, assumption,
% 0.15/0.37 X2 = relation_rng(sK19)).
% 0.15/0.37 cnf(c9, plain,
% 0.15/0.37 ~subset(relation_rng(X1),X2) | ~function(X1) | ~relation(X1),
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 0.15/0.37 cnf(c10, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 0.15/0.37
% 0.15/0.37 cnf(c11, axiom,
% 0.15/0.37 subset(X3,X3)).
% 0.15/0.37 cnf(a4, assumption,
% 0.15/0.37 relation_rng(X1) = X3).
% 0.15/0.37 cnf(a5, assumption,
% 0.15/0.37 X2 = X3).
% 0.15/0.37 cnf(c12, plain,
% 0.15/0.37 ~function(X1) | ~relation(X1),
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c11])).
% 0.15/0.37 cnf(c13, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c11])).
% 0.15/0.37
% 0.15/0.37 cnf(c14, axiom,
% 0.15/0.37 function(sK19)).
% 0.15/0.37 cnf(a6, assumption,
% 0.15/0.37 X1 = sK19).
% 0.15/0.37 cnf(c15, plain,
% 0.15/0.37 ~relation(X1),
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a6])], [c12, c14])).
% 0.15/0.37 cnf(c16, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a6])], [c12, c14])).
% 0.15/0.37
% 0.15/0.37 cnf(c17, plain,
% 0.15/0.37 relation(sK19)).
% 0.15/0.37 cnf(a7, assumption,
% 0.15/0.37 X1 = sK19).
% 0.15/0.37 cnf(c18, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(predicate_reduction, [assumptions([a7])], [c15, c17])).
% 0.15/0.37
% 0.15/0.37 cnf(c19, axiom,
% 0.15/0.37 ordinal(relation_dom(sK19))).
% 0.15/0.37 cnf(a8, assumption,
% 0.15/0.37 relation_dom(X0) = relation_dom(sK19)).
% 0.15/0.37 cnf(c20, plain,
% 0.15/0.37 ~function(X0),
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a8])], [c6, c19])).
% 0.15/0.37 cnf(c21, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(strict_predicate_extension, [assumptions([a8])], [c6, c19])).
% 0.15/0.37
% 0.15/0.37 cnf(c22, plain,
% 0.15/0.37 function(X1)).
% 0.15/0.37 cnf(a9, assumption,
% 0.15/0.37 X0 = X1).
% 0.15/0.37 cnf(c23, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(predicate_reduction, [assumptions([a9])], [c20, c22])).
% 0.15/0.37
% 0.15/0.37 cnf(c24, plain,
% 0.15/0.37 $false,
% 0.15/0.37 inference(constraint_solving, [
% 0.15/0.37 bind(X0, sK19),
% 0.15/0.37 bind(X1, sK19),
% 0.15/0.37 bind(X2, relation_rng(sK19)),
% 0.15/0.37 bind(X3, relation_rng(X1))
% 0.15/0.37 ],
% 0.15/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 0.15/0.37
% 0.15/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------