%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU115+1 : TPTP v8.1.0. Released v3.2.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 : Tue Jul 19 11:53:12 EDT 2022 % Result : Theorem 0.10s 0.30s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.10 % Problem : SEU115+1 : TPTP v8.1.0. Released v3.2.0. % 0.08/0.10 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.10/0.29 % Computer : n032.cluster.edu % 0.10/0.29 % Model : x86_64 x86_64 % 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.29 % Memory : 8042.1875MB % 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.29 % CPULimit : 300 % 0.10/0.29 % WCLimit : 600 % 0.10/0.29 % DateTime : Sun Jun 19 08:56:17 EDT 2022 % 0.10/0.29 % CPUTime : % 0.10/0.30 % SZS status Theorem % 0.10/0.30 % SZS output begin IncompleteProof % 0.10/0.30 cnf(c0, axiom, % 0.10/0.30 finite_subsets(empty_set) != singleton(empty_set)). % 0.10/0.30 cnf(c1, plain, % 0.10/0.30 finite_subsets(empty_set) != singleton(empty_set), % 0.10/0.30 inference(start, [], [c0])). % 0.10/0.30 % 0.10/0.30 cnf(c2, axiom, % 0.10/0.30 singleton(empty_set) = powerset(empty_set)). % 0.10/0.30 cnf(a0, assumption, % 0.10/0.30 singleton(empty_set) = singleton(empty_set)). % 0.10/0.30 cnf(c3, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.30 cnf(c4, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.30 cnf(c5, plain, % 0.10/0.30 X0 != powerset(empty_set) | finite_subsets(empty_set) != X0, % 0.10/0.30 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.30 % 0.10/0.30 cnf(a1, assumption, % 0.10/0.30 X0 = powerset(empty_set)). % 0.10/0.30 cnf(c6, plain, % 0.10/0.30 finite_subsets(empty_set) != X0, % 0.10/0.30 inference(reflexivity, [assumptions([a1])], [c5])). % 0.10/0.30 % 0.10/0.30 cnf(c7, axiom, % 0.10/0.30 finite_subsets(X1) = powerset(X1) | ~finite(X1)). % 0.10/0.30 cnf(a2, assumption, % 0.10/0.30 finite_subsets(empty_set) = finite_subsets(X1)). % 0.10/0.30 cnf(c8, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(strict_function_extension, [assumptions([a2])], [c6, c7])). % 0.10/0.30 cnf(c9, plain, % 0.10/0.30 ~finite(X1), % 0.10/0.30 inference(strict_function_extension, [assumptions([a2])], [c6, c7])). % 0.10/0.30 cnf(c10, plain, % 0.10/0.30 X2 != powerset(X1) | X2 != X0, % 0.10/0.30 inference(strict_function_extension, [assumptions([a2])], [c6, c7])). % 0.10/0.30 % 0.10/0.30 cnf(a3, assumption, % 0.10/0.30 X2 = powerset(X1)). % 0.10/0.30 cnf(c11, plain, % 0.10/0.30 X2 != X0, % 0.10/0.30 inference(reflexivity, [assumptions([a3])], [c10])). % 0.10/0.30 % 0.10/0.30 cnf(a4, assumption, % 0.10/0.30 X2 = X0). % 0.10/0.30 cnf(c12, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(reflexivity, [assumptions([a4])], [c11])). % 0.10/0.30 % 0.10/0.30 cnf(c13, axiom, % 0.10/0.30 finite(X3) | ~empty(X3)). % 0.10/0.30 cnf(a5, assumption, % 0.10/0.30 X1 = X3). % 0.10/0.30 cnf(c14, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(strict_predicate_extension, [assumptions([a5])], [c9, c13])). % 0.10/0.30 cnf(c15, plain, % 0.10/0.30 ~empty(X3), % 0.10/0.30 inference(strict_predicate_extension, [assumptions([a5])], [c9, c13])). % 0.10/0.30 % 0.10/0.30 cnf(c16, axiom, % 0.10/0.30 empty(empty_set)). % 0.10/0.30 cnf(a6, assumption, % 0.10/0.30 X3 = empty_set). % 0.10/0.30 cnf(c17, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(strict_predicate_extension, [assumptions([a6])], [c15, c16])). % 0.10/0.30 cnf(c18, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(strict_predicate_extension, [assumptions([a6])], [c15, c16])). % 0.10/0.30 % 0.10/0.30 cnf(c19, plain, % 0.10/0.30 $false, % 0.10/0.30 inference(constraint_solving, [ % 0.10/0.30 bind(X0, powerset(empty_set)), % 0.10/0.30 bind(X1, empty_set), % 0.10/0.30 bind(X2, powerset(X1)), % 0.10/0.30 bind(X3, empty_set) % 0.10/0.30 ], % 0.10/0.30 [a0, a1, a2, a3, a4, a5, a6])). % 0.10/0.30 % 0.10/0.30 % SZS output end IncompleteProof %------------------------------------------------------------------------------