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