%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : HEN006-4 : 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 : n014.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:41 EDT 2022 % Result : Unsatisfiable 7.34s 1.32s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : HEN006-4 : 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.13/0.34 % Computer : n014.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jul 1 14:48:10 EDT 2022 % 0.13/0.34 % CPUTime : % 7.34/1.32 % SZS status Unsatisfiable % 7.34/1.32 % SZS output begin IncompleteProof % 7.34/1.32 cnf(c0, axiom, % 7.34/1.32 ~less_equal(divide(a,d),b)). % 7.34/1.32 cnf(c1, plain, % 7.34/1.32 ~less_equal(divide(a,d),b), % 7.34/1.32 inference(start, [], [c0])). % 7.34/1.32 % 7.34/1.32 cnf(c2, axiom, % 7.34/1.32 less_equal(X0,X1) | ~less_equal(X2,X1) | ~less_equal(X0,X2)). % 7.34/1.32 cnf(a0, assumption, % 7.34/1.32 divide(a,d) = X0). % 7.34/1.32 cnf(a1, assumption, % 7.34/1.32 b = X1). % 7.34/1.32 cnf(c3, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 7.34/1.32 cnf(c4, plain, % 7.34/1.32 ~less_equal(X2,X1) | ~less_equal(X0,X2), % 7.34/1.32 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 7.34/1.32 % 7.34/1.32 cnf(c5, axiom, % 7.34/1.32 less_equal(divide(X3,X4),X3)). % 7.34/1.32 cnf(a2, assumption, % 7.34/1.32 X2 = divide(X3,X4)). % 7.34/1.32 cnf(a3, assumption, % 7.34/1.32 X1 = X3). % 7.34/1.32 cnf(c6, plain, % 7.34/1.32 ~less_equal(X0,X2), % 7.34/1.32 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 7.34/1.32 cnf(c7, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 7.34/1.32 % 7.34/1.32 cnf(c8, axiom, % 7.34/1.32 less_equal(X5,X6) | divide(X5,X6) != zero). % 7.34/1.32 cnf(a4, assumption, % 7.34/1.32 X0 = X5). % 7.34/1.32 cnf(a5, assumption, % 7.34/1.32 X2 = X6). % 7.34/1.32 cnf(c9, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 7.34/1.32 cnf(c10, plain, % 7.34/1.32 divide(X5,X6) != zero, % 7.34/1.32 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 7.34/1.32 % 7.34/1.32 cnf(c11, axiom, % 7.34/1.32 X7 = X8 | ~less_equal(X8,X7) | ~less_equal(X7,X8)). % 7.34/1.32 cnf(a6, assumption, % 7.34/1.32 divide(X5,X6) = X7). % 7.34/1.32 cnf(c12, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(variable_extension, [assumptions([a6])], [c10, c11])). % 7.34/1.32 cnf(c13, plain, % 7.34/1.32 ~less_equal(X8,X7) | ~less_equal(X7,X8), % 7.34/1.32 inference(variable_extension, [assumptions([a6])], [c10, c11])). % 7.34/1.32 cnf(c14, plain, % 7.34/1.32 X8 != X9 | X9 != zero, % 7.34/1.32 inference(variable_extension, [assumptions([a6])], [c10, c11])). % 7.34/1.32 % 7.34/1.32 cnf(a7, assumption, % 7.34/1.32 X8 = X9). % 7.34/1.32 cnf(c15, plain, % 7.34/1.32 X9 != zero, % 7.34/1.32 inference(reflexivity, [assumptions([a7])], [c14])). % 7.34/1.32 % 7.34/1.32 cnf(a8, assumption, % 7.34/1.32 X9 = zero). % 7.34/1.32 cnf(c16, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(reflexivity, [assumptions([a8])], [c15])). % 7.34/1.32 % 7.34/1.32 cnf(c17, axiom, % 7.34/1.32 less_equal(zero,X10)). % 7.34/1.32 cnf(a9, assumption, % 7.34/1.32 X8 = zero). % 7.34/1.32 cnf(a10, assumption, % 7.34/1.32 X7 = X10). % 7.34/1.32 cnf(c18, plain, % 7.34/1.32 ~less_equal(X7,X8), % 7.34/1.32 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c17])). % 7.34/1.32 cnf(c19, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c17])). % 7.34/1.32 % 7.34/1.32 cnf(c20, axiom, % 7.34/1.32 less_equal(divide(divide(X11,X12),divide(X13,X12)),divide(divide(X11,X13),X12))). % 7.34/1.32 cnf(a11, assumption, % 7.34/1.32 X14 = X7). % 7.34/1.32 cnf(a12, assumption, % 7.34/1.32 X15 = X8). % 7.34/1.32 cnf(c21, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(lazy_predicate_extension, [assumptions([a11, a12])], [c18, c20])). % 7.34/1.32 cnf(c22, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(lazy_predicate_extension, [assumptions([a11, a12])], [c18, c20])). % 7.34/1.32 cnf(c23, plain, % 7.34/1.32 divide(divide(X11,X12),divide(X13,X12)) != X14 | divide(divide(X11,X13),X12) != X15, % 7.34/1.32 inference(lazy_predicate_extension, [assumptions([a11, a12])], [c18, c20])). % 7.34/1.32 % 7.34/1.32 cnf(a13, assumption, % 7.34/1.32 divide(divide(X11,X12),divide(X13,X12)) = X14). % 7.34/1.32 cnf(c24, plain, % 7.34/1.32 divide(divide(X11,X13),X12) != X15, % 7.34/1.32 inference(reflexivity, [assumptions([a13])], [c23])). % 7.34/1.32 % 7.34/1.32 cnf(c25, axiom, % 7.34/1.32 divide(X16,X17) = zero | ~less_equal(X16,X17)). % 7.34/1.32 cnf(a14, assumption, % 7.34/1.32 divide(divide(X11,X13),X12) = divide(X16,X17)). % 7.34/1.32 cnf(c26, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(strict_function_extension, [assumptions([a14])], [c24, c25])). % 7.34/1.32 cnf(c27, plain, % 7.34/1.32 ~less_equal(X16,X17), % 7.34/1.32 inference(strict_function_extension, [assumptions([a14])], [c24, c25])). % 7.34/1.32 cnf(c28, plain, % 7.34/1.32 X18 != zero | X18 != X15, % 7.34/1.32 inference(strict_function_extension, [assumptions([a14])], [c24, c25])). % 7.34/1.32 % 7.34/1.32 cnf(a15, assumption, % 7.34/1.32 X18 = zero). % 7.34/1.32 cnf(c29, plain, % 7.34/1.32 X18 != X15, % 7.34/1.32 inference(reflexivity, [assumptions([a15])], [c28])). % 7.34/1.32 % 7.34/1.32 cnf(a16, assumption, % 7.34/1.32 X18 = X15). % 7.34/1.32 cnf(c30, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(reflexivity, [assumptions([a16])], [c29])). % 7.34/1.32 % 7.34/1.32 cnf(c31, axiom, % 7.34/1.32 less_equal(divide(a,b),d)). % 7.34/1.32 cnf(a17, assumption, % 7.34/1.32 X16 = divide(a,b)). % 7.34/1.32 cnf(a18, assumption, % 7.34/1.32 X17 = d). % 7.34/1.32 cnf(c32, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(strict_predicate_extension, [assumptions([a17, a18])], [c27, c31])). % 7.34/1.32 cnf(c33, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(strict_predicate_extension, [assumptions([a17, a18])], [c27, c31])). % 7.34/1.32 % 7.34/1.32 cnf(c34, plain, % 7.34/1.32 $false, % 7.34/1.32 inference(constraint_solving, [ % 7.34/1.32 bind(X0, divide(a,d)), % 7.34/1.32 bind(X1, b), % 7.34/1.32 bind(X2, divide(X3,X4)), % 7.34/1.32 bind(X3, b), % 7.34/1.32 bind(X4, d), % 7.34/1.32 bind(X5, divide(a,d)), % 7.34/1.32 bind(X6, divide(X3,X4)), % 7.34/1.32 bind(X7, divide(X5,X6)), % 7.34/1.32 bind(X8, zero), % 7.34/1.32 bind(X9, zero), % 7.34/1.32 bind(X10, divide(X5,X6)), % 7.34/1.32 bind(X11, a), % 7.34/1.32 bind(X12, d), % 7.34/1.32 bind(X13, b), % 7.34/1.32 bind(X14, divide(X5,X6)), % 7.34/1.32 bind(X15, zero), % 7.34/1.32 bind(X16, divide(X11,X13)), % 7.34/1.32 bind(X17, d), % 7.34/1.32 bind(X18, zero) % 7.34/1.32 ], % 7.34/1.32 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])). % 7.34/1.32 % 7.34/1.32 % SZS output end IncompleteProof %------------------------------------------------------------------------------