%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET173+3 : TPTP v8.1.0. Released v2.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 : n010.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:44:27 EDT 2022 % Result : Theorem 2.75s 0.75s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET173+3 : TPTP v8.1.0. Released v2.2.0. % 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n010.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 09:42:15 EDT 2022 % 0.12/0.34 % CPUTime : % 2.75/0.75 % SZS status Theorem % 2.75/0.75 % SZS output begin IncompleteProof % 2.75/0.75 cnf(c0, axiom, % 2.75/0.75 sK3 != intersection(sK3,union(sK3,sK4))). % 2.75/0.75 cnf(c1, plain, % 2.75/0.75 sK3 != intersection(sK3,union(sK3,sK4)), % 2.75/0.75 inference(start, [], [c0])). % 2.75/0.75 % 2.75/0.75 cnf(c2, axiom, % 2.75/0.75 X0 = X1 | ~sP0(X1,X0)). % 2.75/0.75 cnf(a0, assumption, % 2.75/0.75 intersection(sK3,union(sK3,sK4)) = X1). % 2.75/0.75 cnf(c3, plain, % 2.75/0.75 $false, % 2.75/0.75 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 2.75/0.75 cnf(c4, plain, % 2.75/0.75 ~sP0(X1,X0), % 2.75/0.75 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 2.75/0.75 cnf(c5, plain, % 2.75/0.75 X0 != X2 | sK3 != X2, % 2.75/0.75 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 2.75/0.75 % 2.75/0.75 cnf(a1, assumption, % 2.75/0.75 X0 = X2). % 2.75/0.75 cnf(c6, plain, % 2.75/0.75 sK3 != X2, % 2.75/0.75 inference(reflexivity, [assumptions([a1])], [c5])). % 2.75/0.75 % 2.75/0.75 cnf(a2, assumption, % 2.75/0.75 sK3 = X2). % 2.75/0.75 cnf(c7, plain, % 2.75/0.75 $false, % 2.75/0.75 inference(reflexivity, [assumptions([a2])], [c6])). % 2.75/0.75 % 2.75/0.75 cnf(c8, axiom, % 2.75/0.75 sP0(X3,X4) | member(sK2(X3,X4),X3) | member(sK2(X3,X4),X4)). % 2.75/0.75 cnf(a3, assumption, % 2.75/0.75 X1 = X3). % 2.75/0.75 cnf(a4, assumption, % 2.75/0.75 X0 = X4). % 2.75/0.75 cnf(c9, plain, % 2.75/0.75 $false, % 2.75/0.75 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])). % 2.75/0.75 cnf(c10, plain, % 2.75/0.75 member(sK2(X3,X4),X3) | member(sK2(X3,X4),X4), % 2.75/0.75 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])). % 2.75/0.75 % 2.75/0.75 cnf(c11, axiom, % 2.75/0.75 member(X5,X6) | ~member(X5,intersection(X6,X7))). % 2.75/0.75 cnf(a5, assumption, % 2.75/0.75 sK2(X3,X4) = X5). % 2.75/0.75 cnf(a6, assumption, % 2.75/0.75 X3 = intersection(X6,X7)). % 2.75/0.75 cnf(c12, plain, % 2.75/0.75 member(sK2(X3,X4),X4), % 2.75/0.75 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 2.75/0.75 cnf(c13, plain, % 2.75/0.75 member(X5,X6), % 2.75/0.75 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 2.75/0.75 % 2.75/0.75 cnf(c14, axiom, % 2.75/0.75 sP0(X8,X9) | ~member(sK2(X8,X9),X8) | ~member(sK2(X8,X9),X9)). % 2.75/0.75 cnf(a7, assumption, % 2.75/0.75 X5 = sK2(X8,X9)). % 2.75/0.75 cnf(a8, assumption, % 2.75/0.75 X6 = X9). % 2.75/0.75 cnf(c15, plain, % 2.75/0.75 $false, % 2.75/0.75 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 2.75/0.75 cnf(c16, plain, % 2.75/0.75 sP0(X8,X9) | ~member(sK2(X8,X9),X8), % 2.75/0.75 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 2.75/0.75 % 2.75/0.75 cnf(c17, plain, % 2.75/0.75 ~sP0(X1,X0)). % 2.75/0.75 cnf(a9, assumption, % 2.75/0.75 X8 = X1). % 2.75/0.75 cnf(a10, assumption, % 2.75/0.75 X9 = X0). % 2.75/0.75 cnf(c18, plain, % 2.75/0.75 ~member(sK2(X8,X9),X8), % 2.75/0.75 inference(predicate_reduction, [assumptions([a9, a10])], [c16, c17])). % 2.75/0.75 % 2.75/0.75 cnf(c19, plain, % 2.75/0.75 member(sK2(X3,X4),X3)). % 2.75/0.75 cnf(a11, assumption, % 2.75/0.75 sK2(X8,X9) = sK2(X3,X4)). % 2.75/0.75 cnf(a12, assumption, % 2.75/0.75 X8 = X3). % 2.75/0.75 cnf(c20, plain, % 2.75/0.75 $false, % 2.75/0.75 inference(predicate_reduction, [assumptions([a11, a12])], [c18, c19])). % 2.75/0.75 % 2.75/0.75 cnf(c21, axiom, % 2.75/0.75 member(X10,intersection(X11,X12)) | ~member(X10,X12) | ~member(X10,X11)). % 2.75/0.75 cnf(a13, assumption, % 2.75/0.75 sK2(X3,X4) = X10). % 2.75/0.75 cnf(a14, assumption, % 2.75/0.75 X4 = X11). % 2.75/0.75 cnf(c22, plain, % 2.75/0.75 $false, % 2.75/0.75 inference(strict_predicate_extension, [assumptions([a13, a14])], [c12, c21])). % 2.75/0.75 cnf(c23, plain, % 2.75/0.75 member(X10,intersection(X11,X12)) | ~member(X10,X12), % 2.75/0.75 inference(strict_predicate_extension, [assumptions([a13, a14])], [c12, c21])). % 2.75/0.75 % 2.75/0.75 cnf(c24, plain, % 2.75/0.75 ~member(sK2(X3,X4),X3)). % 2.75/0.75 cnf(a15, assumption, % 2.75/0.75 X10 = sK2(X3,X4)). % 2.75/0.75 cnf(a16, assumption, % 2.75/0.75 intersection(X11,X12) = X3). % 2.75/0.75 cnf(c25, plain, % 2.75/0.75 ~member(X10,X12), % 2.75/0.75 inference(predicate_reduction, [assumptions([a15, a16])], [c23, c24])). % 2.75/0.75 % 2.75/0.75 cnf(c26, axiom, % 2.75/0.75 member(X13,union(X14,X15)) | ~member(X13,X14)). % 2.75/0.75 cnf(a17, assumption, % 2.75/0.75 X10 = X13). % 2.75/0.75 cnf(a18, assumption, % 2.75/0.75 X12 = union(X14,X15)). % 2.75/0.75 cnf(c27, plain, % 2.75/0.75 $false, % 2.75/0.75 inference(strict_predicate_extension, [assumptions([a17, a18])], [c25, c26])). % 2.75/0.75 cnf(c28, plain, % 2.75/0.75 ~member(X13,X14), % 2.75/0.75 inference(strict_predicate_extension, [assumptions([a17, a18])], [c25, c26])). % 2.75/0.75 % 2.75/0.75 cnf(c29, plain, % 2.75/0.75 member(sK2(X3,X4),X4)). % 2.75/0.75 cnf(a19, assumption, % 2.75/0.75 X13 = sK2(X3,X4)). % 2.75/0.75 cnf(a20, assumption, % 2.75/0.75 X14 = X4). % 2.75/0.75 cnf(c30, plain, % 2.75/0.75 $false, % 2.75/0.75 inference(predicate_reduction, [assumptions([a19, a20])], [c28, c29])). % 2.75/0.75 % 2.75/0.75 cnf(c31, plain, % 2.75/0.75 $false, % 2.75/0.75 inference(constraint_solving, [ % 2.75/0.75 bind(X0, sK3), % 2.75/0.75 bind(X1, intersection(sK3,union(sK3,sK4))), % 2.75/0.75 bind(X2, sK3), % 2.75/0.75 bind(X3, intersection(sK3,union(sK3,sK4))), % 2.75/0.75 bind(X4, sK3), % 2.75/0.75 bind(X5, sK2(X3,X4)), % 2.75/0.75 bind(X6, sK3), % 2.75/0.75 bind(X7, union(sK3,sK4)), % 2.75/0.75 bind(X8, intersection(sK3,union(sK3,sK4))), % 2.75/0.75 bind(X9, sK3), % 2.75/0.75 bind(X10, sK2(X3,X4)), % 2.75/0.75 bind(X11, sK3), % 2.75/0.75 bind(X12, union(sK3,sK4)), % 2.75/0.75 bind(X13, sK2(X3,X4)), % 2.75/0.75 bind(X14, sK3), % 2.75/0.75 bind(X15, sK4) % 2.75/0.75 ], % 2.75/0.75 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])). % 2.75/0.75 % 2.75/0.75 % SZS output end IncompleteProof %------------------------------------------------------------------------------