%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CAT014-4 : 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 : n022.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 20.49s 2.94s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : CAT014-4 : TPTP v8.1.0. Released v1.0.0. % 0.08/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n022.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Sun May 29 17:42:08 EDT 2022 % 0.14/0.34 % CPUTime : % 20.49/2.94 % SZS status Unsatisfiable % 20.49/2.94 % SZS output begin IncompleteProof % 20.49/2.94 cnf(c0, axiom, % 20.49/2.94 codomain(a) != codomain(codomain(a))). % 20.49/2.94 cnf(c1, plain, % 20.49/2.94 codomain(a) != codomain(codomain(a)), % 20.49/2.94 inference(start, [], [c0])). % 20.49/2.94 % 20.49/2.94 cnf(c2, axiom, % 20.49/2.94 domain(X0) = codomain(X1) | ~there_exists(compose(X0,X1))). % 20.49/2.94 cnf(a0, assumption, % 20.49/2.94 codomain(codomain(a)) = codomain(X1)). % 20.49/2.94 cnf(c3, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 20.49/2.94 cnf(c4, plain, % 20.49/2.94 ~there_exists(compose(X0,X1)), % 20.49/2.94 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 20.49/2.94 cnf(c5, plain, % 20.49/2.94 X2 != domain(X0) | codomain(a) != X2, % 20.49/2.94 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 20.49/2.94 % 20.49/2.94 cnf(c6, axiom, % 20.49/2.94 domain(X3) = codomain(X4) | ~there_exists(compose(X3,X4))). % 20.49/2.94 cnf(a1, assumption, % 20.49/2.94 domain(X0) = domain(X3)). % 20.49/2.94 cnf(c7, plain, % 20.49/2.94 codomain(a) != X2, % 20.49/2.94 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 20.49/2.94 cnf(c8, plain, % 20.49/2.94 ~there_exists(compose(X3,X4)), % 20.49/2.94 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 20.49/2.94 cnf(c9, plain, % 20.49/2.94 X5 != codomain(X4) | X2 != X5, % 20.49/2.94 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 20.49/2.94 % 20.49/2.94 cnf(a2, assumption, % 20.49/2.94 X5 = codomain(X4)). % 20.49/2.94 cnf(c10, plain, % 20.49/2.94 X2 != X5, % 20.49/2.94 inference(reflexivity, [assumptions([a2])], [c9])). % 20.49/2.94 % 20.49/2.94 cnf(a3, assumption, % 20.49/2.94 X2 = X5). % 20.49/2.94 cnf(c11, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(reflexivity, [assumptions([a3])], [c10])). % 20.49/2.94 % 20.49/2.94 cnf(c12, axiom, % 20.49/2.94 compose(codomain(X6),X6) = X6). % 20.49/2.94 cnf(a4, assumption, % 20.49/2.94 compose(X3,X4) = compose(codomain(X6),X6)). % 20.49/2.94 cnf(c13, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(strict_function_extension, [assumptions([a4])], [c8, c12])). % 20.49/2.94 cnf(c14, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(strict_function_extension, [assumptions([a4])], [c8, c12])). % 20.49/2.94 cnf(c15, plain, % 20.49/2.94 X7 != X6 | ~there_exists(X7), % 20.49/2.94 inference(strict_function_extension, [assumptions([a4])], [c8, c12])). % 20.49/2.94 % 20.49/2.94 cnf(a5, assumption, % 20.49/2.94 X7 = X6). % 20.49/2.94 cnf(c16, plain, % 20.49/2.94 ~there_exists(X7), % 20.49/2.94 inference(reflexivity, [assumptions([a5])], [c15])). % 20.49/2.94 % 20.49/2.94 cnf(c17, axiom, % 20.49/2.94 there_exists(X8) | ~there_exists(codomain(X8))). % 20.49/2.94 cnf(a6, assumption, % 20.49/2.94 X7 = X8). % 20.49/2.94 cnf(c18, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(strict_predicate_extension, [assumptions([a6])], [c16, c17])). % 20.49/2.94 cnf(c19, plain, % 20.49/2.94 ~there_exists(codomain(X8)), % 20.49/2.94 inference(strict_predicate_extension, [assumptions([a6])], [c16, c17])). % 20.49/2.94 % 20.49/2.94 cnf(c20, axiom, % 20.49/2.94 there_exists(codomain(a))). % 20.49/2.94 cnf(a7, assumption, % 20.49/2.94 codomain(X8) = codomain(a)). % 20.49/2.94 cnf(c21, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(strict_predicate_extension, [assumptions([a7])], [c19, c20])). % 20.49/2.94 cnf(c22, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(strict_predicate_extension, [assumptions([a7])], [c19, c20])). % 20.49/2.94 % 20.49/2.94 cnf(a8, assumption, % 20.49/2.94 codomain(a) = X2). % 20.49/2.94 cnf(c23, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(reflexivity, [assumptions([a8])], [c7])). % 20.49/2.94 % 20.49/2.94 cnf(c24, axiom, % 20.49/2.94 compose(X9,domain(X9)) = X9). % 20.49/2.94 cnf(a9, assumption, % 20.49/2.94 compose(X10,X11) = compose(X0,X1)). % 20.49/2.94 cnf(c25, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(lazy_function_extension, [assumptions([a9])], [c4, c24])). % 20.49/2.94 cnf(c26, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(lazy_function_extension, [assumptions([a9])], [c4, c24])). % 20.49/2.94 cnf(c27, plain, % 20.49/2.94 X10 != X9 | X11 != domain(X9) | X12 != X9 | ~there_exists(X12), % 20.49/2.94 inference(lazy_function_extension, [assumptions([a9])], [c4, c24])). % 20.49/2.94 % 20.49/2.94 cnf(a10, assumption, % 20.49/2.94 X10 = X9). % 20.49/2.94 cnf(c28, plain, % 20.49/2.94 X11 != domain(X9) | X12 != X9 | ~there_exists(X12), % 20.49/2.94 inference(reflexivity, [assumptions([a10])], [c27])). % 20.49/2.94 % 20.49/2.94 cnf(c29, plain, % 20.49/2.94 X2 = domain(X0)). % 20.49/2.94 cnf(a11, assumption, % 20.49/2.94 domain(X9) = domain(X0)). % 20.49/2.94 cnf(c30, plain, % 20.49/2.94 X12 != X9 | ~there_exists(X12), % 20.49/2.94 inference(equality_reduction, [assumptions([a11])], [c28, c29])). % 20.49/2.94 cnf(c31, plain, % 20.49/2.94 X11 != X2, % 20.49/2.94 inference(equality_reduction, [assumptions([a11])], [c28, c29])). % 20.49/2.94 % 20.49/2.94 cnf(a12, assumption, % 20.49/2.94 X11 = X2). % 20.49/2.94 cnf(c32, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(reflexivity, [assumptions([a12])], [c31])). % 20.49/2.94 % 20.49/2.94 cnf(a13, assumption, % 20.49/2.94 X12 = X9). % 20.49/2.94 cnf(c33, plain, % 20.49/2.94 ~there_exists(X12), % 20.49/2.94 inference(reflexivity, [assumptions([a13])], [c30])). % 20.49/2.94 % 20.49/2.94 cnf(c34, plain, % 20.49/2.94 there_exists(codomain(X8))). % 20.49/2.94 cnf(a14, assumption, % 20.49/2.94 X12 = codomain(X8)). % 20.49/2.94 cnf(c35, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(predicate_reduction, [assumptions([a14])], [c33, c34])). % 20.49/2.94 % 20.49/2.94 cnf(c36, plain, % 20.49/2.94 $false, % 20.49/2.94 inference(constraint_solving, [ % 20.49/2.94 bind(X0, codomain(X6)), % 20.49/2.94 bind(X1, codomain(a)), % 20.49/2.94 bind(X2, codomain(X4)), % 20.49/2.94 bind(X3, codomain(X6)), % 20.49/2.94 bind(X4, a), % 20.49/2.94 bind(X5, codomain(X4)), % 20.49/2.94 bind(X6, a), % 20.49/2.94 bind(X7, a), % 20.49/2.94 bind(X8, a), % 20.49/2.94 bind(X9, codomain(X6)), % 20.49/2.94 bind(X12, codomain(X6)), % 20.49/2.94 bind(X10, codomain(X6)), % 20.49/2.94 bind(X11, codomain(a)) % 20.49/2.94 ], % 20.49/2.94 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])). % 20.49/2.94 % 20.49/2.94 % SZS output end IncompleteProof %------------------------------------------------------------------------------