%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET886+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 : n028.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:48:59 EDT 2022 % Result : Theorem 0.12s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET886+1 : TPTP v8.1.0. Released v3.2.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n028.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.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 08:50:43 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.36 % SZS status Theorem % 0.12/0.36 % SZS output begin IncompleteProof % 0.12/0.36 cnf(c0, axiom, % 0.12/0.36 subset(unordered_pair(sK2,sK3),unordered_pair(sK4,sK4))). % 0.12/0.36 cnf(c1, plain, % 0.12/0.36 subset(unordered_pair(sK2,sK3),unordered_pair(sK4,sK4)), % 0.12/0.36 inference(start, [], [c0])). % 0.12/0.36 % 0.12/0.36 cnf(c2, axiom, % 0.12/0.36 X0 = X1 | ~subset(unordered_pair(X0,X2),unordered_pair(X1,X1))). % 0.12/0.36 cnf(a0, assumption, % 0.12/0.36 unordered_pair(sK2,sK3) = unordered_pair(X0,X2)). % 0.12/0.36 cnf(a1, assumption, % 0.12/0.36 unordered_pair(sK4,sK4) = unordered_pair(X1,X1)). % 0.12/0.36 cnf(c3, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.36 cnf(c4, plain, % 0.12/0.36 X0 = X1, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.36 % 0.12/0.36 cnf(c5, axiom, % 0.12/0.36 unordered_pair(sK2,sK3) != unordered_pair(sK4,sK4)). % 0.12/0.36 cnf(a2, assumption, % 0.12/0.36 sK4 = X1). % 0.12/0.36 cnf(c6, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 0.12/0.36 cnf(c7, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 0.12/0.36 cnf(c8, plain, % 0.12/0.36 unordered_pair(sK2,sK3) != unordered_pair(X0,sK4), % 0.12/0.36 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 0.12/0.36 % 0.12/0.36 cnf(c9, axiom, % 0.12/0.36 X3 = X4 | ~subset(unordered_pair(X3,X5),unordered_pair(X4,X4))). % 0.12/0.36 cnf(a3, assumption, % 0.12/0.36 sK4 = X4). % 0.12/0.36 cnf(c10, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(variable_extension, [assumptions([a3])], [c8, c9])). % 0.12/0.36 cnf(c11, plain, % 0.12/0.36 ~subset(unordered_pair(X3,X5),unordered_pair(X4,X4)), % 0.12/0.36 inference(variable_extension, [assumptions([a3])], [c8, c9])). % 0.12/0.36 cnf(c12, plain, % 0.12/0.36 X3 != X6 | unordered_pair(sK2,sK3) != unordered_pair(X0,X6), % 0.12/0.36 inference(variable_extension, [assumptions([a3])], [c8, c9])). % 0.12/0.36 % 0.12/0.36 cnf(a4, assumption, % 0.12/0.36 X3 = X6). % 0.12/0.36 cnf(c13, plain, % 0.12/0.36 unordered_pair(sK2,sK3) != unordered_pair(X0,X6), % 0.12/0.36 inference(reflexivity, [assumptions([a4])], [c12])). % 0.12/0.36 % 0.12/0.36 cnf(a5, assumption, % 0.12/0.36 unordered_pair(sK2,sK3) = unordered_pair(X0,X6)). % 0.12/0.36 cnf(c14, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(reflexivity, [assumptions([a5])], [c13])). % 0.12/0.36 % 0.12/0.36 cnf(c15, axiom, % 0.12/0.36 unordered_pair(X7,X8) = unordered_pair(X8,X7)). % 0.12/0.36 cnf(a6, assumption, % 0.12/0.36 unordered_pair(X3,X5) = unordered_pair(X7,X8)). % 0.12/0.36 cnf(c16, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_function_extension, [assumptions([a6])], [c11, c15])). % 0.12/0.36 cnf(c17, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_function_extension, [assumptions([a6])], [c11, c15])). % 0.12/0.36 cnf(c18, plain, % 0.12/0.36 X9 != unordered_pair(X8,X7) | ~subset(X9,unordered_pair(X4,X4)), % 0.12/0.36 inference(strict_function_extension, [assumptions([a6])], [c11, c15])). % 0.12/0.36 % 0.12/0.36 cnf(a7, assumption, % 0.12/0.36 X9 = unordered_pair(X8,X7)). % 0.12/0.36 cnf(c19, plain, % 0.12/0.36 ~subset(X9,unordered_pair(X4,X4)), % 0.12/0.36 inference(reflexivity, [assumptions([a7])], [c18])). % 0.12/0.36 % 0.12/0.36 cnf(c20, plain, % 0.12/0.36 subset(unordered_pair(sK2,sK3),unordered_pair(sK4,sK4))). % 0.12/0.36 cnf(a8, assumption, % 0.12/0.36 X9 = unordered_pair(sK2,sK3)). % 0.12/0.36 cnf(a9, assumption, % 0.12/0.36 unordered_pair(X4,X4) = unordered_pair(sK4,sK4)). % 0.12/0.36 cnf(c21, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(predicate_reduction, [assumptions([a8, a9])], [c19, c20])). % 0.12/0.36 % 0.12/0.36 cnf(c22, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(constraint_solving, [ % 0.12/0.36 bind(X0, sK2), % 0.12/0.36 bind(X1, sK4), % 0.12/0.36 bind(X2, sK3), % 0.12/0.36 bind(X3, sK3), % 0.12/0.36 bind(X4, sK4), % 0.12/0.36 bind(X5, sK2), % 0.12/0.36 bind(X6, sK3), % 0.12/0.36 bind(X7, sK3), % 0.12/0.36 bind(X8, sK2), % 0.12/0.36 bind(X9, unordered_pair(X8,X7)) % 0.12/0.36 ], % 0.12/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.12/0.36 % 0.12/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------