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