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