%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM015-1 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n020.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:30:27 EDT 2022 % Result : Unsatisfiable 0.14s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : NUM015-1 : TPTP v8.1.0. Released v1.0.0. % 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.36 % Computer : n020.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Wed Jul 6 14:32:59 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.37 % SZS status Unsatisfiable % 0.14/0.37 % SZS output begin IncompleteProof % 0.14/0.37 cnf(c0, axiom, % 0.14/0.37 ~divides(X0,a) | ~prime(X0)). % 0.14/0.37 cnf(c1, plain, % 0.14/0.37 ~divides(X0,a) | ~prime(X0), % 0.14/0.37 inference(start, [], [c0])). % 0.14/0.37 % 0.14/0.37 cnf(c2, axiom, % 0.14/0.37 divides(X1,X1)). % 0.14/0.37 cnf(a0, assumption, % 0.14/0.37 X0 = X1). % 0.14/0.37 cnf(a1, assumption, % 0.14/0.37 a = X1). % 0.14/0.37 cnf(c3, plain, % 0.14/0.37 ~prime(X0), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.37 cnf(c4, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.37 % 0.14/0.37 cnf(c5, axiom, % 0.14/0.37 less(divisor(X2),X2) | prime(X2)). % 0.14/0.37 cnf(a2, assumption, % 0.14/0.37 X0 = X2). % 0.14/0.37 cnf(c6, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c3, c5])). % 0.14/0.37 cnf(c7, plain, % 0.14/0.37 less(divisor(X2),X2), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c3, c5])). % 0.14/0.37 % 0.14/0.37 cnf(c8, axiom, % 0.14/0.37 prime(factor_of(X3)) | ~less(X3,a) | ~less(n1,X3)). % 0.14/0.37 cnf(a3, assumption, % 0.14/0.37 divisor(X2) = X3). % 0.14/0.37 cnf(a4, assumption, % 0.14/0.37 X2 = a). % 0.14/0.37 cnf(c9, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.14/0.37 cnf(c10, plain, % 0.14/0.37 prime(factor_of(X3)) | ~less(n1,X3), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.14/0.37 % 0.14/0.37 cnf(c11, axiom, % 0.14/0.37 ~divides(X4,a) | ~prime(X4)). % 0.14/0.37 cnf(a5, assumption, % 0.14/0.37 factor_of(X3) = X4). % 0.14/0.37 cnf(c12, plain, % 0.14/0.37 ~less(n1,X3), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c10, c11])). % 0.14/0.37 cnf(c13, plain, % 0.14/0.37 ~divides(X4,a), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c10, c11])). % 0.14/0.37 % 0.14/0.37 cnf(c14, axiom, % 0.14/0.37 divides(X5,X6) | ~divides(X7,X6) | ~divides(X5,X7)). % 0.14/0.37 cnf(a6, assumption, % 0.14/0.37 X4 = X5). % 0.14/0.37 cnf(a7, assumption, % 0.14/0.37 a = X6). % 0.14/0.37 cnf(c15, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])). % 0.14/0.37 cnf(c16, plain, % 0.14/0.37 ~divides(X7,X6) | ~divides(X5,X7), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])). % 0.14/0.37 % 0.14/0.37 cnf(c17, axiom, % 0.14/0.37 divides(divisor(X8),X8) | prime(X8)). % 0.14/0.37 cnf(a8, assumption, % 0.14/0.37 X7 = divisor(X8)). % 0.14/0.37 cnf(a9, assumption, % 0.14/0.37 X6 = X8). % 0.14/0.37 cnf(c18, plain, % 0.14/0.37 ~divides(X5,X7), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])). % 0.14/0.37 cnf(c19, plain, % 0.14/0.37 prime(X8), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])). % 0.14/0.37 % 0.14/0.37 cnf(c20, plain, % 0.14/0.37 ~prime(X0)). % 0.14/0.37 cnf(a10, assumption, % 0.14/0.37 X8 = X0). % 0.14/0.37 cnf(c21, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(predicate_reduction, [assumptions([a10])], [c19, c20])). % 0.14/0.37 % 0.14/0.37 cnf(c22, axiom, % 0.14/0.37 divides(factor_of(X9),X9) | ~less(X9,a) | ~less(n1,X9)). % 0.14/0.37 cnf(a11, assumption, % 0.14/0.37 X5 = factor_of(X9)). % 0.14/0.37 cnf(a12, assumption, % 0.14/0.37 X7 = X9). % 0.14/0.37 cnf(c23, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c22])). % 0.14/0.37 cnf(c24, plain, % 0.14/0.37 ~less(X9,a) | ~less(n1,X9), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c22])). % 0.14/0.37 % 0.14/0.37 cnf(c25, plain, % 0.14/0.37 less(divisor(X2),X2)). % 0.14/0.37 cnf(a13, assumption, % 0.14/0.37 X9 = divisor(X2)). % 0.14/0.37 cnf(a14, assumption, % 0.14/0.37 a = X2). % 0.14/0.37 cnf(c26, plain, % 0.14/0.37 ~less(n1,X9), % 0.14/0.37 inference(predicate_reduction, [assumptions([a13, a14])], [c24, c25])). % 0.14/0.37 % 0.14/0.37 cnf(c27, axiom, % 0.14/0.37 less(n1,divisor(X10)) | prime(X10)). % 0.14/0.37 cnf(a15, assumption, % 0.14/0.37 n1 = n1). % 0.14/0.37 cnf(a16, assumption, % 0.14/0.37 X9 = divisor(X10)). % 0.14/0.37 cnf(c28, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c26, c27])). % 0.14/0.37 cnf(c29, plain, % 0.14/0.37 prime(X10), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c26, c27])). % 0.14/0.37 % 0.14/0.37 cnf(c30, plain, % 0.14/0.37 ~prime(X0)). % 0.14/0.37 cnf(a17, assumption, % 0.14/0.37 X10 = X0). % 0.14/0.37 cnf(c31, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(predicate_reduction, [assumptions([a17])], [c29, c30])). % 0.14/0.37 % 0.14/0.37 cnf(c32, plain, % 0.14/0.37 less(n1,X9)). % 0.14/0.37 cnf(a18, assumption, % 0.14/0.37 n1 = n1). % 0.14/0.37 cnf(a19, assumption, % 0.14/0.37 X3 = X9). % 0.14/0.37 cnf(c33, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(predicate_reduction, [assumptions([a18, a19])], [c12, c32])). % 0.14/0.37 % 0.14/0.37 cnf(c34, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(constraint_solving, [ % 0.14/0.37 bind(X0, a), % 0.14/0.37 bind(X1, a), % 0.14/0.37 bind(X2, a), % 0.14/0.37 bind(X3, divisor(X2)), % 0.14/0.37 bind(X4, factor_of(X3)), % 0.14/0.37 bind(X5, factor_of(X3)), % 0.14/0.37 bind(X6, a), % 0.14/0.37 bind(X7, divisor(X8)), % 0.14/0.37 bind(X8, a), % 0.14/0.37 bind(X9, divisor(X2)), % 0.14/0.37 bind(X10, a) % 0.14/0.37 ], % 0.14/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 0.14/0.37 % 0.14/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------