%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM014-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 : n026.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.12s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM014-1 : TPTP v8.1.0. Released v1.0.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.34 % Computer : n026.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jul 5 12:35:37 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.35 % SZS status Unsatisfiable % 0.12/0.35 % SZS output begin IncompleteProof % 0.12/0.35 cnf(c0, axiom, % 0.12/0.35 ~divides(a,b)). % 0.12/0.35 cnf(c1, plain, % 0.12/0.35 ~divides(a,b), % 0.12/0.35 inference(start, [], [c0])). % 0.12/0.35 % 0.12/0.35 cnf(c2, axiom, % 0.12/0.35 divides(X0,X1) | divides(X0,X2) | ~divides(X0,X3) | ~product(X2,X1,X3) | ~prime(X0)). % 0.12/0.35 cnf(a0, assumption, % 0.12/0.35 a = X0). % 0.12/0.35 cnf(a1, assumption, % 0.12/0.35 b = X2). % 0.12/0.35 cnf(c3, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.35 cnf(c4, plain, % 0.12/0.35 divides(X0,X1) | ~divides(X0,X3) | ~product(X2,X1,X3) | ~prime(X0), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.35 % 0.12/0.35 cnf(c5, plain, % 0.12/0.35 ~divides(a,b)). % 0.12/0.35 cnf(a2, assumption, % 0.12/0.35 X0 = a). % 0.12/0.35 cnf(a3, assumption, % 0.12/0.35 X1 = b). % 0.12/0.35 cnf(c6, plain, % 0.12/0.35 ~divides(X0,X3) | ~product(X2,X1,X3) | ~prime(X0), % 0.12/0.35 inference(predicate_reduction, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.35 % 0.12/0.35 cnf(c7, axiom, % 0.12/0.35 divides(X4,X5) | ~product(X4,X6,X5)). % 0.12/0.35 cnf(a4, assumption, % 0.12/0.35 X0 = X4). % 0.12/0.35 cnf(a5, assumption, % 0.12/0.35 X3 = X5). % 0.12/0.35 cnf(c8, plain, % 0.12/0.35 ~product(X2,X1,X3) | ~prime(X0), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])). % 0.12/0.35 cnf(c9, plain, % 0.12/0.35 ~product(X4,X6,X5), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])). % 0.12/0.35 % 0.12/0.35 cnf(c10, axiom, % 0.12/0.35 product(a,square(c),square(b))). % 0.12/0.35 cnf(a6, assumption, % 0.12/0.35 X4 = a). % 0.12/0.35 cnf(a7, assumption, % 0.12/0.35 X6 = square(c)). % 0.12/0.35 cnf(a8, assumption, % 0.12/0.35 X5 = square(b)). % 0.12/0.35 cnf(c11, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c9, c10])). % 0.12/0.35 cnf(c12, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c9, c10])). % 0.12/0.35 % 0.12/0.35 cnf(c13, axiom, % 0.12/0.35 product(X7,X7,square(X7))). % 0.12/0.35 cnf(a9, assumption, % 0.12/0.35 X2 = X7). % 0.12/0.35 cnf(a10, assumption, % 0.12/0.35 X1 = X7). % 0.12/0.35 cnf(a11, assumption, % 0.12/0.35 X3 = square(X7)). % 0.12/0.35 cnf(c14, plain, % 0.12/0.35 ~prime(X0), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c8, c13])). % 0.12/0.35 cnf(c15, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c8, c13])). % 0.12/0.35 % 0.12/0.35 cnf(c16, axiom, % 0.12/0.35 prime(a)). % 0.12/0.35 cnf(a12, assumption, % 0.12/0.35 X0 = a). % 0.12/0.35 cnf(c17, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a12])], [c14, c16])). % 0.12/0.35 cnf(c18, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a12])], [c14, c16])). % 0.12/0.35 % 0.12/0.35 cnf(c19, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(constraint_solving, [ % 0.12/0.35 bind(X0, a), % 0.12/0.35 bind(X1, b), % 0.12/0.35 bind(X2, b), % 0.12/0.35 bind(X3, square(b)), % 0.12/0.35 bind(X4, a), % 0.12/0.35 bind(X5, square(b)), % 0.12/0.35 bind(X6, square(c)), % 0.12/0.35 bind(X7, b) % 0.12/0.35 ], % 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 0.12/0.35 % 0.12/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------