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