%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : FLD034-3 : TPTP v8.1.0. Bugfixed v2.1.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n018.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 02:15:53 EDT 2022 % Result : Unsatisfiable 0.14s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : FLD034-3 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n018.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Tue Jun 7 04:22:50 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.35 % SZS status Unsatisfiable % 0.14/0.35 % SZS output begin IncompleteProof % 0.14/0.35 cnf(c0, axiom, % 0.14/0.35 ~product(m,a,a)). % 0.14/0.35 cnf(c1, plain, % 0.14/0.35 ~product(m,a,a), % 0.14/0.35 inference(start, [], [c0])). % 0.14/0.35 % 0.14/0.35 cnf(c2, axiom, % 0.14/0.35 ~product(X0,X1,X2) | ~product(X3,X1,X4) | ~product(X5,X3,X0) | product(X5,X4,X2)). % 0.14/0.35 cnf(a0, assumption, % 0.14/0.35 m = X5). % 0.14/0.35 cnf(a1, assumption, % 0.14/0.35 a = X4). % 0.14/0.35 cnf(a2, assumption, % 0.14/0.35 a = X2). % 0.14/0.35 cnf(c3, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.14/0.35 cnf(c4, plain, % 0.14/0.35 ~product(X0,X1,X2) | ~product(X3,X1,X4) | ~product(X5,X3,X0), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.14/0.35 % 0.14/0.35 cnf(c5, axiom, % 0.14/0.35 ~defined(X6) | product(multiplicative_identity,X6,X6)). % 0.14/0.35 cnf(a3, assumption, % 0.14/0.35 X0 = multiplicative_identity). % 0.14/0.35 cnf(a4, assumption, % 0.14/0.35 X1 = X6). % 0.14/0.35 cnf(a5, assumption, % 0.14/0.35 X2 = X6). % 0.14/0.35 cnf(c6, plain, % 0.14/0.35 ~product(X3,X1,X4) | ~product(X5,X3,X0), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.14/0.35 cnf(c7, plain, % 0.14/0.35 ~defined(X6), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.14/0.35 % 0.14/0.35 cnf(c8, axiom, % 0.14/0.35 defined(a)). % 0.14/0.35 cnf(a6, assumption, % 0.14/0.35 X6 = a). % 0.14/0.35 cnf(c9, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c7, c8])). % 0.14/0.35 cnf(c10, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c7, c8])). % 0.14/0.35 % 0.14/0.35 cnf(c11, plain, % 0.14/0.35 product(X0,X1,X2)). % 0.14/0.35 cnf(a7, assumption, % 0.14/0.35 X3 = X0). % 0.14/0.35 cnf(a8, assumption, % 0.14/0.35 X1 = X1). % 0.14/0.35 cnf(a9, assumption, % 0.14/0.35 X4 = X2). % 0.14/0.35 cnf(c12, plain, % 0.14/0.35 ~product(X5,X3,X0), % 0.14/0.35 inference(predicate_reduction, [assumptions([a7, a8, a9])], [c6, c11])). % 0.14/0.35 % 0.14/0.35 cnf(c13, axiom, % 0.14/0.35 ~product(X7,X8,X9) | product(X8,X7,X9)). % 0.14/0.35 cnf(a10, assumption, % 0.14/0.35 X5 = X8). % 0.14/0.35 cnf(a11, assumption, % 0.14/0.35 X3 = X7). % 0.14/0.35 cnf(a12, assumption, % 0.14/0.35 X0 = X9). % 0.14/0.35 cnf(c14, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c12, c13])). % 0.14/0.35 cnf(c15, plain, % 0.14/0.35 ~product(X7,X8,X9), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c12, c13])). % 0.14/0.35 % 0.14/0.35 cnf(c16, axiom, % 0.14/0.35 product(multiplicative_identity,m,multiplicative_identity)). % 0.14/0.35 cnf(a13, assumption, % 0.14/0.35 X7 = multiplicative_identity). % 0.14/0.35 cnf(a14, assumption, % 0.14/0.35 X8 = m). % 0.14/0.35 cnf(a15, assumption, % 0.14/0.35 X9 = multiplicative_identity). % 0.14/0.35 cnf(c17, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c15, c16])). % 0.14/0.35 cnf(c18, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c15, c16])). % 0.14/0.35 % 0.14/0.35 cnf(c19, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(constraint_solving, [ % 0.14/0.35 bind(X0, multiplicative_identity), % 0.14/0.35 bind(X1, a), % 0.14/0.35 bind(X2, a), % 0.14/0.35 bind(X3, multiplicative_identity), % 0.14/0.35 bind(X4, a), % 0.14/0.35 bind(X5, m), % 0.14/0.35 bind(X6, a), % 0.14/0.35 bind(X7, multiplicative_identity), % 0.14/0.35 bind(X8, m), % 0.14/0.35 bind(X9, multiplicative_identity) % 0.14/0.35 ], % 0.14/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 0.14/0.35 % 0.14/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------