%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CAT013-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 : n032.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 : Fri Jul 15 00:03:28 EDT 2022 % Result : Unsatisfiable 0.10s 0.31s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : CAT013-1 : TPTP v8.1.0. Released v1.0.0. % 0.00/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.10/0.30 % Computer : n032.cluster.edu % 0.10/0.30 % Model : x86_64 x86_64 % 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.30 % Memory : 8042.1875MB % 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.30 % CPULimit : 300 % 0.10/0.30 % WCLimit : 600 % 0.10/0.30 % DateTime : Sun May 29 21:57:27 EDT 2022 % 0.10/0.30 % CPUTime : % 0.10/0.31 % SZS status Unsatisfiable % 0.10/0.31 % SZS output begin IncompleteProof % 0.10/0.31 cnf(c0, axiom, % 0.10/0.31 codomain(a) != domain(codomain(a))). % 0.10/0.31 cnf(c1, plain, % 0.10/0.31 codomain(a) != domain(codomain(a)), % 0.10/0.31 inference(start, [], [c0])). % 0.10/0.31 % 0.10/0.31 cnf(c2, axiom, % 0.10/0.31 X0 = X1 | ~product(X2,X3,X1) | ~product(X2,X3,X0)). % 0.10/0.31 cnf(a0, assumption, % 0.10/0.31 domain(codomain(a)) = X0). % 0.10/0.31 cnf(c3, plain, % 0.10/0.31 $false, % 0.10/0.31 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.31 cnf(c4, plain, % 0.10/0.31 ~product(X2,X3,X1) | ~product(X2,X3,X0), % 0.10/0.31 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.31 cnf(c5, plain, % 0.10/0.31 X1 != X4 | codomain(a) != X4, % 0.10/0.31 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.31 % 0.10/0.31 cnf(a1, assumption, % 0.10/0.31 X1 = X4). % 0.10/0.31 cnf(c6, plain, % 0.10/0.31 codomain(a) != X4, % 0.10/0.31 inference(reflexivity, [assumptions([a1])], [c5])). % 0.10/0.31 % 0.10/0.31 cnf(a2, assumption, % 0.10/0.31 codomain(a) = X4). % 0.10/0.31 cnf(c7, plain, % 0.10/0.31 $false, % 0.10/0.31 inference(reflexivity, [assumptions([a2])], [c6])). % 0.10/0.31 % 0.10/0.31 cnf(c8, axiom, % 0.10/0.31 product(X5,domain(X5),X5)). % 0.10/0.31 cnf(a3, assumption, % 0.10/0.31 X2 = X5). % 0.10/0.31 cnf(a4, assumption, % 0.10/0.31 X3 = domain(X5)). % 0.10/0.31 cnf(a5, assumption, % 0.10/0.31 X1 = X5). % 0.10/0.31 cnf(c9, plain, % 0.10/0.31 ~product(X2,X3,X0), % 0.10/0.31 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c8])). % 0.10/0.31 cnf(c10, plain, % 0.10/0.31 $false, % 0.10/0.31 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c8])). % 0.10/0.31 % 0.10/0.31 cnf(c11, axiom, % 0.10/0.31 product(X6,X7,X7) | ~identity_map(X6) | ~defined(X6,X7)). % 0.10/0.31 cnf(a6, assumption, % 0.10/0.31 X2 = X6). % 0.10/0.31 cnf(a7, assumption, % 0.10/0.31 X3 = X7). % 0.10/0.31 cnf(a8, assumption, % 0.10/0.31 X0 = X7). % 0.10/0.31 cnf(c12, plain, % 0.10/0.31 $false, % 0.10/0.31 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c9, c11])). % 0.10/0.31 cnf(c13, plain, % 0.10/0.31 ~identity_map(X6) | ~defined(X6,X7), % 0.10/0.31 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c9, c11])). % 0.10/0.31 % 0.10/0.31 cnf(c14, axiom, % 0.10/0.31 identity_map(codomain(X8))). % 0.10/0.31 cnf(a9, assumption, % 0.10/0.31 X6 = codomain(X8)). % 0.10/0.31 cnf(c15, plain, % 0.10/0.31 ~defined(X6,X7), % 0.10/0.31 inference(strict_predicate_extension, [assumptions([a9])], [c13, c14])). % 0.10/0.31 cnf(c16, plain, % 0.10/0.31 $false, % 0.10/0.31 inference(strict_predicate_extension, [assumptions([a9])], [c13, c14])). % 0.10/0.31 % 0.10/0.31 cnf(c17, axiom, % 0.10/0.31 defined(X9,domain(X9))). % 0.10/0.31 cnf(a10, assumption, % 0.10/0.31 X6 = X9). % 0.10/0.31 cnf(a11, assumption, % 0.10/0.31 X7 = domain(X9)). % 0.10/0.31 cnf(c18, plain, % 0.10/0.31 $false, % 0.10/0.31 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])). % 0.10/0.31 cnf(c19, plain, % 0.10/0.31 $false, % 0.10/0.31 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])). % 0.10/0.31 % 0.10/0.31 cnf(c20, plain, % 0.10/0.31 $false, % 0.10/0.31 inference(constraint_solving, [ % 0.10/0.31 bind(X0, domain(codomain(a))), % 0.10/0.31 bind(X1, codomain(a)), % 0.10/0.31 bind(X2, codomain(a)), % 0.10/0.31 bind(X3, domain(X5)), % 0.10/0.31 bind(X4, codomain(a)), % 0.10/0.31 bind(X5, codomain(a)), % 0.10/0.31 bind(X6, codomain(a)), % 0.10/0.31 bind(X7, domain(X5)), % 0.10/0.31 bind(X8, a), % 0.10/0.31 bind(X9, codomain(a)) % 0.10/0.31 ], % 0.10/0.31 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.10/0.31 % 0.10/0.31 % SZS output end IncompleteProof %------------------------------------------------------------------------------