%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET091+1 : TPTP v8.1.0. Bugfixed v7.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 : n005.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 02:43:38 EDT 2022 % Result : Theorem 12.96s 2.06s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET091+1 : TPTP v8.1.0. Bugfixed v7.3.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n005.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 Jul 10 09:37:22 EDT 2022 % 0.13/0.34 % CPUTime : % 12.96/2.06 % SZS status Theorem % 12.96/2.06 % SZS output begin IncompleteProof % 12.96/2.06 cnf(c0, axiom, % 12.96/2.06 sK10 != unordered_pair(X0,X0) | ~member(X0,universal_class)). % 12.96/2.06 cnf(c1, plain, % 12.96/2.06 sK10 != unordered_pair(X0,X0) | ~member(X0,universal_class), % 12.96/2.06 inference(start, [], [c0])). % 12.96/2.06 % 12.96/2.06 cnf(c2, axiom, % 12.96/2.06 member_of(X1) = X1 | unordered_pair(member_of(X1),member_of(X1)) = X1). % 12.96/2.06 cnf(a0, assumption, % 12.96/2.06 unordered_pair(X0,X0) = unordered_pair(member_of(X1),member_of(X1))). % 12.96/2.06 cnf(c3, plain, % 12.96/2.06 ~member(X0,universal_class), % 12.96/2.06 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 12.96/2.06 cnf(c4, plain, % 12.96/2.06 member_of(X1) = X1, % 12.96/2.06 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 12.96/2.06 cnf(c5, plain, % 12.96/2.06 X2 != X1 | sK10 != X2, % 12.96/2.06 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 12.96/2.06 % 12.96/2.06 cnf(a1, assumption, % 12.96/2.06 X2 = X1). % 12.96/2.06 cnf(c6, plain, % 12.96/2.06 sK10 != X2, % 12.96/2.06 inference(reflexivity, [assumptions([a1])], [c5])). % 12.96/2.06 % 12.96/2.06 cnf(a2, assumption, % 12.96/2.06 sK10 = X2). % 12.96/2.06 cnf(c7, plain, % 12.96/2.06 $false, % 12.96/2.06 inference(reflexivity, [assumptions([a2])], [c6])). % 12.96/2.06 % 12.96/2.06 cnf(c8, axiom, % 12.96/2.06 sK10 != member_of(sK10)). % 12.96/2.06 cnf(a3, assumption, % 12.96/2.06 member_of(sK10) = member_of(X1)). % 12.96/2.06 cnf(c9, plain, % 12.96/2.06 $false, % 12.96/2.06 inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])). % 12.96/2.06 cnf(c10, plain, % 12.96/2.06 $false, % 12.96/2.06 inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])). % 12.96/2.06 cnf(c11, plain, % 12.96/2.06 sK10 != X1, % 12.96/2.06 inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])). % 12.96/2.06 % 12.96/2.06 cnf(a4, assumption, % 12.96/2.06 sK10 = X1). % 12.96/2.06 cnf(c12, plain, % 12.96/2.06 $false, % 12.96/2.06 inference(reflexivity, [assumptions([a4])], [c11])). % 12.96/2.06 % 12.96/2.06 cnf(c13, axiom, % 12.96/2.06 member_of(X3) = X3 | member(member_of(X3),universal_class)). % 12.96/2.06 cnf(a5, assumption, % 12.96/2.06 X0 = member_of(X3)). % 12.96/2.06 cnf(a6, assumption, % 12.96/2.06 universal_class = universal_class). % 12.96/2.06 cnf(c14, plain, % 12.96/2.06 $false, % 12.96/2.06 inference(strict_predicate_extension, [assumptions([a5, a6])], [c3, c13])). % 12.96/2.06 cnf(c15, plain, % 12.96/2.06 member_of(X3) = X3, % 12.96/2.06 inference(strict_predicate_extension, [assumptions([a5, a6])], [c3, c13])). % 12.96/2.06 % 12.96/2.06 cnf(c16, plain, % 12.96/2.06 member_of(X1) != X1). % 12.96/2.06 cnf(a7, assumption, % 12.96/2.06 member_of(X1) = member_of(X3)). % 12.96/2.06 cnf(c17, plain, % 12.96/2.06 $false, % 12.96/2.06 inference(subterm_reduction, [assumptions([a7])], [c15, c16])). % 13.50/2.06 cnf(c18, plain, % 13.50/2.06 X3 != X1, % 13.50/2.06 inference(subterm_reduction, [assumptions([a7])], [c15, c16])). % 13.50/2.06 % 13.50/2.06 cnf(a8, assumption, % 13.50/2.06 X3 = X1). % 13.50/2.06 cnf(c19, plain, % 13.50/2.06 $false, % 13.50/2.06 inference(reflexivity, [assumptions([a8])], [c18])). % 13.50/2.06 % 13.50/2.06 cnf(c20, plain, % 13.50/2.06 $false, % 13.50/2.06 inference(constraint_solving, [ % 13.50/2.06 bind(X0, member_of(X1)), % 13.50/2.06 bind(X1, sK10), % 13.50/2.06 bind(X2, sK10), % 13.50/2.06 bind(X3, sK10) % 13.50/2.06 ], % 13.50/2.06 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 13.50/2.06 % 13.50/2.06 % SZS output end IncompleteProof %------------------------------------------------------------------------------