%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU186+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 : n017.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:52 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SEU186+1 : TPTP v8.1.0. Released v3.3.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n017.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 Jun 19 14:42:13 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.37 % SZS status Theorem % 0.12/0.37 % SZS output begin IncompleteProof % 0.12/0.37 cnf(c0, axiom, % 0.12/0.37 relation(sK8)). % 0.12/0.37 cnf(c1, plain, % 0.12/0.37 relation(sK8), % 0.12/0.37 inference(start, [], [c0])). % 0.12/0.37 % 0.12/0.37 cnf(c2, axiom, % 0.12/0.37 unordered_pair(unordered_pair(sK1(X0),sK2(X0)),singleton(sK1(X0))) = X0 | ~in(X0,X1) | ~relation(X1)). % 0.12/0.37 cnf(a0, assumption, % 0.12/0.37 sK8 = X1). % 0.12/0.37 cnf(c3, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.37 cnf(c4, plain, % 0.12/0.37 unordered_pair(unordered_pair(sK1(X0),sK2(X0)),singleton(sK1(X0))) = X0 | ~in(X0,X1), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.37 % 0.12/0.37 cnf(c5, axiom, % 0.12/0.37 ~in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),sK8)). % 0.12/0.37 cnf(a1, assumption, % 0.12/0.37 unordered_pair(unordered_pair(X2,X3),singleton(X2)) = unordered_pair(unordered_pair(sK1(X0),sK2(X0)),singleton(sK1(X0)))). % 0.12/0.37 cnf(c6, plain, % 0.12/0.37 ~in(X0,X1), % 0.12/0.37 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])). % 0.12/0.37 cnf(c7, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])). % 0.12/0.37 cnf(c8, plain, % 0.12/0.37 ~in(X0,sK8), % 0.12/0.37 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])). % 0.12/0.37 % 0.12/0.37 cnf(c9, axiom, % 0.12/0.37 in(X4,X5) | empty(X5) | ~element(X4,X5)). % 0.12/0.37 cnf(a2, assumption, % 0.12/0.37 X0 = X4). % 0.12/0.37 cnf(a3, assumption, % 0.12/0.37 sK8 = X5). % 0.12/0.37 cnf(c10, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c8, c9])). % 0.12/0.37 cnf(c11, plain, % 0.12/0.37 empty(X5) | ~element(X4,X5), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c8, c9])). % 0.12/0.37 % 0.12/0.37 cnf(c12, axiom, % 0.12/0.37 empty_set = X6 | ~empty(X6)). % 0.12/0.37 cnf(a4, assumption, % 0.12/0.37 X5 = X6). % 0.12/0.37 cnf(c13, plain, % 0.12/0.37 ~element(X4,X5), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c11, c12])). % 0.12/0.37 cnf(c14, plain, % 0.12/0.37 empty_set = X6, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c11, c12])). % 0.12/0.37 % 0.12/0.37 cnf(c15, axiom, % 0.12/0.37 empty_set != sK8). % 0.12/0.37 cnf(a5, assumption, % 0.12/0.37 sK8 = X6). % 0.12/0.37 cnf(a6, assumption, % 0.12/0.37 empty_set = X7). % 0.12/0.37 cnf(c16, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_subterm_extension, [assumptions([a5, a6])], [c14, c15])). % 0.12/0.37 cnf(c17, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_subterm_extension, [assumptions([a5, a6])], [c14, c15])). % 0.12/0.37 cnf(c18, plain, % 0.12/0.37 empty_set != X7, % 0.12/0.37 inference(strict_subterm_extension, [assumptions([a5, a6])], [c14, c15])). % 0.12/0.37 % 0.12/0.37 cnf(a7, assumption, % 0.12/0.37 empty_set = X7). % 0.12/0.37 cnf(c19, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(reflexivity, [assumptions([a7])], [c18])). % 0.12/0.37 % 0.12/0.37 cnf(c20, axiom, % 0.12/0.37 element(sK3(X8),X8)). % 0.12/0.37 cnf(a8, assumption, % 0.12/0.37 X4 = sK3(X8)). % 0.12/0.37 cnf(a9, assumption, % 0.12/0.37 X5 = X8). % 0.12/0.37 cnf(c21, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c20])). % 0.12/0.37 cnf(c22, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c20])). % 0.12/0.37 % 0.12/0.37 cnf(c23, plain, % 0.12/0.37 in(X0,sK8)). % 0.12/0.37 cnf(a10, assumption, % 0.12/0.37 X0 = X0). % 0.12/0.37 cnf(a11, assumption, % 0.12/0.37 X1 = sK8). % 0.12/0.37 cnf(c24, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(predicate_reduction, [assumptions([a10, a11])], [c6, c23])). % 0.12/0.37 % 0.12/0.37 cnf(c25, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(constraint_solving, [ % 0.12/0.37 bind(X0, sK3(X8)), % 0.12/0.37 bind(X1, sK8), % 0.12/0.37 bind(X2, sK1(X0)), % 0.12/0.37 bind(X3, sK2(X0)), % 0.12/0.37 bind(X4, sK3(X8)), % 0.12/0.37 bind(X5, sK8), % 0.12/0.37 bind(X6, sK8), % 0.12/0.37 bind(X7, empty_set), % 0.12/0.37 bind(X8, sK8) % 0.12/0.37 ], % 0.12/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.12/0.37 % 0.12/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------