%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : HEN008-3 : 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 : n008.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 : Sat Jul 16 12:56:44 EDT 2022 % Result : Unsatisfiable 1.85s 0.57s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : HEN008-3 : TPTP v8.1.0. Released v1.0.0. % 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n008.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 : Fri Jul 1 13:10:38 EDT 2022 % 0.12/0.34 % CPUTime : % 1.85/0.57 % SZS status Unsatisfiable % 1.85/0.57 % SZS output begin IncompleteProof % 1.85/0.57 cnf(c0, axiom, % 1.85/0.57 ~less_equal(divide(a,c),divide(b,c))). % 1.85/0.57 cnf(c1, plain, % 1.85/0.57 ~less_equal(divide(a,c),divide(b,c)), % 1.85/0.57 inference(start, [], [c0])). % 1.85/0.57 % 1.85/0.57 cnf(c2, axiom, % 1.85/0.57 less_equal(X0,X1) | divide(X0,X1) != zero). % 1.85/0.57 cnf(a0, assumption, % 1.85/0.57 divide(a,c) = X0). % 1.85/0.57 cnf(a1, assumption, % 1.85/0.57 divide(b,c) = X1). % 1.85/0.57 cnf(c3, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.85/0.57 cnf(c4, plain, % 1.85/0.57 divide(X0,X1) != zero, % 1.85/0.57 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.85/0.57 % 1.85/0.57 cnf(c5, axiom, % 1.85/0.57 X2 = X3 | ~less_equal(X3,X2) | ~less_equal(X2,X3)). % 1.85/0.57 cnf(a2, assumption, % 1.85/0.57 divide(X0,X1) = X2). % 1.85/0.57 cnf(c6, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(variable_extension, [assumptions([a2])], [c4, c5])). % 1.85/0.57 cnf(c7, plain, % 1.85/0.57 ~less_equal(X3,X2) | ~less_equal(X2,X3), % 1.85/0.57 inference(variable_extension, [assumptions([a2])], [c4, c5])). % 1.85/0.57 cnf(c8, plain, % 1.85/0.57 X3 != X4 | X4 != zero, % 1.85/0.57 inference(variable_extension, [assumptions([a2])], [c4, c5])). % 1.85/0.57 % 1.85/0.57 cnf(a3, assumption, % 1.85/0.57 X3 = X4). % 1.85/0.57 cnf(c9, plain, % 1.85/0.57 X4 != zero, % 1.85/0.57 inference(reflexivity, [assumptions([a3])], [c8])). % 1.85/0.57 % 1.85/0.57 cnf(a4, assumption, % 1.85/0.57 X4 = zero). % 1.85/0.57 cnf(c10, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(reflexivity, [assumptions([a4])], [c9])). % 1.85/0.57 % 1.85/0.57 cnf(c11, axiom, % 1.85/0.57 less_equal(zero,X5)). % 1.85/0.57 cnf(a5, assumption, % 1.85/0.57 X3 = zero). % 1.85/0.57 cnf(a6, assumption, % 1.85/0.57 X2 = X5). % 1.85/0.57 cnf(c12, plain, % 1.85/0.57 ~less_equal(X2,X3), % 1.85/0.57 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c11])). % 1.85/0.57 cnf(c13, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c11])). % 1.85/0.57 % 1.85/0.57 cnf(c14, axiom, % 1.85/0.57 less_equal(divide(divide(X6,X7),divide(X8,X7)),divide(divide(X6,X8),X7))). % 1.85/0.57 cnf(a7, assumption, % 1.85/0.57 X9 = X2). % 1.85/0.57 cnf(a8, assumption, % 1.85/0.57 X10 = X3). % 1.85/0.57 cnf(c15, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(lazy_predicate_extension, [assumptions([a7, a8])], [c12, c14])). % 1.85/0.57 cnf(c16, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(lazy_predicate_extension, [assumptions([a7, a8])], [c12, c14])). % 1.85/0.57 cnf(c17, plain, % 1.85/0.57 divide(divide(X6,X7),divide(X8,X7)) != X9 | divide(divide(X6,X8),X7) != X10, % 1.85/0.57 inference(lazy_predicate_extension, [assumptions([a7, a8])], [c12, c14])). % 1.85/0.57 % 1.85/0.57 cnf(a9, assumption, % 1.85/0.57 divide(divide(X6,X7),divide(X8,X7)) = X9). % 1.85/0.57 cnf(c18, plain, % 1.85/0.57 divide(divide(X6,X8),X7) != X10, % 1.85/0.57 inference(reflexivity, [assumptions([a9])], [c17])). % 1.85/0.57 % 1.85/0.57 cnf(c19, axiom, % 1.85/0.57 divide(X11,X12) = zero | ~less_equal(X11,X12)). % 1.85/0.57 cnf(a10, assumption, % 1.85/0.57 divide(X6,X8) = divide(X11,X12)). % 1.85/0.57 cnf(c20, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(strict_function_extension, [assumptions([a10])], [c18, c19])). % 1.85/0.57 cnf(c21, plain, % 1.85/0.57 ~less_equal(X11,X12), % 1.85/0.57 inference(strict_function_extension, [assumptions([a10])], [c18, c19])). % 1.85/0.57 cnf(c22, plain, % 1.85/0.57 X13 != zero | divide(X13,X7) != X10, % 1.85/0.57 inference(strict_function_extension, [assumptions([a10])], [c18, c19])). % 1.85/0.57 % 1.85/0.57 cnf(a11, assumption, % 1.85/0.57 X13 = zero). % 1.85/0.57 cnf(c23, plain, % 1.85/0.57 divide(X13,X7) != X10, % 1.85/0.57 inference(reflexivity, [assumptions([a11])], [c22])). % 1.85/0.57 % 1.85/0.57 cnf(c24, axiom, % 1.85/0.57 divide(X14,X15) = zero | ~less_equal(X14,X15)). % 1.85/0.57 cnf(a12, assumption, % 1.85/0.57 divide(X13,X7) = divide(X14,X15)). % 1.85/0.57 cnf(c25, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(strict_function_extension, [assumptions([a12])], [c23, c24])). % 1.85/0.57 cnf(c26, plain, % 1.85/0.57 ~less_equal(X14,X15), % 1.85/0.57 inference(strict_function_extension, [assumptions([a12])], [c23, c24])). % 1.85/0.57 cnf(c27, plain, % 1.85/0.57 X16 != zero | X16 != X10, % 1.85/0.57 inference(strict_function_extension, [assumptions([a12])], [c23, c24])). % 1.85/0.57 % 1.85/0.57 cnf(a13, assumption, % 1.85/0.57 X16 = zero). % 1.85/0.57 cnf(c28, plain, % 1.85/0.57 X16 != X10, % 1.85/0.57 inference(reflexivity, [assumptions([a13])], [c27])). % 1.85/0.57 % 1.85/0.57 cnf(a14, assumption, % 1.85/0.57 X16 = X10). % 1.85/0.57 cnf(c29, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(reflexivity, [assumptions([a14])], [c28])). % 1.85/0.57 % 1.85/0.57 cnf(c30, axiom, % 1.85/0.57 less_equal(zero,X17)). % 1.85/0.57 cnf(a15, assumption, % 1.85/0.57 X14 = zero). % 1.85/0.57 cnf(a16, assumption, % 1.85/0.57 X15 = X17). % 1.85/0.57 cnf(c31, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(strict_predicate_extension, [assumptions([a15, a16])], [c26, c30])). % 1.85/0.57 cnf(c32, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(strict_predicate_extension, [assumptions([a15, a16])], [c26, c30])). % 1.85/0.57 % 1.85/0.57 cnf(c33, axiom, % 1.85/0.57 less_equal(a,b)). % 1.85/0.57 cnf(a17, assumption, % 1.85/0.57 X11 = a). % 1.85/0.57 cnf(a18, assumption, % 1.85/0.57 X12 = b). % 1.85/0.57 cnf(c34, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(strict_predicate_extension, [assumptions([a17, a18])], [c21, c33])). % 1.85/0.57 cnf(c35, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(strict_predicate_extension, [assumptions([a17, a18])], [c21, c33])). % 1.85/0.57 % 1.85/0.57 cnf(c36, plain, % 1.85/0.57 $false, % 1.85/0.57 inference(constraint_solving, [ % 1.85/0.57 bind(X0, divide(a,c)), % 1.85/0.57 bind(X1, divide(b,c)), % 1.85/0.57 bind(X2, divide(X0,X1)), % 1.85/0.57 bind(X3, zero), % 1.85/0.57 bind(X4, zero), % 1.85/0.57 bind(X5, divide(X0,X1)), % 1.85/0.57 bind(X6, a), % 1.85/0.57 bind(X7, c), % 1.85/0.57 bind(X8, b), % 1.85/0.57 bind(X9, divide(X0,X1)), % 1.85/0.57 bind(X10, zero), % 1.85/0.57 bind(X11, a), % 1.85/0.57 bind(X12, b), % 1.85/0.57 bind(X13, zero), % 1.85/0.57 bind(X14, zero), % 1.85/0.57 bind(X15, c), % 1.85/0.57 bind(X16, zero), % 1.85/0.57 bind(X17, c) % 1.85/0.57 ], % 1.85/0.57 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])). % 1.85/0.57 % 1.85/0.57 % SZS output end IncompleteProof %------------------------------------------------------------------------------