%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET594+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:46:49 EDT 2022 % Result : Theorem 100.43s 13.20s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET594+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 : Sat Jul 9 21:04:00 EDT 2022 % 0.12/0.34 % CPUTime : % 100.43/13.20 % SZS status Theorem % 100.43/13.20 % SZS output begin IncompleteProof % 100.43/13.20 cnf(c0, axiom, % 100.43/13.20 sK3 = union(intersection(sK3,sK4),intersection(sK3,sK5))). % 100.43/13.20 cnf(c1, plain, % 100.43/13.20 sK3 = union(intersection(sK3,sK4),intersection(sK3,sK5)), % 100.43/13.20 inference(start, [], [c0])). % 100.43/13.20 % 100.43/13.20 cnf(c2, axiom, % 100.43/13.20 member(X0,X1) | member(X0,X2) | ~member(X0,union(X2,X1))). % 100.43/13.20 cnf(a0, assumption, % 100.43/13.20 union(X2,X1) = union(intersection(sK3,sK4),intersection(sK3,sK5))). % 100.43/13.20 cnf(a1, assumption, % 100.43/13.20 sK3 = X3). % 100.43/13.20 cnf(c3, plain, % 100.43/13.20 $false, % 100.43/13.20 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 100.43/13.20 cnf(c4, plain, % 100.43/13.20 member(X0,X1) | member(X0,X2), % 100.43/13.20 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 100.43/13.20 cnf(c5, plain, % 100.43/13.20 ~member(X0,X3), % 100.43/13.20 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 100.43/13.20 % 100.43/13.20 cnf(c6, axiom, % 100.43/13.20 subset(X4,X5) | member(sK1(X4,X5),X4)). % 100.43/13.20 cnf(a2, assumption, % 100.43/13.20 X0 = sK1(X4,X5)). % 100.43/13.20 cnf(a3, assumption, % 100.43/13.20 X3 = X4). % 100.43/13.20 cnf(c7, plain, % 100.43/13.20 $false, % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 100.43/13.20 cnf(c8, plain, % 100.43/13.20 subset(X4,X5), % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 100.43/13.20 % 100.43/13.20 cnf(c9, axiom, % 100.43/13.20 ~subset(sK3,union(sK4,sK5))). % 100.43/13.20 cnf(a4, assumption, % 100.43/13.20 X4 = sK3). % 100.43/13.20 cnf(a5, assumption, % 100.43/13.20 X5 = union(sK4,sK5)). % 100.43/13.20 cnf(c10, plain, % 100.43/13.20 $false, % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 100.43/13.20 cnf(c11, plain, % 100.43/13.20 $false, % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 100.43/13.20 % 100.43/13.20 cnf(c12, axiom, % 100.43/13.20 member(X6,X7) | ~member(X6,intersection(X8,X7))). % 100.43/13.20 cnf(a6, assumption, % 100.43/13.20 X0 = X6). % 100.43/13.20 cnf(a7, assumption, % 100.43/13.20 X1 = intersection(X8,X7)). % 100.43/13.20 cnf(c13, plain, % 100.43/13.20 member(X0,X2), % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a6, a7])], [c4, c12])). % 100.43/13.20 cnf(c14, plain, % 100.43/13.20 member(X6,X7), % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a6, a7])], [c4, c12])). % 100.43/13.20 % 100.43/13.20 cnf(c15, axiom, % 100.43/13.20 member(X9,union(X10,X11)) | ~member(X9,X11)). % 100.43/13.20 cnf(a8, assumption, % 100.43/13.20 X6 = X9). % 100.43/13.20 cnf(a9, assumption, % 100.43/13.20 X7 = X11). % 100.43/13.20 cnf(c16, plain, % 100.43/13.20 $false, % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a8, a9])], [c14, c15])). % 100.43/13.20 cnf(c17, plain, % 100.43/13.20 member(X9,union(X10,X11)), % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a8, a9])], [c14, c15])). % 100.43/13.20 % 100.43/13.20 cnf(c18, axiom, % 100.43/13.20 subset(X12,X13) | ~member(sK1(X12,X13),X13)). % 100.43/13.20 cnf(a10, assumption, % 100.43/13.20 X9 = sK1(X12,X13)). % 100.43/13.20 cnf(a11, assumption, % 100.43/13.20 union(X10,X11) = X13). % 100.43/13.20 cnf(c19, plain, % 100.43/13.20 $false, % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a10, a11])], [c17, c18])). % 100.43/13.20 cnf(c20, plain, % 100.43/13.20 subset(X12,X13), % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a10, a11])], [c17, c18])). % 100.43/13.20 % 100.43/13.20 cnf(c21, plain, % 100.43/13.20 ~subset(X4,X5)). % 100.43/13.20 cnf(a12, assumption, % 100.43/13.20 X12 = X4). % 100.43/13.20 cnf(a13, assumption, % 100.43/13.20 X13 = X5). % 100.43/13.20 cnf(c22, plain, % 100.43/13.20 $false, % 100.43/13.20 inference(predicate_reduction, [assumptions([a12, a13])], [c20, c21])). % 100.43/13.20 % 100.43/13.20 cnf(c23, axiom, % 100.43/13.20 member(X14,X15) | ~member(X14,intersection(X16,X15))). % 100.43/13.20 cnf(a14, assumption, % 100.43/13.20 X0 = X14). % 100.43/13.20 cnf(a15, assumption, % 100.43/13.20 X2 = intersection(X16,X15)). % 100.43/13.20 cnf(c24, plain, % 100.43/13.20 $false, % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a14, a15])], [c13, c23])). % 100.43/13.20 cnf(c25, plain, % 100.43/13.20 member(X14,X15), % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a14, a15])], [c13, c23])). % 100.43/13.20 % 100.43/13.20 cnf(c26, axiom, % 100.43/13.20 member(X17,union(X18,X19)) | ~member(X17,X18)). % 100.43/13.20 cnf(a16, assumption, % 100.43/13.20 X14 = X17). % 100.43/13.20 cnf(a17, assumption, % 100.43/13.20 X15 = X18). % 100.43/13.20 cnf(c27, plain, % 100.43/13.20 $false, % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a16, a17])], [c25, c26])). % 100.43/13.20 cnf(c28, plain, % 100.43/13.20 member(X17,union(X18,X19)), % 100.43/13.20 inference(strict_predicate_extension, [assumptions([a16, a17])], [c25, c26])). % 100.43/13.20 % 100.43/13.20 cnf(c29, plain, % 100.43/13.20 ~member(X9,union(X10,X11))). % 100.43/13.20 cnf(a18, assumption, % 100.43/13.20 X17 = X9). % 100.43/13.20 cnf(a19, assumption, % 100.43/13.20 union(X18,X19) = union(X10,X11)). % 100.43/13.20 cnf(c30, plain, % 100.43/13.20 $false, % 100.43/13.20 inference(predicate_reduction, [assumptions([a18, a19])], [c28, c29])). % 100.43/13.20 % 100.43/13.20 cnf(c31, plain, % 100.43/13.20 $false, % 100.43/13.20 inference(constraint_solving, [ % 100.43/13.20 bind(X0, sK1(X4,X5)), % 100.43/13.20 bind(X1, intersection(sK3,sK5)), % 100.43/13.20 bind(X2, intersection(sK3,sK4)), % 100.43/13.20 bind(X3, sK3), % 100.43/13.20 bind(X4, sK3), % 100.43/13.20 bind(X5, union(sK4,sK5)), % 100.43/13.20 bind(X6, sK1(X4,X5)), % 100.43/13.20 bind(X7, sK5), % 100.43/13.20 bind(X8, sK3), % 100.43/13.20 bind(X9, sK1(X4,X5)), % 100.43/13.20 bind(X10, sK4), % 100.43/13.20 bind(X11, sK5), % 100.43/13.20 bind(X12, sK3), % 100.43/13.20 bind(X13, union(sK4,sK5)), % 100.43/13.20 bind(X14, sK1(X4,X5)), % 100.43/13.20 bind(X15, sK4), % 100.43/13.20 bind(X16, sK3), % 100.43/13.20 bind(X17, sK1(X4,X5)), % 100.43/13.20 bind(X18, sK4), % 100.43/13.20 bind(X19, sK5) % 100.43/13.20 ], % 100.43/13.20 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 100.43/13.20 % 100.43/13.20 % SZS output end IncompleteProof %------------------------------------------------------------------------------