TSTP Solution File: NUM394+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM394+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 : n005.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:36 EDT 2022
% Result : Theorem 8.15s 1.43s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 17:05:52 EDT 2022
% 0.13/0.33 % CPUTime :
% 8.15/1.43 % SZS status Theorem
% 8.15/1.43 % SZS output begin IncompleteProof
% 8.15/1.43 cnf(c0, axiom,
% 8.15/1.43 ~ordinal_subset(sK14,sK15)).
% 8.15/1.43 cnf(c1, plain,
% 8.15/1.43 ~ordinal_subset(sK14,sK15),
% 8.15/1.43 inference(start, [], [c0])).
% 8.15/1.43
% 8.15/1.43 cnf(c2, axiom,
% 8.15/1.43 ordinal_subset(X0,X1) | ~subset(X0,X1) | ~ordinal(X1) | ~ordinal(X0)).
% 8.15/1.43 cnf(a0, assumption,
% 8.15/1.43 sK14 = X0).
% 8.15/1.43 cnf(a1, assumption,
% 8.15/1.43 sK15 = X1).
% 8.15/1.43 cnf(c3, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 8.15/1.43 cnf(c4, plain,
% 8.15/1.43 ~subset(X0,X1) | ~ordinal(X1) | ~ordinal(X0),
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 8.15/1.43
% 8.15/1.43 cnf(c5, axiom,
% 8.15/1.43 subset(X2,X3) | ~in(X2,X3) | ~epsilon_transitive(X3)).
% 8.15/1.43 cnf(a2, assumption,
% 8.15/1.43 X0 = X2).
% 8.15/1.43 cnf(a3, assumption,
% 8.15/1.43 X1 = X3).
% 8.15/1.43 cnf(c6, plain,
% 8.15/1.43 ~ordinal(X1) | ~ordinal(X0),
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 8.15/1.43 cnf(c7, plain,
% 8.15/1.43 ~in(X2,X3) | ~epsilon_transitive(X3),
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 8.15/1.43
% 8.15/1.43 cnf(c8, axiom,
% 8.15/1.43 in(X4,X5) | X5 = X4 | in(X5,X4) | ~ordinal(X4) | ~ordinal(X5)).
% 8.15/1.43 cnf(a4, assumption,
% 8.15/1.43 X2 = X5).
% 8.15/1.43 cnf(a5, assumption,
% 8.15/1.43 X3 = X4).
% 8.15/1.43 cnf(c9, plain,
% 8.15/1.43 ~epsilon_transitive(X3),
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 8.15/1.43 cnf(c10, plain,
% 8.15/1.43 in(X4,X5) | X5 = X4 | ~ordinal(X4) | ~ordinal(X5),
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 8.15/1.43
% 8.15/1.43 cnf(c11, axiom,
% 8.15/1.43 ~in(sK15,sK14)).
% 8.15/1.43 cnf(a6, assumption,
% 8.15/1.43 X4 = sK15).
% 8.15/1.43 cnf(a7, assumption,
% 8.15/1.43 X5 = sK14).
% 8.15/1.43 cnf(c12, plain,
% 8.15/1.43 X5 = X4 | ~ordinal(X4) | ~ordinal(X5),
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 8.15/1.43 cnf(c13, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 8.15/1.43
% 8.15/1.43 cnf(c14, plain,
% 8.15/1.43 ~ordinal_subset(sK14,sK15)).
% 8.15/1.43 cnf(a8, assumption,
% 8.15/1.43 sK14 = X5).
% 8.15/1.43 cnf(c15, plain,
% 8.15/1.43 ~ordinal(X4) | ~ordinal(X5),
% 8.15/1.43 inference(subterm_reduction, [assumptions([a8])], [c12, c14])).
% 8.15/1.43 cnf(c16, plain,
% 8.15/1.43 ~ordinal_subset(X4,sK15),
% 8.15/1.43 inference(subterm_reduction, [assumptions([a8])], [c12, c14])).
% 8.15/1.43
% 8.15/1.43 cnf(c17, axiom,
% 8.15/1.43 ordinal_subset(X6,X6) | ~ordinal(X7) | ~ordinal(X6)).
% 8.15/1.43 cnf(a9, assumption,
% 8.15/1.43 X4 = X6).
% 8.15/1.43 cnf(a10, assumption,
% 8.15/1.43 sK15 = X6).
% 8.15/1.43 cnf(c18, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])).
% 8.15/1.43 cnf(c19, plain,
% 8.15/1.43 ~ordinal(X7) | ~ordinal(X6),
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])).
% 8.15/1.43
% 8.15/1.43 cnf(c20, axiom,
% 8.15/1.43 ordinal(sK4)).
% 8.15/1.43 cnf(a11, assumption,
% 8.15/1.43 X7 = sK4).
% 8.15/1.43 cnf(c21, plain,
% 8.15/1.43 ~ordinal(X6),
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a11])], [c19, c20])).
% 8.15/1.43 cnf(c22, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a11])], [c19, c20])).
% 8.15/1.43
% 8.15/1.43 cnf(c23, axiom,
% 8.15/1.43 ordinal(sK15)).
% 8.15/1.43 cnf(a12, assumption,
% 8.15/1.43 X6 = sK15).
% 8.15/1.43 cnf(c24, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a12])], [c21, c23])).
% 8.15/1.43 cnf(c25, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a12])], [c21, c23])).
% 8.15/1.43
% 8.15/1.43 cnf(c26, plain,
% 8.15/1.43 ordinal(X6)).
% 8.15/1.43 cnf(a13, assumption,
% 8.15/1.43 X4 = X6).
% 8.15/1.43 cnf(c27, plain,
% 8.15/1.43 ~ordinal(X5),
% 8.15/1.43 inference(predicate_reduction, [assumptions([a13])], [c15, c26])).
% 8.15/1.43
% 8.15/1.43 cnf(c28, axiom,
% 8.15/1.43 ordinal(sK14)).
% 8.15/1.43 cnf(a14, assumption,
% 8.15/1.43 X5 = sK14).
% 8.15/1.43 cnf(c29, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a14])], [c27, c28])).
% 8.15/1.43 cnf(c30, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a14])], [c27, c28])).
% 8.15/1.43
% 8.15/1.43 cnf(c31, axiom,
% 8.15/1.43 epsilon_transitive(X8) | ~ordinal(X8)).
% 8.15/1.43 cnf(a15, assumption,
% 8.15/1.43 X3 = X8).
% 8.15/1.43 cnf(c32, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a15])], [c9, c31])).
% 8.15/1.43 cnf(c33, plain,
% 8.15/1.43 ~ordinal(X8),
% 8.15/1.43 inference(strict_predicate_extension, [assumptions([a15])], [c9, c31])).
% 8.15/1.43
% 8.15/1.43 cnf(c34, plain,
% 8.15/1.43 ordinal(X6)).
% 8.15/1.43 cnf(a16, assumption,
% 8.15/1.43 X8 = X6).
% 8.15/1.43 cnf(c35, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(predicate_reduction, [assumptions([a16])], [c33, c34])).
% 8.15/1.43
% 8.15/1.43 cnf(c36, plain,
% 8.15/1.43 ordinal(X6)).
% 8.15/1.43 cnf(a17, assumption,
% 8.15/1.43 X1 = X6).
% 8.15/1.43 cnf(c37, plain,
% 8.15/1.43 ~ordinal(X0),
% 8.15/1.43 inference(predicate_reduction, [assumptions([a17])], [c6, c36])).
% 8.15/1.43
% 8.15/1.43 cnf(c38, plain,
% 8.15/1.43 ordinal(X5)).
% 8.15/1.43 cnf(a18, assumption,
% 8.15/1.43 X0 = X5).
% 8.15/1.43 cnf(c39, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(predicate_reduction, [assumptions([a18])], [c37, c38])).
% 8.15/1.43
% 8.15/1.43 cnf(c40, plain,
% 8.15/1.43 $false,
% 8.15/1.43 inference(constraint_solving, [
% 8.15/1.43 bind(X0, sK14),
% 8.15/1.43 bind(X1, sK15),
% 8.15/1.43 bind(X2, sK14),
% 8.15/1.43 bind(X3, sK15),
% 8.15/1.43 bind(X4, sK15),
% 8.15/1.43 bind(X5, sK14),
% 8.15/1.43 bind(X6, sK15),
% 8.15/1.43 bind(X7, sK4),
% 8.15/1.43 bind(X8, sK15)
% 8.15/1.43 ],
% 8.15/1.43 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])).
% 8.15/1.43
% 8.15/1.43 % SZS output end IncompleteProof
%------------------------------------------------------------------------------