%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET949+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 : n026.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:49:23 EDT 2022 % Result : Theorem 0.14s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SET949+1 : TPTP v8.1.0. Released v3.2.0. % 0.12/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.35 % Computer : n026.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Sun Jul 10 13:32:26 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.36 % SZS status Theorem % 0.14/0.36 % SZS output begin IncompleteProof % 0.14/0.36 cnf(c0, axiom, % 0.14/0.36 in(sK7,cartesian_product2(sK8,sK9))). % 0.14/0.36 cnf(c1, plain, % 0.14/0.36 in(sK7,cartesian_product2(sK8,sK9)), % 0.14/0.36 inference(start, [], [c0])). % 0.14/0.36 % 0.14/0.36 cnf(c2, axiom, % 0.14/0.36 sP0(X0,X1,X2) | ~in(X0,X3) | ~sP1(X2,X1,X3)). % 0.14/0.36 cnf(a0, assumption, % 0.14/0.36 sK7 = X0). % 0.14/0.36 cnf(a1, assumption, % 0.14/0.36 cartesian_product2(sK8,sK9) = X3). % 0.14/0.36 cnf(c3, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.36 cnf(c4, plain, % 0.14/0.36 sP0(X0,X1,X2) | ~sP1(X2,X1,X3), % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.36 % 0.14/0.36 cnf(c5, axiom, % 0.14/0.36 unordered_pair(unordered_pair(sK3(X4,X5,X6),sK4(X4,X5,X6)),singleton(sK3(X4,X5,X6))) = X4 | ~sP0(X4,X5,X6)). % 0.14/0.36 cnf(a2, assumption, % 0.14/0.36 X0 = X4). % 0.14/0.36 cnf(a3, assumption, % 0.14/0.36 X1 = X5). % 0.14/0.36 cnf(a4, assumption, % 0.14/0.36 X2 = X6). % 0.14/0.36 cnf(c6, plain, % 0.14/0.36 ~sP1(X2,X1,X3), % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 0.14/0.36 cnf(c7, plain, % 0.14/0.36 unordered_pair(unordered_pair(sK3(X4,X5,X6),sK4(X4,X5,X6)),singleton(sK3(X4,X5,X6))) = X4, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 0.14/0.36 % 0.14/0.36 cnf(c8, axiom, % 0.14/0.36 sK7 != unordered_pair(unordered_pair(X7,X8),singleton(X7))). % 0.14/0.36 cnf(a5, assumption, % 0.14/0.36 unordered_pair(unordered_pair(X7,X8),singleton(X7)) = unordered_pair(unordered_pair(sK3(X4,X5,X6),sK4(X4,X5,X6)),singleton(sK3(X4,X5,X6)))). % 0.14/0.36 cnf(c9, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_subterm_extension, [assumptions([a5])], [c7, c8])). % 0.14/0.36 cnf(c10, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_subterm_extension, [assumptions([a5])], [c7, c8])). % 0.14/0.36 cnf(c11, plain, % 0.14/0.36 sK7 != X4, % 0.14/0.36 inference(strict_subterm_extension, [assumptions([a5])], [c7, c8])). % 0.14/0.36 % 0.14/0.36 cnf(a6, assumption, % 0.14/0.36 sK7 = X4). % 0.14/0.36 cnf(c12, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(reflexivity, [assumptions([a6])], [c11])). % 0.14/0.36 % 0.14/0.36 cnf(c13, axiom, % 0.14/0.36 sP1(X9,X10,cartesian_product2(X9,X10))). % 0.14/0.36 cnf(a7, assumption, % 0.14/0.36 X2 = X9). % 0.14/0.36 cnf(a8, assumption, % 0.14/0.36 X1 = X10). % 0.14/0.36 cnf(a9, assumption, % 0.14/0.36 X3 = cartesian_product2(X9,X10)). % 0.14/0.36 cnf(c14, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c6, c13])). % 0.14/0.36 cnf(c15, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c6, c13])). % 0.14/0.36 % 0.14/0.36 cnf(c16, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(constraint_solving, [ % 0.14/0.36 bind(X0, sK7), % 0.14/0.36 bind(X1, sK9), % 0.14/0.36 bind(X2, sK8), % 0.14/0.36 bind(X3, cartesian_product2(sK8,sK9)), % 0.14/0.36 bind(X4, sK7), % 0.14/0.36 bind(X5, sK9), % 0.14/0.36 bind(X6, sK8), % 0.14/0.36 bind(X7, sK3(X4,X5,X6)), % 0.14/0.36 bind(X8, sK4(X4,X5,X6)), % 0.14/0.36 bind(X9, sK8), % 0.14/0.36 bind(X10, sK9) % 0.14/0.36 ], % 0.14/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.14/0.36 % 0.14/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------