TSTP Solution File: NUM325+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM325+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n007.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:10 EDT 2022
% Result : Theorem 15.10s 2.53s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM325+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35 % Computer : n007.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 20:24:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 15.10/2.53 % SZS status Theorem
% 15.10/2.53 % SZS output begin IncompleteProof
% 15.10/2.53 cnf(c0, axiom,
% 15.10/2.53 ~sum(X0,nn2,n3)).
% 15.10/2.53 cnf(c1, plain,
% 15.10/2.53 ~sum(X0,nn2,n3),
% 15.10/2.53 inference(start, [], [c0])).
% 15.10/2.53
% 15.10/2.53 cnf(c2, axiom,
% 15.10/2.53 sum(X1,X2,X3) | ~rdn_translate(X3,rdn_pos(X4)) | ~rdn_add_with_carry(rdnn(n0),X5,X4,X6) | ~rdn_positive_less(X5,X6) | ~rdn_translate(X2,rdn_neg(X5)) | ~rdn_translate(X1,rdn_pos(X6))).
% 15.10/2.53 cnf(a0, assumption,
% 15.10/2.53 X0 = X1).
% 15.10/2.53 cnf(a1, assumption,
% 15.10/2.53 nn2 = X2).
% 15.10/2.53 cnf(a2, assumption,
% 15.10/2.53 n3 = X3).
% 15.10/2.53 cnf(c3, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 15.10/2.53 cnf(c4, plain,
% 15.10/2.53 ~rdn_translate(X3,rdn_pos(X4)) | ~rdn_add_with_carry(rdnn(n0),X5,X4,X6) | ~rdn_positive_less(X5,X6) | ~rdn_translate(X2,rdn_neg(X5)) | ~rdn_translate(X1,rdn_pos(X6)),
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 15.10/2.53
% 15.10/2.53 cnf(c5, axiom,
% 15.10/2.53 rdn_translate(n3,rdn_pos(rdnn(n3)))).
% 15.10/2.53 cnf(a3, assumption,
% 15.10/2.53 X3 = n3).
% 15.10/2.53 cnf(a4, assumption,
% 15.10/2.53 rdn_pos(X4) = rdn_pos(rdnn(n3))).
% 15.10/2.53 cnf(c6, plain,
% 15.10/2.53 ~rdn_add_with_carry(rdnn(n0),X5,X4,X6) | ~rdn_positive_less(X5,X6) | ~rdn_translate(X2,rdn_neg(X5)) | ~rdn_translate(X1,rdn_pos(X6)),
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 15.10/2.53 cnf(c7, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 15.10/2.53
% 15.10/2.53 cnf(c8, axiom,
% 15.10/2.53 rdn_add_with_carry(rdnn(X7),rdnn(X8),rdnn(X9),rdnn(X10)) | ~rdn_digit_add(rdnn(X11),rdnn(X7),rdnn(X10),rdnn(n0)) | ~rdn_digit_add(rdnn(X8),rdnn(X9),rdnn(X11),rdnn(n0))).
% 15.10/2.53 cnf(a5, assumption,
% 15.10/2.53 rdnn(n0) = rdnn(X7)).
% 15.10/2.53 cnf(a6, assumption,
% 15.10/2.53 X5 = rdnn(X8)).
% 15.10/2.53 cnf(a7, assumption,
% 15.10/2.53 X4 = rdnn(X9)).
% 15.10/2.53 cnf(a8, assumption,
% 15.10/2.53 X6 = rdnn(X10)).
% 15.10/2.53 cnf(c9, plain,
% 15.10/2.53 ~rdn_positive_less(X5,X6) | ~rdn_translate(X2,rdn_neg(X5)) | ~rdn_translate(X1,rdn_pos(X6)),
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a5, a6, a7, a8])], [c6, c8])).
% 15.10/2.53 cnf(c10, plain,
% 15.10/2.53 ~rdn_digit_add(rdnn(X11),rdnn(X7),rdnn(X10),rdnn(n0)) | ~rdn_digit_add(rdnn(X8),rdnn(X9),rdnn(X11),rdnn(n0)),
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a5, a6, a7, a8])], [c6, c8])).
% 15.10/2.53
% 15.10/2.53 cnf(c11, axiom,
% 15.10/2.53 rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0))).
% 15.10/2.53 cnf(a9, assumption,
% 15.10/2.53 rdnn(X11) = rdnn(n5)).
% 15.10/2.53 cnf(a10, assumption,
% 15.10/2.53 rdnn(X7) = rdnn(n0)).
% 15.10/2.53 cnf(a11, assumption,
% 15.10/2.53 rdnn(X10) = rdnn(n5)).
% 15.10/2.53 cnf(a12, assumption,
% 15.10/2.53 rdnn(n0) = rdnn(n0)).
% 15.10/2.53 cnf(c12, plain,
% 15.10/2.53 ~rdn_digit_add(rdnn(X8),rdnn(X9),rdnn(X11),rdnn(n0)),
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a9, a10, a11, a12])], [c10, c11])).
% 15.10/2.53 cnf(c13, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a9, a10, a11, a12])], [c10, c11])).
% 15.10/2.53
% 15.10/2.53 cnf(c14, axiom,
% 15.10/2.53 rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0))).
% 15.10/2.53 cnf(a13, assumption,
% 15.10/2.53 rdnn(X8) = rdnn(n2)).
% 15.10/2.53 cnf(a14, assumption,
% 15.10/2.53 rdnn(X9) = rdnn(n3)).
% 15.10/2.53 cnf(a15, assumption,
% 15.10/2.53 rdnn(X11) = rdnn(n5)).
% 15.10/2.53 cnf(a16, assumption,
% 15.10/2.53 rdnn(n0) = rdnn(n0)).
% 15.10/2.53 cnf(c15, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a13, a14, a15, a16])], [c12, c14])).
% 15.10/2.53 cnf(c16, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a13, a14, a15, a16])], [c12, c14])).
% 15.10/2.53
% 15.10/2.53 cnf(c17, axiom,
% 15.10/2.53 rdn_positive_less(rdnn(X12),rdnn(X13)) | ~rdn_positive_less(rdnn(X14),rdnn(X13)) | ~rdn_positive_less(rdnn(X12),rdnn(X14))).
% 15.10/2.53 cnf(a17, assumption,
% 15.10/2.53 X5 = rdnn(X12)).
% 15.10/2.53 cnf(a18, assumption,
% 15.10/2.53 X6 = rdnn(X13)).
% 15.10/2.53 cnf(c18, plain,
% 15.10/2.53 ~rdn_translate(X2,rdn_neg(X5)) | ~rdn_translate(X1,rdn_pos(X6)),
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a17, a18])], [c9, c17])).
% 15.10/2.53 cnf(c19, plain,
% 15.10/2.53 ~rdn_positive_less(rdnn(X14),rdnn(X13)) | ~rdn_positive_less(rdnn(X12),rdnn(X14)),
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a17, a18])], [c9, c17])).
% 15.10/2.53
% 15.10/2.53 cnf(c20, axiom,
% 15.10/2.53 rdn_positive_less(rdnn(X15),rdnn(X16)) | ~rdn_positive_less(rdnn(X17),rdnn(X16)) | ~rdn_positive_less(rdnn(X15),rdnn(X17))).
% 15.10/2.53 cnf(a19, assumption,
% 15.10/2.53 rdnn(X14) = rdnn(X15)).
% 15.10/2.53 cnf(a20, assumption,
% 15.10/2.53 rdnn(X13) = rdnn(X16)).
% 15.10/2.53 cnf(c21, plain,
% 15.10/2.53 ~rdn_positive_less(rdnn(X12),rdnn(X14)),
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a19, a20])], [c19, c20])).
% 15.10/2.53 cnf(c22, plain,
% 15.10/2.53 ~rdn_positive_less(rdnn(X17),rdnn(X16)) | ~rdn_positive_less(rdnn(X15),rdnn(X17)),
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a19, a20])], [c19, c20])).
% 15.10/2.53
% 15.10/2.53 cnf(c23, axiom,
% 15.10/2.53 rdn_positive_less(rdnn(n4),rdnn(n5))).
% 15.10/2.53 cnf(a21, assumption,
% 15.10/2.53 rdnn(X17) = rdnn(n4)).
% 15.10/2.53 cnf(a22, assumption,
% 15.10/2.53 rdnn(X16) = rdnn(n5)).
% 15.10/2.53 cnf(c24, plain,
% 15.10/2.53 ~rdn_positive_less(rdnn(X15),rdnn(X17)),
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a21, a22])], [c22, c23])).
% 15.10/2.53 cnf(c25, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a21, a22])], [c22, c23])).
% 15.10/2.53
% 15.10/2.53 cnf(c26, axiom,
% 15.10/2.53 rdn_positive_less(rdnn(n3),rdnn(n4))).
% 15.10/2.53 cnf(a23, assumption,
% 15.10/2.53 rdnn(X15) = rdnn(n3)).
% 15.10/2.53 cnf(a24, assumption,
% 15.10/2.53 rdnn(X17) = rdnn(n4)).
% 15.10/2.53 cnf(c27, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a23, a24])], [c24, c26])).
% 15.10/2.53 cnf(c28, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a23, a24])], [c24, c26])).
% 15.10/2.53
% 15.10/2.53 cnf(c29, axiom,
% 15.10/2.53 rdn_positive_less(rdnn(n2),rdnn(n3))).
% 15.10/2.53 cnf(a25, assumption,
% 15.10/2.53 rdnn(X12) = rdnn(n2)).
% 15.10/2.53 cnf(a26, assumption,
% 15.10/2.53 rdnn(X14) = rdnn(n3)).
% 15.10/2.53 cnf(c30, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a25, a26])], [c21, c29])).
% 15.10/2.53 cnf(c31, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a25, a26])], [c21, c29])).
% 15.10/2.53
% 15.10/2.53 cnf(c32, axiom,
% 15.10/2.53 rdn_translate(nn2,rdn_neg(rdnn(n2)))).
% 15.10/2.53 cnf(a27, assumption,
% 15.10/2.53 X2 = nn2).
% 15.10/2.53 cnf(a28, assumption,
% 15.10/2.53 rdn_neg(X5) = rdn_neg(rdnn(n2))).
% 15.10/2.53 cnf(c33, plain,
% 15.10/2.53 ~rdn_translate(X1,rdn_pos(X6)),
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a27, a28])], [c18, c32])).
% 15.10/2.53 cnf(c34, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a27, a28])], [c18, c32])).
% 15.10/2.53
% 15.10/2.53 cnf(c35, axiom,
% 15.10/2.53 rdn_translate(n5,rdn_pos(rdnn(n5)))).
% 15.10/2.53 cnf(a29, assumption,
% 15.10/2.53 X1 = n5).
% 15.10/2.53 cnf(a30, assumption,
% 15.10/2.53 rdn_pos(X6) = rdn_pos(rdnn(n5))).
% 15.10/2.53 cnf(c36, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a29, a30])], [c33, c35])).
% 15.10/2.53 cnf(c37, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(strict_predicate_extension, [assumptions([a29, a30])], [c33, c35])).
% 15.10/2.53
% 15.10/2.53 cnf(c38, plain,
% 15.10/2.53 $false,
% 15.10/2.53 inference(constraint_solving, [
% 15.10/2.53 bind(X0, n5),
% 15.10/2.53 bind(X1, n5),
% 15.10/2.53 bind(X2, nn2),
% 15.10/2.53 bind(X3, n3),
% 15.10/2.53 bind(X4, rdnn(n3)),
% 15.10/2.53 bind(X5, rdnn(X8)),
% 15.10/2.53 bind(X6, rdnn(X10)),
% 15.10/2.53 bind(X7, n0),
% 15.10/2.53 bind(X8, n2),
% 15.10/2.53 bind(X9, n3),
% 15.10/2.53 bind(X10, n5),
% 15.10/2.53 bind(X11, n5),
% 15.10/2.53 bind(X12, n2),
% 15.10/2.53 bind(X13, n5),
% 15.10/2.53 bind(X14, n3),
% 15.10/2.53 bind(X15, n3),
% 15.10/2.53 bind(X16, n5),
% 15.10/2.53 bind(X17, n4)
% 15.10/2.53 ],
% 15.10/2.53 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30])).
% 15.10/2.53
% 15.10/2.53 % SZS output end IncompleteProof
%------------------------------------------------------------------------------