%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : HEN003-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 : n007.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:36 EDT 2022 % Result : Unsatisfiable 2.37s 0.64s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : HEN003-3 : TPTP v8.1.0. Released v1.0.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n007.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 14:02:54 EDT 2022 % 0.12/0.34 % CPUTime : % 2.37/0.64 % SZS status Unsatisfiable % 2.37/0.64 % SZS output begin IncompleteProof % 2.37/0.64 cnf(c0, axiom, % 2.37/0.64 zero != divide(a,a)). % 2.37/0.64 cnf(c1, plain, % 2.37/0.64 zero != divide(a,a), % 2.37/0.64 inference(start, [], [c0])). % 2.37/0.64 % 2.37/0.64 cnf(c2, axiom, % 2.37/0.64 X0 = X1 | ~less_equal(X1,X0) | ~less_equal(X0,X1)). % 2.37/0.64 cnf(a0, assumption, % 2.37/0.64 divide(a,a) = X0). % 2.37/0.64 cnf(c3, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 2.37/0.64 cnf(c4, plain, % 2.37/0.64 ~less_equal(X1,X0) | ~less_equal(X0,X1), % 2.37/0.64 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 2.37/0.64 cnf(c5, plain, % 2.37/0.64 X1 != X2 | zero != X2, % 2.37/0.64 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 2.37/0.64 % 2.37/0.64 cnf(a1, assumption, % 2.37/0.64 X1 = X2). % 2.37/0.64 cnf(c6, plain, % 2.37/0.64 zero != X2, % 2.37/0.64 inference(reflexivity, [assumptions([a1])], [c5])). % 2.37/0.64 % 2.37/0.64 cnf(a2, assumption, % 2.37/0.64 zero = X2). % 2.37/0.64 cnf(c7, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(reflexivity, [assumptions([a2])], [c6])). % 2.37/0.64 % 2.37/0.64 cnf(c8, axiom, % 2.37/0.64 less_equal(zero,X3)). % 2.37/0.64 cnf(a3, assumption, % 2.37/0.64 X1 = zero). % 2.37/0.64 cnf(a4, assumption, % 2.37/0.64 X0 = X3). % 2.37/0.64 cnf(c9, plain, % 2.37/0.64 ~less_equal(X0,X1), % 2.37/0.64 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])). % 2.37/0.64 cnf(c10, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])). % 2.37/0.64 % 2.37/0.64 cnf(c11, axiom, % 2.37/0.64 less_equal(X4,X5) | divide(X4,X5) != zero). % 2.37/0.64 cnf(a5, assumption, % 2.37/0.64 X0 = X4). % 2.37/0.64 cnf(a6, assumption, % 2.37/0.64 X1 = X5). % 2.37/0.64 cnf(c12, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])). % 2.37/0.64 cnf(c13, plain, % 2.37/0.64 divide(X4,X5) != zero, % 2.37/0.64 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])). % 2.37/0.64 % 2.37/0.64 cnf(c14, axiom, % 2.37/0.64 X6 = X7 | ~less_equal(X7,X6) | ~less_equal(X6,X7)). % 2.37/0.64 cnf(a7, assumption, % 2.37/0.64 divide(X4,X5) = X6). % 2.37/0.64 cnf(c15, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(variable_extension, [assumptions([a7])], [c13, c14])). % 2.37/0.64 cnf(c16, plain, % 2.37/0.64 ~less_equal(X7,X6) | ~less_equal(X6,X7), % 2.37/0.64 inference(variable_extension, [assumptions([a7])], [c13, c14])). % 2.37/0.64 cnf(c17, plain, % 2.37/0.64 X7 != X8 | X8 != zero, % 2.37/0.64 inference(variable_extension, [assumptions([a7])], [c13, c14])). % 2.37/0.64 % 2.37/0.64 cnf(a8, assumption, % 2.37/0.64 X7 = X8). % 2.37/0.64 cnf(c18, plain, % 2.37/0.64 X8 != zero, % 2.37/0.64 inference(reflexivity, [assumptions([a8])], [c17])). % 2.37/0.64 % 2.37/0.64 cnf(a9, assumption, % 2.37/0.64 X8 = zero). % 2.37/0.64 cnf(c19, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(reflexivity, [assumptions([a9])], [c18])). % 2.37/0.64 % 2.37/0.64 cnf(c20, axiom, % 2.37/0.64 less_equal(zero,X9)). % 2.37/0.64 cnf(a10, assumption, % 2.37/0.64 X7 = zero). % 2.37/0.64 cnf(a11, assumption, % 2.37/0.64 X6 = X9). % 2.37/0.64 cnf(c21, plain, % 2.37/0.64 ~less_equal(X6,X7), % 2.37/0.64 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c20])). % 2.37/0.64 cnf(c22, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c20])). % 2.37/0.64 % 2.37/0.64 cnf(c23, axiom, % 2.37/0.64 less_equal(divide(divide(X10,X11),divide(X12,X11)),divide(divide(X10,X12),X11))). % 2.37/0.64 cnf(a12, assumption, % 2.37/0.64 X13 = X6). % 2.37/0.64 cnf(a13, assumption, % 2.37/0.64 X14 = X7). % 2.37/0.64 cnf(c24, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(lazy_predicate_extension, [assumptions([a12, a13])], [c21, c23])). % 2.37/0.64 cnf(c25, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(lazy_predicate_extension, [assumptions([a12, a13])], [c21, c23])). % 2.37/0.64 cnf(c26, plain, % 2.37/0.64 divide(divide(X10,X11),divide(X12,X11)) != X13 | divide(divide(X10,X12),X11) != X14, % 2.37/0.64 inference(lazy_predicate_extension, [assumptions([a12, a13])], [c21, c23])). % 2.37/0.64 % 2.37/0.64 cnf(c27, axiom, % 2.37/0.64 divide(X15,X16) = zero | ~less_equal(X15,X16)). % 2.37/0.64 cnf(a14, assumption, % 2.37/0.64 divide(X12,X11) = divide(X15,X16)). % 2.37/0.64 cnf(c28, plain, % 2.37/0.64 divide(divide(X10,X12),X11) != X14, % 2.37/0.64 inference(strict_function_extension, [assumptions([a14])], [c26, c27])). % 2.37/0.64 cnf(c29, plain, % 2.37/0.64 ~less_equal(X15,X16), % 2.37/0.64 inference(strict_function_extension, [assumptions([a14])], [c26, c27])). % 2.37/0.64 cnf(c30, plain, % 2.37/0.64 X17 != zero | divide(divide(X10,X11),X17) != X13, % 2.37/0.64 inference(strict_function_extension, [assumptions([a14])], [c26, c27])). % 2.37/0.64 % 2.37/0.64 cnf(a15, assumption, % 2.37/0.64 X17 = zero). % 2.37/0.64 cnf(c31, plain, % 2.37/0.64 divide(divide(X10,X11),X17) != X13, % 2.37/0.64 inference(reflexivity, [assumptions([a15])], [c30])). % 2.37/0.64 % 2.37/0.64 cnf(a16, assumption, % 2.37/0.64 divide(divide(X10,X11),X17) = X13). % 2.37/0.64 cnf(c32, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(reflexivity, [assumptions([a16])], [c31])). % 2.37/0.64 % 2.37/0.64 cnf(c33, axiom, % 2.37/0.64 less_equal(divide(X18,X19),X18)). % 2.37/0.64 cnf(a17, assumption, % 2.37/0.64 X15 = divide(X18,X19)). % 2.37/0.64 cnf(a18, assumption, % 2.37/0.64 X16 = X18). % 2.37/0.64 cnf(c34, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(strict_predicate_extension, [assumptions([a17, a18])], [c29, c33])). % 2.37/0.64 cnf(c35, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(strict_predicate_extension, [assumptions([a17, a18])], [c29, c33])). % 2.37/0.64 % 2.37/0.64 cnf(c36, axiom, % 2.37/0.64 divide(X20,X21) = zero | ~less_equal(X20,X21)). % 2.37/0.64 cnf(a19, assumption, % 2.37/0.64 divide(divide(X10,X12),X11) = divide(X20,X21)). % 2.37/0.64 cnf(c37, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(strict_function_extension, [assumptions([a19])], [c28, c36])). % 2.37/0.64 cnf(c38, plain, % 2.37/0.64 ~less_equal(X20,X21), % 2.37/0.64 inference(strict_function_extension, [assumptions([a19])], [c28, c36])). % 2.37/0.64 cnf(c39, plain, % 2.37/0.64 X22 != zero | X22 != X14, % 2.37/0.64 inference(strict_function_extension, [assumptions([a19])], [c28, c36])). % 2.37/0.64 % 2.37/0.64 cnf(a20, assumption, % 2.37/0.64 X22 = zero). % 2.37/0.64 cnf(c40, plain, % 2.37/0.64 X22 != X14, % 2.37/0.64 inference(reflexivity, [assumptions([a20])], [c39])). % 2.37/0.64 % 2.37/0.64 cnf(a21, assumption, % 2.37/0.64 X22 = X14). % 2.37/0.64 cnf(c41, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(reflexivity, [assumptions([a21])], [c40])). % 2.37/0.64 % 2.37/0.64 cnf(c42, axiom, % 2.37/0.64 less_equal(divide(X23,X24),X23)). % 2.37/0.64 cnf(a22, assumption, % 2.37/0.64 X20 = divide(X23,X24)). % 2.37/0.64 cnf(a23, assumption, % 2.37/0.64 X21 = X23). % 2.37/0.64 cnf(c43, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(strict_predicate_extension, [assumptions([a22, a23])], [c38, c42])). % 2.37/0.64 cnf(c44, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(strict_predicate_extension, [assumptions([a22, a23])], [c38, c42])). % 2.37/0.64 % 2.37/0.64 cnf(c45, plain, % 2.37/0.64 $false, % 2.37/0.64 inference(constraint_solving, [ % 2.37/0.64 bind(X0, divide(a,a)), % 2.37/0.64 bind(X1, zero), % 2.37/0.64 bind(X2, zero), % 2.37/0.64 bind(X3, divide(a,a)), % 2.37/0.64 bind(X4, divide(a,a)), % 2.37/0.64 bind(X5, zero), % 2.37/0.64 bind(X6, divide(X4,X5)), % 2.37/0.64 bind(X7, zero), % 2.37/0.64 bind(X8, zero), % 2.37/0.64 bind(X9, divide(X4,X5)), % 2.37/0.64 bind(X10, a), % 2.37/0.64 bind(X11, a), % 2.37/0.64 bind(X12, divide(X18,X19)), % 2.37/0.64 bind(X13, divide(X4,X5)), % 2.37/0.64 bind(X14, zero), % 2.37/0.64 bind(X15, divide(X18,X19)), % 2.37/0.64 bind(X16, a), % 2.37/0.64 bind(X17, zero), % 2.37/0.64 bind(X18, a), % 2.37/0.64 bind(X19, X19), % 2.37/0.64 bind(X20, divide(X10,X12)), % 2.37/0.64 bind(X21, a), % 2.37/0.64 bind(X22, zero), % 2.37/0.64 bind(X23, a), % 2.37/0.64 bind(X24, divide(X18,X19)) % 2.37/0.64 ], % 2.37/0.64 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23])). % 2.37/0.64 % 2.37/0.64 % SZS output end IncompleteProof %------------------------------------------------------------------------------