%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GRP044-2 : 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 : n011.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 10:08:45 EDT 2022 % Result : Unsatisfiable 0.14s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GRP044-2 : TPTP v8.1.0. Released v1.0.0. % 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.33 % Computer : n011.cluster.edu % 0.14/0.33 % Model : x86_64 x86_64 % 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.33 % Memory : 8042.1875MB % 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.33 % CPULimit : 300 % 0.14/0.33 % WCLimit : 600 % 0.14/0.33 % DateTime : Tue Jun 14 02:30:19 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.34 % SZS status Unsatisfiable % 0.14/0.34 % SZS output begin IncompleteProof % 0.14/0.34 cnf(c0, axiom, % 0.14/0.34 ~product(b,c,result)). % 0.14/0.34 cnf(c1, plain, % 0.14/0.34 ~product(b,c,result), % 0.14/0.34 inference(start, [], [c0])). % 0.14/0.34 % 0.14/0.34 cnf(c2, axiom, % 0.14/0.34 product(X0,X1,X2) | ~product(X3,X4,X2) | ~product(X5,X1,X4) | ~product(X3,X5,X0)). % 0.14/0.34 cnf(a0, assumption, % 0.14/0.34 b = X0). % 0.14/0.34 cnf(a1, assumption, % 0.14/0.34 c = X1). % 0.14/0.34 cnf(a2, assumption, % 0.14/0.34 result = X2). % 0.14/0.34 cnf(c3, plain, % 0.14/0.34 $false, % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.14/0.34 cnf(c4, plain, % 0.14/0.34 ~product(X3,X4,X2) | ~product(X5,X1,X4) | ~product(X3,X5,X0), % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.14/0.34 % 0.14/0.34 cnf(c5, axiom, % 0.14/0.34 product(identity,X6,X6)). % 0.14/0.34 cnf(a3, assumption, % 0.14/0.34 X3 = identity). % 0.14/0.34 cnf(a4, assumption, % 0.14/0.34 X4 = X6). % 0.14/0.34 cnf(a5, assumption, % 0.14/0.34 X2 = X6). % 0.14/0.34 cnf(c6, plain, % 0.14/0.34 ~product(X5,X1,X4) | ~product(X3,X5,X0), % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.14/0.34 cnf(c7, plain, % 0.14/0.34 $false, % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.14/0.34 % 0.14/0.34 cnf(c8, axiom, % 0.14/0.34 product(a,c,result)). % 0.14/0.34 cnf(a6, assumption, % 0.14/0.34 X5 = a). % 0.14/0.34 cnf(a7, assumption, % 0.14/0.34 X1 = c). % 0.14/0.34 cnf(a8, assumption, % 0.14/0.34 X4 = result). % 0.14/0.34 cnf(c9, plain, % 0.14/0.34 ~product(X3,X5,X0), % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])). % 0.14/0.34 cnf(c10, plain, % 0.14/0.34 $false, % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])). % 0.14/0.34 % 0.14/0.34 cnf(c11, axiom, % 0.14/0.34 product(X7,X8,X9) | ~product(X7,X8,X10) | ~equalish(X10,X9)). % 0.14/0.34 cnf(a9, assumption, % 0.14/0.34 X3 = X7). % 0.14/0.34 cnf(a10, assumption, % 0.14/0.34 X5 = X8). % 0.14/0.34 cnf(a11, assumption, % 0.14/0.34 X0 = X9). % 0.14/0.34 cnf(c12, plain, % 0.14/0.34 $false, % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c11])). % 0.14/0.34 cnf(c13, plain, % 0.14/0.34 ~product(X7,X8,X10) | ~equalish(X10,X9), % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c11])). % 0.14/0.34 % 0.14/0.34 cnf(c14, axiom, % 0.14/0.34 product(identity,X11,X11)). % 0.14/0.34 cnf(a12, assumption, % 0.14/0.34 X7 = identity). % 0.14/0.34 cnf(a13, assumption, % 0.14/0.34 X8 = X11). % 0.14/0.34 cnf(a14, assumption, % 0.14/0.34 X10 = X11). % 0.14/0.34 cnf(c15, plain, % 0.14/0.34 ~equalish(X10,X9), % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c13, c14])). % 0.14/0.34 cnf(c16, plain, % 0.14/0.34 $false, % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c13, c14])). % 0.14/0.34 % 0.14/0.34 cnf(c17, axiom, % 0.14/0.34 equalish(a,b)). % 0.14/0.34 cnf(a15, assumption, % 0.14/0.34 X10 = a). % 0.14/0.34 cnf(a16, assumption, % 0.14/0.34 X9 = b). % 0.14/0.34 cnf(c18, plain, % 0.14/0.34 $false, % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a15, a16])], [c15, c17])). % 0.14/0.34 cnf(c19, plain, % 0.14/0.34 $false, % 0.14/0.34 inference(strict_predicate_extension, [assumptions([a15, a16])], [c15, c17])). % 0.14/0.34 % 0.14/0.34 cnf(c20, plain, % 0.14/0.34 $false, % 0.14/0.34 inference(constraint_solving, [ % 0.14/0.34 bind(X0, b), % 0.14/0.34 bind(X1, c), % 0.14/0.34 bind(X2, result), % 0.14/0.34 bind(X3, identity), % 0.14/0.34 bind(X4, result), % 0.14/0.34 bind(X5, a), % 0.14/0.34 bind(X6, result), % 0.14/0.34 bind(X7, identity), % 0.14/0.34 bind(X8, a), % 0.14/0.34 bind(X9, b), % 0.14/0.34 bind(X10, a), % 0.14/0.34 bind(X11, a) % 0.14/0.34 ], % 0.14/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])). % 0.14/0.34 % 0.14/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------