%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GRP033-3 : TPTP v8.1.0. Bugfixed v4.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 : n029.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:41 EDT 2022 % Result : Unsatisfiable 0.14s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : GRP033-3 : TPTP v8.1.0. Bugfixed v4.0.0. % 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.35 % Computer : n029.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Mon Jun 13 06:41:10 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 ~subgroup_member(X0) | ~product(X0,j(X0),j(X0)) | ~product(j(X0),X0,j(X0))). % 0.14/0.37 cnf(c1, plain, % 0.14/0.37 ~subgroup_member(X0) | ~product(X0,j(X0),j(X0)) | ~product(j(X0),X0,j(X0)), % 0.14/0.37 inference(start, [], [c0])). % 0.14/0.37 % 0.14/0.37 cnf(c2, axiom, % 0.14/0.37 subgroup_member(X1) | ~product(X2,inverse(X3),X1) | ~subgroup_member(X3) | ~subgroup_member(X2)). % 0.14/0.37 cnf(a0, assumption, % 0.14/0.37 X0 = X1). % 0.14/0.37 cnf(c3, plain, % 0.14/0.37 ~product(X0,j(X0),j(X0)) | ~product(j(X0),X0,j(X0)), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.37 cnf(c4, plain, % 0.14/0.37 ~product(X2,inverse(X3),X1) | ~subgroup_member(X3) | ~subgroup_member(X2), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.37 % 0.14/0.37 cnf(c5, axiom, % 0.14/0.37 product(X4,inverse(X4),identity)). % 0.14/0.37 cnf(a1, assumption, % 0.14/0.37 X2 = X4). % 0.14/0.37 cnf(a2, assumption, % 0.14/0.37 inverse(X3) = inverse(X4)). % 0.14/0.37 cnf(a3, assumption, % 0.14/0.37 X1 = identity). % 0.14/0.37 cnf(c6, plain, % 0.14/0.37 ~subgroup_member(X3) | ~subgroup_member(X2), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a1, a2, a3])], [c4, c5])). % 0.14/0.37 cnf(c7, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a1, a2, a3])], [c4, c5])). % 0.14/0.37 % 0.14/0.37 cnf(c8, axiom, % 0.14/0.37 subgroup_member(a)). % 0.14/0.37 cnf(a4, assumption, % 0.14/0.37 X3 = a). % 0.14/0.37 cnf(c9, plain, % 0.14/0.37 ~subgroup_member(X2), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c6, c8])). % 0.14/0.37 cnf(c10, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c6, c8])). % 0.14/0.37 % 0.14/0.37 cnf(c11, plain, % 0.14/0.37 subgroup_member(X3)). % 0.14/0.37 cnf(a5, assumption, % 0.14/0.37 X2 = X3). % 0.14/0.37 cnf(c12, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(predicate_reduction, [assumptions([a5])], [c9, c11])). % 0.14/0.37 % 0.14/0.37 cnf(c13, axiom, % 0.14/0.37 product(identity,X5,X5)). % 0.14/0.37 cnf(a6, assumption, % 0.14/0.37 X0 = identity). % 0.14/0.37 cnf(a7, assumption, % 0.14/0.37 j(X0) = X5). % 0.14/0.37 cnf(a8, assumption, % 0.14/0.37 j(X0) = X5). % 0.14/0.37 cnf(c14, plain, % 0.14/0.37 ~product(j(X0),X0,j(X0)), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c3, c13])). % 0.14/0.37 cnf(c15, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c3, c13])). % 0.14/0.37 % 0.14/0.37 cnf(c16, axiom, % 0.14/0.37 product(X6,identity,X6)). % 0.14/0.37 cnf(a9, assumption, % 0.14/0.37 j(X0) = X6). % 0.14/0.37 cnf(a10, assumption, % 0.14/0.37 X0 = identity). % 0.14/0.37 cnf(a11, assumption, % 0.14/0.37 j(X0) = X6). % 0.14/0.37 cnf(c17, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c14, c16])). % 0.14/0.37 cnf(c18, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c14, c16])). % 0.14/0.37 % 0.14/0.37 cnf(c19, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(constraint_solving, [ % 0.14/0.37 bind(X0, identity), % 0.14/0.37 bind(X1, identity), % 0.14/0.37 bind(X2, a), % 0.14/0.37 bind(X3, a), % 0.14/0.37 bind(X4, a), % 0.14/0.37 bind(X5, j(X0)), % 0.14/0.37 bind(X6, j(X0)) % 0.14/0.37 ], % 0.14/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.14/0.37 % 0.14/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------