%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : ALG002-1 : 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 : n023.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 : Thu Jul 14 17:20:21 EDT 2022 % Result : Unsatisfiable 101.53s 13.27s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : ALG002-1 : TPTP v8.1.0. Released v1.0.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n023.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Wed Jun 8 11:39:38 EDT 2022 % 0.12/0.34 % CPUTime : % 101.53/13.27 % SZS status Unsatisfiable % 101.53/13.27 % SZS output begin IncompleteProof % 101.53/13.27 cnf(c0, axiom, % 101.53/13.27 ~greater_than_0(multiplicative_inverse(a))). % 101.53/13.27 cnf(c1, plain, % 101.53/13.27 ~greater_than_0(multiplicative_inverse(a)), % 101.53/13.27 inference(start, [], [c0])). % 101.53/13.27 % 101.53/13.27 cnf(c2, axiom, % 101.53/13.27 greater_than_0(X0) | ~greater_than_0(X1) | ~greater_than_0(X2) | ~product(X2,X1,X0)). % 101.53/13.27 cnf(a0, assumption, % 101.53/13.27 multiplicative_inverse(a) = X0). % 101.53/13.27 cnf(c3, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 101.53/13.27 cnf(c4, plain, % 101.53/13.27 ~greater_than_0(X1) | ~greater_than_0(X2) | ~product(X2,X1,X0), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 101.53/13.27 % 101.53/13.27 cnf(c5, axiom, % 101.53/13.27 greater_than_0(X3) | ~greater_than_0(X4) | ~greater_than_0(X5) | ~product(X5,X4,X3)). % 101.53/13.27 cnf(a1, assumption, % 101.53/13.27 X1 = X3). % 101.53/13.27 cnf(c6, plain, % 101.53/13.27 ~greater_than_0(X2) | ~product(X2,X1,X0), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 101.53/13.27 cnf(c7, plain, % 101.53/13.27 ~greater_than_0(X4) | ~greater_than_0(X5) | ~product(X5,X4,X3), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 101.53/13.27 % 101.53/13.27 cnf(c8, axiom, % 101.53/13.27 greater_than_0(additive_inverse(X6)) | product(X6,X6,additive_identity) | greater_than_0(X6)). % 101.53/13.27 cnf(a2, assumption, % 101.53/13.27 X4 = additive_inverse(X6)). % 101.53/13.27 cnf(c9, plain, % 101.53/13.27 ~greater_than_0(X5) | ~product(X5,X4,X3), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 101.53/13.27 cnf(c10, plain, % 101.53/13.27 product(X6,X6,additive_identity) | greater_than_0(X6), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 101.53/13.27 % 101.53/13.27 cnf(c11, axiom, % 101.53/13.27 product(X7,X7,additive_identity) | ~product(X8,X8,additive_identity) | ~product(X8,X9,X7)). % 101.53/13.27 cnf(a3, assumption, % 101.53/13.27 X6 = X8). % 101.53/13.27 cnf(a4, assumption, % 101.53/13.27 X6 = X8). % 101.53/13.27 cnf(a5, assumption, % 101.53/13.27 additive_identity = additive_identity). % 101.53/13.27 cnf(c12, plain, % 101.53/13.27 greater_than_0(X6), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c10, c11])). % 101.53/13.27 cnf(c13, plain, % 101.53/13.27 product(X7,X7,additive_identity) | ~product(X8,X9,X7), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c10, c11])). % 101.53/13.27 % 101.53/13.27 cnf(c14, axiom, % 101.53/13.27 ~product(multiplicative_identity,multiplicative_identity,additive_identity)). % 101.53/13.27 cnf(a6, assumption, % 101.53/13.27 X7 = multiplicative_identity). % 101.53/13.27 cnf(a7, assumption, % 101.53/13.27 X7 = multiplicative_identity). % 101.53/13.27 cnf(a8, assumption, % 101.53/13.27 additive_identity = additive_identity). % 101.53/13.27 cnf(c15, plain, % 101.53/13.27 ~product(X8,X9,X7), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c13, c14])). % 101.53/13.27 cnf(c16, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c13, c14])). % 101.53/13.27 % 101.53/13.27 cnf(c17, axiom, % 101.53/13.27 product(X10,X11,X12) | ~product(X11,X10,X12)). % 101.53/13.27 cnf(a9, assumption, % 101.53/13.27 X8 = X10). % 101.53/13.27 cnf(a10, assumption, % 101.53/13.27 X9 = X11). % 101.53/13.27 cnf(a11, assumption, % 101.53/13.27 X7 = X12). % 101.53/13.27 cnf(c18, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c15, c17])). % 101.53/13.27 cnf(c19, plain, % 101.53/13.27 ~product(X11,X10,X12), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c15, c17])). % 101.53/13.27 % 101.53/13.27 cnf(c20, axiom, % 101.53/13.27 product(X13,X13,additive_identity) | product(X13,multiplicative_inverse(X13),multiplicative_identity)). % 101.53/13.27 cnf(a12, assumption, % 101.53/13.27 X11 = X13). % 101.53/13.27 cnf(a13, assumption, % 101.53/13.27 X10 = multiplicative_inverse(X13)). % 101.53/13.27 cnf(a14, assumption, % 101.53/13.27 X12 = multiplicative_identity). % 101.53/13.27 cnf(c21, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c19, c20])). % 101.53/13.27 cnf(c22, plain, % 101.53/13.27 product(X13,X13,additive_identity), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c19, c20])). % 101.53/13.27 % 101.53/13.27 cnf(c23, axiom, % 101.53/13.27 ~product(X14,X14,additive_identity) | ~greater_than_0(X14)). % 101.53/13.27 cnf(a15, assumption, % 101.53/13.27 X13 = X14). % 101.53/13.27 cnf(a16, assumption, % 101.53/13.27 X13 = X14). % 101.53/13.27 cnf(a17, assumption, % 101.53/13.27 additive_identity = additive_identity). % 101.53/13.27 cnf(c24, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c22, c23])). % 101.53/13.27 cnf(c25, plain, % 101.53/13.27 ~greater_than_0(X14), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c22, c23])). % 101.53/13.27 % 101.53/13.27 cnf(c26, axiom, % 101.53/13.27 greater_than_0(a)). % 101.53/13.27 cnf(a18, assumption, % 101.53/13.27 X14 = a). % 101.53/13.27 cnf(c27, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a18])], [c25, c26])). % 101.53/13.27 cnf(c28, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a18])], [c25, c26])). % 101.53/13.27 % 101.53/13.27 cnf(c29, plain, % 101.53/13.27 ~greater_than_0(multiplicative_inverse(a))). % 101.53/13.27 cnf(a19, assumption, % 101.53/13.27 X6 = multiplicative_inverse(a)). % 101.53/13.27 cnf(c30, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(predicate_reduction, [assumptions([a19])], [c12, c29])). % 101.53/13.27 % 101.53/13.27 cnf(c31, plain, % 101.53/13.27 greater_than_0(X14)). % 101.53/13.27 cnf(a20, assumption, % 101.53/13.27 X5 = X14). % 101.53/13.27 cnf(c32, plain, % 101.53/13.27 ~product(X5,X4,X3), % 101.53/13.27 inference(predicate_reduction, [assumptions([a20])], [c9, c31])). % 101.53/13.27 % 101.53/13.27 cnf(c33, axiom, % 101.53/13.27 product(X15,additive_inverse(X16),additive_inverse(X17)) | ~product(X15,X16,X17)). % 101.53/13.27 cnf(a21, assumption, % 101.53/13.27 X5 = X15). % 101.53/13.27 cnf(a22, assumption, % 101.53/13.27 X4 = additive_inverse(X16)). % 101.53/13.27 cnf(a23, assumption, % 101.53/13.27 X3 = additive_inverse(X17)). % 101.53/13.27 cnf(c34, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a21, a22, a23])], [c32, c33])). % 101.53/13.27 cnf(c35, plain, % 101.53/13.27 ~product(X15,X16,X17), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a21, a22, a23])], [c32, c33])). % 101.53/13.27 % 101.53/13.27 cnf(c36, plain, % 101.53/13.27 product(X11,X10,X12)). % 101.53/13.27 cnf(a24, assumption, % 101.53/13.27 X15 = X11). % 101.53/13.27 cnf(a25, assumption, % 101.53/13.27 X16 = X10). % 101.53/13.27 cnf(a26, assumption, % 101.53/13.27 X17 = X12). % 101.53/13.27 cnf(c37, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(predicate_reduction, [assumptions([a24, a25, a26])], [c35, c36])). % 101.53/13.27 % 101.53/13.27 cnf(c38, plain, % 101.53/13.27 greater_than_0(X4)). % 101.53/13.27 cnf(a27, assumption, % 101.53/13.27 X2 = X4). % 101.53/13.27 cnf(c39, plain, % 101.53/13.27 ~product(X2,X1,X0), % 101.53/13.27 inference(predicate_reduction, [assumptions([a27])], [c6, c38])). % 101.53/13.27 % 101.53/13.27 cnf(c40, axiom, % 101.53/13.27 product(additive_inverse(X18),additive_inverse(X19),X20) | ~product(X18,X19,X20)). % 101.53/13.27 cnf(a28, assumption, % 101.53/13.27 X2 = additive_inverse(X18)). % 101.53/13.27 cnf(a29, assumption, % 101.53/13.27 X1 = additive_inverse(X19)). % 101.53/13.27 cnf(a30, assumption, % 101.53/13.27 X0 = X20). % 101.53/13.27 cnf(c41, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a28, a29, a30])], [c39, c40])). % 101.53/13.27 cnf(c42, plain, % 101.53/13.27 ~product(X18,X19,X20), % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a28, a29, a30])], [c39, c40])). % 101.53/13.27 % 101.53/13.27 cnf(c43, axiom, % 101.53/13.27 product(X21,multiplicative_identity,X21)). % 101.53/13.27 cnf(a31, assumption, % 101.53/13.27 X18 = X21). % 101.53/13.27 cnf(a32, assumption, % 101.53/13.27 X19 = multiplicative_identity). % 101.53/13.27 cnf(a33, assumption, % 101.53/13.27 X20 = X21). % 101.53/13.27 cnf(c44, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a31, a32, a33])], [c42, c43])). % 101.53/13.27 cnf(c45, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(strict_predicate_extension, [assumptions([a31, a32, a33])], [c42, c43])). % 101.53/13.27 % 101.53/13.27 cnf(c46, plain, % 101.53/13.27 $false, % 101.53/13.27 inference(constraint_solving, [ % 101.53/13.27 bind(X0, multiplicative_inverse(a)), % 101.53/13.27 bind(X1, additive_inverse(X17)), % 101.53/13.27 bind(X2, additive_inverse(X6)), % 101.53/13.27 bind(X3, additive_inverse(X17)), % 101.53/13.27 bind(X4, additive_inverse(X6)), % 101.53/13.27 bind(X5, a), % 101.53/13.27 bind(X6, multiplicative_inverse(X13)), % 101.53/13.27 bind(X7, multiplicative_identity), % 101.53/13.27 bind(X8, multiplicative_inverse(X13)), % 101.53/13.27 bind(X9, a), % 101.53/13.27 bind(X10, multiplicative_inverse(X13)), % 101.53/13.27 bind(X11, a), % 101.53/13.27 bind(X12, multiplicative_identity), % 101.53/13.27 bind(X13, a), % 101.53/13.27 bind(X14, a), % 101.53/13.27 bind(X15, a), % 101.53/13.27 bind(X16, multiplicative_inverse(X13)), % 101.53/13.27 bind(X17, multiplicative_identity), % 101.53/13.27 bind(X18, multiplicative_inverse(X13)), % 101.53/13.27 bind(X19, multiplicative_identity), % 101.53/13.27 bind(X20, multiplicative_inverse(a)), % 101.53/13.27 bind(X21, multiplicative_inverse(X13)) % 101.53/13.27 ], % 101.53/13.27 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30, a31, a32, a33])). % 101.53/13.27 % 101.53/13.27 % SZS output end IncompleteProof %------------------------------------------------------------------------------