%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM021-1 : TPTP v8.1.0. Bugfixed v4.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 : n015.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:30 EDT 2022 % Result : Unsatisfiable 0.19s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : NUM021-1 : TPTP v8.1.0. Bugfixed v4.0.0. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n015.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 20:14:48 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.39 % SZS status Unsatisfiable % 0.19/0.39 % SZS output begin IncompleteProof % 0.19/0.39 cnf(c0, axiom, % 0.19/0.39 divides(c,a)). % 0.19/0.39 cnf(c1, plain, % 0.19/0.39 divides(c,a), % 0.19/0.39 inference(start, [], [c0])). % 0.19/0.39 % 0.19/0.39 cnf(c2, axiom, % 0.19/0.39 equalish(X0,X1) | less(X0,X1) | ~divides(X0,X1)). % 0.19/0.39 cnf(a0, assumption, % 0.19/0.39 c = X0). % 0.19/0.39 cnf(a1, assumption, % 0.19/0.39 a = X1). % 0.19/0.39 cnf(c3, plain, % 0.19/0.39 $false, % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.39 cnf(c4, plain, % 0.19/0.39 equalish(X0,X1) | less(X0,X1), % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.39 % 0.19/0.39 cnf(c5, axiom, % 0.19/0.39 equalish(X2,X3) | ~equalish(X4,X3) | ~equalish(X2,X4)). % 0.19/0.39 cnf(a2, assumption, % 0.19/0.39 X0 = X4). % 0.19/0.39 cnf(a3, assumption, % 0.19/0.39 X1 = X3). % 0.19/0.39 cnf(c6, plain, % 0.19/0.39 less(X0,X1), % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.19/0.39 cnf(c7, plain, % 0.19/0.39 equalish(X2,X3) | ~equalish(X2,X4), % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.19/0.39 % 0.19/0.39 cnf(c8, axiom, % 0.19/0.39 less(X5,X6) | ~equalish(add(successor(X7),X5),X6)). % 0.19/0.39 cnf(a4, assumption, % 0.19/0.39 X2 = add(successor(X7),X5)). % 0.19/0.39 cnf(a5, assumption, % 0.19/0.39 X3 = X6). % 0.19/0.39 cnf(c9, plain, % 0.19/0.39 ~equalish(X2,X4), % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.19/0.39 cnf(c10, plain, % 0.19/0.39 less(X5,X6), % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.19/0.39 % 0.19/0.39 cnf(c11, axiom, % 0.19/0.39 ~less(b,a)). % 0.19/0.39 cnf(a6, assumption, % 0.19/0.39 X5 = b). % 0.19/0.39 cnf(a7, assumption, % 0.19/0.39 X6 = a). % 0.19/0.39 cnf(c12, plain, % 0.19/0.39 $false, % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.19/0.39 cnf(c13, plain, % 0.19/0.39 $false, % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.19/0.39 % 0.19/0.39 cnf(c14, axiom, % 0.19/0.39 equalish(add(successor(predecessor_of_1st_minus_2nd(X8,X9)),X9),X8) | ~less(X9,X8)). % 0.19/0.39 cnf(a8, assumption, % 0.19/0.39 X2 = add(successor(predecessor_of_1st_minus_2nd(X8,X9)),X9)). % 0.19/0.39 cnf(a9, assumption, % 0.19/0.39 X4 = X8). % 0.19/0.39 cnf(c15, plain, % 0.19/0.39 $false, % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 0.19/0.39 cnf(c16, plain, % 0.19/0.39 ~less(X9,X8), % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 0.19/0.39 % 0.19/0.39 cnf(c17, axiom, % 0.19/0.39 less(b,c)). % 0.19/0.39 cnf(a10, assumption, % 0.19/0.39 X9 = b). % 0.19/0.39 cnf(a11, assumption, % 0.19/0.39 X8 = c). % 0.19/0.39 cnf(c18, plain, % 0.19/0.39 $false, % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 0.19/0.39 cnf(c19, plain, % 0.19/0.39 $false, % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 0.19/0.39 % 0.19/0.39 cnf(c20, axiom, % 0.19/0.39 less(X10,X11) | ~less(X10,X12) | ~less(X12,X11)). % 0.19/0.39 cnf(a12, assumption, % 0.19/0.39 X0 = X12). % 0.19/0.39 cnf(a13, assumption, % 0.19/0.39 X1 = X11). % 0.19/0.39 cnf(c21, plain, % 0.19/0.39 $false, % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c20])). % 0.19/0.39 cnf(c22, plain, % 0.19/0.39 less(X10,X11) | ~less(X10,X12), % 0.19/0.39 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c20])). % 0.19/0.39 % 0.19/0.39 cnf(c23, plain, % 0.19/0.39 ~less(X5,X6)). % 0.19/0.39 cnf(a14, assumption, % 0.19/0.39 X10 = X5). % 0.19/0.39 cnf(a15, assumption, % 0.19/0.39 X11 = X6). % 0.19/0.39 cnf(c24, plain, % 0.19/0.39 ~less(X10,X12), % 0.19/0.39 inference(predicate_reduction, [assumptions([a14, a15])], [c22, c23])). % 0.19/0.39 % 0.19/0.39 cnf(c25, plain, % 0.19/0.39 less(X9,X8)). % 0.19/0.39 cnf(a16, assumption, % 0.19/0.39 X10 = X9). % 0.19/0.39 cnf(a17, assumption, % 0.19/0.39 X12 = X8). % 0.19/0.39 cnf(c26, plain, % 0.19/0.39 $false, % 0.19/0.39 inference(predicate_reduction, [assumptions([a16, a17])], [c24, c25])). % 0.19/0.39 % 0.19/0.39 cnf(c27, plain, % 0.19/0.39 $false, % 0.19/0.39 inference(constraint_solving, [ % 0.19/0.39 bind(X0, c), % 0.19/0.39 bind(X1, a), % 0.19/0.39 bind(X2, add(successor(X7),X5)), % 0.19/0.39 bind(X3, a), % 0.19/0.39 bind(X4, c), % 0.19/0.39 bind(X5, b), % 0.19/0.39 bind(X6, a), % 0.19/0.39 bind(X7, predecessor_of_1st_minus_2nd(X8,X9)), % 0.19/0.39 bind(X8, c), % 0.19/0.39 bind(X9, b), % 0.19/0.39 bind(X10, b), % 0.19/0.39 bind(X11, a), % 0.19/0.39 bind(X12, c) % 0.19/0.39 ], % 0.19/0.39 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 0.19/0.39 % 0.19/0.39 % SZS output end IncompleteProof %------------------------------------------------------------------------------