%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM297+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 : n012.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:01 EDT 2022 % Result : Theorem 0.12s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM297+1 : TPTP v8.1.0. Released v3.1.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n012.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Fri Jul 8 00:07:29 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.39 % SZS status Theorem % 0.12/0.39 % SZS output begin IncompleteProof % 0.12/0.39 cnf(c0, axiom, % 0.12/0.39 ~less(nn4,nn2)). % 0.12/0.39 cnf(c1, plain, % 0.12/0.39 ~less(nn4,nn2), % 0.12/0.39 inference(start, [], [c0])). % 0.12/0.39 % 0.12/0.39 cnf(c2, axiom, % 0.12/0.39 less(X0,X1) | ~rdn_positive_less(X2,X3) | ~rdn_translate(X1,rdn_neg(X2)) | ~rdn_translate(X0,rdn_neg(X3))). % 0.12/0.39 cnf(a0, assumption, % 0.12/0.39 nn4 = X0). % 0.12/0.39 cnf(a1, assumption, % 0.12/0.39 nn2 = X1). % 0.12/0.39 cnf(c3, plain, % 0.12/0.39 $false, % 0.12/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.39 cnf(c4, plain, % 0.12/0.39 ~rdn_positive_less(X2,X3) | ~rdn_translate(X1,rdn_neg(X2)) | ~rdn_translate(X0,rdn_neg(X3)), % 0.12/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.39 % 0.12/0.39 cnf(c5, axiom, % 0.12/0.39 rdn_positive_less(rdnn(X4),rdnn(X5)) | ~rdn_positive_less(rdnn(X6),rdnn(X5)) | ~rdn_positive_less(rdnn(X4),rdnn(X6))). % 0.12/0.39 cnf(a2, assumption, % 0.12/0.39 X2 = rdnn(X4)). % 0.12/0.39 cnf(a3, assumption, % 0.12/0.39 X3 = rdnn(X5)). % 0.12/0.39 cnf(c6, plain, % 0.12/0.39 ~rdn_translate(X1,rdn_neg(X2)) | ~rdn_translate(X0,rdn_neg(X3)), % 0.12/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.39 cnf(c7, plain, % 0.12/0.39 ~rdn_positive_less(rdnn(X6),rdnn(X5)) | ~rdn_positive_less(rdnn(X4),rdnn(X6)), % 0.20/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.39 % 0.20/0.39 cnf(c8, axiom, % 0.20/0.39 rdn_positive_less(rdnn(n3),rdnn(n4))). % 0.20/0.39 cnf(a4, assumption, % 0.20/0.39 rdnn(X6) = rdnn(n3)). % 0.20/0.39 cnf(a5, assumption, % 0.20/0.39 rdnn(X5) = rdnn(n4)). % 0.20/0.39 cnf(c9, plain, % 0.20/0.39 ~rdn_positive_less(rdnn(X4),rdnn(X6)), % 0.20/0.39 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.20/0.39 cnf(c10, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.20/0.39 % 0.20/0.39 cnf(c11, axiom, % 0.20/0.39 rdn_positive_less(rdnn(n2),rdnn(n3))). % 0.20/0.39 cnf(a6, assumption, % 0.20/0.39 rdnn(X4) = rdnn(n2)). % 0.20/0.39 cnf(a7, assumption, % 0.20/0.39 rdnn(X6) = rdnn(n3)). % 0.20/0.39 cnf(c12, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 0.20/0.39 cnf(c13, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 0.20/0.39 % 0.20/0.39 cnf(c14, axiom, % 0.20/0.39 rdn_translate(nn2,rdn_neg(rdnn(n2)))). % 0.20/0.39 cnf(a8, assumption, % 0.20/0.39 X1 = nn2). % 0.20/0.39 cnf(a9, assumption, % 0.20/0.39 rdn_neg(X2) = rdn_neg(rdnn(n2))). % 0.20/0.39 cnf(c15, plain, % 0.20/0.39 ~rdn_translate(X0,rdn_neg(X3)), % 0.20/0.39 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])). % 0.20/0.39 cnf(c16, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])). % 0.20/0.39 % 0.20/0.39 cnf(c17, axiom, % 0.20/0.39 rdn_translate(nn4,rdn_neg(rdnn(n4)))). % 0.20/0.39 cnf(a10, assumption, % 0.20/0.39 X0 = nn4). % 0.20/0.39 cnf(a11, assumption, % 0.20/0.39 rdn_neg(X3) = rdn_neg(rdnn(n4))). % 0.20/0.39 cnf(c18, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])). % 0.20/0.39 cnf(c19, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])). % 0.20/0.39 % 0.20/0.39 cnf(c20, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(constraint_solving, [ % 0.20/0.39 bind(X0, nn4), % 0.20/0.39 bind(X1, nn2), % 0.20/0.39 bind(X2, rdnn(X4)), % 0.20/0.39 bind(X3, rdnn(X5)), % 0.20/0.39 bind(X4, n2), % 0.20/0.39 bind(X5, n4), % 0.20/0.39 bind(X6, n3) % 0.20/0.39 ], % 0.20/0.39 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.20/0.39 % 0.20/0.39 % SZS output end IncompleteProof %------------------------------------------------------------------------------