%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU219+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n027.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 : Tue Jul 19 11:54:10 EDT 2022 % Result : Theorem 2.40s 0.64s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SEU219+1 : TPTP v8.1.0. Released v3.3.0. % 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n027.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jun 19 17:22:24 EDT 2022 % 0.13/0.34 % CPUTime : % 2.40/0.64 % SZS status Theorem % 2.40/0.64 % SZS output begin IncompleteProof % 2.40/0.64 cnf(c0, axiom, % 2.40/0.64 relation(sK2)). % 2.40/0.64 cnf(c1, plain, % 2.40/0.64 relation(sK2), % 2.40/0.64 inference(start, [], [c0])). % 2.40/0.64 % 2.40/0.64 cnf(c2, axiom, % 2.40/0.64 function_inverse(X0) = relation_inverse(X0) | ~one_to_one(X0) | ~function(X0) | ~relation(X0)). % 2.40/0.64 cnf(a0, assumption, % 2.40/0.64 sK2 = X0). % 2.40/0.64 cnf(c3, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 2.40/0.64 cnf(c4, plain, % 2.40/0.64 function_inverse(X0) = relation_inverse(X0) | ~one_to_one(X0) | ~function(X0), % 2.40/0.64 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 2.40/0.64 % 2.40/0.64 cnf(c5, axiom, % 2.40/0.64 relation_dom(X1) = relation_rng(relation_inverse(X1)) | ~relation(X1)). % 2.40/0.64 cnf(a1, assumption, % 2.40/0.64 relation_inverse(X1) = relation_inverse(X0)). % 2.40/0.64 cnf(a2, assumption, % 2.40/0.64 function_inverse(X0) = X2). % 2.40/0.64 cnf(c6, plain, % 2.40/0.64 ~one_to_one(X0) | ~function(X0), % 2.40/0.64 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 2.40/0.64 cnf(c7, plain, % 2.40/0.64 ~relation(X1), % 2.40/0.64 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 2.40/0.64 cnf(c8, plain, % 2.40/0.64 relation_dom(X1) = relation_rng(X2), % 2.40/0.64 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 2.40/0.64 % 2.40/0.64 cnf(c9, axiom, % 2.40/0.64 relation_dom(sK2) != relation_rng(function_inverse(sK2)) | relation_rng(sK2) != relation_dom(function_inverse(sK2))). % 2.40/0.64 cnf(a3, assumption, % 2.40/0.64 relation_rng(function_inverse(sK2)) = relation_rng(X2)). % 2.40/0.64 cnf(a4, assumption, % 2.40/0.64 relation_dom(X1) = X3). % 2.40/0.64 cnf(c10, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(strict_subterm_extension, [assumptions([a3, a4])], [c8, c9])). % 2.40/0.64 cnf(c11, plain, % 2.40/0.64 relation_rng(sK2) != relation_dom(function_inverse(sK2)), % 2.40/0.64 inference(strict_subterm_extension, [assumptions([a3, a4])], [c8, c9])). % 2.40/0.64 cnf(c12, plain, % 2.40/0.64 relation_dom(sK2) != X3, % 2.40/0.64 inference(strict_subterm_extension, [assumptions([a3, a4])], [c8, c9])). % 2.40/0.64 % 2.40/0.64 cnf(a5, assumption, % 2.40/0.64 relation_dom(sK2) = X3). % 2.40/0.64 cnf(c13, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(reflexivity, [assumptions([a5])], [c12])). % 2.40/0.64 % 2.40/0.64 cnf(c14, axiom, % 2.40/0.64 relation_rng(X4) = relation_dom(relation_inverse(X4)) | ~relation(X4)). % 2.40/0.64 cnf(a6, assumption, % 2.40/0.64 relation_rng(sK2) = relation_rng(X4)). % 2.40/0.64 cnf(c15, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(strict_function_extension, [assumptions([a6])], [c11, c14])). % 2.40/0.64 cnf(c16, plain, % 2.40/0.64 ~relation(X4), % 2.40/0.64 inference(strict_function_extension, [assumptions([a6])], [c11, c14])). % 2.40/0.64 cnf(c17, plain, % 2.40/0.64 X5 != relation_dom(relation_inverse(X4)) | X5 != relation_dom(function_inverse(sK2)), % 2.40/0.64 inference(strict_function_extension, [assumptions([a6])], [c11, c14])). % 2.40/0.64 % 2.40/0.64 cnf(c18, plain, % 2.40/0.64 function_inverse(X0) = relation_inverse(X0)). % 2.40/0.64 cnf(a7, assumption, % 2.40/0.64 relation_inverse(X4) = relation_inverse(X0)). % 2.40/0.64 cnf(a8, assumption, % 2.40/0.64 function_inverse(X0) = X6). % 2.40/0.64 cnf(c19, plain, % 2.40/0.64 X5 != relation_dom(function_inverse(sK2)), % 2.40/0.64 inference(equality_reduction, [assumptions([a7, a8])], [c17, c18])). % 2.40/0.64 cnf(c20, plain, % 2.40/0.64 X5 != relation_dom(X6), % 2.40/0.64 inference(equality_reduction, [assumptions([a7, a8])], [c17, c18])). % 2.40/0.64 % 2.40/0.64 cnf(a9, assumption, % 2.40/0.64 X5 = relation_dom(X6)). % 2.40/0.64 cnf(c21, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(reflexivity, [assumptions([a9])], [c20])). % 2.40/0.64 % 2.40/0.64 cnf(a10, assumption, % 2.40/0.64 X5 = relation_dom(function_inverse(sK2))). % 2.40/0.64 cnf(c22, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(reflexivity, [assumptions([a10])], [c19])). % 2.40/0.64 % 2.40/0.64 cnf(c23, plain, % 2.40/0.64 relation(sK2)). % 2.40/0.64 cnf(a11, assumption, % 2.40/0.64 X4 = sK2). % 2.40/0.64 cnf(c24, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(predicate_reduction, [assumptions([a11])], [c16, c23])). % 2.40/0.64 % 2.40/0.64 cnf(c25, plain, % 2.40/0.64 relation(sK2)). % 2.40/0.64 cnf(a12, assumption, % 2.40/0.64 X1 = sK2). % 2.40/0.64 cnf(c26, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(predicate_reduction, [assumptions([a12])], [c7, c25])). % 2.40/0.64 % 2.40/0.64 cnf(c27, axiom, % 2.40/0.64 one_to_one(sK2)). % 2.40/0.64 cnf(a13, assumption, % 2.40/0.64 X0 = sK2). % 2.40/0.64 cnf(c28, plain, % 2.40/0.64 ~function(X0), % 2.40/0.64 inference(strict_predicate_extension, [assumptions([a13])], [c6, c27])). % 2.40/0.64 cnf(c29, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(strict_predicate_extension, [assumptions([a13])], [c6, c27])). % 2.40/0.64 % 2.40/0.64 cnf(c30, axiom, % 2.40/0.64 function(sK2)). % 2.40/0.64 cnf(a14, assumption, % 2.40/0.64 X0 = sK2). % 2.40/0.64 cnf(c31, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(strict_predicate_extension, [assumptions([a14])], [c28, c30])). % 2.40/0.64 cnf(c32, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(strict_predicate_extension, [assumptions([a14])], [c28, c30])). % 2.40/0.64 % 2.40/0.64 cnf(c33, plain, % 2.40/0.64 $false, % 2.40/0.64 inference(constraint_solving, [ % 2.40/0.64 bind(X0, sK2), % 2.40/0.64 bind(X1, sK2), % 2.40/0.64 bind(X2, function_inverse(X0)), % 2.40/0.64 bind(X3, relation_dom(X1)), % 2.40/0.64 bind(X4, sK2), % 2.40/0.64 bind(X5, relation_dom(X6)), % 2.40/0.64 bind(X6, function_inverse(X0)) % 2.40/0.64 ], % 2.40/0.64 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])). % 2.40/0.64 % 2.40/0.64 % SZS output end IncompleteProof %------------------------------------------------------------------------------