TSTP Solution File: NUM405+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM405+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 : n008.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:39 EDT 2022
% Result : Theorem 0.13s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM405+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.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jul 6 12:33:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % SZS status Theorem
% 0.13/0.36 % SZS output begin IncompleteProof
% 0.13/0.36 cnf(c0, axiom,
% 0.13/0.36 in(X0,sK18) | ~ordinal(X0)).
% 0.13/0.36 cnf(c1, plain,
% 0.13/0.36 in(X0,sK18) | ~ordinal(X0),
% 0.13/0.36 inference(start, [], [c0])).
% 0.13/0.36
% 0.13/0.36 cnf(c2, axiom,
% 0.13/0.36 in(X1,sK16(X2)) | ~ordinal(X1) | ~in(X1,X2)).
% 0.13/0.36 cnf(a0, assumption,
% 0.13/0.36 X0 = X1).
% 0.13/0.36 cnf(a1, assumption,
% 0.13/0.36 sK18 = X2).
% 0.13/0.36 cnf(c3, plain,
% 0.13/0.36 ~ordinal(X0),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.36 cnf(c4, plain,
% 0.13/0.36 in(X1,sK16(X2)) | ~ordinal(X1),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.36
% 0.13/0.36 cnf(c5, axiom,
% 0.13/0.36 ~ordinal(sK17(X3)) | ~in(sK17(X3),X3)).
% 0.13/0.36 cnf(a2, assumption,
% 0.13/0.36 X1 = sK17(X3)).
% 0.13/0.36 cnf(a3, assumption,
% 0.13/0.36 sK16(X2) = X3).
% 0.13/0.36 cnf(c6, plain,
% 0.13/0.36 ~ordinal(X1),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.36 cnf(c7, plain,
% 0.13/0.36 ~ordinal(sK17(X3)),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.36
% 0.13/0.36 cnf(c8, axiom,
% 0.13/0.36 ordinal(X4) | ~in(X4,sK16(X5))).
% 0.13/0.36 cnf(a4, assumption,
% 0.13/0.36 sK17(X3) = X4).
% 0.13/0.36 cnf(c9, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])).
% 0.13/0.36 cnf(c10, plain,
% 0.13/0.36 ~in(X4,sK16(X5)),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])).
% 0.13/0.36
% 0.13/0.36 cnf(c11, plain,
% 0.13/0.36 in(X1,sK16(X2))).
% 0.13/0.36 cnf(a5, assumption,
% 0.13/0.36 X4 = X1).
% 0.13/0.36 cnf(a6, assumption,
% 0.13/0.36 sK16(X5) = sK16(X2)).
% 0.13/0.36 cnf(c12, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(predicate_reduction, [assumptions([a5, a6])], [c10, c11])).
% 0.13/0.36
% 0.13/0.36 cnf(c13, axiom,
% 0.13/0.36 ordinal(sK17(X6)) | in(sK17(X6),X6)).
% 0.13/0.36 cnf(a7, assumption,
% 0.13/0.36 X1 = sK17(X6)).
% 0.13/0.36 cnf(c14, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c6, c13])).
% 0.13/0.36 cnf(c15, plain,
% 0.13/0.36 in(sK17(X6),X6),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c6, c13])).
% 0.13/0.36
% 0.13/0.36 cnf(c16, plain,
% 0.13/0.36 ~in(X1,sK16(X2))).
% 0.13/0.36 cnf(a8, assumption,
% 0.13/0.36 sK17(X6) = X1).
% 0.13/0.36 cnf(a9, assumption,
% 0.13/0.36 X6 = sK16(X2)).
% 0.13/0.36 cnf(c17, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(predicate_reduction, [assumptions([a8, a9])], [c15, c16])).
% 0.13/0.36
% 0.13/0.36 cnf(c18, plain,
% 0.13/0.36 ordinal(X1)).
% 0.13/0.36 cnf(a10, assumption,
% 0.13/0.36 X0 = X1).
% 0.13/0.36 cnf(c19, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(predicate_reduction, [assumptions([a10])], [c3, c18])).
% 0.13/0.36
% 0.13/0.36 cnf(c20, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(constraint_solving, [
% 0.13/0.36 bind(X0, sK17(X3)),
% 0.13/0.36 bind(X1, sK17(X3)),
% 0.13/0.36 bind(X2, sK18),
% 0.13/0.36 bind(X3, sK16(X2)),
% 0.13/0.36 bind(X4, sK17(X3)),
% 0.13/0.36 bind(X5, sK18),
% 0.13/0.36 bind(X6, sK16(X2))
% 0.13/0.36 ],
% 0.13/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.13/0.36
% 0.13/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------