%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : HEN009-4 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n021.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:46 EDT 2022 % Result : Unsatisfiable 0.19s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : HEN009-4 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.04/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n021.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Fri Jul 1 13:53:29 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.38 % SZS status Unsatisfiable % 0.19/0.38 % SZS output begin IncompleteProof % 0.19/0.38 cnf(c0, axiom, % 0.19/0.38 divide(identity,a) != divide(identity,divide(identity,divide(identity,a)))). % 0.19/0.38 cnf(c1, plain, % 0.19/0.38 divide(identity,a) != divide(identity,divide(identity,divide(identity,a))), % 0.19/0.38 inference(start, [], [c0])). % 0.19/0.38 % 0.19/0.38 cnf(c2, axiom, % 0.19/0.38 X0 = X1 | ~less_equal(X1,X0) | ~less_equal(X0,X1)). % 0.19/0.38 cnf(a0, assumption, % 0.19/0.38 divide(identity,divide(identity,divide(identity,a))) = X1). % 0.19/0.38 cnf(c3, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 0.19/0.38 cnf(c4, plain, % 0.19/0.38 ~less_equal(X1,X0) | ~less_equal(X0,X1), % 0.19/0.38 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 0.19/0.38 cnf(c5, plain, % 0.19/0.38 X0 != X2 | divide(identity,a) != X2, % 0.19/0.38 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 0.19/0.38 % 0.19/0.38 cnf(a1, assumption, % 0.19/0.38 X0 = X2). % 0.19/0.38 cnf(c6, plain, % 0.19/0.38 divide(identity,a) != X2, % 0.19/0.38 inference(reflexivity, [assumptions([a1])], [c5])). % 0.19/0.38 % 0.19/0.38 cnf(a2, assumption, % 0.19/0.38 divide(identity,a) = X2). % 0.19/0.38 cnf(c7, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(reflexivity, [assumptions([a2])], [c6])). % 0.19/0.38 % 0.19/0.38 cnf(c8, axiom, % 0.19/0.38 less_equal(divide(X3,X4),X5) | ~less_equal(divide(X3,X5),X4)). % 0.19/0.38 cnf(a3, assumption, % 0.19/0.38 X1 = divide(X3,X4)). % 0.19/0.38 cnf(a4, assumption, % 0.19/0.38 X0 = X5). % 0.19/0.38 cnf(c9, plain, % 0.19/0.38 ~less_equal(X0,X1), % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])). % 0.19/0.38 cnf(c10, plain, % 0.19/0.38 ~less_equal(divide(X3,X5),X4), % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])). % 0.19/0.38 % 0.19/0.38 cnf(c11, axiom, % 0.19/0.38 less_equal(divide(X6,X7),divide(X8,X7)) | ~less_equal(X6,X8)). % 0.19/0.38 cnf(a5, assumption, % 0.19/0.38 divide(X3,X5) = divide(X6,X7)). % 0.19/0.38 cnf(a6, assumption, % 0.19/0.38 X4 = divide(X8,X7)). % 0.19/0.38 cnf(c12, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.19/0.38 cnf(c13, plain, % 0.19/0.38 ~less_equal(X6,X8), % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.19/0.38 % 0.19/0.38 cnf(c14, axiom, % 0.19/0.38 less_equal(X9,identity)). % 0.19/0.38 cnf(a7, assumption, % 0.19/0.38 X6 = X9). % 0.19/0.38 cnf(a8, assumption, % 0.19/0.38 X8 = identity). % 0.19/0.38 cnf(c15, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.19/0.38 cnf(c16, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.19/0.38 % 0.19/0.38 cnf(c17, axiom, % 0.19/0.38 less_equal(divide(X10,X11),divide(X10,X12)) | ~less_equal(X12,X11)). % 0.19/0.38 cnf(a9, assumption, % 0.19/0.38 X0 = divide(X10,X11)). % 0.19/0.38 cnf(a10, assumption, % 0.19/0.38 X1 = divide(X10,X12)). % 0.19/0.38 cnf(c18, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a9, a10])], [c9, c17])). % 0.19/0.38 cnf(c19, plain, % 0.19/0.38 ~less_equal(X12,X11), % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a9, a10])], [c9, c17])). % 0.19/0.38 % 0.19/0.38 cnf(c20, axiom, % 0.19/0.38 less_equal(divide(X13,X14),X15) | ~less_equal(divide(X13,X15),X14)). % 0.19/0.38 cnf(a11, assumption, % 0.19/0.38 X12 = divide(X13,X14)). % 0.19/0.38 cnf(a12, assumption, % 0.19/0.38 X11 = X15). % 0.19/0.38 cnf(c21, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])). % 0.19/0.38 cnf(c22, plain, % 0.19/0.38 ~less_equal(divide(X13,X15),X14), % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])). % 0.19/0.38 % 0.19/0.38 cnf(c23, axiom, % 0.19/0.38 less_equal(divide(X16,X17),divide(X18,X17)) | ~less_equal(X16,X18)). % 0.19/0.38 cnf(a13, assumption, % 0.19/0.38 divide(X13,X15) = divide(X16,X17)). % 0.19/0.38 cnf(a14, assumption, % 0.19/0.38 X14 = divide(X18,X17)). % 0.19/0.38 cnf(c24, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a13, a14])], [c22, c23])). % 0.19/0.38 cnf(c25, plain, % 0.19/0.38 ~less_equal(X16,X18), % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a13, a14])], [c22, c23])). % 0.19/0.38 % 0.19/0.38 cnf(c26, plain, % 0.19/0.38 less_equal(X6,X8)). % 0.19/0.38 cnf(a15, assumption, % 0.19/0.38 X16 = X6). % 0.19/0.38 cnf(a16, assumption, % 0.19/0.38 X18 = X8). % 0.19/0.38 cnf(c27, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(predicate_reduction, [assumptions([a15, a16])], [c25, c26])). % 0.19/0.38 % 0.19/0.38 cnf(c28, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(constraint_solving, [ % 0.19/0.38 bind(X0, divide(identity,a)), % 0.19/0.38 bind(X1, divide(identity,divide(identity,divide(identity,a)))), % 0.19/0.38 bind(X2, divide(identity,a)), % 0.19/0.38 bind(X3, identity), % 0.19/0.38 bind(X4, divide(identity,divide(identity,a))), % 0.19/0.38 bind(X5, divide(identity,a)), % 0.19/0.38 bind(X6, identity), % 0.19/0.38 bind(X7, divide(identity,a)), % 0.19/0.38 bind(X8, identity), % 0.19/0.38 bind(X9, identity), % 0.19/0.38 bind(X10, identity), % 0.19/0.38 bind(X11, a), % 0.19/0.38 bind(X12, divide(identity,divide(identity,a))), % 0.19/0.38 bind(X13, identity), % 0.19/0.38 bind(X14, divide(identity,a)), % 0.19/0.38 bind(X15, a), % 0.19/0.38 bind(X16, identity), % 0.19/0.38 bind(X17, a), % 0.19/0.38 bind(X18, identity) % 0.19/0.38 ], % 0.19/0.38 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])). % 0.19/0.38 % 0.19/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------